Package evaluation to test Boscia on Julia 1.14.0-DEV.73 (4c8bca6988*) started at 2025-11-13T19:05:31.875 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.16s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Installed Boscia ─ v0.2.2 Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.2 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.3 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.3 [36b166db] + Boscia v0.2.2 [d360d2e6] + ChainRulesCore v1.26.0 [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.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.15.0 [f6369f11] + ForwardDiff v1.3.0 [f55ce6ea] + FrankWolfe v0.6.1 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.2.1 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.46.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [92933f4c] + ProgressMeter v1.11.0 [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.1+1 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+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 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [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 [deac9b47] + LibCURL_jll v8.16.0+0 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [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.4+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.68.0+1 [3f19e933] + p7zip_jll v17.7.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.48s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Error: Failed to use TestEnv.jl; test dependencies will not be precompiled │ exception = │ UndefVarError: `project_rel_path` not defined in `TestEnv` │ Suggestion: this global was defined as `Pkg.Operations.project_rel_path` but not assigned a value. │ Stacktrace: │ [1] get_test_dir(ctx::Pkg.Types.Context, pkgspec::PackageSpec) │ @ TestEnv ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/common.jl:75 │ [2] test_dir_has_project_file │ @ ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/common.jl:52 [inlined] │ [3] maybe_gen_project_override! │ @ ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/common.jl:83 [inlined] │ [4] activate(pkg::String; allow_reresolve::Bool) │ @ TestEnv ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/activate_set.jl:12 │ [5] activate(pkg::String) │ @ TestEnv ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/activate_set.jl:9 │ [6] top-level scope │ @ /PkgEval.jl/scripts/precompile.jl:24 │ [7] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [8] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:344 │ [9] _start() │ @ Base ./client.jl:577 └ @ Main /PkgEval.jl/scripts/precompile.jl:26 Precompiling package dependencies... Precompiling packages... 1707.4 ms ✓ Bonobo 85283.6 ms ✓ MathOptInterface 10209.5 ms ✓ MathOptSetDistances 43907.4 ms ✓ FrankWolfe 15438.2 ms ✓ Boscia 5 dependencies successfully precompiled in 159 seconds. 95 already precompiled. Precompilation completed after 171.38s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_OKmomU/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.2 [336ed68f] CSV v0.10.15 [0002e35e] CombinatorialLinearOracles v0.1.2 [31c24e10] Distributions v0.25.122 [497a8b3b] DoubleFloats v1.5.0 [f55ce6ea] FrankWolfe v0.6.1 [86223c79] Graphs v1.13.1 [87dc4568] HiGHS v1.20.1 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.46.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_OKmomU/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.3 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.2 [336ed68f] CSV v0.10.15 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.2 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.3 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.122 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.5.0 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.15.0 [f6369f11] ForwardDiff v1.3.0 [f55ce6ea] FrankWolfe v0.6.1 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.13.1 [06909019] GraphsFlows v0.1.1 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.20.1 [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.7.1 [682c06a0] JSON v1.2.1 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.3 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.46.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.36 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [92933f4c] ProgressMeter v1.11.0 [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.7 [91c51154] SentinelArrays v1.4.8 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.8 [4c63d2b9] StatsFuns v1.5.2 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.0 [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.2 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.1+1 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.12.0+0 [e33a78d0] Hwloc_jll v2.12.2+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+0 [9f9b04fa] LEMON_jll v1.3.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.600.201+0 [68e3532b] Ncurses_jll v6.5.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.2.13+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v900.200.200+0 [e5ac4fe4] SCIP_jll v900.200.200+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.5+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [1a1011a3] SharedArrays v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.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.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [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.4+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.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... Interface Tests seed = 0xb4c9ea60ab6d07e4 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = OPT_TREE_EMPTY Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = OPT_TREE_EMPTY LMO Tests seed = 0xfcbefdcd941e8505 Indicator Tests Heuristics Tests seed = 0xce7478eb8f74fdc3 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: Polish solution Sparse Regression Tests seed = 0x967553354e1d0701 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.588318e+00 2.671542e+00 8.322424e-02 3.215379e-02 1.925000e+01 1.558442e-01 8027 59 14 13 3 1 15 6 2.651118e+00 2.671542e+00 2.042442e-02 7.704078e-03 2.276100e+01 9.226308e-01 8 6 78 0 1 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.204270e+00 2.740203e-01 6.930250e+00 0.000000e+00 Inf 1 LD 2 2.671542e+00 2.671542e+00 0.000000e+00 2.060052e+00 9.708492e-01 1 Last 2 2.671542e+00 2.671542e+00 0.000000e+00 2.233601e+00 8.954152e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.671542e+00 2.671542e+00 0.000000e+00 2.238797e+00 8.933367e-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.671542447921843 Dual Bound: 2.651118027057522 Dual Gap (relative): 0.0077040783005010265 Search Statistics. Total number of nodes processed: 21 Total number of lmo calls: 83 Total time (s): 26.971 LMO calls / sec: 3.077379407511772 Nodes / sec: 0.7786140669608097 LMO calls / node: 3.9523809523809526 Total number of global tightenings: 41 Global tightenings / node: 2.73 Total number of local tightenings: 50 Local tightenings / node: 3.33 Total number of potential local tightenings: 50 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.181284e+00 4.005898e+00 1.824615e+00 8.364867e-01 1.712800e+01 1.751518e-01 8135 322 44 108 29 1 100 65 3.203833e+00 4.005898e+00 8.020654e-01 2.503456e-01 2.701600e+01 6.107492e+00 30 22 1415 19 16 1 200 65 3.311019e+00 4.005898e+00 6.948796e-01 2.098688e-01 2.970200e+01 8.921958e+00 24 17 1846 18 13 0 300 65 3.365708e+00 4.005898e+00 6.401904e-01 1.902097e-01 3.231000e+01 1.129681e+01 33 24 2298 26 13 1 400 65 3.414502e+00 4.005898e+00 5.913964e-01 1.732014e-01 3.508900e+01 1.325202e+01 35 25 2782 25 11 1 500 65 3.464205e+00 4.005898e+00 5.416935e-01 1.563688e-01 3.808600e+01 1.483485e+01 35 25 3308 28 11 1 600 65 3.508187e+00 4.005898e+00 4.977114e-01 1.418714e-01 4.122100e+01 1.613255e+01 37 27 3880 29 10 1 700 65 3.553552e+00 4.005898e+00 4.523463e-01 1.272941e-01 4.458600e+01 1.715785e+01 45 32 4536 46 13 2 800 65 3.598699e+00 4.005898e+00 4.071990e-01 1.131517e-01 4.788600e+01 1.806373e+01 41 28 5184 51 13 5 900 65 3.652016e+00 4.005898e+00 3.538823e-01 9.690052e-02 5.110800e+01 1.888158e+01 35 25 5814 29 5 0 1000 65 3.736956e+00 4.005898e+00 2.689422e-01 7.196825e-02 5.426000e+01 1.962772e+01 43 31 6460 31 6 2 1100 61 3.848089e+00 4.005898e+00 1.578099e-01 4.100994e-02 5.732400e+01 2.025330e+01 40 28 7066 34 7 3 1173 8 3.968376e+00 4.005898e+00 3.752259e-02 9.455403e-03 5.910500e+01 1.998139e+01 15 11 7428 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 8.483784e+00 2.034881e-01 8.280296e+00 0.000000e+00 Inf 1 LD 2 4.005898e+00 4.005898e+00 0.000000e+00 1.653923e-01 1.209246e+01 1 Last 2 4.005898e+00 4.005898e+00 0.000000e+00 3.376321e-01 5.923608e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 4.005898e+00 4.005898e+00 0.000000e+00 3.415568e-01 5.855541e+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: 4.005898454286324 Dual Bound: 3.9683758615814795 Dual Gap (relative): 0.009455402918888658 Search Statistics. Total number of nodes processed: 1181 Total number of lmo calls: 7433 Total time (s): 61.218 LMO calls / sec: 121.41853703159201 Nodes / sec: 19.291711588095005 LMO calls / node: 6.293818797629128 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 14 Non zero entries: 25th entry: 0.16605254227060687 37th entry: 0.16605254227060687 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 2.311214e+00 4.005898e+00 1.694684e+00 7.332440e-01 3.570000e-01 8.403361e+00 350 287 44 108 29 1 100 39 3.268280e+00 4.005898e+00 7.376189e-01 2.256903e-01 9.571000e+00 1.452304e+01 33 24 1383 20 13 0 200 32 3.411390e+00 4.005898e+00 5.945087e-01 1.742717e-01 1.272600e+01 1.823039e+01 28 20 1903 23 15 3 300 32 3.521920e+00 4.005898e+00 4.839782e-01 1.374188e-01 1.688000e+01 1.966825e+01 23 17 2589 11 5 0 400 32 3.625266e+00 4.005898e+00 3.806327e-01 1.049944e-01 2.198900e+01 1.964619e+01 62 44 3441 76 16 7 500 32 3.741772e+00 4.005898e+00 2.641268e-01 7.058871e-02 2.687300e+01 1.979682e+01 43 31 4306 29 6 0 600 14 3.963527e+00 4.005898e+00 4.237096e-02 1.069021e-02 3.122300e+01 1.966499e+01 46 33 5124 27 7 2 602 12 3.966587e+00 4.005898e+00 3.931102e-02 9.910540e-03 3.127800e+01 1.963041e+01 11 8 5136 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 8.483784e+00 2.034881e-01 8.280296e+00 0.000000e+00 Inf 1 LD 2 4.005898e+00 4.005898e+00 0.000000e+00 1.326967e-03 1.507196e+03 1 Last 2 4.005898e+00 4.005898e+00 0.000000e+00 9.530647e-03 2.098493e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 4.005898e+00 4.005898e+00 0.000000e+00 1.384834e-02 1.444216e+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: 4.005898454286324 Dual Bound: 3.966587431571193 Dual Gap (relative): 0.00991053982631106 Search Statistics. Total number of nodes processed: 614 Total number of lmo calls: 5141 Total time (s): 31.306 LMO calls / sec: 164.2177218424583 Nodes / sec: 19.612853766051234 LMO calls / node: 8.372964169381108 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: 12 Poisson Tests seed = 0xed218864cdf6589e 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 -6.265953e+02 -6.157690e+02 1.082632e+01 1.758179e-02 1.775600e+01 1.689570e-01 8909 137 43 689 13 4 * 33 34 -6.223247e+02 -6.158060e+02 6.518724e+00 1.058568e-02 6.370100e+01 1.051789e+00 1421 97 1030 971 16 8 43 44 -6.218075e+02 -6.158060e+02 6.001542e+00 9.745832e-03 7.766700e+01 1.120167e+00 1721 101 1340 1268 15 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.715322e+02 -8.974769e+02 1.769009e+03 0.000000e+00 Inf 1 LD 2 -5.739337e+02 -6.725959e+02 9.866217e+01 1.685640e-01 1.186493e+01 2 LD 17 -5.907401e+02 -6.340796e+02 4.333948e+01 4.597090e-01 3.697992e+01 2 LD 19 -6.158060e+02 -6.225621e+02 6.756139e+00 4.666575e-01 4.071508e+01 1 LD 21 -6.158246e+02 -6.179164e+02 2.091826e+00 4.733981e-01 4.436013e+01 2 LD 26 -6.158531e+02 -6.166942e+02 8.410931e-01 4.822848e-01 5.391006e+01 2 LD 28 -6.158547e+02 -6.158548e+02 1.541869e-06 4.870386e-01 5.749031e+01 2 LD 30 -6.158547e+02 -6.158547e+02 8.535039e-11 4.911722e-01 6.107837e+01 2 Last 30 -6.158547e+02 -6.158547e+02 8.535039e-11 4.968943e-01 6.037501e+01 2 ---------------------------------------------------------------------------------------------------------------- PP 30 -6.158547e+02 -6.158547e+02 8.535039e-11 4.997431e-01 6.003084e+01 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -615.8547499323298 Dual Bound: -621.8075493186711 Dual Gap (relative): 0.009665914547213316 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1355 Total time (s): 80.049 LMO calls / sec: 16.92713213156941 Nodes / sec: 1.0868343139826855 LMO calls / node: 15.574712643678161 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 -5.458695e+02 -5.433475e+02 2.521997e+00 4.641592e-03 1.959400e+01 1.531081e-01 7868 133 21 51 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -2.854189e+02 -5.754091e+02 2.899902e+02 0.000000e+00 Inf 1 LD 2 -5.433475e+02 -5.433475e+02 0.000000e+00 1.801419e-01 1.110236e+01 1 Last 2 -5.433475e+02 -5.433475e+02 0.000000e+00 3.575621e-01 5.593433e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -5.433475e+02 -5.433475e+02 0.000000e+00 3.627896e-01 5.512837e+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: -543.3474615025149 Dual Bound: -545.8694588764695 Dual Gap (relative): 0.0046415922639641005 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 26 Total time (s): 21.885 LMO calls / sec: 1.1880283299063283 Nodes / sec: 0.13708019191226867 LMO calls / node: 8.666666666666666 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.808422e+02 3.388324e+02 1.579902e+02 8.736358e-01 1.729200e+01 1.734906e-01 8498 193 28 62 11 0 * 19 20 2.361847e+02 3.371245e+02 1.009398e+02 4.273766e-01 2.090600e+01 1.865493e+00 174 94 344 63 2 1 * 37 38 2.530484e+02 3.369504e+02 8.390192e+01 3.315647e-01 2.396000e+01 3.130217e+00 153 90 615 44 2 1 100 99 2.782819e+02 3.369504e+02 5.866848e+01 2.108239e-01 4.389600e+01 4.533443e+00 89 52 1440 26 3 1 200 175 2.991288e+02 3.369504e+02 3.782157e+01 1.264391e-01 5.430200e+01 6.905823e+00 77 43 2591 37 2 1 300 197 3.122904e+02 3.369504e+02 2.465997e+01 7.896487e-02 5.926500e+01 8.386063e+00 13 10 3345 2 1 2 400 173 3.202904e+02 3.369504e+02 1.666000e+01 5.201530e-02 6.222200e+01 9.208961e+00 14 10 3846 2 1 0 * 417 168 3.217720e+02 3.365252e+02 1.475324e+01 4.585000e-02 6.270800e+01 9.328953e+00 10 7 3920 2 2 0 * 437 160 3.236572e+02 3.361593e+02 1.250215e+01 3.862776e-02 6.318900e+01 9.479498e+00 14 9 4000 2 2 0 500 107 3.274663e+02 3.361593e+02 8.693022e+00 2.654631e-02 6.444200e+01 9.450358e+00 12 9 4218 2 1 0 569 44 3.329746e+02 3.361593e+02 3.184686e+00 9.564350e-03 6.562000e+01 9.372143e+00 6 4 4430 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.377958e+02 3.252735e+02 1.252224e+01 0.000000e+00 Inf 1 LD 2 3.361593e+02 3.361593e+02 6.843834e-08 1.708065e-01 1.170916e+01 2 Last 2 3.361593e+02 3.361593e+02 6.843834e-08 3.495154e-01 5.722209e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.361593e+02 3.361593e+02 6.843834e-08 3.866654e-01 5.172430e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 336.1593317144658 Dual Bound: 332.9746457651737 Dual Gap (relative): 0.009564349687867974 Search Statistics. Total number of nodes processed: 615 Total number of lmo calls: 4435 Total time (s): 67.682 LMO calls / sec: 65.52702343311368 Nodes / sec: 9.08661091575308 LMO calls / node: 7.211382113821138 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.808422e+02 3.388324e+02 1.579902e+02 8.736358e-01 1.995600e+01 1.503307e-01 8210 182 28 62 3 1 * 4 5 1.994728e+02 3.371245e+02 1.376517e+02 6.900777e-01 2.352000e+01 3.826531e-01 213 128 84 51 5 0 * 84 79 2.740595e+02 3.370214e+02 6.296183e+01 2.297378e-01 8.515300e+01 1.914201e+00 104 68 1178 25 3 0 100 89 2.780134e+02 3.370214e+02 5.900797e+01 2.122486e-01 9.398000e+01 2.011066e+00 101 55 1359 32 2 0 * 144 113 2.910826e+02 3.369504e+02 4.586778e+01 1.575765e-01 1.147390e+02 2.239866e+00 57 41 1787 9 1 0 200 143 3.009450e+02 3.369504e+02 3.600539e+01 1.196411e-01 1.389320e+02 2.468834e+00 35 25 2267 6 3 3 300 179 3.152428e+02 3.369504e+02 2.170761e+01 6.885997e-02 1.702670e+02 2.813229e+00 42 28 2865 9 3 2 * 329 170 3.201097e+02 3.365252e+02 1.641554e+01 5.128097e-02 1.758190e+02 2.849521e+00 21 13 3012 2 2 0 * 334 167 3.203113e+02 3.361593e+02 1.584805e+01 4.947703e-02 1.766320e+02 2.859052e+00 18 10 3029 2 2 1 400 125 3.249154e+02 3.361593e+02 1.124389e+01 3.460558e-02 1.830860e+02 2.889353e+00 14 10 3260 2 1 1 500 43 3.325988e+02 3.361593e+02 3.560507e+00 1.070511e-02 1.893550e+02 2.888754e+00 9 6 3572 0 1 0 509 34 3.328698e+02 3.361593e+02 3.289581e+00 9.882487e-03 1.895180e+02 2.886269e+00 9 6 3595 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.377958e+02 3.252735e+02 1.252224e+01 0.000000e+00 Inf 1 LD 2 3.361593e+02 3.361593e+02 6.843834e-08 1.854942e-01 1.078201e+01 2 Last 2 3.361593e+02 3.361593e+02 6.843834e-08 3.697285e-01 5.409374e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.361593e+02 3.361593e+02 6.843834e-08 3.748929e-01 5.334857e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 336.1593317144658 Dual Bound: 332.8697508498305 Dual Gap (relative): 0.009882486637000986 Search Statistics. Total number of nodes processed: 547 Total number of lmo calls: 3600 Total time (s): 191.836 LMO calls / sec: 18.76602931670802 Nodes / sec: 2.8513938989553576 LMO calls / node: 6.581352833638026 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 = 0xedc6db92c1e8ef24 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -6.846716e+00 3.076741e+01 3.761413e+01 Inf 1.901000e+01 1.578117e-01 9094 193 59 10001 21 18 * 4 5 -5.708384e+00 2.353709e+01 2.924547e+01 Inf 1.972900e+01 4.561813e-01 182 44 136 3601 18 21 100 5 2.212051e+01 2.353709e+01 1.416571e+00 6.403882e-02 2.998900e+01 3.501284e+00 34 26 1888 109 8 3 109 4 2.347577e+01 2.353709e+01 6.131508e-02 2.611845e-03 3.018200e+01 3.743953e+00 4 3 1978 2 1 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 23.537085235187433 Dual Bound: 23.47577015126666 Dual Gap (relative): 0.0026118454698478323 Search Statistics. Total number of nodes processed: 113 Total number of lmo calls: 1978 Total time (s): 30.983 LMO calls / sec: 63.841461446599745 Nodes / sec: 3.6471613465448796 LMO calls / node: 17.504424778761063 Total number of global tightenings: 17 Global tightenings / node: 0.16 Total number of local tightenings: 357 Local tightenings / node: 3.28 Total number of potential local tightenings: 431 Time Limit Test seed = 0x797ea10645c06f70 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -7.079600e-01 0.000000e+00 7.079600e-01 Inf 1.735600e+01 1.728509e-01 9169 85 30 804 12 2 25 0 0.000000e+00 0.000000e+00 0.000000e+00 0.000000e+00 1.818300e+01 1.374911e+00 2 2 284 0 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: 0.0 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 25 Total number of lmo calls: 284 Total time (s): 19.077 LMO calls / sec: 14.887036745819572 Nodes / sec: 1.3104785867798918 LMO calls / node: 11.36 Total number of global tightenings: 3 Global tightenings / node: 0.12 Total number of local tightenings: 23 Local tightenings / node: 0.92 Total number of potential local tightenings: 27 Strong Convexity and Sharpness Tests seed = 0xc1d5d1a23993340f 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.109553e+02 2.115322e+02 5.768920e-01 2.734664e-03 1.605900e+01 1.868111e-01 7356 0 12 22 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 211.53222956594593 Dual Bound: 210.95533761384007 Dual Gap (relative): 0.00273466392759339 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 12 Total time (s): 16.959 LMO calls / sec: 0.7075888908544136 Nodes / sec: 0.1768972227136034 LMO calls / node: 4.0 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 15 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.588766e+02 1.593260e+02 4.494200e-01 2.828736e-03 1.698500e+01 1.766264e-01 7644 0 11 12 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 159.32600862619535 Dual Bound: 158.87658862648453 Dual Gap (relative): 0.0028287364651779466 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 17.891 LMO calls / sec: 0.6148342742160864 Nodes / sec: 0.16768207478620537 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 16 Branching Strategy Tests seed = 0x0232756765fb7a32 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.722800e+01 1.741351e-01 8224 54 48 3749 20 5 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.886700e+01 3.445169e+00 10 7 953 27 1 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): 19.784 LMO calls / sec: 48.17023857662758 Nodes / sec: 3.2854832187626366 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.690000e-01 8.130081e+00 230 47 48 3749 1 2 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.921000e+00 4.528891e+01 4 3 1015 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.382204160353686 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.922 LMO calls / sec: 528.0957336108221 Nodes / sec: 45.26534859521332 LMO calls / node: 11.666666666666666 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 53 Local tightenings / node: 0.61 Total number of potential local tightenings: 108 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest most infeasible gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.720000e-01 8.064516e+00 230 43 48 3749 20 5 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.697000e+00 3.476724e+01 4 3 859 2 1 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.698 LMO calls / sec: 505.8892815076561 Nodes / sec: 34.74676089517079 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.030000e-01 7.444169e+00 248 42 48 3749 4 2 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.737000e+00 4.317789e+01 11 8 902 27 10 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.739 LMO calls / sec: 518.688901667625 Nodes / sec: 43.12823461759632 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.360000e-01 8.928571e+00 231 42 48 3749 4 2 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 2.009000e+00 4.828273e+01 4 3 1174 2 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.325011777780223 Dual Gap (relative): 0.007807821244322148 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1174 Total time (s): 2.01 LMO calls / sec: 584.0796019900498 Nodes / sec: 48.258706467661696 LMO calls / node: 12.103092783505154 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 82 Local tightenings / node: 0.88 Total number of potential local tightenings: 170 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.950000e-01 6.060606e+00 492 76 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.400000e-01 1.071429e+01 101 46 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.820000e-01 1.120163e+01 138 52 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.426000e+00 2.132400e+01 103 47 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.011900e+01 2.144481e+01 78 36 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.673200e+01 2.396605e+01 55 29 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.321700e+01 2.571392e+01 60 26 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.973000e+01 2.667339e+01 61 30 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.532800e+01 2.737206e+01 23 13 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 4.139500e+01 2.751540e+01 62 28 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.616800e+01 2.757321e+01 16 11 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 5.021600e+01 2.726223e+01 8 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 5.334200e+01 2.671441e+01 11 7 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.581000e+01 2.635728e+01 32 15 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.812100e+01 2.572220e+01 14 9 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.979700e+01 2.526883e+01 14 9 25388 20 10 1 1212 301 2.705542e+01 2.836265e+01 1.307229e+00 4.831671e-02 6.000100e+01 2.521625e+01 12 8 25510 22 10 8 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.055416403771183 Dual Gap (relative): 0.048316706796336074 Search Statistics. Total number of nodes processed: 1513 Total number of lmo calls: 25510 Total time (s): 60.002 LMO calls / sec: 425.1524949168361 Nodes / sec: 25.215826139128694 LMO calls / node: 16.860541969596827 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2296 Local tightenings / node: 1.89 Total number of potential local tightenings: 5036 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.266000e+00 1.323919e+00 480 85 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.641000e+00 3.407800e+00 110 54 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.797000e+00 3.932785e+00 152 61 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.159000e+01 1.734254e+01 88 37 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.217800e+01 1.781902e+01 69 29 3485 420 10 10 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.902500e+01 2.086728e+01 103 38 6038 662 16 7 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.476100e+01 2.265660e+01 53 29 8396 223 5 6 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.990300e+01 2.384376e+01 27 15 10594 67 10 19 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.426400e+01 2.477819e+01 64 36 12514 245 1 0 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.859900e+01 2.557061e+01 25 15 14423 73 2 2 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 4.232500e+01 2.610750e+01 10 6 16134 16 8 7 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.605300e+01 2.651293e+01 8 5 17857 8 5 1 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.940500e+01 2.661674e+01 11 7 19379 12 5 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 5.215600e+01 2.690007e+01 13 8 20802 22 9 5 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 5.444200e+01 2.683590e+01 10 7 22010 10 5 1 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 5.655400e+01 2.685928e+01 10 6 23131 12 9 5 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.823300e+01 2.708086e+01 13 9 24076 18 5 4 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.986300e+01 2.707850e+01 17 12 24995 22 9 0 1409 216 2.734247e+01 2.836265e+01 1.020176e+00 3.731105e-02 6.000100e+01 2.708288e+01 11 7 25076 21 4 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.342468823176826 Dual Gap (relative): 0.0373110492993741 Search Statistics. Total number of nodes processed: 1625 Total number of lmo calls: 25076 Total time (s): 60.002 LMO calls / sec: 417.9194026865771 Nodes / sec: 27.082430585647145 LMO calls / node: 15.431384615384616 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2150 Local tightenings / node: 1.53 Total number of potential local tightenings: 5351 Number of alternative decisions: 439 Number of stable decisions: 373 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.440000e-01 5.514706e+00 479 73 64 4885 36 6 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.391000e+00 9.345794e+00 107 41 256 696 19 22 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.721000e+00 1.919357e+01 62 27 2096 346 11 15 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 9.408000e+00 2.136480e+01 73 33 3186 412 13 6 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.639000e+01 2.446614e+01 86 45 6017 417 2 1 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.277900e+01 2.612055e+01 60 36 8679 179 9 3 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.809800e+01 2.722614e+01 15 10 11070 27 9 3 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.236800e+01 2.876298e+01 63 28 13344 339 17 8 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.645700e+01 2.965137e+01 48 17 15506 341 8 3 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 4.026200e+01 3.002831e+01 53 25 17444 229 10 6 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.421700e+01 3.019201e+01 7 5 19379 9 7 6 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.743700e+01 3.046145e+01 48 23 21026 246 8 7 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 5.091300e+01 3.022804e+01 38 22 22661 137 4 3 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.372100e+01 3.028611e+01 6 4 24161 6 4 6 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.592200e+01 3.016702e+01 11 8 25390 20 6 3 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.766000e+01 3.036767e+01 23 11 26657 170 13 4 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.950100e+01 3.016756e+01 8 5 27751 16 7 3 1431 374 2.633498e+01 2.836265e+01 2.027666e+00 7.699515e-02 6.000000e+01 3.008333e+01 6 4 28065 6 6 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.334979287818914 Dual Gap (relative): 0.07699515216721461 Search Statistics. Total number of nodes processed: 1805 Total number of lmo calls: 28065 Total time (s): 60.005 LMO calls / sec: 467.7110240813265 Nodes / sec: 30.080826597783517 LMO calls / node: 15.54847645429363 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2464 Local tightenings / node: 1.72 Total number of potential local tightenings: 5897 Number of alternative decisions: 543 Number of stable decisions: 359 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.310000e-01 5.649718e+00 474 70 64 4885 2 2 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.509000e+00 1.634117e+01 99 46 678 489 23 5 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.196000e+00 1.971214e+01 60 32 968 257 17 12 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.938000e+00 2.532124e+01 16 9 2918 60 2 4 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.306600e+01 2.931272e+01 38 21 5197 153 21 2 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.810100e+01 3.132424e+01 27 16 7469 83 5 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.279100e+01 3.224957e+01 27 14 9610 131 7 3 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.794800e+01 3.266781e+01 44 23 11880 193 7 5 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 3.222500e+01 3.323507e+01 30 17 13971 113 6 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.672600e+01 3.330066e+01 23 14 15981 55 3 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 4.032200e+01 3.355488e+01 45 26 17719 139 13 1 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 4.427700e+01 3.326784e+01 16 10 19510 37 9 3 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.829900e+01 3.306487e+01 109 64 21254 396 7 4 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 5.104000e+01 3.320925e+01 11 8 22747 24 8 3 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 5.368300e+01 3.295270e+01 8 5 24101 6 4 1 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 5.581200e+01 3.277073e+01 17 11 25317 23 11 5 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.793500e+01 3.219125e+01 9 7 26374 10 5 1 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.988500e+01 3.161059e+01 14 9 27346 16 8 1 1504 393 2.627144e+01 2.836265e+01 2.091204e+00 7.959989e-02 6.000500e+01 3.161403e+01 4 2 27394 1 4 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.27144124891069 Dual Gap (relative): 0.07959988782804198 Search Statistics. Total number of nodes processed: 1897 Total number of lmo calls: 27394 Total time (s): 60.006 LMO calls / sec: 456.5210145652101 Nodes / sec: 31.613505316135054 LMO calls / node: 14.440695835529784 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1782 Local tightenings / node: 1.18 Total number of potential local tightenings: 4285 Number of alternative decisions: 331 Number of stable decisions: 617 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.790000e-01 6.263048e+00 476 86 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.600000e-01 1.046512e+01 108 52 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 1.014000e+00 1.084813e+01 150 63 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.575000e+00 2.099217e+01 101 46 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.025500e+01 2.116041e+01 75 35 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.704500e+01 2.352596e+01 59 32 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.371700e+01 2.517182e+01 54 22 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.983500e+01 2.657952e+01 52 24 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.464200e+01 2.791409e+01 18 10 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.944300e+01 2.887711e+01 52 20 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.349300e+01 2.926908e+01 12 7 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.647300e+01 2.945796e+01 6 4 20396 14 8 12 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.907400e+01 2.907853e+01 53 22 21910 381 1 1 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 5.097000e+01 2.886011e+01 6 5 23162 19 11 10 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 5.223700e+01 2.869613e+01 21 11 24363 145 12 7 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 5.340000e+01 2.837079e+01 8 5 25359 25 10 8 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 5.458600e+01 2.797421e+01 34 16 26283 172 9 5 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.559700e+01 2.757343e+01 11 7 27090 27 10 9 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.617600e+01 2.732484e+01 5 4 27580 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1535 Total number of lmo calls: 27580 Total time (s): 56.177 LMO calls / sec: 490.94825284369045 Nodes / sec: 27.32434982288125 LMO calls / node: 17.96742671009772 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2409 Local tightenings / node: 1.64 Total number of potential local tightenings: 5193 Number of alternative decisions: 718 Number of stable decisions: 49 Minimum number of branchings per variable: 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: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.750000e-01 6.315789e+00 472 65 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.030000e-01 1.120797e+01 87 31 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.450000e-01 1.164021e+01 139 42 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.682000e+00 2.616506e+01 85 34 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.238000e+00 2.634134e+01 63 26 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.359800e+01 2.948963e+01 50 25 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.963300e+01 3.040799e+01 52 21 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.550400e+01 3.109316e+01 53 25 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.059300e+01 3.160854e+01 19 10 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.503600e+01 3.250942e+01 39 17 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.859200e+01 3.298611e+01 15 10 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.225700e+01 3.239700e+01 7 4 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.507400e+01 3.161468e+01 8 5 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.725300e+01 3.113030e+01 32 15 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.920600e+01 3.038247e+01 7 5 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.067300e+01 2.981864e+01 13 8 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.215800e+01 2.908470e+01 19 12 26318 33 12 12 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.351500e+01 2.845931e+01 15 10 27126 17 9 2 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.409200e+01 2.815573e+01 7 4 27525 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 54.093 LMO calls / sec: 508.8458765459486 Nodes / sec: 28.155214168191815 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "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: 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 3.670000e+00 8.174387e-01 479 79 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 4.008000e+00 2.245509e+00 95 42 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 4.150000e+00 2.650602e+00 139 53 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.245000e+01 1.614458e+01 86 35 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.307600e+01 1.659529e+01 90 40 3485 420 10 10 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 1.923000e+01 2.074883e+01 85 38 6090 444 9 4 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 41 running 1 of 1 signal (10): User defined signal 1 unknown function (ip: 0x784dfe77e5e2) at /lib/x86_64-linux-gnu/libc.so.6 malloc at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) _ZN6soplex9spx_allocIPNS_7NonzeroIN5boost14multiprecision6numberINS3_8backends9gmp_floatILj50EEELNS3_26expression_template_optionE0EEEEEEEvRT_i at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) _ZN6soplex12LPRowSetBaseIN5boost14multiprecision6numberINS2_8backends9gmp_floatILj50EEELNS2_26expression_template_optionE0EEEEC1Eii at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) _ZN6soplex13SPxSolverBaseIN5boost14multiprecision6numberINS2_8backends9gmp_floatILj50EEELNS2_26expression_template_optionE0EEEEC2ENS9_4TypeENS9_14RepresentationENS_5Timer4TYPEE at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) _ZN6soplex10SoPlexBaseIdEC1Ev at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) SCIPlpiCreate at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) SCIPlpCreate at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) SCIPtransformProb at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) SCIPpresolve at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/packages/SCIP/4grSV/src/LibSCIP.jl:18664 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/4grSV/src/wrapper.jl:16 [inlined] optimize! at /home/pkgeval/.julia/packages/SCIP/4grSV/src/MOI_wrapper.jl:427 _optimize_and_return at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/moi_oracle.jl:358 #compute_extreme_point#108 at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/moi_oracle.jl:43 compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/moi_oracle.jl:24 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/time_tracking_lmo.jl:116 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/time_tracking_lmo.jl:108 [inlined] #blended_pairwise_conditional_gradient#356 at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:166 unknown function (ip: 0x784dc30efeca) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:76 #solve_frank_wolfe#6 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/frank_wolfe_variants.jl:158 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/frank_wolfe_variants.jl:138 unknown function (ip: 0x784dc30e3797) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/node.jl:353 #optimize!#12 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/custom_bonobo.jl:35 optimize! at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/custom_bonobo.jl:29 unknown function (ip: 0x784dc30dd097) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #solve#108 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/interface.jl:270 unknown function (ip: 0x784dc30bdd5d) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 solve at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/interface.jl:28 #solve#145 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x784dc30b6338) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [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:679 eval_body at /source/src/interpreter.c:550 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:550 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:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_9560.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke96199.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_35114.1 at /opt/julia/lib/julia/sys.so (unknown line) include_string at ./loading.jl:2994 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3054 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke97426.1 at /opt/julia/lib/julia/sys.so (unknown line) include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_72480.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [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:679 eval_body at /source/src/interpreter.c:550 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:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_9560.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke96199.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_35114.1 at /opt/julia/lib/julia/sys.so (unknown line) include_string at ./loading.jl:2994 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3054 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke97426.1 at /opt/julia/lib/julia/sys.so (unknown line) include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_72480.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [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:679 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_9560.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke96209.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_35045.1 at /opt/julia/lib/julia/sys.so (unknown line) exec_options at ./client.jl:310 jfptr_exec_options_35026.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke92148.1 at /opt/julia/lib/julia/sys.so (unknown line) j_exec_options_73833.1 at /opt/julia/lib/julia/sys.so (unknown line) _start at ./client.jl:577 jfptr__start_73830.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x784dfe70e249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.597000e+01 2.252599e+01 57 29 8720 225 8 5 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 jfptr_wait_1599.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke94180.1 at /opt/julia/lib/julia/sys.so (unknown line) j_wait_53123.1 at /opt/julia/lib/julia/sys.so (unknown line) wait_forever at ./task.jl:1168 jfptr_wait_forever_53122.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] start_task at /source/src/task.c:1272 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 400 347 2.074745e+01 2.836265e+01 7.615193e+00 3.670423e-01 3.436300e+01 2.173850e+01 170 79 11144 379 18 5 ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007dca01974790 Total snapshots: 321. Utilization: 0% ╎321 @Base/task.jl:1168 wait_forever() 320╎ 321 @Base/task.jl:1246 wait() 500 399 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 4.338400e+01 2.072193e+01 10 6 13355 21 11 7 600 411 2.367246e+01 2.836265e+01 4.690187e+00 1.981284e-01 4.747200e+01 2.129676e+01 47 18 15250 331 10 3 ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 700 407 2.449500e+01 2.836265e+01 3.867641e+00 1.578951e-01 5.601800e+01 1.976151e+01 57 24 17024 329 12 3 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x0000784de41fc010 Total snapshots: 55. Utilization: 100% ╎50 @Base/client.jl:577 _start() ╎ 50 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 50 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ 50 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ 50 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path::Str… ╎ 50 @Base/loading.jl:3054 _include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 50 @Base/loading.jl:2994 include_string(mapexpr::typeof(identity), mo… ╎ ╎ 50 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 50 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ ╎ 50 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path… ╎ ╎ 50 @Base/loading.jl:3054 _include(mapexpr::Function, mod::Module,… ╎ ╎ ╎ 50 @Base/loading.jl:2994 include_string(mapexpr::typeof(identity… ╎ ╎ ╎ 50 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ 50 @Boscia/…_oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 50 @Boscia/…oracle.jl:834 #solve#145 ╎ ╎ ╎ 50 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ ╎ 50 @Boscia/…erface.jl:270 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 50 @Boscia/…bonobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 49 @Boscia/…onobo.jl:35 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:339 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:254 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…Ext.jl:56 get_tol ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…pper.jl:224 get ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…data.jl:139 get_parameter(scipd::SCIP.S… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…pper.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:14661 SCIPgetRealParam ╎ ╎ ╎ ╎ 48 @Boscia/…node.jl:353 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 48 @Boscia/…ants.jl:138 kwcall(::@NamedTuple{epsilon::F… ╎ ╎ ╎ ╎ ╎ 48 @Boscia/…ants.jl:158 #solve_frank_wolfe#6 ╎ ╎ ╎ ╎ ╎ 48 @FrankWolfe/….jl:76 kwcall(::@NamedTuple{line_sear… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:206 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…est.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…als.jl:965 getindex ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:466 perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:9 muladd_memory_mode(memory_mod… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…cast.jl:901 materialize! ╎ ╎ ╎ ╎ ╎ 12 @FrankWolfe/…jl:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…cks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 11 @Boscia/…ks.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 11 @Boscia/…e.jl:591 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…t.jl:28 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…nce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ay.jl:864 collect_to_with_first!(d… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 none:? #sol_values##0 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:239 ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:707 isempty 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:479 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:396 getindex ╎ ╎ ╎ ╎ ╎ ╎ 7 @Boscia/…t.jl:30 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 7 @Boscia/…t.jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 7 @LinearAlgebra/…:1045 dot(x::Vector{Float6… 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @LinearAlgebra/…:1046 macro expansion 5╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:144 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Dates/…ons.jl:71 now() ╎ ╎ ╎ ╎ ╎ ╎ 1 @Dates/…es.jl:421 DateTime ╎ ╎ ╎ ╎ ╎ ╎ 1 @Dates/…s.jl:421 DateTime ╎ ╎ ╎ ╎ ╎ ╎ 1 @Dates/…s.jl:245 DateTime(y::Int64, m::Int… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Dates/…s.jl:265 validargs(::Type{DateTim… ╎ ╎ ╎ ╎ ╎ 31 @FrankWolfe/…jl:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 31 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 22 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 22 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 22 @FrankWolfe/…l:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 22 @FrankWolfe/…:358 _optimize_and_return(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 22 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 22 @SCIP/…er.jl:16 macro expansion 22╎ ╎ ╎ ╎ ╎ ╎ ╎ 22 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…mo.jl:118 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…e.jl:229 is_linear_feasible 1╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…e.jl:234 is_linear_feasible(o::SCIP… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:247 is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:394 get(o::SCIP.Optimizer, ::… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1345 push! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1348 _push! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1205 _growend! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1185 _growend_internal!(a… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ry.jl:139 unsafe_copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…em.jl:28 memmove ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:732 cconvert ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…er.jl:7 convert ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:1013 UInt64 ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:983 toUInt64 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ot.jl:872 check_sign_bit ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:395 get(o::SCIP.Optimizer, ::… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/set.jl:176 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:717 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:395 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:381 checkbounds ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:249 is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…le.jl:47 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @MathOptInterface/…:115 throw_if_not_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…le.jl:39 is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/set.jl:92 in ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:550 haskey ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:248 ht_keyindex(h::Dict{… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:134 isslotempty 2╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…mo.jl:130 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…le.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…xt.jl:49 free_model 4╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…IP.jl:18686 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:356 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:144 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Dates/…ons.jl:70 now() 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/libc.jl:223 TmStruct ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:411 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 1 @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:28 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…nce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:864 collect_to_with_first!(d… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:? #sol_values##0 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:479 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:396 getindex ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:483 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:358 _optimize_and_return(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ 1 @Boscia/…onobo.jl:97 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:232 callback ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:356 (::Boscia.var"#callback#build_b… 1╎ ╎ ╎ ╎ ╎ 1 @Base/…ntials.jl:965 getindex [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 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 wait at ./task.jl:1246 jfptr_wait_1599.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke94180.1 at /opt/julia/lib/julia/sys.so (unknown line) j_wait_53123.1 at /opt/julia/lib/julia/sys.so (unknown line) wait_forever at ./task.jl:1168 jfptr_wait_forever_53122.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] start_task at /source/src/task.c:1272 unknown function (ip: (nil)) at (unknown file) Allocations: 40490317 (Pool: 40489626; Big: 691); GC: 24 [41] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/Kl8FO/test/branching_strategy_test.jl:275 jl_gc_small_alloc_inner at /source/src/gc-stock.c:741 jl_gc_small_alloc_noinline at /source/src/gc-stock.c:783 [inlined] jl_gc_alloc_ at /source/src/gc-stock.c:797 jl_alloc_genericmemory_unchecked at /source/src/genericmemory.c:41 GenericMemory at ./boot.jl:588 [inlined] Array at ./boot.jl:648 [inlined] Array at ./boot.jl:661 [inlined] Array at ./boot.jl:669 [inlined] similar at ./abstractarray.jl:877 [inlined] similar at ./array.jl:409 [inlined] similar at ./abstractarray.jl:876 [inlined] _array_for at ./array.jl:701 [inlined] collect at ./array.jl:833 [inlined] map at ./abstractarray.jl:3544 [inlined] _broadcast_preserving_zero_d at ./arraymath.jl:13 [inlined] - at ./arraymath.jl:27 [inlined] f at /home/pkgeval/.julia/packages/Boscia/Kl8FO/test/branching_strategy_test.jl:44 #blended_pairwise_conditional_gradient#356 at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:206 unknown function (ip: 0x784dc30efeca) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:76 #solve_frank_wolfe#6 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/frank_wolfe_variants.jl:158 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/frank_wolfe_variants.jl:138 unknown function (ip: 0x784dc30e3797) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/node.jl:353 #optimize!#12 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/custom_bonobo.jl:35 optimize! at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/custom_bonobo.jl:29 unknown function (ip: 0x784dc30dd097) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #solve#108 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/interface.jl:270 unknown function (ip: 0x784dc30bdd5d) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 solve at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/interface.jl:28 #solve#145 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x784dc30b6338) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [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:679 eval_body at /source/src/interpreter.c:550 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:550 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:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_9560.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke96199.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_35114.1 at /opt/julia/lib/julia/sys.so (unknown line) include_string at ./loading.jl:2994 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3054 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke97426.1 at /opt/julia/lib/julia/sys.so (unknown line) include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_72480.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [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:679 eval_body at /source/src/interpreter.c:550 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:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_9560.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke96199.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_35114.1 at /opt/julia/lib/julia/sys.so (unknown line) include_string at ./loading.jl:2994 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3054 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke97426.1 at /opt/julia/lib/julia/sys.so (unknown line) include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_72480.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [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:679 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_9560.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke96209.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_35045.1 at /opt/julia/lib/julia/sys.so (unknown line) exec_options at ./client.jl:310 jfptr_exec_options_35026.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke92148.1 at /opt/julia/lib/julia/sys.so (unknown line) j_exec_options_73833.1 at /opt/julia/lib/julia/sys.so (unknown line) _start at ./client.jl:577 jfptr__start_73830.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x784dfe70e249) 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: 4795304939 (Pool: 4795300987; Big: 3952); GC: 2024 [scip_solve.c:3410] ERROR: invalid SCIP stage <12> [scip_prob.c:706] ERROR: Error <-8> in function call [scip_general.c:359] ERROR: Error <-8> in function call error in running finalizer: ErrorException("SCIPfree(scipd.scip) yielded SCIP code SCIP_INVALIDCALL") error at ./error.jl:44 macro expansion at /home/pkgeval/.julia/packages/SCIP/4grSV/src/wrapper.jl:19 [inlined] free_scip at /home/pkgeval/.julia/packages/SCIP/4grSV/src/scip_data.jl:107 unknown function (ip: 0x784dfcdbc3f2) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 run_finalizer at /source/src/gc-common.c:180 jl_gc_run_finalizers_in_list at /source/src/gc-common.c:270 run_finalizers at /source/src/gc-common.c:316 ijl_atexit_hook at /source/src/init.c:295 jl_exit_thread0_cb at /source/src/signals-unix.c:557 PkgEval terminated after 2754.4s: test duration exceeded the time limit