Package evaluation to test Boscia on Julia 1.14.0-DEV.2168 (2569364ac4*) started at 2026-05-10T18:55:51.663 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 14.85s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.11 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.11 [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.36s ################################################################################ # 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.0 s ? GenericLinearAlgebra 1.6 s ✓ Bonobo 17.9 s ✓ LEMONGraphs 13.5 s ✓ MathOptSetDistances 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 31.1 s ✓ GraphsMatching 17.1 s ✓ Boscia 15.1 s ✓ Boscia → BosciaHiGHSExt 18.7 s ✓ Boscia → BosciaSCIPExt 22.1 s ✓ CombinatorialLinearOracles 8 dependencies successfully precompiled in 147 seconds. 168 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.74s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_p4WNEU/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.11 [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_p4WNEU/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.11 [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.4+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.0.0+1 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [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.19.0+0 [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 = 0x195685a0421fcdda WARNING: Use of Boscia.CubeSimpleBLMO is deprecated, use CubeLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/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 = OPT_TREE_EMPTY WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/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 = OPT_TREE_EMPTY Callback Tests seed = 0xfd968206274dba70 LMO Tests seed = 0xb99e7d97fc8becae WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/LMO_test.jl:218 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/LMO_test.jl:254 Indicator Tests seed = 0x89a55f459586aa14 Heuristics Tests seed = 0xdd6bcd714cdc7034 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:124 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:193 Sparse Regression Tests seed = 0xcff4dec478648052 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.503904e+00 2.622639e+00 1.187352e-01 4.742002e-02 2.385200e+01 1.257756e-01 9907 44 15 16 7 1 13 4 2.609116e+00 2.622639e+00 1.352322e-02 5.183065e-03 2.801600e+01 6.067961e-01 5 3 67 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.678354e+00 -1.717183e-01 7.850073e+00 0.000000e+00 Inf 1 LD 2 2.622639e+00 2.622639e+00 0.000000e+00 2.349082e+00 8.513963e-01 1 Last 2 2.622639e+00 2.622639e+00 0.000000e+00 2.522804e+00 7.927687e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.622639e+00 2.622639e+00 0.000000e+00 2.526507e+00 7.916069e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.622639227322634 Dual Bound: 2.6091160081625437 Dual Gap (relative): 0.005183065497196464 Search Statistics. Total number of nodes processed: 17 Total number of lmo calls: 72 Total time (s): 33.353 LMO calls / sec: 2.1587263514526427 Nodes / sec: 0.5096992774263185 LMO calls / node: 4.235294117647059 Total number of global tightenings: 43 Global tightenings / node: 3.31 Total number of local tightenings: 48 Local tightenings / node: 3.69 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 9.823868e-01 1.087284e+00 1.048971e-01 1.067778e-01 2.128700e+01 1.409311e-01 10128 91 19 43 10 1 * 3 4 1.014799e+00 1.071501e+00 5.670249e-02 5.587559e-02 2.141000e+01 3.269500e-01 30 21 39 14 6 1 17 4 1.062070e+00 1.071501e+00 9.431521e-03 8.880321e-03 2.194400e+01 9.569814e-01 22 15 110 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 5.110339e+00 -1.232745e+00 6.343085e+00 0.000000e+00 Inf 1 LD 2 1.071501e+00 1.071501e+00 0.000000e+00 1.625778e-01 1.230180e+01 1 Last 2 1.071501e+00 1.071501e+00 0.000000e+00 3.274800e-01 6.107243e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.071501e+00 1.071501e+00 0.000000e+00 3.306914e-01 6.047935e+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: 1.0715014031173817 Dual Bound: 1.0620698817201741 Dual Gap (relative): 0.008880320927594613 Search Statistics. Total number of nodes processed: 21 Total number of lmo calls: 115 Total time (s): 24.954 LMO calls / sec: 4.608479602468542 Nodes / sec: 0.8415484491464295 LMO calls / node: 5.476190476190476 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 Non zero entries: 25th entry: 0.18169631037561182 50th entry: 0.18169631037561182 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.016421e+00 1.087284e+00 7.086291e-02 6.971807e-02 1.250000e-01 2.400000e+01 118 89 19 43 10 1 * 3 4 1.038142e+00 1.071501e+00 3.335966e-02 3.213401e-02 2.430000e-01 2.880658e+01 31 21 39 14 6 1 12 1 1.069529e+00 1.071501e+00 1.972046e-03 1.843845e-03 4.650000e-01 2.795699e+01 6 4 82 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.110339e+00 -1.232745e+00 6.343085e+00 0.000000e+00 Inf 1 LD 2 1.071501e+00 1.071501e+00 0.000000e+00 1.054120e-03 1.897317e+03 1 Last 2 1.071501e+00 1.071501e+00 0.000000e+00 6.578438e-03 3.040235e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.071501e+00 1.071501e+00 0.000000e+00 9.482540e-03 2.109140e+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: 1.0715014031173817 Dual Bound: 1.069529356647708 Dual Gap (relative): 0.0018438451057153369 Search Statistics. Total number of nodes processed: 13 Total number of lmo calls: 87 Total time (s): 0.485 LMO calls / sec: 179.3814432989691 Nodes / sec: 26.804123711340207 LMO calls / node: 6.6923076923076925 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Poisson Tests seed = 0x99c5fdb49505e52e Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -2.320121e+02 -2.053531e+02 2.665906e+01 1.298206e-01 2.291800e+01 1.309015e-01 11646 111 44 726 29 2 * 2 3 -2.320121e+02 -2.146760e+02 1.733616e+01 8.075500e-02 2.386700e+01 2.094943e-01 943 80 76 560 27 4 * 29 30 -2.316736e+02 -2.168324e+02 1.484119e+01 6.844543e-02 8.665700e+01 6.808452e-01 2325 100 1080 1603 35 13 42 43 -2.314634e+02 -2.168324e+02 1.463094e+01 6.747581e-02 1.200040e+02 7.083097e-01 1426 67 1541 951 31 8 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.538404e+02 -4.798008e+02 9.336412e+02 0.000000e+00 Inf 1 LD 2 -2.219227e+02 -2.434227e+02 2.149994e+01 1.783983e-01 1.121087e+01 2 LD 43 -2.252315e+02 -2.347411e+02 9.509637e+00 5.002098e-01 8.596393e+01 4 LD 98 -2.263931e+02 -2.308371e+02 4.443958e+00 5.808968e-01 1.687047e+02 5 LD 103 -2.267921e+02 -2.286555e+02 1.863333e+00 5.936542e-01 1.735017e+02 6 LD 143 -2.268485e+02 -2.276651e+02 8.165811e-01 7.273471e-01 1.966049e+02 7 LD 209 -2.268718e+02 -2.272452e+02 3.733188e-01 8.041958e-01 2.598870e+02 7 LD 265 -2.268796e+02 -2.269721e+02 9.248447e-02 8.746794e-01 3.029682e+02 9 LD 334 -2.268803e+02 -2.269216e+02 4.125294e-02 9.525349e-01 3.506433e+02 10 LD 363 -2.268803e+02 -2.269002e+02 1.982046e-02 9.898132e-01 3.667359e+02 10 LD 411 -2.268804e+02 -2.268848e+02 4.463717e-03 1.053371e+00 3.901761e+02 11 LD 517 -2.268804e+02 -2.268818e+02 1.415814e-03 1.176564e+00 4.394151e+02 12 LD 638 -2.268804e+02 -2.268808e+02 4.286813e-04 1.291987e+00 4.938131e+02 12 LD 747 -2.268804e+02 -2.268805e+02 1.000044e-04 1.394595e+00 5.356393e+02 12 LD 882 -2.268804e+02 -2.268804e+02 1.937201e-05 1.533741e+00 5.750645e+02 13 LD 963 -2.268804e+02 -2.268804e+02 6.859576e-06 1.734473e+00 5.552119e+02 14 P 1000 -2.268804e+02 -2.268804e+02 6.859576e-06 1.764011e+00 5.668900e+02 14 LD 1035 -2.268804e+02 -2.268804e+02 1.766106e-06 1.848285e+00 5.599784e+02 14 P 2000 -2.268804e+02 -2.268804e+02 1.766106e-06 2.678085e+00 7.468022e+02 14 P 3000 -2.268804e+02 -2.268804e+02 1.766106e-06 3.516387e+00 8.531483e+02 14 P 4000 -2.268804e+02 -2.268804e+02 1.766106e-06 4.243843e+00 9.425420e+02 14 P 5000 -2.268804e+02 -2.268804e+02 1.766106e-06 4.995255e+00 1.000950e+03 14 P 6000 -2.268804e+02 -2.268804e+02 1.766106e-06 5.747180e+00 1.043990e+03 14 P 7000 -2.268804e+02 -2.268804e+02 1.766106e-06 6.487620e+00 1.078978e+03 14 P 8000 -2.268804e+02 -2.268804e+02 1.766106e-06 7.230292e+00 1.106456e+03 14 P 9000 -2.268804e+02 -2.268804e+02 1.766106e-06 7.997320e+00 1.125377e+03 14 P 10000 -2.268804e+02 -2.268804e+02 1.766106e-06 8.716792e+00 1.147211e+03 14 Last 10001 -2.268804e+02 -2.268804e+02 1.766106e-06 8.721477e+00 1.146709e+03 14 ---------------------------------------------------------------------------------------------------------------- PP 10001 -2.268804e+02 -2.268804e+02 2.344036e-06 8.724568e+00 1.146303e+03 14 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -226.88035916942542 Dual Bound: -231.46336302641632 Dual Gap (relative): 0.020200090804548182 Search Statistics. Total number of nodes processed: 85 Total number of lmo calls: 1575 Total time (s): 131.616 LMO calls / sec: 11.966630196936542 Nodes / sec: 0.6458181376124482 LMO calls / node: 18.529411764705884 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -2.240800e+02 -2.189941e+02 5.085980e+00 2.322428e-02 2.673800e+01 1.121999e-01 10657 177 36 189 19 4 * 2 3 -2.240800e+02 -2.196709e+02 4.409096e+00 2.007137e-02 2.778600e+01 1.799467e-01 98 49 46 35 20 4 * 5 6 -2.237998e+02 -2.209479e+02 2.851872e+00 1.290744e-02 3.108000e+01 3.539254e-01 249 90 118 111 18 3 7 8 -2.231447e+02 -2.209479e+02 2.196809e+00 9.942657e-03 3.323100e+01 4.513858e-01 230 80 157 124 16 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -1.259728e+02 -2.523364e+02 1.263636e+02 0.000000e+00 Inf 1 LD 2 -2.209479e+02 -2.209479e+02 0.000000e+00 1.627048e-01 1.229220e+01 1 Last 2 -2.209479e+02 -2.209479e+02 0.000000e+00 3.246066e-01 6.161305e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.209479e+02 -2.209479e+02 0.000000e+00 3.288226e-01 6.082307e+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: -220.94787866479334 Dual Bound: -223.14468754571743 Dual Gap (relative): 0.009942656585795694 Search Statistics. Total number of nodes processed: 15 Total number of lmo calls: 162 Total time (s): 36.336 LMO calls / sec: 4.458388375165126 Nodes / sec: 0.4128137384412153 LMO calls / node: 10.8 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 2.090450e+02 3.430418e+02 1.339968e+02 6.409950e-01 2.143100e+01 1.399841e-01 10340 128 26 100 12 1 91 8 3.397794e+02 3.430418e+02 3.262451e+00 9.601675e-03 3.158900e+01 3.134002e+00 38 21 974 8 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.430418e+02 3.430418e+02 0.000000e+00 8.661287e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.430418e+02 3.430418e+02 0.000000e+00 1.819166e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 343.04183277378206 Dual Bound: 339.77938148093585 Dual Gap (relative): 0.009601675294794942 Search Statistics. Total number of nodes processed: 99 Total number of lmo calls: 978 Total time (s): 34.551 LMO calls / sec: 28.305982460710254 Nodes / sec: 2.865329512893983 LMO calls / node: 9.878787878787879 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 2.090450e+02 3.430418e+02 1.339968e+02 6.409950e-01 2.608400e+01 1.150130e-01 10699 131 26 100 12 1 97 6 3.416649e+02 3.430418e+02 1.376964e+00 4.030160e-03 6.733700e+01 1.529620e+00 27 18 988 5 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.430418e+02 3.430418e+02 0.000000e+00 9.680868e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.430418e+02 3.430418e+02 0.000000e+00 1.771616e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 343.04183277378206 Dual Bound: 341.6648688000948 Dual Gap (relative): 0.0040301596664681725 Search Statistics. Total number of nodes processed: 103 Total number of lmo calls: 992 Total time (s): 70.432 LMO calls / sec: 14.08450704225352 Nodes / sec: 1.46240345297592 LMO calls / node: 9.631067961165048 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 = 0x1fa0c72be6ab0d2a 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.615760e+01 1.969337e+01 3.585097e+01 Inf 2.765000e+01 1.084991e-01 13825 132 49 10001 21 13 * 3 4 -1.499225e+01 1.521983e+01 3.021207e+01 Inf 2.803900e+01 2.496523e-01 236 144 111 1784 18 10 100 85 9.374903e-01 1.521983e+01 1.428234e+01 1.523465e+01 4.560100e+01 4.056929e+00 217 62 2708 3310 18 6 166 131 5.301198e+00 1.521983e+01 9.918628e+00 1.871016e+00 6.000300e+01 4.949753e+00 203 49 4472 3558 25 14 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 15.219826774140753 Dual Bound: 5.301198308906564 Dual Gap (relative): 1.8710163037232286 Search Statistics. Total number of nodes processed: 297 Total number of lmo calls: 4472 Total time (s): 61.177 LMO calls / sec: 73.0993674093205 Nodes / sec: 4.8547656799123855 LMO calls / node: 15.057239057239057 Total number of global tightenings: 18 Global tightenings / node: 0.11 Total number of local tightenings: 1126 Local tightenings / node: 6.78 Total number of potential local tightenings: 1678 Time Limit Test seed = 0xa65b30e0fd056bc2 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 -9.861113e+00 -9.646933e+00 2.141797e-01 2.220184e-02 2.325200e+01 1.290212e-01 11769 326 22 10001 8 5 17 18 -9.777083e+00 -9.646933e+00 1.301494e-01 1.349127e-02 3.009100e+01 1.163138e+00 318 279 308 1276 5 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -9.646933305533864 Dual Bound: -9.777082717816844 Dual Gap (relative): 0.01349127314981245 Search Statistics. Total number of nodes processed: 35 Total number of lmo calls: 308 Total time (s): 31.295 LMO calls / sec: 9.84182776801406 Nodes / sec: 1.1183895190925068 LMO calls / node: 8.8 Total number of global tightenings: 2 Global tightenings / node: 0.12 Total number of local tightenings: 22 Local tightenings / node: 1.29 Total number of potential local tightenings: 130 Strong Convexity and Sharpness Tests seed = 0xf38241064b6d724d WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:29 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/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.063906e+02 2.067804e+02 3.897972e-01 1.888638e-03 2.024200e+01 1.482067e-01 9044 1000 8 8 2 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 206.7804093400635 Dual Bound: 206.39061214272948 Dual Gap (relative): 0.0018886382151163674 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 8 Total time (s): 21.401 LMO calls / sec: 0.37381430774262886 Nodes / sec: 0.14018036540348583 LMO calls / node: 2.6666666666666665 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 18 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:135 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/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.681392e+02 1.682539e+02 1.147040e-01 6.821963e-04 2.163500e+01 1.386642e-01 9766 0 11 18 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 168.25394550581768 Dual Bound: 168.1392415398613 Dual Gap (relative): 0.0006821962850902179 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 22.864 LMO calls / sec: 0.4811056682995101 Nodes / sec: 0.1312106368089573 LMO calls / node: 3.6666666666666665 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 = 0x5124ee97738a0ed9 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.212000e+01 1.356239e-01 10696 49 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.366400e+01 2.746788e+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.789 LMO calls / sec: 38.44447133809351 Nodes / sec: 2.6221307838154018 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.560000e-01 8.426966e+00 233 39 48 3749 24 11 87 0 7.016760e+00 7.382204e+00 3.654439e-01 5.208158e-02 1.697000e+00 5.126694e+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.698 LMO calls / sec: 597.7620730270908 Nodes / sec: 51.236749116607776 LMO calls / node: 11.666666666666666 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 53 Local tightenings / node: 0.61 Total number of potential local tightenings: 108 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest most infeasible gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.490000e-01 8.595989e+00 226 38 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.549000e+00 3.808909e+01 4 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.55 LMO calls / sec: 554.1935483870967 Nodes / sec: 38.064516129032256 LMO calls / node: 14.559322033898304 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 77 Local tightenings / node: 1.35 Total number of potential local tightenings: 167 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Uniform Random Choice FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 4.070000e-01 7.371007e+00 242 42 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.757000e+00 4.268640e+01 12 7 902 27 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.758 LMO calls / sec: 513.0830489192264 Nodes / sec: 42.66211604095563 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 4.140000e-01 7.246377e+00 304 49 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 2.022000e+00 4.797230e+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): 2.023 LMO calls / sec: 580.3262481463173 Nodes / sec: 47.94859120118635 LMO calls / node: 12.103092783505154 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 82 Local tightenings / node: 0.88 Total number of potential local tightenings: 170 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.800000e-01 6.250000e+00 477 61 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.970000e-01 1.129235e+01 90 34 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.340000e-01 1.177730e+01 134 39 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.495000e+00 2.366098e+01 87 33 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.071000e+00 2.392239e+01 62 22 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.474500e+01 2.719566e+01 49 21 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.075100e+01 2.876970e+01 51 19 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.683200e+01 2.955426e+01 61 27 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.154000e+01 3.065948e+01 18 9 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.656400e+01 3.115086e+01 56 21 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.060700e+01 3.134927e+01 13 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.416200e+01 3.099950e+01 6 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.671500e+01 3.050412e+01 6 3 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.889100e+01 3.008734e+01 29 11 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.065800e+01 2.951163e+01 9 5 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.201700e+01 2.904820e+01 10 6 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.327100e+01 2.847703e+01 12 7 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.431800e+01 2.803859e+01 9 5 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.482700e+01 2.777828e+01 5 3 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 54.828 LMO calls / sec: 502.0245130225432 Nodes / sec: 27.777777777777775 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 1.959000e+00 1.531394e+00 484 64 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.273000e+00 3.959525e+00 90 35 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.403000e+00 4.577611e+00 128 38 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.943000e+00 2.021523e+01 80 28 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.047800e+01 2.071006e+01 59 19 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.647000e+01 2.410443e+01 85 25 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.122500e+01 2.643110e+01 40 17 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.562100e+01 2.782873e+01 24 14 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 2.928900e+01 2.898699e+01 45 19 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.288800e+01 3.001095e+01 21 12 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.588700e+01 3.079109e+01 8 5 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 3.904400e+01 3.127241e+01 6 4 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.179600e+01 3.146234e+01 9 6 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.430900e+01 3.166400e+01 12 7 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.617300e+01 3.164187e+01 8 5 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.797900e+01 3.165968e+01 7 4 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 4.933800e+01 3.196319e+01 9 6 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.073700e+01 3.194907e+01 13 8 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.205100e+01 3.187259e+01 11 6 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.306000e+01 3.164342e+01 6 4 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.321400e+01 3.155185e+01 15 9 26740 41 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.083355821757877 Dual Gap (relative): 0.009945008189894359 Search Statistics. Total number of nodes processed: 1679 Total number of lmo calls: 26740 Total time (s): 53.215 LMO calls / sec: 502.4898994644367 Nodes / sec: 31.551254345579252 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.570000e-01 5.385996e+00 489 62 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.322000e+00 9.833585e+00 106 35 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.299000e+00 2.047944e+01 54 21 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 8.812000e+00 2.280980e+01 64 22 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.486400e+01 2.697793e+01 66 25 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.031900e+01 2.928294e+01 45 23 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.500300e+01 3.059633e+01 17 10 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 2.972700e+01 3.131833e+01 68 28 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.494100e+01 3.093787e+01 40 15 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 3.849300e+01 3.140831e+01 43 18 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.213200e+01 3.168613e+01 6 4 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.517400e+01 3.198743e+01 49 21 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 4.818100e+01 3.194205e+01 36 17 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.087900e+01 3.197783e+01 6 4 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.290200e+01 3.188915e+01 11 7 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.500500e+01 3.183347e+01 31 14 26657 170 21 7 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.674400e+01 3.163330e+01 8 5 27751 16 0 0 1500 329 2.665304e+01 2.836265e+01 1.709610e+00 6.414315e-02 5.821800e+01 3.141640e+01 8 5 28707 8 0 0 1600 253 2.705726e+01 2.836265e+01 1.305388e+00 4.824539e-02 5.949000e+01 3.114809e+01 3 2 29538 6 0 0 1642 217 2.729822e+01 2.836265e+01 1.064422e+00 3.899235e-02 6.000200e+01 3.098230e+01 2 1 29887 1 9 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.29822309098876 Dual Gap (relative): 0.03899235239115568 Search Statistics. Total number of nodes processed: 1859 Total number of lmo calls: 29887 Total time (s): 60.004 LMO calls / sec: 498.08346110259316 Nodes / sec: 30.9812679154723 LMO calls / node: 16.076923076923077 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2604 Local tightenings / node: 1.59 Total number of potential local tightenings: 6102 Number of alternative decisions: 543 Number of stable decisions: 386 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.420000e-01 5.535055e+00 481 68 64 4885 42 8 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.615000e+00 1.567878e+01 92 32 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.262000e+00 1.931330e+01 55 25 968 257 18 16 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.648000e+00 2.628138e+01 14 7 2918 60 18 11 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.207300e+01 3.172368e+01 32 14 5197 153 24 5 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.648300e+01 3.439908e+01 23 12 7469 83 12 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.058700e+01 3.570214e+01 26 11 9610 131 23 5 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.508900e+01 3.639045e+01 43 20 11880 193 16 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 48 running 1 of 1 signal (10): User defined signal 1 int64hash at /source/src/support/hashing.c:36:9 bits_hash at /source/src/builtins.c:351:21 [inlined] immut_id_ at /source/src/builtins.c:453:16 objectid at ./runtime_internals.jl:899:3 [inlined] hash at ./hashing.jl:46:4 [inlined] hash at ./hashing.jl:40:3 [inlined] hashindex at ./dict.jl:129:8 [inlined] ht_keyindex at ./dict.jl:244:22 getindex at ./dict.jl:478:2 [inlined] var at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/scip_data.jl:181:5 [inlined] var at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:128:9 [inlined] #sol_values##0 at ./none (unknown line) [inlined] iterate at ./generator.jl:48:23 [inlined] collect_to! at ./array.jl:914:7 [inlined] collect_to_with_first! at ./array.jl:869:9 collect at ./array.jl:843:83 [inlined] sol_values at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/convenience.jl:25:7 [inlined] find_best_solution at /home/pkgeval/.julia/packages/Boscia/4nmmg/ext/BosciaSCIPExt.jl:28:30 unknown function (ip: 0x7dfdb6c50182) 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/4nmmg/src/MOI_bounded_oracle.jl:591:3 unknown function (ip: 0x7dfdb6c4f40d) 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/4nmmg/src/callbacks.jl:97:362 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/callbacks.jl:59:21 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/callbacks.jl:24:15 unknown function (ip: 0x7dfdb6c58352) 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: 0x7dfdb6c42d85) 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/4nmmg/src/frank_wolfe_variants.jl:208:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/frank_wolfe_variants.jl:188:103 unknown function (ip: 0x7dfdb6c2f767) 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/4nmmg/src/node.jl:373:595 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/custom_bonobo.jl:36:16 optimize! at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/custom_bonobo.jl:29:25 unknown function (ip: 0x7dfdb6c0b03a) 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/4nmmg/src/interface.jl:269:693 unknown function (ip: 0x7dfdb6c08369) 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/4nmmg/src/interface.jl:28:15 #solve#147 at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/MOI_bounded_oracle.jl:834:12 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/MOI_bounded_oracle.jl:832:15 unknown function (ip: 0x7dfdb6c00dac) 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 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: 0x7dfe2a897249) 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 ============================================================== 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.973500e+01 3.601816e+01 30 15 13971 113 13 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.348400e+01 3.652491e+01 21 12 15981 55 10 2 ====================================================================================== 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) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000074f3fa6a6590 Total snapshots: 379. Utilization: 0% ╎379 @Base/task.jl:1168 wait_forever() 378╎ 379 @Base/task.jl:1246 wait() 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 4.324300e+01 3.128830e+01 43 21 17719 139 18 4 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 4.695400e+01 3.137113e+01 13 8 19510 37 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 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 5.210200e+01 3.065141e+01 79 30 21254 396 22 10 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007dfe101fc010 Total snapshots: 12. Utilization: 100% ╎11 @Base/client.jl:593 _start() ╎ 11 @Base/client.jl:318 exec_options(opts::Base.JLOptions) ╎ 11 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ 11 @Base/Base.jl:328 (::Base.IncludeInto)(fname::String) ╎ 11 @Base/Base.jl:327 include(mapexpr::Function, mod::Module, _path::Stri… ╎ 11 @Base/loading.jl:3173 _include(mapexpr::Function, mod::Module, _path… ╎ ╎ 11 @Base/loading.jl:3113 include_string(mapexpr::typeof(identity), mod… ╎ ╎ 11 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ 11 @Base/Base.jl:328 (::Base.IncludeInto)(fname::String) ╎ ╎ 11 @Base/Base.jl:327 include(mapexpr::Function, mod::Module, _path:… ╎ ╎ 11 @Base/loading.jl:3173 _include(mapexpr::Function, mod::Module, … ╎ ╎ ╎ 11 @Base/loading.jl:3113 include_string(mapexpr::typeof(identity)… ╎ ╎ ╎ 11 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ ╎ 11 @Boscia/…_oracle.jl:832 kwcall(::@NamedTuple{settings::@Name… ╎ ╎ ╎ 11 @Boscia/…_oracle.jl:834 #solve#147 ╎ ╎ ╎ 11 @Boscia/…terface.jl:28 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ ╎ 11 @Boscia/…erface.jl:269 solve(f::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ 11 @Boscia/…bonobo.jl:29 kwcall(::@NamedTuple{callback::Bos… ╎ ╎ ╎ ╎ 11 @Boscia/…bonobo.jl:36 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 1 @Boscia/…/node.jl:348 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 1 @Boscia/…oblem.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…acle.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…acle.jl:234 is_linear_feasible(o::SCIP.Opt… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:254 is_linear_feasible_subroutine(… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…Ext.jl:56 get(model::SCIP.Optimizer, ::M… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…pper.jl:224 throw_if_not_valid(model::SCI… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…data.jl:114 get_parameter(scipd::SCIP.SC… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…CIP.jl:17170 SCIPgetParam(scip::SCIP.SC… ╎ ╎ ╎ ╎ 10 @Boscia/…/node.jl:373 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 10 @Boscia/…ants.jl:188 kwcall(::@NamedTuple{epsilon::Fl… ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…ants.jl:208 #solve_frank_wolfe#7 ╎ ╎ ╎ ╎ ╎ 10 @FrankWolfe/….jl:76 kwcall(::@NamedTuple{line_searc… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:166 blended_pairwise_conditional_g… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…lmo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:110 compute_extreme_point(tlmo::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:455 getproperty(x::Boscia.TimeTr… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…xt.jl:49 free_model 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:206 blended_pairwise_conditional_g… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…est.jl:45 (::var"#f#build_examples##0"{V… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…jl:261 blended_pairwise_conditional_g… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…cks.jl:24 (::Boscia.var"#33#34"{Bool, Bn… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…cks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:97 process_FW_callback_logic(tre… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…le.jl:591 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…xt.jl:28 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…nce.jl:25 iterate(A::Vector{Ptr{Nothi… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:843 iterate(A::Vector{Ptr{Noth… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:869 collect_to_with_first!(de… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:914 setindex!(A::Vector{Floa… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…or.jl:48 _setindex!(A::Vector{Flo… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 none:? #sol_values##0 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:0 ht_keyindex(h::Dict{… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::Dic… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex(key::SC… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 rem(x::UInt64, ::… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ng.jl:46 hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:899 objectid ╎ ╎ ╎ ╎ ╎ 5 @FrankWolfe/…jl:291 blended_pairwise_conditional_g… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…lmo.jl:108 storage_find_argmin_vertex(ve… ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::B… ╎ ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…l:24 set(o::SCIP.Optimizer, ::Math… ╎ ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…l:43 compute_extreme_point(lmo::F… ╎ ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…:358 _optimize_and_return(lmo::F… ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…per.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…per.jl:16 string(::String, ::String,… 4╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:118 compute_extreme_point(tlmo::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…em.jl:94 set(o::SCIP.Optimizer, ::Math… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:229 SCIPinfinity(scip::SCIP.Opt… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:234 is_linear_feasible(o::SCIP.… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:254 is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:56 get(model::SCIP.Optimizer,… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:224 throw_if_not_valid(model:… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:139 get_parameter(scipd::SCI… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:17213 SCIPgetRealParam ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:427 blended_pairwise_conditional_g… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…est.jl:45 (::var"#f#build_examples##0"{V… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, A:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 iterate(r::Base.OneTo{Int64}) ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…als.jl:1040 getindex [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457: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) Allocations: 19846167 (Pool: 19845437; Big: 730); GC: 16 [48] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/4nmmg/test/branching_strategy_test.jl:133 BMSfreeBlockMemory_call at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPeventqueueAdd at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPvarChgObj at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPvarFix at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPfixVar at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) performDualfix.constprop.0 at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) propPresolDualfix at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPpropPresol at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) presolveRound 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/4nmmg/src/time_tracking_lmo.jl:116:59 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/4nmmg/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: 0x7dfdb6c42d85) 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/4nmmg/src/frank_wolfe_variants.jl:208:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/frank_wolfe_variants.jl:188:103 unknown function (ip: 0x7dfdb6c2f767) 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/4nmmg/src/node.jl:373:595 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/custom_bonobo.jl:36:16 optimize! at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/custom_bonobo.jl:29:25 unknown function (ip: 0x7dfdb6c0b03a) 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/4nmmg/src/interface.jl:269:693 unknown function (ip: 0x7dfdb6c08369) 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/4nmmg/src/interface.jl:28:15 #solve#147 at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/MOI_bounded_oracle.jl:834:12 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/MOI_bounded_oracle.jl:832:15 unknown function (ip: 0x7dfdb6c00dac) 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 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: 0x7dfe2a897249) 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: 4513852296 (Pool: 4513848767; Big: 3529); GC: 1807 PkgEval terminated after 2731.99s: test duration exceeded the time limit