Package evaluation of Boscia on Julia 1.12.0-DEV.1805 (a080deafdd*) started at 2025-03-24T18:14:20.873 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.06s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [36b166db] + Boscia v0.1.32 Updating `~/.julia/environments/v1.12/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.32 [d360d2e6] + ChainRulesCore v1.25.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [187b0558] + ConstructionBase v1.5.8 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.3 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.13.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v0.10.38 [f55ce6ea] + FrankWolfe v0.4.11 [c145ed77] + GenericSchur v0.5.4 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.1 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.15 [b8f27783] + MathOptInterface v1.38.0 [3b969827] + MathOptSetDistances v0.2.10 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.2 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.0 [69de0a69] + Parsers v2.8.1 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [92933f4c] + ProgressMeter v1.10.2 [dc4f5ac2] + ProximalCore v0.1.2 [708f8203] + Richardson v1.4.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.0 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [a759f4b9] + TimerOutputs v0.5.28 [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.6.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [dc6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.11.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.2.0 [44cfe95a] + Pkg v1.12.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.2.0+0 [deac9b47] + LibCURL_jll v8.6.0+0 [e37daf67] + LibGit2_jll v1.8.0+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.6+1 [14a3606d] + MozillaCACerts_jll v2024.11.26 [4536629a] + OpenBLAS_jll v0.3.28+3 [05823500] + OpenLibm_jll v0.8.1+3 [bea87d4a] + SuiteSparse_jll v7.8.0+1 [83775a58] + Zlib_jll v1.3.1+1 [8e850b90] + libblastrampoline_jll v5.11.2+0 [8e850ede] + nghttp2_jll v1.63.0+1 [3f19e933] + p7zip_jll v17.5.0+1 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.17s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 169.42s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_xOjLbr/Project.toml` [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.32 [864edb3b] DataStructures v0.18.22 [31c24e10] Distributions v0.25.118 [497a8b3b] DoubleFloats v1.4.2 [f55ce6ea] FrankWolfe v0.4.11 [87dc4568] HiGHS v1.15.0 [b8f27783] MathOptInterface v1.38.0 [3b969827] MathOptSetDistances v0.2.10 [82193955] SCIP v0.12.3 [10745b16] Statistics v1.11.1 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_xOjLbr/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.32 [d360d2e6] ChainRulesCore v1.25.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [187b0558] ConstructionBase v1.5.8 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.118 [ffbed154] DocStringExtensions v0.9.3 [497a8b3b] DoubleFloats v1.4.2 [e2ba6199] ExprTools v0.1.10 [1a297f60] FillArrays v1.13.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v0.10.38 [f55ce6ea] FrankWolfe v0.4.11 [14197337] GenericLinearAlgebra v0.3.15 [c145ed77] GenericSchur v0.5.4 [87dc4568] HiGHS v1.15.0 [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.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.15 [b8f27783] MathOptInterface v1.38.0 [3b969827] MathOptSetDistances v0.2.10 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.2 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.0 [90014a1f] PDMats v0.11.32 [69de0a69] Parsers v2.8.1 [f27b6e38] Polynomials v4.0.19 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [92933f4c] ProgressMeter v1.10.2 [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.11 [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.3 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.1 [276daf66] SpecialFunctions v2.5.0 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.0 [2913bbd2] StatsBase v0.34.4 [4c63d2b9] StatsFuns v1.3.2 [856f2bd8] StructTypes v1.11.0 [a759f4b9] TimerOutputs v0.5.28 [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.10.0+0 [e33a78d0] Hwloc_jll v2.12.0+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.100+0 [e5ac4fe4] SCIP_jll v900.200.100+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 [508c9074] bliss_jll v0.77.0+1 ⌅ [28df3c45] boost_jll v1.79.0+3 [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.6.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [dc6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.12.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.2.0+0 [781609d7] GMP_jll v6.3.0+1 [deac9b47] LibCURL_jll v8.6.0+0 [e37daf67] LibGit2_jll v1.8.0+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.6+1 [14a3606d] MozillaCACerts_jll v2024.11.26 [4536629a] OpenBLAS_jll v0.3.28+3 [05823500] OpenLibm_jll v0.8.1+3 [bea87d4a] SuiteSparse_jll v7.8.0+1 [83775a58] Zlib_jll v1.3.1+1 [8e850b90] libblastrampoline_jll v5.11.2+0 [8e850ede] nghttp2_jll v1.63.0+1 [3f19e933] p7zip_jll v17.5.0+1 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... seed = 0xd211efa4d348f40d Test Summary: | Pass Total Time Norm hyperbox | 4 4 56.1s Test Summary: | Pass Total Time Norm hyperbox - strong branching | 2 2 48.3s Test Summary: | Pass Total Time Normbox - Shadow set activation | 4 4 21.6s Test Summary: | Pass Total Time Normbox - strong convexity and sharpness | 6 6 17.3s Test Summary: | Pass Total Time Start with Active Set | 2 2 16.7s [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Test Summary: | Pass Total Time Interface - sparse poisson regression | 4 4 25.6s Test Summary: | Pass Total Time Different FW variants | 10 10 1m13.3s Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Agnostic(2) 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: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.776078e-03 5.000000e-01 5.067761e-01 Inf 3.184000e+00 9.422111e-01 1078 9 11 65 2 1 2 3 -6.776078e-03 5.000000e-01 5.067761e-01 Inf 6.094000e+00 8.204792e-01 9 4 18 41 2 1 3 4 4.461187e-02 5.000000e-01 4.553881e-01 1.020778e+01 6.105000e+00 1.146601e+00 9 5 26 28 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Node limit reached Primal Objective: 0.49999999999999994 Dual Bound: 0.04461186712171719 Dual Gap (relative): 10.207780177319645 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 26 Total time (s): 6.105 LMO calls / sec: 4.2588042588042585 Nodes / sec: 1.1466011466011465 LMO calls / node: 3.7142857142857144 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 Test Summary: | Pass Total Time Different line search types | 8 8 2m32.2s Test Summary: | Pass Total Time Lazification | 5 5 18.9s Test Summary: | Pass Total Time DICG - Lazification | 10 10 1m17.2s Test Summary: | Pass Total Time DICG - warm_start | 5 5 1m02.3s Test Summary: | Pass Total Time Linear feasible | 4 4 0.1s Test Summary: | Pass Total Time Integer bounds | 10 10 0.1s Test Summary: | Pass Total Time Cube LMO | 4 4 22.3s Test Summary: | Pass Total Time BLMO - Strong Branching | 4 4 20.4s Test Summary: | Pass Total Time Probability Simplex LMO | 4 4 1m07.2s Test Summary: | Pass Total Time Unit Simplex LMO | 4 4 1m19.1s Test Summary: | Pass Total Time Indicators | 5 5 0.3s Test Summary: | Pass Total Time Hyperplane Aware Rounding - Probability Simplex | 2 2 24.8s Test Summary: | Pass Total Time Hyperplane Aware Rounding - Unit Simplex | 2 2 40.0s Test Summary: | Pass Total Time Following Gradient Heuristic - Unit Simplex | 6 6 1m05.1s Test Summary: | Pass Total Time Rounding Heuristic - Unit Simplex | 3 3 59.7s Test Summary: | Pass Total Time Probability Rounding - Unit Cube | 2 2 20.2s Test Summary: | Pass Total Time Probability rounding - Probability Simplex | 4 4 19.0s Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive 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.721505e+00 1.773523e+00 5.201780e-02 3.021647e-02 1.398500e+01 2.145156e-01 6020 49 11 39 3 1 7 2 1.764568e+00 1.773523e+00 8.955068e-03 5.074936e-03 1.415000e+01 6.360424e-01 7 5 35 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 lazy_tolerance: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.153548e+00 -6.864419e-01 6.839990e+00 0.000000e+00 Inf 1 LD 3 2.017814e+00 1.743024e+00 2.747906e-01 2.141698e+00 1.400758e+00 2 LD 5 1.773523e+00 1.773523e+00 0.000000e+00 2.317195e+00 2.157781e+00 1 Last 5 1.773523e+00 1.773523e+00 0.000000e+00 2.325223e+00 2.150331e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 1.773523e+00 1.773523e+00 0.000000e+00 2.329595e+00 2.146296e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.7735226475280377 Dual Bound: 1.7645675794913342 Dual Gap (relative): 0.005074936285118009 Search Statistics. Total number of nodes processed: 9 Total number of lmo calls: 41 Total time (s): 17.967 LMO calls / sec: 2.2819613736294317 Nodes / sec: 0.5009183503088996 LMO calls / node: 4.555555555555555 Total number of global tightenings: 45 Global tightenings / node: 6.43 Total number of local tightenings: 49 Local tightenings / node: 7.0 Total number of potential local tightenings: 50 Test Summary: | Pass Total Time Sparse Regression | 2 2 21.0s Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive 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.412116e+00 3.182643e+00 7.705277e-01 3.194406e-01 1.392700e+01 2.154089e-01 6177 210 33 97 14 0 * 3 4 2.434317e+00 3.159009e+00 7.246922e-01 2.976984e-01 1.418900e+01 4.933399e-01 63 46 64 31 9 1 100 41 2.896403e+00 3.159009e+00 2.626060e-01 9.066625e-02 2.201200e+01 6.405597e+00 33 23 1075 24 9 1 200 41 2.986019e+00 3.159009e+00 1.729895e-01 5.793316e-02 2.500800e+01 9.636916e+00 34 24 1559 30 12 2 300 41 3.039785e+00 3.159009e+00 1.192242e-01 3.922126e-02 2.783200e+01 1.225208e+01 40 28 2033 27 9 2 400 41 3.094475e+00 3.159009e+00 6.453413e-02 2.085463e-02 3.069800e+01 1.436576e+01 35 25 2536 30 7 0 461 40 3.129089e+00 3.159009e+00 2.991977e-02 9.561814e-03 3.247400e+01 1.542773e+01 7 5 2845 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 lazy_tolerance: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.726460e+00 1.460503e+00 6.265958e+00 0.000000e+00 Inf 1 LD 3 3.159009e+00 3.159009e+00 0.000000e+00 3.074322e-01 9.758251e+00 1 Last 3 3.159009e+00 3.159009e+00 0.000000e+00 5.355023e-01 5.602217e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 3 3.159009e+00 3.159009e+00 0.000000e+00 5.391685e-01 5.564123e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.159008859531241 Dual Bound: 3.1290890925251555 Dual Gap (relative): 0.009561813716828457 Search Statistics. Total number of nodes processed: 501 Total number of lmo calls: 2850 Total time (s): 34.563 LMO calls / sec: 82.45811995486503 Nodes / sec: 14.49526950785522 LMO calls / node: 5.688622754491018 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: 15th entry: 0.15366383504908251 26th entry: 0.15366383504908251 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive 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.540996e+00 3.182643e+00 6.416473e-01 2.525180e-01 2.780000e-01 1.079137e+01 273 216 33 97 14 0 * 3 4 2.560602e+00 3.159009e+00 5.984073e-01 2.336980e-01 5.810000e-01 1.204819e+01 114 45 64 31 9 1 100 18 3.009208e+00 3.159009e+00 1.498006e-01 4.978074e-02 8.705000e+00 1.355543e+01 40 29 1154 27 10 1 199 17 3.130236e+00 3.159009e+00 2.877259e-02 9.191828e-03 1.339000e+01 1.613144e+01 33 23 1922 26 9 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 lazy_tolerance: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.726460e+00 1.460503e+00 6.265958e+00 0.000000e+00 Inf 1 LD 3 3.159009e+00 3.159009e+00 0.000000e+00 1.287457e-03 2.330175e+03 1 Last 3 3.159009e+00 3.159009e+00 0.000000e+00 8.971373e-03 3.343970e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 3 3.159009e+00 3.159009e+00 0.000000e+00 1.311285e-02 2.287832e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.159008859531241 Dual Bound: 3.1302362673835336 Dual Gap (relative): 0.009191827609791717 Search Statistics. Total number of nodes processed: 216 Total number of lmo calls: 1927 Total time (s): 13.417 LMO calls / sec: 143.6237609003503 Nodes / sec: 16.09897890735634 LMO calls / node: 8.921296296296296 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 Test Summary: | Pass Total Time Sparse Regression Group | 7 7 50.6s Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive 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 -4.499794e+02 -4.160716e+02 3.390780e+01 8.149511e-02 1.814300e+01 1.653530e-01 10170 124 37 5021 21 1 3 0 -4.499794e+02 -4.160716e+02 3.390780e+01 8.149511e-02 1.819500e+01 1.648805e-01 10 6 41 6 6 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 lazy_tolerance: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.315320e+02 7.271441e+02 4.387984e+00 0.000000e+00 Inf 1 LD 7 -4.241110e+02 -4.251934e+02 1.082471e+00 2.936022e-01 2.384178e+01 2 LD 103 -4.378870e+02 -4.383182e+02 4.311928e-01 5.209596e-01 1.977121e+02 4 LD 142 -4.389811e+02 -4.391687e+02 1.876671e-01 5.409358e-01 2.625080e+02 5 LD 192 -4.393763e+02 -4.394378e+02 6.155201e-02 5.681247e-01 3.379540e+02 6 LD 221 -4.394291e+02 -4.394587e+02 2.959844e-02 5.816309e-01 3.799660e+02 6 LD 255 -4.394364e+02 -4.394469e+02 1.053054e-02 5.999168e-01 4.250589e+02 7 LD 305 -4.394378e+02 -4.394417e+02 3.948080e-03 6.246444e-01 4.882778e+02 8 LD 382 -4.394381e+02 -4.394397e+02 1.640298e-03 6.776984e-01 5.636726e+02 9 LD 429 -4.394381e+02 -4.394386e+02 5.154940e-04 7.010024e-01 6.119808e+02 10 LD 543 -4.394381e+02 -4.394383e+02 1.992523e-04 7.447491e-01 7.291046e+02 10 LD 676 -4.394381e+02 -4.394382e+02 7.642391e-05 8.093158e-01 8.352734e+02 10 LD 804 -4.394381e+02 -4.394381e+02 2.922672e-05 8.565454e-01 9.386542e+02 10 LD 935 -4.394381e+02 -4.394381e+02 1.074353e-05 9.055744e-01 1.032494e+03 10 P 1000 -4.394381e+02 -4.394381e+02 1.074353e-05 9.318813e-01 1.073098e+03 10 LD 1060 -4.394381e+02 -4.394381e+02 4.271274e-06 1.037712e+00 1.021478e+03 10 LD 1186 -4.394381e+02 -4.394381e+02 1.654787e-06 1.085136e+00 1.092950e+03 10 LD 1303 -4.394381e+02 -4.394381e+02 6.412711e-07 1.129587e+00 1.153519e+03 10 P 2000 -4.394381e+02 -4.394381e+02 6.412711e-07 1.402514e+00 1.426011e+03 10 P 3000 -4.394381e+02 -4.394381e+02 6.412711e-07 1.773148e+00 1.691907e+03 10 P 4000 -4.394381e+02 -4.394381e+02 6.412711e-07 2.147571e+00 1.862569e+03 10 P 5000 -4.394381e+02 -4.394381e+02 6.412711e-07 2.521347e+00 1.983067e+03 10 P 6000 -4.394381e+02 -4.394381e+02 6.412711e-07 2.899897e+00 2.069039e+03 10 P 7000 -4.394381e+02 -4.394381e+02 6.412711e-07 3.273167e+00 2.138602e+03 10 P 8000 -4.394381e+02 -4.394381e+02 6.412711e-07 3.639290e+00 2.198231e+03 10 P 9000 -4.394381e+02 -4.394381e+02 6.412711e-07 4.012595e+00 2.242938e+03 10 P 10000 -4.394381e+02 -4.394381e+02 6.412711e-07 4.394191e+00 2.275732e+03 10 Last 10001 -4.394381e+02 -4.394381e+02 5.531301e-07 4.398677e+00 2.273638e+03 10 ---------------------------------------------------------------------------------------------------------------- PP 10001 -4.394381e+02 -4.394381e+02 5.531301e-07 4.402254e+00 2.271791e+03 10 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: -439.4381013346597 Dual Bound: -439.4381018877898 Dual Gap (relative): 1.2587213525212823e-9 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 71 Total time (s): 24.22 LMO calls / sec: 2.9314616019818334 Nodes / sec: 0.12386457473162676 LMO calls / node: 23.666666666666668 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 Test Summary: | Pass Total Time Poisson sparse regression | 2 2 26.6s Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive 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 -4.049480e+02 -4.039599e+02 9.881096e-01 2.446059e-03 1.568800e+01 1.912290e-01 4985 46 8 6 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 lazy_tolerance: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -2.139845e+02 -2.146834e+02 6.988158e-01 0.000000e+00 Inf 1 LD 2 -4.039599e+02 -4.039599e+02 0.000000e+00 1.931110e-01 1.035674e+01 1 Last 2 -4.039599e+02 -4.039599e+02 0.000000e+00 3.785327e-01 5.283559e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -4.039599e+02 -4.039599e+02 0.000000e+00 3.833713e-01 5.216875e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -403.9598963864059 Dual Bound: -404.9480059421999 Dual Gap (relative): 0.002446058543516578 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 17.695 LMO calls / sec: 0.734670810963549 Nodes / sec: 0.16953941791466515 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 Test Summary: | Pass Total Time Hybrid branching poisson sparse regression | 3 3 20.0s ERROR: LoadError: invalid redefinition of constant Main.groups. This redefinition may be permitted using the `const` keyword. Stacktrace: [1] top-level scope @ ~/.julia/packages/Boscia/Jilti/test/poisson.jl:186 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:301 [3] top-level scope @ ~/.julia/packages/Boscia/Jilti/test/runtests.jl:45 [4] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:301 [5] top-level scope @ none:6 [6] eval(m::Module, e::Any) @ Core ./boot.jl:485 [7] exec_options(opts::Base.JLOptions) @ Base ./client.jl:295 [8] _start() @ Base ./client.jl:558 in expression starting at /home/pkgeval/.julia/packages/Boscia/Jilti/test/poisson.jl:186 in expression starting at /home/pkgeval/.julia/packages/Boscia/Jilti/test/runtests.jl:45 Testing failed after 1201.07s ERROR: LoadError: Package Boscia errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{Pkg.Types.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.12/Pkg/src/Operations.jl:2359 [3] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2214 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{Pkg.Types.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.12/Pkg/src/API.jl:481 [5] test(pkgs::Vector{Pkg.Types.PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:159 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:147 [7] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:147 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:146 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:300 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:329 [12] _start() @ Base ./client.jl:558 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1403.79s: package tests unexpectedly errored