Package evaluation to test Boscia on Julia 1.14.0-DEV.1871 (50d44f5be7*) started at 2026-03-08T18:30:28.239 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 13.01s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.9 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.9 [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.4 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.49.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.7.1 [90137ffa] + StaticArrays v1.9.17 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.6.3 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.30+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.77s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 2112.6 ms ✓ Bonobo 2289.7 ms ✓ MUMPS_seq_jll 1912.1 ms ✓ LEMON_jll 2295.6 ms ✓ bliss_jll 2336.7 ms ✓ SPRAL_jll 10209.8 ms ✓ MathOptSetDistances 32022.9 ms ✓ FrankWolfe 21050.4 ms ✓ GraphsFlows ERROR: LoadError: UndefVarError: `get_liblemoncxxwrap_path` not defined in `LEMON_jll` Suggestion: check for spelling errors or missing imports. Stacktrace:  [1] getproperty(x::Module, f::Symbol)  @ Base ./Base_compiler.jl:51  [2] top-level scope  @ ~/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:9  [3] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [4] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3289  [5] top-level scope  @ stdin:5  [6] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [7] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3131  [8] include_string  @ ./loading.jl:3141 [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 2314.5 ms ✓ Ipopt_jll 14179.7 ms ✓ Boscia ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14b1564f-c77f-4800-9e89-efd961faef7c"), "LEMONGraphs") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2841  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2695  [4] macro expansion  @ ./loading.jl:2622 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2586  [7] require  @ ./loading.jl:2562 [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:3289  [13] top-level scope  @ stdin:5  [14] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [15] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3131  [16] include_string  @ ./loading.jl:3141 [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 6392.8 ms ✓ SCIP_PaPILO_jll 2413.8 ms ✓ SCIP_jll 12018.3 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:2841  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2695  [4] macro expansion  @ ./loading.jl:2622 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2586  [7] require  @ ./loading.jl:2562 [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:3289  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3131  [18] include_string  @ ./loading.jl:3141 [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 23778.9 ms ✓ SCIP 17230.7 ms ✓ Boscia → BosciaSCIPExt 15 dependencies successfully precompiled in 197 seconds. 162 already precompiled. Precompilation completed after 224.8s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_3MJcwk/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.9 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.4 [31c24e10] Distributions v0.25.123 [497a8b3b] DoubleFloats v1.6.2 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.22.0 [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_3MJcwk/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.9 [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.6.2 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.2 [f55ce6ea] FrankWolfe v0.6.4 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.14.0 [06909019] GraphsFlows v0.1.1 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.22.0 [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.30.0 [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 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.9 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.17 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.6.3 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.13.1+0 [e33a78d0] Hwloc_jll v2.13.0+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.9+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.18.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.30+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.5+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0x2c0f4981d1a79103 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##0", var"#grad!#grad!##0", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/klQke/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/klQke/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##11"{Float64}, var"#grad!#grad!##5"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/klQke/src/callbacks.jl:252 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##14", var"#grad!#grad!##6", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/klQke/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/klQke/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/klQke/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/klQke/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 Callback Tests seed = 0x414b04950a6aa6b0 LMO Tests seed = 0x10510975c317e2c7 ┌ 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##47", var"#grad!#grad!##19", 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/klQke/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##50", var"#grad!#grad!##20", 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/klQke/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0xdf082ff47a83556e ┌ 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##56", 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/klQke/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##59", 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/klQke/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##62", var"#grad!#grad!##24", 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/klQke/src/callbacks.jl:252 Sparse Regression Tests seed = 0x57f86c8476c56522 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 2.642262e+00 2.917244e+00 2.749822e-01 1.040708e-01 2.264100e+01 1.325030e-01 8979 39 14 17 8 0 * 3 4 2.687232e+00 2.849385e+00 1.621528e-01 6.034195e-02 2.608200e+01 2.683843e-01 22 14 30 9 6 0 21 8 2.822972e+00 2.849385e+00 2.641329e-02 9.356555e-03 2.640400e+01 1.098318e+00 5 3 109 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 5.385792e+00 1.300596e+00 4.085196e+00 0.000000e+00 Inf 1 LD 2 2.849385e+00 2.849385e+00 0.000000e+00 2.409801e+00 8.299441e-01 1 Last 2 2.849385e+00 2.849385e+00 0.000000e+00 2.562181e+00 7.805848e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.849385e+00 2.849385e+00 0.000000e+00 2.565253e+00 7.796502e-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: 2.849385128704229 Dual Bound: 2.822971836516598 Dual Gap (relative): 0.009356555331498956 Search Statistics. Total number of nodes processed: 29 Total number of lmo calls: 114 Total time (s): 31.465 LMO calls / sec: 3.6230732559987286 Nodes / sec: 0.9216589861751152 LMO calls / node: 3.9310344827586206 Total number of global tightenings: 41 Global tightenings / node: 1.95 Total number of local tightenings: 45 Local tightenings / node: 2.14 Total number of potential local tightenings: 45 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.740733e+00 3.234926e+00 1.494192e+00 8.583693e-01 1.940100e+01 1.546312e-01 9289 244 47 112 34 1 * 3 4 1.768407e+00 3.228606e+00 1.460199e+00 8.257140e-01 1.970100e+01 3.553119e-01 90 61 94 40 19 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##72", var"#grad!#grad!##28", 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/klQke/src/callbacks.jl:252 100 63 2.563877e+00 3.228606e+00 6.647292e-01 2.592672e-01 2.661000e+01 6.125517e+00 25 17 1325 21 18 3 200 65 2.661816e+00 3.228606e+00 5.667902e-01 2.129337e-01 2.886800e+01 9.179715e+00 26 16 1761 33 16 0 300 65 2.726347e+00 3.228606e+00 5.022589e-01 1.842241e-01 3.102900e+01 1.176319e+01 21 14 2183 21 10 0 400 65 2.770525e+00 3.228606e+00 4.580810e-01 1.653409e-01 3.313500e+01 1.403350e+01 27 17 2618 26 10 1 500 65 2.819684e+00 3.228606e+00 4.089215e-01 1.450239e-01 3.529600e+01 1.600748e+01 28 18 3061 22 9 1 600 65 2.864989e+00 3.228606e+00 3.636168e-01 1.269173e-01 3.734000e+01 1.780932e+01 24 15 3507 36 12 2 700 65 2.911125e+00 3.228606e+00 3.174809e-01 1.090578e-01 3.928500e+01 1.947308e+01 27 17 3981 31 6 2 800 65 2.952930e+00 3.228606e+00 2.756755e-01 9.335660e-02 4.132000e+01 2.093417e+01 30 18 4459 38 12 3 900 65 3.007076e+00 3.228606e+00 2.215302e-01 7.366964e-02 4.336200e+01 2.225451e+01 40 25 4940 34 12 5 1000 63 3.071513e+00 3.228606e+00 1.570930e-01 5.114515e-02 4.544100e+01 2.339297e+01 8 5 5421 2 0 0 1100 39 3.168834e+00 3.228606e+00 5.977186e-02 1.886241e-02 4.721500e+01 2.412369e+01 23 14 5843 22 8 1 1125 16 3.198264e+00 3.228606e+00 3.034169e-02 9.486926e-03 4.756000e+01 2.399075e+01 6 3 5921 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 7.655891e+00 8.972543e-01 6.758636e+00 0.000000e+00 Inf 1 LD 2 3.228606e+00 3.228606e+00 0.000000e+00 1.504130e-01 1.329672e+01 1 Last 2 3.228606e+00 3.228606e+00 0.000000e+00 3.056124e-01 6.544237e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.228606e+00 3.228606e+00 0.000000e+00 3.088339e-01 6.475974e+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.2286057555354635 Dual Bound: 3.198264060737865 Dual Gap (relative): 0.009486926101592264 Search Statistics. Total number of nodes processed: 1141 Total number of lmo calls: 5926 Total time (s): 50.467 LMO calls / sec: 117.4232666891236 Nodes / sec: 22.60883349515525 LMO calls / node: 5.193689745836985 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: 12 Non zero entries: 14th entry: 0.16463141807510506 40th entry: 0.16463141807510506 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.888457e+00 3.234926e+00 1.346468e+00 7.129990e-01 2.960000e-01 1.013514e+01 289 215 47 112 34 1 * 3 4 1.908955e+00 3.228606e+00 1.319651e+00 6.912949e-01 6.370000e-01 1.098901e+01 88 60 94 40 19 0 100 31 2.667013e+00 3.228606e+00 5.615929e-01 2.105700e-01 7.780000e+00 1.683805e+01 18 12 1358 17 15 1 200 32 2.817028e+00 3.228606e+00 4.115781e-01 1.461037e-01 1.026100e+01 2.260988e+01 15 9 2023 28 13 5 300 32 2.925230e+00 3.228606e+00 3.033756e-01 1.037100e-01 1.227800e+01 2.704023e+01 14 10 2704 24 6 0 400 32 3.025569e+00 3.228606e+00 2.030369e-01 6.710701e-02 1.526300e+01 2.830374e+01 33 20 3456 41 13 7 500 28 3.149118e+00 3.228606e+00 7.948784e-02 2.524130e-02 1.852600e+01 2.850049e+01 36 22 4236 41 13 3 528 14 3.197579e+00 3.228606e+00 3.102722e-02 9.703348e-03 1.936300e+01 2.799153e+01 27 17 4436 28 10 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.655891e+00 8.972543e-01 6.758636e+00 0.000000e+00 Inf 1 LD 2 3.228606e+00 3.228606e+00 0.000000e+00 1.324736e-03 1.509735e+03 1 Last 2 3.228606e+00 3.228606e+00 0.000000e+00 7.632235e-03 2.620464e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.228606e+00 3.228606e+00 0.000000e+00 1.090638e-02 1.833789e+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.2286057555354635 Dual Bound: 3.197578537715655 Dual Gap (relative): 0.009703348159815372 Search Statistics. Total number of nodes processed: 542 Total number of lmo calls: 4441 Total time (s): 19.387 LMO calls / sec: 229.07102697684016 Nodes / sec: 27.956878320524062 LMO calls / node: 8.193726937269373 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 9 Poisson Tests seed = 0x3c449ae732f84575 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 -1.345224e+02 -1.169013e+02 1.762118e+01 1.507356e-01 2.129900e+01 1.408517e-01 10590 90 34 528 20 1 * 7 8 -1.345178e+02 -1.171167e+02 1.740115e+01 1.485796e-01 2.904600e+01 5.164222e-01 2477 111 238 1701 36 6 38 39 -1.344040e+02 -1.171167e+02 1.728731e+01 1.476076e-01 1.200050e+02 6.416399e-01 1022 54 1368 639 29 12 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.146713e+02 -3.406369e+02 6.553082e+02 0.000000e+00 Inf 1 LD 2 -1.275139e+02 -1.434735e+02 1.595962e+01 1.648110e-01 1.213511e+01 2 LD 55 -1.301083e+02 -1.369358e+02 6.827502e+00 5.178795e-01 1.062023e+02 4 LD 89 -1.308433e+02 -1.336591e+02 2.815817e+00 5.764910e-01 1.543823e+02 4 LD 134 -1.310044e+02 -1.322090e+02 1.204647e+00 6.421719e-01 2.086669e+02 6 LD 185 -1.310367e+02 -1.315364e+02 4.996823e-01 7.228837e-01 2.559195e+02 8 LD 241 -1.310442e+02 -1.312867e+02 2.424945e-01 8.067041e-01 2.987465e+02 8 LD 265 -1.310453e+02 -1.311521e+02 1.068259e-01 8.446793e-01 3.137285e+02 9 LD 298 -1.310457e+02 -1.310971e+02 5.141526e-02 9.314335e-01 3.199369e+02 9 LD 322 -1.310458e+02 -1.310627e+02 1.694339e-02 9.629519e-01 3.343885e+02 10 LD 359 -1.310458e+02 -1.310543e+02 8.460498e-03 1.001195e+00 3.585714e+02 10 LD 396 -1.310458e+02 -1.310487e+02 2.859887e-03 1.042395e+00 3.798943e+02 11 LD 417 -1.310458e+02 -1.310469e+02 1.148420e-03 1.066061e+00 3.911596e+02 11 LD 466 -1.310458e+02 -1.310463e+02 4.651306e-04 1.107558e+00 4.207456e+02 11 LD 495 -1.310458e+02 -1.310460e+02 2.054772e-04 1.132729e+00 4.369978e+02 11 LD 550 -1.310458e+02 -1.310459e+02 9.108128e-05 1.186697e+00 4.634711e+02 12 LD 596 -1.310458e+02 -1.310458e+02 4.475950e-05 1.231100e+00 4.841197e+02 12 LD 652 -1.310458e+02 -1.310458e+02 2.229280e-05 1.284163e+00 5.077235e+02 12 LD 712 -1.310458e+02 -1.310458e+02 9.688124e-06 1.370186e+00 5.196376e+02 13 LD 735 -1.310458e+02 -1.310458e+02 4.229095e-06 1.389224e+00 5.290723e+02 13 LD 792 -1.310458e+02 -1.310458e+02 1.876001e-06 1.434244e+00 5.522074e+02 13 P 1000 -1.310458e+02 -1.310458e+02 1.876001e-06 1.597232e+00 6.260832e+02 13 P 2000 -1.310458e+02 -1.310458e+02 1.876001e-06 2.523557e+00 7.925322e+02 13 P 3000 -1.310458e+02 -1.310458e+02 1.876001e-06 3.302128e+00 9.085051e+02 13 P 4000 -1.310458e+02 -1.310458e+02 1.876001e-06 4.085344e+00 9.791098e+02 13 P 5000 -1.310458e+02 -1.310458e+02 1.876001e-06 4.861946e+00 1.028395e+03 13 P 6000 -1.310458e+02 -1.310458e+02 1.876001e-06 5.636798e+00 1.064434e+03 13 P 7000 -1.310458e+02 -1.310458e+02 1.876001e-06 6.371336e+00 1.098671e+03 13 P 8000 -1.310458e+02 -1.310458e+02 1.876001e-06 7.120226e+00 1.123560e+03 13 P 9000 -1.310458e+02 -1.310458e+02 1.876001e-06 7.872431e+00 1.143230e+03 13 P 10000 -1.310458e+02 -1.310458e+02 1.876001e-06 8.636361e+00 1.157895e+03 13 Last 10001 -1.310458e+02 -1.310458e+02 1.423522e-06 8.641380e+00 1.157338e+03 13 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.310458e+02 -1.310458e+02 1.423522e-06 8.644788e+00 1.156882e+03 13 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -131.04579759926813 Dual Bound: -134.40396224195138 Dual Gap (relative): 0.025625885791106088 Search Statistics. Total number of nodes processed: 77 Total number of lmo calls: 1404 Total time (s): 131.26 LMO calls / sec: 10.696327898826757 Nodes / sec: 0.5866219716593022 LMO calls / node: 18.233766233766232 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 -1.338923e+02 -1.289267e+02 4.965539e+00 3.851442e-02 2.624300e+01 1.143162e-01 10718 180 35 197 21 1 100 99 -1.309711e+02 -1.289267e+02 2.044372e+00 1.585685e-02 1.238540e+02 1.606731e+00 79 32 2005 41 11 1 199 154 -1.302122e+02 -1.289267e+02 1.285425e+00 9.970196e-03 1.927120e+02 1.831749e+00 105 52 3515 35 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 -7.206257e+01 -1.538424e+02 8.177981e+01 0.000000e+00 Inf 1 LD 2 -1.289267e+02 -1.289267e+02 0.000000e+00 1.714824e-01 1.166300e+01 1 Last 2 -1.289267e+02 -1.289267e+02 0.000000e+00 3.400849e-01 5.880885e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.289267e+02 -1.289267e+02 0.000000e+00 3.446345e-01 5.803249e+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: -128.92674866763136 Dual Bound: -130.21217367903665 Dual Gap (relative): 0.009970196446348579 Search Statistics. Total number of nodes processed: 353 Total number of lmo calls: 3520 Total time (s): 195.817 LMO calls / sec: 17.975967357277458 Nodes / sec: 1.8027035446360633 LMO calls / node: 9.971671388101983 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.897852e+02 3.281648e+02 1.383796e+02 7.291382e-01 1.972100e+01 1.521221e-01 9697 118 24 75 12 0 * 16 17 2.300759e+02 3.275619e+02 9.748604e+01 4.237126e-01 2.292600e+01 1.439414e+00 125 53 299 41 7 1 * 44 45 2.557645e+02 3.271664e+02 7.140194e+01 2.791707e-01 2.729600e+01 3.260551e+00 61 29 703 22 5 2 100 99 2.860204e+02 3.271664e+02 4.114603e+01 1.438570e-01 3.444100e+01 5.777997e+00 112 40 1432 45 5 2 200 125 3.024998e+02 3.271664e+02 2.466661e+01 8.154257e-02 4.093500e+01 7.939416e+00 57 26 2214 22 3 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##79"{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/klQke/src/callbacks.jl:252 300 95 3.149119e+02 3.271664e+02 1.225452e+01 3.891413e-02 4.460600e+01 8.855311e+00 6 4 2693 0 0 0 393 38 3.240090e+02 3.271664e+02 3.157418e+00 9.744846e-03 4.679800e+01 9.209795e+00 22 13 3025 5 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.271664e+02 3.271664e+02 0.000000e+00 9.588403e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.271664e+02 3.271664e+02 0.000000e+00 1.659434e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 327.16639637496417 Dual Bound: 324.0089787067642 Dual Gap (relative): 0.009744846210133907 Search Statistics. Total number of nodes processed: 431 Total number of lmo calls: 3029 Total time (s): 49.685 LMO calls / sec: 60.96407366408373 Nodes / sec: 8.674650296870283 LMO calls / node: 7.027842227378191 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.897852e+02 3.281648e+02 1.383796e+02 7.291382e-01 2.416200e+01 1.241619e-01 10187 115 24 75 12 0 * 6 7 2.070210e+02 3.275619e+02 1.205409e+02 5.822641e-01 2.986600e+01 4.352776e-01 188 77 121 53 9 0 * 46 47 2.630685e+02 3.271664e+02 6.409785e+01 2.436546e-01 6.810000e+01 1.365639e+00 85 35 688 24 4 0 100 81 2.798310e+02 3.271664e+02 4.733537e+01 1.691570e-01 9.664500e+01 1.872834e+00 137 48 1278 50 4 1 200 137 2.994214e+02 3.271664e+02 2.774500e+01 9.266205e-02 1.344470e+02 2.506564e+00 12 7 1994 2 2 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##82"{Float64}, var"#grad!#grad!##32"{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/klQke/src/callbacks.jl:252 300 105 3.148626e+02 3.271664e+02 1.230380e+01 3.907674e-02 1.491920e+02 2.714623e+00 5 3 2336 0 0 0 400 35 3.233582e+02 3.271664e+02 3.808212e+00 1.177707e-02 1.570820e+02 2.769254e+00 62 33 2654 19 4 0 405 30 3.240034e+02 3.271664e+02 3.162985e+00 9.762196e-03 1.571840e+02 2.767457e+00 16 10 2671 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.271664e+02 3.271664e+02 0.000000e+00 9.667682e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.271664e+02 3.271664e+02 0.000000e+00 1.735662e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 327.16639637496417 Dual Bound: 324.00341159688713 Dual Gap (relative): 0.009762195905555151 Search Statistics. Total number of nodes processed: 435 Total number of lmo calls: 2675 Total time (s): 160.125 LMO calls / sec: 16.705698672911787 Nodes / sec: 2.7166276346604215 LMO calls / node: 6.149425287356322 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 = 0x56fb2832ee4d1b19 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 -1.145007e+02 6.657803e+00 1.211585e+02 Inf 2.551900e+01 1.175595e-01 13186 1863 42 10001 22 10 * 6 7 -1.129499e+02 -9.770536e+01 1.524457e+01 1.560259e-01 3.680600e+01 3.532033e-01 1091 833 239 10001 20 38 19 20 -1.105856e+02 -9.770536e+01 1.288023e+01 1.318272e-01 6.055600e+01 6.440320e-01 1848 1630 691 5342 19 18 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -97.70536099317982 Dual Bound: -110.5855884154585 Dual Gap (relative): 0.13182723334063282 Search Statistics. Total number of nodes processed: 39 Total number of lmo calls: 691 Total time (s): 61.669 LMO calls / sec: 11.204981433134963 Nodes / sec: 0.6324085034620311 LMO calls / node: 17.71794871794872 Total number of global tightenings: 9 Global tightenings / node: 0.47 Total number of local tightenings: 136 Local tightenings / node: 7.16 Total number of potential local tightenings: 230 Time Limit Test seed = 0x26958303265db379 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 -7.961273e-01 0.000000e+00 7.961273e-01 Inf 2.032300e+01 1.476160e-01 10309 101 27 481 13 4 ┌ 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##86", var"#grad!#grad!##34", 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/klQke/src/callbacks.jl:252 35 0 0.000000e+00 0.000000e+00 0.000000e+00 0.000000e+00 2.165700e+01 1.616106e+00 4 2 392 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: 0.0 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 35 Total number of lmo calls: 392 Total time (s): 22.815 LMO calls / sec: 17.18167872014026 Nodes / sec: 1.53407845715538 LMO calls / node: 11.2 Total number of global tightenings: 5 Global tightenings / node: 0.14 Total number of local tightenings: 28 Local tightenings / node: 0.8 Total number of potential local tightenings: 37 Strong Convexity and Sharpness Tests seed = 0x51f0185f7a0936df Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.004476e+02 2.007680e+02 3.204368e-01 1.598606e-03 1.998900e+01 1.500825e-01 9262 0 11 17 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 200.76802083177049 Dual Bound: 200.44758402784947 Dual Gap (relative): 0.0015986064660000693 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 21.299 LMO calls / sec: 0.5164561716512512 Nodes / sec: 0.14085168317761398 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 17 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.914987e+02 1.916563e+02 1.575384e-01 8.226600e-04 2.082200e+01 1.440784e-01 9800 0 10 11 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 191.65628532297893 Dual Bound: 191.49874695994632 Dual Gap (relative): 0.0008226600201491916 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 10 Total time (s): 22.062 LMO calls / sec: 0.45326806273229986 Nodes / sec: 0.13598041881968995 LMO calls / node: 3.3333333333333335 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 17 Branching Strategy Tests seed = 0x99dd5f9041f200e8 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 2.114000e+01 1.419111e-01 10403 50 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.260100e+01 2.875979e+00 9 6 953 27 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321771298479149 Dual Gap (relative): 0.008253858173238702 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 953 Total time (s): 23.803 LMO calls / sec: 40.036970129815565 Nodes / sec: 2.7307482250136537 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.690000e-01 8.130081e+00 235 47 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/klQke/src/callbacks.jl:252 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.900000e+00 4.578947e+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.901 LMO calls / sec: 533.929510783798 Nodes / sec: 45.765386638611254 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.930000e-01 7.633588e+00 249 46 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.626000e+00 3.628536e+01 3 2 859 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.338246272538823 Dual Gap (relative): 0.005990244287570652 Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 859 Total time (s): 1.627 LMO calls / sec: 527.9655808236017 Nodes / sec: 36.263060848186846 LMO calls / node: 14.559322033898304 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 77 Local tightenings / node: 1.35 Total number of potential local tightenings: 167 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Uniform Random Choice FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.950000e-01 7.594937e+00 236 43 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.743000e+00 4.302926e+01 11 8 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.744 LMO calls / sec: 517.2018348623853 Nodes / sec: 43.0045871559633 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.600000e-01 8.333333e+00 249 42 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 2.014000e+00 4.816286e+01 4 2 1174 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.325011777780223 Dual Gap (relative): 0.007807821244322148 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1174 Total time (s): 2.015 LMO calls / sec: 582.6302729528536 Nodes / sec: 48.13895781637717 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.800000e-01 6.250000e+00 477 65 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.990000e-01 1.126408e+01 92 35 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.370000e-01 1.173959e+01 136 40 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 6.623000e+00 3.034878e+01 76 30 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 7.017000e+00 3.092490e+01 44 15 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.138400e+01 3.522488e+01 49 21 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.726000e+01 3.458864e+01 53 20 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.309500e+01 3.433644e+01 54 23 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.801900e+01 3.451230e+01 19 10 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.339500e+01 3.410690e+01 59 24 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.766800e+01 3.379526e+01 14 8 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.120500e+01 3.322412e+01 7 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.375100e+01 3.257068e+01 8 4 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.578400e+01 3.212913e+01 29 11 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.767100e+01 3.136079e+01 9 5 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.908900e+01 3.078083e+01 11 7 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.042900e+01 3.008190e+01 13 7 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.155400e+01 2.954184e+01 10 6 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.209400e+01 2.923561e+01 6 4 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 52.095 LMO calls / sec: 528.361646991074 Nodes / sec: 29.235051348497937 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.088000e+00 1.436782e+00 469 66 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.295000e+00 3.921569e+00 55 21 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.391000e+00 4.600586e+00 94 29 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.015800e+01 1.978736e+01 86 33 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.077300e+01 2.014295e+01 64 22 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.727800e+01 2.297720e+01 99 25 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.209100e+01 2.539496e+01 45 20 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.683600e+01 2.656879e+01 23 13 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.073700e+01 2.762143e+01 44 18 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.408500e+01 2.895702e+01 23 13 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.730100e+01 2.962387e+01 8 5 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.047700e+01 3.016528e+01 10 6 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.350000e+01 3.022989e+01 11 6 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.614600e+01 3.040350e+01 12 8 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.809800e+01 3.037548e+01 8 5 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.999500e+01 3.038304e+01 7 5 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.143400e+01 3.066065e+01 9 6 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.279600e+01 3.070308e+01 13 8 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.409100e+01 3.067054e+01 12 7 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.518100e+01 3.042714e+01 6 4 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.532800e+01 3.034630e+01 14 8 26740 41 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.083355821757877 Dual Gap (relative): 0.009945008189894359 Search Statistics. Total number of nodes processed: 1679 Total number of lmo calls: 26740 Total time (s): 55.329 LMO calls / sec: 483.29086012760035 Nodes / sec: 30.345749968371017 LMO calls / node: 15.926146515783204 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2233 Local tightenings / node: 1.38 Total number of potential local tightenings: 5463 Number of alternative decisions: 438 Number of stable decisions: 401 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.330000e-01 5.628518e+00 467 61 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.261000e+00 1.030928e+01 102 34 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.294000e+00 2.049571e+01 63 26 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 9.012000e+00 2.230360e+01 73 28 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.557900e+01 2.573978e+01 76 32 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.217400e+01 2.683323e+01 54 26 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.709800e+01 2.823087e+01 17 11 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.166200e+01 2.940433e+01 65 27 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.588200e+01 3.012653e+01 51 19 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 3.946900e+01 3.063163e+01 51 23 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.320100e+01 3.090206e+01 7 4 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.619300e+01 3.128180e+01 54 22 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 4.916000e+01 3.130594e+01 34 17 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.190300e+01 3.134694e+01 5 4 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.407200e+01 3.119914e+01 12 7 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.617800e+01 3.116878e+01 29 12 26657 170 21 7 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.788500e+01 3.100976e+01 7 4 27751 16 0 0 1500 329 2.665304e+01 2.836265e+01 1.709610e+00 6.414315e-02 5.932100e+01 3.083225e+01 7 4 28707 8 0 0 1556 287 2.686764e+01 2.836265e+01 1.495006e+00 5.564337e-02 6.000000e+01 3.071667e+01 4 2 29199 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.867639136172446 Dual Gap (relative): 0.05564336641769814 Search Statistics. Total number of nodes processed: 1843 Total number of lmo calls: 29199 Total time (s): 60.001 LMO calls / sec: 486.64188930184497 Nodes / sec: 30.71615473075449 LMO calls / node: 15.843190450352687 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2545 Local tightenings / node: 1.64 Total number of potential local tightenings: 6019 Number of alternative decisions: 543 Number of stable decisions: 378 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.280000e-01 5.681818e+00 469 64 64 4885 42 8 ====================================================================================== 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 72 running 1 of 1 signal (10): User defined signal 1 unknown function (ip: 0x70c4945e860d) at /lib/x86_64-linux-gnu/libc.so.6 malloc at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) _ZN6soplex7DIdxSetC1Ei at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex10SPxSteepPRIdEC2EPKcNS1_5SetupE at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex10SoPlexBaseIdEC1Ev at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpiCreate at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpCreate 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/zefNM/src/moi_oracle.jl:358 #compute_extreme_point#108 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:43 compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:24 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/klQke/src/time_tracking_lmo.jl:116 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/klQke/src/time_tracking_lmo.jl:108 [inlined] #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:291 unknown function (ip: 0x70c4180ca845) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/klQke/src/frank_wolfe_variants.jl:207 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/klQke/src/frank_wolfe_variants.jl:187 unknown function (ip: 0x70c4180b72c7) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/klQke/src/node.jl:361 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/klQke/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/klQke/src/custom_bonobo.jl:29 unknown function (ip: 0x70c418092aba) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 #solve#109 at /home/pkgeval/.julia/packages/Boscia/klQke/src/interface.jl:270 unknown function (ip: 0x70c41808fd99) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 solve at /home/pkgeval/.julia/packages/Boscia/klQke/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/klQke/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/klQke/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x70c4180885cc) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3131 _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 _include at ./loading.jl:3191 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3131 _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 _include at ./loading.jl:3191 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [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: 0x70c494578249) 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 ============================================================== * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.930000e+00 1.399317e+01 79 31 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.555000e+00 1.772152e+01 52 23 968 257 18 16 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [inlined] start_task at /source/src/task.c:1275 unknown function (ip: (nil)) at (unknown file) 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 1.221100e+01 1.646057e+01 15 7 2918 60 18 11 ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000073db7ba9ba30 Total snapshots: 479. Utilization: 0% ╎479 @Base/task.jl:1168 wait_forever() 478╎ 479 @Base/task.jl:1246 wait() 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.879200e+01 2.038101e+01 40 19 5197 153 24 5 ┌ 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 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 2.628600e+01 2.157042e+01 24 13 7469 83 12 1 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000070c479ffc010 Total snapshots: 172. Utilization: 100% ╎161 @Base/client.jl:585 _start() ╎ 161 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 161 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ 161 @Base/Base.jl:325 (::Base.IncludeInto)(fname::String) ╎ 161 @Base/Base.jl:324 include(mapexpr::Function, mod::Module, _path::St… ╎ 161 @Base/loading.jl:3191 _include(mapexpr::Function, mod::Module, _pa… ╎ ╎ 161 @Base/loading.jl:3131 include_string(mapexpr::typeof(identity), m… ╎ ╎ 161 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ 161 @Base/Base.jl:325 (::Base.IncludeInto)(fname::String) ╎ ╎ 161 @Base/Base.jl:324 include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 161 @Base/loading.jl:3191 _include(mapexpr::Function, mod::Module… ╎ ╎ ╎ 161 @Base/loading.jl:3131 include_string(mapexpr::typeof(identit… ╎ ╎ ╎ 161 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ ╎ 161 @Boscia/…oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 161 @Boscia/…oracle.jl:834 #solve#146 ╎ ╎ ╎ 161 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Na… ╎ ╎ ╎ ╎ 161 @Boscia/…rface.jl:270 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 161 @Boscia/…onobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 161 @Boscia/…onobo.jl:36 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:333 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 1 @Boscia/…ties.jl:30 check_feasibility ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:474 check_feasibility(lmo::FrankWo… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…apper.jl:427 optimize!(o::SCIP.Optimizer) ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…apper.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ 1 @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 ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…cle.jl:234 is_linear_feasible(o::SCIP.Op… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:251 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:432 get(o::SCIP.Optimizer, ::Mat… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…pper.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ata.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:239 ht_keyindex(h::Dict{SCIP.V… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:707 isempty 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…le.jl:254 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…xt.jl:56 get_tol ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…pper.jl:224 get ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ata.jl:114 get_parameter(scipd::SCIP.S… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:17170 SCIPgetParam ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ata.jl:139 get_parameter(scipd::SCIP.S… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…per.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:17213 SCIPgetRealParam ╎ ╎ ╎ ╎ 157 @Boscia/…node.jl:361 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 157 @Boscia/…ants.jl:187 kwcall(::@NamedTuple{epsilon::… ╎ ╎ ╎ ╎ ╎ 157 @Boscia/…nts.jl:207 #solve_frank_wolfe#7 ╎ ╎ ╎ ╎ ╎ 157 @FrankWolfe/…jl:76 kwcall(::@NamedTuple{line_sear… 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:0 blended_pairwise_conditional_gr… ╎ ╎ ╎ ╎ ╎ 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 ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:32 compute_extreme_point(lmo::… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:238 ht_keyindex(h::Dict{SCIP.V… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:16 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…l:206 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:44 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @Base/…math.jl:38 - ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…math.jl:13 _broadcast_preserving_zero_d ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:3540 map ╎ ╎ ╎ ╎ ╎ ╎ 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:735 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:727 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:714 Array 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:654 GenericMemory ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 3 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, … 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1027 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:208 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:52 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:72 mul!(y::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:75 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:80 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:710 gemv!(y::Vector{Float6… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:678 gemv!(trans::Char, al… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:211 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:355 active_set_argminmax ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:361 active_set_argminmax(active… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:18 dot ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:406 dot 1╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:356 dot ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:214 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:18 dot ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:406 dot 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:356 dot ╎ ╎ ╎ ╎ ╎ 13 @FrankWolfe/…l:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…l:438 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 4 @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 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1027 getindex 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:492 + 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1053 dot(x::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:453 perform_line_search(line_sea… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:48 (::var"#grad!#build_examples… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:50 (::var"#grad!#build_examples… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:270 mul!(C::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:72 mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:75 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:80 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:710 gemv! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:678 gemv!(trans::Char, … ╎ ╎ ╎ ╎ ╎ 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 @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:699 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:668 _broadcast_get… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ls.jl:1027 getindex ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…l:467 perform_line_search(line_sea… 1╎ ╎ ╎ ╎ ╎ 6 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float64},… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ials.jl:0 getindex ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1048 dot(x::Vector{Float64},… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…oop.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 3 @LinearAlgebra/…:1049 macro expansion 3╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…at.jl:492 + 6╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…l:245 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 50 @FrankWolfe/…l:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 50 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 50 @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 1╎ ╎ ╎ ╎ ╎ ╎ 48 @Boscia/…s.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:478 getindex(h::Dict{Symbol, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:240 ht_keyindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…er.jl:58 getproperty ╎ ╎ ╎ ╎ ╎ ╎ 46 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 16 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 16 @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:735 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:727 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:714 Array 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:654 GenericMemory ╎ ╎ ╎ ╎ ╎ ╎ 15 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 15 @Base/…ay.jl:864 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 13 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 13 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 13 none:? #sol_values##0 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…IP.jl:20760 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 10 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 10 @SCIP/…ta.jl:181 var 5╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 10 @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:245 ht_keyindex(h::D… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…er.jl:58 getproperty ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:248 ht_keyindex(h::D… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:134 isslotempty ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:396 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:381 checkbounds ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:257 ht_keyindex(h::D… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1213 + ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:424 > 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:83 < ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:890 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:1020 setindex! 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:1025 _setindex! ╎ ╎ ╎ ╎ ╎ ╎ 29 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/….jl:44 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…th.jl:38 - ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…th.jl:13 _broadcast_preserving_ze… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…ay.jl:3540 map ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:828 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:45 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:415 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:425 _zip_iterate_all ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:435 _zip_iterate_some ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:433 _zip_iterate_some ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1241 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1241 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ay.jl:1249 _iterate_abst… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:1027 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 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:735 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:727 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:714 Array 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ot.jl:654 GenericMemory ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…ay.jl:864 collect_to_with_firs… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:45 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:416 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:425 _zip_iterate_all ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:433 _zip_iterate_so… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1241 iterate 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ay.jl:1248 _iterate_abst… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:890 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:1020 setindex! 2╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:1025 _setindex! 1╎ ╎ ╎ ╎ ╎ ╎ 24 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1045 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1026 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:381 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1027 getindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1047 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:963 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1026 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:385 checkbounds ╎ ╎ ╎ ╎ ╎ ╎ 20 @LinearAlgebra/…:1048 dot(x::Vector{Float… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:0 macro expansion 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 16 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 16 @LinearAlgebra/…:1049 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:963 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1027 getindex 4╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ls.jl:1027 getindex 11╎ ╎ ╎ ╎ ╎ ╎ ╎ 11 @Base/…at.jl:492 + 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:42 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:144 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Dates/…ns.jl:76 now() 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…bc.jl:188 TimeVal ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:266 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:184 active_set_update_pairwise!(… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:224 active_set_validate(active_… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ncs.jl:222 isapprox 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ncs.jl:226 #isapprox#714 ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…dim.jl:983 sum ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…dim.jl:983 #sum#733 ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:987 _sum ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:987 #_sum#735 ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:988 _sum ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:988 #_sum#736 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:330 mapreduce ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:330 #mapreduce#726 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:338 _mapreduce_dim ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ce.jl:446 _mapreduce ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ce.jl:275 mapreduce_impl ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ce.jl:261 mapreduce_impl(f:… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:0 macro expansion ╎ ╎ ╎ ╎ ╎ 64 @FrankWolfe/…l:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 64 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 54 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 54 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:29 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ble.jl:18 get(o::SCIP.Optimizer, ::M… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:1734 sort! ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:1741 #sort!#24 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:1594 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:561 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:686 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:747 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:802 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:731 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:780 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:1380 _sort!(v::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…rt.jl:1123 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1137 _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…rt.jl:1100 partition!(t:… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ay.jl:1020 setindex! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…ay.jl:1025 _setindex! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1165 _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…rt.jl:848 _sort!(v::Vect… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ay.jl:1020 setindex! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…ay.jl:1024 _setindex! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +5 1 @Base/…ls.jl:381 checkbounds ╎ ╎ ╎ ╎ ╎ ╎ 52 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 51 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 51 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 51 @SCIP/…er.jl:16 macro expansion 51╎ ╎ ╎ ╎ ╎ ╎ ╎ 51 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:364 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:897 materialize ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:922 copy ╎ ╎ ╎ ╎ ╎ ╎ ╎ 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:675 _broadcast_getind… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:702 _broadcast_getin… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ts.jl:91 get(o::SCIP.Opti… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…er.jl:111 unsafe_wrap 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…er.jl:113 #unsafe_wrap#59 ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…mo.jl:118 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…e.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 5 @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:1164 _sort!(v::Vec… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…ay.jl:2292 reverse!(v::V… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:249 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:47 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @MathOptInterface/…:115 throw_if_not_val… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:35 is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:505 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::Dict{… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…le.jl:579 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:45 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:75 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:63 hash_64_64 ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ng.jl:58 hash_finalizer 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/int.jl:88 * ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:250 is_linear_feasible_subrou… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @MathOptInterface/…:131 eval_variables(va… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:251 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:435 get(o::SCIP.Optimizer, :… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:478 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:251 ht_keyindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:254 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:56 get_tol ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:224 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:114 get_parameter(scipd::S… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:17170 SCIPgetParam ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…t.jl:49 free_model 5╎ ╎ ╎ ╎ ╎ ╎ 5 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:327 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:438 perform_line_search(line_sea… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:340 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:411 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…ks.jl:97 process_FW_callback_logic(t… 1╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @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 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 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:735 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:727 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:714 Array 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ot.jl:654 GenericMemory ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:864 collect_to_with_firs… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:886 collect_to! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:46 iterate ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:427 blended_pairwise_conditional_… 2╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 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 ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:118 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 1 @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:1164 _sort!(v::Vec… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…ay.jl:0 reverse!(v::Vect… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:49 free_model 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:21476 SCIPfreeTransform [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [inlined] start_task at /source/src/task.c:1275 unknown function (ip: (nil)) at (unknown file) Allocations: 19173356 (Pool: 19172636; Big: 720); GC: 16 [72] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/klQke/test/branching_strategy_test.jl:133 SCIPhashtableRetrieve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPgetParam at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:17170 [inlined] get_parameter at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/scip_data.jl:114 get at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:224 [inlined] get_tol at /home/pkgeval/.julia/packages/Boscia/klQke/ext/BosciaSCIPExt.jl:56 [inlined] is_linear_feasible_subroutine at /home/pkgeval/.julia/packages/Boscia/klQke/src/MOI_bounded_oracle.jl:254 _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/klQke/src/MOI_bounded_oracle.jl:234 is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/klQke/src/MOI_bounded_oracle.jl:229 [inlined] is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/klQke/src/problem.jl:94 [inlined] evaluate_node! at /home/pkgeval/.julia/packages/Boscia/klQke/src/node.jl:349 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/klQke/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/klQke/src/custom_bonobo.jl:29 unknown function (ip: 0x70c418092aba) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 #solve#109 at /home/pkgeval/.julia/packages/Boscia/klQke/src/interface.jl:270 unknown function (ip: 0x70c41808fd99) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 solve at /home/pkgeval/.julia/packages/Boscia/klQke/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/klQke/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/klQke/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x70c4180885cc) at (unknown file) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3131 _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 _include at ./loading.jl:3191 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3131 _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 _include at ./loading.jl:3191 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113 [inlined] ijl_apply_generic at /source/src/gf.c:4339 jl_apply at /source/src/julia.h:2300 [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: 0x70c494578249) 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: 5300750841 (Pool: 5300746922; Big: 3919); GC: 2611 PkgEval terminated after 2729.6s: test duration exceeded the time limit