Package evaluation of Boscia on Julia 1.13.0-DEV.1072 (de815ed1fa*) started at 2025-09-03T17:02:43.352 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 10.3s ################################################################################ # 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.66.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.68s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 322.55s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_atIvMD/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_atIvMD/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.66.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... 6057.9 ms ✓ SortingAlgorithms 3171.6 ms ✓ QuadGK 5372.9 ms ✓ StatsBase 10586.7 ms ✓ Distributions 4 dependencies successfully precompiled in 27 seconds. 43 already precompiled. Precompiling packages... 5063.2 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 52 already precompiled. Precompiling packages... 4590.3 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 49 already precompiled. seed = 0x74c04d5fd60c4621 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xb88c5c142e6e342e seed = 0x189688f11b538b76 seed = 0x5e15673501d2b367 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.360469e+00 2.700040e+00 3.395706e-01 1.438572e-01 1.699500e+01 1.765225e-01 6946 61 15 19 6 1 * 3 4 2.388789e+00 2.698094e+00 3.093052e-01 1.294820e-01 2.044700e+01 3.423485e-01 45 33 32 11 6 0 * 14 13 2.511175e+00 2.671177e+00 1.600018e-01 6.371593e-02 2.090900e+01 1.291310e+00 13 9 122 3 4 0 77 12 2.651978e+00 2.671177e+00 1.919845e-02 7.239292e-03 2.205400e+01 4.035549e+00 8 7 334 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 4.980526e+00 1.109763e+00 3.870762e+00 0.000000e+00 Inf 1 LD 2 3.040410e+00 2.528240e+00 5.121700e-01 2.077820e+00 9.625474e-01 2 LD 4 2.671177e+00 2.671177e+00 0.000000e+00 2.350486e+00 1.701775e+00 1 Last 4 2.671177e+00 2.671177e+00 0.000000e+00 2.359701e+00 1.695130e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 4 2.671177e+00 2.671177e+00 0.000000e+00 2.364825e+00 1.691457e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.67117663966033 Dual Bound: 2.651978194147556 Dual Gap (relative): 0.007239292372441677 Search Statistics. Total number of nodes processed: 89 Total number of lmo calls: 340 Total time (s): 26.038 LMO calls / sec: 13.057838543666948 Nodes / sec: 3.4180812658422304 LMO calls / node: 3.8202247191011236 Total number of global tightenings: 38 Global tightenings / node: 0.49 Total number of local tightenings: 50 Local tightenings / node: 0.65 Total number of potential local tightenings: 50 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 8.517390e-01 2.284526e+00 1.432787e+00 1.682190e+00 1.527700e+01 1.963736e-01 7191 311 47 108 32 1 * 61 60 1.567071e+00 2.282993e+00 7.159224e-01 4.568539e-01 2.360500e+01 5.126033e+00 26 18 1302 22 3 1 * 63 60 1.572428e+00 2.279598e+00 7.071699e-01 4.497311e-01 2.368500e+01 5.193160e+00 35 25 1318 19 3 0 100 63 1.633232e+00 2.279598e+00 6.463666e-01 3.957593e-01 2.510300e+01 6.493248e+00 44 33 1585 30 18 1 200 63 1.694141e+00 2.279598e+00 5.854569e-01 3.455774e-01 2.821300e+01 9.321944e+00 24 18 2184 24 15 1 300 63 1.742860e+00 2.279598e+00 5.367379e-01 3.079638e-01 3.140600e+01 1.155830e+01 29 20 2808 32 13 3 400 63 1.784122e+00 2.279598e+00 4.954764e-01 2.777144e-01 3.438700e+01 1.346439e+01 31 22 3458 33 14 7 500 63 1.811648e+00 2.279598e+00 4.679504e-01 2.583010e-01 3.779100e+01 1.489773e+01 27 20 4179 20 8 0 600 63 1.839328e+00 2.279598e+00 4.402703e-01 2.393648e-01 4.149600e+01 1.597744e+01 31 23 4923 30 13 6 700 63 1.867002e+00 2.279598e+00 4.125962e-01 2.209940e-01 4.500900e+01 1.695217e+01 32 23 5667 58 11 6 800 63 1.902308e+00 2.279598e+00 3.772905e-01 1.983331e-01 4.866000e+01 1.773531e+01 52 38 6420 41 9 2 900 63 1.940586e+00 2.279598e+00 3.390118e-01 1.746955e-01 5.236900e+01 1.838874e+01 44 32 7192 27 7 1 1000 63 1.987994e+00 2.279598e+00 2.916038e-01 1.466824e-01 5.583300e+01 1.903892e+01 42 30 7965 35 8 7 1100 63 2.069610e+00 2.279598e+00 2.099886e-01 1.014629e-01 5.934300e+01 1.959793e+01 44 32 8716 37 9 3 1200 19 2.232894e+00 2.279598e+00 4.670444e-02 2.091655e-02 6.191000e+01 1.968987e+01 11 8 9329 2 2 0 1207 12 2.259119e+00 2.279598e+00 2.047919e-02 9.065121e-03 6.202400e+01 1.965368e+01 12 8 9354 6 3 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 5.915339e+00 -1.618560e+00 7.533899e+00 0.000000e+00 Inf 1 LD 2 3.111547e+00 1.322317e+00 1.789230e+00 1.556423e-01 1.284998e+01 2 LD 5 2.298398e+00 2.242350e+00 5.604790e-02 4.063492e-01 1.230469e+01 2 LD 9 2.279778e+00 2.262250e+00 1.752854e-02 4.107192e-01 2.191278e+01 2 LD 13 2.279607e+00 2.278478e+00 1.129298e-03 4.186398e-01 3.105295e+01 3 LD 20 2.279598e+00 2.279064e+00 5.336522e-04 4.228498e-01 4.729812e+01 3 LD 22 2.279598e+00 2.279564e+00 3.405076e-05 4.269109e-01 5.153300e+01 3 LD 30 2.279598e+00 2.279598e+00 3.315081e-07 4.312233e-01 6.956952e+01 3 LD 39 2.279598e+00 2.279598e+00 7.123314e-08 4.357093e-01 8.950921e+01 3 Last 39 2.279598e+00 2.279598e+00 7.123314e-08 4.434117e-01 8.795437e+01 3 ---------------------------------------------------------------------------------------------------------------- PP 39 2.279598e+00 2.279598e+00 7.123314e-08 4.475900e-01 8.713332e+01 3 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.2795980657916863 Dual Bound: 2.2591189684557262 Dual Gap (relative): 0.009065081397620712 Search Statistics. Total number of nodes processed: 1219 Total number of lmo calls: 9367 Total time (s): 64.042 LMO calls / sec: 146.26338965054182 Nodes / sec: 19.034383685706256 LMO calls / node: 7.684167350287121 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: 17 Non zero entries: 25th entry: 0.15440250313665607 39th entry: 0.16072681796122298 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 9.403854e-01 2.284526e+00 1.344140e+00 1.429350e+00 4.020000e-01 7.462687e+00 398 306 47 108 32 1 * 59 44 1.611905e+00 2.282993e+00 6.710886e-01 4.163327e-01 8.210000e+00 1.254568e+01 23 16 1252 22 3 1 * 61 44 1.620402e+00 2.279598e+00 6.591960e-01 4.068101e-01 8.278000e+00 1.268422e+01 28 20 1268 19 3 0 100 46 1.675598e+00 2.279598e+00 6.040004e-01 3.604686e-01 9.722000e+00 1.501749e+01 34 24 1547 40 19 5 200 46 1.742009e+00 2.279598e+00 5.375894e-01 3.086032e-01 1.290700e+01 1.905943e+01 27 20 2147 22 10 2 300 42 1.798426e+00 2.279598e+00 4.811726e-01 2.675521e-01 1.608200e+01 2.126601e+01 13 9 2777 2 2 0 400 32 1.854314e+00 2.279598e+00 4.252838e-01 2.293483e-01 2.012700e+01 2.146371e+01 18 13 3570 6 3 0 500 31 1.917486e+00 2.279598e+00 3.621119e-01 1.888472e-01 2.490600e+01 2.132016e+01 129 80 4548 172 21 9 600 31 2.000874e+00 2.279598e+00 2.787237e-01 1.393010e-01 2.960000e+01 2.131757e+01 31 23 5549 29 8 5 700 29 2.147073e+00 2.279598e+00 1.325254e-01 6.172378e-02 3.402300e+01 2.142668e+01 28 21 6489 20 4 3 732 6 2.261908e+00 2.279598e+00 1.768998e-02 7.820823e-03 3.532000e+01 2.089468e+01 48 34 6773 37 5 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 5.915339e+00 -1.618560e+00 7.533899e+00 0.000000e+00 Inf 1 LD 2 3.111547e+00 1.322317e+00 1.789230e+00 1.097170e-03 1.822872e+03 2 LD 5 2.298398e+00 2.242350e+00 5.604790e-02 5.177402e-03 9.657353e+02 2 LD 9 2.279778e+00 2.262250e+00 1.752854e-02 9.329784e-03 9.646526e+02 2 LD 13 2.279607e+00 2.278478e+00 1.129298e-03 1.676808e-02 7.752828e+02 3 LD 20 2.279598e+00 2.279064e+00 5.336522e-04 2.081602e-02 9.607986e+02 3 LD 22 2.279598e+00 2.279564e+00 3.405076e-05 2.477967e-02 8.878245e+02 3 LD 30 2.279598e+00 2.279598e+00 3.315081e-07 2.886796e-02 1.039214e+03 3 LD 39 2.279598e+00 2.279598e+00 7.123314e-08 3.306387e-02 1.179535e+03 3 Last 39 2.279598e+00 2.279598e+00 7.123314e-08 4.046121e-02 9.638863e+02 3 ---------------------------------------------------------------------------------------------------------------- PP 39 2.279598e+00 2.279598e+00 7.123314e-08 4.436181e-02 8.791346e+02 3 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.2795980657916863 Dual Bound: 2.261908171219549 Dual Gap (relative): 0.007820783706970614 Search Statistics. Total number of nodes processed: 738 Total number of lmo calls: 6786 Total time (s): 35.379 LMO calls / sec: 191.80870007631648 Nodes / sec: 20.859832103790385 LMO calls / node: 9.195121951219512 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 seed = 0x3142a684568da930 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 -9.073058e+02 -8.709304e+02 3.637536e+01 4.176609e-02 1.637000e+01 1.832621e-01 8646 113 36 1212 7 5 * 2 3 -9.073058e+02 -8.831080e+02 2.419776e+01 2.740068e-02 1.773100e+01 2.819920e-01 1355 106 65 1076 15 6 * 3 4 -9.065916e+02 -8.889913e+02 1.760033e+01 1.979809e-02 1.851700e+01 3.780310e-01 779 95 93 611 15 8 * 10 11 -9.051714e+02 -8.897742e+02 1.539717e+01 1.730458e-02 2.307400e+01 9.101153e-01 581 82 265 439 9 6 * 19 20 -9.042598e+02 -8.909170e+02 1.334281e+01 1.497649e-02 3.035800e+01 1.284670e+00 625 88 511 484 8 9 * 53 52 -9.031064e+02 -8.927426e+02 1.036380e+01 1.160895e-02 5.597100e+01 1.875971e+00 603 83 1350 471 9 3 100 99 -9.022376e+02 -8.927426e+02 9.494980e+00 1.063574e-02 9.523800e+01 2.089502e+00 1958 103 2491 1841 9 5 135 132 -9.016285e+02 -8.927426e+02 8.885823e+00 9.953398e-03 1.235280e+02 2.161453e+00 501 94 3347 352 11 12 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.294442e+03 1.290217e+03 4.224792e+00 0.000000e+00 Inf 1 LD 7 -8.637862e+02 -8.649691e+02 1.182941e+00 2.786982e-01 2.511677e+01 2 LD 79 -8.901647e+02 -8.906238e+02 4.591350e-01 4.712943e-01 1.676235e+02 4 LD 98 -8.953290e+02 -8.954184e+02 8.940477e-02 5.535047e-01 1.770536e+02 4 LD 137 -8.958658e+02 -8.959034e+02 3.759613e-02 5.716496e-01 2.396573e+02 4 LD 146 -8.958713e+02 -8.958859e+02 1.453539e-02 5.801232e-01 2.516707e+02 5 LD 154 -8.958723e+02 -8.958777e+02 5.364736e-03 5.853272e-01 2.631007e+02 5 LD 171 -8.958726e+02 -8.958736e+02 1.092694e-03 5.965284e-01 2.866586e+02 6 LD 277 -8.958726e+02 -8.958731e+02 4.203679e-04 6.355618e-01 4.358349e+02 7 LD 303 -8.958727e+02 -8.958728e+02 1.951515e-04 6.469574e-01 4.683461e+02 7 LD 331 -8.958727e+02 -8.958727e+02 9.263561e-05 6.597329e-01 5.017182e+02 7 LD 364 -8.958727e+02 -8.958727e+02 4.364530e-05 6.735015e-01 5.404591e+02 7 LD 393 -8.958727e+02 -8.958727e+02 2.116047e-05 6.866280e-01 5.723624e+02 7 LD 427 -8.958727e+02 -8.958727e+02 1.038032e-05 7.006436e-01 6.094397e+02 7 LD 455 -8.958727e+02 -8.958727e+02 4.644658e-06 7.132040e-01 6.379661e+02 7 LD 480 -8.958727e+02 -8.958727e+02 2.146479e-06 7.282142e-01 6.591467e+02 7 LD 511 -8.958727e+02 -8.958727e+02 9.857304e-07 7.457891e-01 6.851803e+02 7 LD 547 -8.958727e+02 -8.958727e+02 4.790433e-07 7.658783e-01 7.142127e+02 7 P 1000 -8.958727e+02 -8.958727e+02 4.790433e-07 9.968730e-01 1.003137e+03 7 P 2000 -8.958727e+02 -8.958727e+02 4.790433e-07 1.552653e+00 1.288118e+03 7 P 3000 -8.958727e+02 -8.958727e+02 4.790433e-07 2.032284e+00 1.476172e+03 7 P 4000 -8.958727e+02 -8.958727e+02 4.790433e-07 2.412573e+00 1.657981e+03 7 P 5000 -8.958727e+02 -8.958727e+02 4.790433e-07 2.743606e+00 1.822419e+03 7 P 6000 -8.958727e+02 -8.958727e+02 4.790433e-07 3.107920e+00 1.930552e+03 7 P 7000 -8.958727e+02 -8.958727e+02 4.790433e-07 3.447983e+00 2.030172e+03 7 P 8000 -8.958727e+02 -8.958727e+02 4.790433e-07 3.791091e+00 2.110211e+03 7 P 9000 -8.958727e+02 -8.958727e+02 4.790433e-07 4.131748e+00 2.178255e+03 7 P 10000 -8.958727e+02 -8.958727e+02 4.790433e-07 4.469812e+00 2.237230e+03 7 Last 10001 -8.958727e+02 -8.958727e+02 3.642488e-07 4.474750e+00 2.234985e+03 7 ---------------------------------------------------------------------------------------------------------------- PP 10001 -8.958727e+02 -8.958727e+02 3.642488e-07 4.478007e+00 2.233360e+03 7 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -895.8726521940322 Dual Bound: -901.6284682232165 Dual Gap (relative): 0.006424814972404896 Search Statistics. Total number of nodes processed: 267 Total number of lmo calls: 3375 Total time (s): 129.865 LMO calls / sec: 25.988526546798596 Nodes / sec: 2.0559812112578446 LMO calls / node: 12.640449438202246 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 -7.590730e+02 -7.583074e+02 7.655152e-01 1.009505e-03 1.554800e+01 1.929509e-01 5321 31 6 4 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 -4.041233e+02 -4.047777e+02 6.544216e-01 0.000000e+00 Inf 1 LD 2 -7.583074e+02 -7.583074e+02 0.000000e+00 1.866324e-01 1.071625e+01 1 Last 2 -7.583074e+02 -7.583074e+02 0.000000e+00 3.685875e-01 5.426121e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -7.583074e+02 -7.583074e+02 0.000000e+00 3.731800e-01 5.359343e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -758.307442504895 Dual Bound: -759.0729577506659 Dual Gap (relative): 0.0010095051200370217 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 17.615 LMO calls / sec: 0.6244677831393699 Nodes / sec: 0.17030939540164633 LMO calls / node: 3.6666666666666665 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:1945 [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 20m38.7s Norm hyperbox | 4 4 54.7s Norm hyperbox - strong branching | 2 2 46.7s Normbox - Shadow set activation | 4 4 23.7s Normbox - strong convexity and sharpness | 6 6 17.9s Start with Active Set | 2 2 19.2s Interface - sparse poisson regression | 4 4 25.2s Different FW variants | 10 10 1m07.2s Different line search types | 8 8 2m26.5s Lazification | 5 5 21.9s DICG - Lazification | 10 10 1m12.6s DICG - warm_start | 5 5 57.4s User stop | 2 2 15.4s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 25.1s BLMO - Strong Branching | 4 4 22.3s Probability Simplex LMO | 4 4 49.2s Unit Simplex LMO | 4 4 1m12.3s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 25.8s Hyperplane Aware Rounding - Unit Simplex | 2 2 28.9s Following Gradient Heuristic - Unit Simplex | 6 6 32.4s Rounding Heuristic - Unit Simplex | 3 3 30.1s Probability Rounding - Unit Cube | 2 2 22.0s Probability rounding - Probability Simplex | 3 3 20.6s Sparse Regression | 2 2 31.3s Sparse Regression Group | 7 7 1m43.0s Poisson sparse regression | 2 2 2m13.2s Hybrid branching poisson sparse regression | 3 3 21.0s RNG of the outermost testset: Xoshiro(0x25d1f7bf15fbd7e8, 0x355424b1da8505b7, 0x7d95ce81754180da, 0xfb0a7adec6af6998, 0x1704ca735e9e5077) 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 1272.37s 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 1631.76s: package tests unexpectedly errored