Package evaluation of Boscia on Julia 1.13.0-DEV.1080 (ed57414aec*) started at 2025-09-04T18:11:23.858 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.36s ################################################################################ # 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.26.0 [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.1.0 [f55ce6ea] + FrankWolfe v0.5.6 [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.43.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.3 [21216c6a] + Preferences v1.5.0 [92933f4c] + ProgressMeter v1.11.0 [dc4f5ac2] + ProximalCore v0.1.2 [708f8203] + Richardson v1.4.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.15 [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+1 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.8.12 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.2+0 [efcefdf7] + PCRE2_jll v10.46.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.67.0+0 [3f19e933] + p7zip_jll v17.6.0+0 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.65s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 172.82s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_xtSMdN/Project.toml` [4c88cf16] Aqua v0.8.14 [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.6 [87dc4568] HiGHS v1.19.0 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.43.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_xtSMdN/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [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.26.0 [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.1.0 [f55ce6ea] FrankWolfe v0.5.6 [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.1 [b8f27783] MathOptInterface v1.43.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.3 [21216c6a] Preferences v1.5.0 [92933f4c] ProgressMeter v1.11.0 [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.2 [276daf66] SpecialFunctions v2.5.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.6 [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.2+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+0 [94ce4f54] Libiconv_jll v1.18.0+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 ⌅ [02c8fc9c] XML2_jll v2.13.6+1 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+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+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.8.12 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.2+0 [efcefdf7] PCRE2_jll v10.46.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.67.0+0 [3f19e933] p7zip_jll v17.6.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 13786.2 ms ✓ Distributions 1 dependency successfully precompiled in 16 seconds. 46 already precompiled. Precompiling packages... 4504.2 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 52 already precompiled. Precompiling packages... 4321.8 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 5 seconds. 49 already precompiled. seed = 0xe832307fe7c5b955 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x0abde85c51bbe21b seed = 0x78cbd598b722e308 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x2bb347e6ee6c4b8e 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 2.275174e+00 2.300835e+00 2.566143e-02 1.127889e-02 1.713900e+01 1.750394e-01 7105 42 10 12 1 1 3 0 2.300835e+00 2.300835e+00 0.000000e+00 0.000000e+00 2.036500e+01 1.473116e-01 12 8 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 8.072516e+00 -2.675427e-01 8.340059e+00 0.000000e+00 Inf 1 LD 3 2.436737e+00 2.296503e+00 1.402340e-01 2.031970e+00 1.476400e+00 2 LD 5 2.300835e+00 2.300835e+00 0.000000e+00 2.188453e+00 2.284719e+00 1 Last 5 2.300835e+00 2.300835e+00 0.000000e+00 2.195793e+00 2.277082e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.300835e+00 2.300835e+00 0.000000e+00 2.199729e+00 2.273008e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 2.3008353933297996 Dual Bound: 2.3008353933297996 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 21 Total time (s): 24.171 LMO calls / sec: 0.8688097306689835 Nodes / sec: 0.12411567580985479 LMO calls / node: 7.0 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: 49 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 3.350804e+00 4.296318e+00 9.455136e-01 2.821751e-01 1.499700e+01 2.000400e-01 7036 207 30 62 17 1 100 39 3.986476e+00 4.296318e+00 3.098419e-01 7.772325e-02 2.216100e+01 6.272280e+00 25 18 1053 17 9 0 200 39 4.106046e+00 4.296318e+00 1.902718e-01 4.633941e-02 2.455100e+01 9.734838e+00 31 22 1513 22 10 0 300 39 4.181272e+00 4.296318e+00 1.150457e-01 2.751452e-02 2.707700e+01 1.251985e+01 36 26 1963 25 11 0 400 39 4.246665e+00 4.296318e+00 4.965236e-02 1.169208e-02 2.968600e+01 1.478812e+01 28 20 2418 28 10 3 419 36 4.256700e+00 4.296318e+00 3.961761e-02 9.307119e-03 3.019000e+01 1.507122e+01 8 5 2510 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 1.119615e+01 1.873052e+00 9.323103e+00 0.000000e+00 Inf 1 LD 3 4.296318e+00 4.296318e+00 0.000000e+00 2.474299e-01 1.212465e+01 1 Last 3 4.296318e+00 4.296318e+00 0.000000e+00 4.150669e-01 7.227751e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 3 4.296318e+00 4.296318e+00 0.000000e+00 4.185350e-01 7.167859e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 4.296317664817191 Dual Bound: 4.256700049841923 Dual Gap (relative): 0.009307119249978414 Search Statistics. Total number of nodes processed: 455 Total number of lmo calls: 2515 Total time (s): 32.25 LMO calls / sec: 77.98449612403101 Nodes / sec: 14.108527131782946 LMO calls / node: 5.527472527472527 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: 13th entry: 0.1731826443401463 39th entry: 0.1731826443401463 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 3.516811e+00 4.296318e+00 7.795071e-01 2.216517e-01 2.400000e-01 1.250000e+01 237 196 30 62 17 1 100 17 4.145514e+00 4.296318e+00 1.508040e-01 3.637764e-02 7.488000e+00 1.562500e+01 32 24 1104 19 10 0 166 16 4.254936e+00 4.296318e+00 4.138131e-02 9.725483e-03 1.021500e+01 1.781694e+01 36 26 1579 25 11 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.119615e+01 1.873052e+00 9.323103e+00 0.000000e+00 Inf 1 LD 3 4.296318e+00 4.296318e+00 0.000000e+00 1.464355e-03 2.048684e+03 1 Last 3 4.296318e+00 4.296318e+00 0.000000e+00 8.072310e-03 3.716408e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 3 4.296318e+00 4.296318e+00 0.000000e+00 1.360053e-02 2.205797e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 4.296317664817191 Dual Bound: 4.254936353518555 Dual Gap (relative): 0.009725483029708881 Search Statistics. Total number of nodes processed: 182 Total number of lmo calls: 1584 Total time (s): 10.242 LMO calls / sec: 154.65729349736378 Nodes / sec: 17.769966803358717 LMO calls / node: 8.703296703296703 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 = 0x6600c61423343935 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.934273e+02 -1.729713e+02 2.045602e+01 1.182625e-01 1.533200e+01 1.956692e-01 7436 101 33 424 18 1 * 8 9 -1.934229e+02 -1.731144e+02 2.030847e+01 1.173124e-01 2.138800e+01 7.948382e-01 1003 90 238 793 15 18 * 9 10 -1.934214e+02 -1.737939e+02 1.962750e+01 1.129355e-01 2.374600e+01 8.001348e-01 2353 116 277 2092 24 5 * 16 17 -1.933125e+02 -1.752167e+02 1.809581e+01 1.032767e-01 3.616300e+01 9.125349e-01 809 97 497 619 20 18 * 20 21 -1.933110e+02 -1.752496e+02 1.806137e+01 1.030608e-01 4.442600e+01 9.228830e-01 3026 132 631 2874 28 11 * 21 22 -1.933099e+02 -1.764151e+02 1.689476e+01 9.576706e-02 4.645200e+01 9.256867e-01 2018 113 662 1801 27 8 * 31 32 -1.933051e+02 -1.778332e+02 1.547186e+01 8.700207e-02 5.864600e+01 1.074242e+00 1622 109 961 1356 17 6 100 101 -1.928392e+02 -1.778332e+02 1.500597e+01 8.438225e-02 1.749640e+02 1.148808e+00 2922 139 3081 2684 25 7 * 175 168 -1.926147e+02 -1.914420e+02 1.172773e+00 6.125996e-03 2.926300e+02 1.192632e+00 344 41 5308 292 11 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 3.999782e+02 3.954540e+02 4.524192e+00 0.000000e+00 Inf 1 LD 5 -1.893832e+02 -1.899257e+02 5.425049e-01 3.720081e-01 1.344057e+01 2 LD 263 -1.914142e+02 -1.916692e+02 2.549876e-01 6.438495e-01 4.084805e+02 6 LD 285 -1.914339e+02 -1.915579e+02 1.239863e-01 6.554446e-01 4.348194e+02 6 LD 322 -1.914401e+02 -1.914887e+02 4.861492e-02 6.748883e-01 4.771160e+02 7 LD 377 -1.914415e+02 -1.914627e+02 2.118103e-02 7.073498e-01 5.329753e+02 8 LD 436 -1.914419e+02 -1.914512e+02 9.290869e-03 7.459799e-01 5.844661e+02 10 LD 508 -1.914419e+02 -1.914461e+02 4.144462e-03 7.880575e-01 6.446230e+02 11 LD 609 -1.914420e+02 -1.914437e+02 1.755456e-03 8.439583e-01 7.215996e+02 12 LD 712 -1.914420e+02 -1.914427e+02 6.928918e-04 9.006757e-01 7.905176e+02 13 LD 867 -1.914420e+02 -1.914423e+02 3.081536e-04 9.784186e-01 8.861238e+02 13 P 1000 -1.914420e+02 -1.914423e+02 3.081536e-04 1.045552e+00 9.564322e+02 13 LD 1025 -1.914420e+02 -1.914421e+02 1.265427e-04 1.115114e+00 9.191885e+02 13 LD 1184 -1.914420e+02 -1.914420e+02 5.690772e-05 1.193972e+00 9.916482e+02 13 LD 1343 -1.914420e+02 -1.914420e+02 2.531777e-05 1.274639e+00 1.053632e+03 13 LD 1502 -1.914420e+02 -1.914420e+02 1.097538e-05 1.353138e+00 1.110012e+03 13 LD 1654 -1.914420e+02 -1.914420e+02 4.919554e-06 1.497206e+00 1.104725e+03 13 LD 1820 -1.914420e+02 -1.914420e+02 2.197343e-06 1.555132e+00 1.170319e+03 13 P 2000 -1.914420e+02 -1.914420e+02 2.197343e-06 1.683534e+00 1.187977e+03 13 P 3000 -1.914420e+02 -1.914420e+02 2.197343e-06 2.512403e+00 1.194076e+03 13 P 4000 -1.914420e+02 -1.914420e+02 2.197343e-06 3.229370e+00 1.238632e+03 13 P 5000 -1.914420e+02 -1.914420e+02 2.197343e-06 3.964997e+00 1.261035e+03 13 P 6000 -1.914420e+02 -1.914420e+02 2.197343e-06 4.698668e+00 1.276958e+03 13 P 7000 -1.914420e+02 -1.914420e+02 2.197343e-06 5.397914e+00 1.296797e+03 13 P 8000 -1.914420e+02 -1.914420e+02 2.197343e-06 6.112839e+00 1.308721e+03 13 P 9000 -1.914420e+02 -1.914420e+02 2.197343e-06 6.824181e+00 1.318840e+03 13 P 10000 -1.914420e+02 -1.914420e+02 2.197343e-06 7.535718e+00 1.327013e+03 13 Last 10001 -1.914420e+02 -1.914420e+02 1.443112e-06 7.540557e+00 1.326295e+03 13 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.914420e+02 -1.914420e+02 1.443112e-06 7.544240e+00 1.325647e+03 13 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -191.44197739819336 Dual Bound: -192.61474903623488 Dual Gap (relative): 0.006125989994358426 Search Statistics. Total number of nodes processed: 349 Total number of lmo calls: 5340 Total time (s): 301.962 LMO calls / sec: 17.684344387704414 Nodes / sec: 1.1557745676608315 LMO calls / node: 15.300859598853869 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.865463e+02 -1.779583e+02 8.587974e+00 4.825835e-02 1.744900e+01 1.719296e-01 6803 100 17 25 4 1 * 2 3 -1.865463e+02 -1.801997e+02 6.346559e+00 3.521959e-02 1.804500e+01 2.770851e-01 92 67 28 17 6 1 * 3 4 -1.858141e+02 -1.817391e+02 4.075094e+00 2.242278e-02 1.854100e+01 3.775417e-01 82 59 38 16 6 2 * 15 16 -1.847632e+02 -1.819252e+02 2.837958e+00 1.559959e-02 2.403700e+01 1.289678e+00 75 51 166 13 5 1 * 32 33 -1.842624e+02 -1.822466e+02 2.015819e+00 1.106094e-02 3.140400e+01 2.069800e+00 51 36 367 10 6 1 41 42 -1.840250e+02 -1.822466e+02 1.778378e+00 9.758087e-03 3.485100e+01 2.381567e+00 84 54 463 20 4 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 -9.700366e+01 -9.770474e+01 7.010826e-01 0.000000e+00 Inf 1 LD 2 -1.822466e+02 -1.822466e+02 0.000000e+00 1.745920e-01 1.145528e+01 1 Last 2 -1.822466e+02 -1.822466e+02 0.000000e+00 3.511254e-01 5.695971e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.822466e+02 -1.822466e+02 0.000000e+00 3.562644e-01 5.613808e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -182.24662189773915 Dual Bound: -184.02500022351364 Dual Gap (relative): 0.00975808663697683 Search Statistics. Total number of nodes processed: 83 Total number of lmo calls: 468 Total time (s): 36.958 LMO calls / sec: 12.663022890849073 Nodes / sec: 2.245792521240327 LMO calls / node: 5.63855421686747 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:309 [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:1952 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:309 [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:296 [10] _start() @ Base ./client.jl:563 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 21m20.3s Norm hyperbox | 4 4 50.5s Norm hyperbox - strong branching | 2 2 45.8s Normbox - Shadow set activation | 4 4 22.7s Normbox - strong convexity and sharpness | 6 6 17.8s Start with Active Set | 2 2 17.9s Interface - sparse poisson regression | 4 4 24.0s Different FW variants | 10 10 1m05.1s Different line search types | 8 8 2m26.9s Lazification | 5 5 19.6s DICG - Lazification | 10 10 50.4s DICG - warm_start | 5 5 39.8s User stop | 2 2 10.4s Linear feasible | 4 4 0.1s Integer bounds | 10 10 0.1s Cube LMO | 4 4 16.6s BLMO - Strong Branching | 4 4 21.5s Probability Simplex LMO | 4 4 51.1s Unit Simplex LMO | 4 4 59.1s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 24.2s Hyperplane Aware Rounding - Unit Simplex | 2 2 27.2s Following Gradient Heuristic - Unit Simplex | 6 6 33.5s Rounding Heuristic - Unit Simplex | 3 3 32.3s Probability Rounding - Unit Cube | 2 2 21.9s Probability rounding - Probability Simplex | 3 3 21.0s Sparse Regression | 2 2 29.5s Sparse Regression Group | 7 7 46.1s Poisson sparse regression | 2 2 5m05.3s Hybrid branching poisson sparse regression | 3 3 40.4s RNG of the outermost testset: Xoshiro(0x2fbcbd21f51121c0, 0x7938bb2844e57254, 0x47fa366944a42109, 0x39726e4ef5d59a25, 0x956b02d1d3cd54ec) 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 1313.51s 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:2673 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2522 [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:308 [13] exec_options(opts::Base.JLOptions) @ Base ./client.jl:330 [14] _start() @ Base ./client.jl:563 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1519.17s: package tests unexpectedly errored