Package evaluation to test Boscia on Julia 1.14.0-DEV.1840 (ab7ba34e40*) started at 2026-03-03T19:18:50.491 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 13.21s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.8 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.3 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.8 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.3 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.3.2 [f55ce6ea] + FrankWolfe v0.6.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.57s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 1924.5 ms ✓ Bonobo ERROR: LoadError: UndefVarError: `get_liblemoncxxwrap_path` not defined in `LEMON_jll` Suggestion: check for spelling errors or missing imports. Stacktrace:  [1] getproperty(x::Module, f::Symbol)  @ Base ./Base_compiler.jl:51  [2] top-level scope  @ ~/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:9  [3] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [4] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3288  [5] top-level scope  @ stdin:5  [6] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [7] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [8] include_string  @ ./loading.jl:3140 [inlined]  [9] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [10] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:1 in expression starting at stdin:5 ✗ LEMONGraphs 13151.9 ms ✓ Boscia ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14b1564f-c77f-4800-9e89-efd961faef7c"), "LEMONGraphs") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2840  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2694  [4] macro expansion  @ ./loading.jl:2621 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2585  [7] require  @ ./loading.jl:2561 [inlined]  [8] eval_import_path  @ ./module.jl:36 [inlined]  [9] _eval_import(imported::Bool, to::Module, from::Nothing, paths::Expr)  @ Base ./module.jl:111  [10] top-level scope  @ ~/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:10  [11] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [12] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3288  [13] top-level scope  @ stdin:5  [14] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [15] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [16] include_string  @ ./loading.jl:3140 [inlined]  [17] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [18] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:1 in expression starting at stdin:5 ✗ GraphsMatching 11047.4 ms ✓ Boscia → BosciaHiGHSExt 16949.1 ms ✓ Boscia → BosciaSCIPExt ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("c3af3a8c-b79e-4b01-bf44-c718d7e0e0d6"), "GraphsMatching") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2840  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2694  [4] macro expansion  @ ./loading.jl:2621 [inlined]  [5] macro expansion  @ ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2585  [7] require  @ ./loading.jl:2561 [inlined]  [8] eval_import_path  @ ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using  @ ./module.jl:137 [inlined]  [11] _eval_using(to::Module, path::Expr)  @ Base ./module.jl:137  [12] top-level scope  @ ~/.julia/packages/CombinatorialLinearOracles/2KdaS/src/CombinatorialLinearOracles.jl:6  [13] include(mod::Module, _path::String)  @ Base ./Base.jl:323  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3288  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3130  [18] include_string  @ ./loading.jl:3140 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:342  [20] _start()  @ Base ./client.jl:585 in expression starting at /home/pkgeval/.julia/packages/CombinatorialLinearOracles/2KdaS/src/CombinatorialLinearOracles.jl:1 in expression starting at stdin:5 ✗ CombinatorialLinearOracles 4 dependencies successfully precompiled in 85 seconds. 176 already precompiled. Precompilation completed after 114.03s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_BmkMiD/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.8 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.4 [31c24e10] Distributions v0.25.123 [497a8b3b] DoubleFloats v1.5.7 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.21.1 [b8f27783] MathOptInterface v1.49.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_BmkMiD/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.3 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.8 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.4 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.3 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.123 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.5.7 [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.21.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [4076af6c] JuMP v1.29.4 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.2 [b8f27783] MathOptInterface v1.49.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.1 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.9 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.17 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.6.3 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.13.1+0 [e33a78d0] Hwloc_jll v2.13.0+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.9+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.18.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.30+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.5+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0xc2512fb93028a432 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##0", var"#grad!#grad!##0", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##1", var"#grad!#grad!##1", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##2", var"#grad!#grad!##2", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##8", var"#grad!#grad!##4", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##11"{Float64}, var"#grad!#grad!##5"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##14", var"#grad!#grad!##6", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = OPT_TREE_EMPTY Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = OPT_TREE_EMPTY LMO Tests seed = 0xd34df04bb9ab28a6 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##34", var"#grad!#grad!##14", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##40", var"#grad!#grad!##16", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##46", var"#grad!#grad!##18", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##49", var"#grad!#grad!##19", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ReverseKnapsackLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0xe26b818699f012b5 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##55", var"#grad!#grad!##21", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##58", var"#grad!#grad!##22", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##61", var"#grad!#grad!##23", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Sparse Regression Tests seed = 0x4e9ea907f1f6afca 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.040888e+00 2.195985e+00 1.550966e-01 7.599464e-02 2.349800e+01 1.276704e-01 9656 49 16 18 8 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##70", var"#grad!#grad!##26", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 29 8 2.177420e+00 2.195985e+00 1.856498e-02 8.526138e-03 2.796000e+01 1.323319e+00 6 3 151 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 6.650782e+00 -8.195535e-01 7.470335e+00 0.000000e+00 Inf 1 LD 2 2.195985e+00 2.195985e+00 0.000000e+00 2.266772e+00 8.823118e-01 1 Last 2 2.195985e+00 2.195985e+00 0.000000e+00 2.413294e+00 8.287429e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.195985e+00 2.195985e+00 0.000000e+00 2.416360e+00 8.276913e-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.195984900041309 Dual Bound: 2.1774199172915942 Dual Gap (relative): 0.008526138023393855 Search Statistics. Total number of nodes processed: 37 Total number of lmo calls: 156 Total time (s): 32.862 LMO calls / sec: 4.747124338141318 Nodes / sec: 1.1259205160976202 LMO calls / node: 4.216216216216216 Total number of global tightenings: 39 Global tightenings / node: 1.34 Total number of local tightenings: 50 Local tightenings / node: 1.72 Total number of potential local tightenings: 50 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.559654e+00 2.515725e+00 9.560707e-01 6.130017e-01 1.878800e+01 1.596764e-01 8936 171 37 80 24 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##71", var"#grad!#grad!##27", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 100 51 2.139756e+00 2.515725e+00 3.759694e-01 1.757067e-01 2.426400e+01 6.223211e+00 21 14 1068 15 14 1 200 51 2.222895e+00 2.515725e+00 2.928299e-01 1.317335e-01 2.617100e+01 9.590768e+00 26 17 1483 28 14 0 300 51 2.279437e+00 2.515725e+00 2.362880e-01 1.036607e-01 2.812200e+01 1.248133e+01 21 13 1914 18 8 0 400 51 2.321080e+00 2.515725e+00 1.946454e-01 8.385985e-02 3.017100e+01 1.494813e+01 26 16 2381 29 15 1 500 51 2.363084e+00 2.515725e+00 1.526409e-01 6.459392e-02 3.206900e+01 1.718170e+01 18 12 2834 16 6 0 600 51 2.403881e+00 2.515725e+00 1.118437e-01 4.652629e-02 3.400600e+01 1.914368e+01 29 18 3310 31 14 3 700 51 2.442391e+00 2.515725e+00 7.333393e-02 3.002546e-02 3.617500e+01 2.076019e+01 16 10 3796 9 4 0 800 39 2.486120e+00 2.515725e+00 2.960506e-02 1.190814e-02 3.824700e+01 2.193636e+01 27 17 4303 25 8 0 817 38 2.490946e+00 2.515725e+00 2.477889e-02 9.947581e-03 3.856400e+01 2.217094e+01 5 3 4386 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 6.860606e+00 4.049761e-01 6.455630e+00 0.000000e+00 Inf 1 LD 2 2.515725e+00 2.515725e+00 0.000000e+00 1.329664e-01 1.504140e+01 1 Last 2 2.515725e+00 2.515725e+00 0.000000e+00 2.786984e-01 7.176217e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.515725e+00 2.515725e+00 0.000000e+00 2.820730e-01 7.090362e+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: 2.515725007420711 Dual Bound: 2.4909461191052027 Dual Gap (relative): 0.0099475810116717 Search Statistics. Total number of nodes processed: 855 Total number of lmo calls: 4391 Total time (s): 41.285 LMO calls / sec: 106.35824149206735 Nodes / sec: 20.70970085987647 LMO calls / node: 5.135672514619883 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: 6 Non zero entries: 25th entry: 0.16370058464579917 29th entry: 0.16370058464579917 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.676591e+00 2.515725e+00 8.391338e-01 5.005000e-01 2.200000e-01 1.363636e+01 214 160 37 80 24 1 100 24 2.245824e+00 2.515725e+00 2.699011e-01 1.201791e-01 5.620000e+00 2.206406e+01 22 15 1118 21 12 0 200 25 2.356328e+00 2.515725e+00 1.593969e-01 6.764630e-02 8.544000e+00 2.633427e+01 23 15 1804 28 12 0 300 25 2.447596e+00 2.515725e+00 6.812910e-02 2.783511e-02 1.175900e+01 2.763840e+01 24 16 2530 24 10 0 356 21 2.491660e+00 2.515725e+00 2.406543e-02 9.658395e-03 1.371800e+01 2.748214e+01 28 18 2975 32 14 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.860606e+00 4.049761e-01 6.455630e+00 0.000000e+00 Inf 1 LD 2 2.515725e+00 2.515725e+00 0.000000e+00 1.065260e-03 1.877476e+03 1 Last 2 2.515725e+00 2.515725e+00 0.000000e+00 6.393171e-03 3.128338e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.515725e+00 2.515725e+00 0.000000e+00 9.030817e-03 2.214639e+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: 2.515725007420711 Dual Bound: 2.4916595743814653 Dual Gap (relative): 0.009658395266624506 Search Statistics. Total number of nodes processed: 377 Total number of lmo calls: 2980 Total time (s): 13.737 LMO calls / sec: 216.93237242483804 Nodes / sec: 27.444128994685883 LMO calls / node: 7.904509283819628 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: 2 Poisson Tests seed = 0xba93a0fa4057dfc7 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.565635e+02 -1.425705e+02 1.399302e+01 9.814806e-02 2.038100e+01 1.471959e-01 10379 100 39 787 25 1 * 2 3 -1.565635e+02 -1.425827e+02 1.398078e+01 9.805383e-02 2.090500e+01 2.391772e-01 519 76 68 298 24 8 * 22 23 -1.562426e+02 -1.428018e+02 1.344086e+01 9.412248e-02 7.368300e+01 6.107243e-01 1825 92 785 1378 32 15 * 29 20 -1.561748e+02 -1.556496e+02 5.252014e-01 3.374256e-03 9.166600e+01 6.218227e-01 642 49 1025 464 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.463497e+02 -3.723096e+02 7.186593e+02 0.000000e+00 Inf 1 LD 2 -1.537451e+02 -1.687265e+02 1.498142e+01 1.871586e-01 1.068612e+01 2 LD 18 -1.546670e+02 -1.613405e+02 6.673423e+00 4.608217e-01 3.906066e+01 3 LD 130 -1.556306e+02 -1.572304e+02 1.599790e+00 6.872772e-01 1.891522e+02 5 LD 141 -1.556451e+02 -1.562609e+02 6.158791e-01 7.073238e-01 1.993429e+02 7 LD 154 -1.556481e+02 -1.559465e+02 2.984434e-01 7.269134e-01 2.118547e+02 8 LD 176 -1.556493e+02 -1.557905e+02 1.412460e-01 7.575221e-01 2.323364e+02 10 LD 193 -1.556495e+02 -1.556798e+02 3.028853e-02 7.792592e-01 2.476711e+02 11 LD 217 -1.556496e+02 -1.556621e+02 1.251288e-02 8.076157e-01 2.686922e+02 12 LD 243 -1.556496e+02 -1.556526e+02 3.087443e-03 8.386547e-01 2.897498e+02 14 LD 266 -1.556496e+02 -1.556506e+02 1.056876e-03 8.588382e-01 3.097207e+02 14 LD 286 -1.556496e+02 -1.556501e+02 5.112701e-04 8.838016e-01 3.236021e+02 15 LD 307 -1.556496e+02 -1.556498e+02 2.269245e-04 9.049853e-01 3.392320e+02 15 LD 334 -1.556496e+02 -1.556496e+02 8.201226e-05 9.331562e-01 3.579251e+02 16 LD 369 -1.556496e+02 -1.556496e+02 2.792423e-05 9.640909e-01 3.827440e+02 16 LD 392 -1.556496e+02 -1.556496e+02 1.152765e-05 9.885693e-01 3.965326e+02 17 P 1000 -1.556496e+02 -1.556496e+02 1.152765e-05 1.613258e+00 6.198638e+02 17 P 2000 -1.556496e+02 -1.556496e+02 1.152765e-05 2.504553e+00 7.985458e+02 17 P 3000 -1.556496e+02 -1.556496e+02 1.152765e-05 3.259774e+00 9.203092e+02 17 P 4000 -1.556496e+02 -1.556496e+02 1.152765e-05 3.971883e+00 1.007079e+03 17 P 5000 -1.556496e+02 -1.556496e+02 1.152765e-05 4.666343e+00 1.071503e+03 17 P 6000 -1.556496e+02 -1.556496e+02 1.152765e-05 5.347749e+00 1.121967e+03 17 P 7000 -1.556496e+02 -1.556496e+02 1.152765e-05 6.038138e+00 1.159298e+03 17 P 8000 -1.556496e+02 -1.556496e+02 1.152765e-05 6.747592e+00 1.185608e+03 17 P 9000 -1.556496e+02 -1.556496e+02 1.152765e-05 7.463194e+00 1.205918e+03 17 P 10000 -1.556496e+02 -1.556496e+02 1.152765e-05 8.147523e+00 1.227367e+03 17 Last 10001 -1.556496e+02 -1.556496e+02 1.152765e-05 8.152612e+00 1.226723e+03 17 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.556496e+02 -1.556496e+02 1.599764e-05 8.156048e+00 1.226207e+03 17 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -155.64955781722074 Dual Bound: -156.17475917087802 Dual Gap (relative): 0.003374255353002829 Search Statistics. Total number of nodes processed: 57 Total number of lmo calls: 1060 Total time (s): 102.552 LMO calls / sec: 10.336219673921523 Nodes / sec: 0.5558155862391762 LMO calls / node: 18.596491228070175 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.538656e+02 -1.477575e+02 6.108056e+00 4.133838e-02 2.568200e+01 1.168133e-01 10378 157 31 135 16 2 * 3 4 -1.534686e+02 -1.486928e+02 4.775767e+00 3.211834e-02 2.757000e+01 2.538992e-01 213 79 70 88 10 4 * 5 6 -1.528814e+02 -1.492052e+02 3.676176e+00 2.463839e-02 2.973600e+01 3.699220e-01 236 98 117 109 13 2 * 10 11 -1.526147e+02 -1.492863e+02 3.328384e+00 2.229531e-02 3.467500e+01 6.056236e-01 192 87 229 73 11 5 55 54 -1.507387e+02 -1.492863e+02 1.452427e+00 9.729136e-03 6.984400e+01 1.560621e+00 119 57 1011 52 7 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.886800e+01 -1.723557e+02 9.348774e+01 0.000000e+00 Inf 1 LD 2 -1.492863e+02 -1.492863e+02 0.000000e+00 1.658618e-01 1.205823e+01 1 Last 2 -1.492863e+02 -1.492863e+02 0.000000e+00 3.378334e-01 5.920078e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.492863e+02 -1.492863e+02 0.000000e+00 3.417736e-01 5.851826e+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: -149.28630212418173 Dual Bound: -150.73872886541983 Dual Gap (relative): 0.009729136033056257 Search Statistics. Total number of nodes processed: 109 Total number of lmo calls: 1016 Total time (s): 72.665 LMO calls / sec: 13.98197206357944 Nodes / sec: 1.5000344044588176 LMO calls / node: 9.321100917431192 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.657988e+02 3.375361e+02 1.717372e+02 1.035817e+00 2.001100e+01 1.499175e-01 9390 115 25 83 13 1 * 2 3 1.657988e+02 3.360001e+02 1.702012e+02 1.026553e+00 2.015600e+01 2.480651e-01 142 78 42 39 11 2 * 3 4 1.825393e+02 3.331911e+02 1.506518e+02 8.253116e-01 2.030400e+01 3.447597e-01 142 77 59 44 11 0 * 5 6 1.828572e+02 3.295192e+02 1.466620e+02 8.020574e-01 2.067400e+01 5.320693e-01 203 78 93 57 11 1 * 7 8 2.002121e+02 3.284721e+02 1.282600e+02 6.406208e-01 2.097300e+01 7.152053e-01 138 74 128 45 9 0 * 56 57 2.512291e+02 3.281111e+02 7.688200e+01 3.060235e-01 2.772900e+01 4.075156e+00 102 54 880 32 6 0 100 99 2.672271e+02 3.281111e+02 6.088396e+01 2.278360e-01 3.312800e+01 6.007003e+00 60 33 1473 17 4 0 200 187 2.869150e+02 3.281111e+02 4.119612e+01 1.435830e-01 4.747100e+01 8.152346e+00 60 31 2601 21 5 1 300 219 3.012023e+02 3.281111e+02 2.690879e+01 8.933794e-02 5.306500e+01 9.780458e+00 51 20 3378 19 2 1 400 205 3.106735e+02 3.281111e+02 1.743761e+01 5.612842e-02 5.625600e+01 1.075441e+01 43 31 3866 6 3 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##78"{Float64}, var"#grad!#grad!##30"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 * 450 175 3.135289e+02 3.279990e+02 1.447013e+01 4.615245e-02 5.744600e+01 1.087978e+01 14 7 4035 2 0 0 500 137 3.174127e+02 3.279990e+02 1.058626e+01 3.335172e-02 5.833800e+01 1.091913e+01 20 10 4198 6 0 0 600 57 3.234490e+02 3.279990e+02 4.550022e+00 1.406720e-02 6.027200e+01 1.090058e+01 33 19 4521 8 0 0 615 42 3.253071e+02 3.279990e+02 2.691886e+00 8.274906e-03 6.051300e+01 1.085717e+01 18 10 4565 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.284718e+02 3.231336e+02 5.338168e+00 0.000000e+00 Inf 1 LD 2 3.279990e+02 3.279990e+02 4.074070e-07 1.651525e-01 1.211002e+01 2 Last 2 3.279990e+02 3.279990e+02 4.074070e-07 3.354774e-01 5.961653e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.279990e+02 3.279990e+02 4.074070e-07 3.389789e-01 5.900072e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 327.99900792655893 Dual Bound: 325.30712200528285 Dual Gap (relative): 0.008274906201507531 Search Statistics. Total number of nodes processed: 657 Total number of lmo calls: 4570 Total time (s): 63.59 LMO calls / sec: 71.86664569900927 Nodes / sec: 10.331813178172668 LMO calls / node: 6.9558599695586 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.657988e+02 3.375361e+02 1.717372e+02 1.035817e+00 2.491700e+01 1.203997e-01 10330 127 25 83 13 1 * 2 3 1.657988e+02 3.284718e+02 1.626730e+02 9.811467e-01 2.599300e+01 1.923595e-01 138 69 39 40 12 1 * 53 54 2.474359e+02 3.281111e+02 8.067515e+01 3.260446e-01 6.689100e+01 1.599617e+00 74 39 795 26 7 0 100 93 2.650398e+02 3.281111e+02 6.307132e+01 2.379693e-01 9.556000e+01 2.019674e+00 103 44 1387 45 7 1 200 167 2.881618e+02 3.281111e+02 3.994925e+01 1.386348e-01 1.422420e+02 2.580110e+00 33 20 2339 6 3 0 300 203 3.004096e+02 3.281111e+02 2.770149e+01 9.221241e-02 1.731000e+02 2.905835e+00 51 24 2965 20 5 2 400 187 3.108350e+02 3.281111e+02 1.727608e+01 5.557959e-02 1.913310e+02 3.067982e+00 5 3 3408 0 0 0 * 425 174 3.132409e+02 3.279990e+02 1.475815e+01 4.711437e-02 1.941470e+02 3.085291e+00 13 7 3501 2 0 0 500 117 3.166886e+02 3.279990e+02 1.131043e+01 3.571468e-02 1.984340e+02 3.109346e+00 5 3 3709 0 0 0 591 38 3.251198e+02 3.279990e+02 2.879214e+00 8.855856e-03 2.017950e+02 3.117025e+00 6 3 3944 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 3.284718e+02 3.231336e+02 5.338168e+00 0.000000e+00 Inf 1 LD 2 3.279990e+02 3.279990e+02 4.074070e-07 1.619024e-01 1.235312e+01 2 Last 2 3.279990e+02 3.279990e+02 4.074070e-07 3.219839e-01 6.211491e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.279990e+02 3.279990e+02 4.074070e-07 3.251620e-01 6.150780e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 327.99900792655893 Dual Bound: 325.1197938460644 Dual Gap (relative): 0.008855856010593334 Search Statistics. Total number of nodes processed: 629 Total number of lmo calls: 3949 Total time (s): 204.757 LMO calls / sec: 19.28627592707453 Nodes / sec: 3.071934048652793 LMO calls / node: 6.278219395866454 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 = 0x79ccd0ea47277449 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.960514e+01 4.211955e+01 6.172470e+01 Inf 2.322500e+01 1.291712e-01 11152 116 51 10001 22 19 * 2 3 -1.960514e+01 4.022691e+01 5.983206e+01 Inf 2.364800e+01 2.114344e-01 420 43 74 10001 24 25 100 79 2.522976e+01 4.022691e+01 1.499715e+01 5.944232e-01 4.358400e+01 4.107012e+00 191 68 2728 3019 21 23 194 69 3.395388e+01 4.022691e+01 6.273029e+00 1.847514e-01 6.000200e+01 4.383187e+00 101 31 5178 1824 11 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 40.22691357191348 Dual Bound: 33.95388479389253 Dual Gap (relative): 0.18475143024427398 Search Statistics. Total number of nodes processed: 263 Total number of lmo calls: 5178 Total time (s): 61.066 LMO calls / sec: 84.79350211246847 Nodes / sec: 4.306815576589264 LMO calls / node: 19.688212927756656 Total number of global tightenings: 13 Global tightenings / node: 0.07 Total number of local tightenings: 836 Local tightenings / node: 4.31 Total number of potential local tightenings: 1086 Time Limit Test seed = 0x7d454a9a6b5d31c8 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.240335e+01 0.000000e+00 1.240335e+01 Inf 2.285100e+01 1.312853e-01 12327 1860 31 9891 10 11 WARNING: Dual bound -10.6716 is larger than the objective of the primal solution -10.6716. The solution might not be optimal. * 4 5 -1.231617e+01 -1.138919e+01 9.269804e-01 8.139123e-02 2.844700e+01 3.163778e-01 1802 1572 113 10001 9 39 * 5 6 -1.225955e+01 -1.141785e+01 8.416951e-01 7.371746e-02 3.047900e+01 3.609042e-01 2030 1853 148 7611 9 16 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -11.417853525821883 Dual Bound: -12.259548661732383 Dual Gap (relative): 0.07371745783977493 Search Statistics. Total number of nodes processed: 11 Total number of lmo calls: 148 Total time (s): 31.615 LMO calls / sec: 4.6813221572038595 Nodes / sec: 0.3479361062786652 LMO calls / node: 13.454545454545455 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 4 Local tightenings / node: 0.8 Total number of potential local tightenings: 31 Strong Convexity and Sharpness Tests seed = 0xaa272eeda6942f29 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ 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"#51#52"{Vector{Float64}}, var"#53#54"{Vector{Float64}}, Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ProbabilitySimplexLMO}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 * 1 0 2.174282e+02 2.174282e+02 0.000000e+00 0.000000e+00 1.783200e+01 5.607896e-02 7398 0 4 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 217.4281737990116 Dual Bound: 217.4281737990116 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 4 Total time (s): 18.932 LMO calls / sec: 0.21128248468201988 Nodes / sec: 0.05282062117050497 LMO calls / node: 4.0 Total number of global tightenings: 10 Global tightenings / node: 10.0 Total number of local tightenings: 10 Local tightenings / node: 10.0 Total number of potential local tightenings: 20 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.712392e+02 1.714507e+02 2.115355e-01 1.235322e-03 1.835400e+01 1.634521e-01 7550 0 8 6 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 171.4507060141052 Dual Bound: 171.23917053911342 Dual Gap (relative): 0.0012353217685288518 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 8 Total time (s): 19.566 LMO calls / sec: 0.40887253398752943 Nodes / sec: 0.15332720024532354 LMO calls / node: 2.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 Branching Strategy Tests seed = 0xbe2bfc935c906d9a 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.106300e+01 1.424299e-01 10611 122 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.249500e+01 2.889531e+00 10 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.722 LMO calls / sec: 40.17367844195262 Nodes / sec: 2.740072506534019 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 4.000000e-01 7.500000e+00 259 76 48 3749 24 11 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}})(tree::BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#build_examples##0"{Vector{Float64}}, var"#grad!#build_examples##1"{Vector{Float64}}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Core ~/.julia/packages/Boscia/vpy1o/src/callbacks.jl:252 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.845000e+00 4.715447e+01 4 2 1015 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.382204160353686 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.846 LMO calls / sec: 549.8374864572047 Nodes / sec: 47.12892741061755 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.760000e-01 7.978723e+00 224 40 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.586000e+00 3.720050e+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.588 LMO calls / sec: 540.9319899244332 Nodes / sec: 37.1536523929471 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.850000e-01 7.792208e+00 224 39 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.747000e+00 4.293074e+01 12 7 902 27 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.748 LMO calls / sec: 516.0183066361556 Nodes / sec: 42.90617848970252 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.420000e-01 8.771930e+00 225 38 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.966000e+00 4.933876e+01 3 2 1174 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.325011777780223 Dual Gap (relative): 0.007807821244322148 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1174 Total time (s): 1.967 LMO calls / sec: 596.8479918657854 Nodes / sec: 49.31367564819522 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.460000e-01 6.726457e+00 443 59 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.790000e-01 1.155327e+01 116 32 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.060000e-01 1.214128e+01 125 38 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.291000e+00 2.424316e+01 84 31 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.839000e+00 2.455029e+01 66 22 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.442300e+01 2.780281e+01 45 20 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.009800e+01 2.970445e+01 51 20 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.513500e+01 3.154963e+01 33 15 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.820400e+01 3.428592e+01 12 7 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.285500e+01 3.466748e+01 57 22 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.695700e+01 3.444544e+01 14 8 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.046000e+01 3.383589e+01 8 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.308700e+01 3.307262e+01 9 5 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.497700e+01 3.270561e+01 29 12 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.680300e+01 3.194240e+01 9 5 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.822800e+01 3.133035e+01 11 7 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 4.950100e+01 3.064585e+01 13 7 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.060900e+01 3.009346e+01 10 6 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.113100e+01 2.978624e+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): 51.132 LMO calls / sec: 538.3126026754284 Nodes / sec: 29.785652820151764 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 1.997000e+00 1.502253e+00 468 60 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.264000e+00 3.975265e+00 82 32 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.393000e+00 4.596740e+00 127 40 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.598000e+00 2.094186e+01 83 31 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.019500e+01 2.128494e+01 62 21 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.642000e+01 2.417783e+01 85 26 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.123500e+01 2.641865e+01 43 19 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.567700e+01 2.776804e+01 24 13 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 2.931700e+01 2.895931e+01 44 19 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.299600e+01 2.991272e+01 22 12 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.600300e+01 3.069189e+01 9 5 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 3.915100e+01 3.118694e+01 7 4 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.184600e+01 3.142475e+01 8 5 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.419400e+01 3.174639e+01 12 7 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.610400e+01 3.168922e+01 8 5 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.794700e+01 3.168081e+01 7 5 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 4.934900e+01 3.195607e+01 11 6 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.072700e+01 3.195537e+01 12 7 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.202400e+01 3.188913e+01 12 7 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.305900e+01 3.164402e+01 6 4 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.320300e+01 3.155837e+01 15 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): 53.204 LMO calls / sec: 502.593789940606 Nodes / sec: 31.557777610705962 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.380000e-01 5.576208e+00 472 62 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.324000e+00 9.818731e+00 92 28 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.096000e+00 2.116142e+01 63 24 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 8.553000e+00 2.350053e+01 62 23 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.584300e+01 2.531086e+01 78 33 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.158200e+01 2.756927e+01 47 24 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.632700e+01 2.905762e+01 17 11 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.081700e+01 3.021060e+01 67 28 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.505100e+01 3.084077e+01 52 18 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 3.870100e+01 3.123950e+01 44 20 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.227100e+01 3.158194e+01 7 4 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.523100e+01 3.194712e+01 50 22 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 4.824800e+01 3.189770e+01 36 19 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.098700e+01 3.191009e+01 7 4 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.294600e+01 3.186265e+01 11 7 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.444700e+01 3.215971e+01 22 10 26657 170 21 7 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.564300e+01 3.225922e+01 5 3 27751 16 0 0 1500 329 2.665304e+01 2.836265e+01 1.709610e+00 6.414315e-02 5.660000e+01 3.231449e+01 5 3 28707 8 0 0 1600 253 2.705726e+01 2.836265e+01 1.305388e+00 4.824539e-02 5.740500e+01 3.227942e+01 2 1 29538 6 0 0 1700 167 2.749886e+01 2.836265e+01 8.637814e-01 3.141153e-02 5.814200e+01 3.211104e+01 2 1 30350 3 0 0 1800 75 2.797765e+01 2.836265e+01 3.849984e-01 1.376093e-02 5.878300e+01 3.189698e+01 3 2 31067 6 0 0 1821 54 2.809262e+01 2.836265e+01 2.700204e-01 9.611791e-03 5.893000e+01 3.181741e+01 6 4 31241 16 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.09262459123141 Dual Gap (relative): 0.009611790927425446 Search Statistics. Total number of nodes processed: 1875 Total number of lmo calls: 31241 Total time (s): 58.931 LMO calls / sec: 530.1284553121448 Nodes / sec: 31.816870577454992 LMO calls / node: 16.66186666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2696 Local tightenings / node: 1.48 Total number of potential local tightenings: 6228 Number of alternative decisions: 543 Number of stable decisions: 394 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 3.360000e-01 8.928571e+00 290 43 64 4885 42 8 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 1.517000e+00 2.702703e+01 54 20 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 1.974000e+00 3.191489e+01 35 17 968 257 18 16 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 4.795000e+00 4.191867e+01 9 4 2918 60 18 11 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 7.706000e+00 4.970153e+01 20 9 5197 153 24 5 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.042400e+01 5.439371e+01 14 8 7469 83 12 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 1.401600e+01 5.244007e+01 25 11 9610 131 23 5 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 1.870900e+01 4.880004e+01 50 22 11880 193 16 11 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.281900e+01 4.693457e+01 28 14 13971 113 13 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 2.660300e+01 4.597226e+01 21 12 15981 55 10 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 2.975300e+01 4.547441e+01 38 20 17719 139 18 4 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 3.314200e+01 4.444511e+01 15 9 19510 37 0 0 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 3.637300e+01 4.390619e+01 57 19 21254 396 22 10 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 3.857700e+01 4.393810e+01 11 6 22747 24 0 0 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.063900e+01 4.352961e+01 5 3 24101 6 0 0 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 4.247200e+01 4.306367e+01 13 8 25317 23 0 0 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 4.402100e+01 4.236614e+01 7 4 26374 10 0 0 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 4.549100e+01 4.161263e+01 10 6 27346 16 0 0 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 4.673900e+01 4.080104e+01 18 9 28188 61 8 5 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 4.799200e+01 4.002750e+01 6 3 29039 10 0 0 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 4.901100e+01 3.935851e+01 7 4 29805 14 0 0 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 4.963700e+01 3.890243e+01 5 3 30260 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.106101931570876 Dual Gap (relative): 0.009127665389483692 Search Statistics. Total number of nodes processed: 1931 Total number of lmo calls: 30260 Total time (s): 49.638 LMO calls / sec: 609.6136024819695 Nodes / sec: 38.90164793102059 LMO calls / node: 15.67063697566028 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1888 Local tightenings / node: 1.01 Total number of potential local tightenings: 4439 Number of alternative decisions: 331 Number of stable decisions: 634 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.720000e-01 6.355932e+00 468 62 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.840000e-01 1.147959e+01 97 34 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.280000e-01 1.185345e+01 141 39 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.593000e+00 2.339113e+01 86 33 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.136000e+00 2.375219e+01 58 20 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.471000e+01 2.726037e+01 53 24 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.017700e+01 2.958814e+01 49 18 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.549900e+01 3.109926e+01 50 21 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.030700e+01 3.190682e+01 16 9 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.540700e+01 3.216878e+01 56 22 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.950300e+01 3.222540e+01 12 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.286500e+01 3.193748e+01 6 4 20396 14 0 0 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.550200e+01 3.136126e+01 60 23 21910 381 13 9 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 4.776800e+01 3.079467e+01 10 7 23162 19 0 0 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 4.974800e+01 3.013186e+01 30 14 24363 145 16 10 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 5.114800e+01 2.961993e+01 10 6 25359 25 0 0 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 5.247300e+01 2.910068e+01 35 15 26283 172 13 8 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.362800e+01 2.858581e+01 16 9 27090 27 0 0 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.433600e+01 2.825015e+01 5 4 27580 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1535 Total number of lmo calls: 27580 Total time (s): 54.337 LMO calls / sec: 507.5731085632258 Nodes / sec: 28.24962732576329 LMO calls / node: 17.96742671009772 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2409 Local tightenings / node: 1.64 Total number of potential local tightenings: 5193 Number of alternative decisions: 718 Number of stable decisions: 49 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.600000e-01 6.521739e+00 457 64 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.640000e-01 1.178010e+01 90 36 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.040000e-01 1.216814e+01 137 44 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.369000e+00 2.401721e+01 74 29 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.834000e+00 2.456418e+01 42 16 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.266400e+01 3.166456e+01 34 16 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.840000e+01 3.244565e+01 49 19 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.456100e+01 3.228696e+01 55 25 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.965100e+01 3.261273e+01 21 11 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.494100e+01 3.259781e+01 62 26 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.938900e+01 3.231867e+01 14 8 18546 31 0 0 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 39 running 1 of 1 signal (10): User defined signal 1 unknown function (ip: 0x7627e7e7560d) 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/vpy1o/src/time_tracking_lmo.jl:116 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/time_tracking_lmo.jl:108 [inlined] #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:291 unknown function (ip: 0x76277383a275) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/frank_wolfe_variants.jl:207 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/frank_wolfe_variants.jl:187 unknown function (ip: 0x762773826cf7) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/node.jl:361 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/custom_bonobo.jl:29 unknown function (ip: 0x7627738024da) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 #solve#109 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/interface.jl:270 unknown function (ip: 0x7627737ff7b9) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 solve at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7627739f31ac) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7627e7e05249) 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 ============================================================== 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.370800e+01 3.132150e+01 8 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.641200e+01 3.070327e+01 8 5 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.132700e+01 2.865938e+01 17 7 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.261100e+01 2.841611e+01 6 4 24396 13 0 0 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] start_task at /source/src/task.c:1275 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007cac84251870 Total snapshots: 568. Utilization: 0% ╎568 @Base/task.jl:1168 wait_forever() 567╎ 568 @Base/task.jl:1246 wait() ┌ 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 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.724900e+01 2.639347e+01 11 7 25388 20 0 0 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007627cd7fc010 Total snapshots: 122. Utilization: 100% ╎110 @Base/client.jl:585 _start() ╎ 110 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 110 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ 110 @Base/Base.jl:325 (::Base.IncludeInto)(fname::String) ╎ 110 @Base/Base.jl:324 include(mapexpr::Function, mod::Module, _path::St… ╎ 110 @Base/loading.jl:3190 _include(mapexpr::Function, mod::Module, _pa… ╎ ╎ 110 @Base/loading.jl:3130 include_string(mapexpr::typeof(identity), m… ╎ ╎ 110 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ 110 @Base/Base.jl:325 (::Base.IncludeInto)(fname::String) ╎ ╎ 110 @Base/Base.jl:324 include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 110 @Base/loading.jl:3190 _include(mapexpr::Function, mod::Module… ╎ ╎ ╎ 110 @Base/loading.jl:3130 include_string(mapexpr::typeof(identit… ╎ ╎ ╎ 110 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ ╎ 110 @Boscia/…oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 110 @Boscia/…oracle.jl:834 #solve#146 ╎ ╎ ╎ 110 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Na… ╎ ╎ ╎ ╎ 110 @Boscia/…rface.jl:270 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 110 @Boscia/…onobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 109 @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 1╎ ╎ ╎ ╎ 106 @Boscia/…node.jl:361 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 105 @Boscia/…ants.jl:187 kwcall(::@NamedTuple{epsilon::… ╎ ╎ ╎ ╎ ╎ 105 @Boscia/…nts.jl:207 #solve_frank_wolfe#7 ╎ ╎ ╎ ╎ ╎ 105 @FrankWolfe/…jl:76 kwcall(::@NamedTuple{line_sear… ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:110 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 ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 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 ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:206 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:208 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 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, a… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:211 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:355 active_set_argminmax ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:361 active_set_argminmax(active… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:18 dot ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:406 dot 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:356 dot ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…l:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:438 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:453 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:50 (::var"#grad!#build_examples… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:270 mul!(C::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:72 mul! ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:75 _mul! 1╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:80 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:710 gemv! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:678 gemv!(trans::Char, … ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:52 (::var"#grad!#build_examples… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:72 mul!(y::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:75 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:80 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:710 gemv!(y::Vector{Float… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:678 gemv!(trans::Char, a… 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:245 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 42 @FrankWolfe/…l:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 42 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 42 @Boscia/…ks.jl:59 process_FW_callback_logic 1╎ ╎ ╎ ╎ ╎ ╎ 40 @Boscia/…s.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 39 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 14 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 14 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:828 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:? #sol_values##0 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:20760 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ 13 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 12 @Base/…ay.jl:864 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 12 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:45 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1241 iterate 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1248 _iterate_abstracta… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 11 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 11 none:? #sol_values##0 5╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @SCIP/…IP.jl:20760 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…ta.jl:181 var 4╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…ct.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::D… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ng.jl:46 hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:479 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:396 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:381 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:0 ht_keyindex(h::Dict{SCIP.… ╎ ╎ ╎ ╎ ╎ ╎ 22 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 22 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1039 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ll.jl:154 any ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ll.jl:130 _any ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…le.jl:74 iterate 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…le.jl:33 getindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @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 ╎ ╎ ╎ ╎ ╎ ╎ 18 @LinearAlgebra/…:1048 dot(x::Vector{Float… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 17 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 17 @LinearAlgebra/…:1049 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ls.jl:1027 getindex 14╎ ╎ ╎ ╎ ╎ ╎ ╎ 15 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1051 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:988 dot 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:494 * ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:31 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:478 getindex(h::Dict{Symbol, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:243 ht_keyindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:83 < 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:42 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…s.jl:119 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:45 (::var"#f#build_examples##0… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1048 dot(x::Vector{Float64… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1027 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:266 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:184 active_set_update_pairwise!(… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:224 active_set_validate(active_… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…dim.jl:983 sum ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…dim.jl:983 #sum#735 ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:987 _sum ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:987 #_sum#737 ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:988 _sum ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:988 #_sum#738 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:330 mapreduce ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:330 #mapreduce#728 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…im.jl:338 _mapreduce_dim 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ce.jl:440 _mapreduce ╎ ╎ ╎ ╎ ╎ 44 @FrankWolfe/…l:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 44 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 36 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 36 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:29 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ble.jl:18 get(o::SCIP.Optimizer, ::M… ╎ ╎ ╎ ╎ ╎ ╎ 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::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1123 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1158 _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…rt.jl:1123 _sort! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…rt.jl:0 _sort!(v::Vector… ╎ ╎ ╎ ╎ ╎ ╎ 35 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 35 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 35 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 35 @SCIP/…er.jl:16 macro expansion 35╎ ╎ ╎ ╎ ╎ ╎ ╎ 35 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:118 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…e.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/….jl:234 is_linear_feasible(o::SCIP… 3╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/….jl:255 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ 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 ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:356 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:97 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:864 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:? #sol_values##0 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::D… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:131 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:122 _shorthash7 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/int.jl:418 | ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:411 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:97 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1048 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1049 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:427 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 3 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 3 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1027 getindex 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:406 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 1 @Boscia/…ings.jl:24 dual_tightening(tree::BnBTree{B… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…unds.jl:73 get(ib::Boscia.IntegerBounds, … ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:417 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 1 @Boscia/…tics.jl:45 run_heuristics(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…tics.jl:63 run_heuristics(tree::BnBTree{B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…lem.jl:94 is_linear_feasible(lmo::Boscia… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:234 is_linear_feasible(o::SCIP.O… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:254 is_linear_feasible_subrouti… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…xt.jl:56 get_tol ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…per.jl:224 get ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:114 get_parameter(scipd::SCIP.… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:17170 SCIPgetParam ╎ ╎ ╎ ╎ 1 @Boscia/…onobo.jl:85 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 1 @Base/array.jl:838 collect(itr::Base.Generator{DataS… ╎ ╎ ╎ ╎ 1 @Base/array.jl:864 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ 1 @Base/…rator.jl:45 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:425 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:324 popfirst!(pq::DataStructu… ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:186 percolate_down! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:358 setindex!(h::Dict{Int64, In… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:0 ht_keyindex2_shorthash!(h::D… 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.857000e+01 2.590063e+01 14 8 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.954300e+01 2.557815e+01 6 4 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.992400e+01 2.541553e+01 4 3 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 59.925 LMO calls / sec: 459.3241551939925 Nodes / sec: 25.415102211097206 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.621000e+00 1.144601e+00 325 53 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.830000e+00 3.180212e+00 61 26 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.917000e+00 3.770998e+00 85 29 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.576000e+00 2.653115e+01 52 20 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 7.909000e+00 2.743710e+01 36 12 3485 420 20 24 [39] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/vpy1o/test/branching_strategy_test.jl:275 getindex at ./essentials.jl:1027 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1049 [inlined] macro expansion at ./simdloop.jl:77 [inlined] dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1048 unknown function (ip: 0x7626f8754671) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 f at /home/pkgeval/.julia/packages/Boscia/vpy1o/test/branching_strategy_test.jl:45 find_best_solution at /home/pkgeval/.julia/packages/Boscia/vpy1o/ext/BosciaSCIPExt.jl:30 unknown function (ip: 0x762773847902) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 find_best_solution at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:591 unknown function (ip: 0x762773846b5d) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 #process_FW_callback_logic#37 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/callbacks.jl:97 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/callbacks.jl:59 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/callbacks.jl:24 unknown function (ip: 0x762773847ec5) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:411 unknown function (ip: 0x76277383a275) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/frank_wolfe_variants.jl:207 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/frank_wolfe_variants.jl:187 unknown function (ip: 0x762773826cf7) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/node.jl:361 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/custom_bonobo.jl:29 unknown function (ip: 0x7627738024da) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 #solve#109 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/interface.jl:270 unknown function (ip: 0x7627737ff7b9) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 solve at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/interface.jl:28 #solve#146 at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/vpy1o/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7627739f31ac) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:766 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:780 ijl_toplevel_eval_in at /source/src/toplevel.c:825 eval at ./boot.jl:517 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4342 jl_apply at /source/src/julia.h:2295 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7627e7e05249) 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: 5229601434 (Pool: 5229597490; Big: 3944); GC: 2305 PkgEval terminated after 2733.31s: test duration exceeded the time limit