Package evaluation to test Boscia on Julia 1.14.0-DEV.1786 (45ee44a91e*) started at 2026-02-22T18:55:13.772 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 17.12s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.8 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.3 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.8 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.3 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.3.2 [f55ce6ea] + FrankWolfe v0.6.3 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.49.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.7.1 [90137ffa] + StaticArrays v1.9.17 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.6.3 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.30+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.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 7.64s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 3319.0 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:323  [4] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3288  [5] top-level scope  @ stdin:5  [6] eval(m::Module, e::Any)  @ Core ./boot.jl:489  [7] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [8] include_string  @ ./loading.jl:3140 [inlined]  [9] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [10] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:1 in expression starting at stdin:5 ✗ LEMONGraphs 15849.0 ms ✓ MathOptSetDistances 42910.1 ms ✓ FrankWolfe 6898.5 ms ✓ SCIP_PaPILO_jll 1688.8 ms ✓ SCIP_jll ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14b1564f-c77f-4800-9e89-efd961faef7c"), "LEMONGraphs") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2840  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2694  [4] macro expansion  @ ./loading.jl:2621 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2585  [7] require  @ ./loading.jl:2561 [inlined]  [8] eval_import_path  @ ./module.jl:36 [inlined]  [9] _eval_import(imported::Bool, to::Module, from::Nothing, paths::Expr)  @ Base ./module.jl:111  [10] top-level scope  @ ~/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:10  [11] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [12] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3288  [13] top-level scope  @ stdin:5  [14] eval(m::Module, e::Any)  @ Core ./boot.jl:489  [15] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [16] include_string  @ ./loading.jl:3140 [inlined]  [17] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [18] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:1 in expression starting at stdin:5 ✗ GraphsMatching 18230.0 ms ✓ Boscia 31010.6 ms ✓ SCIP 14259.0 ms ✓ Boscia → BosciaHiGHSExt ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("c3af3a8c-b79e-4b01-bf44-c718d7e0e0d6"), "GraphsMatching") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2840  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2694  [4] macro expansion  @ ./loading.jl:2621 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2585  [7] require  @ ./loading.jl:2561 [inlined]  [8] eval_import_path  @ ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using  @ ./module.jl:137 [inlined]  [11] _eval_using(to::Module, path::Expr)  @ Base ./module.jl:137  [12] top-level scope  @ ~/.julia/packages/CombinatorialLinearOracles/2KdaS/src/CombinatorialLinearOracles.jl:6  [13] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3288  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:489  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [18] include_string  @ ./loading.jl:3140 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [20] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/CombinatorialLinearOracles/2KdaS/src/CombinatorialLinearOracles.jl:1 in expression starting at stdin:5 ✗ CombinatorialLinearOracles 20667.2 ms ✓ Boscia → BosciaSCIPExt 9 dependencies successfully precompiled in 207 seconds. 172 already precompiled. Precompilation completed after 246.41s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_pfX1V9/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.8 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.4 [31c24e10] Distributions v0.25.123 [497a8b3b] DoubleFloats v1.5.5 [f55ce6ea] FrankWolfe v0.6.3 [86223c79] Graphs v1.13.4 [87dc4568] HiGHS v1.21.1 [b8f27783] MathOptInterface v1.49.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_pfX1V9/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.3 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.8 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.4 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.3 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.123 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.5.5 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.2 [f55ce6ea] FrankWolfe v0.6.3 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.13.4 [06909019] GraphsFlows v0.1.1 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.21.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [4076af6c] JuMP v1.29.4 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.2 [b8f27783] MathOptInterface v1.49.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.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.7.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.17 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.6.3 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.13.1+0 [e33a78d0] Hwloc_jll v2.13.0+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.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.9+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.18.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.30+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.5+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.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 = 0xa4fca8a8724dc23d [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##14", var"#grad!#grad!##6", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ 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##20", var"#grad!#grad!##8", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##23", var"#grad!#grad!##9", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##26", var"#grad!#grad!##10", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = OPT_TREE_EMPTY Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = OPT_TREE_EMPTY LMO Tests seed = 0x6f2089ac4718eaba ┌ 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##34", var"#grad!#grad!##14", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##40", var"#grad!#grad!##16", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##46", var"#grad!#grad!##18", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##49", var"#grad!#grad!##19", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ReverseKnapsackLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0x6ffc693250a64eef ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##55", var"#grad!#grad!##21", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##58", var"#grad!#grad!##22", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##61", var"#grad!#grad!##23", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: Polish solution [ Info: Polish solution Sparse Regression Tests seed = 0x2e956b3e300f9646 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 1.941743e+00 1.951016e+00 9.272339e-03 4.775265e-03 2.888300e+01 1.038673e-01 10761 31 6 4 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 7.143109e+00 -2.678044e-01 7.410913e+00 0.000000e+00 Inf 1 LD 2 1.951016e+00 1.951016e+00 0.000000e+00 3.415745e+00 5.855238e-01 1 Last 2 1.951016e+00 1.951016e+00 0.000000e+00 3.647752e+00 5.482828e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.951016e+00 1.951016e+00 0.000000e+00 3.654121e+00 5.473272e-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: 1.951015553521947 Dual Bound: 1.9417432142892133 Dual Gap (relative): 0.0047752654236147525 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 40.747 LMO calls / sec: 0.2699585245539549 Nodes / sec: 0.0736250521510786 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 47 Global tightenings / node: 47.0 Total number of local tightenings: 47 Local tightenings / node: 47.0 Total number of potential local tightenings: 48 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 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.603494e+00 3.293008e+00 6.895141e-01 2.648418e-01 2.711000e+01 1.106603e-01 12990 229 35 65 23 1 * 3 4 2.618419e+00 3.281500e+00 6.630805e-01 2.532369e-01 2.739700e+01 2.555024e-01 86 57 70 25 13 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##71", var"#grad!#grad!##27", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 100 41 3.027299e+00 3.281500e+00 2.542007e-01 8.396947e-02 3.495200e+01 4.034104e+00 42 27 930 16 13 1 200 41 3.090822e+00 3.281500e+00 1.906779e-01 6.169166e-02 3.861800e+01 6.240613e+00 49 32 1362 21 12 1 300 41 3.138079e+00 3.281500e+00 1.434212e-01 4.570349e-02 4.213900e+01 8.092266e+00 36 23 1799 16 6 0 400 39 3.190037e+00 3.281500e+00 9.146245e-02 2.867128e-02 4.574600e+01 9.596467e+00 53 34 2251 19 6 1 500 37 3.246702e+00 3.281500e+00 3.479749e-02 1.071780e-02 4.939500e+01 1.087155e+01 44 27 2715 26 11 2 501 36 3.249632e+00 3.281500e+00 3.186796e-02 9.806636e-03 4.941000e+01 1.086825e+01 10 6 2717 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.492717e+00 1.496141e+00 6.996576e+00 0.000000e+00 Inf 1 LD 2 3.281500e+00 3.281500e+00 0.000000e+00 2.183931e-01 9.157797e+00 1 Last 2 3.281500e+00 3.281500e+00 0.000000e+00 4.458196e-01 4.486120e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.281500e+00 3.281500e+00 0.000000e+00 4.523690e-01 4.421169e+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.2814998527676127 Dual Bound: 3.2496318955091463 Dual Gap (relative): 0.00980663603853302 Search Statistics. Total number of nodes processed: 537 Total number of lmo calls: 2722 Total time (s): 52.824 LMO calls / sec: 51.52960775405119 Nodes / sec: 10.165833711949114 LMO calls / node: 5.068901303538175 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: 5th entry: 0.17039631136032185 28th entry: 0.17039631136032185 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.694227e+00 3.293008e+00 5.987818e-01 2.222463e-01 3.880000e-01 7.731959e+00 377 285 35 65 23 1 * 3 4 2.707179e+00 3.281500e+00 5.743210e-01 2.121474e-01 7.210000e-01 9.708738e+00 106 69 70 25 13 0 100 17 3.125935e+00 3.281500e+00 1.555650e-01 4.976593e-02 8.227000e+00 1.422147e+01 38 23 991 21 11 0 200 17 3.231211e+00 3.281500e+00 5.028916e-02 1.556357e-02 1.340100e+01 1.619282e+01 45 28 1672 25 10 0 217 16 3.252354e+00 3.281500e+00 2.914616e-02 8.961559e-03 1.430900e+01 1.628346e+01 51 32 1789 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.492717e+00 1.496141e+00 6.996576e+00 0.000000e+00 Inf 1 LD 2 3.281500e+00 3.281500e+00 0.000000e+00 2.068331e-03 9.669632e+02 1 Last 2 3.281500e+00 3.281500e+00 0.000000e+00 1.271550e-02 1.572884e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.281500e+00 3.281500e+00 0.000000e+00 1.867059e-02 1.071203e+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.2814998527676127 Dual Bound: 3.252353692441435 Dual Gap (relative): 0.008961559252892479 Search Statistics. Total number of nodes processed: 233 Total number of lmo calls: 1794 Total time (s): 14.349 LMO calls / sec: 125.02613422538155 Nodes / sec: 16.23806537040909 LMO calls / node: 7.6995708154506435 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 = 0x707ce04dfdf44983 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.060003e+02 -1.779893e+02 2.801100e+01 1.573746e-01 3.121000e+01 9.612304e-02 17355 160 45 1679 31 1 * 2 3 -2.060003e+02 -1.897358e+02 1.626451e+01 8.572191e-02 3.258700e+01 1.534354e-01 1366 124 80 582 34 8 25 26 -2.058150e+02 -1.897358e+02 1.607924e+01 8.474540e-02 1.200060e+02 4.249788e-01 1084 83 919 485 23 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 4.174086e+02 -4.433693e+02 8.607780e+02 0.000000e+00 Inf 1 LD 2 -1.950574e+02 -2.238814e+02 2.882403e+01 2.460450e-01 8.128594e+00 2 LD 38 -2.005611e+02 -2.117864e+02 1.122526e+01 7.029236e-01 5.405993e+01 4 LD 70 -2.018220e+02 -2.064799e+02 4.657880e+00 8.480797e-01 8.253941e+01 5 LD 87 -2.021478e+02 -2.043830e+02 2.235175e+00 8.906576e-01 9.768063e+01 6 LD 134 -2.024086e+02 -2.030709e+02 6.623331e-01 9.895260e-01 1.354184e+02 9 LD 189 -2.024378e+02 -2.026647e+02 2.268992e-01 1.093823e+00 1.727885e+02 9 LD 232 -2.024404e+02 -2.025411e+02 1.006289e-01 1.165074e+00 1.991289e+02 9 LD 279 -2.024409e+02 -2.024860e+02 4.512021e-02 1.247445e+00 2.236571e+02 10 LD 305 -2.024409e+02 -2.024606e+02 1.972022e-02 1.294020e+00 2.356996e+02 11 LD 338 -2.024409e+02 -2.024448e+02 3.890729e-03 1.347838e+00 2.507720e+02 11 LD 412 -2.024409e+02 -2.024425e+02 1.585517e-03 1.457206e+00 2.827329e+02 12 LD 433 -2.024409e+02 -2.024417e+02 7.837087e-04 1.487027e+00 2.911850e+02 12 LD 455 -2.024409e+02 -2.024412e+02 2.668692e-04 1.516934e+00 2.999472e+02 12 LD 492 -2.024409e+02 -2.024411e+02 1.332616e-04 1.560814e+00 3.152202e+02 12 LD 531 -2.024409e+02 -2.024410e+02 5.278566e-05 1.680555e+00 3.159671e+02 12 LD 560 -2.024409e+02 -2.024410e+02 2.182703e-05 1.713498e+00 3.268168e+02 12 LD 615 -2.024409e+02 -2.024409e+02 6.535142e-06 1.774752e+00 3.465272e+02 12 P 1000 -2.024409e+02 -2.024409e+02 6.535142e-06 2.230794e+00 4.482709e+02 12 LD 1026 -2.024409e+02 -2.024409e+02 2.093089e-06 2.341523e+00 4.381763e+02 12 P 2000 -2.024409e+02 -2.024409e+02 2.093089e-06 3.401270e+00 5.880157e+02 12 P 3000 -2.024409e+02 -2.024409e+02 2.093089e-06 4.480423e+00 6.695796e+02 12 P 4000 -2.024409e+02 -2.024409e+02 2.093089e-06 5.533106e+00 7.229213e+02 12 P 5000 -2.024409e+02 -2.024409e+02 2.093089e-06 6.581741e+00 7.596774e+02 12 P 6000 -2.024409e+02 -2.024409e+02 2.093089e-06 7.613978e+00 7.880244e+02 12 P 7000 -2.024409e+02 -2.024409e+02 2.093089e-06 8.686407e+00 8.058568e+02 12 P 8000 -2.024409e+02 -2.024409e+02 2.093089e-06 9.768391e+00 8.189681e+02 12 P 9000 -2.024409e+02 -2.024409e+02 2.093089e-06 1.086601e+01 8.282713e+02 12 P 10000 -2.024409e+02 -2.024409e+02 2.093089e-06 1.192594e+01 8.385086e+02 12 Last 10001 -2.024409e+02 -2.024409e+02 2.093089e-06 1.193305e+01 8.380924e+02 12 ---------------------------------------------------------------------------------------------------------------- PP 10001 -2.024409e+02 -2.024409e+02 2.467497e-06 1.193826e+01 8.377267e+02 12 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -202.4409387833001 Dual Bound: -205.81504457013995 Dual Gap (relative): 0.016667111934565743 Search Statistics. Total number of nodes processed: 51 Total number of lmo calls: 954 Total time (s): 134.912 LMO calls / sec: 7.071276091081594 Nodes / sec: 0.37802419354838707 LMO calls / node: 18.705882352941178 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.003381e+02 -1.938215e+02 6.516652e+00 3.362193e-02 3.385500e+01 8.861320e-02 13877 186 31 109 17 1 * 3 4 -1.997505e+02 -1.948551e+02 4.895378e+00 2.512317e-02 3.681500e+01 1.901399e-01 358 123 78 141 19 2 * 4 5 -1.997505e+02 -1.950072e+02 4.743268e+00 2.432355e-02 3.798700e+01 2.369232e-01 265 95 97 98 18 4 * 7 8 -1.993879e+02 -1.957562e+02 3.631677e+00 1.855204e-02 4.180000e+01 3.588517e-01 277 115 162 81 12 3 33 34 -1.977016e+02 -1.957562e+02 1.945373e+00 9.937732e-03 6.640200e+01 1.009006e+00 254 88 648 106 13 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.032071e+02 -2.217126e+02 1.185055e+02 0.000000e+00 Inf 1 LD 2 -1.957562e+02 -1.957562e+02 0.000000e+00 1.604065e-01 1.246832e+01 1 Last 2 -1.957562e+02 -1.957562e+02 0.000000e+00 3.279828e-01 6.097881e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.957562e+02 -1.957562e+02 0.000000e+00 3.321904e-01 6.020644e+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: -195.7561881582195 Dual Bound: -197.70156069522952 Dual Gap (relative): 0.009937732008950272 Search Statistics. Total number of nodes processed: 67 Total number of lmo calls: 653 Total time (s): 68.722 LMO calls / sec: 9.502051744710574 Nodes / sec: 0.9749425220453422 LMO calls / node: 9.746268656716419 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.805710e+02 3.349113e+02 1.543403e+02 8.547345e-01 1.850100e+01 1.621534e-01 8872 126 25 61 13 0 * 5 6 2.119127e+02 3.341695e+02 1.222568e+02 5.769205e-01 1.968500e+01 5.588011e-01 199 85 106 68 14 2 * 47 42 2.657825e+02 3.338769e+02 6.809436e+01 2.562033e-01 5.296500e+01 1.718116e+00 103 46 729 34 6 0 100 89 2.929516e+02 3.338769e+02 4.092527e+01 1.396998e-01 5.997300e+01 3.184766e+00 71 35 1422 25 5 1 200 93 3.186545e+02 3.338769e+02 1.522240e+01 4.777085e-02 6.581700e+01 4.482125e+00 27 16 2136 7 0 0 * 204 89 3.190947e+02 3.331426e+02 1.404790e+01 4.402422e-02 6.604600e+01 4.496866e+00 12 6 2161 2 0 0 * 213 74 3.200332e+02 3.320124e+02 1.197912e+01 3.743087e-02 6.650500e+01 4.556048e+00 13 6 2213 2 0 0 287 18 3.287982e+02 3.320124e+02 3.214192e+00 9.775577e-03 7.430600e+01 4.319974e+00 14 7 2504 3 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 3.357053e+02 3.082902e+02 2.741502e+01 0.000000e+00 Inf 1 LD 2 3.320124e+02 3.320124e+02 1.110038e-09 1.667594e-01 1.199332e+01 2 Last 2 3.320124e+02 3.320124e+02 1.110038e-09 3.275195e-01 6.106506e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.320124e+02 3.320124e+02 1.110038e-09 3.307822e-01 6.046275e+00 2 ---------------------------------------------------------------------------------------------------------------- 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: 332.0123540839905 Dual Bound: 328.7981624330066 Dual Gap (relative): 0.009775576685708446 Search Statistics. Total number of nodes processed: 321 Total number of lmo calls: 2509 Total time (s): 76.567 LMO calls / sec: 32.76868624864498 Nodes / sec: 4.192406650384631 LMO calls / node: 7.816199376947041 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.805710e+02 3.349113e+02 1.543403e+02 8.547345e-01 2.127100e+01 1.410371e-01 8649 118 25 61 13 0 * 7 8 2.157488e+02 3.341695e+02 1.184208e+02 5.488826e-01 2.882700e+01 5.203455e-01 184 80 142 62 12 1 * 27 26 2.461247e+02 3.338769e+02 8.775220e+01 3.565356e-01 6.075500e+01 8.723562e-01 132 63 456 46 6 1 100 83 2.894153e+02 3.338769e+02 4.446155e+01 1.536254e-01 1.165970e+02 1.569509e+00 50 26 1402 17 5 1 200 97 3.158625e+02 3.338769e+02 1.801441e+01 5.703246e-02 1.473710e+02 2.015322e+00 23 13 2158 6 0 0 * 208 97 3.172940e+02 3.337245e+02 1.643046e+01 5.178309e-02 1.497070e+02 2.037313e+00 6 3 2211 2 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##81"{Float64}, var"#grad!#grad!##31"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 * 246 65 3.234130e+02 3.320124e+02 8.599379e+00 2.658947e-02 1.536660e+02 2.062916e+00 8 4 2375 2 0 0 277 38 3.288477e+02 3.320124e+02 3.164690e+00 9.623575e-03 1.551920e+02 2.068406e+00 9 5 2479 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.357053e+02 3.082902e+02 2.741502e+01 0.000000e+00 Inf 1 LD 2 3.320124e+02 3.320124e+02 1.110038e-09 1.485791e-01 1.346084e+01 2 Last 2 3.320124e+02 3.320124e+02 1.110038e-09 2.936374e-01 6.811121e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.320124e+02 3.320124e+02 1.110038e-09 2.972614e-01 6.728086e+00 2 ---------------------------------------------------------------------------------------------------------------- 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: 332.0123540839905 Dual Bound: 328.8476639760725 Dual Gap (relative): 0.009623574848165091 Search Statistics. Total number of nodes processed: 321 Total number of lmo calls: 2484 Total time (s): 157.24 LMO calls / sec: 15.7975069956754 Nodes / sec: 2.041465276011193 LMO calls / node: 7.738317757009346 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 = 0x31d0bf9861215892 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.143710e+01 3.350759e+01 6.494469e+01 Inf 1.983500e+01 1.512478e-01 9397 112 44 5018 21 6 * 42 43 -1.254595e+01 2.314209e+01 3.568804e+01 Inf 2.832800e+01 3.000565e+00 164 36 1290 3473 21 20 * 60 61 -8.848743e+00 1.609928e+01 2.494803e+01 Inf 3.307600e+01 3.658242e+00 405 51 1833 10001 25 3 100 99 -3.798568e+00 1.609928e+01 1.989785e+01 Inf 4.273200e+01 4.656932e+00 189 88 3134 2352 17 16 183 168 1.773820e+00 1.609928e+01 1.432546e+01 8.076055e+00 6.000300e+01 5.849708e+00 79 47 5555 570 15 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 16.099284237214675 Dual Bound: 1.773819616904099 Dual Gap (relative): 8.076054906480989 Search Statistics. Total number of nodes processed: 351 Total number of lmo calls: 5555 Total time (s): 60.807 LMO calls / sec: 91.35461377801897 Nodes / sec: 5.7723617346687055 LMO calls / node: 15.826210826210826 Total number of global tightenings: 20 Global tightenings / node: 0.11 Total number of local tightenings: 1124 Local tightenings / node: 6.14 Total number of potential local tightenings: 1663 Time Limit Test seed = 0x621b93284ab015ba 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 -2.713700e+00 0.000000e+00 2.713700e+00 Inf 1.836700e+01 1.633364e-01 9498 215 29 361 10 9 * 6 7 -2.511358e+00 -1.856981e+00 6.543768e-01 3.523875e-01 1.933100e+01 6.724950e-01 64 41 139 565 10 17 63 8 -1.865955e+00 -1.856981e+00 8.973753e-03 4.832442e-03 2.393100e+01 2.966863e+00 4 2 1000 4 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -1.856980844935821 Dual Bound: -1.8659545974831873 Dual Gap (relative): 0.004832442171839668 Search Statistics. Total number of nodes processed: 71 Total number of lmo calls: 1000 Total time (s): 24.749 LMO calls / sec: 40.405672956483095 Nodes / sec: 2.8688027799102995 LMO calls / node: 14.084507042253522 Total number of global tightenings: 6 Global tightenings / node: 0.1 Total number of local tightenings: 107 Local tightenings / node: 1.7 Total number of potential local tightenings: 137 Strong Convexity and Sharpness Tests seed = 0x94dcfbd9a5a51971 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.857194e+02 1.862194e+02 4.999280e-01 2.691846e-03 1.555300e+01 1.928888e-01 6090 0 6 4 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 186.21935870889817 Dual Bound: 185.71943067611613 Dual Gap (relative): 0.0026918456025954688 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 6 Total time (s): 16.389 LMO calls / sec: 0.3660992128866923 Nodes / sec: 0.18304960644334614 LMO calls / node: 2.0 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 18 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.954311e+02 1.960666e+02 6.355825e-01 3.252208e-03 1.530400e+01 1.960272e-01 7723 0 9 8 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 196.0666344762867 Dual Bound: 195.43105200491297 Dual Gap (relative): 0.0032522082077200286 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 9 Total time (s): 16.166 LMO calls / sec: 0.5567239886180874 Nodes / sec: 0.18557466287269578 LMO calls / node: 3.0 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 17 Branching Strategy Tests seed = 0xd8c58edf5aff5434 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.752300e+01 1.712036e-01 8636 48 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.881900e+01 3.453956e+00 7 4 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.584 LMO calls / sec: 48.66217320261438 Nodes / sec: 3.3190359477124183 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.280000e-01 9.146341e+00 206 33 48 3749 24 11 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#build_examples##0"{Vector{Float64}}, var"#grad!#build_examples##1"{Vector{Float64}}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.635000e+00 5.321101e+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.637 LMO calls / sec: 620.0366524129505 Nodes / sec: 53.1459987782529 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.550000e-01 8.450704e+00 216 35 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.411000e+00 4.181432e+01 2 1 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.412 LMO calls / sec: 608.356940509915 Nodes / sec: 41.78470254957507 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 4.170000e-01 7.194245e+00 269 35 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.539000e+00 4.873294e+01 9 5 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.54 LMO calls / sec: 585.7142857142857 Nodes / sec: 48.7012987012987 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.110000e-01 9.646302e+00 206 32 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.580000e+00 6.139241e+01 2 1 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.58 LMO calls / sec: 743.0379746835442 Nodes / sec: 61.392405063291136 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.330000e-01 6.928406e+00 430 48 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.220000e-01 1.246537e+01 75 26 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.370000e-01 1.314217e+01 113 31 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.547000e+00 2.663310e+01 75 25 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.029000e+00 2.702703e+01 54 16 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.295400e+01 3.095569e+01 55 17 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.818500e+01 3.282925e+01 45 15 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.316200e+01 3.423711e+01 44 16 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.717100e+01 3.558942e+01 16 8 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.176900e+01 3.585256e+01 52 19 16456 348 17 12 ====================================================================================== 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 54 running 1 of 1 signal (10): User defined signal 1 SCIPclockReset at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPheurInit at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsetInitPlugins at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPtransformProb at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPpresolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:21458 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/wrapper.jl:16 [inlined] optimize! at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:427 _optimize_and_return at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/moi_oracle.jl:358 #compute_extreme_point#108 at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/moi_oracle.jl:43 compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/moi_oracle.jl:24 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/time_tracking_lmo.jl:116 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/time_tracking_lmo.jl:108 [inlined] #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/blended_pairwise.jl:291 unknown function (ip: 0x7d2b2b80cc45) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/frank_wolfe_variants.jl:207 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/frank_wolfe_variants.jl:187 unknown function (ip: 0x7d2b2b9f66c7) 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/vpy1o/src/node.jl:361 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/custom_bonobo.jl:29 unknown function (ip: 0x7d2b2b9d24ea) 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/vpy1o/src/interface.jl:270 unknown function (ip: 0x7d2b2b9d0159) 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/vpy1o/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7d2b2b9c820c) 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:679 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:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_65189.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:679 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:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_65189.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:679 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_34930.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: 0x7d2ba0d1a249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.594300e+01 3.541719e+01 11 6 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 3.915000e+01 3.496807e+01 6 3 20396 14 0 0 ====================================================================================== 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_73028.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 ============================================================== 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.572200e+01 3.116662e+01 18 15 21913 21 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 0x00007e34ebbb31c0 Total snapshots: 437. Utilization: 0% ╎437 @Base/task.jl:1168 wait_forever() 436╎ 437 @Base/task.jl:1246 wait() 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.878500e+01 3.015271e+01 26 9 23185 174 12 11 ┌ 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 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.381200e+01 2.778191e+01 8 5 24396 13 0 0 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007d2b867fc010 Total snapshots: 212. Utilization: 100% ╎194 @Base/client.jl:585 _start() ╎ 194 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 194 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ 194 @Base/Base.jl:325 (::Base.IncludeInto)(fname::String) ╎ 194 @Base/Base.jl:324 include(mapexpr::Function, mod::Module, _path::St… ╎ 194 @Base/loading.jl:3190 _include(mapexpr::Function, mod::Module, _pa… ╎ ╎ 194 @Base/loading.jl:3130 include_string(mapexpr::typeof(identity), m… ╎ ╎ 194 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 194 @Base/Base.jl:325 (::Base.IncludeInto)(fname::String) ╎ ╎ 194 @Base/Base.jl:324 include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 194 @Base/loading.jl:3190 _include(mapexpr::Function, mod::Module… ╎ ╎ ╎ 194 @Base/loading.jl:3130 include_string(mapexpr::typeof(identit… ╎ ╎ ╎ 194 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ 194 @Boscia/…oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 194 @Boscia/…oracle.jl:834 #solve#146 ╎ ╎ ╎ 194 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Na… ╎ ╎ ╎ ╎ 194 @Boscia/…rface.jl:270 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 194 @Boscia/…onobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 192 @Boscia/…onobo.jl:36 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 6 @Boscia/…node.jl:333 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 6 @Boscia/…ties.jl:30 check_feasibility ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…cle.jl:474 check_feasibility(lmo::FrankWo… ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…apper.jl:427 optimize!(o::SCIP.Optimizer) ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…apper.jl:16 macro expansion 6╎ ╎ ╎ ╎ ╎ 6 @SCIP/…CIP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ 3 @Boscia/…node.jl:349 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 3 @Boscia/…blem.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…cle.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…cle.jl:234 is_linear_feasible(o::SCIP.Op… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:247 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…pper.jl:396 get(o::SCIP.Optimizer, ::Mat… ╎ ╎ ╎ ╎ ╎ 1 @Base/sort.jl:1734 sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/sort.jl:1741 #sort!#24 ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1594 _sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:561 _sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:686 _sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:747 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:802 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:731 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:780 _sort! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:0 _sort!(v::Vector{MathO… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:251 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:435 get(o::SCIP.Optimizer, ::Mat… ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:248 ht_keyindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:134 isslotempty 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:238 is_linear_feasible(o::SCIP.Op… ╎ ╎ ╎ ╎ ╎ 1 @Base/…rray.jl:1241 iterate ╎ ╎ ╎ ╎ ╎ 1 @Base/…rray.jl:1249 _iterate_abstractarray 1╎ ╎ ╎ ╎ ╎ 1 @Base/…als.jl:1027 getindex ╎ ╎ ╎ ╎ 183 @Boscia/…node.jl:361 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 183 @Boscia/…ants.jl:187 kwcall(::@NamedTuple{epsilon::… ╎ ╎ ╎ ╎ ╎ 183 @Boscia/…nts.jl:207 #solve_frank_wolfe#7 ╎ ╎ ╎ ╎ ╎ 183 @FrankWolfe/…jl:76 kwcall(::@NamedTuple{line_sear… ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…er.jl:16 macro expansion 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:206 blended_pairwise_conditional_… 1╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:208 blended_pairwise_conditional_… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:50 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:52 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:72 mul!(y::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:75 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:80 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:710 gemv!(y::Vector{Float6… 2╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:678 gemv!(trans::Char, al… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:211 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:355 active_set_argminmax ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:361 active_set_argminmax(active… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:18 dot ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:404 dot ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…als.jl:11 length 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:10 size ╎ ╎ ╎ ╎ ╎ 11 @FrankWolfe/…l:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:432 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:9 muladd_memory_mode(memory_mod… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:905 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:908 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:950 copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:997 copyto! 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:438 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 3 @LinearAlgebra/…:1048 dot(x::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 3 @LinearAlgebra/…:1049 macro expansion 3╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:453 perform_line_search(line_sea… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:50 (::var"#grad!#build_examples… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:466 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:9 muladd_memory_mode(memory_mod… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:905 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:908 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:950 copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:997 copyto! 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ 5 @FrankWolfe/…l:467 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1048 dot(x::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1049 macro expansion 4╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…at.jl:492 + 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1053 dot(x::Vector{Float64},… 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:245 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 38 @FrankWolfe/…l:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 38 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 38 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:81 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ing.jl:404 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:343 current_logger_for_env(std… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:568 env_override_minlevel(gro… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/env.jl:165 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/env.jl:59 access_env(onError::Retu… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/env.jl:55 _getenv ╎ ╎ ╎ ╎ ╎ ╎ 36 @Boscia/…s.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 36 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 9 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 9 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:833 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:701 _array_for_inner ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:872 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:409 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:873 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:696 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:688 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:675 Array 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:615 GenericMemory ╎ ╎ ╎ ╎ ╎ ╎ 8 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 8 @Base/…ay.jl:864 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 8 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…or.jl:45 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:1241 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1248 _iterate_abstracta… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:381 checkbounds ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1249 _iterate_abstracta… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1027 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 none:? #sol_values##0 4╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…IP.jl:20760 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::D… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ng.jl:46 hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:479 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:396 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:381 checkbounds ╎ ╎ ╎ ╎ ╎ ╎ 27 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:44 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…th.jl:38 - ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…th.jl:13 _broadcast_preserving_ze… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:3540 map ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:833 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:701 _array_for_inner ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:872 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:409 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:873 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ot.jl:696 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ot.jl:688 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ot.jl:675 Array 2╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 2 @Base/…ot.jl:615 GenericMemory ╎ ╎ ╎ ╎ ╎ ╎ 25 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 25 @LinearAlgebra/…:1048 dot(x::Vector{Float… 4╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 21 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 21 @LinearAlgebra/…:1049 macro expansion 7╎ ╎ ╎ ╎ ╎ ╎ ╎ 7 @Base/…ls.jl:1027 getindex 14╎ ╎ ╎ ╎ ╎ ╎ ╎ 14 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:119 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:45 (::var"#f#build_examples##0… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float64… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:266 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:186 active_set_update_pairwise!(… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:219 active_set_update_iterate_p… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:905 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:908 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:950 copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:997 copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:998 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:615 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:619 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:674 _broadcast_getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:698 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:699 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:674 _broadcast_getind… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:698 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:675 _broadcast_geti… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:702 _broadcast_get… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…at.jl:494 * ╎ ╎ ╎ ╎ ╎ 96 @FrankWolfe/…l:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 96 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 77 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 77 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 77 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 76 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 76 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 76 @SCIP/…er.jl:16 macro expansion 76╎ ╎ ╎ ╎ ╎ ╎ ╎ 76 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:359 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ts.jl:29 get(o::SCIP.Optimizer, ::M… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:478 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:239 ht_keyindex ╎ ╎ ╎ ╎ ╎ 7 @Boscia/…mo.jl:118 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 7 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 7 @Boscia/…e.jl:229 is_linear_feasible 1╎ ╎ ╎ ╎ ╎ ╎ 7 @Boscia/….jl:234 is_linear_feasible(o::SCIP… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:247 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:396 get(o::SCIP.Optimizer, :… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1734 sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1741 #sort!#24 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1594 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:561 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:686 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:747 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:802 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:731 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:780 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1380 _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…rt.jl:1123 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…rt.jl:1137 _sort!(v::Vec… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…rt.jl:1104 partition!(t:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:249 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…le.jl:47 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @MathOptInterface/…:115 throw_if_not_val… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…le.jl:35 is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:505 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:239 ht_keyindex(h::Dict{… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:707 isempty 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::Dict{… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:130 hashindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:86 - ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:254 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:56 get_tol ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:224 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:114 get_parameter(scipd::S… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:17170 SCIPgetParam ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:139 get_parameter(scipd::S… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:17213 SCIPgetRealParam ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…t.jl:49 free_model 12╎ ╎ ╎ ╎ ╎ ╎ 12 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…l:327 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:432 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:9 muladd_memory_mode(memory_mod… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:905 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:908 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:313 instantiate ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:562 check_broadcast_axes ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:559 check_broadcast_axes ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:102 axes 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:10 size ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:438 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float64},… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:0 macro expansion ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:453 perform_line_search(line_sea… 2╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:50 (::var"#grad!#build_examples… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:467 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1048 dot(x::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1049 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:492 + 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:340 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…l:356 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… 1╎ ╎ ╎ ╎ ╎ 4 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:77 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…uce.jl:564 sum ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ce.jl:564 #sum#274 ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:412 count ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:412 #count#731 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:413 count ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:413 #count#732 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1441 _count ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1433 bitcount ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1436 #bitcount#149 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1027 getindex ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:97 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1048 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1027 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 9 @FrankWolfe/…l:411 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 9 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 9 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:76 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…dim.jl:983 sum ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:983 #sum#735 ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:987 _sum ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:987 #_sum#737 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:988 _sum ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:988 #_sum#738 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:330 mapreduce ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:330 #mapreduce#728 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:338 _mapreduce_dim ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ce.jl:446 _mapreduce ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ce.jl:275 mapreduce_impl 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ce.jl:251 mapreduce_impl(f… ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…s.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:864 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:? #sol_values##0 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:20760 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 5 @LinearAlgebra/…:1048 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @LinearAlgebra/…:1049 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ls.jl:1027 getindex 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…at.jl:492 + 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:118 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:144 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Dates/…ns.jl:77 now() 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…bc.jl:223 TmStruct ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:427 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 3 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 3 @LinearAlgebra/…:1049 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ls.jl:1027 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:483 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:49 free_model 2╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:506 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:97 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:591 find_best_solution(tree::B… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:42 find_best_solution(tree::B… ╎ ╎ ╎ ╎ 1 @Boscia/…onobo.jl:85 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 1 @Base/array.jl:838 collect(itr::Base.Generator{DataS… ╎ ╎ ╎ ╎ 1 @Base/array.jl:864 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ 1 @Base/…rator.jl:45 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:425 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:324 popfirst!(pq::DataStructu… ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:176 percolate_down! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ing.jl:118 lt ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ple.jl:626 isless 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:625 isequal ╎ ╎ ╎ ╎ 1 @Boscia/…onobo.jl:98 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:232 callback ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:293 (::Boscia.var"#callback#build_… ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:137 isempty 1╎ ╎ ╎ ╎ ╎ 1 @Base/…piler.jl:57 getproperty [54] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/vpy1o/test/branching_strategy_test.jl:133 mpfr_clear at /workspace/srcdir/mpfr-4.2.2/src/clear.c:27 _ZN6soplex9SLUFactorIN5boost14multiprecision6numberINS2_8backends18mpfr_float_backendILj0ELNS2_20mpfr_allocation_typeE1EEELNS2_26expression_template_optionE0EEEE7freeAllEv at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex9SLUFactorIN5boost14multiprecision6numberINS2_8backends18mpfr_float_backendILj0ELNS2_20mpfr_allocation_typeE1EEELNS2_26expression_template_optionE0EEEED1Ev at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex10SoPlexBaseIdED1Ev at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpiFree at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpFree at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPfreeTransform at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPfreeTransform at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:21476 [inlined] free_model at /home/pkgeval/.julia/packages/Boscia/vpy1o/ext/BosciaSCIPExt.jl:49 [inlined] free_model at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:455 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/time_tracking_lmo.jl:130 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/time_tracking_lmo.jl:108 [inlined] #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/blended_pairwise.jl:483 unknown function (ip: 0x7d2b2b80cc45) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/5ZtLK/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/frank_wolfe_variants.jl:207 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/frank_wolfe_variants.jl:187 unknown function (ip: 0x7d2b2b9f66c7) 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/vpy1o/src/node.jl:361 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/custom_bonobo.jl:29 unknown function (ip: 0x7d2b2b9d24ea) 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/vpy1o/src/interface.jl:270 unknown function (ip: 0x7d2b2b9d0159) 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/vpy1o/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7d2b2b9c820c) 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:679 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:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_65189.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:679 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:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_65189.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:679 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_34930.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: 0x7d2ba0d1a249) 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) Allocations: 4331290727 (Pool: 4331286940; Big: 3787); GC: 2240 PkgEval terminated after 2727.79s: test duration exceeded the time limit