Package evaluation to test Boscia on Julia 1.12.7-DEV.42 (6f510b6086*) started at 2026-06-19T19:33:42.848 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.12` Set-up completed after 8.2s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [36b166db] + Boscia v0.2.12 Updating `~/.julia/environments/v1.12/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.12.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.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.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [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.62s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 31955.3 ms ✓ Boscia 216459.0 ms ✓ CombinatorialLinearOracles 59194.4 ms ✓ Boscia → BosciaHiGHSExt 59589.6 ms ✓ Boscia → BosciaSCIPExt 4 dependencies successfully precompiled in 374 seconds. 173 already precompiled. 24 dependencies precompiled but different versions are currently loaded (ArgTools, Base64, Dates, Downloads, JuliaSyntaxHighlighting, LibCURL, LibCURL_jll, LibGit2, LibGit2_jll, LibSSH2_jll, Logging, Markdown, MozillaCACerts_jll, NetworkOptions, OpenSSL_jll, Pkg, Printf, StyledStrings, TOML, Tar, UUIDs, Zlib_jll, nghttp2_jll and p7zip_jll). Restart julia to access the new versions. Otherwise, 97 dependents of these packages may trigger further precompilation to work with the unexpected versions. Precompilation completed after 397.69s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_GmTAOq/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.127 [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.12.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_GmTAOq/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.127 [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.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 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.37 [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 [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.12 [4c63d2b9] StatsFuns v2.2.0 [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.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+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.12.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.12.1 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.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.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.15.0+0 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2025.11.4 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.6+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 10561.0 ms ✓ Distributions 1 dependency successfully precompiled in 14 seconds. 40 already precompiled. 22 dependencies precompiled but different versions are currently loaded (CompilerSupportLibraries_jll, DataStructures, Dates, DocStringExtensions, FillArrays, FillArrays → FillArraysSparseArraysExt, FillArrays → FillArraysStatisticsExt, IrrationalConstants, JLLWrappers, LogExpFunctions, OpenLibm_jll, OpenSpecFun_jll, OrderedCollections, Preferences, Printf, Serialization, SparseArrays, SpecialFunctions, Statistics, Statistics → SparseArraysExt, SuiteSparse_jll and TOML). Restart julia to access the new versions. Otherwise, 12 dependents of these packages may trigger further precompilation to work with the unexpected versions. Precompiling packages... 4888.0 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 48 already precompiled. 47 dependencies precompiled but different versions are currently loaded (AliasTables, Base64, CompilerSupportLibraries_jll, DataAPI, DataStructures, Dates, Distributions, DocStringExtensions, FillArrays, FillArrays → FillArraysPDMatsExt, FillArrays → FillArraysSparseArraysExt, FillArrays → FillArraysStatisticsExt, HypergeometricFunctions, InteractiveUtils, IrrationalConstants, JLLWrappers, JuliaSyntaxHighlighting, LogExpFunctions, Logging, Markdown, Missings, OpenLibm_jll, OpenSpecFun_jll, OrderedCollections, PDMats, PDMats → StatsBaseExt, Preferences, Printf, PtrArrays, QuadGK, Reexport, Rmath, Rmath_jll, Serialization, SortingAlgorithms, SparseArrays, SpecialFunctions, Statistics, Statistics → SparseArraysExt, StatsAPI, StatsBase, StatsFuns, StyledStrings, SuiteSparse, SuiteSparse_jll, TOML and Test). Restart julia to access the new versions. Otherwise, 1 dependent of these packages may trigger further precompilation to work with the unexpected versions. Precompiling packages... 7417.2 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 9 seconds. 49 already precompiled. 48 dependencies precompiled but different versions are currently loaded (AliasTables, ChainRulesCore, ChainRulesCore → ChainRulesCoreSparseArraysExt, Compat, Compat → CompatLinearAlgebraExt, CompilerSupportLibraries_jll, DataAPI, DataStructures, Dates, Distributions, DocStringExtensions, FillArrays, FillArrays → FillArraysPDMatsExt, FillArrays → FillArraysSparseArraysExt, FillArrays → FillArraysStatisticsExt, HypergeometricFunctions, IrrationalConstants, JLLWrappers, LogExpFunctions, LogExpFunctions → LogExpFunctionsChainRulesCoreExt, Missings, OpenLibm_jll, OpenSpecFun_jll, OrderedCollections, PDMats, PDMats → StatsBaseExt, Preferences, Printf, PtrArrays, QuadGK, Reexport, Rmath, Rmath_jll, Serialization, SortingAlgorithms, SparseArrays, SpecialFunctions, SpecialFunctions → SpecialFunctionsChainRulesCoreExt, Statistics, Statistics → SparseArraysExt, StatsAPI, StatsBase, StatsFuns, StatsFuns → StatsFunsChainRulesCoreExt, SuiteSparse, SuiteSparse_jll, TOML and UUIDs). Restart julia to access the new versions. Otherwise, 1 dependent of these packages may trigger further precompilation to work with the unexpected versions. Interface Tests seed = 0x5955ac36171d184b 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 = 0x610b53117046f979 LMO Tests seed = 0x535430bf297f4ea3 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 = 0x08e3bb237649ea13 Heuristics Tests seed = 0x1436c582227a53c5 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 = 0xe22db0fdc971fe49 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.491750e+00 2.552513e+00 6.076313e-02 2.438573e-02 1.865600e+01 1.608062e-01 6355 16 6 5 3 0 * 2 3 2.491750e+00 2.524076e+00 3.232602e-02 1.297322e-02 2.195500e+01 2.277386e-01 14 8 11 5 3 0 3 4 2.504905e+00 2.524076e+00 1.917057e-02 7.653214e-03 2.196700e+01 3.186598e-01 10 6 15 2 2 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 4.418224e+00 2.058837e+00 2.359388e+00 0.000000e+00 Inf 1 LD 2 2.524076e+00 2.524076e+00 0.000000e+00 2.188027e+00 9.140656e-01 1 Last 2 2.524076e+00 2.524076e+00 0.000000e+00 2.380971e+00 8.399933e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.524076e+00 2.524076e+00 0.000000e+00 2.383963e+00 8.389393e-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.5240755883326322 Dual Bound: 2.5049050146171843 Dual Gap (relative): 0.007653213835885796 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 20 Total time (s): 26.119 LMO calls / sec: 0.7657260997741108 Nodes / sec: 0.2680041349209388 LMO calls / node: 2.857142857142857 Total number of global tightenings: 47 Global tightenings / node: 15.67 Total number of local tightenings: 48 Local tightenings / node: 16.0 Total number of potential local tightenings: 48 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.717808e+00 2.029579e+00 3.117709e-01 1.814935e-01 1.671400e+01 1.794902e-01 7109 102 25 49 14 1 47 10 2.014272e+00 2.029579e+00 1.530714e-02 7.599344e-03 1.883800e+01 3.025799e+00 24 16 391 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 7.400653e+00 -5.535575e-01 7.954211e+00 0.000000e+00 Inf 1 LD 2 2.029579e+00 2.029579e+00 0.000000e+00 1.947120e-01 1.027158e+01 1 Last 2 2.029579e+00 2.029579e+00 0.000000e+00 3.865207e-01 5.174367e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.029579e+00 2.029579e+00 0.000000e+00 3.896174e-01 5.133241e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.029578911294427 Dual Bound: 2.0142717668268615 Dual Gap (relative): 0.007599344199556149 Search Statistics. Total number of nodes processed: 57 Total number of lmo calls: 396 Total time (s): 20.891 LMO calls / sec: 18.95553108994304 Nodes / sec: 2.7284476568857405 LMO calls / node: 6.947368421052632 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Non zero entries: 10th entry: 0.1666686796723029 29th entry: 0.1666686796723029 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.828799e+00 2.029579e+00 2.007795e-01 1.097876e-01 1.730000e-01 1.734104e+01 165 124 25 49 14 1 18 3 2.009777e+00 2.029579e+00 1.980183e-02 9.852750e-03 1.260000e+00 1.666667e+01 29 20 202 15 9 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.400653e+00 -5.535575e-01 7.954211e+00 0.000000e+00 Inf 1 LD 2 2.029579e+00 2.029579e+00 0.000000e+00 1.295310e-03 1.544032e+03 1 Last 2 2.029579e+00 2.029579e+00 0.000000e+00 5.878109e-03 3.402455e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.029579e+00 2.029579e+00 0.000000e+00 8.343029e-03 2.397211e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.029578911294427 Dual Bound: 2.0097770802985986 Dual Gap (relative): 0.009852749934279434 Search Statistics. Total number of nodes processed: 21 Total number of lmo calls: 207 Total time (s): 1.283 LMO calls / sec: 161.34060795011692 Nodes / sec: 16.36788776305534 LMO calls / node: 9.857142857142858 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Poisson Tests seed = 0xbceae8ef2529204f 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 -4.867127e+02 -4.611720e+02 2.554073e+01 5.538223e-02 1.948100e+01 1.539962e-01 9444 106 42 1263 23 5 * 4 5 -4.864648e+02 -4.633863e+02 2.307853e+01 4.980408e-02 2.576900e+01 3.492569e-01 1376 88 153 1094 27 14 * 7 8 -4.859312e+02 -4.642053e+02 2.172589e+01 4.680233e-02 3.219500e+01 4.659109e-01 2276 81 255 1915 28 11 * 17 18 -4.852890e+02 -4.667440e+02 1.854505e+01 3.973282e-02 5.383500e+01 6.501347e-01 1392 83 591 1218 25 13 * 24 25 -4.851293e+02 -4.672372e+02 1.789206e+01 3.829331e-02 6.911600e+01 7.089531e-01 1198 72 832 981 27 19 * 32 33 -4.849821e+02 -4.736826e+02 1.129943e+01 2.385443e-02 8.700300e+01 7.471007e-01 1183 90 1122 970 24 16 46 47 -4.846197e+02 -4.736826e+02 1.093704e+01 2.308939e-02 1.200100e+02 7.749354e-01 1173 73 1595 944 22 21 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.853931e+02 -8.113553e+02 1.596748e+03 0.000000e+00 Inf 1 LD 2 -4.714406e+02 -5.143535e+02 4.291286e+01 1.989260e-01 1.005399e+01 2 LD 34 -4.777578e+02 -4.975777e+02 1.981984e+01 5.188382e-01 6.553103e+01 4 LD 44 -4.792021e+02 -4.846508e+02 5.448621e+00 5.349304e-01 8.225368e+01 5 LD 129 -4.802602e+02 -4.820278e+02 1.767617e+00 6.124122e-01 2.106424e+02 7 LD 202 -4.804085e+02 -4.811409e+02 7.323991e-01 7.546018e-01 2.676909e+02 7 LD 229 -4.804318e+02 -4.806291e+02 1.973470e-01 7.784092e-01 2.941897e+02 8 LD 251 -4.804320e+02 -4.804847e+02 5.269721e-02 7.961282e-01 3.152759e+02 9 LD 322 -4.804322e+02 -4.804508e+02 1.860593e-02 8.406340e-01 3.830442e+02 9 LD 403 -4.804322e+02 -4.804388e+02 6.653916e-03 9.084657e-01 4.436051e+02 9 LD 467 -4.804322e+02 -4.804347e+02 2.503256e-03 9.628097e-01 4.850387e+02 9 LD 510 -4.804322e+02 -4.804330e+02 8.539944e-04 9.986871e-01 5.106705e+02 9 LD 587 -4.804322e+02 -4.804325e+02 2.980839e-04 1.054963e+00 5.564178e+02 10 LD 652 -4.804322e+02 -4.804323e+02 1.130242e-04 1.101179e+00 5.920924e+02 10 LD 737 -4.804322e+02 -4.804322e+02 3.571918e-05 1.161387e+00 6.345862e+02 10 LD 801 -4.804322e+02 -4.804322e+02 1.638994e-05 1.228900e+00 6.518024e+02 10 LD 845 -4.804322e+02 -4.804322e+02 6.535776e-06 1.277744e+00 6.613220e+02 10 LD 906 -4.804322e+02 -4.804322e+02 2.941118e-06 1.324524e+00 6.840192e+02 10 P 1000 -4.804322e+02 -4.804322e+02 2.941118e-06 1.419857e+00 7.042963e+02 10 P 2000 -4.804322e+02 -4.804322e+02 2.941118e-06 2.225927e+00 8.985021e+02 10 LD 2034 -4.804322e+02 -4.804322e+02 1.255204e-06 2.242399e+00 9.070644e+02 10 P 3000 -4.804322e+02 -4.804322e+02 1.255204e-06 2.835190e+00 1.058130e+03 10 P 4000 -4.804322e+02 -4.804322e+02 1.255204e-06 3.354107e+00 1.192568e+03 10 P 5000 -4.804322e+02 -4.804322e+02 1.255204e-06 3.881357e+00 1.288209e+03 10 P 6000 -4.804322e+02 -4.804322e+02 1.255204e-06 4.402186e+00 1.362959e+03 10 P 7000 -4.804322e+02 -4.804322e+02 1.255204e-06 4.904010e+00 1.427403e+03 10 P 8000 -4.804322e+02 -4.804322e+02 1.255204e-06 5.386441e+00 1.485211e+03 10 P 9000 -4.804322e+02 -4.804322e+02 1.255204e-06 5.878645e+00 1.530965e+03 10 P 10000 -4.804322e+02 -4.804322e+02 1.255204e-06 6.356143e+00 1.573281e+03 10 Last 10001 -4.804322e+02 -4.804322e+02 1.255204e-06 6.360119e+00 1.572455e+03 10 ---------------------------------------------------------------------------------------------------------------- PP 10001 -4.804322e+02 -4.804322e+02 7.314231e-06 6.362703e+00 1.571816e+03 10 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -480.43218509833616 Dual Bound: -484.619665845634 Dual Gap (relative): 0.008716070399073596 Search Statistics. Total number of nodes processed: 93 Total number of lmo calls: 1628 Total time (s): 128.061 LMO calls / sec: 12.712691607905606 Nodes / sec: 0.7262164124909223 LMO calls / node: 17.50537634408602 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -4.334110e+02 -4.297059e+02 3.705138e+00 8.622497e-03 1.901500e+01 1.577702e-01 6914 112 25 61 9 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -2.328729e+02 -4.644436e+02 2.315707e+02 0.000000e+00 Inf 1 LD 2 -4.297059e+02 -4.297059e+02 0.000000e+00 1.724345e-01 1.159861e+01 1 Last 2 -4.297059e+02 -4.297059e+02 0.000000e+00 3.435933e-01 5.820836e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -4.297059e+02 -4.297059e+02 0.000000e+00 3.471261e-01 5.761596e+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: -429.70586315602543 Dual Bound: -433.4110007118013 Dual Gap (relative): 0.008622497092692796 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 30 Total time (s): 20.84 LMO calls / sec: 1.4395393474088292 Nodes / sec: 0.14395393474088292 LMO calls / node: 10.0 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.910148e+02 3.330529e+02 1.420381e+02 7.435976e-01 1.512200e+01 1.983865e-01 6689 119 27 117 12 0 * 2 3 1.910148e+02 3.326795e+02 1.416647e+02 7.416428e-01 1.531300e+01 3.265200e-01 187 86 48 84 13 2 * 4 5 2.100371e+02 3.301948e+02 1.201577e+02 5.720787e-01 1.576600e+01 5.708487e-01 257 78 90 118 11 3 * 37 32 2.635497e+02 3.300824e+02 6.653268e+01 2.524484e-01 2.061700e+01 3.346753e+00 100 42 631 49 7 1 100 73 2.950894e+02 3.300824e+02 3.499296e+01 1.185843e-01 4.067100e+01 4.253645e+00 191 58 1376 116 7 2 200 73 3.170537e+02 3.300824e+02 1.302866e+01 4.109291e-02 5.080800e+01 5.373170e+00 14 8 2031 2 2 2 279 26 3.269229e+02 3.300824e+02 3.159463e+00 9.664245e-03 5.262700e+01 5.795504e+00 14 9 2339 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 ---------------------------------------------------------------------------------------------------------------- Last 0 3.300824e+02 3.300824e+02 0.000000e+00 7.137510e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.300824e+02 3.300824e+02 0.000000e+00 1.591681e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 330.0823603255551 Dual Bound: 326.92289727197385 Dual Gap (relative): 0.009664245239307378 Search Statistics. Total number of nodes processed: 305 Total number of lmo calls: 2343 Total time (s): 54.424 LMO calls / sec: 43.0508599147435 Nodes / sec: 5.604145230045568 LMO calls / node: 7.6819672131147545 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.910148e+02 3.330529e+02 1.420381e+02 7.435976e-01 2.105300e+01 1.424975e-01 7741 131 27 117 12 0 * 3 4 2.100371e+02 3.326795e+02 1.226425e+02 5.839087e-01 2.326300e+01 3.009070e-01 208 98 70 84 13 2 * 4 5 2.100371e+02 3.319019e+02 1.218648e+02 5.802064e-01 2.421500e+01 3.716705e-01 189 90 90 74 12 1 * 16 17 2.401045e+02 3.301948e+02 9.009025e+01 3.752126e-01 3.465000e+01 9.523810e-01 140 71 306 54 10 6 * 60 45 2.759309e+02 3.300824e+02 5.415145e+01 1.962500e-01 5.887900e+01 1.783318e+00 92 51 854 29 4 1 100 63 2.939800e+02 3.300824e+02 3.610232e+01 1.228053e-01 7.470500e+01 2.181916e+00 42 23 1224 12 0 0 200 57 3.146117e+02 3.300824e+02 1.547070e+01 4.917395e-02 9.723500e+01 2.643081e+00 13 8 1793 2 2 0 259 8 3.273481e+02 3.300824e+02 2.734295e+00 8.352868e-03 1.000640e+02 2.668292e+00 5 3 1976 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 3.300824e+02 3.300824e+02 0.000000e+00 9.496320e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.300824e+02 3.300824e+02 0.000000e+00 1.979138e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 330.0823603255551 Dual Bound: 327.3480652855029 Dual Gap (relative): 0.008352867574358262 Search Statistics. Total number of nodes processed: 267 Total number of lmo calls: 1980 Total time (s): 102.044 LMO calls / sec: 19.40339461408804 Nodes / sec: 2.616518364627024 LMO calls / node: 7.415730337078652 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 = 0xba51ef414f177bff 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.239370e+01 5.913818e+01 7.153189e+01 Inf 2.124300e+01 1.412230e-01 9626 127 54 6012 20 17 * 3 4 -7.870533e+00 5.823756e+01 6.610809e+01 Inf 2.180000e+01 3.211009e-01 243 144 135 1870 20 12 * 7 8 -4.994186e+00 4.863815e+01 5.363233e+01 Inf 2.332100e+01 6.431971e-01 488 91 270 10001 21 7 100 71 2.494315e+01 4.863815e+01 2.369500e+01 9.499603e-01 4.006400e+01 4.268171e+00 90 28 2529 941 15 4 194 81 3.995548e+01 4.863815e+01 8.682666e+00 2.173085e-01 6.000300e+01 4.583104e+00 90 16 5040 2083 16 21 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 48.638145672645166 Dual Bound: 39.95547957533336 Dual Gap (relative): 0.21730851912166965 Search Statistics. Total number of nodes processed: 275 Total number of lmo calls: 5040 Total time (s): 60.987 LMO calls / sec: 82.64056274287962 Nodes / sec: 4.50915768934363 LMO calls / node: 18.327272727272728 Total number of global tightenings: 26 Global tightenings / node: 0.13 Total number of local tightenings: 913 Local tightenings / node: 4.71 Total number of potential local tightenings: 1224 Time Limit Test seed = 0x91c1a7cbd2bc2795 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 -8.554704e+00 -5.152840e+00 3.401863e+00 6.601919e-01 2.126700e+01 1.410636e-01 11144 2055 31 10001 16 4 * 9 10 -8.128326e+00 -5.606888e+00 2.521437e+00 4.497035e-01 2.986500e+01 6.361962e-01 751 471 225 10001 12 11 10 11 -8.128326e+00 -5.606888e+00 2.521437e+00 4.497035e-01 3.005300e+01 6.987655e-01 182 125 244 1848 11 17 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -5.606888224669462 Dual Bound: -8.128325720248949 Dual Gap (relative): 0.4497035422403361 Search Statistics. Total number of nodes processed: 21 Total number of lmo calls: 244 Total time (s): 30.924 LMO calls / sec: 7.8903117319881 Nodes / sec: 0.6790842064415987 LMO calls / node: 11.619047619047619 Total number of global tightenings: 1 Global tightenings / node: 0.1 Total number of local tightenings: 16 Local tightenings / node: 1.6 Total number of potential local tightenings: 28 Strong Convexity and Sharpness Tests seed = 0x31ab91861eecea15 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 0 2.108571e+02 2.108571e+02 0.000000e+00 0.000000e+00 1.554500e+01 6.432937e-02 5528 0 4 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 210.85710793410425 Dual Bound: 210.85710793410425 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 4 Total time (s): 16.484 LMO calls / sec: 0.24265954865323947 Nodes / sec: 0.060664887163309866 LMO calls / node: 4.0 Total number of global tightenings: 10 Global tightenings / node: 10.0 Total number of local tightenings: 10 Local tightenings / node: 10.0 Total number of potential local tightenings: 20 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.021238e+02 2.022564e+02 1.326550e-01 6.563056e-04 1.588500e+01 1.888574e-01 5281 0 6 4 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 202.25644201643837 Dual Bound: 202.12378704851704 Dual Gap (relative): 0.0006563055732252028 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 6 Total time (s): 16.743 LMO calls / sec: 0.3583587170757929 Nodes / sec: 0.17917935853789646 LMO calls / node: 2.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: 18 Branching Strategy Tests seed = 0xc36ecdc7be8cfb70 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 1.847900e+01 1.623464e-01 8212 57 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.030200e+01 3.201655e+00 10 6 953 27 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321771298479149 Dual Gap (relative): 0.008253858173238702 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 953 Total time (s): 21.241 LMO calls / sec: 44.86606091991902 Nodes / sec: 3.060119580057436 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 4.240000e-01 7.075472e+00 279 45 48 3749 24 11 87 0 7.016760e+00 7.382204e+00 3.654439e-01 5.208158e-02 1.834000e+00 4.743730e+01 3 2 1015 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.016760210963634 Dual Gap (relative): 0.05208157873473409 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.835 LMO calls / sec: 553.133514986376 Nodes / sec: 47.41144414168937 LMO calls / node: 11.666666666666666 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 53 Local tightenings / node: 0.61 Total number of potential local tightenings: 108 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest most infeasible gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 4.560000e-01 6.578947e+00 288 35 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.615000e+00 3.653251e+01 2 1 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.615 LMO calls / sec: 531.8885448916409 Nodes / sec: 36.53250773993808 LMO calls / node: 14.559322033898304 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 77 Local tightenings / node: 1.35 Total number of potential local tightenings: 167 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Uniform Random Choice FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 4.070000e-01 7.371007e+00 259 33 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.611000e+00 4.655493e+01 9 5 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.612 LMO calls / sec: 559.5533498759305 Nodes / sec: 46.526054590570716 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.580000e-01 8.379888e+00 250 32 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.925000e+00 5.038961e+01 3 1 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.926 LMO calls / sec: 609.5534787123572 Nodes / sec: 50.36344755970924 LMO calls / node: 12.103092783505154 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 82 Local tightenings / node: 0.88 Total number of potential local tightenings: 170 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.550000e-01 5.405405e+00 552 53 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 9.230000e-01 9.750813e+00 132 33 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 1.072000e+00 1.026119e+01 146 38 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.848000e+00 2.041024e+01 110 38 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.057900e+01 2.051234e+01 72 22 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.722500e+01 2.328012e+01 54 21 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.394600e+01 2.493109e+01 59 19 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 3.095000e+01 2.562197e+01 57 20 11544 282 17 18 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 154 running 1 of 1 signal (10): User defined signal 1 __gmpq_clear at /opt/julia/bin/../lib/julia/libgmp.so.10 (unknown line) _ZNSt6vectorIN5boost14multiprecision6numberINS1_8backends12gmp_rationalELNS1_26expression_template_optionE0EEESaIS6_EED2Ev at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex17SLUFactorRationalD2Ev at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex10SoPlexBaseIdED1Ev at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpiFree at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpFree 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 [inlined] free_model at /home/pkgeval/.julia/packages/Boscia/EgUlC/ext/BosciaSCIPExt.jl:49 [inlined] free_model at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:455 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:130 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:108 [inlined] 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.627300e+01 2.665895e+01 49 28 13970 61 0 0 #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:483 unknown function (ip: 0x794aebd3574a) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188 unknown function (ip: 0x794aebd2a957) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29 unknown function (ip: 0x794aebd01677) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269 unknown function (ip: 0x794aebcfe2bd) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28 #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x794aebcf6dd8) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:689 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 include_string at ./loading.jl:2873 _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 _include at ./loading.jl:2933 include at ./Base.jl:307 IncludeInto at ./Base.jl:308 jfptr_IncludeInto_53184.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:689 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 include_string at ./loading.jl:2873 _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 _include at ./loading.jl:2933 include at ./Base.jl:307 IncludeInto at ./Base.jl:308 jfptr_IncludeInto_53184.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:689 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 exec_options at ./client.jl:283 _start at ./client.jl:550 jfptr__start_64964.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1139 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x794b3ec35249) 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 ============================================================== 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 4.246300e+01 2.682335e+01 66 23 16456 348 17 12 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 poptask at ./task.jl:1216 wait at ./task.jl:1228 #wait#406 at ./condition.jl:141 wait at ./condition.jl:136 [inlined] wait at ./process.jl:693 wait at ./process.jl:686 jfptr_wait_70429.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 subprocess_handler at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2556 unknown function (ip: 0x79cca39815a3) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 #205 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2496 withenv at ./env.jl:265 #190 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2311 with_temp_env at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2164 #186 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2278 #mktempdir#21 at ./file.jl:936 unknown function (ip: 0x79cca397674c) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 mktempdir at ./file.jl:932 mktempdir at ./file.jl:932 #sandbox#182 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2225 [inlined] sandbox at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2215 unknown function (ip: 0x79cca396bb49) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 #test#193 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2481 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2387 [inlined] #test#174 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:552 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:529 unknown function (ip: 0x79cca396b781) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 #test#84 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:169 unknown function (ip: 0x79cca3969be0) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:158 #test#82 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:157 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:157 [inlined] #test#81 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:156 [inlined] test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:156 unknown function (ip: 0x79cca39607af) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:689 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 include_string at ./loading.jl:2873 _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 _include at ./loading.jl:2933 include at ./Base.jl:306 exec_options at ./client.jl:317 _start at ./client.jl:550 jfptr__start_64964.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1139 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x79ccbe2d7249) 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 ============================================================== 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.752300e+01 2.678703e+01 37 25 18546 31 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.12/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000079cca39fc010 Total snapshots: 344. Utilization: 0% ╎344 @Base/client.jl:550 _start() ╎ 344 @Base/client.jl:317 exec_options(opts::Base.JLOptions) ╎ 344 @Base/Base.jl:306 include(mod::Module, _path::String) ╎ 344 @Base/loading.jl:2933 _include(mapexpr::Function, mod::Module, _pat… ╎ 344 @Base/loading.jl:2873 include_string(mapexpr::typeof(identity), mo… ╎ 344 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 344 @Pkg/src/API.jl:156 kwcall(::@NamedTuple{julia_args::Cmd}, ::typ… ╎ ╎ 344 @Pkg/src/API.jl:156 #test#81 ╎ ╎ 344 @Pkg/src/API.jl:157 test ╎ ╎ 344 @Pkg/src/API.jl:157 test(pkgs::Vector{String}; kwargs::Base.P… ╎ ╎ 344 @Pkg/src/API.jl:158 kwcall(::@NamedTuple{julia_args::Cmd}, :… ╎ ╎ ╎ 344 @Pkg/src/API.jl:169 test(pkgs::Vector{PackageSpec}; io::IOC… ╎ ╎ ╎ 344 @Pkg/src/API.jl:529 kwcall(::@NamedTuple{julia_args::Cmd, … ╎ ╎ ╎ 344 @Pkg/src/API.jl:552 test(ctx::Pkg.Types.Context, pkgs::Ve… ╎ ╎ ╎ 344 @Pkg/…erations.jl:2387 test ╎ ╎ ╎ 344 @Pkg/…erations.jl:2481 test(ctx::Pkg.Types.Context, pkg… ╎ ╎ ╎ ╎ 344 @Pkg/…rations.jl:2215 kwcall(::@NamedTuple{preferences… ╎ ╎ ╎ ╎ 344 @Pkg/…rations.jl:2225 #sandbox#182 ╎ ╎ ╎ ╎ 344 @Base/file.jl:932 mktempdir(fn::Function) ╎ ╎ ╎ ╎ 344 @Base/file.jl:932 mktempdir(fn::Function, parent::S… ╎ ╎ ╎ ╎ 344 @Base/file.jl:936 mktempdir(fn::Pkg.Operations.var… ╎ ╎ ╎ ╎ ╎ 344 @Pkg/…tions.jl:2278 (::Pkg.Operations.var"#186#18… ╎ ╎ ╎ ╎ ╎ 344 @Pkg/…tions.jl:2164 with_temp_env(fn::Pkg.Operat… ╎ ╎ ╎ ╎ ╎ 344 @Pkg/…tions.jl:2311 (::Pkg.Operations.var"#190#… ╎ ╎ ╎ ╎ ╎ 344 @Base/env.jl:265 withenv(::Pkg.Operations.var"… ╎ ╎ ╎ ╎ ╎ 344 @Pkg/…ions.jl:2496 (::Pkg.Operations.var"#205… ╎ ╎ ╎ ╎ ╎ ╎ 344 @Pkg/…ons.jl:2556 subprocess_handler(cmd::Cm… ╎ ╎ ╎ ╎ ╎ ╎ 344 @Base/…ss.jl:686 wait(x::Base.Process) ╎ ╎ ╎ ╎ ╎ ╎ 344 @Base/…ss.jl:693 wait(x::Base.Process, syn… ╎ ╎ ╎ ╎ ╎ ╎ 344 @Base/…on.jl:136 wait ╎ ╎ ╎ ╎ ╎ ╎ 344 @Base/…on.jl:141 wait(c::Base.GenericCon… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 344 @Base/…sk.jl:1228 wait() 343╎ ╎ ╎ ╎ ╎ ╎ ╎ 344 @Base/…sk.jl:1216 poptask(W::Base.Intr… 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 5.902700e+01 2.319278e+01 8 4 20396 14 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.12/Profile/src/Profile.jl:1361 801 570 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 6.587100e+01 2.081341e+01 3 2 20398 1 7 2 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x0000794b243fc010 Total snapshots: 86. Utilization: 100% ╎86 @Base/client.jl:550 _start() ╎ 86 @Base/client.jl:283 exec_options(opts::Base.JLOptions) ╎ 86 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ 86 @Base/Base.jl:308 (::Base.IncludeInto)(fname::String) ╎ 86 @Base/Base.jl:307 include(mapexpr::Function, mod::Module, _path::Str… ╎ 86 @Base/loading.jl:2933 _include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 86 @Base/loading.jl:2873 include_string(mapexpr::typeof(identity), mo… ╎ ╎ 86 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 86 @Base/Base.jl:308 (::Base.IncludeInto)(fname::String) ╎ ╎ 86 @Base/Base.jl:307 include(mapexpr::Function, mod::Module, _path… ╎ ╎ 86 @Base/loading.jl:2933 _include(mapexpr::Function, mod::Module,… ╎ ╎ ╎ 86 @Base/loading.jl:2873 include_string(mapexpr::typeof(identity… ╎ ╎ ╎ 86 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ 86 @Boscia/…_oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 86 @Boscia/…oracle.jl:834 #solve#147 ╎ ╎ ╎ 86 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ ╎ 86 @Boscia/…erface.jl:269 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 86 @Boscia/…bonobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 85 @Boscia/…onobo.jl:36 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 2 @Boscia/…node.jl:333 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 2 @Boscia/…ties.jl:30 check_feasibility ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…acle.jl:474 check_feasibility(lmo::FrankWo… ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…apper.jl:427 optimize!(o::SCIP.Optimizer) ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…apper.jl:16 macro expansion 2╎ ╎ ╎ ╎ ╎ 2 @SCIP/…SCIP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:350 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 1 @Boscia/…blem.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…acle.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:234 is_linear_feasible(o::SCIP.Opt… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:251 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:428 get(o::SCIP.Optimizer, ::Math… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:35 is_valid ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:503 get ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:242 ht_keyindex(h::Dict{Tuple{T… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:128 hashindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ing.jl:28 hash ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…le.jl:580 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…le.jl:580 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:33 hash ╎ ╎ ╎ ╎ 81 @Boscia/…node.jl:373 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 81 @Boscia/…ants.jl:188 kwcall(::@NamedTuple{epsilon::F… ╎ ╎ ╎ ╎ ╎ 81 @Boscia/…ants.jl:208 #solve_frank_wolfe#7 ╎ ╎ ╎ ╎ ╎ 1 @Base/…tuple.jl:170 indexed_iterate 1╎ ╎ ╎ ╎ ╎ 1 @Base/…tuple.jl:170 indexed_iterate ╎ ╎ ╎ ╎ ╎ 80 @FrankWolfe/…jl:76 kwcall(::@NamedTuple{line_searc… ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…jl:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:358 _optimize_and_return(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:16 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:118 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:234 is_linear_feasible(o::SCIP… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:249 is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:47 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @MathOptInterface/…:115 throw_if_not_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:35 is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:503 get 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:236 ht_keyindex(h::Dict{T… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…jl:206 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…est.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1041 dot(x::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1042 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ray.jl:929 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:920 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…oat.jl:495 + ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:227 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:9 muladd_memory_mode(memory_mode… ╎ ╎ ╎ ╎ ╎ 1 @Base/…cast.jl:902 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…cast.jl:905 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:947 copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:994 copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:995 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:616 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:620 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:671 _broadcast_getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:695 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:696 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:665 _broadcast_getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:920 getindex ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…jl:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:453 perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:50 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:265 mul!(C::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:71 mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:74 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:79 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:636 gemv! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:668 gemv!(trans::Char, a… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:52 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:71 mul!(y::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:74 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:79 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:636 gemv!(y::Vector{Float6… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:668 gemv!(trans::Char, al… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:467 perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1041 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1042 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:929 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:920 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:920 getindex 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:245 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 23 @FrankWolfe/…jl:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 23 @Boscia/…cks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 23 @Boscia/…ks.jl:59 process_FW_callback_logic 1╎ ╎ ╎ ╎ ╎ ╎ 23 @Boscia/…ks.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 22 @Boscia/…e.jl:591 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…t.jl:28 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 10 @SCIP/…nce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 10 @Base/…ay.jl:800 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 10 @Base/…ay.jl:826 collect_to_with_first!(d… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 9 @Base/…ay.jl:848 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 9 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 9 none:? #sol_values##0 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:20760 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 8 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 8 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 8 @Base/…ct.jl:476 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:236 ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ct.jl:242 ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ct.jl:128 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ng.jl:28 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 4 @Base/…ng.jl:37 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ng.jl:79 hash_uint ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…ng.jl:47 hash_64_64 ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Base/…rs.jl:645 + 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +5 1 @Base/int.jl:87 + 3╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 3 @Base/…ls.jl:856 objectid ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:246 ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:133 isslotempty 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:248 ht_keyindex(h::Di… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:386 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:249 ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:852 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:986 setindex! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:991 _setindex! ╎ ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…t.jl:30 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:44 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ath.jl:8 -(A::Vector{Float64}, B::V… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:883 broadcast_preserving_zer… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:894 materialize ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:919 copy ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:947 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:994 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:995 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:616 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:620 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:671 _broadcast_geti… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…st.jl:695 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…st.jl:696 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…st.jl:665 _broadcast_geti… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Base/…ls.jl:920 getindex ╎ ╎ ╎ ╎ ╎ ╎ 11 @Boscia/…t.jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 11 @LinearAlgebra/…:1041 dot(x::Vector{Float6… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 10 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 10 @LinearAlgebra/…:1042 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:929 getindex 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ls.jl:920 getindex 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…ls.jl:920 getindex 5╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…at.jl:495 + ╎ ╎ ╎ ╎ ╎ 40 @FrankWolfe/…jl:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 40 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 30 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 30 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 30 @FrankWolfe/…l:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 30 @FrankWolfe/…:358 _optimize_and_return(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 30 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 30 @SCIP/…er.jl:16 macro expansion 30╎ ╎ ╎ ╎ ╎ ╎ ╎ 30 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…mo.jl:130 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…le.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…xt.jl:49 free_model 10╎ ╎ ╎ ╎ ╎ ╎ 10 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…jl:327 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:438 perform_line_search(line_sear… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:453 perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:50 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:265 mul!(C::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:71 mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:74 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:79 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:636 gemv! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:668 gemv!(trans::Char, a… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:467 perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1041 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1042 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:929 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:920 getindex ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…jl:356 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…cks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:591 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:30 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1041 dot(x::Vector{Float6… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1042 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:920 getindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:112 process_FW_callback_logic(t… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…iler.jl:54 getproperty ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:374 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:96 active_set_update! ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:129 active_set_update!(active_se… ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:139 active_set_update_scale!(x:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:902 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:905 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:947 copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:994 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:995 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:616 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:620 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:671 _broadcast_getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:695 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:696 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:671 _broadcast_getind… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:695 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:696 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…st.jl:665 _broadcast_geti… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:920 getindex ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:432 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 1 @Boscia/…tics.jl:45 run_heuristics(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…tics.jl:63 run_heuristics(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…blem.jl:94 is_linear_feasible(lmo::Boscia… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:234 is_linear_feasible(o::SCIP.Op… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:251 is_linear_feasible_subroutin… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:428 get(o::SCIP.Optimizer, ::Ma… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:35 is_valid ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:503 get ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:242 ht_keyindex(h::Dict{Tuple{… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:128 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:28 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…le.jl:580 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…le.jl:580 hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:33 hash ╎ ╎ ╎ ╎ 1 @Boscia/…onobo.jl:85 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 1 @Base/array.jl:800 collect(itr::Base.Generator{DataSt… ╎ ╎ ╎ ╎ 1 @Base/array.jl:826 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:848 collect_to! ╎ ╎ ╎ ╎ ╎ 1 @Base/…erator.jl:45 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:425 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:323 popfirst!(pq::DataStructur… ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:356 setindex!(h::Dict{Int64, Int6… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:265 ht_keyindex2_shorthash!(h::D… ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 24.428460507935508 Dual Gap (relative): 0.16104922028105131 Search Statistics. Total number of nodes processed: 1371 Total number of lmo calls: 20398 Total time (s): 65.889 LMO calls / sec: 309.5812654616097 Nodes / sec: 20.807722078040342 LMO calls / node: 14.87819110138585 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1781 Local tightenings / node: 2.22 Total number of potential local tightenings: 4419 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.115000e+00 1.418440e+00 599 71 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.507000e+00 3.589948e+00 114 43 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.740000e+00 4.014599e+00 230 115 217 944 28 30 [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 poptask at ./task.jl:1216 wait at ./task.jl:1228 #wait#406 at ./condition.jl:141 wait at ./condition.jl:136 [inlined] _trywait at ./asyncevent.jl:185 profile_printing_listener at ./Base.jl:332 #start_profile_listener##0 at ./Base.jl:352 jfptr_YY.start_profile_listenerYY.YY.0_10036.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] start_task at /source/src/task.c:1253 unknown function (ip: (nil)) at (unknown file) Allocations: 23438874 (Pool: 23438204; Big: 670); GC: 20 [154] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:133 hashGetKeyParam at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPhashtableRetrieve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPparamsetGetReal at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsetGetRealParam at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPgetRealParam at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPgetRealParam at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:17213 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/wrapper.jl:16 [inlined] get_parameter at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/scip_data.jl:139 get at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:224 [inlined] get_tol at /home/pkgeval/.julia/packages/Boscia/EgUlC/ext/BosciaSCIPExt.jl:56 [inlined] is_linear_feasible_subroutine at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:254 _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:234 is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:229 [inlined] is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/problem.jl:94 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:118 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:108 [inlined] #blended_pairwise_conditional_gradient#360 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:291 unknown function (ip: 0x794aebd3574a) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188 unknown function (ip: 0x794aebd2a957) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36 optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29 unknown function (ip: 0x794aebd01677) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269 unknown function (ip: 0x794aebcfe2bd) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28 #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x794aebcf6dd8) at (unknown file) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:689 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 include_string at ./loading.jl:2873 _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 _include at ./loading.jl:2933 include at ./Base.jl:307 IncludeInto at ./Base.jl:308 jfptr_IncludeInto_53184.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:689 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 include_string at ./loading.jl:2873 _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 _include at ./loading.jl:2933 include at ./Base.jl:307 IncludeInto at ./Base.jl:308 jfptr_IncludeInto_53184.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:689 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 exec_options at ./client.jl:283 _start at ./client.jl:550 jfptr__start_64964.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4014 [inlined] ijl_apply_generic at /source/src/gf.c:4214 jl_apply at /source/src/julia.h:2397 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1139 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x794b3ec35249) 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: 5293725971 (Pool: 5293721657; Big: 4314); GC: 2236 PkgEval terminated after 2740.3s: test duration exceeded the time limit