Package evaluation to test Boscia on Julia 1.14.0-DEV.2172 (32456e37ae*) started at 2026-05-12T18:58:58.705 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 14.93s ################################################################################ # 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.4 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.3.3 [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.5.2 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.7.1 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.4 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.7.2 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.1 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.1+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 6.2s ################################################################################ # 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:429 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.5 s ? GenericLinearAlgebra 1.9 s ✓ Bonobo 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/dMOXI/src/DoubleFloats.jl:45  [12] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [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:3271  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [17] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:350  [19] _start()  @ Base ./client.jl:593 in expression starting at /home/pkgeval/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:1 in expression starting at stdin:5 ✗ DoubleFloats 2.4 s ✓ Ipopt_jll 14.6 s ✓ MathOptSetDistances 6.8 s ✓ SCIP_PaPILO_jll 2.8 s ✓ SCIP_jll 19.4 s ✓ Boscia 27.1 s ✓ SCIP 15.0 s ✓ Boscia → BosciaHiGHSExt 29.0 s ✓ CombinatorialLinearOracles 19.8 s ✓ Boscia → BosciaSCIPExt 10 dependencies successfully precompiled in 147 seconds. 166 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:429 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 177.81s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_ZHmlh4/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.125 [497a8b3b] DoubleFloats v1.7.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.23.0 [b8f27783] MathOptInterface v1.51.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_ZHmlh4/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [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.4 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.125 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.7.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.3 [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.5.2 [4076af6c] JuMP v1.30.1 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.51.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.7.1 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.4 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.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.9 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.2 [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.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.8.1 [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+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.19.0+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.9+0 [1317d2d5] oneTBB_jll v2022.3.0+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.1+0 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.3+0 [29816b5a] LibSSH2_jll v1.11.101+0 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2026.3.19 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.6+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 = 0x6cf6ba374cb6b655 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 = 0xb8794138bc600568 LMO Tests seed = 0x555ccb758759d63e 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 = 0x61f8f2f48095302f Heuristics Tests seed = 0xb11f16dffef3cef9 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 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 = 0x834c836ec34dd2b5 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.418163e+00 1.613834e+00 1.956707e-01 1.379747e-01 2.222400e+01 1.349892e-01 9372 42 15 15 7 1 45 8 1.605194e+00 1.613834e+00 8.639421e-03 5.382165e-03 2.670900e+01 1.984350e+00 5 3 214 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.036108e+00 -1.904847e+00 7.940955e+00 0.000000e+00 Inf 1 LD 2 1.613834e+00 1.613834e+00 0.000000e+00 2.120516e+00 9.431666e-01 1 Last 2 1.613834e+00 1.613834e+00 0.000000e+00 2.267065e+00 8.821981e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.613834e+00 1.613834e+00 0.000000e+00 2.270230e+00 8.809682e-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.6138338689870548 Dual Bound: 1.605194448160235 Dual Gap (relative): 0.005382164657198894 Search Statistics. Total number of nodes processed: 53 Total number of lmo calls: 219 Total time (s): 31.553 LMO calls / sec: 6.940702944252528 Nodes / sec: 1.6797134979241277 LMO calls / node: 4.132075471698113 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 90 Local tightenings / node: 2.0 Total number of potential local tightenings: 130 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.055835e+00 2.597322e+00 1.541487e+00 1.459969e+00 2.006700e+01 1.494992e-01 9591 200 46 107 33 1 * 3 4 1.076085e+00 2.571508e+00 1.495423e+00 1.389689e+00 2.031800e+01 3.445221e-01 93 64 92 34 18 0 100 55 1.910227e+00 2.571508e+00 6.612801e-01 3.461787e-01 2.637200e+01 5.877446e+00 20 13 1242 19 16 1 200 55 1.982952e+00 2.571508e+00 5.885551e-01 2.968075e-01 2.832800e+01 9.001694e+00 29 19 1656 24 17 4 300 55 2.031771e+00 2.571508e+00 5.397369e-01 2.656486e-01 3.036600e+01 1.169071e+01 27 19 2100 22 11 0 400 55 2.073816e+00 2.571508e+00 4.976919e-01 2.399885e-01 3.243700e+01 1.402719e+01 22 15 2563 25 13 1 500 55 2.115505e+00 2.571508e+00 4.560022e-01 2.155524e-01 3.459500e+01 1.604278e+01 23 14 3051 29 16 3 600 55 2.156473e+00 2.571508e+00 4.150350e-01 1.924601e-01 3.691600e+01 1.774298e+01 30 19 3601 39 15 3 700 55 2.190450e+00 2.571508e+00 3.810577e-01 1.739632e-01 3.946600e+01 1.913039e+01 16 11 4226 9 4 0 800 55 2.226457e+00 2.571508e+00 3.450508e-01 1.549775e-01 4.195700e+01 2.037801e+01 37 22 4839 52 16 8 900 55 2.273796e+00 2.571508e+00 2.977116e-01 1.309315e-01 4.437900e+01 2.151919e+01 34 20 5445 44 15 4 1000 55 2.333937e+00 2.571508e+00 2.375709e-01 1.017898e-01 4.663400e+01 2.262298e+01 29 19 6038 21 3 0 1100 51 2.418308e+00 2.571508e+00 1.531998e-01 6.335000e-02 4.864000e+01 2.366365e+01 38 24 6599 37 8 0 1179 16 2.546518e+00 2.571508e+00 2.498972e-02 9.813290e-03 5.007300e+01 2.386516e+01 13 8 7024 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.498155e+00 -6.270638e-01 7.125219e+00 0.000000e+00 Inf 1 LD 2 2.571508e+00 2.571508e+00 0.000000e+00 1.507386e-01 1.326800e+01 1 Last 2 2.571508e+00 2.571508e+00 0.000000e+00 3.007496e-01 6.650050e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.571508e+00 2.571508e+00 0.000000e+00 3.066292e-01 6.522535e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.5715075176150024 Dual Bound: 2.546517800347069 Dual Gap (relative): 0.009813289844087211 Search Statistics. Total number of nodes processed: 1195 Total number of lmo calls: 7029 Total time (s): 53.043 LMO calls / sec: 132.5151292347718 Nodes / sec: 22.52889165394114 LMO calls / node: 5.882008368200837 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: 19 Non zero entries: 10th entry: 0.1674592826401159 38th entry: 0.1674592826401159 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.169615e+00 2.597322e+00 1.427706e+00 1.220663e+00 2.810000e-01 1.067616e+01 274 205 46 107 33 1 * 3 4 1.187629e+00 2.571508e+00 1.383878e+00 1.165244e+00 5.780000e-01 1.211073e+01 82 58 92 34 18 0 100 31 1.967505e+00 2.571508e+00 6.040025e-01 3.069891e-01 6.050000e+00 2.165289e+01 19 12 1212 20 17 1 200 27 2.087810e+00 2.571508e+00 4.836979e-01 2.316772e-01 8.909000e+00 2.547985e+01 23 15 1828 27 17 4 300 27 2.183756e+00 2.571508e+00 3.877513e-01 1.775616e-01 1.232900e+01 2.652283e+01 26 16 2569 33 11 2 400 27 2.261575e+00 2.571508e+00 3.099322e-01 1.370426e-01 1.633400e+01 2.614179e+01 31 19 3438 44 17 8 500 27 2.360854e+00 2.571508e+00 2.106535e-01 8.922769e-02 2.034900e+01 2.589808e+01 21 14 4315 13 5 1 597 7 2.546200e+00 2.571508e+00 2.530742e-02 9.939288e-03 2.362300e+01 2.556830e+01 32 20 5109 25 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.498155e+00 -6.270638e-01 7.125219e+00 0.000000e+00 Inf 1 LD 2 2.571508e+00 2.571508e+00 0.000000e+00 1.448736e-03 1.380514e+03 1 Last 2 2.571508e+00 2.571508e+00 0.000000e+00 7.978174e-03 2.506839e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.571508e+00 2.571508e+00 0.000000e+00 1.133298e-02 1.764761e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.5715075176150024 Dual Bound: 2.5462001024376772 Dual Gap (relative): 0.009939287628296134 Search Statistics. Total number of nodes processed: 604 Total number of lmo calls: 5114 Total time (s): 23.647 LMO calls / sec: 216.26421956273524 Nodes / sec: 25.542352095403224 LMO calls / node: 8.466887417218542 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 Poisson Tests seed = 0x3622231609542344 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 -6.580634e+02 -6.246241e+02 3.343933e+01 5.353513e-02 2.637600e+01 1.137398e-01 14677 132 53 2536 30 9 * 2 3 -6.580634e+02 -6.382187e+02 1.984475e+01 3.109396e-02 3.048600e+01 1.640097e-01 4103 115 96 2733 31 24 * 10 11 -6.567344e+02 -6.395011e+02 1.723335e+01 2.694811e-02 5.018900e+01 4.184184e-01 2026 78 391 1351 31 22 * 12 13 -6.566737e+02 -6.410183e+02 1.565543e+01 2.442276e-02 5.438200e+01 4.597109e-01 1139 80 463 748 28 19 33 34 -6.558205e+02 -6.410183e+02 1.480220e+01 2.309170e-02 1.200040e+02 5.583147e-01 669 46 1233 404 17 16 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.029688e+03 -1.055650e+03 2.085338e+03 0.000000e+00 Inf 1 LD 2 -6.352233e+02 -6.902080e+02 5.498470e+01 1.603819e-01 1.247024e+01 2 LD 53 -6.446391e+02 -6.634687e+02 1.882960e+01 4.664565e-01 1.136226e+02 3 LD 70 -6.459738e+02 -6.547998e+02 8.826056e+00 4.911397e-01 1.425256e+02 4 LD 92 -6.480233e+02 -6.504306e+02 2.407367e+00 5.235167e-01 1.757346e+02 5 LD 152 -6.482121e+02 -6.491567e+02 9.445882e-01 6.009257e-01 2.529431e+02 7 LD 234 -6.482489e+02 -6.486641e+02 4.152198e-01 7.762036e-01 3.014673e+02 9 LD 275 -6.482533e+02 -6.483235e+02 7.016291e-02 8.202170e-01 3.352771e+02 10 LD 342 -6.482538e+02 -6.482741e+02 2.028504e-02 8.810741e-01 3.881626e+02 10 LD 395 -6.482538e+02 -6.482594e+02 5.546184e-03 9.326986e-01 4.235023e+02 10 LD 458 -6.482538e+02 -6.482553e+02 1.456087e-03 1.000925e+00 4.575766e+02 10 LD 521 -6.482538e+02 -6.482543e+02 4.137907e-04 1.058162e+00 4.923632e+02 10 LD 592 -6.482538e+02 -6.482540e+02 1.248650e-04 1.120293e+00 5.284333e+02 10 LD 653 -6.482538e+02 -6.482539e+02 2.491710e-05 1.173065e+00 5.566613e+02 10 LD 719 -6.482538e+02 -6.482539e+02 4.114793e-06 1.228777e+00 5.851348e+02 10 P 1000 -6.482538e+02 -6.482539e+02 4.114793e-06 1.459004e+00 6.853992e+02 10 P 2000 -6.482538e+02 -6.482539e+02 4.114793e-06 2.353784e+00 8.496955e+02 10 P 3000 -6.482538e+02 -6.482539e+02 4.114793e-06 3.119922e+00 9.615624e+02 10 P 4000 -6.482538e+02 -6.482539e+02 4.114793e-06 3.854476e+00 1.037755e+03 10 P 5000 -6.482538e+02 -6.482539e+02 4.114793e-06 4.584733e+00 1.090576e+03 10 P 6000 -6.482538e+02 -6.482539e+02 4.114793e-06 5.315515e+00 1.128771e+03 10 P 7000 -6.482538e+02 -6.482539e+02 4.114793e-06 6.068311e+00 1.153534e+03 10 P 8000 -6.482538e+02 -6.482539e+02 4.114793e-06 6.785257e+00 1.179027e+03 10 P 9000 -6.482538e+02 -6.482539e+02 4.114793e-06 7.528661e+00 1.195432e+03 10 P 10000 -6.482538e+02 -6.482539e+02 4.114793e-06 8.246161e+00 1.212685e+03 10 Last 10001 -6.482538e+02 -6.482539e+02 4.114793e-06 8.250611e+00 1.212153e+03 10 ---------------------------------------------------------------------------------------------------------------- PP 10001 -6.482538e+02 -6.482539e+02 4.847772e-06 8.253350e+00 1.211750e+03 10 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -648.2538483279276 Dual Bound: -655.8204690093727 Dual Gap (relative): 0.011672311241903231 Search Statistics. Total number of nodes processed: 67 Total number of lmo calls: 1261 Total time (s): 130.936 LMO calls / sec: 9.630659253375695 Nodes / sec: 0.511700372701167 LMO calls / node: 18.82089552238806 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 -5.665879e+02 -5.647949e+02 1.792968e+00 3.174548e-03 2.485700e+01 1.206903e-01 9785 87 19 46 7 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -2.905003e+02 -5.948190e+02 3.043186e+02 0.000000e+00 Inf 1 LD 2 -5.647949e+02 -5.647949e+02 0.000000e+00 1.542987e-01 1.296187e+01 1 Last 2 -5.647949e+02 -5.647949e+02 0.000000e+00 3.123608e-01 6.402852e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -5.647949e+02 -5.647949e+02 0.000000e+00 3.161045e-01 6.327021e+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: -564.7948859854574 Dual Bound: -566.587854236574 Dual Gap (relative): 0.0031745476023356603 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 24 Total time (s): 27.859 LMO calls / sec: 0.8614810294698302 Nodes / sec: 0.10768512868372877 LMO calls / node: 8.0 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.718372e+02 3.358068e+02 1.639696e+02 9.542146e-01 2.232700e+01 1.343665e-01 10841 113 23 56 12 0 * 37 38 2.425672e+02 3.311609e+02 8.859365e+01 3.652334e-01 2.791900e+01 2.686343e+00 100 47 612 38 6 1 100 99 2.681816e+02 3.311609e+02 6.297927e+01 2.348382e-01 3.583300e+01 5.553540e+00 119 46 1492 37 5 2 200 183 2.918976e+02 3.311609e+02 3.926328e+01 1.345105e-01 4.516400e+01 8.480205e+00 63 29 2677 26 4 0 300 211 3.070046e+02 3.311609e+02 2.415622e+01 7.868358e-02 5.086300e+01 1.004660e+01 38 18 3472 14 4 0 400 169 3.168623e+02 3.311609e+02 1.429855e+01 4.512544e-02 5.428200e+01 1.048230e+01 123 53 4023 58 5 1 500 101 3.246603e+02 3.311609e+02 6.500529e+00 2.002255e-02 6.248100e+01 9.618924e+00 6 4 4449 0 0 0 * 505 94 3.248114e+02 3.310830e+02 6.271597e+00 1.930843e-02 6.260600e+01 9.599719e+00 15 8 4463 2 0 0 547 54 3.280034e+02 3.310830e+02 3.079515e+00 9.388666e-03 6.363800e+01 9.475471e+00 35 18 4622 9 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.311609e+02 3.249480e+02 6.212894e+00 0.000000e+00 Inf 1 LD 2 3.310830e+02 3.310830e+02 8.439702e-08 1.649391e-01 1.212569e+01 2 Last 2 3.310830e+02 3.310830e+02 8.439702e-08 3.329637e-01 6.006661e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.310830e+02 3.310830e+02 8.439702e-08 3.369907e-01 5.934881e+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: 331.0829629077685 Dual Bound: 328.00344796512286 Dual Gap (relative): 0.009388666374547015 Search Statistics. Total number of nodes processed: 603 Total number of lmo calls: 4627 Total time (s): 66.875 LMO calls / sec: 69.18878504672897 Nodes / sec: 9.016822429906542 LMO calls / node: 7.673300165837479 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.718372e+02 3.358068e+02 1.639696e+02 9.542146e-01 2.702900e+01 1.109919e-01 10888 113 23 56 12 0 * 6 7 1.927002e+02 3.311609e+02 1.384607e+02 7.185294e-01 3.272300e+01 3.972741e-01 126 69 113 40 12 2 100 97 2.744023e+02 3.311609e+02 5.675855e+01 2.068443e-01 1.066340e+02 1.847441e+00 80 41 1505 31 5 1 200 159 2.959638e+02 3.311609e+02 3.519706e+01 1.189235e-01 1.569330e+02 2.287600e+00 38 21 2541 12 3 0 300 169 3.101461e+02 3.311609e+02 2.101477e+01 6.775764e-02 1.847240e+02 2.538923e+00 40 16 3211 16 0 0 * 348 157 3.155212e+02 3.310830e+02 1.556177e+01 4.932082e-02 1.936000e+02 2.608471e+00 14 8 3461 2 0 0 400 131 3.217853e+02 3.310830e+02 9.297652e+00 2.889396e-02 2.002350e+02 2.651884e+00 16 10 3688 2 0 0 489 60 3.278281e+02 3.310830e+02 3.254876e+00 9.928605e-03 2.051790e+02 2.675712e+00 6 4 3972 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.311609e+02 3.249480e+02 6.212894e+00 0.000000e+00 Inf 1 LD 2 3.310830e+02 3.310830e+02 8.439702e-08 1.720782e-01 1.162262e+01 2 Last 2 3.310830e+02 3.310830e+02 8.439702e-08 3.435121e-01 5.822211e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.310830e+02 3.310830e+02 8.439702e-08 3.475325e-01 5.754857e+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: 331.0829629077685 Dual Bound: 327.8280872476854 Dual Gap (relative): 0.009928605225408635 Search Statistics. Total number of nodes processed: 549 Total number of lmo calls: 3977 Total time (s): 208.578 LMO calls / sec: 19.067207471545416 Nodes / sec: 2.632108851364957 LMO calls / node: 7.24408014571949 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 = 0x97ca87c621728312 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 -5.683925e+02 -1.773847e+02 3.910078e+02 2.204293e+00 3.576000e+01 8.389262e-02 21862 8037 35 5360 10 11 * 2 3 -5.683925e+02 -5.647808e+02 3.611688e+00 6.394850e-03 3.926600e+01 1.273366e-01 3444 3435 41 62 9 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -564.7807940382413 Dual Bound: -568.3924825117952 Dual Gap (relative): 0.006394850022660815 Search Statistics. Total number of nodes processed: 5 Total number of lmo calls: 41 Total time (s): 40.541 LMO calls / sec: 1.0113218716854544 Nodes / sec: 0.12333193557139686 LMO calls / node: 8.2 Total number of global tightenings: 8 Global tightenings / node: 4.0 Total number of local tightenings: 8 Local tightenings / node: 4.0 Total number of potential local tightenings: 40 Time Limit Test seed = 0x46fdd7c0e8988090 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 -5.032980e-01 0.000000e+00 5.032980e-01 Inf 2.750600e+01 1.090671e-01 13947 68 29 1936 12 5 19 0 -1.025902e-02 0.000000e+00 1.025902e-02 Inf 2.794800e+01 6.798340e-01 3 1 195 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: -0.010259020182856673 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 19 Total number of lmo calls: 195 Total time (s): 29.31 LMO calls / sec: 6.653019447287615 Nodes / sec: 0.6482429205049471 LMO calls / node: 10.263157894736842 Total number of global tightenings: 6 Global tightenings / node: 0.32 Total number of local tightenings: 20 Local tightenings / node: 1.05 Total number of potential local tightenings: 23 Strong Convexity and Sharpness Tests seed = 0x7b7d65a33e5baf03 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 2.042310e+02 2.044623e+02 2.313443e-01 1.132758e-03 1.950300e+01 1.538225e-01 8783 0 13 23 3 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 204.46229938755 Dual Bound: 204.23095511832972 Dual Gap (relative): 0.0011327581026403847 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 20.6 LMO calls / sec: 0.6310679611650485 Nodes / sec: 0.14563106796116504 LMO calls / node: 4.333333333333333 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 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 1.931949e+02 1.935573e+02 3.623814e-01 1.875729e-03 1.821000e+01 1.647446e-01 8296 0 11 11 4 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 193.5573270276101 Dual Bound: 193.19494558283216 Dual Gap (relative): 0.0018757294280381761 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 19.244 LMO calls / sec: 0.5716067345666181 Nodes / sec: 0.15589274579089588 LMO calls / node: 3.6666666666666665 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: 16 Branching Strategy Tests seed = 0x5f120dbc869b71e5 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 1.871600e+01 1.602907e-01 8975 41 48 3749 24 11 ====================================================================================== 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 53 running 1 of 1 signal (10): User defined signal 1 unknown function (ip: 0x7353703ffc05) at /source/cli/trampolines/trampolines_x86_64.S __gmpq_init at /opt/julia/bin/../lib/julia/libgmp.so.10 (unknown line) _ZN6soplex10SoPlexBaseIdEC1Ev at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpiCreate at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpCreate at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPtransformProb at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPpresolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:21458:9 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/wrapper.jl:16:1 [inlined] optimize! at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:427:27 _optimize_and_return at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:358:4 #compute_extreme_point#108 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:43:69 compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:24:3 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:116:59 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:108:4 [inlined] #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:291:649 unknown function (ip: 0x7352f873ede5) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:177 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188:103 unknown function (ip: 0x7352f872b7c7) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373:595 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:16 optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:25 unknown function (ip: 0x7352f870709a) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:693 unknown function (ip: 0x7352f87043c9) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:15 #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:12 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:15 unknown function (ip: 0x7352f86fcdac) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 jl_apply at /source/src/julia.h:2328: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:693:13 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884: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:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 jl_apply at /source/src/julia.h:2328: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:693:13 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884: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:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 jl_apply at /source/src/julia.h:2328: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:693:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884: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:517:3 exec_options at ./client.jl:318:353 _start at ./client.jl:593:35 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 jl_apply at /source/src/julia.h:2328: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: 0x735370437249) 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 ============================================================== 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.071100e+01 3.138429e+00 8 5 953 27 3 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 Solution Statistics.Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x0000735355bfc010 Total snapshots: 28. Utilization: 100% ╎26 @Base/client.jl:593 _start() ╎ 26 @Base/client.jl:318 exec_options(opts::Base.JLOptions) ╎ 26 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ 26 @Base/Base.jl:328 (::Base.IncludeInto)(fname::String) ╎ 26 @Base/Base.jl:327 include(mapexpr::Function, mod::Module, _path::Str… ╎ 26 @Base/loading.jl:3173 _include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 26 @Base/loading.jl:3113 include_string(mapexpr::typeof(identity), mo… ╎ ╎ 26 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ 26 @Base/Base.jl:328 (::Base.IncludeInto)(fname::String) ╎ ╎ 26 @Base/Base.jl:327 include(mapexpr::Function, mod::Module, _path… ╎ ╎ 26 @Base/loading.jl:3173 _include(mapexpr::Function, mod::Module,… ╎ ╎ ╎ 26 @Base/loading.jl:3113 include_string(mapexpr::typeof(identity… ╎ ╎ ╎ 26 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ ╎ 26 @Boscia/…_oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 26 @Boscia/…oracle.jl:834 #solve#147 ╎ ╎ ╎ 26 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ ╎ 26 @Boscia/…erface.jl:269 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 26 @Boscia/…bonobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 26 @Boscia/…onobo.jl:36 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 26 @Boscia/…node.jl:373 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 26 @Boscia/…ants.jl:188 kwcall(::@NamedTuple{epsilon::F… ╎ ╎ ╎ ╎ ╎ 26 @Boscia/…ants.jl:208 #solve_frank_wolfe#7 ╎ ╎ ╎ ╎ ╎ 26 @FrankWolfe/….jl:76 kwcall(::@NamedTuple{line_sear… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:130 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:455 getindex(A::Vector{Float64}… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…xt.jl:49 _getindex(l::IndexLinear, A… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:208 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…est.jl:50 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:292 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/…:732 gemv!(y::Vector{Float6… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:680 gemv!(trans::Char, al… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:467 perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:494 + ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…jl:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…cks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…ks.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…e.jl:591 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:28 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…nce.jl:25 iterate(A::Vector{Ptr{Noth… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:843 iterate(A::Vector{Ptr{Not… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:866 collect_to_with_first!(d… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:30 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1048 dot(x::Vector{Float6… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:494 + ╎ ╎ ╎ ╎ ╎ 19 @FrankWolfe/…jl:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 19 @Boscia/…mo.jl:108 storage_find_argmin_vertex(ve… ╎ ╎ ╎ ╎ ╎ 13 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 13 @FrankWolfe/…l:24 set(o::SCIP.Optimizer, ::Mat… ╎ ╎ ╎ ╎ ╎ ╎ 13 @FrankWolfe/…l:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 13 @FrankWolfe/…:358 _optimize_and_return(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 13 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 13 @SCIP/…er.jl:16 string(::String, ::String,… 12╎ ╎ ╎ ╎ ╎ ╎ ╎ 13 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:118 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…em.jl:94 set(o::SCIP.Optimizer, ::Mat… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:229 SCIPinfinity(scip::SCIP.Opt… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:234 is_linear_feasible(o::SCIP… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:253 is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…mo.jl:130 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…le.jl:455 getindex(A::Vector{Float64}… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…xt.jl:49 _getindex(l::IndexLinear, A… 5╎ ╎ ╎ ╎ ╎ ╎ 5 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:411 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 1 @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 promote_shape(a::Vector{F… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:3544 axes(A::Vector{Float64… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:843 map(f::typeof(Base.unc… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:869 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:918 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1048 setindex! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1053 _setindex! 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): 26.024 LMO calls / sec: 36.62004303719643 Nodes / sec: 2.497694435905318 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.470000e-01 8.645533e+00 215 38 48 3749 24 11 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457:34 wait at ./task.jl:1246:44 wait_forever at ./task.jl:1168:5 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 jl_apply at /source/src/julia.h:2328:12 [inlined] start_task at /source/src/task.c:1275:19 unknown function (ip: (nil)) at (unknown file) 87 0 7.016760e+00 7.382204e+00 3.654439e-01 5.208158e-02 1.966000e+00 4.425229e+01 3 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.967 LMO calls / sec: 516.0142348754448 Nodes / sec: 44.22979156075241 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 5.240000e-01 5.725191e+00 306 42 48 3749 24 11 ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x0000722089c69ff0 Total snapshots: 478. Utilization: 0% ╎478 @Base/task.jl:1168 wait_forever() 477╎ 478 @Base/task.jl:1246 wait() 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 2.892000e+00 2.040111e+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): 2.893 LMO calls / sec: 296.923608710681 Nodes / sec: 20.394054614586935 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.630000e-01 8.264463e+00 226 35 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.581000e+00 4.743833e+01 10 7 902 27 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.582 LMO calls / sec: 570.1643489254109 Nodes / sec: 47.40834386852086 LMO calls / node: 12.026666666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 54 Local tightenings / node: 0.74 Total number of potential local tightenings: 118 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Index FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.110000e-01 9.646302e+00 214 36 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.780000e+00 5.449438e+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.781 LMO calls / sec: 659.1802358225716 Nodes / sec: 54.463784390791695 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.410000e-01 6.802721e+00 438 54 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.560000e-01 1.190476e+01 76 28 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.730000e-01 1.260023e+01 115 33 217 944 28 30 [53] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:133 + at ./float.jl:494:2 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1049:1 [inlined] macro expansion at ./simdloop.jl:77:8 [inlined] dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1048:131 unknown function (ip: 0x7351e8f399b1) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 f at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:45:12 find_best_solution at /home/pkgeval/.julia/packages/Boscia/EgUlC/ext/BosciaSCIPExt.jl:30:33 unknown function (ip: 0x7352f874c1e2) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 find_best_solution at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:591:3 unknown function (ip: 0x7352f874b46d) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 #process_FW_callback_logic#37 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:97:362 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:59:21 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:24:15 unknown function (ip: 0x7352f87543b2) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:261:543 unknown function (ip: 0x7352f873ede5) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:177 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188:103 unknown function (ip: 0x7352f872b7c7) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373:595 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:16 optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:25 unknown function (ip: 0x7352f870709a) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:693 unknown function (ip: 0x7352f87043c9) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:15 #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:12 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:15 unknown function (ip: 0x7352f86fcdac) at (unknown file) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 jl_apply at /source/src/julia.h:2328: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:693:13 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884: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:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 jl_apply at /source/src/julia.h:2328: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:693:13 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884: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:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 jl_apply at /source/src/julia.h:2328: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:693:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884: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:517:3 exec_options at ./client.jl:318:353 _start at ./client.jl:593:35 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4125:23 [inlined] ijl_apply_generic at /source/src/gf.c:4351:12 jl_apply at /source/src/julia.h:2328: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: 0x735370437249) 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: 4702467630 (Pool: 4702464139; Big: 3491); GC: 1659 PkgEval terminated after 2724.23s: test duration exceeded the time limit