Package evaluation to test Boscia on Julia 1.14.0-DEV.1260 (89243d1cdf*) started at 2025-11-16T19:11:54.632 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.26s ################################################################################ # Installation # Installing Boscia... Resolving package versions... 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.3.0 [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 5.77s ################################################################################ # 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... 1578.1 ms ✓ Bonobo 80362.0 ms ✓ MathOptInterface 10965.1 ms ✓ MathOptSetDistances 37737.9 ms ✓ FrankWolfe 14510.0 ms ✓ Boscia 5 dependencies successfully precompiled in 148 seconds. 95 already precompiled. Precompilation completed after 159.35s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_bph4Fi/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_bph4Fi/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.3.0 [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.400+0 [e5ac4fe4] SCIP_jll v900.200.400+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.6+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 = 0x4bb8f54f333eb8e7 [ 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 = 0x190b8fdbd4aed15e [ Info: removed Indicator Tests Heuristics Tests seed = 0xdf8531b3fe7e3fa8 Sparse Regression Tests seed = 0x9bb3f9c0bbb5e1e2 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.232522e+00 2.279224e+00 4.670191e-02 2.091890e-02 1.868500e+01 1.605566e-01 7687 45 12 18 2 0 3 2 2.258607e+00 2.279224e+00 2.061681e-02 9.128108e-03 2.183000e+01 2.290426e-01 21 14 24 5 4 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.498380e+00 1.225090e+00 3.273289e+00 0.000000e+00 Inf 1 LD 2 2.279224e+00 2.279224e+00 0.000000e+00 1.803283e+00 1.109088e+00 1 Last 2 2.279224e+00 2.279224e+00 0.000000e+00 1.959019e+00 1.020919e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.279224e+00 2.279224e+00 0.000000e+00 1.963632e+00 1.018521e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.279224224713528 Dual Bound: 2.258607413145337 Dual Gap (relative): 0.00912810763313659 Search Statistics. Total number of nodes processed: 5 Total number of lmo calls: 29 Total time (s): 25.711 LMO calls / sec: 1.1279219011318113 Nodes / sec: 0.19446929329858817 LMO calls / node: 5.8 Total number of global tightenings: 44 Global tightenings / node: 14.67 Total number of local tightenings: 45 Local tightenings / node: 15.0 Total number of potential local tightenings: 45 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.511271e+00 2.919770e+00 1.408499e+00 9.319959e-01 1.610300e+01 1.863007e-01 7420 238 37 73 23 1 * 3 4 1.531756e+00 2.900922e+00 1.369166e+00 8.938540e-01 1.649100e+01 4.244740e-01 118 91 82 35 15 0 100 51 2.285438e+00 2.900922e+00 6.154846e-01 2.693071e-01 2.322400e+01 6.501895e+00 23 16 1112 20 15 0 200 51 2.353334e+00 2.900922e+00 5.475878e-01 2.326859e-01 2.571700e+01 9.760081e+00 27 20 1533 20 12 0 300 51 2.411334e+00 2.900922e+00 4.895881e-01 2.030362e-01 2.847300e+01 1.232747e+01 34 25 1980 25 12 0 400 51 2.470389e+00 2.900922e+00 4.305329e-01 1.742774e-01 3.100500e+01 1.454604e+01 23 18 2423 28 14 3 500 51 2.517636e+00 2.900922e+00 3.832861e-01 1.522405e-01 3.325000e+01 1.657143e+01 36 25 2877 35 15 2 600 51 2.556406e+00 2.900922e+00 3.445166e-01 1.347660e-01 3.593300e+01 1.811705e+01 41 30 3349 32 14 7 700 51 2.600389e+00 2.900922e+00 3.005333e-01 1.155724e-01 3.880000e+01 1.935567e+01 41 29 3836 35 14 2 800 51 2.642942e+00 2.900922e+00 2.579805e-01 9.761113e-02 4.167500e+01 2.041992e+01 33 24 4335 25 9 0 900 51 2.694999e+00 2.900922e+00 2.059229e-01 7.640925e-02 4.464500e+01 2.130138e+01 38 27 4838 31 11 1 1000 49 2.754775e+00 2.900922e+00 1.461476e-01 5.305245e-02 4.729100e+01 2.218181e+01 31 23 5316 19 5 0 1100 39 2.833806e+00 2.900922e+00 6.711625e-02 2.368414e-02 4.994100e+01 2.280691e+01 33 24 5815 21 7 0 1139 14 2.875493e+00 2.900922e+00 2.542888e-02 8.843311e-03 5.080500e+01 2.269462e+01 7 5 5967 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 6.964263e+00 7.846491e-02 6.885798e+00 0.000000e+00 Inf 1 LD 2 2.900922e+00 2.900922e+00 0.000000e+00 1.666306e-01 1.200260e+01 1 Last 2 2.900922e+00 2.900922e+00 0.000000e+00 3.347765e-01 5.974135e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.900922e+00 2.900922e+00 0.000000e+00 3.394214e-01 5.892381e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.900922289759383 Dual Bound: 2.875493407964166 Dual Gap (relative): 0.008843310760089896 Search Statistics. Total number of nodes processed: 1153 Total number of lmo calls: 5972 Total time (s): 53.03 LMO calls / sec: 112.61550066000378 Nodes / sec: 21.74240995662832 LMO calls / node: 5.179531656548136 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 19 Non zero entries: 13th entry: 0.17225135624713106 27th entry: 0.17225135624713106 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.638127e+00 2.919770e+00 1.281643e+00 7.823833e-01 3.150000e-01 9.523810e+00 309 252 37 73 23 1 * 3 4 1.660055e+00 2.900922e+00 1.240867e+00 7.474854e-01 6.470000e-01 1.081917e+01 119 92 82 35 15 0 100 29 2.345494e+00 2.900922e+00 5.554287e-01 2.368068e-01 7.493000e+00 1.721607e+01 35 26 1069 20 15 2 200 25 2.468939e+00 2.900922e+00 4.319834e-01 1.749672e-01 1.150000e+01 1.956522e+01 39 28 1726 33 14 0 300 25 2.585616e+00 2.900922e+00 3.153060e-01 1.219462e-01 1.563600e+01 2.078537e+01 44 32 2428 33 15 3 400 25 2.671661e+00 2.900922e+00 2.292611e-01 8.581220e-02 2.030700e+01 2.092874e+01 37 27 3221 39 14 3 500 25 2.775986e+00 2.900922e+00 1.249361e-01 4.500601e-02 2.482000e+01 2.115230e+01 33 24 4003 24 7 0 567 10 2.875248e+00 2.900922e+00 2.567473e-02 8.929571e-03 2.790000e+01 2.068100e+01 35 24 4556 27 8 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.964263e+00 7.846491e-02 6.885798e+00 0.000000e+00 Inf 1 LD 2 2.900922e+00 2.900922e+00 0.000000e+00 5.291941e-03 3.779332e+02 1 Last 2 2.900922e+00 2.900922e+00 0.000000e+00 1.850001e-02 1.081081e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.900922e+00 2.900922e+00 0.000000e+00 2.255590e-02 8.866860e+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.900922289759383 Dual Bound: 2.8752475613825865 Dual Gap (relative): 0.008929571394697827 Search Statistics. Total number of nodes processed: 577 Total number of lmo calls: 4561 Total time (s): 27.937 LMO calls / sec: 163.26019257615349 Nodes / sec: 20.653613487489707 LMO calls / node: 7.904679376083189 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 16 Poisson Tests seed = 0xa155bc36147a0636 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 -2.187236e+02 -1.994978e+02 1.922578e+01 9.637090e-02 1.959000e+01 1.531394e-01 10987 139 42 2222 19 3 * 2 3 -2.187236e+02 -2.009893e+02 1.773430e+01 8.823507e-02 2.118500e+01 2.360160e-01 1588 96 73 1086 21 8 * 12 13 -2.183508e+02 -2.069748e+02 1.137593e+01 5.496285e-02 4.196500e+01 5.957345e-01 1119 93 419 772 21 8 45 46 -2.180205e+02 -2.069748e+02 1.104568e+01 5.336729e-02 1.200060e+02 7.582954e-01 826 80 1604 519 12 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.198391e+02 -4.457994e+02 8.656385e+02 0.000000e+00 Inf 1 LD 2 -2.008729e+02 -2.509127e+02 5.003979e+01 1.881227e-01 1.063136e+01 2 LD 21 -2.103754e+02 -2.291318e+02 1.875640e+01 4.899548e-01 4.286110e+01 3 LD 35 -2.140486e+02 -2.160429e+02 1.994266e+00 5.673349e-01 6.169196e+01 3 LD 47 -2.140904e+02 -2.149428e+02 8.523685e-01 5.904146e-01 7.960507e+01 5 LD 70 -2.141081e+02 -2.144351e+02 3.269602e-01 6.222301e-01 1.124986e+02 6 LD 125 -2.141115e+02 -2.142499e+02 1.384097e-01 6.822208e-01 1.832251e+02 7 LD 167 -2.141119e+02 -2.141633e+02 5.144159e-02 7.274088e-01 2.295820e+02 7 LD 218 -2.141119e+02 -2.141330e+02 2.104956e-02 7.834701e-01 2.782493e+02 7 LD 263 -2.141119e+02 -2.141210e+02 9.014761e-03 8.398218e-01 3.131617e+02 7 LD 308 -2.141119e+02 -2.141157e+02 3.800759e-03 8.927211e-01 3.450126e+02 7 LD 353 -2.141119e+02 -2.141136e+02 1.665743e-03 9.408597e-01 3.751888e+02 7 LD 390 -2.141119e+02 -2.141127e+02 7.197346e-04 9.804824e-01 3.977634e+02 7 LD 428 -2.141119e+02 -2.141122e+02 2.195854e-04 1.018716e+00 4.201366e+02 7 LD 478 -2.141119e+02 -2.141120e+02 9.321603e-05 1.067545e+00 4.477564e+02 7 LD 500 -2.141119e+02 -2.141120e+02 4.292187e-05 1.091947e+00 4.578977e+02 7 LD 558 -2.141119e+02 -2.141120e+02 8.024645e-06 1.157402e+00 4.821144e+02 8 P 1000 -2.141119e+02 -2.141120e+02 8.024645e-06 1.570526e+00 6.367293e+02 8 P 2000 -2.141119e+02 -2.141120e+02 8.024645e-06 2.492328e+00 8.024626e+02 8 P 3000 -2.141119e+02 -2.141120e+02 8.024645e-06 3.226675e+00 9.297496e+02 8 P 4000 -2.141119e+02 -2.141120e+02 8.024645e-06 3.945297e+00 1.013865e+03 8 P 5000 -2.141119e+02 -2.141120e+02 8.024645e-06 4.679068e+00 1.068589e+03 8 P 6000 -2.141119e+02 -2.141120e+02 8.024645e-06 5.402110e+00 1.110677e+03 8 P 7000 -2.141119e+02 -2.141120e+02 8.024645e-06 6.136006e+00 1.140807e+03 8 P 8000 -2.141119e+02 -2.141120e+02 8.024645e-06 6.899452e+00 1.159512e+03 8 P 9000 -2.141119e+02 -2.141120e+02 8.024645e-06 7.647174e+00 1.176905e+03 8 P 10000 -2.141119e+02 -2.141120e+02 8.024645e-06 8.382298e+00 1.192990e+03 8 Last 10001 -2.141119e+02 -2.141120e+02 6.421460e-06 8.387613e+00 1.192353e+03 8 ---------------------------------------------------------------------------------------------------------------- PP 10001 -2.141119e+02 -2.141120e+02 6.421460e-06 8.391413e+00 1.191814e+03 8 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -214.11194922604537 Dual Bound: -218.020512587625 Dual Gap (relative): 0.0182547652090787 Search Statistics. Total number of nodes processed: 91 Total number of lmo calls: 1631 Total time (s): 130.372 LMO calls / sec: 12.51035498419906 Nodes / sec: 0.698002638603381 LMO calls / node: 17.923076923076923 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 -2.120635e+02 -2.075779e+02 4.485612e+00 2.160929e-02 2.057500e+01 1.458080e-01 8056 191 29 134 6 1 * 5 6 -2.112037e+02 -2.081227e+02 3.081071e+00 1.480411e-02 2.436600e+01 4.514487e-01 205 119 108 67 6 1 17 18 -2.099299e+02 -2.081227e+02 1.807283e+00 8.683737e-03 3.409400e+01 1.026574e+00 157 89 309 56 4 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 -1.185293e+02 -2.386743e+02 1.201449e+02 0.000000e+00 Inf 1 LD 2 -2.081227e+02 -2.081227e+02 0.000000e+00 1.804888e-01 1.108102e+01 1 Last 2 -2.081227e+02 -2.081227e+02 0.000000e+00 3.569261e-01 5.603401e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.081227e+02 -2.081227e+02 0.000000e+00 3.620392e-01 5.524264e+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: -208.12266005143795 Dual Bound: -209.92994259675848 Dual Gap (relative): 0.008683737488622618 Search Statistics. Total number of nodes processed: 35 Total number of lmo calls: 314 Total time (s): 36.324 LMO calls / sec: 8.644422420438278 Nodes / sec: 0.9635502697940755 LMO calls / node: 8.971428571428572 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.729152e+02 3.468176e+02 1.739024e+02 1.005709e+00 1.657700e+01 1.809736e-01 8093 180 26 124 7 0 * 2 3 1.729152e+02 3.358139e+02 1.628987e+02 9.420731e-01 1.677900e+01 2.979915e-01 196 124 46 50 8 1 * 4 5 1.890350e+02 3.355453e+02 1.465102e+02 7.750427e-01 1.726300e+01 5.213462e-01 186 106 84 61 5 1 * 7 8 2.053057e+02 3.347997e+02 1.294940e+02 6.307374e-01 1.794200e+01 8.360272e-01 237 122 143 61 10 2 * 12 13 2.066624e+02 3.325137e+02 1.258513e+02 6.089705e-01 1.881600e+01 1.328656e+00 164 94 230 41 5 2 100 101 2.649622e+02 3.325137e+02 6.755150e+01 2.549476e-01 3.231300e+01 6.220407e+00 90 59 1508 21 2 0 200 197 2.879755e+02 3.325137e+02 4.453823e+01 1.546598e-01 4.333900e+01 9.160341e+00 64 38 2709 25 2 0 300 247 3.027961e+02 3.325137e+02 2.971766e+01 9.814413e-02 5.562300e+01 9.834061e+00 16 13 3517 2 1 2 400 249 3.096501e+02 3.325137e+02 2.286368e+01 7.383714e-02 6.015800e+01 1.078826e+01 19 13 4108 2 2 0 500 203 3.179931e+02 3.325137e+02 1.452063e+01 4.566335e-02 6.322700e+01 1.111867e+01 16 11 4505 2 2 0 600 137 3.247851e+02 3.325137e+02 7.728613e+00 2.379608e-02 6.537000e+01 1.127428e+01 6 4 4819 0 1 1 681 60 3.295648e+02 3.325137e+02 2.948935e+00 8.947966e-03 6.695200e+01 1.106763e+01 21 15 5052 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 ---------------------------------------------------------------------------------------------------------------- Last 0 3.325137e+02 3.325137e+02 0.000000e+00 1.410803e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.325137e+02 3.325137e+02 0.000000e+00 1.877989e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 332.5137363011259 Dual Bound: 329.56480176610717 Dual Gap (relative): 0.008947965678420966 Search Statistics. Total number of nodes processed: 741 Total number of lmo calls: 5056 Total time (s): 68.909 LMO calls / sec: 73.37212845927236 Nodes / sec: 10.753312339462187 LMO calls / node: 6.823211875843455 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.729152e+02 3.468176e+02 1.739024e+02 1.005709e+00 1.838600e+01 1.631676e-01 7482 156 26 124 9 0 * 2 3 1.729152e+02 3.429738e+02 1.700586e+02 9.834798e-01 1.966300e+01 2.542847e-01 341 120 44 160 8 1 * 4 5 1.891726e+02 3.355504e+02 1.463778e+02 7.737793e-01 2.172600e+01 4.142502e-01 147 72 84 84 7 1 * 5 6 1.925613e+02 3.338016e+02 1.412403e+02 7.334819e-01 2.271500e+01 4.842615e-01 162 84 102 86 4 1 * 11 12 2.087697e+02 3.325137e+02 1.237440e+02 5.927296e-01 2.844600e+01 8.085495e-01 122 79 209 50 4 0 100 95 2.704553e+02 3.325137e+02 6.205848e+01 2.294593e-01 9.259300e+01 2.105991e+00 72 46 1465 24 3 0 200 171 2.899567e+02 3.325137e+02 4.255707e+01 1.467704e-01 1.419350e+02 2.613873e+00 115 63 2429 33 3 0 300 207 3.042143e+02 3.325137e+02 2.829939e+01 9.302451e-02 1.751910e+02 2.893984e+00 17 12 3097 2 1 0 400 199 3.143770e+02 3.325137e+02 1.813670e+01 5.769093e-02 1.955020e+02 3.063907e+00 18 12 3548 2 2 0 500 133 3.212656e+02 3.325137e+02 1.124815e+01 3.501200e-02 2.046040e+02 3.093781e+00 8 6 3891 0 1 0 600 33 3.274557e+02 3.325137e+02 5.058019e+00 1.544642e-02 2.063700e+02 3.067306e+00 8 6 4149 0 1 0 613 22 3.297268e+02 3.325137e+02 2.786925e+00 8.452225e-03 2.070960e+02 3.066211e+00 23 17 4191 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 ---------------------------------------------------------------------------------------------------------------- Last 0 3.325137e+02 3.325137e+02 0.000000e+00 1.500673e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.325137e+02 3.325137e+02 0.000000e+00 1.970296e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 332.5137363011259 Dual Bound: 329.72681108070304 Dual Gap (relative): 0.008452225074717198 Search Statistics. Total number of nodes processed: 635 Total number of lmo calls: 4195 Total time (s): 209.133 LMO calls / sec: 20.059005513237988 Nodes / sec: 3.036345292230303 LMO calls / node: 6.606299212598425 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 = 0x3d8647bfc38faa43 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.748743e+01 6.636742e+00 2.412417e+01 Inf 1.813900e+01 1.653895e-01 9139 175 41 3516 17 8 * 3 4 -1.519595e+01 4.013134e+00 1.920909e+01 Inf 1.860700e+01 3.762025e-01 272 147 98 1877 18 3 100 99 -3.449717e+00 4.013134e+00 7.462850e+00 Inf 4.132000e+01 4.816070e+00 367 58 3126 8837 17 11 172 147 -1.086114e+00 4.013134e+00 5.099248e+00 Inf 6.000200e+01 5.316489e+00 323 45 5117 8380 8 16 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 4.013133592751235 Dual Bound: -1.0861142748905657 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 319 Total number of lmo calls: 5117 Total time (s): 60.879 LMO calls / sec: 84.05197194434862 Nodes / sec: 5.239902100888648 LMO calls / node: 16.04075235109718 Total number of global tightenings: 13 Global tightenings / node: 0.08 Total number of local tightenings: 926 Local tightenings / node: 5.38 Total number of potential local tightenings: 1389 Time Limit Test seed = 0x69b344e3f6b12373 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.000190e+00 0.000000e+00 1.000190e+00 Inf 1.737600e+01 1.726519e-01 9278 83 26 1329 10 2 25 0 0.000000e+00 0.000000e+00 0.000000e+00 0.000000e+00 1.809900e+01 1.381292e+00 4 3 304 2 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: 304 Total time (s): 18.928 LMO calls / sec: 16.06086221470837 Nodes / sec: 1.3207945900253593 LMO calls / node: 12.16 Total number of global tightenings: 5 Global tightenings / node: 0.2 Total number of local tightenings: 26 Local tightenings / node: 1.04 Total number of potential local tightenings: 28 Strong Convexity and Sharpness Tests seed = 0x6bfada30e6eeef3b 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.277415e+02 2.283315e+02 5.900749e-01 2.590986e-03 1.667400e+01 1.799208e-01 7688 0 11 18 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 228.33152605084547 Dual Bound: 227.74145110439605 Dual Gap (relative): 0.0025909861537631593 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 17.551 LMO calls / sec: 0.6267449148196684 Nodes / sec: 0.17093043131445504 LMO calls / node: 3.6666666666666665 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: 16 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.785451e+02 1.789376e+02 3.924926e-01 2.198282e-03 1.463100e+01 2.050441e-01 5585 0 6 4 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 178.93761510901984 Dual Bound: 178.54512249291642 Dual Gap (relative): 0.0021982824880528266 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 6 Total time (s): 15.403 LMO calls / sec: 0.3895345062650133 Nodes / sec: 0.19476725313250665 LMO calls / node: 2.0 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 18 Branching Strategy Tests seed = 0xcb927a07645a84a5 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.358900e+01 2.207668e-01 6753 53 48 3749 20 5 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.509000e+01 4.307488e+00 11 8 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): 15.967 LMO calls / sec: 59.68560155320348 Nodes / sec: 4.070896223460888 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 4.420000e-01 6.787330e+00 312 46 48 3749 1 2 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.965000e+00 4.427481e+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.966 LMO calls / sec: 516.2767039674466 Nodes / sec: 44.25228891149542 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.600000e-01 8.333333e+00 224 41 48 3749 20 5 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.571000e+00 3.755570e+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.572 LMO calls / sec: 546.4376590330788 Nodes / sec: 37.53180661577608 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 3.700000e-01 8.108108e+00 225 42 48 3749 4 2 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.786000e+00 4.199328e+01 11 7 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.787 LMO calls / sec: 504.75657526580864 Nodes / sec: 41.96978175713487 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.200000e-01 9.375000e+00 217 40 48 3749 4 2 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.994000e+00 4.864594e+01 4 2 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): 1.995 LMO calls / sec: 588.4711779448621 Nodes / sec: 48.62155388471178 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.860000e-01 6.172840e+00 482 77 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.010000e-01 1.123596e+01 93 40 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.550000e-01 1.151832e+01 150 56 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.178000e+00 2.457814e+01 86 36 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.771000e+00 2.474062e+01 67 29 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.477200e+01 2.714595e+01 58 31 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.041300e+01 2.924607e+01 55 25 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.644500e+01 2.998676e+01 59 29 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.188200e+01 3.033059e+01 22 14 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.746600e+01 3.040090e+01 63 29 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.200200e+01 3.030808e+01 13 8 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.599100e+01 2.976669e+01 7 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.894200e+01 2.911610e+01 9 5 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.135300e+01 2.864487e+01 32 15 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.351000e+01 2.793870e+01 10 7 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.532800e+01 2.730986e+01 13 8 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.689800e+01 2.666175e+01 20 13 26318 33 12 12 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.829700e+01 2.612484e+01 11 8 27126 17 9 2 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.891600e+01 2.585036e+01 6 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): 58.917 LMO calls / sec: 467.18264677427567 Nodes / sec: 25.849924470017143 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.158000e+00 1.390176e+00 485 90 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.483000e+00 3.624648e+00 93 41 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.627000e+00 4.187286e+00 141 54 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.134200e+01 1.772174e+01 97 44 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.200500e+01 1.807580e+01 77 36 3485 420 10 10 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.914400e+01 2.073757e+01 93 35 6038 662 16 7 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.527300e+01 2.219760e+01 52 26 8396 223 5 6 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 3.103400e+01 2.297480e+01 43 27 10594 67 10 19 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.580400e+01 2.371243e+01 59 31 12514 245 1 0 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 4.022700e+01 2.453576e+01 29 18 14423 73 2 2 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 4.403600e+01 2.509311e+01 10 7 16134 16 8 7 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.779200e+01 2.554821e+01 7 5 17857 8 5 1 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 5.118900e+01 2.568911e+01 11 7 19379 12 5 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 5.422700e+01 2.587272e+01 15 10 20802 22 9 5 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 5.661100e+01 2.580771e+01 13 9 22010 10 5 1 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 5.882500e+01 2.582235e+01 8 5 23131 12 9 5 1275 286 2.669101e+01 2.836265e+01 1.671635e+00 6.262914e-02 6.000200e+01 2.601580e+01 25 13 23817 106 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.691010066620276 Dual Gap (relative): 0.06262913822340668 Search Statistics. Total number of nodes processed: 1561 Total number of lmo calls: 23817 Total time (s): 60.003 LMO calls / sec: 396.93015349232536 Nodes / sec: 26.015365898371748 LMO calls / node: 15.257527226137091 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2084 Local tightenings / node: 1.63 Total number of potential local tightenings: 5234 Number of alternative decisions: 433 Number of stable decisions: 347 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.910000e-01 5.076142e+00 520 88 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 43 256 696 19 22 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.671000e+00 1.933743e+01 67 29 2096 346 11 15 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 9.403000e+00 2.137616e+01 78 38 3186 412 13 6 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.606400e+01 2.496265e+01 91 47 6017 417 2 1 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.222700e+01 2.676924e+01 53 30 8679 179 9 3 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.746400e+01 2.785465e+01 17 11 11070 27 9 3 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.233900e+01 2.878877e+01 66 32 13344 339 17 8 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.680800e+01 2.936862e+01 51 21 15506 341 8 3 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 4.077200e+01 2.965270e+01 51 26 17444 229 10 6 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.487200e+01 2.975129e+01 7 5 19379 9 7 6 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.810900e+01 3.003596e+01 57 28 21026 246 8 7 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 5.146700e+01 2.990266e+01 36 20 22661 137 4 3 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.431000e+01 2.995765e+01 6 4 24161 6 4 6 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.657000e+01 2.982146e+01 11 8 25390 20 6 3 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.892900e+01 2.971372e+01 40 21 26657 170 13 4 1359 420 2.600843e+01 2.836265e+01 2.354220e+00 9.051757e-02 6.000100e+01 2.964951e+01 25 11 27316 136 7 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.008425508791838 Dual Gap (relative): 0.09051757153916613 Search Statistics. Total number of nodes processed: 1779 Total number of lmo calls: 27316 Total time (s): 60.002 LMO calls / sec: 455.2514916169461 Nodes / sec: 29.64901169961001 LMO calls / node: 15.35469364811692 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2415 Local tightenings / node: 1.78 Total number of potential local tightenings: 5825 Number of alternative decisions: 543 Number of stable decisions: 346 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.170000e-01 5.802708e+00 455 71 64 4885 2 2 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.591000e+00 1.582401e+01 85 37 678 489 23 5 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.238000e+00 1.945645e+01 56 29 968 257 17 12 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.727000e+00 2.601268e+01 14 7 2918 60 2 4 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.268900e+01 3.018362e+01 36 19 5197 153 21 2 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.751100e+01 3.237965e+01 23 13 7469 83 5 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.212500e+01 3.322034e+01 27 13 9610 131 7 3 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.708100e+01 3.371367e+01 36 18 11880 193 7 5 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 3.063400e+01 3.496115e+01 39 22 13971 113 6 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.383500e+01 3.614600e+01 14 9 15981 55 3 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.603500e+01 3.754683e+01 42 24 17719 139 13 1 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 3.829700e+01 3.846254e+01 10 6 19510 37 9 3 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.064300e+01 3.929336e+01 64 27 21254 396 7 4 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.333800e+01 3.911117e+01 10 6 22747 24 8 3 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.569100e+01 3.871660e+01 7 4 24101 6 4 1 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 4.793600e+01 3.815504e+01 14 9 25317 23 11 5 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 4.962200e+01 3.758414e+01 7 5 26374 10 5 1 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.112600e+01 3.702617e+01 7 5 27346 16 8 1 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.219600e+01 3.653537e+01 11 7 28188 61 3 1 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.336300e+01 3.599873e+01 4 3 29039 10 7 8 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.464600e+01 3.529993e+01 8 5 29805 14 8 2 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.543800e+01 3.483170e+01 5 4 30260 6 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.106101931570876 Dual Gap (relative): 0.009127665389483692 Search Statistics. Total number of nodes processed: 1931 Total number of lmo calls: 30260 Total time (s): 55.44 LMO calls / sec: 545.8152958152958 Nodes / sec: 34.830447330447335 LMO calls / node: 15.67063697566028 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1888 Local tightenings / node: 1.01 Total number of potential local tightenings: 4439 Number of alternative decisions: 331 Number of stable decisions: 634 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.820000e-01 6.224066e+00 478 79 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.140000e-01 1.105651e+01 93 41 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.550000e-01 1.151832e+01 138 52 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.003000e+00 2.232589e+01 59 26 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.383000e+00 2.312693e+01 43 19 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.335300e+01 3.003070e+01 37 19 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.907500e+01 3.129751e+01 55 24 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.526300e+01 3.138978e+01 60 30 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.062400e+01 3.157654e+01 22 12 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.629900e+01 3.137827e+01 69 32 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.939500e+01 3.231375e+01 10 6 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.267100e+01 3.208268e+01 7 4 20396 14 8 12 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.570200e+01 3.122402e+01 72 31 21910 381 1 1 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 4.810400e+01 3.057958e+01 12 8 23162 19 11 10 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 5.018500e+01 2.986948e+01 33 18 24363 145 12 7 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 5.170900e+01 2.929857e+01 9 6 25359 25 10 8 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 5.305300e+01 2.878254e+01 32 16 26283 172 9 5 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.426600e+01 2.824973e+01 15 9 27090 27 10 9 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.499200e+01 2.791315e+01 6 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): 54.993 LMO calls / sec: 501.51837506591744 Nodes / sec: 27.912643427345298 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 5.070000e-01 5.917160e+00 504 70 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.110000e-01 1.109741e+01 88 37 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.440000e-01 1.165254e+01 131 48 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.780000e+00 2.289294e+01 87 36 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.367000e+00 2.316644e+01 55 23 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.539400e+01 2.604911e+01 55 29 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.163000e+01 2.760055e+01 52 23 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.769100e+01 2.863746e+01 64 29 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.301600e+01 2.928883e+01 24 14 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.847000e+01 2.960749e+01 61 29 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.254800e+01 2.991915e+01 15 10 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.614400e+01 2.966800e+01 8 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.890000e+01 2.914110e+01 10 6 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.126300e+01 2.869516e+01 29 13 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.316900e+01 2.811789e+01 9 6 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.489300e+01 2.752628e+01 10 7 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.637300e+01 2.691005e+01 17 11 26318 33 12 12 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.771100e+01 2.639012e+01 12 8 27126 17 9 2 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.834700e+01 2.610246e+01 6 5 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): 58.347 LMO calls / sec: 471.7466193634634 Nodes / sec: 26.10245599602379 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.615000e+00 8.298755e-01 496 78 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 4.088000e+00 2.201566e+00 94 42 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 4.226000e+00 2.602934e+00 136 52 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.306300e+01 1.538697e+01 104 49 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.374000e+01 1.579330e+01 76 36 3485 420 10 10 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 2.034000e+01 1.961652e+01 84 38 6090 444 9 4 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.672100e+01 2.189289e+01 46 22 8720 225 8 5 400 347 2.074745e+01 2.836265e+01 7.615193e+00 3.670423e-01 3.100800e+01 2.409056e+01 80 37 11144 379 18 5 500 399 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 3.596400e+01 2.499722e+01 12 7 13355 21 11 7 600 411 2.367246e+01 2.836265e+01 4.690187e+00 1.981284e-01 3.995400e+01 2.530410e+01 69 28 15250 331 10 3 700 407 2.449500e+01 2.836265e+01 3.867641e+00 1.578951e-01 4.395600e+01 2.518428e+01 68 32 17024 329 12 3 800 363 2.539631e+01 2.836265e+01 2.966336e+00 1.168019e-01 4.664600e+01 2.493247e+01 19 11 18354 67 15 10 900 301 2.616952e+01 2.836265e+01 2.193126e+00 8.380461e-02 4.895800e+01 2.453123e+01 15 9 19533 32 11 9 1000 225 2.691767e+01 2.836265e+01 1.444975e+00 5.368128e-02 5.120400e+01 2.392391e+01 6 5 20674 8 4 4 1100 137 2.763514e+01 2.836265e+01 7.275008e-01 2.632520e-02 5.262300e+01 2.350683e+01 23 13 21524 68 13 10 1187 52 2.808687e+01 2.836265e+01 2.757701e-01 9.818469e-03 5.386400e+01 2.300238e+01 11 7 22214 14 10 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.0868749251736 Dual Gap (relative): 0.009818468625151686 Search Statistics. Total number of nodes processed: 1239 Total number of lmo calls: 22214 Total time (s): 53.865 LMO calls / sec: 412.40137380488255 Nodes / sec: 23.00194931773879 LMO calls / node: 17.92897497982244 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2160 Local tightenings / node: 1.82 Total number of potential local tightenings: 4714 Decisions made: [(62, 1), (516, 0), (40, 0)] 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 4.620000e-01 6.493506e+00 458 80 64 4885 36 6 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 9.980000e-01 9.018036e+00 167 53 192 1340 13 25 ====================================================================================== 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 39 running 1 of 1 signal (10): User defined signal 1 SCIPhashtableRetrieve at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPparamsetGetBool at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPsetGetBoolParam at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPgetBoolParam at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) eventExitsolConflictstore at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPeventhdlrExitsol at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPsetExitsolPlugins at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) freeSolve at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPfreeSolve at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPfreeTransform at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPfreeTransform at /home/pkgeval/.julia/packages/SCIP/4grSV/src/LibSCIP.jl:18686 [inlined] free_model at /home/pkgeval/.julia/packages/Boscia/Kl8FO/ext/BosciaSCIPExt.jl:49 [inlined] free_model at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/MOI_bounded_oracle.jl:455 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/time_tracking_lmo.jl:130 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:291 unknown function (ip: 0x769c46fec52a) 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: 0x769c46fdf2e7) 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: 0x769c46fbe677) 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: 0x769c46fba0ad) 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: 0x769c46fb1e38) 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 include_string at ./loading.jl:2993 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3053 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_57745.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 include_string at ./loading.jl:2993 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3053 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_57745.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 exec_options at ./client.jl:310 _start at ./client.jl:577 jfptr__start_78750.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: 0x769c7e37e249) 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 ============================================================== 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 1.020000e+01 1.970588e+01 66 38 3219 200 6 6 * 118 119 1.406031e+01 2.836265e+01 1.430233e+01 1.017213e+00 1.153000e+01 2.055507e+01 38 19 3726 178 10 12 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 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 wait_forever at ./task.jl:1168 jfptr_wait_forever_60660.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 ============================================================== ┌ 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 0x00007b17869e1b40 Total snapshots: 416. Utilization: 0% ╎416 @Base/task.jl:1168 wait_forever() 415╎ 416 @Base/task.jl:1246 wait() 200 199 1.704058e+01 2.836265e+01 1.132207e+01 6.644180e-01 2.380000e+01 1.676471e+01 155 32 6070 226 3 0 300 287 1.921318e+01 2.836265e+01 9.149468e+00 4.762080e-01 3.067000e+01 1.913922e+01 72 38 8686 275 8 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 400 359 2.087523e+01 2.836265e+01 7.487411e+00 3.586743e-01 4.047000e+01 1.875463e+01 43 24 11090 152 12 0 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x0000769c643fc010 Total snapshots: 102. Utilization: 100% ╎95 @Base/client.jl:577 _start() ╎ 95 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 95 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ 95 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ 95 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path::St… ╎ 95 @Base/loading.jl:3053 _include(mapexpr::Function, mod::Module, _pa… ╎ ╎ 95 @Base/loading.jl:2993 include_string(mapexpr::typeof(identity), m… ╎ ╎ 95 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 95 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ ╎ 95 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 95 @Base/loading.jl:3053 _include(mapexpr::Function, mod::Module… ╎ ╎ ╎ 95 @Base/loading.jl:2993 include_string(mapexpr::typeof(identit… ╎ ╎ ╎ 95 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ 95 @Boscia/…oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 95 @Boscia/…oracle.jl:834 #solve#145 ╎ ╎ ╎ 95 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Na… ╎ ╎ ╎ ╎ 95 @Boscia/…rface.jl:270 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 95 @Boscia/…onobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 95 @Boscia/…onobo.jl:35 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 2 @Boscia/…node.jl:325 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 2 @Boscia/…ties.jl:30 check_feasibility ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…cle.jl:474 check_feasibility(lmo::FrankWo… ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…apper.jl:427 optimize!(o::SCIP.Optimizer) ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…apper.jl:16 macro expansion 2╎ ╎ ╎ ╎ ╎ 2 @SCIP/…CIP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:339 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 1 @Boscia/…blem.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:234 is_linear_feasible(o::SCIP.Op… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:253 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ 91 @Boscia/…node.jl:353 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 91 @Boscia/…ants.jl:138 kwcall(::@NamedTuple{epsilon::… ╎ ╎ ╎ ╎ ╎ 91 @Boscia/…nts.jl:158 #solve_frank_wolfe#6 ╎ ╎ ╎ ╎ ╎ 91 @FrankWolfe/…jl:76 kwcall(::@NamedTuple{line_sear… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @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/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:118 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:234 is_linear_feasible(o::SCIP… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:251 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:435 get(o::SCIP.Optimizer, :… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:478 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:251 ht_keyindex ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:206 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:965 getindex ╎ ╎ ╎ ╎ ╎ 8 @FrankWolfe/…l:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:438 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1045 dot(x::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1046 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:453 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:50 (::var"#grad!#build_examples… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:270 mul!(C::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:73 mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:76 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:81 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:706 gemv! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:678 gemv!(trans::Char, … ╎ ╎ ╎ ╎ ╎ 5 @FrankWolfe/…l:467 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 5 @LinearAlgebra/…:1045 dot(x::Vector{Float64},… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…oop.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1046 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:963 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:965 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:965 getindex 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 26 @FrankWolfe/…l:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 26 @Boscia/…ks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 26 @Boscia/…ks.jl:59 process_FW_callback_logic 1╎ ╎ ╎ ╎ ╎ ╎ 24 @Boscia/…s.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 23 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 9 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 9 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:828 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 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:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:248 ht_keyindex(h::Dic… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:134 isslotempty 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ ╎ 8 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:863 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1020 setindex! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1024 _setindex! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 7 @Base/…ay.jl:864 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 7 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 7 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 7 none:? #sol_values##0 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…ta.jl:181 var 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…ct.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::D… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ng.jl:46 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ng.jl:75 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…ng.jl:63 hash_64_64 ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Base/…ng.jl:58 hash_finalizer 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +5 1 @Base/int.jl:88 * ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:248 ht_keyindex(h::D… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:134 isslotempty 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:479 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:396 getindex ╎ ╎ ╎ ╎ ╎ ╎ 14 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:44 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…th.jl:27 - ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…th.jl:13 _broadcast_preserving_ze… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:3544 map ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:828 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:45 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:415 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:425 _zip_iterate_all ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:433 _zip_iterate_some ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1245 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1245 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1253 _iterate_abst… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ls.jl:965 getindex ╎ ╎ ╎ ╎ ╎ ╎ 13 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 13 @LinearAlgebra/…:1045 dot(x::Vector{Float… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 12 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 12 @LinearAlgebra/…:1046 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:963 getindex 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ls.jl:965 getindex 4╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ls.jl:965 getindex 6╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…s.jl:119 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:44 (::var"#f#build_examples##0… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ath.jl:27 - ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…th.jl:13 _broadcast_preserving_zero… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:3544 map ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:833 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:701 _array_for ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:876 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:409 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ay.jl:877 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ot.jl:669 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ot.jl:661 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:648 Array 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:588 GenericMemory 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:649 Array ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:282 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:480 storage_find_argmin_vertex ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:18 dot ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:406 dot 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:356 dot ╎ ╎ ╎ ╎ ╎ 50 @FrankWolfe/…l:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 50 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 41 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 41 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:29 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ble.jl:18 get(o::SCIP.Optimizer, ::M… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1734 sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1741 #sort!#24 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1594 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:561 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:686 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:747 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:802 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:731 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:780 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1380 _sort!(v::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1123 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1154 _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…rt.jl:1123 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…rt.jl:1165 _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…rt.jl:852 _sort!(v::Vect… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Base/…ge.jl:925 iterate 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +5 1 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ ╎ 40 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 40 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 40 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 40 @SCIP/…er.jl:16 macro expansion 39╎ ╎ ╎ ╎ ╎ ╎ ╎ 40 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:118 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:234 is_linear_feasible(o::SCIP… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:249 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:47 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @MathOptInterface/…:115 throw_if_not_val… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:39 is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/set.jl:92 in ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:550 haskey 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:0 ht_keyindex(h::Dict{S… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:251 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:432 get(o::SCIP.Optimizer, :… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:248 ht_keyindex(h::Dict{… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:134 isslotempty 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:122 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ray.jl:1360 getindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…nal.jl:983 _getindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:702 checkbounds ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:692 checkbounds ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:769 checkindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1245 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1245 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1252 _iterate_abstractarr… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:381 checkbounds ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…t.jl:49 free_model 6╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…IP.jl:18686 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:327 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:453 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:50 (::var"#grad!#build_examples… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:270 mul!(C::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:73 mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:76 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:81 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:706 gemv! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:678 gemv!(trans::Char, … ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:411 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.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(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:864 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:? #sol_values##0 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:427 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:409 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 1 @Boscia/…tics.jl:45 run_heuristics(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…tics.jl:63 run_heuristics(tree::BnBTree{B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…lem.jl:94 is_linear_feasible(lmo::Boscia… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:234 is_linear_feasible(o::SCIP.O… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:249 is_linear_feasible_subrouti… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:47 get ╎ ╎ ╎ ╎ ╎ ╎ 1 @MathOptInterface/…:115 throw_if_not_valid ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ble.jl:32 is_valid ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:550 haskey ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::Dict{SCIP… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:130 hashindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:86 - 500 397 2.261057e+01 2.836265e+01 5.752072e+00 2.543975e-01 4.561600e+01 1.966415e+01 34 19 13255 124 12 8 600 411 2.379062e+01 2.836265e+01 4.572023e+00 1.921775e-01 4.966500e+01 2.035639e+01 30 18 15181 90 13 10 700 393 2.462769e+01 2.836265e+01 3.734957e+00 1.516568e-01 5.308500e+01 2.058962e+01 8 6 16798 8 6 12 800 359 2.546045e+01 2.836265e+01 2.902200e+00 1.139886e-01 5.623600e+01 2.060957e+01 18 12 18259 20 8 10 900 299 2.628929e+01 2.836265e+01 2.073352e+00 7.886678e-02 5.865700e+01 2.044087e+01 50 27 19506 212 13 1 972 243 2.680209e+01 2.836265e+01 1.560556e+00 5.822517e-02 6.000200e+01 2.024933e+01 21 13 20239 56 12 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.802088904075383 Dual Gap (relative): 0.058225167706697056 Search Statistics. Total number of nodes processed: 1215 Total number of lmo calls: 20239 Total time (s): 60.003 LMO calls / sec: 337.29980167658283 Nodes / sec: 20.24898755062247 LMO calls / node: 16.65761316872428 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1938 Local tightenings / node: 1.99 Total number of potential local tightenings: 4463 Decisions made: [(66, 0), (518, 0), (23, 0)] 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 4.650000e-01 6.451613e+00 461 80 64 4885 36 6 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 1.009000e+00 8.919722e+00 169 52 192 1340 13 25 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 8.973000e+00 2.240053e+01 53 30 3215 200 6 6 200 201 1.675948e+01 2.977156e+01 1.301208e+01 7.764012e-01 1.608700e+01 2.492696e+01 100 43 6123 607 11 16 [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 wait_forever at ./task.jl:1168 jfptr_wait_forever_60660.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: 27514326 (Pool: 27513655; Big: 671); GC: 22 [39] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/Kl8FO/test/branching_strategy_test.jl:275 <= at ./int.jl:560 [inlined] >= at ./operators.jl:479 [inlined] unitrange_last at ./range.jl:428 [inlined] UnitRange at ./range.jl:417 [inlined] Colon at ./range.jl:5 [inlined] skip_deleted at ./dict.jl:686 [inlined] iterate at ./dict.jl:703 [inlined] get at /home/pkgeval/.julia/packages/SCIP/4grSV/src/MOI_wrapper.jl:378 is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/MOI_bounded_oracle.jl:233 is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/MOI_bounded_oracle.jl:229 [inlined] is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/problem.jl:94 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/time_tracking_lmo.jl:118 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:291 unknown function (ip: 0x769c46fec52a) 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: 0x769c46fdf2e7) 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: 0x769c46fbe677) 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: 0x769c46fba0ad) 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: 0x769c46fb1e38) 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 include_string at ./loading.jl:2993 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3053 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_57745.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 include_string at ./loading.jl:2993 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3053 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_57745.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 exec_options at ./client.jl:310 _start at ./client.jl:577 jfptr__start_78750.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: 0x769c7e37e249) 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: 5207293583 (Pool: 5207289649; Big: 3934); GC: 2654 PkgEval terminated after 2801.79s: test duration exceeded the time limit