Package evaluation of Boscia on Julia 1.13.0-DEV.873 (be59b3b2f4*) started at 2025-07-17T23:06:47.535 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.93s ################################################################################ # 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.7.15 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.5.1+0 [efcefdf7] + PCRE2_jll v10.45.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.65.0+0 [3f19e933] + p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 4.7s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 114.54s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_0lnrP6/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_0lnrP6/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.7.15 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.1+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 5676.5 ms ✓ StatsBase 10963.5 ms ✓ Distributions 2 dependencies successfully precompiled in 19 seconds. 45 already precompiled. Precompiling packages... 4017.5 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 4 seconds. 23 already precompiled. Precompiling packages... 5226.5 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 49 already precompiled. Precompiling packages... 5385.4 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 7 seconds. 52 already precompiled. seed = 0xd0eb45c2fc2eb4fd [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xec1df48e2be632c2 seed = 0xd6ec94339c55a027 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xabb2ba1df416a4a7 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.744671e+00 1.748551e+00 3.879614e-03 2.223693e-03 1.572500e+01 1.907790e-01 5852 23 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 7.221892e+00 -7.806094e-01 8.002502e+00 0.000000e+00 Inf 1 LD 3 1.927713e+00 1.740053e+00 1.876601e-01 2.135504e+00 1.404821e+00 2 LD 5 1.748551e+00 1.748551e+00 0.000000e+00 2.302510e+00 2.171544e+00 1 Last 5 1.748551e+00 1.748551e+00 0.000000e+00 2.310836e+00 2.163719e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 1.748551e+00 1.748551e+00 0.000000e+00 2.315320e+00 2.159529e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.7485507652669716 Dual Bound: 1.7446711514805624 Dual Gap (relative): 0.0022236934353599544 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 12 Total time (s): 23.174 LMO calls / sec: 0.517821696729093 Nodes / sec: 0.12945542418227324 LMO calls / node: 4.0 Total number of global tightenings: 47 Global tightenings / node: 47.0 Total number of local tightenings: 47 Local tightenings / node: 47.0 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 2.201162e+00 3.455774e+00 1.254613e+00 5.699776e-01 1.522900e+01 1.969926e-01 7285 264 37 79 19 1 * 3 4 2.238630e+00 3.399102e+00 1.160472e+00 5.183849e-01 1.551300e+01 4.512344e-01 74 56 75 29 12 0 100 57 2.953021e+00 3.399102e+00 4.460806e-01 1.510591e-01 2.360300e+01 6.651697e+00 27 20 1233 22 15 0 200 55 3.051435e+00 3.399102e+00 3.476662e-01 1.139353e-01 2.617300e+01 9.742865e+00 28 21 1664 25 14 2 300 55 3.117898e+00 3.399102e+00 2.812041e-01 9.019029e-02 2.813500e+01 1.261774e+01 35 25 2089 31 13 4 400 55 3.169748e+00 3.399102e+00 2.293540e-01 7.235717e-02 3.059000e+01 1.487414e+01 30 22 2535 21 6 0 500 55 3.220894e+00 3.399102e+00 1.782080e-01 5.532876e-02 3.307800e+01 1.677852e+01 34 24 2986 37 14 1 600 55 3.262214e+00 3.399102e+00 1.368882e-01 4.196174e-02 3.571300e+01 1.834066e+01 35 26 3456 24 6 0 700 55 3.309063e+00 3.399102e+00 9.003869e-02 2.720972e-02 3.846000e+01 1.963079e+01 32 22 3947 16 2 0 800 51 3.353411e+00 3.399102e+00 4.569062e-02 1.362512e-02 4.115100e+01 2.067993e+01 51 28 4430 38 14 1 829 44 3.366200e+00 3.399102e+00 3.290157e-02 9.774098e-03 4.186800e+01 2.085125e+01 8 5 4567 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 8.469424e+00 6.351105e-01 7.834313e+00 0.000000e+00 Inf 1 LD 3 3.441421e+00 3.398210e+00 4.321138e-02 2.653608e-01 1.130536e+01 2 LD 5 3.399102e+00 3.399102e+00 0.000000e+00 4.337233e-01 1.152809e+01 1 Last 5 3.399102e+00 3.399102e+00 0.000000e+00 4.414104e-01 1.132733e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.399102e+00 3.399102e+00 0.000000e+00 4.456534e-01 1.121948e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.3991016734176074 Dual Bound: 3.3662001046269503 Dual Gap (relative): 0.009774097726820466 Search Statistics. Total number of nodes processed: 873 Total number of lmo calls: 4573 Total time (s): 43.913 LMO calls / sec: 104.13772686903651 Nodes / sec: 19.880217703185846 LMO calls / node: 5.238258877434135 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: 24th entry: 0.16808956204987277 29th entry: 0.16808956204987277 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.339372e+00 3.455774e+00 1.116402e+00 4.772229e-01 3.040000e-01 9.868421e+00 300 246 37 79 19 1 * 3 4 2.368242e+00 3.399102e+00 1.030859e+00 4.352845e-01 6.370000e-01 1.098901e+01 75 57 75 29 12 0 100 28 3.059787e+00 3.399102e+00 3.393143e-01 1.108947e-01 8.919000e+00 1.435138e+01 34 25 1283 28 15 2 200 27 3.204181e+00 3.399102e+00 1.949209e-01 6.083331e-02 1.294300e+01 1.753844e+01 25 18 1958 30 14 1 300 27 3.309807e+00 3.399102e+00 8.929497e-02 2.697891e-02 1.691900e+01 1.932738e+01 33 23 2671 32 13 5 362 23 3.368560e+00 3.399102e+00 3.054135e-02 9.066589e-03 1.939300e+01 1.985252e+01 36 26 3140 41 14 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 8.469424e+00 6.351105e-01 7.834313e+00 0.000000e+00 Inf 1 LD 3 3.441421e+00 3.398210e+00 4.321138e-02 1.501525e-03 1.997969e+03 2 LD 5 3.399102e+00 3.399102e+00 0.000000e+00 5.478106e-03 9.127242e+02 1 Last 5 3.399102e+00 3.399102e+00 0.000000e+00 1.380201e-02 3.622662e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.399102e+00 3.399102e+00 0.000000e+00 1.946893e-02 2.568194e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.3991016734176074 Dual Bound: 3.368560319808576 Dual Gap (relative): 0.009066589495053744 Search Statistics. Total number of nodes processed: 385 Total number of lmo calls: 3146 Total time (s): 19.429 LMO calls / sec: 161.9228987595862 Nodes / sec: 19.815739358690617 LMO calls / node: 8.17142857142857 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 = 0x9c5461c691441c54 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 -2.782702e+02 -2.561220e+02 2.214816e+01 8.647504e-02 1.750900e+01 1.713405e-01 9395 114 34 1398 15 2 * 5 6 -2.782437e+02 -2.593812e+02 1.886247e+01 7.272105e-02 2.399600e+01 4.584097e-01 2032 101 163 1650 13 4 * 13 14 -2.775401e+02 -2.636403e+02 1.389980e+01 5.272260e-02 3.552400e+01 7.600495e-01 1286 91 392 1087 18 3 * 14 15 -2.775401e+02 -2.642528e+02 1.328733e+01 5.028266e-02 3.664300e+01 7.914199e-01 1112 80 418 897 18 10 * 68 67 -2.767355e+02 -2.651423e+02 1.159324e+01 4.372458e-02 1.079460e+02 1.250625e+00 814 79 1964 686 11 11 100 99 -2.766002e+02 -2.651423e+02 1.145789e+01 4.321411e-02 1.488510e+02 1.336907e+00 1604 100 2926 1429 21 10 200 197 -2.761480e+02 -2.651423e+02 1.100573e+01 4.150875e-02 2.677860e+02 1.482527e+00 1602 107 5773 1374 22 10 300 297 -2.758928e+02 -2.651423e+02 1.075049e+01 4.054613e-02 4.032020e+02 1.480647e+00 1502 101 8654 1282 10 5 364 361 -2.757668e+02 -2.651423e+02 1.062455e+01 4.007111e-02 5.000050e+02 1.449986e+00 3089 80 10599 3105 24 16 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.080407e+02 5.037015e+02 4.339210e+00 0.000000e+00 Inf 1 LD 4 -2.636657e+02 -2.648537e+02 1.187998e+00 2.749149e-01 1.454996e+01 2 LD 94 -2.705234e+02 -2.710426e+02 5.192401e-01 4.774471e-01 1.968804e+02 4 LD 135 -2.716798e+02 -2.718612e+02 1.813614e-01 4.965602e-01 2.718704e+02 5 LD 231 -2.719265e+02 -2.719732e+02 4.670108e-02 5.377726e-01 4.295496e+02 7 LD 337 -2.719419e+02 -2.719581e+02 1.627933e-02 5.793233e-01 5.817132e+02 8 LD 508 -2.719448e+02 -2.719500e+02 5.190058e-03 6.699368e-01 7.582804e+02 10 LD 673 -2.719452e+02 -2.719468e+02 1.586611e-03 7.549524e-01 8.914469e+02 11 LD 838 -2.719452e+02 -2.719459e+02 7.408597e-04 8.357461e-01 1.002697e+03 11 P 1000 -2.719452e+02 -2.719459e+02 7.408597e-04 9.250822e-01 1.080985e+03 11 LD 1111 -2.719452e+02 -2.719455e+02 3.019453e-04 1.036980e+00 1.071381e+03 13 LD 1265 -2.719452e+02 -2.719453e+02 1.070876e-04 1.119334e+00 1.130137e+03 14 LD 1409 -2.719452e+02 -2.719452e+02 4.112949e-05 1.193140e+00 1.180918e+03 14 LD 1583 -2.719452e+02 -2.719452e+02 1.250842e-05 1.278637e+00 1.238037e+03 14 LD 1857 -2.719452e+02 -2.719452e+02 2.973837e-06 1.413070e+00 1.314160e+03 14 P 2000 -2.719452e+02 -2.719452e+02 2.973837e-06 1.487030e+00 1.344963e+03 14 LD 2247 -2.719452e+02 -2.719452e+02 6.660185e-07 1.608780e+00 1.396710e+03 14 P 3000 -2.719452e+02 -2.719452e+02 6.660185e-07 2.072037e+00 1.447850e+03 14 P 4000 -2.719452e+02 -2.719452e+02 6.660185e-07 2.537221e+00 1.576528e+03 14 P 5000 -2.719452e+02 -2.719452e+02 6.660185e-07 2.971594e+00 1.682598e+03 14 P 6000 -2.719452e+02 -2.719452e+02 6.660185e-07 3.314056e+00 1.810470e+03 14 P 7000 -2.719452e+02 -2.719452e+02 6.660185e-07 3.651741e+00 1.916894e+03 14 P 8000 -2.719452e+02 -2.719452e+02 6.660185e-07 3.987748e+00 2.006145e+03 14 P 9000 -2.719452e+02 -2.719452e+02 6.660185e-07 4.334837e+00 2.076203e+03 14 P 10000 -2.719452e+02 -2.719452e+02 6.660185e-07 4.681006e+00 2.136293e+03 14 Last 10001 -2.719452e+02 -2.719452e+02 5.353371e-07 4.685484e+00 2.134465e+03 14 ---------------------------------------------------------------------------------------------------------------- PP 10001 -2.719452e+02 -2.719452e+02 5.353371e-07 4.688825e+00 2.132944e+03 14 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -271.9452074339245 Dual Bound: -275.76683156653985 Dual Gap (relative): 0.014052919588751695 Search Statistics. Total number of nodes processed: 725 Total number of lmo calls: 10630 Total time (s): 506.611 LMO calls / sec: 20.982568479563216 Nodes / sec: 1.4310782829429287 LMO calls / node: 14.662068965517241 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 -2.592724e+02 -2.530575e+02 6.214939e+00 2.455939e-02 1.877200e+01 1.598125e-01 7422 68 12 15 3 2 * 3 4 -2.588670e+02 -2.564732e+02 2.393831e+00 9.333652e-03 1.972900e+01 3.548076e-01 77 58 32 13 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -1.375300e+02 -1.382173e+02 6.872711e-01 0.000000e+00 Inf 1 LD 2 -2.564732e+02 -2.564732e+02 0.000000e+00 1.767004e-01 1.131859e+01 1 Last 2 -2.564732e+02 -2.564732e+02 0.000000e+00 3.623100e-01 5.520134e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.564732e+02 -2.564732e+02 0.000000e+00 3.672269e-01 5.446224e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -256.4731568862478 Dual Bound: -258.86698816332745 Dual Gap (relative): 0.009333652325032069 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 37 Total time (s): 21.833 LMO calls / sec: 1.694682361562772 Nodes / sec: 0.3206155819172812 LMO calls / node: 5.285714285714286 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:1858 [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 26m32.8s Norm hyperbox | 4 4 57.6s Norm hyperbox - strong branching | 2 2 46.0s Normbox - Shadow set activation | 4 4 22.9s Normbox - strong convexity and sharpness | 6 6 17.9s Start with Active Set | 2 2 18.4s Interface - sparse poisson regression | 4 4 24.5s Different FW variants | 10 10 1m13.1s Different line search types | 8 8 2m28.7s Lazification | 5 5 21.7s DICG - Lazification | 10 10 1m19.3s DICG - warm_start | 5 5 58.5s User stop | 2 2 15.8s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 24.6s BLMO - Strong Branching | 4 4 23.0s Probability Simplex LMO | 4 4 51.5s Unit Simplex LMO | 4 4 56.3s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 24.8s Hyperplane Aware Rounding - Unit Simplex | 2 2 30.0s Following Gradient Heuristic - Unit Simplex | 6 6 36.2s Rounding Heuristic - Unit Simplex | 3 3 35.9s Probability Rounding - Unit Cube | 2 2 22.7s Probability rounding - Probability Simplex | 3 3 22.4s Sparse Regression | 2 2 28.9s Sparse Regression Group | 7 7 1m07.1s Poisson sparse regression | 2 2 8m30.0s Hybrid branching poisson sparse regression | 3 3 25.2s RNG of the outermost testset: Xoshiro(0x64fbb0639e43e237, 0xffea7bb705b492e9, 0x470b4b65c69ce155, 0x70a9dc7440e6dc84, 0xdc98a3b356c20937) 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 1627.99s 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:2661 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2510 [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:537 [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:168 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:155 [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 1782.03s: package tests unexpectedly errored