Package evaluation of Boscia on Julia 1.13.0-DEV.935 (f5c55e808c*) started at 2025-07-31T18:33:18.588 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.24s ################################################################################ # 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.18.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.15.0+0 [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.75s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 123.02s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_hcI0Ji/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.19.0 [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_hcI0Ji/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.18.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.19.0 [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 [8c4f8055] MathOptIIS v0.1.0 [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.15.0+0 [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... 5095.4 ms ✓ StatsBase 10577.3 ms ✓ Distributions 2 dependencies successfully precompiled in 18 seconds. 45 already precompiled. Precompiling packages... 3923.7 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 4 seconds. 23 already precompiled. Precompiling packages... 4548.6 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 49 already precompiled. Precompiling packages... 4797.8 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 7 seconds. 52 already precompiled. seed = 0xa66eee361b344222 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xde0bea1a35b1e57c seed = 0x5492a4685d8c930f [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: Polish solution seed = 0x444a868b3f84e59e 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 1.914445e+00 2.104830e+00 1.903848e-01 9.944649e-02 1.697600e+01 1.767201e-01 7041 51 13 13 5 0 * 3 4 1.945058e+00 2.064745e+00 1.196872e-01 6.153400e-02 2.035800e+01 3.438452e-01 22 17 32 11 3 0 21 4 2.047759e+00 2.064745e+00 1.698613e-02 8.294983e-03 2.064300e+01 1.211064e+00 8 6 102 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 3.938907e+00 9.289321e-01 3.009975e+00 0.000000e+00 Inf 1 LD 3 2.075891e+00 2.064498e+00 1.139279e-02 2.209604e+00 1.357710e+00 2 LD 5 2.064745e+00 2.064745e+00 0.000000e+00 2.378343e+00 2.102304e+00 1 Last 5 2.064745e+00 2.064745e+00 0.000000e+00 2.386655e+00 2.094982e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.064745e+00 2.064745e+00 0.000000e+00 2.390854e+00 2.091303e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.064745260082407 Dual Bound: 2.0477591327143077 Dual Gap (relative): 0.008294983085039015 Search Statistics. Total number of nodes processed: 25 Total number of lmo calls: 108 Total time (s): 24.646 LMO calls / sec: 4.3820498255294975 Nodes / sec: 1.0143633855392356 LMO calls / node: 4.32 Total number of global tightenings: 41 Global tightenings / node: 1.95 Total number of local tightenings: 54 Local tightenings / node: 2.57 Total number of potential local tightenings: 54 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.789756e+00 2.220039e+00 4.302829e-01 2.404142e-01 1.532000e+01 1.958225e-01 7101 147 23 43 10 1 100 19 2.163892e+00 2.220039e+00 5.614744e-02 2.594743e-02 2.036900e+01 5.842211e+00 24 19 737 11 6 0 135 18 2.199374e+00 2.220039e+00 2.066463e-02 9.395684e-03 2.135600e+01 7.164263e+00 8 6 900 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.108027e+00 -1.108836e+00 8.216863e+00 0.000000e+00 Inf 1 LD 3 2.417040e+00 2.184388e+00 2.326527e-01 2.562769e-01 1.170609e+01 2 LD 5 2.220039e+00 2.220039e+00 0.000000e+00 4.233296e-01 1.181113e+01 1 Last 5 2.220039e+00 2.220039e+00 0.000000e+00 4.323363e-01 1.156507e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.220039e+00 2.220039e+00 0.000000e+00 4.371502e-01 1.143772e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.2200390371429797 Dual Bound: 2.1993744092458627 Dual Gap (relative): 0.00939568443201202 Search Statistics. Total number of nodes processed: 153 Total number of lmo calls: 906 Total time (s): 23.449 LMO calls / sec: 38.637042091347176 Nodes / sec: 6.524798498869887 LMO calls / node: 5.921568627450981 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.17044393200685465 43th entry: 0.17044393200685465 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.854457e+00 2.220039e+00 3.655819e-01 1.971369e-01 1.890000e-01 1.587302e+01 185 153 23 43 10 1 80 8 2.199371e+00 2.220039e+00 2.066768e-02 9.397086e-03 4.859000e+00 1.811072e+01 29 22 690 16 7 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.108027e+00 -1.108836e+00 8.216863e+00 0.000000e+00 Inf 1 LD 3 2.417040e+00 2.184388e+00 2.326527e-01 1.125089e-03 2.666456e+03 2 LD 5 2.220039e+00 2.220039e+00 0.000000e+00 5.311627e-03 9.413312e+02 1 Last 5 2.220039e+00 2.220039e+00 0.000000e+00 1.271880e-02 3.931187e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.220039e+00 2.220039e+00 0.000000e+00 1.683928e-02 2.969247e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.2200390371429797 Dual Bound: 2.1993713543073876 Dual Gap (relative): 0.009397086487970831 Search Statistics. Total number of nodes processed: 88 Total number of lmo calls: 696 Total time (s): 4.888 LMO calls / sec: 142.38952536824877 Nodes / sec: 18.00327332242226 LMO calls / node: 7.909090909090909 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 = 0x6b68514ebd0f28ea 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 -3.606224e+02 -3.319986e+02 2.862380e+01 8.621662e-02 1.793300e+01 1.672894e-01 10113 125 40 2501 16 3 * 6 7 -3.605243e+02 -3.336893e+02 2.683508e+01 8.041938e-02 2.601300e+01 4.997501e-01 1371 80 196 1430 23 11 * 8 9 -3.603499e+02 -3.401871e+02 2.016277e+01 5.926966e-02 2.804400e+01 6.061903e-01 1018 83 254 998 19 7 * 21 22 -3.597994e+02 -3.402865e+02 1.951287e+01 5.734247e-02 4.058600e+01 1.059479e+00 904 91 652 700 13 6 * 28 29 -3.597337e+02 -3.447643e+02 1.496936e+01 4.341910e-02 5.210800e+01 1.093882e+00 1109 96 861 854 9 8 100 101 -3.589357e+02 -3.447643e+02 1.417144e+01 4.110471e-02 1.460740e+02 1.376015e+00 1333 100 2982 1073 14 6 200 199 -3.584279e+02 -3.447643e+02 1.366355e+01 3.963157e-02 2.861960e+02 1.394149e+00 1188 70 5866 1020 22 8 300 299 -3.581637e+02 -3.447643e+02 1.339937e+01 3.886531e-02 4.170990e+02 1.436110e+00 506 58 8797 418 16 6 355 354 -3.579972e+02 -3.447643e+02 1.323285e+01 3.838230e-02 5.000050e+02 1.417986e+00 1837 83 10404 1550 9 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 6.130113e+02 6.087137e+02 4.297579e+00 0.000000e+00 Inf 1 LD 5 -3.383336e+02 -3.392070e+02 8.733593e-01 2.913142e-01 1.716360e+01 2 LD 93 -3.505017e+02 -3.508929e+02 3.911714e-01 5.121646e-01 1.815823e+02 4 LD 148 -3.523214e+02 -3.524951e+02 1.737714e-01 5.424791e-01 2.728216e+02 6 LD 204 -3.531152e+02 -3.531644e+02 4.920920e-02 6.528145e-01 3.124931e+02 6 LD 245 -3.531691e+02 -3.531810e+02 1.186512e-02 6.713108e-01 3.649576e+02 6 LD 314 -3.531752e+02 -3.531781e+02 2.930977e-03 7.030768e-01 4.466084e+02 7 LD 383 -3.531756e+02 -3.531764e+02 8.222240e-04 7.306950e-01 5.241585e+02 7 LD 442 -3.531756e+02 -3.531758e+02 2.345540e-04 7.559784e-01 5.846728e+02 7 LD 503 -3.531756e+02 -3.531757e+02 6.920263e-05 7.809509e-01 6.440866e+02 7 LD 569 -3.531756e+02 -3.531756e+02 1.964027e-05 8.141297e-01 6.989059e+02 7 LD 637 -3.531756e+02 -3.531756e+02 5.465701e-06 8.534562e-01 7.463769e+02 7 LD 691 -3.531756e+02 -3.531756e+02 1.514330e-06 8.835659e-01 7.820583e+02 7 LD 749 -3.531756e+02 -3.531756e+02 3.980777e-07 9.174924e-01 8.163556e+02 7 P 1000 -3.531756e+02 -3.531756e+02 3.980777e-07 1.053457e+00 9.492561e+02 7 P 2000 -3.531756e+02 -3.531756e+02 3.980777e-07 1.658117e+00 1.206187e+03 7 P 3000 -3.531756e+02 -3.531756e+02 3.980777e-07 2.137937e+00 1.403222e+03 7 P 4000 -3.531756e+02 -3.531756e+02 3.980777e-07 2.562298e+00 1.561099e+03 7 P 5000 -3.531756e+02 -3.531756e+02 3.980777e-07 2.942277e+00 1.699364e+03 7 P 6000 -3.531756e+02 -3.531756e+02 3.980777e-07 3.315683e+00 1.809582e+03 7 P 7000 -3.531756e+02 -3.531756e+02 3.980777e-07 3.685488e+00 1.899342e+03 7 P 8000 -3.531756e+02 -3.531756e+02 3.980777e-07 4.060058e+00 1.970415e+03 7 P 9000 -3.531756e+02 -3.531756e+02 3.980777e-07 4.437745e+00 2.028057e+03 7 P 10000 -3.531756e+02 -3.531756e+02 3.980777e-07 4.805530e+00 2.080936e+03 7 Last 10001 -3.531756e+02 -3.531756e+02 1.852288e-07 4.809658e+00 2.079358e+03 7 ---------------------------------------------------------------------------------------------------------------- PP 10001 -3.531756e+02 -3.531756e+02 1.852288e-07 4.813164e+00 2.077843e+03 7 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -353.1755927091333 Dual Bound: -357.99715613057674 Dual Gap (relative): 0.013652028965133962 Search Statistics. Total number of nodes processed: 709 Total number of lmo calls: 10429 Total time (s): 506.651 LMO calls / sec: 20.58418911637399 Nodes / sec: 1.3993853757320127 LMO calls / node: 14.709449929478138 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 -3.307851e+02 -3.268396e+02 3.945468e+00 1.207157e-02 1.940200e+01 1.546232e-01 7735 76 12 13 4 1 * 5 6 -3.298057e+02 -3.279970e+02 1.808682e+00 5.514325e-03 2.071400e+01 5.310418e-01 61 46 44 10 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.728059e+02 -1.735011e+02 6.951804e-01 0.000000e+00 Inf 1 LD 2 -3.279970e+02 -3.279970e+02 0.000000e+00 1.740177e-01 1.149308e+01 1 Last 2 -3.279970e+02 -3.279970e+02 0.000000e+00 3.712038e-01 5.387876e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -3.279970e+02 -3.279970e+02 0.000000e+00 3.760571e-01 5.318341e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -327.99704841049817 Dual Bound: -329.8057308028015 Dual Gap (relative): 0.005514325208316305 Search Statistics. Total number of nodes processed: 11 Total number of lmo calls: 49 Total time (s): 22.831 LMO calls / sec: 2.146204721650388 Nodes / sec: 0.4818010599623319 LMO calls / node: 4.454545454545454 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:1859 [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 25m48.4s Norm hyperbox | 4 4 52.9s Norm hyperbox - strong branching | 2 2 46.8s Normbox - Shadow set activation | 4 4 23.1s Normbox - strong convexity and sharpness | 6 6 18.2s Start with Active Set | 2 2 19.0s Interface - sparse poisson regression | 4 4 24.9s Different FW variants | 10 10 1m07.6s Different line search types | 8 8 2m27.6s Lazification | 5 5 20.3s DICG - Lazification | 10 10 1m03.8s DICG - warm_start | 5 5 55.7s User stop | 2 2 14.0s Linear feasible | 4 4 0.1s Integer bounds | 10 10 0.1s Cube LMO | 4 4 24.0s BLMO - Strong Branching | 4 4 21.8s Probability Simplex LMO | 4 4 51.9s Unit Simplex LMO | 4 4 1m11.7s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 25.9s Hyperplane Aware Rounding - Unit Simplex | 2 2 30.0s Following Gradient Heuristic - Unit Simplex | 6 6 39.3s Rounding Heuristic - Unit Simplex | 3 3 39.9s Probability Rounding - Unit Cube | 2 2 22.7s Probability rounding - Probability Simplex | 3 3 22.1s Sparse Regression | 2 2 30.1s Sparse Regression Group | 7 7 32.0s Poisson sparse regression | 2 2 8m30.1s Hybrid branching poisson sparse regression | 3 3 26.4s RNG of the outermost testset: Xoshiro(0x89291359746ff2a4, 0x6bed3f48d3fb757b, 0xf9a4da6260e63434, 0xff75e8e11745c6a9, 0xa962734777c9c6b8) 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 1581.74s 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:2695 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2544 [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] kwcall(::@NamedTuple{julia_args::Cmd, io::IOContext{IO}}, ::typeof(Pkg.API.test), ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:515 [6] 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 [7] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:157 [8] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [9] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [inlined] [10] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkg::String) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:155 [11] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [12] include(mod::Module, _path::String) @ Base ./Base.jl:311 [13] exec_options(opts::Base.JLOptions) @ Base ./client.jl:320 [14] _start() @ Base ./client.jl:553 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1746.03s: package tests unexpectedly errored