Package evaluation of Boscia on Julia 1.13.0-DEV.897 (a39797a4fb*) started at 2025-07-24T18:37:55.912 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.35s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [36b166db] + Boscia v0.1.39 Updating `~/.julia/environments/v1.13/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.0 ⌅ [0a1fb500] + BlockDiagonals v0.1.42 [f7b14807] + Bonobo v0.1.3 [36b166db] + Boscia v0.1.39 [d360d2e6] + ChainRulesCore v1.25.2 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.17.0 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.13.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v1.0.1 [f55ce6ea] + FrankWolfe v0.5.5 [c145ed77] + GenericSchur v0.5.5 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.42.0 [3b969827] + MathOptSetDistances v0.2.11 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [92933f4c] + ProgressMeter v1.10.4 [dc4f5ac2] + ProximalCore v0.1.2 [708f8203] + Richardson v1.4.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.14 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.1+1 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.14.1+1 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.7.15 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.5.1+0 [efcefdf7] + PCRE2_jll v10.45.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.65.0+0 [3f19e933] + p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 4.77s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 124.01s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_ZSA7hk/Project.toml` [4c88cf16] Aqua v0.8.13 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 [864edb3b] DataStructures v0.18.22 [31c24e10] Distributions v0.25.120 [497a8b3b] DoubleFloats v1.4.3 [f55ce6ea] FrankWolfe v0.5.5 [87dc4568] HiGHS v1.18.2 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.42.0 [3b969827] MathOptSetDistances v0.2.11 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.3 [10745b16] Statistics v1.11.1 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_ZSA7hk/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.13 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 [d360d2e6] ChainRulesCore v1.25.2 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.17.0 [187b0558] ConstructionBase v1.6.0 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.4.3 [e2ba6199] ExprTools v0.1.10 [1a297f60] FillArrays v1.13.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v1.0.1 [f55ce6ea] FrankWolfe v0.5.5 [14197337] GenericLinearAlgebra v0.3.18 [c145ed77] GenericSchur v0.5.5 [87dc4568] HiGHS v1.18.2 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.42.0 [3b969827] MathOptSetDistances v0.2.11 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [92933f4c] ProgressMeter v1.10.4 [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [708f8203] Richardson v1.4.2 [79098fc4] Rmath v0.8.0 [82193955] SCIP v0.12.7 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.1 [276daf66] SpecialFunctions v2.5.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.14 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.5 [4c63d2b9] StatsFuns v1.5.0 [856f2bd8] StructTypes v1.11.0 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.1+1 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.11.0+1 [e33a78d0] Hwloc_jll v2.12.1+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.600.201+0 [68e3532b] Ncurses_jll v6.5.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.2.13+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v900.200.200+0 [e5ac4fe4] SCIP_jll v900.200.200+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [1317d2d5] oneTBB_jll v2022.0.0+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.14.1+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.7.15 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.1+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 5592.7 ms ✓ StatsBase 11094.5 ms ✓ Distributions 2 dependencies successfully precompiled in 19 seconds. 45 already precompiled. Precompiling packages... 4011.6 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 4 seconds. 23 already precompiled. Precompiling packages... 4856.2 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 49 already precompiled. Precompiling packages... 5130.5 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 52 already precompiled. seed = 0x2dcce871f21fb008 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xe4a5c1446459596c seed = 0xe3a8d9f941678816 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: Polish solution seed = 0x5ee94d015a1d2dc2 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 3.008692e+00 3.127199e+00 1.185067e-01 3.938812e-02 1.639600e+01 1.829715e-01 6677 25 7 10 1 0 * 2 3 3.008692e+00 3.051834e+00 4.314166e-02 1.433901e-02 1.981700e+01 2.523086e-01 13 10 11 2 1 0 * 3 4 3.026376e+00 3.031696e+00 5.319699e-03 1.757779e-03 1.983500e+01 3.529115e-01 13 9 15 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.200304e+00 2.483644e+00 2.716659e+00 0.000000e+00 Inf 1 LD 3 3.031696e+00 3.031696e+00 0.000000e+00 2.116384e+00 1.417512e+00 1 Last 3 3.031696e+00 3.031696e+00 0.000000e+00 2.281891e+00 1.314699e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 3 3.031696e+00 3.031696e+00 0.000000e+00 2.286872e+00 1.311835e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.031695902049548 Dual Bound: 3.0263762027276533 Dual Gap (relative): 0.0017577785990717473 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 20 Total time (s): 23.723 LMO calls / sec: 0.8430636934620411 Nodes / sec: 0.29507229271171437 LMO calls / node: 2.857142857142857 Total number of global tightenings: 47 Global tightenings / node: 15.67 Total number of local tightenings: 47 Local tightenings / node: 15.67 Total number of potential local tightenings: 47 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.975248e+00 3.406416e+00 1.431168e+00 7.245510e-01 1.561400e+01 1.921353e-01 7157 286 41 96 25 0 100 69 2.784033e+00 3.406416e+00 6.223824e-01 2.235543e-01 2.547200e+01 6.634736e+00 39 29 1450 25 16 0 200 69 2.874285e+00 3.406416e+00 5.321307e-01 1.851350e-01 2.793300e+01 9.630187e+00 25 18 1857 19 11 0 300 71 2.929554e+00 3.406416e+00 4.768619e-01 1.627763e-01 3.059900e+01 1.212458e+01 29 21 2315 21 11 1 400 71 2.991157e+00 3.406416e+00 4.152588e-01 1.388288e-01 3.308600e+01 1.423563e+01 30 21 2753 20 7 0 500 71 3.043951e+00 3.406416e+00 3.624647e-01 1.190770e-01 3.547200e+01 1.609720e+01 25 18 3196 15 7 0 600 71 3.098002e+00 3.406416e+00 3.084133e-01 9.955232e-02 3.796700e+01 1.767324e+01 36 26 3658 25 9 1 700 71 3.149009e+00 3.406416e+00 2.574065e-01 8.174205e-02 4.075200e+01 1.891932e+01 39 28 4134 28 12 2 800 71 3.196981e+00 3.406416e+00 2.094341e-01 6.550996e-02 4.356100e+01 1.999495e+01 34 24 4636 23 7 3 900 71 3.238353e+00 3.406416e+00 1.680621e-01 5.189740e-02 4.631600e+01 2.096468e+01 27 19 5132 19 7 2 1000 61 3.295173e+00 3.406416e+00 1.112426e-01 3.375925e-02 4.905600e+01 2.162834e+01 45 33 5668 24 2 0 1095 34 3.377744e+00 3.406416e+00 2.867151e-02 8.488362e-03 5.138400e+01 2.197182e+01 18 12 6153 6 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.092551e+00 -4.485605e-01 8.541112e+00 0.000000e+00 Inf 1 LD 2 4.401482e+00 2.753428e+00 1.648055e+00 1.609171e-01 1.242876e+01 2 LD 5 3.406416e+00 3.406416e+00 0.000000e+00 4.091541e-01 1.222034e+01 1 Last 5 3.406416e+00 3.406416e+00 0.000000e+00 4.162994e-01 1.201059e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.406416e+00 3.406416e+00 0.000000e+00 4.201712e-01 1.189991e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.4064155806353513 Dual Bound: 3.377744066849172 Dual Gap (relative): 0.008488361823376648 Search Statistics. Total number of nodes processed: 1129 Total number of lmo calls: 6159 Total time (s): 53.342 LMO calls / sec: 115.46248734580631 Nodes / sec: 21.165310637021484 LMO calls / node: 5.455270150575731 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 2 Non zero entries: 25th entry: 0.15734798694399174 26th entry: 0.15734798694399174 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.105841e+00 3.406416e+00 1.300574e+00 6.176032e-01 3.420000e-01 8.771930e+00 338 277 41 96 25 0 100 46 2.840600e+00 3.406416e+00 5.658155e-01 1.991887e-01 1.001700e+01 1.457522e+01 39 29 1423 25 15 2 200 34 2.940678e+00 3.406416e+00 4.657379e-01 1.583777e-01 1.289200e+01 1.815079e+01 33 23 1876 22 10 0 300 35 3.072303e+00 3.406416e+00 3.341122e-01 1.087497e-01 1.694300e+01 1.977218e+01 34 25 2514 18 6 0 400 35 3.189427e+00 3.406416e+00 2.169885e-01 6.803369e-02 2.101300e+01 2.070147e+01 33 23 3177 25 12 3 500 32 3.289502e+00 3.406416e+00 1.169140e-01 3.554155e-02 2.538000e+01 2.096139e+01 29 22 3935 15 3 0 572 14 3.374287e+00 3.406416e+00 3.212854e-02 9.521578e-03 2.840100e+01 2.063308e+01 26 18 4499 18 5 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.092551e+00 -4.485605e-01 8.541112e+00 0.000000e+00 Inf 1 LD 2 4.401482e+00 2.753428e+00 1.648055e+00 1.523455e-03 1.312805e+03 2 LD 5 3.406416e+00 3.406416e+00 0.000000e+00 5.921112e-03 8.444360e+02 1 Last 5 3.406416e+00 3.406416e+00 0.000000e+00 1.342103e-02 3.725497e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.406416e+00 3.406416e+00 0.000000e+00 1.749440e-02 2.858057e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.4064155806353513 Dual Bound: 3.3742870433442764 Dual Gap (relative): 0.009521578003995805 Search Statistics. Total number of nodes processed: 586 Total number of lmo calls: 4505 Total time (s): 28.432 LMO calls / sec: 158.4482273494654 Nodes / sec: 20.61057962858751 LMO calls / node: 7.687713310580205 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 1 seed = 0x588b1fdda9ffb61b Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -2.557896e+02 -2.382655e+02 1.752410e+01 7.354864e-02 1.934900e+01 1.550468e-01 11550 141 43 3872 15 3 * 8 9 -2.555988e+02 -2.408642e+02 1.473463e+01 6.117403e-02 3.024100e+01 5.621507e-01 1392 103 268 1186 19 10 * 14 15 -2.551896e+02 -2.413076e+02 1.388191e+01 5.752786e-02 3.991300e+01 7.265803e-01 1670 84 437 1488 16 7 * 22 23 -2.551544e+02 -2.461057e+02 9.048625e+00 3.676723e-02 5.232900e+01 8.599438e-01 1327 94 692 1150 16 17 100 99 -2.543550e+02 -2.461057e+02 8.249251e+00 3.351913e-02 1.730280e+02 1.150103e+00 774 105 2945 595 20 7 200 199 -2.539237e+02 -2.461057e+02 7.817941e+00 3.176659e-02 3.420980e+02 1.166332e+00 1358 98 5914 1134 11 16 296 291 -2.536814e+02 -2.461057e+02 7.575637e+00 3.078204e-02 5.000050e+02 1.173988e+00 1827 98 8652 1619 13 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.873311e+02 4.828681e+02 4.462940e+00 0.000000e+00 Inf 1 LD 4 -2.392422e+02 -2.406254e+02 1.383207e+00 2.819262e-01 1.418811e+01 2 LD 82 -2.496030e+02 -2.502087e+02 6.057678e-01 4.882829e-01 1.679354e+02 3 LD 121 -2.512564e+02 -2.515537e+02 2.973380e-01 5.098541e-01 2.373228e+02 4 LD 160 -2.515567e+02 -2.516900e+02 1.333301e-01 5.307840e-01 3.014409e+02 5 LD 270 -2.516632e+02 -2.517296e+02 6.638839e-02 6.551357e-01 4.121283e+02 6 LD 365 -2.516804e+02 -2.517001e+02 1.971414e-02 6.972509e-01 5.234845e+02 7 LD 459 -2.516826e+02 -2.516881e+02 5.489344e-03 7.372975e-01 6.225438e+02 8 LD 612 -2.516829e+02 -2.516848e+02 1.873094e-03 8.060411e-01 7.592665e+02 9 LD 651 -2.516829e+02 -2.516834e+02 5.296655e-04 8.318399e-01 7.826025e+02 10 LD 742 -2.516829e+02 -2.516831e+02 1.283810e-04 8.816750e-01 8.415799e+02 10 LD 858 -2.516829e+02 -2.516830e+02 2.805060e-05 9.412642e-01 9.115400e+02 10 LD 967 -2.516829e+02 -2.516829e+02 6.751376e-06 9.957503e-01 9.711270e+02 10 P 1000 -2.516829e+02 -2.516829e+02 6.751376e-06 1.015091e+00 9.851330e+02 10 LD 1075 -2.516829e+02 -2.516829e+02 1.399655e-06 1.106904e+00 9.711773e+02 10 P 2000 -2.516829e+02 -2.516829e+02 1.399655e-06 2.003364e+00 9.983209e+02 10 P 3000 -2.516829e+02 -2.516829e+02 1.399655e-06 2.890286e+00 1.037959e+03 10 P 4000 -2.516829e+02 -2.516829e+02 1.399655e-06 3.683726e+00 1.085857e+03 10 P 5000 -2.516829e+02 -2.516829e+02 1.399655e-06 4.436896e+00 1.126914e+03 10 P 6000 -2.516829e+02 -2.516829e+02 1.399655e-06 5.201746e+00 1.153459e+03 10 P 7000 -2.516829e+02 -2.516829e+02 1.399655e-06 5.962937e+00 1.173918e+03 10 P 8000 -2.516829e+02 -2.516829e+02 1.399655e-06 6.723306e+00 1.189891e+03 10 P 9000 -2.516829e+02 -2.516829e+02 1.399655e-06 7.489998e+00 1.201602e+03 10 P 10000 -2.516829e+02 -2.516829e+02 1.399655e-06 8.281918e+00 1.207450e+03 10 Last 10001 -2.516829e+02 -2.516829e+02 4.780350e-07 8.286659e+00 1.206880e+03 10 ---------------------------------------------------------------------------------------------------------------- PP 10001 -2.516829e+02 -2.516829e+02 4.780351e-07 8.290246e+00 1.206357e+03 10 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -251.6829220284731 Dual Bound: -253.68137007733588 Dual Gap (relative): 0.007940340301026512 Search Statistics. Total number of nodes processed: 587 Total number of lmo calls: 8678 Total time (s): 510.001 LMO calls / sec: 17.01565291048449 Nodes / sec: 1.1509781353369897 LMO calls / node: 14.783645655877342 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 [ Info: Polish solution Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -2.454441e+02 -2.409653e+02 4.478780e+00 1.858683e-02 1.880000e+01 1.595745e-01 7456 85 13 18 3 2 * 3 4 -2.446870e+02 -2.425285e+02 2.158457e+00 8.899807e-03 1.962100e+01 3.567606e-01 76 55 31 14 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -1.358263e+02 -1.365109e+02 6.846384e-01 0.000000e+00 Inf 1 LD 2 -2.425285e+02 -2.425285e+02 0.000000e+00 1.740352e-01 1.149193e+01 1 Last 2 -2.425285e+02 -2.425285e+02 0.000000e+00 3.876055e-01 5.159885e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.425285e+02 -2.425285e+02 0.000000e+00 3.925977e-01 5.094274e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -242.52850175475373 Dual Bound: -244.6869586952211 Dual Gap (relative): 0.008899807341613065 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 36 Total time (s): 21.733 LMO calls / sec: 1.6564671237288915 Nodes / sec: 0.32209082961395114 LMO calls / node: 5.142857142857143 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Test Suite: Error During Test at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Got exception outside of a @test LoadError: invalid assignment to constant Main.groups. This redefinition may be permitted using the `const` keyword. Stacktrace: [1] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/poisson.jl:192 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:312 [3] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1858 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:312 [7] top-level scope @ none:6 [8] eval(m::Module, e::Any) @ Core ./boot.jl:489 [9] exec_options(opts::Base.JLOptions) @ Base ./client.jl:286 [10] _start() @ Base ./client.jl:553 in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/poisson.jl:192 Test Summary: | Pass Error Total Time Boscia Test Suite | 129 1 130 26m40.4s Norm hyperbox | 4 4 54.3s Norm hyperbox - strong branching | 2 2 48.1s Normbox - Shadow set activation | 4 4 24.7s Normbox - strong convexity and sharpness | 6 6 18.8s Start with Active Set | 2 2 18.3s Interface - sparse poisson regression | 4 4 24.2s Different FW variants | 10 10 58.9s Different line search types | 8 8 2m25.5s Lazification | 5 5 19.6s DICG - Lazification | 10 10 1m41.4s DICG - warm_start | 5 5 40.5s User stop | 2 2 15.3s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 24.4s BLMO - Strong Branching | 4 4 21.2s Probability Simplex LMO | 4 4 48.4s Unit Simplex LMO | 4 4 1m03.8s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 26.8s Hyperplane Aware Rounding - Unit Simplex | 2 2 27.5s Following Gradient Heuristic - Unit Simplex | 6 6 36.2s Rounding Heuristic - Unit Simplex | 3 3 36.9s Probability Rounding - Unit Cube | 2 2 22.1s Probability rounding - Probability Simplex | 3 3 21.2s Sparse Regression | 2 2 29.7s Sparse Regression Group | 7 7 1m25.4s Poisson sparse regression | 2 2 8m33.3s Hybrid branching poisson sparse regression | 3 3 25.1s RNG of the outermost testset: Xoshiro(0x840445e0f77fc4d3, 0x4263449f0586fc08, 0xf4e701ec0b0c9675, 0xbbd2257299c55d22, 0x3670237c73b93522) ERROR: LoadError: Some tests did not pass: 129 passed, 0 failed, 1 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Testing failed after 1635.93s ERROR: LoadError: Package Boscia errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2661 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2510 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:538 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:168 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:155 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:311 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:320 [12] _start() @ Base ./client.jl:553 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1805.16s: package tests unexpectedly errored