Package evaluation of Boscia on Julia 1.13.0-DEV.922 (90e3c1a568*) started at 2025-07-29T18:27:41.088 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.74s ################################################################################ # 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.1 [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.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+0 [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.61s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 119.22s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_J5w39k/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.19.0 [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.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_J5w39k/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.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.0 [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.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+0 [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... 10797.6 ms ✓ Distributions 1 dependency successfully precompiled in 13 seconds. 46 already precompiled. Precompiling packages... 3844.2 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 4 seconds. 23 already precompiled. Precompiling packages... 4620.6 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 49 already precompiled. Precompiling packages... 4803.7 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 52 already precompiled. seed = 0x1b096a18834ba0ef Sharpness: Error During Test at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/interface_test.jl:163 Got exception outside of a @test AssertionError: node dual gap is negative: -1.1102230246251565e-16 Stacktrace: [1] tightening_lowerbound(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedBoundedLMO{Boscia.CubeSimpleBLMO}}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, x::Vector{Float64}, lower_bound::Float64) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/tightenings.jl:228 [2] evaluate_node!(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedBoundedLMO{Boscia.CubeSimpleBLMO}}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/node.jl:383 [3] optimize!(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedBoundedLMO{Boscia.CubeSimpleBLMO}}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}; callback::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#39#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}}) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/custom_bonobo.jl:35 [4] solve(f::var"#f#f##5", grad!::var"#grad!#grad!##3", blmo::Boscia.ManagedBoundedLMO{Boscia.CubeSimpleBLMO}; traverse_strategy::Bonobo.BestFirstSearch, branching_strategy::Bonobo.MOST_INFEASIBLE, variant::Boscia.BPCG, line_search::FrankWolfe.Secant{FrankWolfe.var"#Secant##2#Secant##3", FrankWolfe.Adaptive{Float64, Int64, FrankWolfe.var"#Adaptive##4#Adaptive##5"}}, active_set::Nothing, lazy::Bool, lazy_tolerance::Float64, fw_epsilon::Float64, verbose::Bool, dual_gap::Float64, rel_dual_gap::Float64, time_limit::Float64, node_limit::Float64, print_iter::Int64, dual_gap_decay_factor::Float64, max_fw_iter::Int64, min_number_lower::Float64, min_node_fw_epsilon::Float64, use_postsolve::Bool, min_fw_iterations::Int64, max_iteration_post::Int64, dual_tightening::Bool, global_dual_tightening::Bool, bnb_callback::Nothing, strong_convexity::Float64, sharpness_constant::Float64, sharpness_exponent::Float64, domain_oracle::typeof(Boscia._trivial_domain), find_domain_point::typeof(Boscia._trivial_domain_point), start_solution::Nothing, fw_verbose::Bool, use_shadow_set::Bool, custom_heuristics::Vector{Boscia.Heuristic{Boscia.var"#Heuristic##0#Heuristic##1"}}, rounding_prob::Float64, clean_solutions::Bool, max_clean_iter::Int64, use_strong_lazy::Bool, use_DICG_warm_start::Bool, use_strong_warm_start::Bool, build_dicg_start_point::typeof(Boscia.trivial_build_dicg_start_point), kwargs::@Kwargs{}) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/interface.jl:344 [5] #solve#107 @ ~/.julia/packages/Boscia/qQ4D3/src/managed_blmo.jl:340 [inlined] [6] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/interface_test.jl:133 [7] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1859 [inlined] [8] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/interface_test.jl:164 [inlined] [9] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1859 [inlined] [10] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/interface_test.jl:172 [inlined] [11] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:312 [12] IncludeInto @ ./Base.jl:313 [inlined] [13] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [inlined] [14] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1859 [inlined] [15] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [16] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:312 [17] top-level scope @ none:6 [18] eval(m::Module, e::Any) @ Core ./boot.jl:489 [19] exec_options(opts::Base.JLOptions) @ Base ./client.jl:286 [20] _start() @ Base ./client.jl:553 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xedb636af463b9fff seed = 0x8e5b8b831ee0f2c8 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xdf54517138d99b17 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.006620e+00 1.082144e+00 7.552431e-02 7.502762e-02 2.235200e+01 1.342162e-01 9309 80 15 15 7 1 19 2 1.077116e+00 1.082144e+00 5.028302e-03 4.668301e-03 2.741500e+01 7.660040e-01 15 11 104 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 5.055370e+00 -1.724231e+00 6.779601e+00 0.000000e+00 Inf 1 LD 3 1.443722e+00 9.619990e-01 4.817232e-01 2.693955e+00 1.113604e+00 2 LD 6 1.082144e+00 1.082144e+00 0.000000e+00 2.887537e+00 2.077895e+00 1 Last 6 1.082144e+00 1.082144e+00 0.000000e+00 2.900166e+00 2.068847e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 6 1.082144e+00 1.082144e+00 0.000000e+00 2.907007e+00 2.063979e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.0821443658118155 Dual Bound: 1.0771160637893686 Dual Gap (relative): 0.004668301022971423 Search Statistics. Total number of nodes processed: 21 Total number of lmo calls: 110 Total time (s): 32.395 LMO calls / sec: 3.3955857385398978 Nodes / sec: 0.648248186448526 LMO calls / node: 5.238095238095238 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 135 Local tightenings / node: 7.11 Total number of potential local tightenings: 254 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.593965e+00 3.336716e+00 7.427514e-01 2.863383e-01 2.050500e+01 1.463058e-01 9565 285 31 74 15 0 * 3 4 2.644298e+00 3.322909e+00 6.786108e-01 2.566317e-01 2.089800e+01 3.349603e-01 111 84 67 24 10 1 100 29 3.130288e+00 3.322909e+00 1.926212e-01 6.153467e-02 3.001600e+01 4.297708e+00 57 43 903 20 10 0 200 29 3.243286e+00 3.322909e+00 7.962284e-02 2.455005e-02 3.446900e+01 6.643651e+00 49 36 1361 24 9 0 253 26 3.293090e+00 3.322909e+00 2.981925e-02 9.055098e-03 3.646200e+01 7.651802e+00 7 5 1580 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 9.064776e+00 3.569265e-01 8.707849e+00 0.000000e+00 Inf 1 LD 3 3.569539e+00 3.303105e+00 2.664339e-01 3.295736e-01 9.102672e+00 2 LD 5 3.322909e+00 3.322909e+00 0.000000e+00 5.591654e-01 8.941898e+00 1 Last 5 3.322909e+00 3.322909e+00 0.000000e+00 5.727642e-01 8.729596e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.322909e+00 3.322909e+00 0.000000e+00 5.800202e-01 8.620390e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.3229091613222606 Dual Bound: 3.2930899102906634 Dual Gap (relative): 0.009055097748292308 Search Statistics. Total number of nodes processed: 279 Total number of lmo calls: 1586 Total time (s): 38.665 LMO calls / sec: 41.01900944006207 Nodes / sec: 7.215828268459847 LMO calls / node: 5.684587813620071 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: 1th entry: 0.17554058931692182 28th entry: 0.17554058931692182 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.735583e+00 3.336716e+00 6.011329e-01 2.197458e-01 3.720000e-01 8.064516e+00 367 297 31 74 15 0 * 3 4 2.768815e+00 3.322909e+00 5.540946e-01 2.001198e-01 7.920000e-01 8.838384e+00 114 86 67 24 10 1 100 10 3.268832e+00 3.322909e+00 5.407738e-02 1.654333e-02 9.642000e+00 1.140842e+01 40 29 988 20 9 1 110 10 3.290717e+00 3.322909e+00 3.219227e-02 9.782754e-03 1.015300e+01 1.181917e+01 42 31 1054 20 10 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 9.064776e+00 3.569265e-01 8.707849e+00 0.000000e+00 Inf 1 LD 3 3.569539e+00 3.303105e+00 2.664339e-01 1.255788e-03 2.388938e+03 2 LD 5 3.322909e+00 3.322909e+00 0.000000e+00 6.494957e-03 7.698280e+02 1 Last 5 3.322909e+00 3.322909e+00 0.000000e+00 1.621618e-02 3.083340e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.322909e+00 3.322909e+00 0.000000e+00 2.126719e-02 2.351039e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.3229091613222606 Dual Bound: 3.290716888429649 Dual Gap (relative): 0.009782753723300017 Search Statistics. Total number of nodes processed: 120 Total number of lmo calls: 1060 Total time (s): 10.19 LMO calls / sec: 104.02355250245338 Nodes / sec: 11.776251226692837 LMO calls / node: 8.833333333333334 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 = 0xe9df809151bbbfd4 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 -6.974763e+01 -5.451796e+01 1.522967e+01 2.793515e-01 1.867100e+01 1.606770e-01 8989 105 29 588 13 1 * 4 5 -6.974509e+01 -5.572146e+01 1.402363e+01 2.516737e-01 2.053700e+01 4.382334e-01 604 118 105 322 16 7 * 25 26 -6.973633e+01 -5.590880e+01 1.382753e+01 2.473230e-01 4.613900e+01 1.105356e+00 1150 153 748 670 12 8 * 45 46 -6.972749e+01 -5.704232e+01 1.268517e+01 2.223818e-01 6.888200e+01 1.321100e+00 501 114 1344 299 21 4 100 101 -6.971161e+01 -5.704232e+01 1.266930e+01 2.221035e-01 1.396500e+02 1.439313e+00 1221 142 3014 738 21 8 * 180 181 -6.968947e+01 -5.726192e+01 1.242755e+01 2.170300e-01 2.530890e+02 1.426376e+00 1389 131 5426 831 17 8 200 201 -6.967640e+01 -5.726192e+01 1.241448e+01 2.168017e-01 2.808000e+02 1.428063e+00 1065 135 6014 599 17 13 300 301 -6.960782e+01 -5.726192e+01 1.234590e+01 2.156040e-01 3.945060e+02 1.523424e+00 447 98 8951 301 13 2 * 357 358 -6.957455e+01 -5.737240e+01 1.220215e+01 2.126833e-01 4.592310e+02 1.556951e+00 1049 111 10668 829 21 5 399 400 -6.956301e+01 -5.737240e+01 1.219061e+01 2.124822e-01 5.000050e+02 1.597984e+00 276 37 11926 237 12 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.987774e+02 1.941343e+02 4.643112e+00 0.000000e+00 Inf 1 LD 5 -6.539505e+01 -6.644484e+01 1.049787e+00 3.877832e-01 1.289380e+01 2 LD 203 -6.805239e+01 -6.818716e+01 1.347716e-01 7.957586e-01 2.551025e+02 5 LD 232 -6.805985e+01 -6.812142e+01 6.156721e-02 8.270588e-01 2.805121e+02 7 LD 260 -6.806181e+01 -6.808978e+01 2.797051e-02 8.540478e-01 3.044326e+02 8 LD 294 -6.806232e+01 -6.807338e+01 1.105195e-02 9.849707e-01 2.984860e+02 9 LD 335 -6.806242e+01 -6.806716e+01 4.737577e-03 1.021146e+00 3.280627e+02 11 LD 387 -6.806244e+01 -6.806439e+01 1.949329e-03 1.056721e+00 3.662274e+02 12 LD 462 -6.806245e+01 -6.806323e+01 7.824322e-04 1.103315e+00 4.187382e+02 13 LD 526 -6.806245e+01 -6.806275e+01 3.049631e-04 1.139952e+00 4.614231e+02 13 LD 626 -6.806245e+01 -6.806256e+01 1.152457e-04 1.198857e+00 5.221641e+02 14 LD 693 -6.806245e+01 -6.806251e+01 5.670092e-05 1.243187e+00 5.574381e+02 14 LD 785 -6.806245e+01 -6.806247e+01 2.629336e-05 1.304282e+00 6.018636e+02 15 LD 886 -6.806245e+01 -6.806246e+01 1.294489e-05 1.368286e+00 6.475254e+02 16 LD 958 -6.806245e+01 -6.806245e+01 6.412606e-06 1.417090e+00 6.760331e+02 17 P 1000 -6.806245e+01 -6.806245e+01 6.412606e-06 1.447069e+00 6.910521e+02 17 LD 1033 -6.806245e+01 -6.806245e+01 2.156800e-06 1.566390e+00 6.594781e+02 18 P 2000 -6.806245e+01 -6.806245e+01 2.156800e-06 2.324074e+00 8.605579e+02 18 P 3000 -6.806245e+01 -6.806245e+01 2.156800e-06 3.033956e+00 9.888081e+02 18 P 4000 -6.806245e+01 -6.806245e+01 2.156800e-06 3.641106e+00 1.098567e+03 18 P 5000 -6.806245e+01 -6.806245e+01 2.156800e-06 4.233817e+00 1.180967e+03 18 P 6000 -6.806245e+01 -6.806245e+01 2.156800e-06 4.820027e+00 1.244806e+03 18 P 7000 -6.806245e+01 -6.806245e+01 2.156800e-06 5.386096e+00 1.299643e+03 18 P 8000 -6.806245e+01 -6.806245e+01 2.156800e-06 5.940279e+00 1.346738e+03 18 P 9000 -6.806245e+01 -6.806245e+01 2.156800e-06 6.522843e+00 1.379767e+03 18 P 10000 -6.806245e+01 -6.806245e+01 2.156800e-06 7.071263e+00 1.414175e+03 18 Last 10001 -6.806245e+01 -6.806245e+01 1.268802e-06 7.077299e+00 1.413110e+03 18 ---------------------------------------------------------------------------------------------------------------- PP 10001 -6.806245e+01 -6.806245e+01 1.268802e-06 7.082651e+00 1.412042e+03 18 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -68.06244842551895 Dual Bound: -69.563011940587 Dual Gap (relative): 0.022046863575737 Search Statistics. Total number of nodes processed: 799 Total number of lmo calls: 11962 Total time (s): 508.967 LMO calls / sec: 23.502506056384796 Nodes / sec: 1.5698463751087988 LMO calls / node: 14.971214017521902 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 -6.977238e+01 -6.006823e+01 9.704147e+00 1.615521e-01 2.758500e+01 1.087548e-01 14881 30 5 10001 3 0 * 2 3 -6.977238e+01 -6.332653e+01 6.445854e+00 1.017876e-01 2.934000e+01 1.704158e-01 526 238 32 164 10 1 * 9 10 -6.859428e+01 -6.350536e+01 5.088924e+00 8.013378e-02 3.867200e+01 4.913115e-01 354 181 184 121 8 4 * 11 12 -6.852831e+01 -6.385423e+01 4.674075e+00 7.319914e-02 4.130600e+01 5.568198e-01 560 183 225 256 6 5 * 19 20 -6.817373e+01 -6.389153e+01 4.282196e+00 6.702290e-02 5.098700e+01 7.649009e-01 342 165 374 135 8 3 * 21 22 -6.811584e+01 -6.420683e+01 3.909008e+00 6.088150e-02 5.285400e+01 8.135619e-01 259 134 412 102 10 8 * 23 24 -6.807750e+01 -6.433049e+01 3.747015e+00 5.824633e-02 5.464100e+01 8.601600e-01 277 146 447 119 17 2 * 33 34 -6.768730e+01 -6.534733e+01 2.339967e+00 3.580815e-02 6.479500e+01 1.034030e+00 317 137 628 145 10 5 100 89 -6.696035e+01 -6.534733e+01 1.613017e+00 2.468375e-02 1.240110e+02 1.524058e+00 248 123 1690 91 14 5 200 129 -6.658427e+01 -6.534733e+01 1.236942e+00 1.892872e-02 1.819320e+02 1.808368e+00 102 56 2823 41 9 5 300 149 -6.631963e+01 -6.534733e+01 9.722950e-01 1.487888e-02 2.324460e+02 1.931631e+00 77 53 3835 19 13 3 400 159 -6.605291e+01 -6.534733e+01 7.055756e-01 1.079731e-02 2.690870e+02 2.077395e+00 100 59 4800 37 14 5 419 158 -6.600076e+01 -6.534733e+01 6.534339e-01 9.999396e-03 2.749950e+02 2.098220e+00 53 42 4967 6 5 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 -2.771960e+01 -2.841016e+01 6.905566e-01 0.000000e+00 Inf 1 LD 2 -6.534733e+01 -6.534733e+01 0.000000e+00 1.584208e-01 1.262460e+01 1 Last 2 -6.534733e+01 -6.534733e+01 0.000000e+00 3.175225e-01 6.298767e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -6.534733e+01 -6.534733e+01 0.000000e+00 3.221481e-01 6.208325e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -65.34733043834176 Dual Bound: -66.00076430367642 Dual Gap (relative): 0.009999396470391511 Search Statistics. Total number of nodes processed: 577 Total number of lmo calls: 4972 Total time (s): 276.712 LMO calls / sec: 17.968140160166527 Nodes / sec: 2.0852004972679175 LMO calls / node: 8.616984402079723 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:312 [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:1859 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:312 [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 | 127 2 129 31m15.9s Norm hyperbox | 4 4 53.6s Norm hyperbox - strong branching | 2 2 48.6s Normbox - Shadow set activation | 4 4 23.6s Normbox - strong convexity and sharpness | 4 1 5 21.0s Strong convexity | 2 2 17.5s Sharpness | 1 1 3.4s Strong convexity and sharpness | 2 2 0.1s Start with Active Set | 2 2 18.3s Interface - sparse poisson regression | 4 4 23.9s Different FW variants | 10 10 1m05.0s Different line search types | 8 8 2m26.7s Lazification | 5 5 21.4s DICG - Lazification | 10 10 1m37.8s DICG - warm_start | 5 5 1m14.8s User stop | 2 2 15.5s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 24.5s BLMO - Strong Branching | 4 4 21.9s Probability Simplex LMO | 4 4 53.7s Unit Simplex LMO | 4 4 56.1s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 24.9s Hyperplane Aware Rounding - Unit Simplex | 2 2 25.8s Following Gradient Heuristic - Unit Simplex | 6 6 38.1s Rounding Heuristic - Unit Simplex | 3 3 40.4s Probability Rounding - Unit Cube | 2 2 28.4s Probability rounding - Probability Simplex | 3 3 27.1s Sparse Regression | 2 2 38.7s Sparse Regression Group | 7 7 53.4s Poisson sparse regression | 2 2 8m32.7s Hybrid branching poisson sparse regression | 3 3 4m40.5s RNG of the outermost testset: Xoshiro(0x04ab81db77083660, 0x68384dd8154dc75b, 0xd6b69d92b290a8ba, 0x82299c5144c843b8, 0xfe08c57a153eb21b) ERROR: LoadError: Some tests did not pass: 127 passed, 0 failed, 2 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Testing failed after 1907.41s 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:2695 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2544 [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] 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:311 [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 2070.87s: package tests unexpectedly errored