Package evaluation of Boscia on Julia 1.13.0-DEV.853 (3e868b27cf*) started at 2025-07-17T02:54:46.073 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.64s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [36b166db] + Boscia v0.1.39 Updating `~/.julia/environments/v1.13/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.0 ⌅ [0a1fb500] + BlockDiagonals v0.1.42 [f7b14807] + Bonobo v0.1.3 [36b166db] + Boscia v0.1.39 [d360d2e6] + ChainRulesCore v1.25.2 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.17.0 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.13.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v1.0.1 [f55ce6ea] + FrankWolfe v0.5.5 [c145ed77] + GenericSchur v0.5.5 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.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.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.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.59s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 119.0s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_hKtBGY/Project.toml` [4c88cf16] Aqua v0.8.13 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 [864edb3b] DataStructures v0.18.22 [31c24e10] Distributions v0.25.120 [497a8b3b] DoubleFloats v1.4.3 [f55ce6ea] FrankWolfe v0.5.5 [87dc4568] HiGHS v1.18.2 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.42.0 [3b969827] MathOptSetDistances v0.2.11 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.3 [10745b16] Statistics v1.11.1 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.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_hKtBGY/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.13 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 [d360d2e6] ChainRulesCore v1.25.2 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.17.0 [187b0558] ConstructionBase v1.6.0 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.4.3 [e2ba6199] ExprTools v0.1.10 [1a297f60] FillArrays v1.13.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v1.0.1 [f55ce6ea] FrankWolfe v0.5.5 [14197337] GenericLinearAlgebra v0.3.17 [c145ed77] GenericSchur v0.5.5 [87dc4568] HiGHS v1.18.2 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.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.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.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... seed = 0xcbe26a4659cdc20c [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x4bc09dc9d4406e49 seed = 0x865b51e8f44740e2 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x8439c5a7873a530f 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.022601e+00 2.166240e+00 1.436386e-01 7.101679e-02 1.661800e+01 1.805271e-01 6844 55 16 19 5 1 19 6 2.148975e+00 2.166240e+00 1.726449e-02 8.033826e-03 1.966600e+01 1.271230e+00 40 30 118 9 8 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 6.987397e+00 -1.150022e+00 8.137419e+00 0.000000e+00 Inf 1 LD 3 2.374685e+00 2.125202e+00 2.494826e-01 1.713150e+00 1.751160e+00 2 LD 5 2.166240e+00 2.166240e+00 0.000000e+00 1.858012e+00 2.691049e+00 1 Last 5 2.166240e+00 2.166240e+00 0.000000e+00 1.865235e+00 2.680627e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.166240e+00 2.166240e+00 0.000000e+00 1.868917e+00 2.675347e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.166239846482923 Dual Bound: 2.1489753521083617 Dual Gap (relative): 0.008033826147714083 Search Statistics. Total number of nodes processed: 25 Total number of lmo calls: 124 Total time (s): 22.92 LMO calls / sec: 5.4101221640488655 Nodes / sec: 1.0907504363001745 LMO calls / node: 4.96 Total number of global tightenings: 38 Global tightenings / node: 2.0 Total number of local tightenings: 48 Local tightenings / node: 2.53 Total number of potential local tightenings: 48 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.127437e+00 2.489849e+00 1.362412e+00 1.208415e+00 1.335500e+01 2.246350e-01 6115 307 51 125 33 1 100 61 1.886045e+00 2.489849e+00 6.038041e-01 3.201429e-01 2.112900e+01 7.619859e+00 31 22 1350 20 12 0 200 61 1.981890e+00 2.489849e+00 5.079589e-01 2.563002e-01 2.315500e+01 1.127186e+01 25 18 1743 22 15 3 300 61 2.037389e+00 2.489849e+00 4.524606e-01 2.220787e-01 2.525100e+01 1.429646e+01 38 20 2157 32 14 1 400 61 2.084503e+00 2.489849e+00 4.053463e-01 1.944571e-01 2.735600e+01 1.685188e+01 28 20 2590 25 15 3 500 61 2.118530e+00 2.489849e+00 3.713191e-01 1.752720e-01 2.947400e+01 1.903372e+01 19 14 3033 18 7 0 600 61 2.150239e+00 2.489849e+00 3.396102e-01 1.579407e-01 3.162000e+01 2.090449e+01 31 22 3494 35 15 2 700 61 2.183656e+00 2.489849e+00 3.061931e-01 1.402204e-01 3.380900e+01 2.250880e+01 31 23 3965 29 8 0 800 61 2.222986e+00 2.489849e+00 2.668634e-01 1.200473e-01 3.607100e+01 2.386959e+01 27 19 4477 32 10 2 900 61 2.272189e+00 2.489849e+00 2.176608e-01 9.579345e-02 3.844300e+01 2.499805e+01 41 29 5024 56 17 4 1000 61 2.319403e+00 2.489849e+00 1.704458e-01 7.348693e-02 4.109900e+01 2.581571e+01 57 38 5630 91 18 5 1100 55 2.401388e+00 2.489849e+00 8.846115e-02 3.683751e-02 4.369600e+01 2.643263e+01 33 23 6240 53 6 4 1159 12 2.468219e+00 2.489849e+00 2.162983e-02 8.763335e-03 4.481200e+01 2.613139e+01 14 10 6507 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 6.395864e+00 -9.324500e-01 7.328314e+00 0.000000e+00 Inf 1 LD 3 2.772033e+00 2.316524e+00 4.555083e-01 2.421000e-01 1.239157e+01 2 LD 6 2.489849e+00 2.489849e+00 0.000000e+00 3.846474e-01 1.559870e+01 1 Last 6 2.489849e+00 2.489849e+00 0.000000e+00 3.921580e-01 1.529996e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 6 2.489849e+00 2.489849e+00 0.000000e+00 3.959413e-01 1.515376e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.48984927585148 Dual Bound: 2.46821944154747 Dual Gap (relative): 0.00876333519618044 Search Statistics. Total number of nodes processed: 1171 Total number of lmo calls: 6513 Total time (s): 46.609 LMO calls / sec: 139.73696067283143 Nodes / sec: 25.12390310884164 LMO calls / node: 5.561912894961571 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: 15 Non zero entries: 12th entry: 0.1676609122447402 27th entry: 0.1676609122447402 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.249703e+00 2.489849e+00 1.240147e+00 9.923533e-01 4.620000e-01 6.493506e+00 458 317 51 125 33 1 100 29 1.967248e+00 2.489849e+00 5.226016e-01 2.656511e-01 8.025000e+00 1.607477e+01 26 19 1310 18 11 0 200 30 2.113711e+00 2.489849e+00 3.761380e-01 1.779515e-01 1.108900e+01 2.074128e+01 20 15 1940 20 6 0 300 30 2.190434e+00 2.489849e+00 2.994149e-01 1.366920e-01 1.439500e+01 2.292463e+01 26 19 2611 28 13 2 400 30 2.271440e+00 2.489849e+00 2.184094e-01 9.615460e-02 1.780000e+01 2.415730e+01 30 22 3339 25 6 1 500 29 2.371364e+00 2.489849e+00 1.184855e-01 4.996514e-02 2.156600e+01 2.452935e+01 26 19 4197 29 5 0 558 11 2.467938e+00 2.489849e+00 2.191115e-02 8.878322e-03 2.350800e+01 2.420453e+01 22 17 4693 14 3 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 6.395864e+00 -9.324500e-01 7.328314e+00 0.000000e+00 Inf 1 LD 3 2.772033e+00 2.316524e+00 4.555083e-01 9.246910e-04 3.244327e+03 2 LD 6 2.489849e+00 2.489849e+00 0.000000e+00 3.934143e-03 1.525110e+03 1 Last 6 2.489849e+00 2.489849e+00 0.000000e+00 9.104325e-03 6.590274e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 6 2.489849e+00 2.489849e+00 0.000000e+00 1.176650e-02 5.099222e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.48984927585148 Dual Bound: 2.4679381254278336 Dual Gap (relative): 0.008878322433569024 Search Statistics. Total number of nodes processed: 569 Total number of lmo calls: 4699 Total time (s): 23.529 LMO calls / sec: 199.7109949424115 Nodes / sec: 24.18292320115602 LMO calls / node: 8.258347978910368 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: 11 seed = 0x52c85f10a969db0b 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 -7.683347e+02 -7.334329e+02 3.490179e+01 4.758689e-02 1.583100e+01 1.895016e-01 8726 130 44 2530 16 6 * 3 4 -7.682008e+02 -7.394777e+02 2.872302e+01 3.884230e-02 1.783600e+01 3.924647e-01 891 93 103 774 19 6 * 4 5 -7.682008e+02 -7.403595e+02 2.784127e+01 3.760507e-02 2.003000e+01 4.493260e-01 2188 103 139 2147 15 11 * 5 6 -7.679369e+02 -7.418146e+02 2.612233e+01 3.521410e-02 2.083700e+01 5.279071e-01 802 70 164 750 13 1 * 7 8 -7.675566e+02 -7.441672e+02 2.338948e+01 3.143042e-02 2.296900e+01 6.530541e-01 1017 80 222 986 11 4 * 10 11 -7.672644e+02 -7.470041e+02 2.026039e+01 2.712219e-02 2.600400e+01 8.075681e-01 974 87 312 885 18 10 * 28 29 -7.661651e+02 -7.515716e+02 1.459353e+01 1.941736e-02 4.879900e+01 1.168057e+00 1410 85 813 1418 13 12 100 101 -7.648115e+02 -7.515716e+02 1.323995e+01 1.761635e-02 1.226640e+02 1.638623e+00 1247 89 2816 1382 14 12 200 199 -7.639656e+02 -7.515716e+02 1.239405e+01 1.649085e-02 2.483310e+02 1.606727e+00 1212 53 5586 1429 16 7 * 216 215 -7.638762e+02 -7.518693e+02 1.200689e+01 1.596938e-02 2.643300e+02 1.630538e+00 1365 98 6014 1539 19 15 300 295 -7.634232e+02 -7.518693e+02 1.155387e+01 1.536686e-02 3.609650e+02 1.648359e+00 1887 93 8254 2143 21 7 400 395 -7.630510e+02 -7.518693e+02 1.118168e+01 1.487185e-02 4.791640e+02 1.659140e+00 901 70 10995 977 11 8 419 414 -7.630046e+02 -7.518693e+02 1.113523e+01 1.481006e-02 5.000040e+02 1.665987e+00 1379 65 11496 1476 9 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.131438e+03 1.127283e+03 4.154289e+00 0.000000e+00 Inf 1 LD 4 -7.369720e+02 -7.379222e+02 9.502305e-01 2.418992e-01 1.653581e+01 2 LD 77 -7.480247e+02 -7.484528e+02 4.280752e-01 4.895763e-01 1.572788e+02 3 LD 120 -7.535202e+02 -7.536457e+02 1.255291e-01 5.085599e-01 2.359604e+02 5 LD 203 -7.544942e+02 -7.545409e+02 4.665775e-02 5.349649e-01 3.794642e+02 4 LD 260 -7.546034e+02 -7.546112e+02 7.795843e-03 5.551813e-01 4.683155e+02 5 LD 292 -7.546097e+02 -7.546128e+02 3.142105e-03 5.663486e-01 5.155835e+02 5 LD 362 -7.546103e+02 -7.546115e+02 1.226449e-03 5.897806e-01 6.137876e+02 6 LD 398 -7.546103e+02 -7.546108e+02 5.351182e-04 6.027167e-01 6.603435e+02 6 LD 448 -7.546103e+02 -7.546105e+02 1.912466e-04 6.243272e-01 7.175724e+02 7 LD 465 -7.546103e+02 -7.546104e+02 5.620806e-05 6.343280e-01 7.330593e+02 7 LD 501 -7.546103e+02 -7.546103e+02 2.523534e-05 6.517441e-01 7.687066e+02 7 LD 536 -7.546103e+02 -7.546103e+02 1.060254e-05 6.715410e-01 7.981642e+02 8 LD 581 -7.546103e+02 -7.546103e+02 4.398725e-06 6.951356e-01 8.358082e+02 9 LD 621 -7.546103e+02 -7.546103e+02 2.013248e-06 7.143051e-01 8.693764e+02 9 LD 674 -7.546103e+02 -7.546103e+02 7.987650e-07 7.386931e-01 9.124222e+02 9 LD 723 -7.546103e+02 -7.546103e+02 3.408038e-07 7.611754e-01 9.498467e+02 9 P 1000 -7.546103e+02 -7.546103e+02 3.408038e-07 8.783302e-01 1.138524e+03 9 P 2000 -7.546103e+02 -7.546103e+02 3.408038e-07 1.380580e+00 1.448667e+03 9 P 3000 -7.546103e+02 -7.546103e+02 3.408038e-07 1.758319e+00 1.706176e+03 9 P 4000 -7.546103e+02 -7.546103e+02 3.408038e-07 2.145114e+00 1.864703e+03 9 P 5000 -7.546103e+02 -7.546103e+02 3.408038e-07 2.452829e+00 2.038462e+03 9 P 6000 -7.546103e+02 -7.546103e+02 3.408038e-07 2.750062e+00 2.181769e+03 9 P 7000 -7.546103e+02 -7.546103e+02 3.408038e-07 3.025450e+00 2.313706e+03 9 P 8000 -7.546103e+02 -7.546103e+02 3.408038e-07 3.309972e+00 2.416939e+03 9 P 9000 -7.546103e+02 -7.546103e+02 3.408038e-07 3.600531e+00 2.499631e+03 9 P 10000 -7.546103e+02 -7.546103e+02 3.408038e-07 3.887438e+00 2.572388e+03 9 Last 10001 -7.546103e+02 -7.546103e+02 3.392324e-07 3.891412e+00 2.570018e+03 9 ---------------------------------------------------------------------------------------------------------------- PP 10001 -7.546103e+02 -7.546103e+02 3.392324e-07 3.894603e+00 2.567912e+03 9 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -754.6103177634653 Dual Bound: -763.0045774099685 Dual Gap (relative): 0.01112396617022457 Search Statistics. Total number of nodes processed: 833 Total number of lmo calls: 11526 Total time (s): 505.355 LMO calls / sec: 22.80772922005323 Nodes / sec: 1.6483462120687438 LMO calls / node: 13.83673469387755 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 -6.677024e+02 -6.651245e+02 2.577952e+00 3.875894e-03 1.568200e+01 1.913021e-01 5876 38 8 7 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 -3.616307e+02 -3.622937e+02 6.629815e-01 0.000000e+00 Inf 1 LD 2 -6.651245e+02 -6.651245e+02 0.000000e+00 1.442794e-01 1.386200e+01 1 Last 2 -6.651245e+02 -6.651245e+02 0.000000e+00 2.972802e-01 6.727659e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -6.651245e+02 -6.651245e+02 0.000000e+00 3.012251e-01 6.639553e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -665.1244882884793 Dual Bound: -667.7024400306741 Dual Gap (relative): 0.003875893592233408 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 17.563 LMO calls / sec: 0.7401924500370096 Nodes / sec: 0.170813642316233 LMO calls / node: 4.333333333333333 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: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 | 129 1 130 25m47.5s Norm hyperbox | 4 4 50.9s Norm hyperbox - strong branching | 2 2 49.6s Normbox - Shadow set activation | 4 4 25.3s Normbox - strong convexity and sharpness | 6 6 19.7s Start with Active Set | 2 2 18.8s Interface - sparse poisson regression | 4 4 26.2s Different FW variants | 10 10 1m01.1s Different line search types | 8 8 2m26.3s Lazification | 5 5 22.9s DICG - Lazification | 10 10 1m15.2s DICG - warm_start | 5 5 1m00.4s User stop | 2 2 17.2s Linear feasible | 4 4 0.1s Integer bounds | 10 10 0.1s Cube LMO | 4 4 26.9s BLMO - Strong Branching | 4 4 23.2s Probability Simplex LMO | 4 4 49.7s Unit Simplex LMO | 4 4 1m11.6s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 26.5s Hyperplane Aware Rounding - Unit Simplex | 2 2 29.1s Following Gradient Heuristic - Unit Simplex | 6 6 37.4s Rounding Heuristic - Unit Simplex | 3 3 33.2s Probability Rounding - Unit Cube | 2 2 19.3s Probability rounding - Probability Simplex | 3 3 18.2s Sparse Regression | 2 2 27.3s Sparse Regression Group | 7 7 1m13.1s Poisson sparse regression | 2 2 8m28.1s Hybrid branching poisson sparse regression | 3 3 20.4s RNG of the outermost testset: Xoshiro(0x0197f4c29143c43f, 0xbe8c601aa7fd8378, 0xdd313fe314b13355, 0x1263a6d203a74352, 0x0fece4400a45268e) 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 1572.45s 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 1739.37s: package tests unexpectedly errored