Package evaluation to test Boscia on Julia 1.14.0-DEV.2291 (26145852c4*) started at 2026-06-04T19:52:26.365 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 15.98s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.12 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.12 [d360d2e6] + ChainRulesCore v1.26.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.5 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.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.6.1 ⌅ [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.1 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 ⌅ [bac558e1] + OrderedCollections v1.8.2 [69de0a69] + Parsers v2.8.4 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.8.0 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.2 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.2+0 [4536629a] + OpenBLAS_jll v0.3.33+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.47s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:457 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 2.0 s ? GenericLinearAlgebra 1.5 s ✓ Bonobo 2.5 s ✓ LEMON_jll ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14197337-ba66-59df-a3e3-ca00e7dcff7a"), "GenericLinearAlgebra") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] top-level scope  @ ~/.julia/packages/DoubleFloats/KuIQF/src/DoubleFloats.jl:45  [12] include(mod::Module, _path::String)  @ Base Base.jl: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:3296  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core boot.jl:521  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [17] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [19] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/DoubleFloats/KuIQF/src/DoubleFloats.jl:1 in expression starting at stdin:5 ✗ DoubleFloats 20.6 s ✓ Boscia 14.1 s ✓ LEMONGraphs 17.9 s ✓ Boscia → BosciaHiGHSExt 24.4 s ✓ Boscia → BosciaSCIPExt 33.2 s ✓ GraphsMatching 31.4 s ✓ CombinatorialLinearOracles 8 dependencies successfully precompiled in 155 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:457 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ Precompilation completed after 188.71s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_5Tvjrv/Project.toml` [4c88cf16] Aqua v0.8.15 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.126 [497a8b3b] DoubleFloats v1.9.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.23.0 [b8f27783] MathOptInterface v1.51.1 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_5Tvjrv/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.15 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.5 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.5 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.16.0 [31c24e10] Distributions v0.25.126 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.9.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.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.6.1 [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.1 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 ⌅ [bac558e1] OrderedCollections v1.8.2 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.4 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.3 [be4d8f0f] Quadmath v1.0.1 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.10 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.6 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.8.0 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.11 [4c63d2b9] StatsFuns v2.0.1 [ec057cc2] StructUtils v2.8.2 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.3 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.14.0+0 [e33a78d0] Hwloc_jll v2.13.0+1 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.5+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.33+1 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.19.0+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.10+0 [1317d2d5] oneTBB_jll v2022.3.0+0 [0dad84c5] ArgTools v1.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.14.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.2+0 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.4+0 [29816b5a] LibSSH2_jll v1.11.101+0 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2026.5.14 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.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 = 0x3d77f47bd0c44ca9 WARNING: Use of Boscia.CubeSimpleBLMO is deprecated, use CubeLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/interface_test.jl:97 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = TIME_LIMIT_REACHED WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/interface_test.jl:986 Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = TIME_LIMIT_REACHED Callback Tests seed = 0x9f6fa16ba067f6da LMO Tests seed = 0x9351301b0ecb8d0c WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:218 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:254 Indicator Tests seed = 0x44ce04b79f03413b Heuristics Tests seed = 0xe684cd304a919625 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: Polish solution WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:193 Sparse Regression Tests seed = 0x0fcf23d204e2fce0 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 4.040399e+00 4.150000e+00 1.096007e-01 2.712621e-02 2.593000e+01 1.156961e-01 10888 44 15 18 8 1 11 4 4.112405e+00 4.150000e+00 3.759514e-02 9.141887e-03 3.024400e+01 4.959661e-01 5 3 51 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 9.832017e+00 1.184321e+00 8.647695e+00 0.000000e+00 Inf 1 LD 2 4.150000e+00 4.150000e+00 0.000000e+00 2.601237e+00 7.688649e-01 1 Last 2 4.150000e+00 4.150000e+00 0.000000e+00 2.795918e+00 7.153286e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 4.150000e+00 4.150000e+00 0.000000e+00 2.799156e+00 7.145011e-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: 4.149999791263129 Dual Bound: 4.112404651780414 Dual Gap (relative): 0.009141887208603951 Search Statistics. Total number of nodes processed: 15 Total number of lmo calls: 56 Total time (s): 36.009 LMO calls / sec: 1.5551667638645894 Nodes / sec: 0.41656252603515787 LMO calls / node: 3.7333333333333334 Total number of global tightenings: 40 Global tightenings / node: 3.64 Total number of local tightenings: 48 Local tightenings / node: 4.36 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 1.362974e+00 2.978663e+00 1.615688e+00 1.185413e+00 2.292200e+01 1.308786e-01 10871 189 43 101 30 1 100 53 2.283368e+00 2.978663e+00 6.952949e-01 3.045041e-01 2.873000e+01 5.325444e+00 24 15 1198 19 16 0 200 53 2.369120e+00 2.978663e+00 6.095427e-01 2.572866e-01 3.070600e+01 8.239432e+00 24 15 1614 22 8 0 300 53 2.431784e+00 2.978663e+00 5.468787e-01 2.248879e-01 3.263000e+01 1.081827e+01 26 16 2039 25 12 1 400 53 2.483581e+00 2.978663e+00 4.950812e-01 1.993417e-01 3.473400e+01 1.304198e+01 29 18 2507 29 17 2 500 53 2.528140e+00 2.978663e+00 4.505226e-01 1.782032e-01 3.700500e+01 1.494393e+01 78 48 3042 94 20 6 600 53 2.568297e+00 2.978663e+00 4.103658e-01 1.597813e-01 3.944100e+01 1.655638e+01 24 15 3609 25 10 0 700 53 2.612076e+00 2.978663e+00 3.665870e-01 1.403432e-01 4.178200e+01 1.802211e+01 29 19 4182 23 5 0 800 53 2.655471e+00 2.978663e+00 3.231913e-01 1.217077e-01 4.439700e+01 1.921301e+01 34 21 4823 54 18 2 900 53 2.704936e+00 2.978663e+00 2.737266e-01 1.011952e-01 4.683700e+01 2.034716e+01 31 19 5438 34 12 4 1000 53 2.783265e+00 2.978663e+00 1.953975e-01 7.020442e-02 4.920700e+01 2.139939e+01 30 18 6059 37 13 6 1100 39 2.881215e+00 2.978663e+00 9.744728e-02 3.382159e-02 5.126600e+01 2.221745e+01 15 10 6617 8 0 0 1143 12 2.956697e+00 2.978663e+00 2.196539e-02 7.429028e-03 5.195600e+01 2.223035e+01 7 5 6809 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.475884e+00 -6.330454e-01 8.108929e+00 0.000000e+00 Inf 1 LD 2 2.978663e+00 2.978663e+00 0.000000e+00 1.783786e-01 1.121210e+01 1 Last 2 2.978663e+00 2.978663e+00 0.000000e+00 3.587722e-01 5.574568e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.978663e+00 2.978663e+00 0.000000e+00 3.620571e-01 5.523990e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.9786625157972777 Dual Bound: 2.956697129538129 Dual Gap (relative): 0.007429028167853011 Search Statistics. Total number of nodes processed: 1155 Total number of lmo calls: 6814 Total time (s): 55.05 LMO calls / sec: 123.77838328792008 Nodes / sec: 20.980926430517712 LMO calls / node: 5.8995670995671 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 19 Non zero entries: 11th entry: 0.173712040177373 50th entry: 0.173712040177373 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.498980e+00 2.978663e+00 1.479683e+00 9.871263e-01 2.620000e-01 1.145038e+01 255 188 43 101 30 1 100 26 2.358361e+00 2.978663e+00 6.203017e-01 2.630224e-01 6.214000e+00 2.027679e+01 32 21 1181 23 17 0 200 26 2.510635e+00 2.978663e+00 4.680277e-01 1.864181e-01 9.407000e+00 2.402466e+01 25 16 1820 21 12 0 300 26 2.607404e+00 2.978663e+00 3.712590e-01 1.423865e-01 1.318200e+01 2.473069e+01 25 16 2632 28 11 3 400 26 2.700663e+00 2.978663e+00 2.779997e-01 1.029376e-01 1.696500e+01 2.511052e+01 30 19 3500 35 12 5 500 26 2.824690e+00 2.978663e+00 1.539728e-01 5.450964e-02 2.085100e+01 2.522661e+01 27 16 4452 44 14 6 564 10 2.950325e+00 2.978663e+00 2.833758e-02 9.604903e-03 2.301700e+01 2.493809e+01 21 14 5025 24 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.475884e+00 -6.330454e-01 8.108929e+00 0.000000e+00 Inf 1 LD 2 2.978663e+00 2.978663e+00 0.000000e+00 1.396656e-03 1.431992e+03 1 Last 2 2.978663e+00 2.978663e+00 0.000000e+00 6.878133e-03 2.907766e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.978663e+00 2.978663e+00 0.000000e+00 1.012509e-02 1.975291e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.9786625157972777 Dual Bound: 2.950324931187715 Dual Gap (relative): 0.009604902941370157 Search Statistics. Total number of nodes processed: 574 Total number of lmo calls: 5030 Total time (s): 23.039 LMO calls / sec: 218.32544815313165 Nodes / sec: 24.91427579322019 LMO calls / node: 8.763066202090592 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 16 Poisson Tests seed = 0xee070ce390f6085e 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 -5.485065e+02 -5.057346e+02 4.277191e+01 8.457383e-02 2.475700e+01 1.211778e-01 13275 120 49 1300 27 8 * 2 3 -5.485065e+02 -5.188686e+02 2.963784e+01 5.712012e-02 2.795000e+01 1.788909e-01 3187 117 91 2087 35 19 * 3 4 -5.482922e+02 -5.259566e+02 2.233563e+01 4.246668e-02 2.900000e+01 2.413793e-01 1044 90 128 663 29 7 * 5 6 -5.479149e+02 -5.267677e+02 2.114724e+01 4.014528e-02 3.302600e+01 3.330709e-01 1036 93 205 663 27 12 * 10 11 -5.473660e+02 -5.268519e+02 2.051412e+01 3.893717e-02 4.522100e+01 4.643860e-01 838 61 390 886 26 12 * 11 12 -5.472544e+02 -5.325158e+02 1.473857e+01 2.767725e-02 4.597100e+01 5.003154e-01 747 47 418 804 27 14 * 23 24 -5.466102e+02 -5.325844e+02 1.402584e+01 2.633543e-02 5.763100e+01 8.155333e-01 1276 58 827 1373 26 11 63 64 -5.458026e+02 -5.325844e+02 1.321822e+01 2.481902e-02 1.200040e+02 1.058298e+00 1856 60 2251 1242 27 14 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 8.501444e+02 -8.761004e+02 1.726245e+03 0.000000e+00 Inf 1 LD 2 -5.231508e+02 -5.740729e+02 5.092217e+01 2.146849e-01 9.315980e+00 2 LD 34 -5.322272e+02 -5.512108e+02 1.898354e+01 5.859800e-01 5.802246e+01 3 LD 37 -5.381477e+02 -5.421119e+02 3.964252e+00 5.952145e-01 6.216246e+01 4 LD 96 -5.387390e+02 -5.402286e+02 1.489584e+00 7.603203e-01 1.262626e+02 5 LD 130 -5.387697e+02 -5.390614e+02 2.916647e-01 8.039118e-01 1.617093e+02 6 LD 217 -5.387759e+02 -5.388335e+02 5.752418e-02 8.975823e-01 2.417606e+02 8 LD 359 -5.387761e+02 -5.387985e+02 2.242033e-02 1.064022e+00 3.373991e+02 9 LD 396 -5.387761e+02 -5.387819e+02 5.765731e-03 1.112534e+00 3.559441e+02 10 LD 416 -5.387761e+02 -5.387774e+02 1.314947e-03 1.138849e+00 3.652809e+02 10 LD 474 -5.387761e+02 -5.387767e+02 5.410297e-04 1.197221e+00 3.959170e+02 10 LD 521 -5.387761e+02 -5.387764e+02 2.355779e-04 1.245324e+00 4.183651e+02 10 LD 564 -5.387761e+02 -5.387761e+02 1.462324e-05 1.288791e+00 4.376195e+02 10 LD 664 -5.387761e+02 -5.387761e+02 5.431482e-06 1.388195e+00 4.783191e+02 10 P 1000 -5.387761e+02 -5.387761e+02 5.431482e-06 1.775944e+00 5.630810e+02 10 P 2000 -5.387761e+02 -5.387761e+02 5.431482e-06 2.675195e+00 7.476090e+02 10 P 3000 -5.387761e+02 -5.387761e+02 5.431482e-06 3.528589e+00 8.501982e+02 10 P 4000 -5.387761e+02 -5.387761e+02 5.431482e-06 4.264911e+00 9.378858e+02 10 P 5000 -5.387761e+02 -5.387761e+02 5.431482e-06 5.020792e+00 9.958589e+02 10 P 6000 -5.387761e+02 -5.387761e+02 5.431482e-06 5.782558e+00 1.037603e+03 10 P 7000 -5.387761e+02 -5.387761e+02 5.431482e-06 6.534238e+00 1.071280e+03 10 P 8000 -5.387761e+02 -5.387761e+02 5.431482e-06 7.285243e+00 1.098110e+03 10 P 9000 -5.387761e+02 -5.387761e+02 5.431482e-06 8.047974e+00 1.118294e+03 10 P 10000 -5.387761e+02 -5.387761e+02 5.431482e-06 8.801379e+00 1.136186e+03 10 Last 10001 -5.387761e+02 -5.387761e+02 8.988702e-07 8.806302e+00 1.135664e+03 10 ---------------------------------------------------------------------------------------------------------------- PP 10001 -5.387761e+02 -5.387761e+02 8.988702e-07 8.809698e+00 1.135226e+03 10 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -538.7761171475141 Dual Bound: -545.8026159990019 Dual Gap (relative): 0.013041593025111653 Search Statistics. Total number of nodes processed: 127 Total number of lmo calls: 2277 Total time (s): 131.84 LMO calls / sec: 17.270934466019416 Nodes / sec: 0.9632888349514563 LMO calls / node: 17.929133858267715 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 -4.703214e+02 -4.651694e+02 5.152060e+00 1.107566e-02 2.816800e+01 1.065038e-01 11242 122 25 94 11 2 * 2 3 -4.703214e+02 -4.666260e+02 3.695458e+00 7.919528e-03 2.898500e+01 1.725030e-01 218 73 40 67 10 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -2.225380e+02 -4.912963e+02 2.687583e+02 0.000000e+00 Inf 1 LD 2 -4.666260e+02 -4.666260e+02 0.000000e+00 1.797475e-01 1.112672e+01 1 Last 2 -4.666260e+02 -4.666260e+02 0.000000e+00 3.688161e-01 5.422756e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -4.666260e+02 -4.666260e+02 0.000000e+00 3.725313e-01 5.368676e+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: -466.62597928688314 Dual Bound: -470.3214369524809 Dual Gap (relative): 0.00791952833668907 Search Statistics. Total number of nodes processed: 5 Total number of lmo calls: 45 Total time (s): 32.263 LMO calls / sec: 1.3947865976505596 Nodes / sec: 0.15497628862783994 LMO calls / node: 9.0 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.021008e+02 3.901233e+02 1.880225e+02 9.303401e-01 2.263900e+01 1.325147e-01 11087 141 28 136 13 0 * 5 6 2.282813e+02 3.877668e+02 1.594855e+02 6.986356e-01 2.418100e+01 4.549026e-01 365 99 112 205 12 0 * 23 20 3.209932e+02 3.782239e+02 5.723068e+01 1.782925e-01 2.812500e+01 1.528889e+00 77 36 409 36 4 7 63 2 3.781373e+02 3.782239e+02 8.655574e-02 2.289003e-04 3.071400e+01 2.116299e+00 21 14 689 4 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.782239e+02 3.782239e+02 0.000000e+00 9.026263e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.782239e+02 3.782239e+02 0.000000e+00 1.995563e-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: 378.223883745555 Dual Bound: 378.13732800429955 Dual Gap (relative): 0.00022890028263608482 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 693 Total time (s): 33.953 LMO calls / sec: 20.41056754925927 Nodes / sec: 1.9144110976938709 LMO calls / node: 10.661538461538461 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.021008e+02 3.901233e+02 1.880225e+02 9.303401e-01 2.823000e+01 1.062699e-01 11510 139 28 136 13 0 * 10 11 2.411691e+02 3.782239e+02 1.370548e+02 5.682933e-01 3.850400e+01 5.453979e-01 217 68 212 94 8 2 100 11 3.702961e+02 3.782239e+02 7.927810e+00 2.140938e-02 7.353100e+01 1.509567e+00 14 8 1030 2 0 0 107 6 3.762507e+02 3.782239e+02 1.973136e+00 5.244206e-03 7.417700e+01 1.523383e+00 94 32 1064 41 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.782239e+02 3.782239e+02 0.000000e+00 1.239050e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.782239e+02 3.782239e+02 0.000000e+00 2.288375e-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: 378.223883745555 Dual Bound: 376.25074747775307 Dual Gap (relative): 0.005244205575747294 Search Statistics. Total number of nodes processed: 113 Total number of lmo calls: 1068 Total time (s): 77.374 LMO calls / sec: 13.80308630806214 Nodes / sec: 1.460438907126425 LMO calls / node: 9.451327433628318 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 = 0xd5264cbb58d7ff39 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.013739e+01 3.988366e+01 5.002105e+01 Inf 2.805800e+01 1.069214e-01 14111 148 49 10001 20 18 * 3 4 -7.782449e+00 2.040774e+01 2.819018e+01 Inf 2.865700e+01 2.442684e-01 312 198 119 2498 18 14 100 9 1.845589e+01 2.040774e+01 1.951844e+00 1.057572e-01 4.073900e+01 2.675569e+00 59 26 2097 731 0 0 115 4 2.022133e+01 2.040774e+01 1.864032e-01 9.218145e-03 4.121900e+01 2.887018e+00 8 5 2291 8 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 20.407735245421648 Dual Bound: 20.221332078235598 Dual Gap (relative): 0.009218144801977591 Search Statistics. Total number of nodes processed: 119 Total number of lmo calls: 2291 Total time (s): 42.582 LMO calls / sec: 53.802075994551686 Nodes / sec: 2.794608050349913 LMO calls / node: 19.252100840336134 Total number of global tightenings: 24 Global tightenings / node: 0.21 Total number of local tightenings: 431 Local tightenings / node: 3.75 Total number of potential local tightenings: 536 Time Limit Test seed = 0x93389d21821980fa Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.895300e+00 -1.254537e+00 6.407625e-01 5.107560e-01 2.615100e+01 1.147184e-01 13583 35 21 133 7 4 15 2 -1.263093e+00 -1.254537e+00 8.555918e-03 6.819978e-03 2.634000e+01 6.454062e-01 7 5 152 9 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -1.25453742547306 Dual Bound: -1.2630933436012781 Dual Gap (relative): 0.006819978387645112 Search Statistics. Total number of nodes processed: 17 Total number of lmo calls: 152 Total time (s): 27.608 LMO calls / sec: 5.5056505360765 Nodes / sec: 0.6157635467980296 LMO calls / node: 8.941176470588236 Total number of global tightenings: 9 Global tightenings / node: 0.6 Total number of local tightenings: 32 Local tightenings / node: 2.13 Total number of potential local tightenings: 33 Strong Convexity and Sharpness Tests seed = 0x65c2d23a199a8477 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.911418e+02 1.912662e+02 1.243912e-01 6.507797e-04 2.122600e+01 1.413361e-01 8643 0 10 8 2 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 191.26616420163575 Dual Bound: 191.1417730229774 Dual Gap (relative): 0.0006507796631320537 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 10 Total time (s): 22.53 LMO calls / sec: 0.44385264092321347 Nodes / sec: 0.13315579227696403 LMO calls / node: 3.3333333333333335 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/EgUlC/test/strong_convexity_and_sharpness.jl:135 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:135 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.137140e+02 2.139208e+02 2.068125e-01 9.677071e-04 2.143100e+01 1.399841e-01 10288 0 11 12 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 213.92079077343647 Dual Bound: 213.71397823849276 Dual Gap (relative): 0.0009677071038980757 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 22.569 LMO calls / sec: 0.4873942133014312 Nodes / sec: 0.13292569453675396 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 17 Branching Strategy Tests seed = 0xff6873d84f10a8b9 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.320800e+01 1.292658e-01 11745 46 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.465700e+01 2.636168e+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): 25.943 LMO calls / sec: 36.734379215973476 Nodes / sec: 2.505492811162934 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 4.240000e-01 7.075472e+00 269 42 48 3749 24 11 87 0 7.016760e+00 7.382204e+00 3.654439e-01 5.208158e-02 1.813000e+00 4.798676e+01 3 2 1015 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.016760210963634 Dual Gap (relative): 0.05208157873473409 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.814 LMO calls / sec: 559.5369349503859 Nodes / sec: 47.960308710033075 LMO calls / node: 11.666666666666666 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 53 Local tightenings / node: 0.61 Total number of potential local tightenings: 108 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest most infeasible gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 4.200000e-01 7.142857e+00 266 42 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.652000e+00 3.571429e+01 3 2 859 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.338246272538823 Dual Gap (relative): 0.005990244287570652 Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 859 Total time (s): 1.654 LMO calls / sec: 519.3470374848852 Nodes / sec: 35.67110036275695 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.170000e-01 7.194245e+00 233 39 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.750000e+00 4.285714e+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.751 LMO calls / sec: 515.1342090234152 Nodes / sec: 42.832667047401486 LMO calls / node: 12.026666666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 54 Local tightenings / node: 0.74 Total number of potential local tightenings: 118 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Index FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.630000e-01 8.264463e+00 234 39 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 2.101000e+00 4.616849e+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.102 LMO calls / sec: 558.5156993339676 Nodes / sec: 46.146527117031404 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 5.440000e-01 5.514706e+00 541 62 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.810000e-01 1.021566e+01 85 29 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 1.012000e+00 1.086957e+01 128 34 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.685000e+00 2.314335e+01 87 29 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.263000e+00 2.342654e+01 64 20 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.503000e+01 2.667997e+01 47 18 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.090600e+01 2.855640e+01 52 17 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.675200e+01 2.964264e+01 57 23 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.160600e+01 3.059546e+01 19 10 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.678600e+01 3.096287e+01 59 21 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.090800e+01 3.111861e+01 13 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.443100e+01 3.081182e+01 6 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.699500e+01 3.032237e+01 8 4 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.908900e+01 2.996598e+01 28 10 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.088700e+01 2.937882e+01 9 5 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.222200e+01 2.893417e+01 11 6 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.347000e+01 2.837105e+01 12 7 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.448200e+01 2.795419e+01 9 5 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.498000e+01 2.770098e+01 6 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.981 LMO calls / sec: 500.6274894963715 Nodes / sec: 27.70047834706535 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.101000e+00 1.427891e+00 517 61 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.419000e+00 3.720546e+00 89 31 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.555000e+00 4.305284e+00 134 38 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.015900e+01 1.978541e+01 87 32 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.072900e+01 2.022556e+01 66 23 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.706100e+01 2.326944e+01 127 25 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.191600e+01 2.559774e+01 42 18 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.657700e+01 2.682771e+01 25 13 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.038700e+01 2.793958e+01 45 19 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.403700e+01 2.899786e+01 22 12 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.709000e+01 2.979240e+01 9 5 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.031100e+01 3.028950e+01 8 5 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.315000e+01 3.047509e+01 10 6 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.582500e+01 3.061648e+01 13 8 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.780400e+01 3.056230e+01 9 5 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.973600e+01 3.054126e+01 8 5 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.111700e+01 3.085079e+01 10 6 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.250800e+01 3.087149e+01 12 8 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.387000e+01 3.079636e+01 13 7 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.492400e+01 3.056951e+01 6 4 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.507400e+01 3.048625e+01 14 8 26740 41 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.083355821757877 Dual Gap (relative): 0.009945008189894359 Search Statistics. Total number of nodes processed: 1679 Total number of lmo calls: 26740 Total time (s): 55.076 LMO calls / sec: 485.510930350788 Nodes / sec: 30.485147795773113 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.630000e-01 5.328597e+00 485 62 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.304000e+00 9.969325e+00 97 28 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.216000e+00 2.075290e+01 55 20 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 8.694000e+00 2.311939e+01 65 23 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.467200e+01 2.733097e+01 71 27 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.021100e+01 2.943941e+01 52 26 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.476900e+01 3.088538e+01 15 10 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 2.923000e+01 3.185084e+01 59 23 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.324700e+01 3.251421e+01 49 16 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 3.681400e+01 3.284077e+01 44 18 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.024400e+01 3.317265e+01 6 4 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.310000e+01 3.352668e+01 46 20 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 4.592400e+01 3.351189e+01 33 16 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 4.852200e+01 3.353118e+01 5 4 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.070200e+01 3.327285e+01 11 7 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.275600e+01 3.319054e+01 37 16 26657 170 21 7 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.452400e+01 3.292128e+01 7 4 27751 16 0 0 1500 329 2.665304e+01 2.836265e+01 1.709610e+00 6.414315e-02 5.649500e+01 3.237455e+01 8 5 28707 8 0 0 1600 253 2.705726e+01 2.836265e+01 1.305388e+00 4.824539e-02 5.775000e+01 3.208658e+01 3 2 29538 6 0 0 1700 167 2.749886e+01 2.836265e+01 8.637814e-01 3.141153e-02 5.891700e+01 3.168865e+01 3 2 30350 3 0 0 1800 75 2.797765e+01 2.836265e+01 3.849984e-01 1.376093e-02 5.989800e+01 3.130322e+01 4 3 31067 6 0 0 1811 66 2.803984e+01 2.836265e+01 3.228059e-01 1.151240e-02 6.000100e+01 3.128281e+01 5 3 31146 7 7 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 28.039839135198154 Dual Gap (relative): 0.011512401645757212 Search Statistics. Total number of nodes processed: 1877 Total number of lmo calls: 31146 Total time (s): 60.002 LMO calls / sec: 519.0826972434252 Nodes / sec: 31.282290590313654 LMO calls / node: 16.593500266382524 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2694 Local tightenings / node: 1.49 Total number of potential local tightenings: 6223 Number of alternative decisions: 543 Number of stable decisions: 395 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.780000e-01 5.190311e+00 507 92 64 4885 42 8 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.423000e+00 1.692117e+01 83 30 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.087000e+00 2.040816e+01 54 25 968 257 18 16 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.130000e+00 2.819074e+01 13 6 2918 60 18 11 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.153400e+01 3.320617e+01 32 15 5197 153 24 5 ====================================================================================== 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 47 running 1 of 1 signal (10): User defined signal 1 SCIPeventqueueAdd at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) varProcessChgUbGlobal at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPvarChgUbGlobal 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:0 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/wrapper.jl:16:0 [inlined] optimize! at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:427:0 (pc: 23) _optimize_and_return at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:358:0 (pc: 2) #compute_extreme_point#108 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:43:0 (pc: 304) compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:24:0 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:116:0 (pc: 73) compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:108:0 [inlined] #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:291:0 (pc: 738) unknown function (ip: 0x7aef05449425) at (unknown file) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:0 (pc: 49) #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208:0 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188:0 (pc: 28) unknown function (ip: 0x7aef05435d07) at (unknown file) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373:0 (pc: 1359) #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:0 (pc: 235) optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:0 (pc: 5) unknown function (ip: 0x7aef0541185a) at (unknown file) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:0 (pc: 1550) unknown function (ip: 0x7aef0540eb09) at (unknown file) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:0 (pc: 3) #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:0 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:0 (pc: 8) unknown function (ip: 0x7aef0540740c) at (unknown file) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 jl_apply at /source/src/julia.h:2388:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:521:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 207) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:327:0 (pc: 1) IncludeInto at ./Base.jl:328:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 jl_apply at /source/src/julia.h:2388:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:521:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 207) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:327:0 (pc: 1) IncludeInto at ./Base.jl:328:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 jl_apply at /source/src/julia.h:2388:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:521:0 (pc: 1) exec_options at ./client.jl:321:0 (pc: 425) _start at ./client.jl:596:0 (pc: 294) jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 jl_apply at /source/src/julia.h:2388: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: 0x7aef68d51249) 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 ============================================================== 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.644500e+01 3.447856e+01 23 12 7469 83 12 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.039300e+01 3.604178e+01 25 10 9610 131 23 5 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:457:34 wait at ./task.jl:1246:0 (pc: 107) wait_forever at ./task.jl:1168:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4138:23 [inlined] ijl_apply_generic at /source/src/gf.c:4364:12 jl_apply at /source/src/julia.h:2388: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 0x00007044635394b0 Total snapshots: 415. Utilization: 0% ╎415 @Base/task.jl:1168 wait_forever() 414╎ 415 @Base/task.jl:1246 wait() 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 3.276600e+01 2.786425e+01 41 19 11880 193 16 11 [47] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:133 PkgEval terminated after 2728.96s: test duration exceeded the time limit