Package evaluation of Boscia on Julia 1.13.0-DEV.843 (7634fdf1d6*) started at 2025-07-10T18:34:42.871 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.54s ################################################################################ # 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.3 [c145ed77] + GenericSchur v0.5.5 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [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.13 [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.12.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.12.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.5.20 [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.29s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 120.02s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_7EzMoO/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.3 [87dc4568] HiGHS v1.18.1 [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.12.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_7EzMoO/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.3 [14197337] GenericLinearAlgebra v0.3.17 [c145ed77] GenericSchur v0.5.5 [87dc4568] HiGHS v1.18.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [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.13 [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.12.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.12.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.5.20 [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... 11632.0 ms ✓ Distributions 1 dependency successfully precompiled in 14 seconds. 46 already precompiled. Precompiling packages... 3915.8 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 4 seconds. 23 already precompiled. Precompiling packages... 5315.0 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 7 seconds. 49 already precompiled. Precompiling packages... 5477.5 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 7 seconds. 52 already precompiled. seed = 0xab7e5a302162c778 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x077b9f301e643b01 seed = 0xfcc6fe1ba19d09ac [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xe18676978ae0a885 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 4.172950e+00 4.391549e+00 2.185993e-01 5.238483e-02 1.954000e+01 1.535312e-01 7713 55 13 17 6 0 * 3 4 4.201325e+00 4.371785e+00 1.704601e-01 4.057293e-02 2.320500e+01 3.016591e-01 40 30 32 9 4 0 * 5 6 4.239082e+00 4.370991e+00 1.319083e-01 3.111719e-02 2.327700e+01 4.725695e-01 32 22 47 9 5 0 29 8 4.328728e+00 4.370991e+00 4.226262e-02 9.763289e-03 2.370500e+01 1.560852e+00 8 5 133 0 1 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 7.409311e+00 3.087042e+00 4.322269e+00 0.000000e+00 Inf 1 LD 3 4.370991e+00 4.370991e+00 0.000000e+00 2.213732e+00 1.355178e+00 1 Last 3 4.370991e+00 4.370991e+00 0.000000e+00 2.408273e+00 1.245706e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 3 4.370991e+00 4.370991e+00 0.000000e+00 2.412819e+00 1.243359e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 4.370990617018916 Dual Bound: 4.328727994174052 Dual Gap (relative): 0.00976328910057276 Search Statistics. Total number of nodes processed: 37 Total number of lmo calls: 138 Total time (s): 27.942 LMO calls / sec: 4.938801803736311 Nodes / sec: 1.3241714981032138 LMO calls / node: 3.72972972972973 Total number of global tightenings: 42 Global tightenings / node: 1.45 Total number of local tightenings: 46 Local tightenings / node: 1.59 Total number of potential local tightenings: 46 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.005990e+00 2.618007e+00 6.120163e-01 3.050943e-01 1.811200e+01 1.656360e-01 8673 227 32 67 17 1 * 2 3 2.005990e+00 2.610930e+00 6.049394e-01 3.015664e-01 1.825500e+01 2.738976e-01 133 105 48 59 16 4 * 3 4 2.031531e+00 2.603407e+00 5.718755e-01 2.814997e-01 1.833300e+01 3.818251e-01 72 55 64 22 10 0 100 37 2.421655e+00 2.603407e+00 1.817517e-01 7.505269e-02 2.410400e+01 5.683704e+00 30 22 869 11 7 1 200 37 2.528943e+00 2.603407e+00 7.446384e-02 2.944465e-02 2.710200e+01 8.744742e+00 26 19 1329 13 8 4 261 36 2.577876e+00 2.603407e+00 2.553037e-02 9.903644e-03 2.863600e+01 1.037156e+01 8 6 1588 0 1 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 7.505190e+00 -9.805345e-01 8.485724e+00 0.000000e+00 Inf 1 LD 2 3.569263e+00 2.121028e+00 1.448235e+00 1.835211e-01 1.089793e+01 2 LD 5 2.603407e+00 2.603407e+00 0.000000e+00 4.658038e-01 1.073413e+01 1 Last 5 2.603407e+00 2.603407e+00 0.000000e+00 4.744234e-01 1.053911e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.603407e+00 2.603407e+00 0.000000e+00 4.791339e-01 1.043550e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.603406595911119 Dual Bound: 2.577876226905854 Dual Gap (relative): 0.009903644224186886 Search Statistics. Total number of nodes processed: 297 Total number of lmo calls: 1594 Total time (s): 30.944 LMO calls / sec: 51.512409513960705 Nodes / sec: 9.597983453981387 LMO calls / node: 5.367003367003367 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 Non zero entries: 20th entry: 0.1565560976284681 35th entry: 0.1565560976284681 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.063520e+00 2.618007e+00 5.544862e-01 2.687089e-01 2.630000e-01 1.140684e+01 260 213 32 67 17 1 * 2 3 2.063520e+00 2.610930e+00 5.474093e-01 2.652793e-01 4.110000e-01 1.216545e+01 137 109 48 59 16 4 * 3 4 2.086085e+00 2.603407e+00 5.173218e-01 2.479870e-01 4.910000e-01 1.425662e+01 74 56 64 22 10 0 100 22 2.448239e+00 2.603407e+00 1.551673e-01 6.337914e-02 6.081000e+00 2.006249e+01 26 19 854 16 8 0 176 13 2.577823e+00 2.603407e+00 2.558363e-02 9.924511e-03 8.914000e+00 2.120260e+01 34 25 1311 17 8 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 7.505190e+00 -9.805345e-01 8.485724e+00 0.000000e+00 Inf 1 LD 2 3.569263e+00 2.121028e+00 1.448235e+00 1.245428e-03 1.605874e+03 2 LD 5 2.603407e+00 2.603407e+00 0.000000e+00 6.110961e-03 8.182019e+02 1 Last 5 2.603407e+00 2.603407e+00 0.000000e+00 1.412850e-02 3.538945e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.603407e+00 2.603407e+00 0.000000e+00 1.839455e-02 2.718196e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.603406595911119 Dual Bound: 2.5778229638597607 Dual Gap (relative): 0.009924510879929401 Search Statistics. Total number of nodes processed: 189 Total number of lmo calls: 1317 Total time (s): 8.946 LMO calls / sec: 147.2166331321261 Nodes / sec: 21.126760563380284 LMO calls / node: 6.968253968253968 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 seed = 0x617bfd1bafb9240f 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 -1.361696e+03 -1.327498e+03 3.419775e+01 2.576105e-02 1.808600e+01 1.658742e-01 8679 92 28 426 5 4 100 101 -1.353379e+03 -1.327498e+03 2.588118e+01 1.949620e-02 7.416600e+01 2.710137e+00 568 68 2054 407 9 8 * 108 109 -1.353319e+03 -1.329294e+03 2.402447e+01 1.807310e-02 8.035900e+01 2.700382e+00 1605 98 2223 1245 14 16 200 197 -1.351727e+03 -1.329294e+03 2.243284e+01 1.687576e-02 1.336340e+02 2.970801e+00 302 73 4045 190 10 13 300 289 -1.350918e+03 -1.329294e+03 2.162364e+01 1.626701e-02 1.889950e+02 3.116485e+00 359 55 5969 268 10 6 * 349 2 -1.350479e+03 -1.350478e+03 3.391254e-04 2.511150e-07 2.163530e+02 3.147634e+00 84 29 6828 45 6 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.796241e+03 1.791824e+03 4.417569e+00 0.000000e+00 Inf 1 LD 6 -1.345013e+03 -1.346111e+03 1.097914e+00 3.972898e-01 1.510232e+01 2 LD 30 -1.350050e+03 -1.350392e+03 3.424462e-01 5.998271e-01 5.001441e+01 2 LD 48 -1.350353e+03 -1.350477e+03 1.237441e-01 6.139687e-01 7.817988e+01 4 LD 90 -1.350450e+03 -1.350488e+03 3.738969e-02 6.394969e-01 1.407356e+02 6 LD 182 -1.350474e+03 -1.350491e+03 1.787821e-02 6.789925e-01 2.680442e+02 7 LD 258 -1.350477e+03 -1.350485e+03 8.588378e-03 7.090182e-01 3.638835e+02 7 LD 336 -1.350477e+03 -1.350480e+03 2.806774e-03 7.448402e-01 4.511035e+02 8 LD 489 -1.350478e+03 -1.350479e+03 1.263236e-03 8.231374e-01 5.940685e+02 8 LD 628 -1.350478e+03 -1.350478e+03 6.169368e-04 8.977471e-01 6.995288e+02 8 LD 761 -1.350478e+03 -1.350478e+03 2.997483e-04 9.700505e-01 7.844952e+02 8 LD 907 -1.350478e+03 -1.350478e+03 9.790367e-05 1.052779e+00 8.615296e+02 9 P 1000 -1.350478e+03 -1.350478e+03 9.790367e-05 1.104102e+00 9.057131e+02 9 LD 1052 -1.350478e+03 -1.350478e+03 2.955885e-05 1.207166e+00 8.714626e+02 9 LD 1217 -1.350478e+03 -1.350478e+03 9.688851e-06 1.297076e+00 9.382640e+02 9 LD 1383 -1.350478e+03 -1.350478e+03 3.705192e-06 1.385593e+00 9.981284e+02 9 LD 1561 -1.350478e+03 -1.350478e+03 1.238769e-06 1.562107e+00 9.992914e+02 9 P 2000 -1.350478e+03 -1.350478e+03 1.238769e-06 1.752905e+00 1.140963e+03 9 P 3000 -1.350478e+03 -1.350478e+03 1.238769e-06 2.236864e+00 1.341164e+03 9 P 4000 -1.350478e+03 -1.350478e+03 1.238769e-06 2.633247e+00 1.519037e+03 9 P 5000 -1.350478e+03 -1.350478e+03 1.238769e-06 2.989044e+00 1.672776e+03 9 P 6000 -1.350478e+03 -1.350478e+03 1.238769e-06 3.358149e+00 1.786698e+03 9 P 7000 -1.350478e+03 -1.350478e+03 1.238769e-06 3.738813e+00 1.872252e+03 9 P 8000 -1.350478e+03 -1.350478e+03 1.238769e-06 4.121387e+00 1.941094e+03 9 P 9000 -1.350478e+03 -1.350478e+03 1.238769e-06 4.503905e+00 1.998266e+03 9 P 10000 -1.350478e+03 -1.350478e+03 1.238769e-06 4.883052e+00 2.047899e+03 9 Last 10001 -1.350478e+03 -1.350478e+03 1.238769e-06 4.887593e+00 2.046202e+03 9 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.350478e+03 -1.350478e+03 1.605172e-06 4.891252e+00 2.044671e+03 9 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -1350.478230634764 Dual Bound: -1350.4785697601471 Dual Gap (relative): 2.511150312637594e-7 Search Statistics. Total number of nodes processed: 681 Total number of lmo calls: 6855 Total time (s): 223.287 LMO calls / sec: 30.700399038009376 Nodes / sec: 3.0498864689838636 LMO calls / node: 10.066079295154186 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 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Hybrid branching poisson sparse regression: Error During Test at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/poisson.jl:99 Got exception outside of a @test AssertionError: lower_bound <= tree.incumbent + dual_gap : -1039.4104273526514 <= -1040.5400163045758 Stacktrace: [1] evaluate_node!(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##67"{Float64}, var"#grad!#grad!##25"{Float64}, Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/node.jl:395 [2] optimize!(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##67"{Float64}, var"#grad!#grad!##25"{Float64}, Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}; callback::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#39#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}}) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/custom_bonobo.jl:35 [3] solve(f::var"#f#f##67"{Float64}, grad!::var"#grad!#grad!##25"{Float64}, blmo::Boscia.MathOptBLMO{SCIP.Optimizer}; traverse_strategy::Bonobo.BestFirstSearch, branching_strategy::Boscia.PartialStrongBranching{Boscia.MathOptBLMO{HiGHS.Optimizer}}, variant::Boscia.BPCG, line_search::FrankWolfe.Secant{FrankWolfe.var"#Secant##2#Secant##3", FrankWolfe.Adaptive{Float64, Int64, FrankWolfe.var"#Adaptive##4#Adaptive##5"}}, active_set::Nothing, lazy::Bool, lazy_tolerance::Float64, fw_epsilon::Float64, verbose::Bool, dual_gap::Float64, rel_dual_gap::Float64, time_limit::Float64, node_limit::Float64, print_iter::Int64, dual_gap_decay_factor::Float64, max_fw_iter::Int64, min_number_lower::Float64, min_node_fw_epsilon::Float64, use_postsolve::Bool, min_fw_iterations::Int64, max_iteration_post::Int64, dual_tightening::Bool, global_dual_tightening::Bool, bnb_callback::Nothing, strong_convexity::Float64, sharpness_constant::Float64, sharpness_exponent::Float64, domain_oracle::typeof(Boscia._trivial_domain), find_domain_point::typeof(Boscia._trivial_domain_point), start_solution::Nothing, fw_verbose::Bool, use_shadow_set::Bool, custom_heuristics::Vector{Boscia.Heuristic{Boscia.var"#Heuristic##0#Heuristic##1"}}, rounding_prob::Float64, clean_solutions::Bool, max_clean_iter::Int64, use_strong_lazy::Bool, use_DICG_warm_start::Bool, use_strong_warm_start::Bool, build_dicg_start_point::typeof(Boscia.trivial_build_dicg_start_point), kwargs::@Kwargs{}) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/interface.jl:344 [4] #solve#122 @ ~/.julia/packages/Boscia/qQ4D3/src/MOI_bounded_oracle.jl:762 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/poisson.jl:100 [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1855 [inlined] [7] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/poisson.jl:167 [inlined] [8] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [9] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:26 [inlined] [10] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1855 [inlined] [11] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [12] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [13] top-level scope @ none:6 [14] eval(m::Module, e::Any) @ Core ./boot.jl:489 [15] exec_options(opts::Base.JLOptions) @ Base ./client.jl:286 [16] _start() @ Base ./client.jl:553 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:310 [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:1855 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [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 | 126 2 128 21m59.3s Norm hyperbox | 4 4 58.0s Norm hyperbox - strong branching | 2 2 51.2s Normbox - Shadow set activation | 4 4 27.4s Normbox - strong convexity and sharpness | 6 6 20.5s Start with Active Set | 2 2 21.0s Interface - sparse poisson regression | 4 4 27.6s Different FW variants | 10 10 1m08.4s Different line search types | 8 8 2m29.5s Lazification | 5 5 21.6s DICG - Lazification | 10 10 1m17.7s DICG - warm_start | 5 5 40.1s User stop | 2 2 17.3s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 27.0s BLMO - Strong Branching | 4 4 24.5s Probability Simplex LMO | 4 4 1m02.1s Unit Simplex LMO | 4 4 1m07.4s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 28.3s Hyperplane Aware Rounding - Unit Simplex | 2 2 31.6s Following Gradient Heuristic - Unit Simplex | 6 6 40.5s Rounding Heuristic - Unit Simplex | 3 3 38.5s Probability Rounding - Unit Cube | 2 2 25.4s Probability rounding - Probability Simplex | 3 3 24.8s Sparse Regression | 2 2 33.6s Sparse Regression Group | 7 7 43.7s Poisson sparse regression | 2 2 3m46.8s Hybrid branching poisson sparse regression | 1 1 21.4s RNG of the outermost testset: Xoshiro(0x49ec534d3980b129, 0x4cdaacad51ed1e5a, 0x7d1ac4eaf32ffa22, 0x7a404b75ea8d14a6, 0xf9c4422559137f6b) ERROR: LoadError: Some tests did not pass: 126 passed, 0 failed, 2 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Testing failed after 1352.83s 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:2446 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2301 [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:500 [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:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:151 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:309 [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 1510.99s: package tests unexpectedly errored