Package evaluation to test Boscia on Julia 1.14.0-DEV.1826 (44c835795b*) started at 2026-03-02T16:30:31.009 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 14.64s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.8 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.3 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.8 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.3 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.3.2 [f55ce6ea] + FrankWolfe v0.6.3 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.49.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.7.1 [90137ffa] + StaticArrays v1.9.17 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.6.3 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.30+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 6.34s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 2002.5 ms ✓ Bonobo 1290.1 ms ✓ LEMON_jll 1500.7 ms ✓ Ipopt_jll 11056.6 ms ✓ MathOptSetDistances 34137.9 ms ✓ FrankWolfe 21088.4 ms ✓ GraphsFlows ERROR: LoadError: UndefVarError: `get_liblemoncxxwrap_path` not defined in `LEMON_jll` Suggestion: check for spelling errors or missing imports. Stacktrace:  [1] getproperty(x::Module, f::Symbol)  @ Base ./Base_compiler.jl:51  [2] top-level scope  @ ~/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:9  [3] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [4] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3288  [5] top-level scope  @ stdin:5  [6] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [7] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [8] include_string  @ ./loading.jl:3140 [inlined]  [9] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [10] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:1 in expression starting at stdin:5 ✗ LEMONGraphs 5958.5 ms ✓ SCIP_PaPILO_jll 1617.9 ms ✓ SCIP_jll 14488.4 ms ✓ Boscia ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14b1564f-c77f-4800-9e89-efd961faef7c"), "LEMONGraphs") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2840  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2694  [4] macro expansion  @ ./loading.jl:2621 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2585  [7] require  @ ./loading.jl:2561 [inlined]  [8] eval_import_path  @ ./module.jl:36 [inlined]  [9] _eval_import(imported::Bool, to::Module, from::Nothing, paths::Expr)  @ Base ./module.jl:111  [10] top-level scope  @ ~/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:10  [11] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [12] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3288  [13] top-level scope  @ stdin:5  [14] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [15] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [16] include_string  @ ./loading.jl:3140 [inlined]  [17] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [18] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:1 in expression starting at stdin:5 ✗ GraphsMatching 26375.3 ms ✓ SCIP 10882.7 ms ✓ Boscia → BosciaHiGHSExt ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("c3af3a8c-b79e-4b01-bf44-c718d7e0e0d6"), "GraphsMatching") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2840  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2694  [4] macro expansion  @ ./loading.jl:2621 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2585  [7] require  @ ./loading.jl:2561 [inlined]  [8] eval_import_path  @ ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using  @ ./module.jl:137 [inlined]  [11] _eval_using(to::Module, path::Expr)  @ Base ./module.jl:137  [12] top-level scope  @ ~/.julia/packages/CombinatorialLinearOracles/2KdaS/src/CombinatorialLinearOracles.jl:6  [13] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3288  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [18] include_string  @ ./loading.jl:3140 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [20] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/CombinatorialLinearOracles/2KdaS/src/CombinatorialLinearOracles.jl:1 in expression starting at stdin:5 ✗ CombinatorialLinearOracles 18597.0 ms ✓ Boscia → BosciaSCIPExt 12 dependencies successfully precompiled in 193 seconds. 168 already precompiled. Precompilation completed after 223.69s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_8U82Sr/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.8 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.4 [31c24e10] Distributions v0.25.123 [497a8b3b] DoubleFloats v1.5.5 [f55ce6ea] FrankWolfe v0.6.3 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.21.1 [b8f27783] MathOptInterface v1.49.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [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_8U82Sr/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.3 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.8 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.4 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.3 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.123 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.5.5 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.2 [f55ce6ea] FrankWolfe v0.6.3 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.14.0 [06909019] GraphsFlows v0.1.1 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.21.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [4076af6c] JuMP v1.29.4 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.2 [b8f27783] MathOptInterface v1.49.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.1 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.9 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.17 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.6.3 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.13.1+0 [e33a78d0] Hwloc_jll v2.13.0+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.9+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [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.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [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.14.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.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.18.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.30+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.5+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0x2ee8ab187784b3d0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##0", var"#grad!#grad!##0", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##1", var"#grad!#grad!##1", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##2", var"#grad!#grad!##2", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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.ManagedLMO{Boscia.CubeLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##8", var"#grad!#grad!##4", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##11"{Float64}, var"#grad!#grad!##5"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##14", var"#grad!#grad!##6", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = OPT_TREE_EMPTY Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = OPT_TREE_EMPTY LMO Tests seed = 0x64954b7dcff1b3f2 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##40", var"#grad!#grad!##16", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##46", var"#grad!#grad!##18", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##49", var"#grad!#grad!##19", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ReverseKnapsackLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0x3d8efb9d248ea636 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##55", var"#grad!#grad!##21", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##58", var"#grad!#grad!##22", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##61", var"#grad!#grad!##23", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 Sparse Regression Tests seed = 0x19964ec8907e663e 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 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 3.084709e+00 3.217606e+00 1.328970e-01 4.308252e-02 2.347700e+01 1.277846e-01 9546 42 14 17 8 0 * 2 3 3.084709e+00 3.175497e+00 9.078846e-02 2.943178e-02 2.728200e+01 1.832710e-01 18 10 19 13 8 0 11 2 3.144469e+00 3.175497e+00 3.102781e-02 9.867424e-03 2.744300e+01 4.737091e-01 11 7 63 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.210457e+00 1.874001e+00 4.336455e+00 0.000000e+00 Inf 1 LD 2 3.175497e+00 3.175497e+00 0.000000e+00 2.344219e+00 8.531626e-01 1 Last 2 3.175497e+00 3.175497e+00 0.000000e+00 2.506237e+00 7.980091e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.175497e+00 3.175497e+00 0.000000e+00 2.509725e+00 7.969002e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.175497159276572 Dual Bound: 3.1444693483948134 Dual Gap (relative): 0.00986742354400675 Search Statistics. Total number of nodes processed: 13 Total number of lmo calls: 68 Total time (s): 32.617 LMO calls / sec: 2.0848024036545363 Nodes / sec: 0.3985651654045437 LMO calls / node: 5.230769230769231 Total number of global tightenings: 42 Global tightenings / node: 3.82 Total number of local tightenings: 42 Local tightenings / node: 3.82 Total number of potential local tightenings: 42 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 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.788470e+00 3.569147e+00 1.780677e+00 9.956423e-01 2.038200e+01 1.471887e-01 9611 213 43 96 29 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(tree::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##71", var"#grad!#grad!##27", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 100 69 2.789270e+00 3.569147e+00 7.798774e-01 2.795991e-01 2.819100e+01 5.994821e+00 21 14 1464 16 16 0 200 69 2.907975e+00 3.569147e+00 6.611719e-01 2.273650e-01 3.024900e+01 8.892856e+00 28 17 1884 27 15 0 300 69 2.980130e+00 3.569147e+00 5.890177e-01 1.976483e-01 3.240400e+01 1.138748e+01 31 19 2335 34 15 2 400 69 3.036628e+00 3.569147e+00 5.325189e-01 1.753652e-01 3.446700e+01 1.360722e+01 23 15 2777 24 11 2 500 69 3.083652e+00 3.569147e+00 4.854951e-01 1.574416e-01 3.635300e+01 1.565208e+01 16 11 3248 25 6 0 600 69 3.135660e+00 3.569147e+00 4.334875e-01 1.382444e-01 3.845600e+01 1.739651e+01 24 15 3739 21 8 2 700 69 3.188177e+00 3.569147e+00 3.809699e-01 1.194946e-01 4.062500e+01 1.892923e+01 23 15 4264 18 5 0 800 69 3.240069e+00 3.569147e+00 3.290781e-01 1.015651e-01 4.309000e+01 2.016709e+01 53 34 4841 52 16 5 900 69 3.301280e+00 3.569147e+00 2.678672e-01 8.114040e-02 4.553400e+01 2.128080e+01 17 12 5428 9 4 0 1000 69 3.369317e+00 3.569147e+00 1.998301e-01 5.930878e-02 4.799300e+01 2.227408e+01 30 19 6036 19 3 0 1100 45 3.468891e+00 3.569147e+00 1.002567e-01 2.890166e-02 5.024500e+01 2.278834e+01 27 16 6594 27 5 2 1147 10 3.537932e+00 3.569147e+00 3.121552e-02 8.823098e-03 5.111400e+01 2.263568e+01 11 6 6810 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.092463e+00 -1.554224e-01 8.247886e+00 0.000000e+00 Inf 1 LD 2 3.569147e+00 3.569147e+00 0.000000e+00 1.557921e-01 1.283762e+01 1 Last 2 3.569147e+00 3.569147e+00 0.000000e+00 3.212510e-01 6.225662e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.569147e+00 3.569147e+00 0.000000e+00 3.245938e-01 6.161548e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.569147295690765 Dual Bound: 3.537931776356621 Dual Gap (relative): 0.008823098156598591 Search Statistics. Total number of nodes processed: 1157 Total number of lmo calls: 6815 Total time (s): 54.109 LMO calls / sec: 125.94947236134469 Nodes / sec: 21.382764419967103 LMO calls / node: 5.890233362143475 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 11 Non zero entries: 23th entry: 0.16136111588571725 43th entry: 0.16136111588571725 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 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.935260e+00 3.569147e+00 1.633888e+00 8.442730e-01 2.120000e-01 1.415094e+01 206 158 43 96 29 1 100 33 2.875097e+00 3.569147e+00 6.940507e-01 2.414008e-01 7.635000e+00 1.741978e+01 25 16 1409 22 16 1 200 34 3.060547e+00 3.569147e+00 5.086006e-01 1.661796e-01 1.081200e+01 2.164262e+01 15 10 2081 26 15 2 300 34 3.179868e+00 3.569147e+00 3.892789e-01 1.224198e-01 1.403700e+01 2.379426e+01 28 18 2747 26 12 3 400 34 3.298536e+00 3.569147e+00 2.706112e-01 8.203977e-02 1.764200e+01 2.460039e+01 23 15 3501 21 8 1 500 33 3.433280e+00 3.569147e+00 1.358670e-01 3.957352e-02 2.144300e+01 2.485660e+01 32 20 4331 37 13 6 551 13 3.535397e+00 3.569147e+00 3.374991e-02 9.546284e-03 2.312700e+01 2.438708e+01 62 39 4717 63 11 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.092463e+00 -1.554224e-01 8.247886e+00 0.000000e+00 Inf 1 LD 2 3.569147e+00 3.569147e+00 0.000000e+00 1.415426e-03 1.413002e+03 1 Last 2 3.569147e+00 3.569147e+00 0.000000e+00 7.897473e-03 2.532456e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.569147e+00 3.569147e+00 0.000000e+00 1.132762e-02 1.765596e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.569147295690765 Dual Bound: 3.53539738702637 Dual Gap (relative): 0.00954628432669114 Search Statistics. Total number of nodes processed: 564 Total number of lmo calls: 4722 Total time (s): 23.151 LMO calls / sec: 203.96527147855383 Nodes / sec: 24.361798626409225 LMO calls / node: 8.372340425531915 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: 9 Poisson Tests seed = 0x93927fe7da42403e 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 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.103066e+02 -5.795042e+02 3.080246e+01 5.315313e-02 2.814100e+01 1.066060e-01 17017 150 58 6282 33 12 * 2 3 -6.103066e+02 -5.872785e+02 2.302815e+01 3.921164e-02 3.198800e+01 1.563086e-01 3842 106 98 2883 32 15 * 16 17 -6.092063e+02 -5.892583e+02 1.994804e+01 3.385280e-02 7.213200e+01 4.574946e-01 3551 99 608 2722 30 12 33 34 -6.085772e+02 -5.892583e+02 1.931892e+01 3.278514e-02 1.200050e+02 5.583101e-01 1726 64 1212 1152 22 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.035528e+02 -9.295045e+02 1.833057e+03 0.000000e+00 Inf 1 LD 2 -5.780439e+02 -6.733864e+02 9.534249e+01 1.695111e-01 1.179864e+01 2 LD 15 -6.003643e+02 -6.147900e+02 1.442563e+01 4.534523e-01 3.307956e+01 3 LD 27 -6.025347e+02 -6.054688e+02 2.934112e+00 4.781383e-01 5.646901e+01 4 LD 47 -6.027596e+02 -6.030344e+02 2.748215e-01 5.049780e-01 9.307337e+01 4 LD 64 -6.027700e+02 -6.028018e+02 3.184465e-02 5.277205e-01 1.212763e+02 4 LD 73 -6.027701e+02 -6.027731e+02 3.055405e-03 5.803818e-01 1.257793e+02 4 LD 92 -6.027701e+02 -6.027711e+02 1.048555e-03 6.007436e-01 1.531435e+02 4 LD 107 -6.027701e+02 -6.027704e+02 3.261849e-04 6.148063e-01 1.740385e+02 4 LD 117 -6.027701e+02 -6.027702e+02 1.025959e-04 6.237983e-01 1.875606e+02 4 LD 130 -6.027701e+02 -6.027701e+02 3.332391e-05 6.349407e-01 2.047435e+02 4 LD 145 -6.027701e+02 -6.027701e+02 9.998139e-06 6.474602e-01 2.239520e+02 4 LD 161 -6.027701e+02 -6.027701e+02 2.434492e-06 6.609445e-01 2.435908e+02 4 P 1000 -6.027701e+02 -6.027701e+02 2.434492e-06 1.390997e+00 7.189090e+02 4 LD 1010 -6.027701e+02 -6.027701e+02 8.551537e-07 1.458282e+00 6.925959e+02 4 Last 1010 -6.027701e+02 -6.027701e+02 8.551537e-07 1.463835e+00 6.899685e+02 4 ---------------------------------------------------------------------------------------------------------------- PP 1010 -6.027701e+02 -6.027701e+02 8.551537e-07 1.466574e+00 6.886800e+02 4 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Time limit reached Primal Objective: -602.7700827413147 Dual Bound: -608.5772090005972 Dual Gap (relative): 0.009634065169380233 Search Statistics. Total number of nodes processed: 67 Total number of lmo calls: 1233 Total time (s): 124.218 LMO calls / sec: 9.926097667004782 Nodes / sec: 0.5393743257820928 LMO calls / node: 18.402985074626866 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 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: 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 -5.333951e+02 -5.302507e+02 3.144334e+00 5.929901e-03 2.427400e+01 1.235890e-01 9779 127 27 114 11 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -2.861993e+02 -5.631897e+02 2.769904e+02 0.000000e+00 Inf 1 LD 2 -5.302507e+02 -5.302507e+02 0.000000e+00 1.636107e-01 1.222414e+01 1 Last 2 -5.302507e+02 -5.302507e+02 0.000000e+00 3.283004e-01 6.091982e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -5.302507e+02 -5.302507e+02 0.000000e+00 3.319925e-01 6.024232e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -530.2507457218016 Dual Bound: -533.395079929188 Dual Gap (relative): 0.005929900585252622 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 32 Total time (s): 27.305 LMO calls / sec: 1.1719465299395715 Nodes / sec: 0.10986998718183483 LMO calls / node: 10.666666666666666 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: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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: 41 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 2.286944e+02 3.556264e+02 1.269320e+02 5.550289e-01 2.141700e+01 1.400756e-01 10771 127 26 122 12 1 * 2 3 2.286944e+02 3.546983e+02 1.260039e+02 5.509707e-01 2.166700e+01 2.307657e-01 246 123 48 80 13 3 * 5 6 2.532742e+02 3.479349e+02 9.466072e+01 3.737480e-01 2.256500e+01 4.874806e-01 271 98 107 105 10 3 89 12 3.451488e+02 3.479349e+02 2.786142e+00 8.072293e-03 3.224700e+01 3.132074e+00 29 19 933 5 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.479349e+02 3.479349e+02 0.000000e+00 9.558767e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.479349e+02 3.479349e+02 0.000000e+00 1.794357e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 347.93490859740604 Dual Bound: 345.14876661848143 Dual Gap (relative): 0.00807229301793894 Search Statistics. Total number of nodes processed: 101 Total number of lmo calls: 937 Total time (s): 35.308 LMO calls / sec: 26.537895094596127 Nodes / sec: 2.860541520335335 LMO calls / node: 9.277227722772277 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 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: 41 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 2.286944e+02 3.556264e+02 1.269320e+02 5.550289e-01 2.419300e+01 1.240028e-01 10091 133 26 122 12 1 * 5 6 2.559758e+02 3.532177e+02 9.724188e+01 3.798870e-01 2.877500e+01 3.822763e-01 190 77 104 71 8 3 * 10 11 2.602886e+02 3.498591e+02 8.957049e+01 3.441199e-01 3.394600e+01 6.186296e-01 258 79 198 130 10 3 * 18 19 2.770710e+02 3.479349e+02 7.086393e+01 2.557609e-01 4.155800e+01 8.903220e-01 183 69 336 90 9 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(tree::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##81"{Float64}, var"#grad!#grad!##31"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 100 17 3.378343e+02 3.479349e+02 1.010061e+01 2.989811e-02 6.818500e+01 1.715920e+00 55 24 969 25 3 2 121 4 3.449650e+02 3.479349e+02 2.969918e+00 8.609332e-03 7.026500e+01 1.778980e+00 5 3 1057 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.479349e+02 3.479349e+02 0.000000e+00 9.172300e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.479349e+02 3.479349e+02 0.000000e+00 1.693931e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 347.93490859740604 Dual Bound: 344.96499045230945 Dual Gap (relative): 0.008609332040339812 Search Statistics. Total number of nodes processed: 125 Total number of lmo calls: 1061 Total time (s): 73.142 LMO calls / sec: 14.506029367531651 Nodes / sec: 1.7090044023953406 LMO calls / node: 8.488 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 Mean Risk Test seed = 0x0134a44be05632eb 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 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: 30 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 -3.362383e+01 3.792129e+01 7.154512e+01 Inf 2.383900e+01 1.258442e-01 11360 288 43 3603 24 5 * 2 3 -3.362383e+01 3.347518e+01 6.709901e+01 Inf 2.417600e+01 2.068167e-01 333 30 56 3256 21 8 * 3 4 -3.022995e+01 1.725810e+01 4.748805e+01 Inf 2.452800e+01 2.853881e-01 257 81 94 4228 21 6 * 12 13 -2.537866e+01 1.522937e+01 4.060804e+01 Inf 2.724400e+01 9.176332e-01 99 18 356 2326 17 5 * 35 36 -1.835886e+01 1.444061e+01 3.279947e+01 Inf 3.344800e+01 2.122698e+00 175 66 1094 2562 17 8 * 53 54 -1.587305e+01 1.334041e+01 2.921345e+01 Inf 3.820300e+01 2.800827e+00 208 92 1638 2704 19 8 100 101 -1.145487e+01 1.334041e+01 2.479528e+01 Inf 5.054300e+01 3.976812e+00 214 24 3107 5010 16 7 132 133 -9.291172e+00 1.334041e+01 2.263158e+01 Inf 6.000300e+01 4.416446e+00 331 97 4158 5874 25 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 13.34040583513675 Dual Bound: -9.29117182265005 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 265 Total number of lmo calls: 4158 Total time (s): 61.255 LMO calls / sec: 67.8801730470982 Nodes / sec: 4.32617745490164 LMO calls / node: 15.690566037735849 Total number of global tightenings: 15 Global tightenings / node: 0.11 Total number of local tightenings: 743 Local tightenings / node: 5.63 Total number of potential local tightenings: 1399 Time Limit Test seed = 0xc387210be88f4171 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 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: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.354626e+00 0.000000e+00 1.354626e+00 Inf 2.192500e+01 1.368301e-01 10966 85 31 1257 11 9 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(tree::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##85", var"#grad!#grad!##33", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 47 0 0.000000e+00 0.000000e+00 0.000000e+00 0.000000e+00 2.375600e+01 1.978448e+00 5 3 632 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: 0.0 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 47 Total number of lmo calls: 632 Total time (s): 24.963 LMO calls / sec: 25.31746985538597 Nodes / sec: 1.8827865240556023 LMO calls / node: 13.446808510638299 Total number of global tightenings: 5 Global tightenings / node: 0.11 Total number of local tightenings: 65 Local tightenings / node: 1.38 Total number of potential local tightenings: 77 Strong Convexity and Sharpness Tests seed = 0xf2b00d8919442af0 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 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 2.018019e+02 2.019978e+02 1.958987e-01 9.707477e-04 2.212000e+01 1.356239e-01 10225 0 13 22 3 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 201.997767711231 Dual Bound: 201.8018690152793 Dual Gap (relative): 0.0009707476789369061 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 23.447 LMO calls / sec: 0.5544419328698768 Nodes / sec: 0.12794813835458693 LMO calls / node: 4.333333333333333 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 17 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 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 1.973600e+02 1.973823e+02 2.229291e-02 1.129556e-04 1.731400e+01 1.732702e-01 7286 0 10 8 2 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 197.38231018270383 Dual Bound: 197.36001726932568 Dual Gap (relative): 0.00011295557067027483 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 10 Total time (s): 18.556 LMO calls / sec: 0.5389092476826902 Nodes / sec: 0.16167277430480706 LMO calls / node: 3.3333333333333335 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 18 Branching Strategy Tests seed = 0x4fc7817bdfde4e07 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 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 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 2.073200e+01 1.447038e-01 9845 46 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.220400e+01 2.927400e+00 9 6 953 27 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321771298479149 Dual Gap (relative): 0.008253858173238702 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 953 Total time (s): 23.416 LMO calls / sec: 40.698667577724635 Nodes / sec: 2.7758797403484796 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.890000e-01 7.712082e+00 243 43 48 3749 24 11 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(tree::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#build_examples##0"{Vector{Float64}}, var"#grad!#build_examples##1"{Vector{Float64}}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 2.002000e+00 4.345654e+01 4 2 1015 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.382204160353686 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 2.003 LMO calls / sec: 506.73989016475286 Nodes / sec: 43.434847728407384 LMO calls / node: 11.666666666666666 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 53 Local tightenings / node: 0.61 Total number of potential local tightenings: 108 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest most infeasible gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.710000e-01 8.086253e+00 224 43 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.602000e+00 3.682896e+01 4 2 859 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.338246272538823 Dual Gap (relative): 0.005990244287570652 Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 859 Total time (s): 1.603 LMO calls / sec: 535.870243293824 Nodes / sec: 36.805988771054274 LMO calls / node: 14.559322033898304 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 77 Local tightenings / node: 1.35 Total number of potential local tightenings: 167 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Uniform Random Choice FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.980000e-01 7.537688e+00 236 42 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.731000e+00 4.332756e+01 12 7 902 27 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.732 LMO calls / sec: 520.7852193995382 Nodes / sec: 43.302540415704385 LMO calls / node: 12.026666666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 54 Local tightenings / node: 0.74 Total number of potential local tightenings: 118 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Index FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.800000e-01 7.894737e+00 257 42 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 2.040000e+00 4.754902e+01 3 2 1174 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.325011777780223 Dual Gap (relative): 0.007807821244322148 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1174 Total time (s): 2.041 LMO calls / sec: 575.2082312591867 Nodes / sec: 47.52572268495835 LMO calls / node: 12.103092783505154 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 82 Local tightenings / node: 0.88 Total number of potential local tightenings: 170 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 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: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.910000e-01 6.109980e+00 488 63 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.210000e-01 1.096224e+01 86 33 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.570000e-01 1.149425e+01 133 40 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.550000e+00 2.350877e+01 65 25 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.098000e+00 2.385140e+01 63 22 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.476400e+01 2.716066e+01 50 22 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.061900e+01 2.895388e+01 53 20 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.641500e+01 3.002082e+01 53 23 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.120800e+01 3.098564e+01 17 9 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.661600e+01 3.110662e+01 59 24 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.085100e+01 3.116203e+01 12 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.452400e+01 3.074746e+01 8 5 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.718900e+01 3.019772e+01 9 5 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.942300e+01 2.976347e+01 29 12 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.131300e+01 2.913492e+01 10 6 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.274100e+01 2.864944e+01 11 7 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.400200e+01 2.809155e+01 13 7 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.512100e+01 2.763012e+01 10 6 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.564400e+01 2.737043e+01 6 4 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 55.646 LMO calls / sec: 494.6447183984473 Nodes / sec: 27.369442547532618 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.110000e+00 1.421801e+00 473 68 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.451000e+00 3.671971e+00 90 35 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.585000e+00 4.255319e+00 131 42 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.026100e+01 1.958873e+01 95 37 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.084600e+01 2.000738e+01 60 21 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.707200e+01 2.325445e+01 121 27 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.193500e+01 2.557556e+01 47 21 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.662100e+01 2.678337e+01 23 12 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.040800e+01 2.792028e+01 46 19 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.406700e+01 2.897232e+01 22 12 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.729500e+01 2.962864e+01 9 5 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.054300e+01 3.011617e+01 7 4 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.334900e+01 3.033519e+01 10 6 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.590800e+01 3.056112e+01 13 8 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.784500e+01 3.053611e+01 8 5 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.963000e+01 3.060649e+01 7 5 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.103500e+01 3.090036e+01 10 6 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.246600e+01 3.089620e+01 12 7 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.382800e+01 3.082039e+01 12 7 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.485400e+01 3.060852e+01 7 4 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.500200e+01 3.052616e+01 14 8 26740 41 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.083355821757877 Dual Gap (relative): 0.009945008189894359 Search Statistics. Total number of nodes processed: 1679 Total number of lmo calls: 26740 Total time (s): 55.003 LMO calls / sec: 486.15530061996617 Nodes / sec: 30.525607694125775 LMO calls / node: 15.926146515783204 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2233 Local tightenings / node: 1.38 Total number of potential local tightenings: 5463 Number of alternative decisions: 438 Number of stable decisions: 401 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.350000e-01 5.607477e+00 468 63 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.314000e+00 9.893455e+00 99 31 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.356000e+00 2.029578e+01 62 25 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 9.149000e+00 2.196961e+01 65 24 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.655700e+01 2.421936e+01 81 32 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.256700e+01 2.636593e+01 54 29 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.765600e+01 2.766127e+01 18 11 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.248100e+01 2.866291e+01 65 28 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.685000e+01 2.933514e+01 56 22 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 4.075300e+01 2.966653e+01 48 23 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.457400e+01 2.995020e+01 7 4 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.768900e+01 3.030049e+01 51 22 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 5.083600e+01 3.027382e+01 38 20 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.361000e+01 3.034882e+01 6 4 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.584100e+01 3.021078e+01 12 7 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.812800e+01 3.012318e+01 33 15 26657 170 21 7 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.990800e+01 2.996261e+01 12 8 27751 16 0 0 1405 394 2.621643e+01 2.836265e+01 2.146217e+00 8.186536e-02 6.000200e+01 2.998233e+01 23 10 27809 119 11 9 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.216427664722552 Dual Gap (relative): 0.08186536274621525 Search Statistics. Total number of nodes processed: 1799 Total number of lmo calls: 27809 Total time (s): 60.003 LMO calls / sec: 463.4601603253171 Nodes / sec: 29.981834241621254 LMO calls / node: 15.458032240133408 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2442 Local tightenings / node: 1.74 Total number of potential local tightenings: 5872 Number of alternative decisions: 543 Number of stable decisions: 356 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.510000e-01 5.444646e+00 482 68 64 4885 42 8 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.567000e+00 1.597195e+01 82 33 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.211000e+00 1.962006e+01 56 27 968 257 18 16 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.863000e+00 2.556276e+01 15 8 2918 60 18 11 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.273600e+01 3.007224e+01 36 17 5197 153 24 5 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.742300e+01 3.254319e+01 24 12 7469 83 12 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.187000e+01 3.360768e+01 28 12 9610 131 23 5 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.674300e+01 3.413977e+01 47 22 11880 193 16 11 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 3.103600e+01 3.450831e+01 31 16 13971 113 13 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.510300e+01 3.484033e+01 20 11 15981 55 10 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.831500e+01 3.531254e+01 38 19 17719 139 18 4 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 4.176900e+01 3.526539e+01 16 9 19510 37 0 0 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.516900e+01 3.535611e+01 70 26 21254 396 22 10 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.803000e+01 3.529044e+01 11 6 22747 24 0 0 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 5.034800e+01 3.513546e+01 5 3 24101 6 0 0 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 5.241900e+01 3.489193e+01 14 9 25317 23 0 0 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.417500e+01 3.442547e+01 6 3 26374 10 0 0 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.572400e+01 3.397100e+01 12 7 27346 16 0 0 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.707000e+01 3.341510e+01 18 9 28188 61 8 5 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.832000e+01 3.293896e+01 5 3 29039 10 0 0 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.942900e+01 3.245890e+01 6 4 29805 14 0 0 1857 76 2.804252e+01 2.836265e+01 3.201214e-01 1.141557e-02 6.000100e+01 3.221613e+01 9 4 30205 35 10 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 28.042523663873407 Dual Gap (relative): 0.01141556891842709 Search Statistics. Total number of nodes processed: 1933 Total number of lmo calls: 30205 Total time (s): 60.002 LMO calls / sec: 503.3998866704443 Nodes / sec: 32.21559281357288 LMO calls / node: 15.625969994826693 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1885 Local tightenings / node: 1.02 Total number of potential local tightenings: 4434 Number of alternative decisions: 331 Number of stable decisions: 635 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.200000e-01 5.769231e+00 517 65 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.910000e-01 1.010101e+01 99 37 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 1.035000e+00 1.062802e+01 141 43 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.727000e+00 2.303197e+01 85 30 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.340000e+00 2.323340e+01 68 21 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.510400e+01 2.654926e+01 53 23 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.144200e+01 2.784255e+01 54 20 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.770500e+01 2.862299e+01 63 26 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.290700e+01 2.938584e+01 20 10 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.843600e+01 2.963368e+01 63 24 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.296700e+01 2.962739e+01 14 8 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.686200e+01 2.921344e+01 37 5 20396 14 0 0 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.965100e+01 2.874061e+01 67 25 21910 381 13 9 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 5.192600e+01 2.832878e+01 11 6 23162 19 0 0 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 5.393200e+01 2.779426e+01 35 16 24363 145 16 10 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 5.539400e+01 2.734953e+01 11 6 25359 25 0 0 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 5.676000e+01 2.690275e+01 36 15 26283 172 13 8 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.790800e+01 2.647303e+01 13 7 27090 27 0 0 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.859800e+01 2.619543e+01 7 4 27580 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1535 Total number of lmo calls: 27580 Total time (s): 58.599 LMO calls / sec: 470.65649584463904 Nodes / sec: 26.19498626256421 LMO calls / node: 17.96742671009772 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2409 Local tightenings / node: 1.64 Total number of potential local tightenings: 5193 Number of alternative decisions: 718 Number of stable decisions: 49 Minimum number of branchings per variable: 0 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 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: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.670000e-01 5.291005e+00 561 67 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.990000e-01 1.001112e+01 95 35 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 1.044000e+00 1.053640e+01 142 44 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.162000e+00 2.193844e+01 93 34 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.762000e+00 2.222905e+01 67 23 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.585300e+01 2.529490e+01 51 22 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.228700e+01 2.678692e+01 56 20 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.864300e+01 2.768565e+01 65 28 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.400100e+01 2.844034e+01 20 11 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.963700e+01 2.873578e+01 63 25 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.393200e+01 2.897660e+01 12 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.751600e+01 2.881135e+01 7 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 5.041300e+01 2.826652e+01 9 5 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.265900e+01 2.793445e+01 32 13 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.469000e+01 2.733589e+01 9 6 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.619500e+01 2.688851e+01 11 7 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.760200e+01 2.633589e+01 14 8 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.879500e+01 2.590356e+01 11 7 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.934800e+01 2.566220e+01 6 4 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 59.349 LMO calls / sec: 463.7820350806248 Nodes / sec: 25.66176346694974 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 3.804000e+00 7.886435e-01 518 70 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 4.146000e+00 2.170767e+00 90 34 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 4.282000e+00 2.568893e+00 134 41 217 944 28 30 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 63 running 1 of 1 signal (10): User defined signal 1 collect_to_with_first! at ./array.jl:864 collect at ./array.jl:838 [inlined] sol_values at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/convenience.jl:25 [inlined] find_best_solution at /home/pkgeval/.julia/packages/Boscia/vpy1o/ext/BosciaSCIPExt.jl:28 unknown function (ip: 0x775c4675a432) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 find_best_solution at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:591 unknown function (ip: 0x775c4675968d) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 #process_FW_callback_logic#37 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/callbacks.jl:97 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/callbacks.jl:59 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/callbacks.jl:24 unknown function (ip: 0x775c467627d2) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/blended_pairwise.jl:261 unknown function (ip: 0x775c4674cda5) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/frank_wolfe_variants.jl:207 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/frank_wolfe_variants.jl:187 unknown function (ip: 0x775c46739827) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/node.jl:361 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/custom_bonobo.jl:29 unknown function (ip: 0x775c4671501a) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 #solve#109 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/interface.jl:270 unknown function (ip: 0x775c467122f9) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 solve at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x775c4670ab2c) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x775cc6f1e249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.274000e+01 1.577708e+01 86 33 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.329400e+01 1.632315e+01 80 41 3485 420 20 24 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] start_task at /source/src/task.c:1275 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000076174e481a50 Total snapshots: 427. Utilization: 0% ╎427 @Base/task.jl:1168 wait_forever() 426╎ 427 @Base/task.jl:1246 wait() 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 2.417700e+01 1.650329e+01 69 26 6090 444 23 10 [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 [63] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/vpy1o/test/branching_strategy_test.jl:275 PkgEval terminated after 2726.66s: test duration exceeded the time limit