Package evaluation to test Boscia on Julia 1.14.0-DEV.2307 (a8f97b1944*) started at 2026-06-08T15:47:33.432 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 13.89s ################################################################################ # 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.0 [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.3 [d9ec5142] + NamedTupleTools v0.14.3 ⌅ [bac558e1] + OrderedCollections v1.8.2 [69de0a69] + Parsers v2.8.5 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.8.0 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.2 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.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 6.07s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Warning: Could not use exact versions of packages in manifest, re-resolving └ @ TestEnv ~/.julia/packages/TestEnv/RUPmD/src/julia-1.13/activate_set.jl:78 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.1 s ✓ Bonobo 15.1 s ✓ MathOptSetDistances 63.7 s ✓ FrankWolfe 32.1 s ✓ GraphsMatching 29.4 s ✓ SCIP 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 19.9 s ✓ Boscia 17.9 s ✓ Boscia → BosciaHiGHSExt 24.1 s ✓ Boscia → BosciaSCIPExt 32.1 s ✓ CombinatorialLinearOracles 9 dependencies successfully precompiled in 243 seconds. 167 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 279.22s ################################################################################ # Testing # Testing Boscia Test Could not use exact versions of packages in manifest, re-resolving. Note: if you do not check your manifest file into source control, then you can probably ignore this message. However, if you do check your manifest file into source control, then you probably want to pass the `allow_reresolve = false` kwarg when calling the `Pkg.test` function. Updating `/tmp/jl_ey68kB/Project.toml` [4c88cf16] + Aqua v0.8.16 [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 [86223c79] + Graphs v1.14.0 [87dc4568] + HiGHS v1.23.0 [82193955] + SCIP v0.12.8 [860ef19b] + StableRNGs v1.0.4 [fd094767] + Suppressor v0.2.8 Updating `/tmp/jl_ey68kB/Manifest.toml` [66dad0bd] + AliasTables v1.1.3 [4c88cf16] + Aqua v0.8.16 [ec485272] + ArnoldiMethod v0.4.0 [36b166db] + Boscia v0.2.12 [336ed68f] + CSV v0.10.16 [0002e35e] + CombinatorialLinearOracles v0.1.5 [1f15a43c] + CxxWrap v0.17.5 [9a962f9c] + DataAPI v1.16.0 [e2d170a0] + DataValueInterfaces v1.0.0 [31c24e10] + Distributions v0.25.126 [497a8b3b] + DoubleFloats v1.9.1 [48062228] + FilePathsBase v0.9.24 [14197337] + GenericLinearAlgebra v0.4.0 [86223c79] + Graphs v1.14.0 [c3af3a8c] + GraphsMatching v0.2.1 [87dc4568] + HiGHS v1.23.0 [34004b35] + HypergeometricFunctions v0.3.28 [d25df0c9] + Inflate v0.1.5 [842dd82b] + InlineStrings v1.4.5 [82899510] + IteratorInterfaceExtensions v1.0.0 [4076af6c] + JuMP v1.30.1 [14b1564f] + LEMONGraphs v0.1.1 ⌅ [2ab3a3ac] ↓ LogExpFunctions v1.0.1 ⇒ v0.3.29 [8c4f8055] + MathOptIIS v0.2.0 [e1d29d7a] + Missings v1.2.0 [90014a1f] + PDMats v0.11.37 [2dfb63ee] + PooledArrays v1.4.3 [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 [699a6c99] + SimpleTraits v0.9.6 [a2af1166] + SortingAlgorithms v1.2.2 [860ef19b] + StableRNGs v1.0.4 [82ae8749] + StatsAPI v1.8.0 [2913bbd2] + StatsBase v0.34.11 [4c63d2b9] + StatsFuns v2.0.1 [fd094767] + Suppressor v0.2.8 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 [ea10d353] + WeakRefStrings v1.4.3 [76eceee3] + WorkerUtilities v1.6.1 [ae81ac8f] + ASL_jll v0.1.3+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 [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 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [4af54fe1] + LazyArtifacts v1.11.0 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.14.0 [4607b0f0] + SuiteSparse [a4e569a6] + Tar v1.10.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 [458c3c95] + OpenSSL_jll v3.5.6+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [3161d3a3] + Zstd_jll v1.5.7+1 [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. To see why use `status --outdated -m` Test Successfully re-resolved Status `/tmp/jl_ey68kB/Project.toml` [4c88cf16] Aqua v0.8.16 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.126 [497a8b3b] DoubleFloats v1.9.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.23.0 [b8f27783] MathOptInterface v1.51.1 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_ey68kB/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.16 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.5 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.5 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.16.0 [31c24e10] Distributions v0.25.126 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.9.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.4.0 [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.5 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.3 [be4d8f0f] Quadmath v1.0.1 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.10 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.6 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.8.0 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.11 [4c63d2b9] StatsFuns v2.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 = 0xe63de0abed7efc9e 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 = 0xba18b63ed6d8647a LMO Tests seed = 0xdbb547e243a37732 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 = 0x26959c487053ac88 Heuristics Tests seed = 0x9113b5a71a5a27ec WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:193 Sparse Regression Tests seed = 0x264e75ebca88a3f8 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.225785e+00 2.566727e+00 3.409424e-01 1.531785e-01 2.696500e+01 1.112553e-01 11339 62 21 28 13 1 100 29 2.481770e+00 2.566727e+00 8.495673e-02 3.423231e-02 3.336100e+01 3.866791e+00 11 6 525 5 9 0 199 24 2.542012e+00 2.566727e+00 2.471470e-02 9.722496e-03 3.458100e+01 6.448628e+00 6 3 819 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.554528e+00 -8.150612e-01 7.369589e+00 0.000000e+00 Inf 1 LD 2 2.566727e+00 2.566727e+00 0.000000e+00 2.533932e+00 7.892871e-01 1 Last 2 2.566727e+00 2.566727e+00 0.000000e+00 2.718286e+00 7.357578e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.566727e+00 2.566727e+00 0.000000e+00 2.721632e+00 7.348533e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.5667269611299743 Dual Bound: 2.542012257848793 Dual Gap (relative): 0.009722495713728891 Search Statistics. Total number of nodes processed: 223 Total number of lmo calls: 824 Total time (s): 40.325 LMO calls / sec: 20.433973961562305 Nodes / sec: 5.530068195908245 LMO calls / node: 3.695067264573991 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 188 Local tightenings / node: 0.94 Total number of potential local tightenings: 313 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 7.909697e-01 1.766213e+00 9.752434e-01 1.232972e+00 2.221300e+01 1.350560e-01 10554 196 44 97 31 1 * 3 4 8.157080e-01 1.726480e+00 9.107717e-01 1.116541e+00 2.254200e+01 3.105315e-01 71 49 90 30 17 1 100 57 1.326126e+00 1.726480e+00 4.003537e-01 3.018972e-01 2.850200e+01 5.508385e+00 28 18 1228 20 16 0 200 57 1.406461e+00 1.726480e+00 3.200189e-01 2.275349e-01 3.052400e+01 8.419604e+00 30 19 1629 24 15 2 300 57 1.451353e+00 1.726480e+00 2.751267e-01 1.895657e-01 3.244400e+01 1.100358e+01 27 18 2029 21 11 3 400 57 1.478973e+00 1.726480e+00 2.475068e-01 1.673505e-01 3.451300e+01 1.324139e+01 36 22 2468 35 17 4 500 57 1.506376e+00 1.726480e+00 2.201034e-01 1.461145e-01 3.661000e+01 1.521442e+01 27 17 2916 32 14 5 600 57 1.534088e+00 1.726480e+00 1.923914e-01 1.254109e-01 3.867200e+01 1.698904e+01 30 19 3366 33 11 4 700 57 1.564842e+00 1.726480e+00 1.616377e-01 1.032933e-01 4.069900e+01 1.859997e+01 31 19 3830 39 14 4 800 57 1.591604e+00 1.726480e+00 1.348756e-01 8.474194e-02 4.283100e+01 2.000887e+01 28 18 4319 32 10 2 900 55 1.621464e+00 1.726480e+00 1.050154e-01 6.476575e-02 4.490200e+01 2.126854e+01 30 19 4816 26 8 1 1000 53 1.666488e+00 1.726480e+00 5.999206e-02 3.599910e-02 4.694900e+01 2.242859e+01 31 20 5311 21 0 0 1081 22 1.710239e+00 1.726480e+00 1.624082e-02 9.496232e-03 4.829900e+01 2.283691e+01 7 4 5639 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.211329e+00 -7.085188e-01 5.919848e+00 0.000000e+00 Inf 1 LD 2 1.726480e+00 1.726480e+00 0.000000e+00 1.899523e-01 1.052896e+01 1 Last 2 1.726480e+00 1.726480e+00 0.000000e+00 3.797520e-01 5.266595e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.726480e+00 1.726480e+00 0.000000e+00 3.842565e-01 5.204857e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.7264797029226515 Dual Bound: 1.7102388785102471 Dual Gap (relative): 0.009496231559506713 Search Statistics. Total number of nodes processed: 1103 Total number of lmo calls: 5644 Total time (s): 51.716 LMO calls / sec: 109.13450382860236 Nodes / sec: 21.32802227550468 LMO calls / node: 5.116953762466002 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: 14 Non zero entries: 1th entry: 0.16450294268717403 47th entry: 0.16450294268717403 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 8.934843e-01 1.766213e+00 8.727289e-01 9.767703e-01 2.700000e-01 1.111111e+01 265 200 44 97 31 1 * 3 4 9.101338e-01 1.726480e+00 8.163459e-01 8.969516e-01 5.310000e-01 1.318267e+01 73 51 90 30 17 1 100 28 1.420372e+00 1.726480e+00 3.061075e-01 2.155122e-01 7.089000e+00 1.805614e+01 19 13 1290 17 15 3 200 28 1.517230e+00 1.726480e+00 2.092498e-01 1.379157e-01 1.027700e+01 2.218546e+01 33 20 1921 31 17 4 300 28 1.578821e+00 1.726480e+00 1.476587e-01 9.352464e-02 1.363600e+01 2.405397e+01 29 19 2612 21 5 0 400 27 1.640468e+00 1.726480e+00 8.601162e-02 5.243114e-02 1.711400e+01 2.495033e+01 29 18 3376 32 12 4 488 12 1.709971e+00 1.726480e+00 1.650883e-02 9.654452e-03 2.016300e+01 2.479790e+01 26 16 4075 22 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.211329e+00 -7.085188e-01 5.919848e+00 0.000000e+00 Inf 1 LD 2 1.726480e+00 1.726480e+00 0.000000e+00 1.078560e-03 1.854324e+03 1 Last 2 1.726480e+00 1.726480e+00 0.000000e+00 7.253938e-03 2.757123e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.726480e+00 1.726480e+00 0.000000e+00 1.025209e-02 1.950822e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.7264797029226515 Dual Bound: 1.7099708710839234 Dual Gap (relative): 0.009654452083305608 Search Statistics. Total number of nodes processed: 500 Total number of lmo calls: 4080 Total time (s): 20.185 LMO calls / sec: 202.13029477334655 Nodes / sec: 24.77086945751796 LMO calls / node: 8.16 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: 10 Poisson Tests seed = 0xea8042ee66701916 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.777695e+02 -1.575260e+02 2.024352e+01 1.285091e-01 2.576800e+01 1.164235e-01 13323 106 43 1389 28 2 * 2 3 -1.777695e+02 -1.667787e+02 1.099084e+01 6.590077e-02 2.715100e+01 1.841553e-01 1376 86 76 858 38 6 * 23 24 -1.771247e+02 -1.674791e+02 9.645524e+00 5.759240e-02 6.601500e+01 7.119594e-01 1406 68 798 933 29 15 48 49 -1.768127e+02 -1.674791e+02 9.333562e+00 5.572970e-02 1.200040e+02 8.083064e-01 1176 72 1677 662 28 11 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.533007e+02 -3.792541e+02 7.325548e+02 0.000000e+00 Inf 1 LD 2 -1.628166e+02 -1.990447e+02 3.622812e+01 2.182487e-01 9.163858e+00 2 LD 24 -1.707213e+02 -1.850648e+02 1.434345e+01 5.720254e-01 4.195618e+01 3 LD 40 -1.727339e+02 -1.779810e+02 5.247111e+00 6.018103e-01 6.646613e+01 4 LD 42 -1.731231e+02 -1.738234e+02 7.003220e-01 6.086925e-01 6.900035e+01 5 LD 76 -1.731683e+02 -1.733923e+02 2.239604e-01 6.652355e-01 1.142453e+02 5 LD 99 -1.731710e+02 -1.732271e+02 5.605290e-02 6.988488e-01 1.416615e+02 6 LD 129 -1.731712e+02 -1.731880e+02 1.678786e-02 7.366206e-01 1.751241e+02 7 LD 156 -1.731712e+02 -1.731762e+02 4.980144e-03 7.692957e-01 2.027829e+02 7 LD 188 -1.731712e+02 -1.731727e+02 1.486694e-03 8.102721e-01 2.320208e+02 7 LD 216 -1.731712e+02 -1.731715e+02 2.615306e-04 9.350527e-01 2.310030e+02 7 LD 248 -1.731712e+02 -1.731713e+02 1.060012e-04 9.622744e-01 2.577227e+02 7 LD 282 -1.731712e+02 -1.731713e+02 2.948868e-05 9.900185e-01 2.848432e+02 7 LD 309 -1.731712e+02 -1.731712e+02 9.977611e-06 1.011624e+00 3.054494e+02 7 LD 334 -1.731712e+02 -1.731712e+02 3.914346e-06 1.032633e+00 3.234449e+02 7 P 1000 -1.731712e+02 -1.731712e+02 3.914346e-06 1.613457e+00 6.197871e+02 7 P 2000 -1.731712e+02 -1.731712e+02 3.914346e-06 2.644944e+00 7.561597e+02 7 P 3000 -1.731712e+02 -1.731712e+02 3.914346e-06 3.490192e+00 8.595515e+02 7 P 4000 -1.731712e+02 -1.731712e+02 3.914346e-06 4.287530e+00 9.329380e+02 7 P 5000 -1.731712e+02 -1.731712e+02 3.914346e-06 5.132929e+00 9.741027e+02 7 P 6000 -1.731712e+02 -1.731712e+02 3.914346e-06 5.929296e+00 1.011925e+03 7 P 7000 -1.731712e+02 -1.731712e+02 3.914346e-06 6.734714e+00 1.039391e+03 7 P 8000 -1.731712e+02 -1.731712e+02 3.914346e-06 7.517453e+00 1.064190e+03 7 P 9000 -1.731712e+02 -1.731712e+02 3.914346e-06 8.321226e+00 1.081571e+03 7 P 10000 -1.731712e+02 -1.731712e+02 3.914346e-06 9.128682e+00 1.095448e+03 7 Last 10001 -1.731712e+02 -1.731712e+02 2.031746e-06 9.133968e+00 1.094924e+03 7 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.731712e+02 -1.731712e+02 2.031746e-06 9.136913e+00 1.094571e+03 7 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -173.17123813234255 Dual Bound: -176.81269304682434 Dual Gap (relative): 0.021028058433692536 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1702 Total time (s): 132.231 LMO calls / sec: 12.871414418706658 Nodes / sec: 0.7335647465420363 LMO calls / node: 17.54639175257732 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 [ Info: Polish solution Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.706039e+02 -1.648997e+02 5.704206e+00 3.459197e-02 2.872200e+01 1.044496e-01 11550 145 30 145 15 2 * 3 4 -1.699560e+02 -1.667656e+02 3.190352e+00 1.913075e-02 3.092700e+01 2.263394e-01 261 94 73 126 16 3 29 28 -1.683249e+02 -1.667656e+02 1.559263e+00 9.350024e-03 5.550800e+01 1.026879e+00 246 97 569 114 12 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -8.145602e+01 -1.872993e+02 1.058433e+02 0.000000e+00 Inf 1 LD 2 -1.667656e+02 -1.667656e+02 0.000000e+00 1.931795e-01 1.035306e+01 1 Last 2 -1.667656e+02 -1.667656e+02 0.000000e+00 3.869105e-01 5.169154e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.667656e+02 -1.667656e+02 0.000000e+00 3.908638e-01 5.116872e+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: -166.76563132019234 Dual Bound: -168.32489403010464 Dual Gap (relative): 0.009350024327965379 Search Statistics. Total number of nodes processed: 57 Total number of lmo calls: 574 Total time (s): 58.898 LMO calls / sec: 9.745661991918231 Nodes / sec: 0.9677747971068626 LMO calls / node: 10.070175438596491 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.868240e+02 3.466636e+02 1.598395e+02 8.555620e-01 2.363300e+01 1.269411e-01 11342 136 27 72 14 1 * 3 4 2.033155e+02 3.408698e+02 1.375543e+02 6.765557e-01 2.433700e+01 2.876279e-01 179 92 65 52 11 2 100 101 2.831875e+02 3.408698e+02 5.768235e+01 2.036896e-01 3.855200e+01 5.213737e+00 78 36 1490 24 4 1 200 185 3.036310e+02 3.408698e+02 3.723881e+01 1.226449e-01 4.828600e+01 7.973326e+00 40 19 2606 12 0 0 300 197 3.168964e+02 3.408698e+02 2.397339e+01 7.565054e-02 6.556800e+01 7.579917e+00 11 7 3327 2 0 0 400 179 3.273305e+02 3.408698e+02 1.353935e+01 4.136294e-02 6.912000e+01 8.376736e+00 5 3 3883 0 0 0 * 454 139 3.307822e+02 3.404910e+02 9.708763e+00 2.935092e-02 7.023500e+01 8.443084e+00 10 5 4086 2 0 0 500 105 3.335708e+02 3.404910e+02 6.920147e+00 2.074566e-02 7.132900e+01 8.481824e+00 11 7 4273 2 0 0 561 58 3.371452e+02 3.404910e+02 3.345782e+00 9.923861e-03 7.234700e+01 8.555987e+00 11 6 4479 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 3.430927e+02 3.205648e+02 2.252790e+01 0.000000e+00 Inf 1 LD 2 3.404910e+02 3.404910e+02 9.777409e-09 1.931539e-01 1.035444e+01 2 Last 2 3.404910e+02 3.404910e+02 9.777409e-09 4.277718e-01 4.675390e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.404910e+02 3.404910e+02 9.777409e-09 4.310048e-01 4.640320e+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: 340.4909635231128 Dual Bound: 337.14518150520365 Dual Gap (relative): 0.009923861296108987 Search Statistics. Total number of nodes processed: 619 Total number of lmo calls: 4484 Total time (s): 75.701 LMO calls / sec: 59.2330352307103 Nodes / sec: 8.176906513784495 LMO calls / node: 7.24394184168013 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.868240e+02 3.466636e+02 1.598395e+02 8.555620e-01 2.773900e+01 1.081510e-01 11386 132 27 72 14 1 * 6 7 2.114367e+02 3.463804e+02 1.349437e+02 6.382227e-01 3.342800e+01 3.888955e-01 235 95 128 99 11 5 * 8 9 2.128465e+02 3.453404e+02 1.324939e+02 6.224859e-01 3.547200e+01 4.792512e-01 130 68 163 43 10 2 * 12 13 2.280397e+02 3.408698e+02 1.128301e+02 4.947828e-01 3.952000e+01 6.325911e-01 126 59 228 47 10 2 100 95 2.849324e+02 3.408698e+02 5.593747e+01 1.963184e-01 1.024350e+02 1.903646e+00 80 44 1434 24 6 0 200 157 3.101148e+02 3.408698e+02 3.075500e+01 9.917293e-02 1.492860e+02 2.391383e+00 63 30 2406 25 3 1 300 173 3.230734e+02 3.408698e+02 1.779641e+01 5.508471e-02 1.763120e+02 2.682744e+00 14 8 2994 2 2 0 * 308 167 3.237121e+02 3.404910e+02 1.677890e+01 5.183279e-02 1.780020e+02 2.690981e+00 10 5 3037 2 0 0 400 113 3.318959e+02 3.404910e+02 8.595060e+00 2.589686e-02 1.882200e+02 2.746786e+00 5 3 3398 0 0 0 481 46 3.379056e+02 3.404910e+02 2.585370e+00 7.651160e-03 1.923750e+02 2.760234e+00 12 7 3662 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 3.430927e+02 3.205648e+02 2.252790e+01 0.000000e+00 Inf 1 LD 2 3.404910e+02 3.404910e+02 9.777409e-09 2.024941e-01 9.876833e+00 2 Last 2 3.404910e+02 3.404910e+02 9.777409e-09 4.029685e-01 4.963168e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.404910e+02 3.404910e+02 9.777409e-09 4.062305e-01 4.923313e+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: 340.4909635231128 Dual Bound: 337.9055936329359 Dual Gap (relative): 0.0076511603799768535 Search Statistics. Total number of nodes processed: 531 Total number of lmo calls: 3667 Total time (s): 195.793 LMO calls / sec: 18.728963752534565 Nodes / sec: 2.7120479281690355 LMO calls / node: 6.905838041431262 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 = 0x1869cda359555591 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.122978e+01 2.898372e+01 4.021350e+01 Inf 2.784300e+01 1.077470e-01 13387 169 60 7535 23 22 100 47 1.910201e+01 2.898372e+01 9.881710e+00 5.173125e-01 4.535500e+01 3.241098e+00 78 32 2617 883 21 16 189 4 2.875280e+01 2.898372e+01 2.309277e-01 8.031486e-03 5.353600e+01 3.605051e+00 7 4 4424 4 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.983723209342635 Dual Bound: 28.752795537438512 Dual Gap (relative): 0.008031485898595009 Search Statistics. Total number of nodes processed: 193 Total number of lmo calls: 4424 Total time (s): 54.795 LMO calls / sec: 80.73729354868145 Nodes / sec: 3.52221918058217 LMO calls / node: 22.922279792746114 Total number of global tightenings: 8 Global tightenings / node: 0.04 Total number of local tightenings: 625 Local tightenings / node: 3.31 Total number of potential local tightenings: 802 Time Limit Test seed = 0x1d2cbf5f87b935f1 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 -7.466256e-01 0.000000e+00 7.466256e-01 Inf 2.489100e+01 1.205255e-01 12992 40 26 457 12 3 39 0 -1.977197e-02 0.000000e+00 1.977197e-02 Inf 2.625000e+01 1.485714e+00 3 2 496 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: -0.019771974922012298 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 39 Total number of lmo calls: 496 Total time (s): 27.439 LMO calls / sec: 18.076460512409344 Nodes / sec: 1.4213345967418638 LMO calls / node: 12.717948717948717 Total number of global tightenings: 5 Global tightenings / node: 0.13 Total number of local tightenings: 38 Local tightenings / node: 0.97 Total number of potential local tightenings: 49 Strong Convexity and Sharpness Tests seed = 0xb9629786b7ce5825 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.128141e+02 2.131220e+02 3.079292e-01 1.446940e-03 2.354100e+01 1.274372e-01 10711 0 12 21 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 213.12204637413424 Dual Bound: 212.8141171787833 Dual Gap (relative): 0.0014469397022766502 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 12 Total time (s): 24.866 LMO calls / sec: 0.48258666452183707 Nodes / sec: 0.12064666613045927 LMO calls / node: 4.0 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 15 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:135 ====================================================================================== 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: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 0x00007f4ccee04790 Total snapshots: 419. Utilization: 0% ╎419 @Base/task.jl:1170 wait_forever() 418╎ 419 @Base/task.jl:1248 wait() [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: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) Allocations: 25967222 (Pool: 25966492; Big: 730); GC: 19 PkgEval terminated after 2734.24s: test duration exceeded the time limit