Package evaluation to test Boscia on Julia 1.14.0-DEV.1640 (5532bea546*) started at 2026-01-30T11:27:49.423 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 10.0s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.5 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.5 [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.2 [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 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.48.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.1 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.16 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.2 [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 [a63ad114] + Mmap 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.1+2 [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 5.15s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 2154.4 ms ✓ Bonobo 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:50  [2] top-level scope  @ ~/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:9  [3] include(mod::Module, _path::String)  @ Base ./Base.jl:309  [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:3309  [5] top-level scope  @ stdin:5  [6] eval(m::Module, e::Any)  @ Core ./boot.jl:489  [7] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3151  [8] include_string  @ ./loading.jl:3161 [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 11053.9 ms ✓ MathOptSetDistances 37357.1 ms ✓ FrankWolfe 22209.0 ms ✓ GraphsFlows 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:44  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2861  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2715  [4] macro expansion  @ ./loading.jl:2642 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2606  [7] require  @ ./loading.jl:2582 [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:309  [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:3309  [13] top-level scope  @ stdin:5  [14] eval(m::Module, e::Any)  @ Core ./boot.jl:489  [15] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3151  [16] include_string  @ ./loading.jl:3161 [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 14036.5 ms ✓ Boscia 9604.6 ms ✓ Boscia → BosciaHiGHSExt 17883.6 ms ✓ Boscia → BosciaSCIPExt 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:44  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2861  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2715  [4] macro expansion  @ ./loading.jl:2642 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2606  [7] require  @ ./loading.jl:2582 [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:309  [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:3309  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:489  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3151  [18] include_string  @ ./loading.jl:3161 [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 7 dependencies successfully precompiled in 154 seconds. 176 already precompiled. Precompilation completed after 176.13s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_f0lwM3/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.5 [336ed68f] CSV v0.10.15 [0002e35e] CombinatorialLinearOracles v0.1.4 [31c24e10] Distributions v0.25.123 [497a8b3b] DoubleFloats v1.5.3 [f55ce6ea] FrankWolfe v0.6.2 [86223c79] Graphs v1.13.4 [87dc4568] HiGHS v1.20.1 [b8f27783] MathOptInterface v1.48.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_f0lwM3/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.5 [336ed68f] CSV v0.10.15 [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.4 [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.3 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.2 [f55ce6ea] FrankWolfe v0.6.2 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.13.4 [06909019] GraphsFlows v0.1.1 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.20.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 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.4 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.48.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.0 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [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.6.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.16 [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 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.2 [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.12.0+0 [e33a78d0] Hwloc_jll v2.12.2+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.0+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.7+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.4+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.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 = 0xb647e4d9167858cf ┌ 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/PIUIk/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/PIUIk/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/PIUIk/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/PIUIk/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/PIUIk/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/PIUIk/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 = 0xb83e5fed6d89057b ┌ 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##37", var"#grad!#grad!##15", 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/PIUIk/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##43", var"#grad!#grad!##17", 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/PIUIk/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.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/PIUIk/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0xc054eef2182c9919 ┌ 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##52", var"#grad!#grad!##20", 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/PIUIk/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##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/PIUIk/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/PIUIk/src/callbacks.jl:252 Sparse Regression Tests seed = 0x58c4a9c7aa29b3c1 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.242127e+00 3.591342e+00 3.492157e-01 1.077119e-01 1.766300e+01 1.698466e-01 7198 47 18 21 10 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##67", var"#grad!#grad!##25", 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/PIUIk/src/callbacks.jl:252 100 25 3.511429e+00 3.591342e+00 7.991279e-02 2.275791e-02 2.226600e+01 5.613941e+00 8 5 443 3 4 0 145 24 3.558249e+00 3.591342e+00 3.309291e-02 9.300336e-03 2.273100e+01 7.434781e+00 5 3 581 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 ---------------------------------------------------------------------------------------------------------------- I 1 8.296604e+00 8.069953e-02 8.215905e+00 0.000000e+00 Inf 1 LD 2 3.591342e+00 3.591342e+00 0.000000e+00 2.076573e+00 9.631253e-01 1 Last 2 3.591342e+00 3.591342e+00 0.000000e+00 2.232717e+00 8.957696e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.591342e+00 3.591342e+00 0.000000e+00 2.236159e+00 8.943906e-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.591342191268882 Dual Bound: 3.5582492787181152 Dual Gap (relative): 0.009300335630978842 Search Statistics. Total number of nodes processed: 169 Total number of lmo calls: 586 Total time (s): 26.788 LMO calls / sec: 21.875466626847842 Nodes / sec: 6.308794982828132 LMO calls / node: 3.467455621301775 Total number of global tightenings: 35 Global tightenings / node: 0.24 Total number of local tightenings: 50 Local tightenings / node: 0.34 Total number of potential local tightenings: 50 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.167782e+00 3.312321e+00 1.144539e+00 5.279770e-01 1.673100e+01 1.793079e-01 7991 213 37 83 25 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##68", var"#grad!#grad!##26", 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/PIUIk/src/callbacks.jl:252 100 55 2.878271e+00 3.312321e+00 4.340499e-01 1.508023e-01 2.254700e+01 6.874529e+00 22 14 1181 19 16 2 200 55 2.988082e+00 3.312321e+00 3.242391e-01 1.085108e-01 2.447200e+01 1.042007e+01 32 21 1614 24 13 0 300 55 3.053226e+00 3.312321e+00 2.590945e-01 8.485926e-02 2.638900e+01 1.345257e+01 24 16 2057 18 7 0 400 55 3.100251e+00 3.312321e+00 2.120692e-01 6.840388e-02 2.831300e+01 1.607036e+01 24 15 2508 23 10 0 500 55 3.147693e+00 3.312321e+00 1.646277e-01 5.230107e-02 3.022100e+01 1.836471e+01 25 15 2974 29 11 0 600 55 3.201248e+00 3.312321e+00 1.110727e-01 3.469667e-02 3.214700e+01 2.037515e+01 25 15 3437 36 10 1 700 53 3.246993e+00 3.312321e+00 6.532808e-02 2.011957e-02 3.399700e+01 2.214901e+01 26 17 3911 36 14 5 771 40 3.279673e+00 3.312321e+00 3.264767e-02 9.954552e-03 3.530900e+01 2.296865e+01 4 3 4244 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 ---------------------------------------------------------------------------------------------------------------- I 1 8.923386e+00 7.109000e-01 8.212486e+00 0.000000e+00 Inf 1 LD 2 3.312321e+00 3.312321e+00 0.000000e+00 1.460918e-01 1.369002e+01 1 Last 2 3.312321e+00 3.312321e+00 0.000000e+00 2.972684e-01 6.727926e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.312321e+00 3.312321e+00 0.000000e+00 3.004854e-01 6.655897e+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.31232063169893 Dual Bound: 3.2796729567498493 Dual Gap (relative): 0.009954551987230683 Search Statistics. Total number of nodes processed: 811 Total number of lmo calls: 4249 Total time (s): 37.385 LMO calls / sec: 113.65520930854622 Nodes / sec: 21.693192456867727 LMO calls / node: 5.23921085080148 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: 1 Non zero entries: 14th entry: 0.1686526402135934 43th entry: 0.1686526402135934 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 2.309007e+00 3.312321e+00 1.003314e+00 4.345218e-01 2.250000e-01 1.333333e+01 219 147 37 83 25 1 100 26 3.008578e+00 3.312321e+00 3.037427e-01 1.009589e-01 6.150000e+00 2.048780e+01 19 12 1251 19 14 2 200 25 3.143476e+00 3.312321e+00 1.688443e-01 5.371261e-02 9.194000e+00 2.447248e+01 20 13 1954 24 13 7 300 24 3.249393e+00 3.312321e+00 6.292734e-02 1.936587e-02 1.221800e+01 2.651825e+01 22 14 2677 28 11 3 324 23 3.279675e+00 3.312321e+00 3.264542e-02 9.953859e-03 1.293000e+01 2.683681e+01 21 14 2854 18 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.923386e+00 7.109000e-01 8.212486e+00 0.000000e+00 Inf 1 LD 2 3.312321e+00 3.312321e+00 0.000000e+00 1.211049e-03 1.651461e+03 1 Last 2 3.312321e+00 3.312321e+00 0.000000e+00 5.971904e-03 3.349016e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.312321e+00 3.312321e+00 0.000000e+00 8.558879e-03 2.336755e+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.31232063169893 Dual Bound: 3.279675207203334 Dual Gap (relative): 0.00995385897478356 Search Statistics. Total number of nodes processed: 347 Total number of lmo calls: 2859 Total time (s): 12.949 LMO calls / sec: 220.78925013514558 Nodes / sec: 26.797436095451385 LMO calls / node: 8.239193083573488 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 Poisson Tests seed = 0x422b630dade51cf0 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 -2.895705e+02 -2.711374e+02 1.843310e+01 6.798438e-02 1.970300e+01 1.522611e-01 10810 85 38 1831 24 1 * 4 5 -2.895690e+02 -2.718714e+02 1.769756e+01 6.509532e-02 2.638700e+01 3.410770e-01 1519 79 147 1075 29 9 * 10 11 -2.895246e+02 -2.743117e+02 1.521283e+01 5.545820e-02 4.672300e+01 4.494574e-01 1735 79 381 1202 33 16 33 34 -2.888885e+02 -2.743117e+02 1.457680e+01 5.313956e-02 1.200040e+02 5.583147e-01 1796 56 1204 1251 23 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 5.302010e+02 -5.561574e+02 1.086358e+03 0.000000e+00 Inf 1 LD 2 -2.730199e+02 -3.167564e+02 4.373646e+01 1.680454e-01 1.190155e+01 2 LD 37 -2.825687e+02 -2.977962e+02 1.522747e+01 4.739206e-01 7.807215e+01 3 LD 41 -2.828870e+02 -2.903491e+02 7.462084e+00 4.813154e-01 8.518323e+01 3 LD 53 -2.839759e+02 -2.877016e+02 3.725690e+00 5.057149e-01 1.048021e+02 5 LD 79 -2.842594e+02 -2.858762e+02 1.616785e+00 6.226349e-01 1.268801e+02 6 LD 174 -2.843967e+02 -2.848236e+02 4.269696e-01 7.379191e-01 2.357982e+02 7 LD 270 -2.844060e+02 -2.845787e+02 1.727294e-01 8.486808e-01 3.181408e+02 8 LD 323 -2.844070e+02 -2.844858e+02 7.878769e-02 9.189807e-01 3.514764e+02 8 LD 403 -2.844074e+02 -2.844400e+02 3.261696e-02 1.014184e+00 3.973637e+02 8 LD 473 -2.844074e+02 -2.844226e+02 1.517651e-02 1.092958e+00 4.327704e+02 8 LD 552 -2.844074e+02 -2.844124e+02 4.993274e-03 1.187544e+00 4.648247e+02 8 LD 638 -2.844074e+02 -2.844094e+02 2.010840e-03 1.292082e+00 4.937767e+02 8 LD 730 -2.844074e+02 -2.844082e+02 7.995678e-04 1.385729e+00 5.267986e+02 8 LD 820 -2.844074e+02 -2.844078e+02 3.384678e-04 1.468327e+00 5.584588e+02 8 LD 907 -2.844074e+02 -2.844076e+02 1.478614e-04 1.625891e+00 5.578479e+02 8 LD 992 -2.844074e+02 -2.844075e+02 6.187943e-05 1.694064e+00 5.855740e+02 8 P 1000 -2.844074e+02 -2.844075e+02 6.187943e-05 1.702133e+00 5.874981e+02 8 LD 1090 -2.844074e+02 -2.844075e+02 2.719916e-05 1.829401e+00 5.958236e+02 8 LD 1181 -2.844074e+02 -2.844075e+02 1.233597e-05 1.902953e+00 6.206144e+02 8 LD 1325 -2.844074e+02 -2.844074e+02 3.309482e-06 2.030655e+00 6.524989e+02 9 P 2000 -2.844074e+02 -2.844074e+02 3.309482e-06 2.647411e+00 7.554551e+02 9 LD 2004 -2.844074e+02 -2.844074e+02 1.551969e-06 2.650785e+00 7.560024e+02 9 P 3000 -2.844074e+02 -2.844074e+02 1.551969e-06 3.450241e+00 8.695044e+02 9 P 4000 -2.844074e+02 -2.844074e+02 1.551969e-06 4.215267e+00 9.489315e+02 9 P 5000 -2.844074e+02 -2.844074e+02 1.551969e-06 5.011533e+00 9.976986e+02 9 P 6000 -2.844074e+02 -2.844074e+02 1.551969e-06 5.786791e+00 1.036844e+03 9 P 7000 -2.844074e+02 -2.844074e+02 1.551969e-06 6.525645e+00 1.072691e+03 9 P 8000 -2.844074e+02 -2.844074e+02 1.551969e-06 7.266232e+00 1.100983e+03 9 P 9000 -2.844074e+02 -2.844074e+02 1.551969e-06 7.996607e+00 1.125477e+03 9 P 10000 -2.844074e+02 -2.844074e+02 1.551969e-06 8.771543e+00 1.140050e+03 9 Last 10001 -2.844074e+02 -2.844074e+02 1.551969e-06 8.776209e+00 1.139558e+03 9 ---------------------------------------------------------------------------------------------------------------- PP 10001 -2.844074e+02 -2.844074e+02 1.696431e-06 8.779398e+00 1.139144e+03 9 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -284.4074384556229 Dual Bound: -288.88853011980717 Dual Gap (relative): 0.01575588770996033 Search Statistics. Total number of nodes processed: 67 Total number of lmo calls: 1236 Total time (s): 130.766 LMO calls / sec: 9.451998225838521 Nodes / sec: 0.5123655996206965 LMO calls / node: 18.44776119402985 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 -2.772462e+02 -2.739320e+02 3.314140e+00 1.209840e-02 2.070600e+01 1.448855e-01 8426 125 27 95 12 2 5 6 -2.761930e+02 -2.739320e+02 2.260971e+00 8.253768e-03 2.353400e+01 4.674089e-01 110 54 83 44 9 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 -1.566912e+02 -3.029397e+02 1.462485e+02 0.000000e+00 Inf 1 LD 2 -2.739320e+02 -2.739320e+02 0.000000e+00 1.517401e-01 1.318043e+01 1 Last 2 -2.739320e+02 -2.739320e+02 0.000000e+00 3.043838e-01 6.570652e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.739320e+02 -2.739320e+02 0.000000e+00 3.081766e-01 6.489784e+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: -273.9320179432127 Dual Bound: -276.1929893149927 Dual Gap (relative): 0.008253768174878691 Search Statistics. Total number of nodes processed: 11 Total number of lmo calls: 88 Total time (s): 25.755 LMO calls / sec: 3.4168122694622403 Nodes / sec: 0.42710153368278003 LMO calls / node: 8.0 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 1.852721e+02 3.434619e+02 1.581898e+02 8.538242e-01 1.761000e+01 1.703578e-01 8706 126 26 77 12 0 * 2 3 1.852721e+02 3.367332e+02 1.514611e+02 8.175063e-01 1.785800e+01 2.799866e-01 244 113 50 91 13 1 * 5 6 2.129223e+02 3.339019e+02 1.209796e+02 5.681866e-01 1.847900e+01 5.952703e-01 226 84 107 77 12 2 100 87 2.990685e+02 3.339019e+02 3.483339e+01 1.164729e-01 3.132300e+01 5.970054e+00 51 29 1447 16 4 1 200 65 3.219674e+02 3.339019e+02 1.193450e+01 3.706742e-02 3.611500e+01 7.337671e+00 38 19 2114 12 0 0 ┌ 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##75"{Float64}, var"#grad!#grad!##29"{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/PIUIk/src/callbacks.jl:252 273 18 3.310247e+02 3.339019e+02 2.877154e+00 8.691657e-03 3.777300e+01 7.703915e+00 11 7 2380 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 ---------------------------------------------------------------------------------------------------------------- Last 0 3.339019e+02 3.339019e+02 0.000000e+00 9.268352e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.339019e+02 3.339019e+02 0.000000e+00 1.652081e-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: 333.9018927048488 Dual Bound: 331.02473913648276 Dual Gap (relative): 0.008691657233448625 Search Statistics. Total number of nodes processed: 291 Total number of lmo calls: 2384 Total time (s): 39.906 LMO calls / sec: 59.740389916303315 Nodes / sec: 7.292136520823936 LMO calls / node: 8.192439862542955 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 1.852721e+02 3.434619e+02 1.581898e+02 8.538242e-01 2.068700e+01 1.450186e-01 8398 126 26 77 12 0 * 2 3 1.852721e+02 3.367332e+02 1.514611e+02 8.175063e-01 2.188800e+01 2.284357e-01 213 78 43 65 12 0 * 4 5 2.038803e+02 3.363084e+02 1.324281e+02 6.495387e-01 2.418400e+01 3.721469e-01 173 74 81 51 12 0 * 20 19 2.392748e+02 3.339019e+02 9.462706e+01 3.954744e-01 3.853300e+01 1.012119e+00 98 44 349 35 6 3 100 69 2.902119e+02 3.339019e+02 4.368999e+01 1.505451e-01 8.391800e+01 2.013871e+00 163 59 1279 66 5 4 200 63 3.210740e+02 3.339019e+02 1.282794e+01 3.995323e-02 1.069590e+02 2.458886e+00 19 13 1851 4 0 0 ┌ 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##78"{Float64}, var"#grad!#grad!##30"{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/PIUIk/src/callbacks.jl:252 251 20 3.310737e+02 3.339019e+02 2.828188e+00 8.542471e-03 1.094940e+02 2.475021e+00 40 23 2020 12 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.339019e+02 3.339019e+02 0.000000e+00 8.718297e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.339019e+02 3.339019e+02 0.000000e+00 1.585049e-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: 333.9018927048488 Dual Bound: 331.073705080792 Dual Gap (relative): 0.00854247130066289 Search Statistics. Total number of nodes processed: 271 Total number of lmo calls: 2024 Total time (s): 111.565 LMO calls / sec: 18.14189037780666 Nodes / sec: 2.4290772195581054 LMO calls / node: 7.468634686346864 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 = 0xbee51b65e973a690 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.030196e+01 3.930993e+00 3.423296e+01 Inf 2.031700e+01 1.476596e-01 9890 114 41 10001 24 4 * 2 3 -3.030196e+01 -8.625313e+00 2.167665e+01 2.513144e+00 2.074900e+01 2.409755e-01 377 116 58 6143 21 9 * 4 5 -2.938590e+01 -9.608225e+00 1.977768e+01 2.058411e+00 2.109700e+01 4.266009e-01 147 22 103 2643 19 10 * 6 7 -2.911683e+01 -1.026635e+01 1.885047e+01 1.836141e+00 2.154300e+01 6.034443e-01 86 33 159 1430 19 3 * 15 16 -2.571923e+01 -1.206833e+01 1.365090e+01 1.131135e+00 2.305100e+01 1.344844e+00 229 85 429 2017 18 9 * 93 94 -2.054402e+01 -1.440271e+01 6.141308e+00 4.263995e-01 4.144700e+01 4.511786e+00 130 75 2711 985 13 14 100 101 -2.035635e+01 -1.440271e+01 5.953638e+00 4.133692e-01 4.330500e+01 4.641496e+00 440 65 2920 10001 20 7 169 168 -1.881932e+01 -1.440271e+01 4.416609e+00 3.066512e-01 6.000300e+01 5.616386e+00 292 56 4939 6759 16 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -14.402710855840944 Dual Bound: -18.819319407550598 Dual Gap (relative): 0.30665119892471643 Search Statistics. Total number of nodes processed: 337 Total number of lmo calls: 4939 Total time (s): 60.868 LMO calls / sec: 81.1428008148781 Nodes / sec: 5.53657094039561 LMO calls / node: 14.655786350148368 Total number of global tightenings: 8 Global tightenings / node: 0.05 Total number of local tightenings: 970 Local tightenings / node: 5.74 Total number of potential local tightenings: 1458 Time Limit Test seed = 0x5e5ccb0a1cfba5a4 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.148019e+00 0.000000e+00 1.148019e+00 Inf 1.809400e+01 1.658008e-01 9350 91 29 2375 13 5 ┌ 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##82", var"#grad!#grad!##32", 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/PIUIk/src/callbacks.jl:252 35 0 0.000000e+00 0.000000e+00 0.000000e+00 0.000000e+00 1.910000e+01 1.832461e+00 3 2 430 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: 35 Total number of lmo calls: 430 Total time (s): 19.959 LMO calls / sec: 21.544165539355678 Nodes / sec: 1.753594869482439 LMO calls / node: 12.285714285714286 Total number of global tightenings: 4 Global tightenings / node: 0.11 Total number of local tightenings: 55 Local tightenings / node: 1.57 Total number of potential local tightenings: 64 Strong Convexity and Sharpness Tests seed = 0x9f7ee4505a2788b9 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.888441e+02 1.889411e+02 9.691830e-02 5.132185e-04 1.663600e+01 1.803318e-01 7369 0 11 16 4 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 188.9410589110522 Dual Bound: 188.8441406124956 Dual Gap (relative): 0.0005132184575187672 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 17.43 LMO calls / sec: 0.6310958118187034 Nodes / sec: 0.1721170395869191 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 16 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.018320e+02 2.018479e+02 1.589786e-02 7.876778e-05 1.672400e+01 1.793829e-01 7744 0 14 15 3 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 201.84789355265616 Dual Bound: 201.8319956948131 Dual Gap (relative): 7.876777806384501e-5 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 14 Total time (s): 17.539 LMO calls / sec: 0.7982211072467073 Nodes / sec: 0.1710473801242944 LMO calls / node: 4.666666666666667 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 17 Branching Strategy Tests seed = 0x91eca2fa78f2dd03 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 1.763600e+01 1.701066e-01 8819 51 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.894500e+01 3.430984e+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): 19.767 LMO calls / sec: 48.21166590782617 Nodes / sec: 3.2883087974907674 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.820000e-01 7.853403e+00 259 36 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/PIUIk/src/callbacks.jl:252 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.717000e+00 5.066977e+01 3 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): 1.718 LMO calls / sec: 590.8032596041909 Nodes / sec: 50.640279394644935 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.700000e-01 8.108108e+00 242 34 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.381000e+00 4.272266e+01 2 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.382 LMO calls / sec: 621.562952243126 Nodes / sec: 42.69175108538351 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.800000e-01 7.894737e+00 240 31 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.486000e+00 5.047106e+01 10 6 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.487 LMO calls / sec: 606.5904505716206 Nodes / sec: 50.43712172158708 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.480000e-01 8.620690e+00 243 33 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.720000e+00 5.639535e+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): 1.721 LMO calls / sec: 682.1615339918652 Nodes / sec: 56.362579895409645 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.360000e-01 6.880734e+00 433 49 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 6.970000e-01 1.291248e+01 74 24 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.190000e-01 1.343101e+01 119 30 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.603000e+00 2.643693e+01 78 27 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.118000e+00 2.673072e+01 57 19 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.305000e+01 3.072797e+01 39 15 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.819300e+01 3.281482e+01 44 16 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.318500e+01 3.420315e+01 47 19 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.727500e+01 3.545371e+01 14 7 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.143400e+01 3.623465e+01 56 22 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.509300e+01 3.627504e+01 11 6 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 3.835400e+01 3.569380e+01 6 3 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.073200e+01 3.498478e+01 7 4 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.258000e+01 3.454674e+01 28 11 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.429700e+01 3.374946e+01 8 4 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.553300e+01 3.318472e+01 9 5 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 4.664500e+01 3.252224e+01 11 6 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 4.758700e+01 3.200454e+01 8 5 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 4.804500e+01 3.169945e+01 5 3 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): 48.046 LMO calls / sec: 572.8884818715397 Nodes / sec: 31.69878866086667 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.006000e+00 1.495513e+00 454 52 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.281000e+00 3.945638e+00 76 27 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.403000e+00 4.577611e+00 118 35 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.196000e+00 2.185733e+01 80 29 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.732000e+00 2.229758e+01 58 19 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.513300e+01 2.623406e+01 73 18 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 1.919800e+01 2.922179e+01 24 10 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.269300e+01 3.141938e+01 20 10 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 2.585400e+01 3.283825e+01 38 14 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 2.895000e+01 3.409326e+01 19 9 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.160400e+01 3.496393e+01 6 4 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 3.437700e+01 3.551793e+01 5 3 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 3.679400e+01 3.573952e+01 8 5 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 3.905300e+01 3.592554e+01 10 6 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.078900e+01 3.581848e+01 4 3 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.183900e+01 3.630584e+01 4 3 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 4.290100e+01 3.675905e+01 7 4 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 4.406600e+01 3.678573e+01 10 6 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 4.515300e+01 3.674174e+01 10 5 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 4.605600e+01 3.645562e+01 5 3 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 4.617200e+01 3.636403e+01 11 6 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): 46.173 LMO calls / sec: 579.1263292400321 Nodes / sec: 36.36324258765946 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.100000e-01 5.882353e+00 450 49 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.188000e+00 1.094276e+01 87 24 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 5.492000e+00 2.348871e+01 52 18 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 7.867000e+00 2.554976e+01 60 21 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.385000e+01 2.895307e+01 69 26 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.064900e+01 2.881495e+01 62 33 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.572400e+01 2.973877e+01 19 12 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.060800e+01 3.041688e+01 71 32 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.527100e+01 3.064841e+01 55 21 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 3.928100e+01 3.077824e+01 51 25 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.316900e+01 3.092497e+01 7 5 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.627400e+01 3.122704e+01 49 23 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 4.944300e+01 3.112675e+01 37 20 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.207900e+01 3.124100e+01 6 4 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.417300e+01 3.114097e+01 11 7 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.621100e+01 3.115049e+01 35 16 26657 170 21 7 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.798700e+01 3.095521e+01 8 5 27751 16 0 0 1500 329 2.665304e+01 2.836265e+01 1.709610e+00 6.414315e-02 5.943500e+01 3.077311e+01 7 5 28707 8 0 0 1543 298 2.683551e+01 2.836265e+01 1.527138e+00 5.690737e-02 6.000200e+01 3.068231e+01 7 5 29092 8 6 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.83550693344894 Dual Gap (relative): 0.056907368873011496 Search Statistics. Total number of nodes processed: 1841 Total number of lmo calls: 29092 Total time (s): 60.003 LMO calls / sec: 484.84242454543937 Nodes / sec: 30.681799243371163 LMO calls / node: 15.802281368821292 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2536 Local tightenings / node: 1.64 Total number of potential local tightenings: 6005 Number of alternative decisions: 543 Number of stable decisions: 377 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 463 66 64 4885 42 8 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.507000e+00 1.635421e+01 87 36 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.185000e+00 1.978022e+01 59 28 968 257 18 16 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.553000e+00 2.661194e+01 15 8 2918 60 18 11 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.196800e+01 3.200201e+01 30 14 5197 153 24 5 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.608700e+01 3.524585e+01 21 12 7469 83 12 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.005700e+01 3.664556e+01 28 12 9610 131 23 5 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.482200e+01 3.678189e+01 44 21 11880 193 16 11 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.877700e+01 3.721722e+01 29 15 13971 113 13 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.280200e+01 3.728431e+01 22 12 15981 55 10 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.614500e+01 3.743256e+01 54 29 17719 139 18 4 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 3.994500e+01 3.687570e+01 15 9 19510 37 0 0 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.340000e+01 3.679724e+01 67 26 21254 396 22 10 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.575600e+01 3.704432e+01 11 6 22747 24 0 0 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.795500e+01 3.688875e+01 5 3 24101 6 0 0 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 4.966300e+01 3.682822e+01 13 8 25317 23 0 0 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.124400e+01 3.639450e+01 6 4 26374 10 0 0 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.272300e+01 3.590463e+01 11 7 27346 16 0 0 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.402700e+01 3.529717e+01 18 10 28188 61 8 5 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.525000e+01 3.476923e+01 5 3 29039 10 0 0 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.627900e+01 3.427566e+01 7 5 29805 14 0 0 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.694500e+01 3.390991e+01 7 4 30260 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.106101931570876 Dual Gap (relative): 0.009127665389483692 Search Statistics. Total number of nodes processed: 1931 Total number of lmo calls: 30260 Total time (s): 56.946 LMO calls / sec: 531.3806061883188 Nodes / sec: 33.909317599129004 LMO calls / node: 15.67063697566028 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1888 Local tightenings / node: 1.01 Total number of potential local tightenings: 4439 Number of alternative decisions: 331 Number of stable decisions: 634 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 4.580000e-01 6.550218e+00 455 56 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.430000e-01 1.211306e+01 81 30 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.710000e-01 1.262916e+01 126 38 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.775000e+00 2.585209e+01 78 27 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.284000e+00 2.619507e+01 56 19 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.355400e+01 2.958536e+01 43 18 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.894200e+01 3.151726e+01 49 16 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.427700e+01 3.266466e+01 51 21 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.897500e+01 3.337360e+01 20 9 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.262200e+01 3.491509e+01 48 19 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.524200e+01 3.612167e+01 8 4 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 3.731400e+01 3.668864e+01 4 2 20396 14 0 0 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 3.897700e+01 3.661133e+01 38 14 21910 381 13 9 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 4.020600e+01 3.658658e+01 6 3 23162 19 0 0 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 4.128900e+01 3.630507e+01 18 8 24363 145 16 10 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 4.209500e+01 3.599002e+01 6 3 25359 25 0 0 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 4.282200e+01 3.565924e+01 18 7 26283 172 13 8 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 4.345500e+01 3.527787e+01 7 4 27090 27 0 0 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 4.382900e+01 3.502247e+01 4 2 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): 43.83 LMO calls / sec: 629.2493725758613 Nodes / sec: 35.021674652064796 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 2.940000e-01 1.020408e+01 292 35 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 4.680000e-01 1.923077e+01 48 16 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 5.430000e-01 2.025783e+01 73 20 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.015000e+00 2.865289e+01 94 30 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 7.583000e+00 2.861664e+01 52 17 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.271700e+01 3.153259e+01 42 17 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.799700e+01 3.317220e+01 50 19 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.359000e+01 3.361594e+01 48 20 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.774300e+01 3.485564e+01 11 5 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.141200e+01 3.626003e+01 32 11 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.488000e+01 3.649656e+01 12 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 3.809700e+01 3.593459e+01 6 3 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.001500e+01 3.561165e+01 7 4 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.175600e+01 3.522847e+01 24 9 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.317500e+01 3.462652e+01 5 3 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.406500e+01 3.429025e+01 7 4 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 4.516300e+01 3.358944e+01 7 4 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 4.575300e+01 3.328743e+01 5 3 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 4.611000e+01 3.302971e+01 5 3 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): 46.111 LMO calls / sec: 596.9291492268657 Nodes / sec: 33.02899525059097 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.327000e+00 9.017133e-01 431 54 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 3.588000e+00 2.508361e+00 66 23 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 3.699000e+00 2.973777e+00 109 29 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.030600e+01 1.950320e+01 76 25 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.072200e+01 2.023876e+01 59 18 3485 420 20 24 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 1.593900e+01 2.503294e+01 63 22 6090 444 23 10 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.118500e+01 2.761388e+01 44 19 8720 225 17 12 400 347 2.074745e+01 2.836265e+01 7.615193e+00 3.670423e-01 2.591600e+01 2.882389e+01 64 24 11144 379 20 19 500 399 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 3.001500e+01 2.995169e+01 10 6 13355 21 0 0 600 411 2.367246e+01 2.836265e+01 4.690187e+00 1.981284e-01 3.323400e+01 3.042065e+01 47 16 15250 331 16 6 700 407 2.449500e+01 2.836265e+01 3.867641e+00 1.578951e-01 3.598000e+01 3.076709e+01 45 17 17024 329 21 6 800 363 2.539631e+01 2.836265e+01 2.966336e+00 1.168019e-01 3.777700e+01 3.078593e+01 10 5 18354 67 0 0 900 301 2.616952e+01 2.836265e+01 2.193126e+00 8.380461e-02 3.903700e+01 3.076568e+01 6 3 19533 32 0 0 1000 225 2.691767e+01 2.836265e+01 1.444975e+00 5.368128e-02 4.020600e+01 3.046809e+01 5 3 20674 8 0 0 1100 137 2.763514e+01 2.836265e+01 7.275008e-01 2.632520e-02 4.100200e+01 3.016926e+01 11 5 21524 68 0 0 1187 52 2.808687e+01 2.836265e+01 2.757701e-01 9.818469e-03 4.160900e+01 2.977721e+01 4 2 22214 14 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.0868749251736 Dual Gap (relative): 0.009818468625151686 Search Statistics. Total number of nodes processed: 1239 Total number of lmo calls: 22214 Total time (s): 41.61 LMO calls / sec: 533.8620523912521 Nodes / sec: 29.776496034607067 LMO calls / node: 17.92897497982244 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2160 Local tightenings / node: 1.82 Total number of potential local tightenings: 4714 Decisions made: [(62, 1), (516, 0), (40, 0)] 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.510000e-01 8.547009e+00 348 41 64 4885 42 8 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 6.850000e-01 1.313869e+01 102 21 192 1340 32 43 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 5.954000e+00 3.375882e+01 31 13 3219 200 16 14 * 118 119 1.406031e+01 2.836265e+01 1.430233e+01 1.017213e+00 6.842000e+00 3.463899e+01 21 8 3726 178 14 20 200 199 1.704058e+01 2.836265e+01 1.132207e+01 6.644180e-01 1.108500e+01 3.599459e+01 39 16 6070 226 13 7 300 287 1.921318e+01 2.836265e+01 9.149468e+00 4.762080e-01 1.586400e+01 3.700202e+01 49 20 8686 275 20 15 400 359 2.087523e+01 2.836265e+01 7.487411e+00 3.586743e-01 1.984700e+01 3.824256e+01 28 13 11090 152 17 5 500 397 2.261057e+01 2.836265e+01 5.752072e+00 2.543975e-01 2.351800e+01 3.814100e+01 25 11 13255 124 0 0 600 411 2.379062e+01 2.836265e+01 4.572023e+00 1.921775e-01 2.653300e+01 3.810349e+01 21 10 15181 90 0 0 700 393 2.462769e+01 2.836265e+01 3.734957e+00 1.516568e-01 2.903400e+01 3.764552e+01 5 3 16798 8 0 0 800 359 2.546045e+01 2.836265e+01 2.902200e+00 1.139886e-01 3.118900e+01 3.716054e+01 9 5 18259 20 0 0 900 299 2.628929e+01 2.836265e+01 2.073352e+00 7.886678e-02 3.291600e+01 3.642605e+01 35 13 19506 212 18 6 1000 217 2.696789e+01 2.836265e+01 1.394758e+00 5.171920e-02 3.427800e+01 3.550382e+01 6 4 20487 10 0 0 1100 135 2.755469e+01 2.836265e+01 8.079536e-01 2.932182e-02 3.550600e+01 3.478285e+01 9 5 21358 19 0 0 1199 40 2.811400e+01 2.836265e+01 2.486474e-01 8.844257e-03 3.643100e+01 3.400950e+01 4 2 22136 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.113997603576518 Dual Gap (relative): 0.008844257061358888 Search Statistics. Total number of nodes processed: 1239 Total number of lmo calls: 22136 Total time (s): 36.432 LMO calls / sec: 607.5977162933684 Nodes / sec: 34.00856389986824 LMO calls / node: 17.866020984665052 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2101 Local tightenings / node: 1.75 Total number of potential local tightenings: 4676 Decisions made: [(70, 0), (526, 0), (23, 0)] 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 4.640000e-01 6.465517e+00 461 51 64 4885 42 8 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 9.450000e-01 9.523810e+00 148 32 192 1340 32 43 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 7.653000e+00 2.626421e+01 39 16 3215 200 16 14 200 201 1.675948e+01 2.977156e+01 1.301208e+01 7.764012e-01 1.319300e+01 3.039491e+01 76 24 6123 607 23 24 * 220 219 1.746732e+01 2.836265e+01 1.089532e+01 6.237546e-01 1.404300e+01 3.140355e+01 24 10 6667 132 11 8 300 289 1.916299e+01 2.836265e+01 9.199655e+00 4.800741e-01 1.673500e+01 3.531521e+01 21 11 8782 119 15 5 400 369 2.094004e+01 2.836265e+01 7.422603e+00 3.544694e-01 2.002500e+01 3.850187e+01 9 6 11289 16 0 0 500 403 2.263394e+01 2.836265e+01 5.728704e+00 2.531024e-01 2.351400e+01 3.848771e+01 40 15 13362 246 16 12 600 415 2.372403e+01 2.836265e+01 4.638612e+00 1.955238e-01 2.810000e+01 3.619217e+01 15 8 15332 35 0 0 700 399 2.451924e+01 2.836265e+01 3.843403e+00 1.567505e-01 3.103800e+01 3.547265e+01 20 10 16953 87 8 1 800 381 2.538724e+01 2.836265e+01 2.975402e+00 1.172007e-01 3.431900e+01 3.447070e+01 14 8 18530 35 0 0 900 315 2.615751e+01 2.836265e+01 2.205134e+00 8.430215e-02 3.640700e+01 3.342764e+01 42 22 19747 152 19 5 1000 237 2.690654e+01 2.836265e+01 1.456107e+00 5.411720e-02 3.808400e+01 3.253335e+01 11 7 20774 16 0 0 1100 153 2.751278e+01 2.836265e+01 8.498667e-01 3.088989e-02 3.958300e+01 3.170553e+01 6 4 21697 6 0 0 1200 55 2.805099e+01 2.836265e+01 3.116569e-01 1.111037e-02 4.081300e+01 3.079901e+01 14 8 22486 33 0 0 1207 50 2.813525e+01 2.836265e+01 2.273973e-01 8.082294e-03 4.087800e+01 3.079896e+01 6 3 22531 6 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.13524768122234 Dual Gap (relative): 0.008082294023464538 Search Statistics. Total number of nodes processed: 1259 Total number of lmo calls: 22531 Total time (s): 40.879 LMO calls / sec: 551.1631889234081 Nodes / sec: 30.79820934954378 LMO calls / node: 17.895949166004765 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2158 Local tightenings / node: 1.79 Total number of potential local tightenings: 4822 Decisions made: [(69, 0), (525, 0), (35, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["binary", "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 5.790000e-01 5.181347e+00 476 70 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.910000e-01 1.010101e+01 88 35 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 1.025000e+00 1.073171e+01 132 43 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.239000e+00 2.175560e+01 98 38 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.967000e+00 2.177185e+01 158 24 3485 420 20 24 200 199 1.683575e+01 2.836265e+01 1.152689e+01 6.846676e-01 1.640300e+01 2.432482e+01 56 26 6088 268 21 6 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.261300e+01 2.587007e+01 49 23 8721 225 17 12 400 345 2.074936e+01 2.836265e+01 7.613288e+00 3.669168e-01 2.804000e+01 2.656919e+01 12 7 11151 18 0 0 500 397 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 3.262600e+01 2.749341e+01 13 8 13344 21 0 0 600 403 2.372371e+01 2.836265e+01 4.638934e+00 1.955400e-01 3.619500e+01 2.771101e+01 11 7 15206 26 0 0 700 409 2.456583e+01 2.836265e+01 3.796813e+00 1.545566e-01 3.957700e+01 2.802133e+01 37 19 17024 145 12 5 800 361 2.545401e+01 2.836265e+01 2.908639e+00 1.142704e-01 4.192100e+01 2.769495e+01 5 3 18324 10 0 0 900 297 2.625404e+01 2.836265e+01 2.108608e+00 8.031557e-02 4.378300e+01 2.733938e+01 6 4 19524 7 0 0 1000 221 2.693668e+01 2.836265e+01 1.425964e+00 5.293764e-02 4.548400e+01 2.684460e+01 21 12 20637 44 0 0 1100 129 2.773552e+01 2.836265e+01 6.271248e-01 2.261089e-02 4.659500e+01 2.637622e+01 12 7 21469 24 0 0 1175 56 2.809454e+01 2.836265e+01 2.681003e-01 9.542790e-03 4.742300e+01 2.595787e+01 16 9 22080 34 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.094544691537212 Dual Gap (relative): 0.009542789776853822 Search Statistics. Total number of nodes processed: 1231 Total number of lmo calls: 22080 Total time (s): 47.424 LMO calls / sec: 465.58704453441294 Nodes / sec: 25.957321187584345 LMO calls / node: 17.93663688058489 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2139 Local tightenings / node: 1.82 Total number of potential local tightenings: 4646 Decisions made: [(1, 0), (63, 0), (514, 0), (37, 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: 10 Number of integer variables: 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ====================================================================================== 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 48 running 1 of 1 signal (10): User defined signal 1 unknown function (ip: 0x75721011e043) at /lib/x86_64-linux-gnu/libc.so.6 unknown function (ip: 0x757210120e5c) at /lib/x86_64-linux-gnu/libc.so.6 malloc at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) _ZN4llvm15SmallVectorBaseIjE8grow_podEPvmm at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN15LiveDebugValues14FuncValueTableC2Eii at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN15LiveDebugValues16InstrRefBasedLDV12ExtendRangesERN4llvm15MachineFunctionEPNS1_20MachineDominatorTreeEPNS1_16TargetPassConfigEjj at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm19MachineFunctionPass13runOnFunctionERNS_8FunctionE.part.0 at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm13FPPassManager13runOnFunctionERNS_8FunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm13FPPassManager11runOnModuleERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm6legacy15PassManagerImpl3runERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) operator() at /source/src/jitlayers.cpp:1635 addModule at /source/src/jitlayers.cpp:2143 jl_compile_codeinst_now at /source/src/jitlayers.cpp:688 jl_compile_codeinst_impl at /source/src/jitlayers.cpp:882 jl_compile_method_internal at /source/src/gf.c:3652 _jl_invoke at /source/src/gf.c:4112 [inlined] ijl_apply_generic at /source/src/gf.c:4317 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/JvLjn/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/frank_wolfe_variants.jl:207 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/frank_wolfe_variants.jl:187 unknown function (ip: 0x757196445567) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/node.jl:361 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/custom_bonobo.jl:29 unknown function (ip: 0x75719643937a) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 #solve#109 at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/interface.jl:270 unknown function (ip: 0x75719641b575) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 solve at /home/pkgeval/.julia/packages/Boscia/PIUIk/src/interface.jl:28 unknown function (ip: 0x7571f5b48ca9) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [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:765 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:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 include_string at ./loading.jl:3151 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3211 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_74896.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [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:765 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:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 include_string at ./loading.jl:3151 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3211 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_74896.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [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:765 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:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_50962.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [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: 0x7572100b0249) 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) #= 30.0 ms =# precompile(Tuple{typeof(Boscia.find_best_solution), Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Array{Float64, 1}, Float64, Array{Float64, 1}}, FrankWolfe.DeletedVertexStorage{Array{Float64, 1}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, NamedTuple{(:problem, :current_node_id, :updated_incumbent, :global_tightening_rhs, :global_tightening_root_info, :global_tightenings, :options, :result), Tuple{Boscia.SimpleOptimizationProblem{Main.var"#f#f##89", Main.var"#grad!#grad!##35", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, Dates.DateTime}, Boscia.IntegerBounds}, Base.RefValue{Int64}, Base.RefValue{Bool}, Base.RefValue{Float64}, NamedTuple{(:lower_bounds, :upper_bounds), Tuple{Base.Dict{Int64, Tuple{Float64, Float64}}, Base.Dict{Int64, Tuple{Float64, Float64}}}}, Boscia.IntegerBounds, Base.Dict{Symbol, Any}, Base.Dict{Symbol, Any}}}, Array{Float64, 1}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Array{Float64, 1}, Float64, Array{Float64, 1}}, FrankWolfe.DeletedVertexStorage{Array{Float64, 1}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Array{Float64, 1}, T} where T<:Real}, Function, FrankWolfe.MathOptLMO{SCIP.Optimizer}, Array{MathOptInterface.VariableIndex, 1}, Function}) #= 263.8 ms =# precompile(Tuple{typeof(Boscia.find_best_solution), Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Array{Float64, 1}, Float64, Array{Float64, 1}}, FrankWolfe.DeletedVertexStorage{Array{Float64, 1}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, NamedTuple{(:problem, :current_node_id, :updated_incumbent, :global_tightening_rhs, :global_tightening_root_info, :global_tightenings, :options, :result), Tuple{Boscia.SimpleOptimizationProblem{Main.var"#f#f##89", Main.var"#grad!#grad!##35", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, Dates.DateTime}, Boscia.IntegerBounds}, Base.RefValue{Int64}, Base.RefValue{Bool}, Base.RefValue{Float64}, NamedTuple{(:lower_bounds, :upper_bounds), Tuple{Base.Dict{Int64, Tuple{Float64, Float64}}, Base.Dict{Int64, Tuple{Float64, Float64}}}}, Boscia.IntegerBounds, Base.Dict{Symbol, Any}, Base.Dict{Symbol, Any}}}, Array{Float64, 1}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Array{Float64, 1}, Float64, Array{Float64, 1}}, FrankWolfe.DeletedVertexStorage{Array{Float64, 1}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Array{Float64, 1}, T} where T<:Real}, Main.var"#f#f##89", SCIP.Optimizer, Array{MathOptInterface.VariableIndex, 1}, typeof(Boscia._trivial_domain)}) #= 36.4 ms =# precompile(Tuple{typeof(Base.setproperty!), Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Array{Float64, 1}, Float64, Array{Float64, 1}}, FrankWolfe.DeletedVertexStorage{Array{Float64, 1}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, NamedTuple{(:problem, :current_node_id, :updated_incumbent, :global_tightening_rhs, :global_tightening_root_info, :global_tightenings, :options, :result), Tuple{Boscia.SimpleOptimizationProblem{Main.var"#f#f##89", Main.var"#grad!#grad!##35", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, Dates.DateTime}, Boscia.IntegerBounds}, Base.RefValue{Int64}, Base.RefValue{Bool}, Base.RefValue{Float64}, NamedTuple{(:lower_bounds, :upper_bounds), Tuple{Base.Dict{Int64, Tuple{Float64, Float64}}, Base.Dict{Int64, Tuple{Float64, Float64}}}}, Boscia.IntegerBounds, Base.Dict{Symbol, Any}, Base.Dict{Symbol, Any}}}, Array{Float64, 1}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Array{Float64, 1}, Float64, Array{Float64, 1}}, FrankWolfe.DeletedVertexStorage{Array{Float64, 1}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Array{Float64, 1}, T} where T<:Real}, Symbol, Float64}) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== * 1 2 2.472545e-03 1.000000e-01 9.752746e-02 3.944416e+01 2.095900e+01 1.431366e-01 9824 32 9 13 4 0 ┌ 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##89", var"#grad!#grad!##35", 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/PIUIk/src/callbacks.jl:252 17 0 1.000000e-01 1.000000e-01 0.000000e+00 0.000000e+00 2.685700e+01 6.329821e-01 6 4 193 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ 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 0x00007571f5bfc010 Total snapshots: 73. Utilization: 100% ╎65 @Base/client.jl:585 _start() ╎ 65 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 65 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ 65 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ 65 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path::Str… ╎ 65 @Base/loading.jl:3211 _include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 65 @Base/loading.jl:3151 include_string(mapexpr::typeof(identity), mo… ╎ ╎ 65 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 65 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ ╎ 65 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path… ╎ ╎ 65 @Base/loading.jl:3211 _include(mapexpr::Function, mod::Module,… ╎ ╎ ╎ 65 @Base/loading.jl:3151 include_string(mapexpr::typeof(identity… ╎ ╎ ╎ 65 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ 65 @Boscia/…terface.jl:28 kwcall(::@NamedTuple{settings::@Name… ╎ ╎ ╎ 65 @Boscia/…erface.jl:270 solve(f::var"#f#f##89", grad!::Func… ╎ ╎ ╎ 65 @Boscia/…bonobo.jl:29 kwcall(::@NamedTuple{callback::Bosc… ╎ ╎ ╎ ╎ 65 @Boscia/…bonobo.jl:36 optimize!(tree::BnBTree{Boscia.Fra… ╎ ╎ ╎ ╎ 46 @Boscia/…/node.jl:361 evaluate_node!(tree::BnBTree{Bosc… ╎ ╎ ╎ ╎ 46 @Boscia/…iants.jl:187 kwcall(::@NamedTuple{epsilon::Fl… ╎ ╎ ╎ ╎ 46 @Boscia/…ants.jl:207 #solve_frank_wolfe#7 ╎ ╎ ╎ ╎ 46 @FrankWolfe/….jl:76 kwcall(::@NamedTuple{line_search… ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/….jl:291 blended_pairwise_conditional_g… ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…lmo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…lmo.jl:116 compute_extreme_point(tlmo::B… ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…jl:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:43 compute_extreme_point(lmo::Fr… ╎ ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:358 _optimize_and_return(lmo::F… ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…per.jl:427 optimize!(o::SCIP.Optimizer) ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…per.jl:16 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…lmo.jl:130 compute_extreme_point(tlmo::B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:455 free_model ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…xt.jl:49 free_model 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…CIP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 42 @FrankWolfe/….jl:356 blended_pairwise_conditional_g… ╎ ╎ ╎ ╎ ╎ 42 @Boscia/…acks.jl:24 (::Boscia.var"#33#34"{Bool, Bn… ╎ ╎ ╎ ╎ ╎ 42 @Boscia/…cks.jl:59 process_FW_callback_logic 3╎ ╎ ╎ ╎ ╎ 37 @Boscia/…ks.jl:97 process_FW_callback_logic(tree… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:1724 typeinf_ext_toplevel(mi::Co… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1715 typeinf_ext_toplevel ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1532 typeinf_ext(interp::Compil… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:4575 typeinf(interp::Compiler.N… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:278 finish_nocycle(interp::Com… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1021 optimize(interp::Compile… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1048 run_passes_ipo_safe ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1035 run_passes_ipo_safe(ci… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1332 slot2reg ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:894 construct_ssa!(ci::Co… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:473 domsort_ssa!(ir::Com… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:62 renumber_ssa! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:243 ssamap(f::Compiler… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:578 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:0 _useref_getindex(s… 30╎ ╎ ╎ ╎ ╎ 33 @Boscia/…le.jl:591 find_best_solution(tree::BnB… ╎ ╎ ╎ ╎ ╎ ╎ 3 @Compiler/…jl:1724 typeinf_ext_toplevel(mi::Co… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1715 typeinf_ext_toplevel ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1532 typeinf_ext(interp::Compil… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:4568 typeinf(interp::Compiler.… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:4376 typeinf_local(interp::Co… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:3823 abstract_eval_basic_sta… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:3866 abstract_eval_basic_st… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:3467 abstract_eval_stateme… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:3103 abstract_eval_call ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:3085 abstract_call(inter… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:2925 abstract_call ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:2932 abstract_call(int… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:2822 abstract_call_kn… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:328 abstract_call_gf… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:247 (::Compiler.var… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Compiler/…l:177 (::Compiler.var… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Compiler/…l:861 abstract_call_m… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Compiler/…l:892 abstract_call_m… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Compiler/…l:1343 const_prop_cal… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +5 1 @Compiler/…l:4575 typeinf(interp… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +6 1 @Compiler/…l:280 finish_nocycle(… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…jl:1716 typeinf_ext_toplevel 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…l:1709 add_codeinsts_to_jit!(inte… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…ks.jl:106 process_FW_callback_logic(tre… 4╎ ╎ ╎ ╎ ╎ 5 @Boscia/…bo.jl:164 add_new_solution!(tree::BnBT… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1724 typeinf_ext_toplevel(mi::Co… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1716 typeinf_ext_toplevel 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1709 add_codeinsts_to_jit!(inte… 4╎ ╎ ╎ ╎ 19 @Boscia/…/node.jl:406 evaluate_node!(tree::BnBTree{Bosc… ╎ ╎ ╎ ╎ 15 @Compiler/…er.jl:1724 typeinf_ext_toplevel(mi::Core.Me… ╎ ╎ ╎ ╎ 11 @Compiler/…er.jl:1715 typeinf_ext_toplevel ╎ ╎ ╎ ╎ 1 @Compiler/…er.jl:1526 typeinf_ext(interp::Compiler.N… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…te.jl:604 InferenceState ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…e.jl:602 InferenceState ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…e.jl:339 Compiler.InferenceState(resul… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:272 find_ssavalue_uses(body::Vect… ╎ ╎ ╎ ╎ ╎ 1 @Base/…tset.jl:19 BitSet ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/boot.jl:675 Array 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/boot.jl:615 GenericMemory ╎ ╎ ╎ ╎ 10 @Compiler/…er.jl:1532 typeinf_ext(interp::Compiler.N… ╎ ╎ ╎ ╎ ╎ 5 @Compiler/…n.jl:4568 typeinf(interp::Compiler.Nativ… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…n.jl:4322 typeinf_local(interp::Compile… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:4090 update_bbstate! ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:748 stupdate!(lattice::Compiler.I… 1╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:735 schanged ╎ ╎ ╎ ╎ ╎ 4 @Compiler/…n.jl:4376 typeinf_local(interp::Compile… ╎ ╎ ╎ ╎ ╎ 4 @Compiler/….jl:3823 abstract_eval_basic_statement ╎ ╎ ╎ ╎ ╎ 4 @Compiler/….jl:3866 abstract_eval_basic_statement ╎ ╎ ╎ ╎ ╎ 4 @Compiler/….jl:3467 abstract_eval_statement_exp… ╎ ╎ ╎ ╎ ╎ ╎ 4 @Compiler/…jl:3103 abstract_eval_call ╎ ╎ ╎ ╎ ╎ ╎ 4 @Compiler/…jl:3085 abstract_call(interp::Comp… ╎ ╎ ╎ ╎ ╎ ╎ 4 @Compiler/…l:2925 abstract_call ╎ ╎ ╎ ╎ ╎ ╎ 4 @Compiler/…l:2932 abstract_call(interp::Com… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:2821 abstract_call_known(inte… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:55 argtypes_to_type(argtypes… ╎ ╎ ╎ ╎ ╎ ╎ 3 @Compiler/…l:2822 abstract_call_known(inte… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Compiler/…l:328 abstract_call_gf_by_type… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:166 (::Compiler.var"#inferc… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:728 abstract_call_method(i… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1159 typeinf_edge(interp:… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1457 ci_get_source(inter… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1617 _uncompressed_ir(c… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…l:247 (::Compiler.var"#inferc… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…l:177 (::Compiler.var"#handl… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…l:861 abstract_call_method_… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:886 abstract_call_method… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1259 semi_concrete_eval… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:877 Compiler.IRInterpr… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:59 inflate_ir ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…pr.jl:87 copy(c::Core.Code… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:384 copy 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ot.jl:615 GenericMemory ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:892 abstract_call_method… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1343 const_prop_call(in… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:4575 typeinf(interp::C… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:278 finish_nocycle(in… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1021 optimize(interp… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1048 run_passes_ipo… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Compiler/…l:1035 run_passes_ipo… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Compiler/…l:2122 adce_pass!(ir:… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Compiler/…l:807 IncrementalComp… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Compiler/…l:736 CFGTransformSta… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +5 1 @Compiler/…l:242 construct_domtr… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +6 1 @Compiler/…l:260 update_domtree! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +7 1 @Compiler/…l:266 compute_domtree… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +8 1 @Base/…ay.jl:930 copy!(dst::Vect… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +9 1 @Base/…ay.jl:318 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +10 1 @Base/…ay.jl:311 _copyto2arg! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +11 1 @Base/…ay.jl:291 copyto! ╎ ╎ ╎ ╎ ╎ 5 @Compiler/…n.jl:4575 typeinf(interp::Compiler.Nativ… ╎ ╎ ╎ ╎ ╎ 4 @Compiler/…r.jl:278 finish_nocycle(interp::Compile… ╎ ╎ ╎ ╎ ╎ 4 @Compiler/….jl:1021 optimize(interp::Compiler.Nat… ╎ ╎ ╎ ╎ ╎ 4 @Compiler/….jl:1048 run_passes_ipo_safe ╎ ╎ ╎ ╎ ╎ 3 @Compiler/….jl:1035 run_passes_ipo_safe(ci::Cor… ╎ ╎ ╎ ╎ ╎ ╎ 3 @Compiler/….jl:79 ssa_inlining_pass! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:663 batch_inline!(ir::Compiler.… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:385 ir_inline_item!(compact::C… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1797 ssa_substitute_op!(insert… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:578 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:0 _useref_getindex(stmt::Any… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…jl:683 batch_inline!(ir::Compiler.… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…l:1871 iterate ╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…l:1949 iterate_compact(compact::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1535 process_node!(compact::C… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1350 renumber_ssa2!(stmt::An… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:660 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:661 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:653 _advance(stmt::Any, o… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:543 _useref_getindex(stm… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1003 getindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1641 process_node!(compact::C… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1268 process_phinode_values ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:675 Array 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:615 GenericMemory ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:1070 run_passes_ipo_safe(ci::Cor… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:433 verify_ir(ir::Compiler.IRCo… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:30 check_op(ir::Compiler.IRCod… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…r.jl:285 finish_nocycle(interp::Compile… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…r.jl:153 finish!(interp::Compiler.Nati… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:298 ir_to_codeinf! ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:65 maybe_validate_code(mi::Core.… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:239 validate_code ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:234 validate_code!(errors::Vect… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:151 validate_code!(errors::Vec… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:117 validate_val! 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:0 _validate_val!(x::Any, err… ╎ ╎ ╎ ╎ 4 @Compiler/…er.jl:1716 typeinf_ext_toplevel 4╎ ╎ ╎ ╎ 4 @Compiler/…er.jl:1709 add_codeinsts_to_jit!(interp::… Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.09999999999999991 Dual Bound: 0.09999999999999991 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 17 Total number of lmo calls: 193 Total time (s): 30.362 LMO calls / sec: 6.356629998023846 Nodes / sec: 0.5599104143337066 LMO calls / node: 11.352941176470589 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 13 Local tightenings / node: 0.76 Total number of potential local tightenings: 13 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hybrid 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: 10 Number of integer variables: 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ====================================================================================== 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_46727.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [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 0x00007eb7e88085b0 Total snapshots: 432. Utilization: 0% ╎432 @Base/task.jl:1168 wait_forever() 431╎ 432 @Base/task.jl:1246 wait() [48] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/PIUIk/test/branching_strategy_test.jl:422 _ZNK12_GLOBAL__N_125TwoAddressInstructionImpl15isPlainlyKilledEPKN4llvm12MachineInstrENS1_8RegisterE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) unknown function (ip: 0x7ffc59ac60bb) at (unknown file) unknown function (ip: (nil)) at (unknown file) Allocations: 4907714942 (Pool: 4907710978; Big: 3964); GC: 1976 [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 wait_forever at ./task.jl:1168 jfptr_wait_forever_46727.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] start_task at /source/src/task.c:1275 unknown function (ip: (nil)) at (unknown file) Allocations: 17042935 (Pool: 17042281; Big: 654); GC: 15 PkgEval terminated after 2736.18s: test duration exceeded the time limit