Package evaluation to test Boscia on Julia 1.14.0-DEV.2462 (fcc4213c48*) started at 2026-06-30T19:45:59.998 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 14.39s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.12 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.12 [d360d2e6] + ChainRulesCore v1.26.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.5 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.4.1 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.6.1 [2ab3a3ac] + LogExpFunctions v1.0.1 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.1 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.4 [d9ec5142] + NamedTupleTools v0.14.3 ⌅ [bac558e1] + OrderedCollections v1.8.2 [69de0a69] + Parsers v2.8.6 [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.5+2 [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.38s ################################################################################ # 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. 1.9 s ? GenericLinearAlgebra 1.9 s ✓ LEMON_jll 5.8 s ✓ SCIP_PaPILO_jll 2.0 s ✓ SCIP_jll 16.3 s ✓ Boscia ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14197337-ba66-59df-a3e3-ca00e7dcff7a"), "GenericLinearAlgebra") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] top-level scope  @ ~/.julia/packages/DoubleFloats/KuIQF/src/DoubleFloats.jl:45  [12] include(mod::Module, _path::String)  @ Base Base.jl:325  [13] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3303  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core boot.jl:522  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [17] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [19] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/DoubleFloats/KuIQF/src/DoubleFloats.jl:1 in expression starting at stdin:5 ✗ DoubleFloats 13.7 s ✓ LEMONGraphs 26.4 s ✓ SCIP 13.4 s ✓ Boscia → BosciaHiGHSExt 28.1 s ✓ GraphsMatching 18.6 s ✓ Boscia → BosciaSCIPExt 26.5 s ✓ CombinatorialLinearOracles 10 dependencies successfully precompiled in 160 seconds. 181 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 190.84s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_rmay5W/Project.toml` [4c88cf16] Aqua v0.8.16 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.129 [497a8b3b] DoubleFloats v1.9.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.24.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_rmay5W/Manifest.toml` [7d9f7c33] Accessors v0.1.45 [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.16 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.5 [38540f10] CommonSolve v0.2.9 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [a33af91c] CompositionsBase v0.1.2 [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.129 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.9.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.4.1 [f55ce6ea] FrankWolfe v0.6.4 [14197337] GenericLinearAlgebra v0.4.0 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.14.0 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.24.0 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [3587e190] InverseFunctions v0.1.17 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.6.1 [4076af6c] JuMP v1.30.1 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v1.0.1 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.51.1 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.4 [d9ec5142] NamedTupleTools v0.14.3 ⌅ [bac558e1] OrderedCollections v1.8.2 [90014a1f] PDMats v0.11.40 [69de0a69] Parsers v2.8.6 [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 [f2b01f46] Roots v3.0.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.3 [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.12 [4c63d2b9] StatsFuns v2.2.0 [ec057cc2] StructUtils v2.8.2 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.13.0 [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.15.0+0 [e33a78d0] Hwloc_jll v2.14.0+0 ⌅ [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+1 [1317d2d5] oneTBB_jll v2022.3.0+0 [0dad84c5] ArgTools v1.2.0 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.5+2 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.4+0 [29816b5a] LibSSH2_jll v1.11.101+0 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2026.5.14 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.7+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.69.0+0 [3f19e933] p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0x648d68cceab94fc7 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 = 0xa60db547cd0c57fc LMO Tests seed = 0xb3bfc4dc1a2eccb6 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 = 0x3122300b12906eb9 Heuristics Tests seed = 0xb23a8345730c4825 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:193 Sparse Regression Tests seed = 0x931bcbdf417dc05f 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 0 2.445573e+00 2.445573e+00 0.000000e+00 0.000000e+00 1.694000e+01 5.903188e-02 5541 4 2 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 ---------------------------------------------------------------------------------------------------------------- Last 0 2.445573e+00 2.445573e+00 0.000000e+00 2.019307e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 2.445573e+00 2.445573e+00 0.000000e+00 2.305863e+00 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 (tree empty) Primal Objective: 2.4455726210289184 Dual Bound: 2.4455726210289184 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 6 Total time (s): 25.893 LMO calls / sec: 0.23172285946008572 Nodes / sec: 0.038620476576680954 LMO calls / node: 6.0 Total number of global tightenings: 50 Global tightenings / node: 50.0 Total number of local tightenings: 50 Local tightenings / node: 50.0 Total number of potential local tightenings: 50 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.661438e+00 3.160736e+00 1.499298e+00 9.024096e-01 2.089800e+01 1.435544e-01 9904 200 43 93 30 1 100 61 2.487825e+00 3.160736e+00 6.729117e-01 2.704820e-01 2.820200e+01 5.708815e+00 24 16 1383 18 16 0 200 61 2.574219e+00 3.160736e+00 5.865169e-01 2.278426e-01 3.052900e+01 8.549248e+00 18 12 1867 23 11 0 300 61 2.628418e+00 3.160736e+00 5.323183e-01 2.025242e-01 3.285400e+01 1.098801e+01 29 18 2385 23 12 0 400 61 2.672866e+00 3.160736e+00 4.878706e-01 1.825272e-01 3.546900e+01 1.299727e+01 29 19 2972 31 12 3 500 61 2.712408e+00 3.160736e+00 4.483283e-01 1.652879e-01 3.807900e+01 1.473253e+01 18 12 3568 17 8 0 600 61 2.753003e+00 3.160736e+00 4.077334e-01 1.481050e-01 4.072800e+01 1.622962e+01 34 21 4182 35 11 4 700 61 2.789001e+00 3.160736e+00 3.717353e-01 1.332862e-01 4.389100e+01 1.733841e+01 28 17 4903 24 7 1 800 61 2.825893e+00 3.160736e+00 3.348435e-01 1.184912e-01 4.664700e+01 1.845778e+01 22 14 5561 17 5 0 900 61 2.870799e+00 3.160736e+00 2.899374e-01 1.009954e-01 4.963800e+01 1.936017e+01 45 19 6267 20 5 3 1000 61 2.927787e+00 3.160736e+00 2.329491e-01 7.956489e-02 5.245200e+01 2.022802e+01 31 19 6949 37 9 4 1100 59 3.015979e+00 3.160736e+00 1.447576e-01 4.799690e-02 5.490800e+01 2.110804e+01 47 29 7616 37 7 3 1181 12 3.136937e+00 3.160736e+00 2.379973e-02 7.586934e-03 5.646000e+01 2.113000e+01 13 8 8059 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.847430e+00 -1.478109e-01 6.995240e+00 0.000000e+00 Inf 1 LD 2 3.160736e+00 3.160736e+00 0.000000e+00 1.593031e-01 1.255468e+01 1 Last 2 3.160736e+00 3.160736e+00 0.000000e+00 3.274100e-01 6.108550e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.160736e+00 3.160736e+00 0.000000e+00 3.305531e-01 6.050465e+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: 3.160736410935375 Dual Bound: 3.1369366804695815 Dual Gap (relative): 0.007586933652173958 Search Statistics. Total number of nodes processed: 1193 Total number of lmo calls: 8064 Total time (s): 59.403 LMO calls / sec: 135.7507196606232 Nodes / sec: 20.083160783125432 LMO calls / node: 6.75943000838223 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 17 Non zero entries: 9th entry: 0.15815714402103648 48th entry: 0.15815714402103648 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.769239e+00 3.160736e+00 1.391497e+00 7.864948e-01 2.710000e-01 1.107011e+01 264 200 43 93 30 1 100 43 2.543083e+00 3.160736e+00 6.176537e-01 2.428760e-01 7.273000e+00 1.966176e+01 29 19 1351 21 16 1 200 41 2.631480e+00 3.160736e+00 5.292563e-01 2.011250e-01 9.553000e+00 2.522768e+01 20 13 1837 15 12 0 300 30 2.718183e+00 3.160736e+00 4.425531e-01 1.628121e-01 1.264100e+01 2.610553e+01 40 26 2474 55 18 4 400 30 2.808137e+00 3.160736e+00 3.525999e-01 1.255636e-01 1.641000e+01 2.620353e+01 29 18 3288 37 13 5 500 30 2.888844e+00 3.160736e+00 2.718928e-01 9.411822e-02 2.078700e+01 2.549670e+01 29 18 4263 29 9 3 600 30 3.005547e+00 3.160736e+00 1.551898e-01 5.163448e-02 2.456600e+01 2.564520e+01 31 19 5159 40 12 8 659 9 3.131141e+00 3.160736e+00 2.959507e-02 9.451846e-03 2.639700e+01 2.530591e+01 25 16 5649 28 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.847430e+00 -1.478109e-01 6.995240e+00 0.000000e+00 Inf 1 LD 2 3.160736e+00 3.160736e+00 0.000000e+00 1.154180e-03 1.732832e+03 1 Last 2 3.160736e+00 3.160736e+00 0.000000e+00 8.017810e-03 2.494447e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.160736e+00 3.160736e+00 0.000000e+00 1.114810e-02 1.794027e+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: 3.160736410935375 Dual Bound: 3.1311413459218675 Dual Gap (relative): 0.00945184574693614 Search Statistics. Total number of nodes processed: 668 Total number of lmo calls: 5654 Total time (s): 26.42 LMO calls / sec: 214.00454201362604 Nodes / sec: 25.283875851627553 LMO calls / node: 8.464071856287426 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: 15 Poisson Tests seed = 0xb8c9a56a6d5ab76c Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.529432e+02 -1.271105e+02 2.583262e+01 2.032296e-01 2.090700e+01 1.434926e-01 10354 99 38 472 24 1 * 2 3 -1.529432e+02 -1.340800e+02 1.886315e+01 1.406857e-01 2.211800e+01 2.260602e-01 1206 88 72 742 28 4 * 5 6 -1.529391e+02 -1.358975e+02 1.704163e+01 1.254006e-01 2.434600e+01 4.518196e-01 997 86 168 645 29 3 48 49 -1.527373e+02 -1.358975e+02 1.683982e+01 1.239156e-01 1.200050e+02 8.082997e-01 2624 85 1738 1753 35 16 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.315762e+02 -3.575333e+02 6.891095e+02 0.000000e+00 Inf 1 LD 2 -1.423396e+02 -1.634782e+02 2.113865e+01 1.689055e-01 1.184094e+01 2 LD 41 -1.464664e+02 -1.559763e+02 9.509840e+00 4.805853e-01 8.531264e+01 4 LD 65 -1.471652e+02 -1.506511e+02 3.485879e+00 5.131020e-01 1.266805e+02 4 LD 84 -1.474194e+02 -1.487612e+02 1.341849e+00 5.416157e-01 1.550915e+02 6 LD 153 -1.474982e+02 -1.480703e+02 5.721679e-01 6.631799e-01 2.307066e+02 9 LD 199 -1.475114e+02 -1.477197e+02 2.082652e-01 7.208738e-01 2.760538e+02 10 LD 231 -1.475133e+02 -1.475859e+02 7.262914e-02 7.606898e-01 3.036717e+02 10 LD 271 -1.475135e+02 -1.475318e+02 1.822672e-02 8.083786e-01 3.352390e+02 11 LD 412 -1.475136e+02 -1.475204e+02 6.848664e-03 9.639083e-01 4.274265e+02 13 LD 485 -1.475136e+02 -1.475164e+02 2.817040e-03 1.053074e+00 4.605566e+02 13 LD 564 -1.475136e+02 -1.475144e+02 8.833664e-04 1.179943e+00 4.779893e+02 14 LD 663 -1.475136e+02 -1.475139e+02 3.830680e-04 1.256823e+00 5.275207e+02 14 LD 756 -1.475136e+02 -1.475137e+02 1.693988e-04 1.323624e+00 5.711590e+02 14 LD 833 -1.475136e+02 -1.475136e+02 8.038943e-05 1.379937e+00 6.036509e+02 14 LD 916 -1.475136e+02 -1.475136e+02 3.386489e-05 1.456003e+00 6.291196e+02 14 P 1000 -1.475136e+02 -1.475136e+02 3.386489e-05 1.529835e+00 6.536653e+02 14 LD 1031 -1.475136e+02 -1.475136e+02 8.545138e-06 1.612839e+00 6.392453e+02 15 LD 1087 -1.475136e+02 -1.475136e+02 3.468119e-06 1.703089e+00 6.382522e+02 16 LD 1127 -1.475136e+02 -1.475136e+02 1.291086e-06 1.732557e+00 6.504837e+02 16 LD 1141 -1.475136e+02 -1.475136e+02 9.007853e-07 1.744657e+00 6.539967e+02 16 Last 1141 -1.475136e+02 -1.475136e+02 9.007853e-07 1.750799e+00 6.517026e+02 16 ---------------------------------------------------------------------------------------------------------------- PP 1141 -1.475136e+02 -1.475136e+02 9.007853e-07 1.753945e+00 6.505334e+02 16 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Time limit reached Primal Objective: -147.51356105232037 Dual Bound: -152.73733422287071 Dual Gap (relative): 0.03541215555563443 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1776 Total time (s): 124.48 LMO calls / sec: 14.267352185089974 Nodes / sec: 0.7792416452442159 LMO calls / node: 18.309278350515463 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.505625e+02 -1.436919e+02 6.870576e+00 4.781462e-02 2.543600e+01 1.179431e-01 9614 186 37 204 23 1 * 8 9 -1.505544e+02 -1.444306e+02 6.123810e+00 4.239966e-02 3.292500e+01 5.163250e-01 235 91 196 143 19 8 * 9 10 -1.501333e+02 -1.455300e+02 4.603253e+00 3.163095e-02 3.384100e+01 5.614491e-01 236 91 215 89 20 6 100 93 -1.475728e+02 -1.455300e+02 2.042755e+00 1.403666e-02 1.134170e+02 1.701685e+00 97 38 1928 85 13 2 157 146 -1.469758e+02 -1.455300e+02 1.445745e+00 9.934342e-03 1.572660e+02 1.926672e+00 59 32 3006 30 7 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -7.767839e+01 -1.698589e+02 9.218051e+01 0.000000e+00 Inf 1 LD 2 -1.455300e+02 -1.455300e+02 0.000000e+00 1.181829e-01 1.692293e+01 1 Last 2 -1.455300e+02 -1.455300e+02 0.000000e+00 2.400857e-01 8.330358e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.455300e+02 -1.455300e+02 0.000000e+00 2.423937e-01 8.251041e+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: -145.53002253150686 Dual Bound: -146.97576752386175 Dual Gap (relative): 0.009934341843738046 Search Statistics. Total number of nodes processed: 303 Total number of lmo calls: 3011 Total time (s): 159.829 LMO calls / sec: 18.838884057336276 Nodes / sec: 1.8957761107183302 LMO calls / node: 9.937293729372938 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.920673e+02 3.417764e+02 1.497091e+02 7.794619e-01 1.592500e+01 1.883830e-01 7750 129 27 85 14 0 * 2 3 1.920673e+02 3.416641e+02 1.495969e+02 7.788775e-01 1.603700e+01 3.117790e-01 108 62 47 60 11 0 * 3 4 2.053527e+02 3.408041e+02 1.354514e+02 6.596035e-01 1.615700e+01 4.332487e-01 116 57 64 76 12 2 * 4 5 2.053527e+02 3.378631e+02 1.325104e+02 6.452822e-01 1.630800e+01 5.518764e-01 147 74 87 72 12 1 * 50 51 2.699726e+02 3.378080e+02 6.783542e+01 2.512678e-01 2.215600e+01 4.558585e+00 81 38 843 31 6 1 100 93 2.928695e+02 3.378080e+02 4.493857e+01 1.534423e-01 3.689300e+01 5.231345e+00 93 46 1451 33 3 1 * 102 93 2.951831e+02 3.374417e+02 4.225861e+01 1.431607e-01 3.705300e+01 5.262732e+00 138 53 1468 71 6 1 200 101 3.144744e+02 3.374417e+02 2.296733e+01 7.303401e-02 4.918500e+01 6.119752e+00 17 11 2282 4 0 0 300 65 3.290092e+02 3.374417e+02 8.432548e+00 2.563013e-02 5.277300e+01 6.916416e+00 6 3 2798 0 0 0 * 313 54 3.301838e+02 3.374327e+02 7.248857e+00 2.195400e-02 5.306100e+01 6.916568e+00 13 7 2841 2 0 0 343 30 3.342012e+02 3.374327e+02 3.231524e+00 9.669399e-03 5.365200e+01 6.952211e+00 8 6 2941 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.374417e+02 3.356262e+02 1.815557e+00 0.000000e+00 Inf 1 LD 2 3.374327e+02 3.374327e+02 -7.021299e-10 1.539831e-01 1.298844e+01 2 Last 2 3.374327e+02 3.374327e+02 -7.021299e-10 2.724065e-01 7.341969e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.374327e+02 3.374327e+02 1.398348e-11 2.744310e-01 7.287805e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 337.4326939540847 Dual Bound: 334.2011695593218 Dual Gap (relative): 0.009669398820548736 Search Statistics. Total number of nodes processed: 373 Total number of lmo calls: 2946 Total time (s): 56.612 LMO calls / sec: 52.038437080477635 Nodes / sec: 6.588709107609694 LMO calls / node: 7.898123324396783 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.920673e+02 3.417764e+02 1.497091e+02 7.794619e-01 2.405000e+01 1.247401e-01 9639 130 27 85 14 0 * 4 5 2.079619e+02 3.378631e+02 1.299012e+02 6.246396e-01 2.747600e+01 3.275586e-01 149 84 81 45 11 1 * 10 11 2.277353e+02 3.378080e+02 1.100727e+02 4.833363e-01 3.380800e+01 6.211548e-01 126 66 193 42 8 0 100 81 2.923983e+02 3.378080e+02 4.540976e+01 1.553011e-01 8.551000e+01 2.116711e+00 28 16 1344 16 3 1 * 105 84 2.941098e+02 3.374417e+02 4.333195e+01 1.473326e-01 8.746200e+01 2.160938e+00 74 37 1383 32 5 2 200 103 3.180071e+02 3.374417e+02 1.943456e+01 6.111359e-02 1.169350e+02 2.591183e+00 20 12 1995 4 0 0 * 208 103 3.209940e+02 3.374327e+02 1.643871e+01 5.121190e-02 1.186510e+02 2.621133e+00 11 6 2026 2 0 0 297 34 3.341696e+02 3.374327e+02 3.263114e+00 9.764845e-03 1.245330e+02 2.657930e+00 34 21 2339 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 3.374417e+02 3.356262e+02 1.815557e+00 0.000000e+00 Inf 1 LD 2 3.374327e+02 3.374327e+02 -7.021299e-10 1.800979e-01 1.110507e+01 2 Last 2 3.374327e+02 3.374327e+02 -7.021299e-10 3.567868e-01 5.605588e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.374327e+02 3.374327e+02 1.398348e-11 3.601192e-01 5.553717e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 337.4326939540847 Dual Bound: 334.1695799235561 Dual Gap (relative): 0.009764844637489285 Search Statistics. Total number of nodes processed: 331 Total number of lmo calls: 2344 Total time (s): 127.694 LMO calls / sec: 18.356383228656007 Nodes / sec: 2.592134321111407 LMO calls / node: 7.081570996978852 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 = 0xa5a74d8398bf73a4 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 -6.367508e+00 3.835529e+01 4.472279e+01 Inf 2.402900e+01 1.248491e-01 11621 169 55 10001 24 17 * 3 4 -4.606606e+00 3.739929e+01 4.200589e+01 Inf 2.471900e+01 2.831830e-01 261 183 118 1575 18 10 100 47 2.653443e+01 3.739929e+01 1.086485e+01 4.094623e-01 4.103700e+01 3.582133e+00 23 14 2376 154 0 0 195 4 3.708294e+01 3.739929e+01 3.163415e-01 8.530646e-03 5.182800e+01 3.839623e+00 53 35 4284 300 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 37.39928591889678 Dual Bound: 37.082944431172336 Dual Gap (relative): 0.008530646435360275 Search Statistics. Total number of nodes processed: 199 Total number of lmo calls: 4284 Total time (s): 53.02 LMO calls / sec: 80.79969822708412 Nodes / sec: 3.753300641267446 LMO calls / node: 21.527638190954775 Total number of global tightenings: 10 Global tightenings / node: 0.05 Total number of local tightenings: 732 Local tightenings / node: 3.75 Total number of potential local tightenings: 927 Time Limit Test seed = 0xad4fe2c08fa44497 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -2.414759e+00 -9.811031e-03 2.404948e+00 2.451269e+02 2.275700e+01 1.318276e-01 11775 140 24 1350 12 4 * 3 4 -2.318774e+00 -1.561744e+00 7.570301e-01 4.847339e-01 2.288200e+01 3.059173e-01 104 49 59 2114 12 5 79 6 -1.572401e+00 -1.561744e+00 1.065675e-02 6.823623e-03 2.506200e+01 3.391589e+00 9 6 1093 21 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -1.5617437896834732 Dual Bound: -1.5724005400861145 Dual Gap (relative): 0.006823622717783444 Search Statistics. Total number of nodes processed: 85 Total number of lmo calls: 1093 Total time (s): 26.161 LMO calls / sec: 41.77974848056267 Nodes / sec: 3.2491112725048734 LMO calls / node: 12.858823529411765 Total number of global tightenings: 4 Global tightenings / node: 0.05 Total number of local tightenings: 94 Local tightenings / node: 1.19 Total number of potential local tightenings: 122 Strong Convexity and Sharpness Tests seed = 0x781177452e3e6e3e WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.315342e+02 2.316923e+02 1.581284e-01 6.829591e-04 2.071100e+01 1.448506e-01 9462 0 11 17 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 231.69230147214518 Dual Bound: 231.53417309723676 Dual Gap (relative): 0.0006829591191361903 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 21.934 LMO calls / sec: 0.5015045135406219 Nodes / sec: 0.13677395823835142 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 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.024607e+02 2.026479e+02 1.871585e-01 9.244186e-04 2.041700e+01 1.469364e-01 9313 0 9 8 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 202.64788835484785 Dual Bound: 202.46072989319845 Dual Gap (relative): 0.0009244185860049633 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 9 Total time (s): 21.616 LMO calls / sec: 0.4163582531458179 Nodes / sec: 0.13878608438193932 LMO calls / node: 3.0 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 = 0x788505b56fecb0e9 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.204000e+01 1.361162e-01 10785 49 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.351200e+01 2.764546e+00 9 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.83 LMO calls / sec: 38.38099073701168 Nodes / sec: 2.617801047120419 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.810000e-01 7.874016e+00 237 49 48 3749 24 11 87 0 7.016760e+00 7.382204e+00 3.654439e-01 5.208158e-02 1.922000e+00 4.526535e+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.923 LMO calls / sec: 527.8211128445138 Nodes / sec: 45.24180967238689 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.560000e-01 8.426966e+00 218 42 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.531000e+00 3.853690e+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.532 LMO calls / sec: 560.7049608355092 Nodes / sec: 38.51174934725849 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.080000e-01 7.352941e+00 255 43 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.712000e+00 4.380841e+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.713 LMO calls / sec: 526.5615878575599 Nodes / sec: 43.78283712784588 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.690000e-01 8.130081e+00 256 41 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.973000e+00 4.916371e+01 3 2 1174 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.325011777780223 Dual Gap (relative): 0.007807821244322148 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1174 Total time (s): 1.974 LMO calls / sec: 594.7315096251267 Nodes / sec: 49.1388044579534 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.480000e-01 6.696429e+00 445 62 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.480000e-01 1.203209e+01 86 34 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.820000e-01 1.247166e+01 131 39 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.458000e+00 2.376448e+01 89 33 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.043000e+00 2.399646e+01 59 21 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.443000e+01 2.778933e+01 46 21 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.022800e+01 2.951355e+01 50 19 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.587000e+01 3.065327e+01 51 22 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.067900e+01 3.151993e+01 18 10 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.563900e+01 3.195937e+01 57 23 16456 348 17 12 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 53 running 1 of 1 signal (10): User defined signal 1 getindex at ./essentials.jl:1040:0 [inlined] getindex at ./array.jl:991:0 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1049:0 [inlined] macro expansion at ./simdloop.jl:77:0 [inlined] dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1048:0 (pc: 297) unknown function (ip: 0x7d27b0748b91) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 f at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:45:0 (pc: 260) find_best_solution at /home/pkgeval/.julia/packages/Boscia/EgUlC/ext/BosciaSCIPExt.jl:30:0 (pc: 150) unknown function (ip: 0x7d27ca859382) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 find_best_solution at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:591:0 (pc: 2) unknown function (ip: 0x7d27ca85861d) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 #process_FW_callback_logic#37 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:97:0 (pc: 1355) process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:59:0 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:24:0 (pc: 13) unknown function (ip: 0x7d27ca861557) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:261:0 (pc: 492) unknown function (ip: 0x7d27ca84bed2) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564: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: 0x7d27ca838684) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564: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: 0x7d27ca81428a) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:0 (pc: 1551) unknown function (ip: 0x7d27ca8115d9) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564: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: 0x7d27ca809e9c) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2405:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:757:13 eval_body at /source/src/interpreter.c:614:21 eval_body at /source/src/interpreter.c:622:21 eval_body at /source/src/interpreter.c:622:21 eval_body at /source/src/interpreter.c:622:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:947:21 ijl_eval_thunk at /source/src/toplevel.c:764:18 jl_toplevel_eval_flex at /source/src/toplevel.c:708:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:598:15 jl_toplevel_eval_flex at /source/src/toplevel.c:680:27 ijl_toplevel_eval at /source/src/toplevel.c:778:12 ijl_toplevel_eval_in at /source/src/toplevel.c:823:13 eval at ./boot.jl:522:0 (pc: 1) 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.010900e+01 3.173851e+01 30 18 18546 31 0 0 include_string at ./loading.jl:3132:0 (pc: 208) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:326:0 (pc: 1) IncludeInto at ./Base.jl:327:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2405:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:757:13 eval_body at /source/src/interpreter.c:614:21 eval_body at /source/src/interpreter.c:622:21 eval_body at /source/src/interpreter.c:622:21 eval_body at /source/src/interpreter.c:622:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:947:21 ijl_eval_thunk at /source/src/toplevel.c:764:18 jl_toplevel_eval_flex at /source/src/toplevel.c:708:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:598:15 jl_toplevel_eval_flex at /source/src/toplevel.c:680:27 ijl_toplevel_eval at /source/src/toplevel.c:778:12 ijl_toplevel_eval_in at /source/src/toplevel.c:823:13 eval at ./boot.jl:522:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 208) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:326:0 (pc: 1) IncludeInto at ./Base.jl:327:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2405:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:757:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:947:21 ijl_eval_thunk at /source/src/toplevel.c:764:18 jl_toplevel_eval_flex at /source/src/toplevel.c:708:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:598:15 jl_toplevel_eval_flex at /source/src/toplevel.c:680:27 ijl_toplevel_eval at /source/src/toplevel.c:778:12 ijl_toplevel_eval_in at /source/src/toplevel.c:823:13 eval at ./boot.jl:522:0 (pc: 1) exec_options at ./client.jl:321:0 (pc: 426) _start at ./client.jl:596:0 (pc: 295) jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2405:12 [inlined] true_main at /source/src/jlapi.c:985:29 jl_repl_entrypoint at /source/src/jlapi.c:1152:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x7d2824f87249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.387100e+01 3.120512e+01 7 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.649500e+01 3.064846e+01 7 4 21913 21 0 0 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2405:12 [inlined] start_task at /source/src/task.c:1276: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 0x000077816c019f00 Total snapshots: 435. Utilization: 0% ╎435 @Base/task.jl:1170 wait_forever() 434╎ 435 @Base/task.jl:1248 wait() 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.519700e+01 2.665000e+01 26 10 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.725100e+01 2.611308e+01 7 5 24396 13 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 [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:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2405:12 [inlined] start_task at /source/src/task.c:1276:19 unknown function (ip: (nil)) at (unknown file) Allocations: 18377719 (Pool: 18377003; Big: 716); GC: 17 [53] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:133 SCIPconshdlrSetNeedsCons at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) consExitBenderslp at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPconshdlrExit at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsetExitPlugins at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPfreeTransform at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPfreeTransform at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:21476:0 [inlined] free_model at /home/pkgeval/.julia/packages/Boscia/EgUlC/ext/BosciaSCIPExt.jl:49:0 [inlined] free_model at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:455:0 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:130:0 (pc: 1011) 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:166:0 (pc: 190) unknown function (ip: 0x7d27ca84bed2) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564: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: 0x7d27ca838684) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564: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: 0x7d27ca81428a) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:0 (pc: 1551) unknown function (ip: 0x7d27ca8115d9) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564: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: 0x7d27ca809e9c) at (unknown file) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2405:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:757:13 eval_body at /source/src/interpreter.c:614:21 eval_body at /source/src/interpreter.c:622:21 eval_body at /source/src/interpreter.c:622:21 eval_body at /source/src/interpreter.c:622:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:947:21 ijl_eval_thunk at /source/src/toplevel.c:764:18 jl_toplevel_eval_flex at /source/src/toplevel.c:708:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:598:15 jl_toplevel_eval_flex at /source/src/toplevel.c:680:27 ijl_toplevel_eval at /source/src/toplevel.c:778:12 ijl_toplevel_eval_in at /source/src/toplevel.c:823:13 eval at ./boot.jl:522:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 208) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:326:0 (pc: 1) IncludeInto at ./Base.jl:327:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2405:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:757:13 eval_body at /source/src/interpreter.c:614:21 eval_body at /source/src/interpreter.c:622:21 eval_body at /source/src/interpreter.c:622:21 eval_body at /source/src/interpreter.c:622:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:947:21 ijl_eval_thunk at /source/src/toplevel.c:764:18 jl_toplevel_eval_flex at /source/src/toplevel.c:708:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:598:15 jl_toplevel_eval_flex at /source/src/toplevel.c:680:27 ijl_toplevel_eval at /source/src/toplevel.c:778:12 ijl_toplevel_eval_in at /source/src/toplevel.c:823:13 eval at ./boot.jl:522:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 208) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:326:0 (pc: 1) IncludeInto at ./Base.jl:327:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2405:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:757:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:947:21 ijl_eval_thunk at /source/src/toplevel.c:764:18 jl_toplevel_eval_flex at /source/src/toplevel.c:708:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:598:15 jl_toplevel_eval_flex at /source/src/toplevel.c:680:27 ijl_toplevel_eval at /source/src/toplevel.c:778:12 ijl_toplevel_eval_in at /source/src/toplevel.c:823:13 eval at ./boot.jl:522:0 (pc: 1) exec_options at ./client.jl:321:0 (pc: 426) _start at ./client.jl:596:0 (pc: 295) jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2405:12 [inlined] true_main at /source/src/jlapi.c:985:29 jl_repl_entrypoint at /source/src/jlapi.c:1152:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x7d2824f87249) 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: 4980084247 (Pool: 4980080878; Big: 3369); GC: 1883 PkgEval terminated after 2723.33s: test duration exceeded the time limit