Package evaluation to test Boscia on Julia 1.14.0-DEV.2386 (9e0b0ca1f2*) started at 2026-06-16T20:49:19.029 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 14.72s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.12 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.12 [d360d2e6] + ChainRulesCore v1.26.1 [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.5 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.4.1 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.6.1 [2ab3a3ac] + LogExpFunctions v1.0.1 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.1 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.4 [d9ec5142] + NamedTupleTools v0.14.3 ⌅ [bac558e1] + OrderedCollections v1.8.2 [69de0a69] + Parsers v2.8.5 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.8.0 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.2 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.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.5.3+0 [4536629a] + OpenBLAS_jll v0.3.33+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.45s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:457 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 2.0 s ? GenericLinearAlgebra 1.2 s ✓ Bonobo 1.9 s ✓ MUMPS_seq_jll 2.1 s ✓ LEMON_jll 2.0 s ✓ SPRAL_jll 13.6 s ✓ MathOptSetDistances 16.8 s ✓ FrankWolfe ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14197337-ba66-59df-a3e3-ca00e7dcff7a"), "GenericLinearAlgebra") 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:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] top-level scope  @ ~/.julia/packages/DoubleFloats/KuIQF/src/DoubleFloats.jl:45  [12] include(mod::Module, _path::String)  @ Base Base.jl:325  [13] 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:3303  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core boot.jl:522  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [17] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [19] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/DoubleFloats/KuIQF/src/DoubleFloats.jl:1 in expression starting at stdin:5 ✗ DoubleFloats 13.8 s ✓ LEMONGraphs 1.7 s ✓ Ipopt_jll 15.9 s ✓ Boscia 29.7 s ✓ GraphsMatching 6.0 s ✓ SCIP_PaPILO_jll 2.3 s ✓ SCIP_jll 14.0 s ✓ Boscia → BosciaHiGHSExt 26.0 s ✓ CombinatorialLinearOracles 27.5 s ✓ SCIP 19.4 s ✓ Boscia → BosciaSCIPExt 16 dependencies successfully precompiled in 201 seconds. 160 already precompiled. 1 dependency failed but may be precompilable after restarting julia 1 dependency had output during precompilation: ┌ GenericLinearAlgebra │ WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:457 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ Precompilation completed after 234.49s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_u0SDfb/Project.toml` [4c88cf16] Aqua v0.8.16 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.126 [497a8b3b] DoubleFloats v1.9.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.23.0 [b8f27783] MathOptInterface v1.51.1 [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.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_u0SDfb/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.16 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.5 [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.5 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.16.0 [31c24e10] Distributions v0.25.126 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.9.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.4.1 [f55ce6ea] FrankWolfe v0.6.4 [14197337] GenericLinearAlgebra v0.4.0 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.14.0 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.23.0 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.6.1 [4076af6c] JuMP v1.30.1 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v1.0.1 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.51.1 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.4 [d9ec5142] NamedTupleTools v0.14.3 ⌅ [bac558e1] OrderedCollections v1.8.2 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.5 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.3 [be4d8f0f] Quadmath v1.0.1 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.10 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.6 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.8.0 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.11 [4c63d2b9] StatsFuns v2.1.0 [ec057cc2] StructUtils v2.8.2 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.3 [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.14.0+0 [e33a78d0] Hwloc_jll v2.13.0+1 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.5+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.33+1 [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.19.0+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.10+0 [1317d2d5] oneTBB_jll v2022.3.0+0 [0dad84c5] ArgTools v1.2.0 [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.14.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 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.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.5.3+0 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.4+0 [29816b5a] LibSSH2_jll v1.11.101+0 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2026.5.14 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.7+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.69.0+0 [3f19e933] p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0x35d7006601442cf8 WARNING: Use of Boscia.CubeSimpleBLMO is deprecated, use CubeLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/interface_test.jl:97 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution 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 = TIME_LIMIT_REACHED WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/interface_test.jl:986 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 = TIME_LIMIT_REACHED Callback Tests seed = 0x5d707eb04abb0288 LMO Tests seed = 0x9fa445cdfd8ae271 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:218 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:254 Indicator Tests seed = 0x1753d55275f00c62 Heuristics Tests seed = 0x4039d6b52b3f3a49 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:193 Sparse Regression Tests seed = 0xf873c886cec3246f Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.571829e+00 1.603996e+00 3.216751e-02 2.046502e-02 2.374600e+01 1.263371e-01 9714 31 11 11 5 1 5 4 1.593157e+00 1.603996e+00 1.083945e-02 6.803755e-03 2.769100e+01 3.250153e-01 10 6 28 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 5.140370e+00 -4.885607e-01 5.628931e+00 0.000000e+00 Inf 1 LD 2 1.603996e+00 1.603996e+00 0.000000e+00 2.213732e+00 9.034518e-01 1 Last 2 1.603996e+00 1.603996e+00 0.000000e+00 2.386774e+00 8.379511e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.603996e+00 1.603996e+00 0.000000e+00 2.390674e+00 8.365842e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.6039963893920512 Dual Bound: 1.5931569396363485 Dual Gap (relative): 0.006803755164370008 Search Statistics. Total number of nodes processed: 9 Total number of lmo calls: 33 Total time (s): 32.905 LMO calls / sec: 1.0028870992250418 Nodes / sec: 0.2735146634250114 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 44 Global tightenings / node: 8.8 Total number of local tightenings: 47 Local tightenings / node: 9.4 Total number of potential local tightenings: 48 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 8.219469e-01 2.410365e+00 1.588418e+00 1.932507e+00 2.095400e+01 1.431708e-01 9934 201 45 104 32 1 * 3 4 8.425626e-01 2.376505e+00 1.533942e+00 1.820568e+00 2.127200e+01 3.290711e-01 141 60 95 47 19 1 * 63 62 1.580457e+00 2.349144e+00 7.686869e-01 4.863699e-01 2.723800e+01 4.589177e+00 22 15 1377 13 0 0 100 63 1.661943e+00 2.349144e+00 6.872016e-01 4.134930e-01 2.823600e+01 5.772772e+00 21 13 1628 43 20 4 200 63 1.747552e+00 2.349144e+00 6.015917e-01 3.442482e-01 3.083600e+01 8.528992e+00 31 20 2294 41 20 8 300 63 1.795359e+00 2.349144e+00 5.537848e-01 3.084535e-01 3.347000e+01 1.084553e+01 28 18 3007 37 16 4 400 63 1.830207e+00 2.349144e+00 5.189374e-01 2.835403e-01 3.611900e+01 1.281874e+01 43 27 3747 62 18 7 500 63 1.862072e+00 2.349144e+00 4.870725e-01 2.615756e-01 3.893700e+01 1.445925e+01 39 24 4553 58 18 1 600 63 1.889213e+00 2.349144e+00 4.599309e-01 2.434510e-01 4.179300e+01 1.586390e+01 45 27 5355 102 17 8 700 63 1.919598e+00 2.349144e+00 4.295464e-01 2.237689e-01 4.490200e+01 1.699256e+01 32 21 6196 49 13 5 800 63 1.948994e+00 2.349144e+00 4.001500e-01 2.053110e-01 4.778300e+01 1.806082e+01 37 23 7029 71 16 8 900 63 1.992114e+00 2.349144e+00 3.570299e-01 1.792216e-01 5.057100e+01 1.904253e+01 51 31 7841 63 16 4 1000 63 2.044225e+00 2.349144e+00 3.049195e-01 1.491614e-01 5.310300e+01 2.001770e+01 30 20 8614 37 6 1 1100 63 2.135156e+00 2.349144e+00 2.139877e-01 1.002211e-01 5.548800e+01 2.095949e+01 27 17 9414 34 5 1 1200 9 2.313903e+00 2.349144e+00 3.524087e-02 1.523005e-02 5.723000e+01 2.112528e+01 11 7 10026 6 0 0 1205 4 2.328375e+00 2.349144e+00 2.076891e-02 8.919915e-03 5.730600e+01 2.109727e+01 11 7 10051 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.177474e+00 -2.123326e+00 8.300801e+00 0.000000e+00 Inf 1 LD 2 2.349370e+00 2.326560e+00 2.281053e-02 1.241961e-01 1.610357e+01 2 LD 7 2.349178e+00 2.340508e+00 8.669395e-03 3.089522e-01 2.265723e+01 3 LD 12 2.349151e+00 2.345356e+00 3.795128e-03 3.112772e-01 3.855085e+01 3 LD 17 2.349145e+00 2.347480e+00 1.665389e-03 3.131089e-01 5.429421e+01 3 LD 22 2.349144e+00 2.348413e+00 7.315934e-04 3.152906e-01 6.977689e+01 3 LD 27 2.349144e+00 2.348823e+00 3.215351e-04 3.175163e-01 8.503501e+01 3 LD 32 2.349144e+00 2.349138e+00 6.322584e-06 3.197239e-01 1.000864e+02 3 LD 48 2.349144e+00 2.349142e+00 2.565744e-06 3.222152e-01 1.489687e+02 3 LD 53 2.349144e+00 2.349143e+00 1.128060e-06 3.244846e-01 1.633359e+02 3 LD 56 2.349144e+00 2.349143e+00 7.479828e-07 3.266810e-01 1.714210e+02 3 Last 56 2.349144e+00 2.349143e+00 7.479828e-07 3.304169e-01 1.694829e+02 3 ---------------------------------------------------------------------------------------------------------------- PP 56 2.349144e+00 2.349143e+00 7.479828e-07 3.324667e-01 1.684379e+02 3 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.3491442043142015 Dual Bound: 2.3283752965068456 Dual Gap (relative): 0.008919914172991995 Search Statistics. Total number of nodes processed: 1209 Total number of lmo calls: 10066 Total time (s): 60.097 LMO calls / sec: 167.49588165798625 Nodes / sec: 20.117476745927416 LMO calls / node: 8.325889164598841 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: 17 [ Info: Polish solution Non zero entries: 1th entry: 0.14964344016529835 46th entry: 0.14278486426001075 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 9.216926e-01 2.410365e+00 1.488672e+00 1.615150e+00 2.000000e-01 1.500000e+01 196 152 45 104 32 1 * 3 4 9.390857e-01 2.376505e+00 1.437419e+00 1.530658e+00 3.870000e-01 1.808786e+01 50 37 95 47 19 1 * 59 46 1.622735e+00 2.349144e+00 7.264088e-01 4.476446e-01 4.846000e+00 2.166735e+01 14 10 1293 13 0 0 100 48 1.707070e+00 2.349144e+00 6.420746e-01 3.761268e-01 5.625000e+00 2.631111e+01 14 9 1600 40 20 3 200 48 1.797602e+00 2.349144e+00 5.515426e-01 3.068214e-01 7.288000e+00 3.402854e+01 12 8 2265 26 13 5 300 32 1.862970e+00 2.349144e+00 4.861744e-01 2.609674e-01 9.213000e+00 3.603604e+01 17 11 3027 50 18 5 400 31 1.932536e+00 2.349144e+00 4.166081e-01 2.155758e-01 1.199300e+01 3.593763e+01 32 22 4073 59 15 3 500 31 1.998732e+00 2.349144e+00 3.504121e-01 1.753172e-01 1.488200e+01 3.568069e+01 22 14 5178 28 11 6 600 31 2.102961e+00 2.349144e+00 2.461834e-01 1.170652e-01 1.770200e+01 3.564569e+01 18 11 6215 32 10 7 694 6 2.328264e+00 2.349144e+00 2.088052e-02 8.968280e-03 1.978800e+01 3.537497e+01 24 17 7133 33 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.177474e+00 -2.123326e+00 8.300801e+00 0.000000e+00 Inf 1 LD 2 2.349370e+00 2.326560e+00 2.281053e-02 7.611300e-04 2.627672e+03 2 LD 7 2.349178e+00 2.340508e+00 8.669395e-03 4.388479e-03 1.595086e+03 3 LD 12 2.349151e+00 2.345356e+00 3.795128e-03 6.646539e-03 1.805451e+03 3 LD 17 2.349145e+00 2.347480e+00 1.665389e-03 9.181949e-03 1.851459e+03 3 LD 22 2.349144e+00 2.348413e+00 7.315934e-04 1.169160e-02 1.881693e+03 3 LD 27 2.349144e+00 2.348823e+00 3.215351e-04 1.414668e-02 1.908575e+03 3 LD 32 2.349144e+00 2.349138e+00 6.322584e-06 1.656955e-02 1.931254e+03 3 LD 48 2.349144e+00 2.349142e+00 2.565744e-06 1.936143e-02 2.479156e+03 3 LD 53 2.349144e+00 2.349143e+00 1.128060e-06 2.306375e-02 2.297979e+03 3 LD 56 2.349144e+00 2.349143e+00 7.479828e-07 2.721300e-02 2.057840e+03 3 Last 56 2.349144e+00 2.349143e+00 7.479828e-07 3.290461e-02 1.701889e+03 3 ---------------------------------------------------------------------------------------------------------------- PP 56 2.349144e+00 2.349143e+00 7.479828e-07 3.531065e-02 1.585924e+03 3 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.3491442043142015 Dual Bound: 2.328263685813738 Dual Gap (relative): 0.008968279077533108 Search Statistics. Total number of nodes processed: 700 Total number of lmo calls: 7148 Total time (s): 19.83 LMO calls / sec: 360.4639435199193 Nodes / sec: 35.30005042864347 LMO calls / node: 10.211428571428572 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: 16 [ Info: Polish solution Poisson Tests seed = 0x1476e166eeca2829 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 -8.313608e+02 -8.030518e+02 2.830901e+01 3.525178e-02 2.410600e+01 1.244503e-01 12912 121 47 1532 24 9 * 3 4 -8.302757e+02 -8.197320e+02 1.054370e+01 1.286237e-02 2.860200e+01 2.447381e-01 1460 72 112 910 27 11 21 22 -8.278384e+02 -8.197320e+02 8.106342e+00 9.889015e-03 6.820100e+01 6.304893e-01 1869 77 661 1261 22 22 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 1.203504e+03 -1.229462e+03 2.432966e+03 0.000000e+00 Inf 1 LD 2 -7.979108e+02 -8.615160e+02 6.360524e+01 1.781117e-01 1.122891e+01 2 LD 28 -8.078421e+02 -8.368697e+02 2.902767e+01 5.773144e-01 4.850044e+01 3 LD 31 -8.203018e+02 -8.325289e+02 1.222708e+01 5.853109e-01 5.296331e+01 4 LD 40 -8.207724e+02 -8.251108e+02 4.338403e+00 5.989842e-01 6.677973e+01 3 LD 44 -8.208299e+02 -8.224809e+02 1.651008e+00 6.077248e-01 7.240119e+01 4 LD 83 -8.208610e+02 -8.213458e+02 4.848081e-01 6.551936e-01 1.266801e+02 5 LD 120 -8.208635e+02 -8.210574e+02 1.938795e-01 6.919159e-01 1.734315e+02 5 LD 159 -8.208639e+02 -8.209362e+02 7.227107e-02 7.335435e-01 2.167561e+02 6 LD 184 -8.208640e+02 -8.208933e+02 2.934816e-02 7.606548e-01 2.418968e+02 7 LD 205 -8.208640e+02 -8.208781e+02 1.417167e-02 7.843562e-01 2.613608e+02 8 LD 223 -8.208640e+02 -8.208681e+02 4.126130e-03 8.052741e-01 2.769244e+02 8 LD 240 -8.208640e+02 -8.208647e+02 7.191656e-04 8.260763e-01 2.905301e+02 8 LD 266 -8.208640e+02 -8.208640e+02 2.281098e-05 8.527748e-01 3.119229e+02 8 LD 335 -8.208640e+02 -8.208640e+02 7.025313e-06 9.209845e-01 3.637412e+02 8 P 1000 -8.208640e+02 -8.208640e+02 7.025313e-06 1.580254e+00 6.328097e+02 8 P 2000 -8.208640e+02 -8.208640e+02 7.025313e-06 2.482526e+00 8.056311e+02 8 P 3000 -8.208640e+02 -8.208640e+02 7.025313e-06 3.190966e+00 9.401542e+02 8 P 4000 -8.208640e+02 -8.208640e+02 7.025313e-06 3.987099e+00 1.003236e+03 8 P 5000 -8.208640e+02 -8.208640e+02 7.025313e-06 4.750545e+00 1.052511e+03 8 P 6000 -8.208640e+02 -8.208640e+02 7.025313e-06 5.517328e+00 1.087483e+03 8 P 7000 -8.208640e+02 -8.208640e+02 7.025313e-06 6.311742e+00 1.109044e+03 8 P 8000 -8.208640e+02 -8.208640e+02 7.025313e-06 7.081194e+00 1.129753e+03 8 P 9000 -8.208640e+02 -8.208640e+02 7.025313e-06 7.839775e+00 1.147992e+03 8 P 10000 -8.208640e+02 -8.208640e+02 7.025313e-06 8.598436e+00 1.163002e+03 8 Last 10001 -8.208640e+02 -8.208640e+02 1.601082e-06 8.605245e+00 1.162198e+03 8 ---------------------------------------------------------------------------------------------------------------- PP 10001 -8.208640e+02 -8.208640e+02 1.601081e-06 8.608956e+00 1.161697e+03 8 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -820.8639726666431 Dual Bound: -827.8383808023394 Dual Gap (relative): 0.008496423729061196 Search Statistics. Total number of nodes processed: 43 Total number of lmo calls: 688 Total time (s): 79.531 LMO calls / sec: 8.650714815606493 Nodes / sec: 0.5406696759754058 LMO calls / node: 16.0 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 [ Info: Polish solution 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 -7.031500e+02 -7.019738e+02 1.176250e+00 1.675633e-03 2.450000e+01 1.224490e-01 9568 72 16 28 5 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -3.753072e+02 -7.398485e+02 3.645413e+02 0.000000e+00 Inf 1 LD 2 -7.019738e+02 -7.019738e+02 0.000000e+00 1.786295e-01 1.119636e+01 1 Last 2 -7.019738e+02 -7.019738e+02 0.000000e+00 3.622821e-01 5.520560e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -7.019738e+02 -7.019738e+02 0.000000e+00 3.658787e-01 5.466292e+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: -701.973768421077 Dual Bound: -703.150018614713 Dual Gap (relative): 0.0016756326896397373 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 21 Total time (s): 27.361 LMO calls / sec: 0.7675158071707905 Nodes / sec: 0.10964511531011294 LMO calls / node: 7.0 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.712857e+02 3.544247e+02 1.831389e+02 1.069201e+00 2.022800e+01 1.483093e-01 9824 186 25 63 12 1 * 2 3 1.712857e+02 3.297500e+02 1.584643e+02 9.251459e-01 2.038500e+01 2.452784e-01 153 89 45 43 11 0 * 8 9 2.049164e+02 3.288437e+02 1.239273e+02 6.047701e-01 2.133900e+01 7.966634e-01 130 77 156 39 10 1 * 30 31 2.394872e+02 3.269350e+02 8.744779e+01 3.651460e-01 2.455200e+01 2.484523e+00 116 51 519 32 7 0 100 101 2.757659e+02 3.269350e+02 5.116905e+01 1.855525e-01 3.264500e+01 6.157145e+00 99 49 1470 39 6 1 200 183 2.947764e+02 3.269350e+02 3.215863e+01 1.090950e-01 4.067400e+01 9.416335e+00 32 20 2550 6 0 0 300 195 3.066344e+02 3.269350e+02 2.030061e+01 6.620461e-02 4.585900e+01 1.079396e+01 54 27 3290 22 3 0 400 179 3.133427e+02 3.269350e+02 1.359227e+01 4.337827e-02 4.942300e+01 1.171519e+01 10 6 3851 2 2 0 * 414 167 3.151270e+02 3.267892e+02 1.166216e+01 3.700782e-02 4.986300e+01 1.173215e+01 12 7 3919 2 0 0 500 105 3.210467e+02 3.267892e+02 5.742507e+00 1.788683e-02 5.147500e+01 1.183099e+01 25 15 4216 6 0 0 539 70 3.235601e+02 3.267892e+02 3.229030e+00 9.979692e-03 5.206200e+01 1.177442e+01 5 3 4347 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.269350e+02 3.195985e+02 7.336447e+00 0.000000e+00 Inf 1 LD 2 3.267892e+02 3.267892e+02 3.297396e-08 1.710355e-01 1.169348e+01 2 Last 2 3.267892e+02 3.267892e+02 3.297396e-08 3.492112e-01 5.727193e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.267892e+02 3.267892e+02 3.297396e-08 3.525045e-01 5.673686e+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: 326.78916079658046 Dual Bound: 323.56013040533406 Dual Gap (relative): 0.009979691834099856 Search Statistics. Total number of nodes processed: 613 Total number of lmo calls: 4352 Total time (s): 55.11 LMO calls / sec: 78.96933405915442 Nodes / sec: 11.123208129196152 LMO calls / node: 7.099510603588907 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.712857e+02 3.544247e+02 1.831389e+02 1.069201e+00 2.484800e+01 1.207341e-01 10055 120 25 63 12 1 * 2 3 1.712857e+02 3.435715e+02 1.722858e+02 1.005838e+00 2.599200e+01 1.923669e-01 187 102 46 54 11 2 * 3 4 1.888756e+02 3.344479e+02 1.455723e+02 7.707313e-01 2.712200e+01 2.580931e-01 146 81 64 50 12 1 * 5 6 1.903519e+02 3.288437e+02 1.384918e+02 7.275566e-01 2.921100e+01 3.765705e-01 152 83 104 49 11 1 * 47 46 2.513198e+02 3.269350e+02 7.561520e+01 3.008725e-01 6.447000e+01 1.442531e+00 121 49 751 50 7 1 100 91 2.692867e+02 3.269350e+02 5.764828e+01 2.140777e-01 9.934800e+01 1.922535e+00 53 29 1417 19 4 0 200 157 2.920279e+02 3.269350e+02 3.490707e+01 1.195333e-01 1.467970e+02 2.431930e+00 56 29 2389 23 3 0 300 173 3.048942e+02 3.269350e+02 2.204077e+01 7.228988e-02 1.761740e+02 2.684846e+00 39 21 3066 11 0 0 400 143 3.148676e+02 3.269350e+02 1.206735e+01 3.832515e-02 1.918370e+02 2.830528e+00 10 6 3498 2 0 0 * 416 129 3.163148e+02 3.267892e+02 1.047439e+01 3.311381e-02 1.925300e+02 2.830728e+00 11 7 3556 2 0 0 500 51 3.230724e+02 3.267892e+02 3.716771e+00 1.150445e-02 1.953510e+02 2.820564e+00 7 5 3834 0 0 0 509 44 3.236304e+02 3.267892e+02 3.158751e+00 9.760364e-03 1.957760e+02 2.824657e+00 5 3 3853 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.269350e+02 3.195985e+02 7.336447e+00 0.000000e+00 Inf 1 LD 2 3.267892e+02 3.267892e+02 3.297396e-08 1.716571e-01 1.165114e+01 2 Last 2 3.267892e+02 3.267892e+02 3.297396e-08 3.552701e-01 5.629520e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.267892e+02 3.267892e+02 3.297396e-08 3.587326e-01 5.575183e+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: 326.78916079658046 Dual Bound: 323.6304100965309 Dual Gap (relative): 0.009760364296752507 Search Statistics. Total number of nodes processed: 553 Total number of lmo calls: 3858 Total time (s): 199.032 LMO calls / sec: 19.383817677559385 Nodes / sec: 2.7784476868041317 LMO calls / node: 6.976491862567812 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 = 0xf24b31bdbc49470b 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.159293e+02 1.485785e+01 1.307872e+02 Inf 2.673800e+01 1.121999e-01 13996 1046 37 10001 23 6 * 3 4 -1.155219e+02 1.326408e+01 1.287860e+02 Inf 2.996600e+01 2.335981e-01 2145 1729 94 10001 23 14 * 12 13 -1.130833e+02 -8.862088e+01 2.446247e+01 2.760351e-01 4.373500e+01 5.716246e-01 1136 710 428 10001 21 34 24 25 -1.106880e+02 -8.862088e+01 2.206714e+01 2.490061e-01 6.050500e+01 8.098504e-01 2346 1953 816 10001 19 22 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -88.62087596148429 Dual Bound: -110.68801336635582 Dual Gap (relative): 0.24900608536596025 Search Statistics. Total number of nodes processed: 49 Total number of lmo calls: 816 Total time (s): 61.704 LMO calls / sec: 13.224426293271101 Nodes / sec: 0.7941138337871126 LMO calls / node: 16.653061224489797 Total number of global tightenings: 8 Global tightenings / node: 0.33 Total number of local tightenings: 127 Local tightenings / node: 5.29 Total number of potential local tightenings: 224 Time Limit Test seed = 0x27b4bcf98b8263e1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -2.024519e+01 -2.015417e+01 9.102158e-02 4.516266e-03 2.376200e+01 1.262520e-01 12398 60 13 108 3 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -20.154167191126355 Dual Bound: -20.245188769652053 Dual Gap (relative): 0.00451626592468548 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 24.978 LMO calls / sec: 0.5204580030426775 Nodes / sec: 0.12010569300984866 LMO calls / node: 4.333333333333333 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 12 Strong Convexity and Sharpness Tests seed = 0x5da69b17b6a0a047 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 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.935850e+02 1.937214e+02 1.364135e-01 7.046699e-04 2.021700e+01 1.483900e-01 9001 0 17 33 5 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 193.72138865093243 Dual Bound: 193.5849751547417 Dual Gap (relative): 0.0007046698540611689 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 17 Total time (s): 21.356 LMO calls / sec: 0.7960292189548605 Nodes / sec: 0.14047574452144596 LMO calls / node: 5.666666666666667 Total number of global tightenings: 7 Global tightenings / node: 7.0 Total number of local tightenings: 7 Local tightenings / node: 7.0 Total number of potential local tightenings: 15 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:135 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:135 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.094985e+02 2.097661e+02 2.675790e-01 1.277236e-03 1.946800e+01 1.540990e-01 8705 0 14 17 3 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 209.76608848933114 Dual Bound: 209.49850949094017 Dual Gap (relative): 0.0012772358096540316 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 14 Total time (s): 20.375 LMO calls / sec: 0.6871165644171779 Nodes / sec: 0.147239263803681 LMO calls / node: 4.666666666666667 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 17 Branching Strategy Tests seed = 0xa744c36ef3690164 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.232600e+01 1.343725e-01 10915 46 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.363900e+01 2.749693e+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): 24.889 LMO calls / sec: 38.29000763389449 Nodes / sec: 2.6115954839487325 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.870000e-01 6.160164e+00 344 55 48 3749 24 11 87 0 7.016760e+00 7.382204e+00 3.654439e-01 5.208158e-02 1.896000e+00 4.588608e+01 4 2 1015 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.016760210963634 Dual Gap (relative): 0.05208157873473409 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.897 LMO calls / sec: 535.0553505535055 Nodes / sec: 45.86188719030047 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 4.320000e-01 6.944444e+00 280 53 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.667000e+00 3.539292e+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.668 LMO calls / sec: 514.9880095923262 Nodes / sec: 35.37170263788969 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.970000e-01 7.556675e+00 233 39 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.707000e+00 4.393673e+01 12 8 902 27 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.709 LMO calls / sec: 527.7940315974254 Nodes / sec: 43.88531304856641 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.550000e-01 8.450704e+00 240 40 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.713000e+00 5.662580e+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.714 LMO calls / sec: 684.9474912485414 Nodes / sec: 56.59276546091015 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.190000e-01 7.159905e+00 415 52 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 6.580000e-01 1.367781e+01 66 24 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 7.450000e-01 1.476510e+01 83 25 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 6.695000e+00 3.002240e+01 83 30 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 7.244000e+00 2.995583e+01 56 19 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.271700e+01 3.153259e+01 46 20 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.851600e+01 3.224238e+01 51 19 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.413800e+01 3.285276e+01 50 21 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.893300e+01 3.342204e+01 20 11 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.401800e+01 3.348227e+01 57 22 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.809500e+01 3.341646e+01 12 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.154900e+01 3.294905e+01 8 5 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.432200e+01 3.215108e+01 8 5 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.663600e+01 3.154216e+01 31 12 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.854300e+01 3.079744e+01 9 6 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.996200e+01 3.024298e+01 11 7 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.123400e+01 2.960924e+01 13 7 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.235000e+01 2.909265e+01 9 6 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.289900e+01 2.879071e+01 5 4 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 52.9 LMO calls / sec: 520.3213610586012 Nodes / sec: 28.79017013232514 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.135000e+00 1.405152e+00 475 65 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.450000e+00 3.673469e+00 88 32 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.585000e+00 4.255319e+00 132 37 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.970000e+00 2.016048e+01 82 30 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.054400e+01 2.058042e+01 54 17 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.659000e+01 2.393008e+01 83 23 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.109000e+01 2.660028e+01 42 19 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.560900e+01 2.784177e+01 22 13 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 2.930600e+01 2.897018e+01 47 20 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.288600e+01 3.001277e+01 22 11 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.600700e+01 3.068848e+01 8 5 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 3.914200e+01 3.119411e+01 7 4 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.187000e+01 3.140674e+01 8 5 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.425400e+01 3.170335e+01 11 7 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.611500e+01 3.168167e+01 8 5 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.781900e+01 3.176562e+01 8 5 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 4.918700e+01 3.206132e+01 9 6 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.053200e+01 3.207868e+01 11 7 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.166000e+01 3.211382e+01 11 6 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.269400e+01 3.186321e+01 7 4 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.284500e+01 3.177216e+01 14 8 26740 41 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.083355821757877 Dual Gap (relative): 0.009945008189894359 Search Statistics. Total number of nodes processed: 1679 Total number of lmo calls: 26740 Total time (s): 52.846 LMO calls / sec: 505.99856185898653 Nodes / sec: 31.77156265374863 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.490000e-01 5.464481e+00 479 63 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.326000e+00 9.803922e+00 94 30 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.203000e+00 2.079639e+01 60 24 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 8.743000e+00 2.298982e+01 67 26 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.483300e+01 2.703432e+01 69 26 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.017600e+01 2.949048e+01 46 23 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.476000e+01 3.089661e+01 18 11 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 2.935000e+01 3.172061e+01 64 27 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.357300e+01 3.219849e+01 53 18 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 3.726400e+01 3.244418e+01 41 17 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.102200e+01 3.254351e+01 7 4 19379 9 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 71 running 1 of 1 signal (10): User defined signal 1 getindex at ./dict.jl:478:0 [inlined] var at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/scip_data.jl:181:0 [inlined] var at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:128:0 [inlined] #sol_values##0 at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/convenience.jl:25:0 [inlined] iterate at ./generator.jl:48:0 [inlined] collect_to! at ./array.jl:914:0 [inlined] collect_to_with_first! at ./array.jl:869:0 (pc: 61) collect at ./array.jl:843:0 [inlined] sol_values at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/convenience.jl:25:0 [inlined] find_best_solution at /home/pkgeval/.julia/packages/Boscia/EgUlC/ext/BosciaSCIPExt.jl:28:0 (pc: 145) unknown function (ip: 0x78923b952ac2) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 find_best_solution at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:591:0 (pc: 2) unknown function (ip: 0x78923b951d4d) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 #process_FW_callback_logic#37 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:97:0 (pc: 1355) process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:59:0 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:24:0 (pc: 11) unknown function (ip: 0x78923b948dae) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:356:0 (pc: 1047) unknown function (ip: 0x78923b945625) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:0 (pc: 49) #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208:0 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188:0 (pc: 28) unknown function (ip: 0x78923b931d67) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373:0 (pc: 1359) #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:0 (pc: 235) optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:0 (pc: 5) unknown function (ip: 0x78923b90d8ba) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:0 (pc: 1550) unknown function (ip: 0x78923b90ab69) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:0 (pc: 3) #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:0 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:0 (pc: 8) unknown function (ip: 0x78923b90346c) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 jl_apply at /source/src/julia.h:2389:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:522:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 207) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:326:0 (pc: 1) IncludeInto at ./Base.jl:327:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 jl_apply at /source/src/julia.h:2389:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:522:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 207) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:326:0 (pc: 1) IncludeInto at ./Base.jl:327:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 jl_apply at /source/src/julia.h:2389:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:522:0 (pc: 1) exec_options at ./client.jl:321:0 (pc: 425) _start at ./client.jl:596:0 (pc: 294) jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 jl_apply at /source/src/julia.h:2389:12 [inlined] true_main at /source/src/jlapi.c:971:29 jl_repl_entrypoint at /source/src/jlapi.c:1138:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x7892bdda8249) 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 ============================================================== 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.455600e+01 3.243110e+01 47 19 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 4.761400e+01 3.232243e+01 40 19 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.520800e+01 2.947037e+01 6 4 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.762500e+01 2.927549e+01 12 7 25390 20 0 0 ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 1201 488 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 6.025100e+01 2.803273e+01 3 2 25392 1 13 1 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007892a2ffc010 Total snapshots: 47. Utilization: 100% ╎47 @Base/client.jl:596 _start() ╎ 47 @Base/client.jl:321 exec_options(opts::Base.JLOptions) ╎ 47 @Base/boot.jl:522 eval(m::Module, e::Any) ╎ 47 @Base/Base.jl:327 (::Base.IncludeInto)(fname::String) ╎ 47 @Base/Base.jl:326 include(mapexpr::Function, mod::Module, _path::Str… ╎ 47 @Base/loading.jl:3192 _include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 47 @Base/loading.jl:3132 include_string(mapexpr::typeof(identity), mo… ╎ ╎ 47 @Base/boot.jl:522 eval(m::Module, e::Any) ╎ ╎ 47 @Base/Base.jl:327 (::Base.IncludeInto)(fname::String) ╎ ╎ 47 @Base/Base.jl:326 include(mapexpr::Function, mod::Module, _path… ╎ ╎ 47 @Base/loading.jl:3192 _include(mapexpr::Function, mod::Module,… ╎ ╎ ╎ 47 @Base/loading.jl:3132 include_string(mapexpr::typeof(identity… ╎ ╎ ╎ 47 @Base/boot.jl:522 eval(m::Module, e::Any) ╎ ╎ ╎ 47 @Boscia/…_oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 47 @Boscia/…oracle.jl:834 solve(f::Function, g::Function, blm… ╎ ╎ ╎ 47 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ ╎ 47 @Boscia/…erface.jl:269 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 47 @Boscia/…bonobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 45 @Boscia/…onobo.jl:36 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:333 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 1 @Boscia/…ties.jl:30 check_feasibility(tlmo::Boscia.T… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…acle.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/…SCIP.jl:21458 SCIPsolve(scip::SCIP.Optimi… ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:350 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 1 @Boscia/…blem.jl:94 is_linear_feasible(lmo::Boscia.T… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…acle.jl:229 is_linear_feasible(lmo::FrankW… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:234 is_linear_feasible(o::SCIP.Opt… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:249 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…iable.jl:47 get(model::SCIP.Optimizer, ::… ╎ ╎ ╎ ╎ ╎ 1 @MathOptInterface/…:115 throw_if_not_valid(mode… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:32 is_valid(o::SCIP.Optimizer, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:550 haskey(h::Dict{SCIP.VarRef,… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:244 ht_keyindex(h::Dict{SCIP.V… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex(key::SCIP.VarRef… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 hash(data::SCIP.VarRef) ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:47 hash(data::SCIP.VarRef, h… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:76 hash(x::UInt64, h::UInt6… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:64 hash_64_64(data::UInt64) ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:58 hash_finalizer(x::UInt… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:419 xor(x::UInt64, y::UI… ╎ ╎ ╎ ╎ 43 @Boscia/…node.jl:373 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 43 @Boscia/…ants.jl:188 kwcall(::@NamedTuple{epsilon::F… ╎ ╎ ╎ ╎ ╎ 42 @Boscia/…ants.jl:208 solve_frank_wolfe(frank_wolfe_… ╎ ╎ ╎ ╎ ╎ 42 @FrankWolfe/….jl:76 kwcall(::@NamedTuple{line_sear… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:108 compute_extreme_point(tlmo::B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:24 kwcall(::@NamedTuple{kwargs:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:358 _optimize_and_return(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:21458 SCIPsolve(scip::SCIP.O… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:208 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…est.jl:50 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:281 mul!(C::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:71 mul!(y::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:74 _mul!(y::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:79 generic_matvecmul!(y::Ve… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:721 gemv!(y::Vector{Float6… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:680 gemv!(trans::Char, al… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:215 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:18 dot(x::Vector{Float64}, y::V… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:408 dot(x::Vector{Float64}, y:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:358 dot(n::Int64, DX::Ptr{Flo… ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…jl:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…cks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…ks.jl:59 kwcall(::@NamedTuple{active_s… ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…ks.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…e.jl:591 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:28 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…nce.jl:25 sol_values(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:843 collect(itr::Base.Generat… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:869 collect_to_with_first!(d… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:914 collect_to!(dest::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:45 iterate(g::Base.Generat… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1242 iterate(A::Vector{Ma… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1250 _iterate_abstractar… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex(A::Vector… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate(g::Base.Generat… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ce.jl:25 (::SCIP.var"#sol_value… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:128 var(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:181 var(scipd::SCIP.SCI… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:478 getindex(h::Dict{S… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex(key::S… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 hash(data::SCIP.… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ng.jl:47 hash(data::SCIP.… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:879 objectid(x::SCI… ╎ ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…t.jl:30 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…t.jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1048 dot(x::Vector{Float6… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex(A::Vector{Fl… 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:494 +(x::Float64, y::Float… ╎ ╎ ╎ ╎ ╎ 29 @FrankWolfe/…jl:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 29 @Boscia/…mo.jl:108 compute_extreme_point(tlmo::B… ╎ ╎ ╎ ╎ ╎ 20 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 20 @FrankWolfe/…l:24 kwcall(::@NamedTuple{kwargs:… ╎ ╎ ╎ ╎ ╎ ╎ 20 @FrankWolfe/…l:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 20 @FrankWolfe/…:358 _optimize_and_return(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 20 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 20 @SCIP/…er.jl:16 macro expansion 20╎ ╎ ╎ ╎ ╎ ╎ ╎ 20 @SCIP/…IP.jl:21458 SCIPsolve(scip::SCIP.O… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:118 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…em.jl:94 is_linear_feasible(lmo::Bosc… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:229 is_linear_feasible(lmo::Fra… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:234 is_linear_feasible(o::SCIP… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:255 is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ 8 @Boscia/…mo.jl:130 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 8 @Boscia/…le.jl:455 free_model(lmo::FrankWolfe.… ╎ ╎ ╎ ╎ ╎ ╎ 8 @Boscia/…xt.jl:49 free_model(o::SCIP.Optimize… 8╎ ╎ ╎ ╎ ╎ ╎ 8 @SCIP/…IP.jl:21476 SCIPfreeTransform(scip::S… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…jl:411 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…cks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:59 kwcall(::@NamedTuple{active_s… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:591 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:30 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:44 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…th.jl:38 -(A::Vector{Float64}, B::V… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…th.jl:13 _broadcast_preserving_zer… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:3622 map(f::typeof(-), it::… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:843 collect(itr::Base.Gene… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:869 collect_to_with_first… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:914 collect_to!(dest::Ve… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:45 iterate(g::Base.Gene… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:430 iterate(z::Base.It… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:439 _zip_iterate_all(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:447 _zip_iterate_som… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1242 iterate(A::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ay.jl:1250 _iterate_abstr… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:1040 getindex(A::Ve… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:42 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…jl:483 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:108 compute_extreme_point(tlmo::B… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:24 kwcall(::@NamedTuple{kwargs:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:358 _optimize_and_return(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:16 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:21458 SCIPsolve(scip::SCIP.O… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ants.jl:226 solve_frank_wolfe(frank_wolfe_… ╎ ╎ ╎ ╎ 1 @Boscia/…onobo.jl:85 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 1 @Base/array.jl:843 collect(itr::Base.Generator{DataSt… ╎ ╎ ╎ ╎ 1 @Base/array.jl:869 collect_to_with_first!(dest::Vect… ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:914 collect_to!(dest::Vector{Float64… ╎ ╎ ╎ ╎ ╎ 1 @Base/…erator.jl:45 iterate(g::Base.Generator{Data… ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:425 iterate(pq::DataStructures.… ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:324 popfirst!(pq::DataStructur… ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:177 percolate_down!(pq::DataS… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…als.jl:1040 getindex(A::Vector{Pair{Int… ╎ ╎ ╎ ╎ 1 @Boscia/…onobo.jl:98 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:232 (::Boscia.var"#callback#build_bn… ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:298 (::Boscia.var"#callback#build_b… ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:843 collect(itr::Base.Generator{Data… ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:869 collect_to_with_first!(dest::Ve… ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:914 collect_to!(dest::Vector{Float… ╎ ╎ ╎ ╎ ╎ 1 @Base/…rator.jl:45 iterate(g::Base.Generator{Dat… ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:425 iterate(pq::DataStructure… ╎ ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:324 popfirst!(pq::DataStruct… ╎ ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:177 percolate_down!(pq::Dat… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1039 getindex(A::Vector{Pair{In… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:391 checkbounds(A::Vector{Pair… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:387 checkbounds(::Type{Bool},… ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 25.13034191110087 Dual Gap (relative): 0.12862153351269345 Search Statistics. Total number of nodes processed: 1689 Total number of lmo calls: 25392 Total time (s): 60.286 LMO calls / sec: 421.1923166240918 Nodes / sec: 28.016454898318017 LMO calls / node: 15.033747779751332 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2241 Local tightenings / node: 1.87 Total number of potential local tightenings: 5567 Number of alternative decisions: 543 Number of stable decisions: 301 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.390000e-01 5.565863e+00 476 67 64 4885 42 8 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 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:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 jl_apply at /source/src/julia.h:2389:12 [inlined] start_task at /source/src/task.c:1276:19 unknown function (ip: (nil)) at (unknown file) * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.762000e+00 1.484432e+01 93 38 678 489 25 9 ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 4.333000e+00 1.453958e+01 168 76 968 257 18 16 ┌ 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 0x0000770578d56770 Total snapshots: 412. Utilization: 0% ╎412 @Base/task.jl:1170 wait_forever() 411╎ 412 @Base/task.jl:1248 wait() 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 9.816000e+00 2.047677e+01 16 7 2918 60 18 11 [71] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:133 macro expansion at ./simdloop.jl:75:0 [inlined] dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1048:0 (pc: 227) unknown function (ip: 0x78922811e031) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 f at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:45:0 (pc: 260) #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:427:0 (pc: 2049) unknown function (ip: 0x78923b945625) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:0 (pc: 49) #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208:0 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188:0 (pc: 28) unknown function (ip: 0x78923b931d67) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373:0 (pc: 1359) #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:0 (pc: 235) optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:0 (pc: 5) unknown function (ip: 0x78923b90d8ba) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:0 (pc: 1550) unknown function (ip: 0x78923b90ab69) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:0 (pc: 3) #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:0 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:0 (pc: 8) unknown function (ip: 0x78923b90346c) at (unknown file) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 jl_apply at /source/src/julia.h:2389:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:522:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 207) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:326:0 (pc: 1) IncludeInto at ./Base.jl:327:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 jl_apply at /source/src/julia.h:2389:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:522:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 207) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:326:0 (pc: 1) IncludeInto at ./Base.jl:327:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 jl_apply at /source/src/julia.h:2389:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:522:0 (pc: 1) exec_options at ./client.jl:321:0 (pc: 425) _start at ./client.jl:596:0 (pc: 294) jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4380:23 [inlined] ijl_apply_generic at /source/src/gf.c:4618:12 jl_apply at /source/src/julia.h:2389:12 [inlined] true_main at /source/src/jlapi.c:971:29 jl_repl_entrypoint at /source/src/jlapi.c:1138:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x7892bdda8249) 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: 4067716643 (Pool: 4067713089; Big: 3554); GC: 1536 PkgEval terminated after 2732.09s: test duration exceeded the time limit