Package evaluation to test Boscia on Julia 1.14.0-DEV.1284 (37b9484954*) started at 2025-11-23T18:37:55.073 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.35s ################################################################################ # 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.17.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.88s ################################################################################ # 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... 1591.3 ms ✓ Bonobo 83792.3 ms ✓ MathOptInterface 11461.8 ms ✓ MathOptSetDistances 37308.2 ms ✓ FrankWolfe 14014.7 ms ✓ Boscia 5 dependencies successfully precompiled in 151 seconds. 95 already precompiled. Precompilation completed after 161.22s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_0b77RK/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_0b77RK/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.4 [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.7+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.17.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 = 0x8356372d58052d2c [ 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 = 0x2c1c6bb02452c6b1 Indicator Tests Heuristics Tests seed = 0xcad9e0c5f6c633a2 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: Polish solution Sparse Regression Tests seed = 0x34b631289c9a1c64 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 3.070837e+00 3.211877e+00 1.410404e-01 4.592898e-02 1.865100e+01 1.608493e-01 7784 51 12 14 4 1 19 6 3.185374e+00 3.211877e+00 2.650301e-02 8.320220e-03 2.254500e+01 1.108893e+00 27 20 104 7 5 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.871467e+00 1.621497e-01 7.709318e+00 0.000000e+00 Inf 1 LD 2 3.211877e+00 3.211877e+00 0.000000e+00 2.048504e+00 9.763221e-01 1 Last 2 3.211877e+00 3.211877e+00 0.000000e+00 2.222731e+00 8.997939e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.211877e+00 3.211877e+00 0.000000e+00 2.228247e+00 8.975667e-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: 3.2118771289086396 Dual Bound: 3.185374115184061 Dual Gap (relative): 0.008320220095417998 Search Statistics. Total number of nodes processed: 25 Total number of lmo calls: 109 Total time (s): 26.748 LMO calls / sec: 4.075071033348287 Nodes / sec: 0.9346493195752953 LMO calls / node: 4.36 Total number of global tightenings: 41 Global tightenings / node: 2.16 Total number of local tightenings: 48 Local tightenings / node: 2.53 Total number of potential local tightenings: 48 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.264605e+00 2.704697e+00 1.440092e+00 1.138768e+00 1.702200e+01 1.762425e-01 7973 272 38 85 23 1 * 3 4 1.290567e+00 2.694334e+00 1.403767e+00 1.087713e+00 1.739200e+01 4.024839e-01 117 89 85 33 14 0 100 65 2.091271e+00 2.694334e+00 6.030636e-01 2.883719e-01 2.754300e+01 5.990633e+00 42 30 1426 24 15 2 200 67 2.198407e+00 2.694334e+00 4.959272e-01 2.255848e-01 3.125600e+01 8.542360e+00 45 33 1946 29 12 0 300 67 2.269489e+00 2.694334e+00 4.248452e-01 1.871986e-01 3.498100e+01 1.049141e+01 55 41 2469 31 16 4 400 67 2.331554e+00 2.694334e+00 3.627806e-01 1.555961e-01 3.847300e+01 1.213838e+01 35 25 2996 21 10 0 500 67 2.390151e+00 2.694334e+00 3.041836e-01 1.272654e-01 4.224200e+01 1.342266e+01 36 25 3551 24 8 2 600 67 2.449132e+00 2.694334e+00 2.452023e-01 1.001181e-01 4.617200e+01 1.444598e+01 57 33 4155 25 5 0 700 67 2.499023e+00 2.694334e+00 1.953116e-01 7.815519e-02 5.049200e+01 1.519053e+01 50 36 4816 44 12 5 800 63 2.540429e+00 2.694334e+00 1.539052e-01 6.058237e-02 5.493000e+01 1.571090e+01 69 50 5531 75 11 11 900 59 2.589175e+00 2.694334e+00 1.051590e-01 4.061487e-02 5.941300e+01 1.614125e+01 47 34 6286 33 5 1 1000 47 2.649829e+00 2.694334e+00 4.450548e-02 1.679560e-02 6.348500e+01 1.649208e+01 40 28 7005 30 7 7 1023 36 2.669726e+00 2.694334e+00 2.460858e-02 9.217643e-03 6.433600e+01 1.646046e+01 22 16 7154 6 3 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.848895e+00 -8.246659e-01 7.673561e+00 0.000000e+00 Inf 1 LD 2 2.694334e+00 2.694334e+00 0.000000e+00 1.652262e-01 1.210462e+01 1 Last 2 2.694334e+00 2.694334e+00 0.000000e+00 3.341957e-01 5.984517e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.694334e+00 2.694334e+00 0.000000e+00 3.389302e-01 5.900920e+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.6943341530813854 Dual Bound: 2.6697255767346184 Dual Gap (relative): 0.00921764265257033 Search Statistics. Total number of nodes processed: 1059 Total number of lmo calls: 7159 Total time (s): 66.685 LMO calls / sec: 107.35547724375796 Nodes / sec: 15.880632825972857 LMO calls / node: 6.760151085930123 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: 9 Non zero entries: 17th entry: 0.17892232585786633 29th entry: 0.17892232585786633 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.413529e+00 2.704697e+00 1.291168e+00 9.134358e-01 3.350000e-01 8.955224e+00 327 268 38 85 23 1 * 3 4 1.437002e+00 2.694334e+00 1.257332e+00 8.749688e-01 6.960000e-01 1.005747e+01 114 88 85 33 14 0 100 39 2.153584e+00 2.694334e+00 5.407498e-01 2.510929e-01 1.044400e+01 1.330908e+01 26 20 1390 19 15 1 200 33 2.322163e+00 2.694334e+00 3.721713e-01 1.602693e-01 1.475100e+01 1.579554e+01 27 20 2034 18 9 1 300 33 2.461791e+00 2.694334e+00 2.325432e-01 9.446097e-02 1.929000e+01 1.726283e+01 37 27 2708 25 8 0 400 33 2.573943e+00 2.694334e+00 1.203907e-01 4.677285e-02 2.476600e+01 1.748365e+01 51 37 3574 38 11 2 493 18 2.668158e+00 2.694334e+00 2.617588e-02 9.810467e-03 3.064600e+01 1.667428e+01 41 31 4529 21 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.848895e+00 -8.246659e-01 7.673561e+00 0.000000e+00 Inf 1 LD 2 2.694334e+00 2.694334e+00 0.000000e+00 1.512955e-03 1.321916e+03 1 Last 2 2.694334e+00 2.694334e+00 0.000000e+00 1.025656e-02 1.949971e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.694334e+00 2.694334e+00 0.000000e+00 1.499291e-02 1.333964e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.6943341530813854 Dual Bound: 2.668158273831092 Dual Gap (relative): 0.009810467207669992 Search Statistics. Total number of nodes processed: 511 Total number of lmo calls: 4534 Total time (s): 30.677 LMO calls / sec: 147.79802457867459 Nodes / sec: 16.657430648368486 LMO calls / node: 8.87279843444227 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: 5 Poisson Tests seed = 0xb44975704f167830 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -4.078165e+02 -3.825169e+02 2.529953e+01 6.613962e-02 2.033800e+01 1.475071e-01 11019 171 48 1716 17 4 * 2 3 -4.078165e+02 -3.845981e+02 2.321832e+01 6.037033e-02 2.214300e+01 2.258050e-01 1799 109 80 1323 17 4 * 3 4 -4.073751e+02 -3.877840e+02 1.959107e+01 5.052058e-02 2.432200e+01 2.878053e-01 2174 124 118 1541 9 3 * 5 6 -4.072906e+02 -3.893529e+02 1.793771e+01 4.607056e-02 2.837800e+01 3.876242e-01 1223 95 184 867 14 10 * 10 11 -4.069073e+02 -3.912920e+02 1.561533e+01 3.990711e-02 3.473600e+01 6.045601e-01 1230 104 330 845 19 13 * 13 14 -4.064706e+02 -3.924300e+02 1.404059e+01 3.577857e-02 3.953000e+01 6.830256e-01 1817 108 430 1301 15 5 * 22 23 -4.062568e+02 -3.931319e+02 1.312492e+01 3.338553e-02 5.342500e+01 8.423023e-01 1371 136 727 845 23 11 61 62 -4.052776e+02 -3.931319e+02 1.214574e+01 3.089482e-02 1.200150e+02 1.024872e+00 174 43 1951 68 6 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 6.739288e+02 -6.998836e+02 1.373812e+03 0.000000e+00 Inf 1 LD 2 -3.820874e+02 -4.342235e+02 5.213617e+01 1.874463e-01 1.066972e+01 2 LD 26 -3.948994e+02 -4.127206e+02 1.782113e+01 5.082923e-01 5.115167e+01 4 LD 33 -3.988010e+02 -4.060706e+02 7.269644e+00 5.251273e-01 6.284190e+01 4 LD 40 -3.989061e+02 -4.024127e+02 3.506674e+00 5.412294e-01 7.390581e+01 4 LD 66 -3.991892e+02 -4.007520e+02 1.562785e+00 5.821044e-01 1.133817e+02 5 LD 98 -3.993125e+02 -3.998795e+02 5.670029e-01 6.507034e-01 1.506062e+02 5 LD 159 -3.993287e+02 -3.995372e+02 2.085025e-01 7.223432e-01 2.201170e+02 6 LD 206 -3.993301e+02 -3.993998e+02 6.969144e-02 7.726145e-01 2.666272e+02 6 LD 249 -3.993303e+02 -3.993556e+02 2.528328e-02 8.179922e-01 3.044039e+02 6 LD 296 -3.993303e+02 -3.993394e+02 9.049871e-03 8.685982e-01 3.407790e+02 6 LD 341 -3.993303e+02 -3.993335e+02 3.244695e-03 9.213696e-01 3.701012e+02 6 LD 386 -3.993303e+02 -3.993314e+02 1.118964e-03 9.633761e-01 4.006742e+02 6 LD 429 -3.993303e+02 -3.993307e+02 4.154369e-04 1.042638e+00 4.114562e+02 6 LD 476 -3.993303e+02 -3.993305e+02 1.461840e-04 1.078303e+00 4.414343e+02 6 LD 523 -3.993303e+02 -3.993304e+02 5.030876e-05 1.116249e+00 4.685336e+02 6 LD 561 -3.993303e+02 -3.993303e+02 1.352188e-05 1.145098e+00 4.899143e+02 6 LD 609 -3.993303e+02 -3.993303e+02 4.960544e-06 1.181846e+00 5.152956e+02 6 LD 688 -3.993303e+02 -3.993303e+02 1.128262e-06 1.238821e+00 5.553668e+02 6 P 1000 -3.993303e+02 -3.993303e+02 1.128262e-06 1.469238e+00 6.806250e+02 6 P 2000 -3.993303e+02 -3.993303e+02 1.128262e-06 2.327359e+00 8.593432e+02 6 P 3000 -3.993303e+02 -3.993303e+02 1.128262e-06 3.124833e+00 9.600513e+02 6 P 4000 -3.993303e+02 -3.993303e+02 1.128262e-06 3.922659e+00 1.019716e+03 6 P 5000 -3.993303e+02 -3.993303e+02 1.128262e-06 4.691473e+00 1.065763e+03 6 P 6000 -3.993303e+02 -3.993303e+02 1.128262e-06 5.461155e+00 1.098669e+03 6 P 7000 -3.993303e+02 -3.993303e+02 1.128262e-06 6.258536e+00 1.118472e+03 6 P 8000 -3.993303e+02 -3.993303e+02 1.128262e-06 7.030652e+00 1.137875e+03 6 P 9000 -3.993303e+02 -3.993303e+02 1.128262e-06 7.797699e+00 1.154187e+03 6 P 10000 -3.993303e+02 -3.993303e+02 1.128262e-06 8.553859e+00 1.169063e+03 6 Last 10001 -3.993303e+02 -3.993303e+02 1.128262e-06 8.559464e+00 1.168414e+03 6 ---------------------------------------------------------------------------------------------------------------- PP 10001 -3.993303e+02 -3.993303e+02 1.349192e-06 8.563689e+00 1.167838e+03 6 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -399.33030408715103 Dual Bound: -405.27762732527185 Dual Gap (relative): 0.014893242955142355 Search Statistics. Total number of nodes processed: 123 Total number of lmo calls: 1980 Total time (s): 130.684 LMO calls / sec: 15.151051391141992 Nodes / sec: 0.9412016773285177 LMO calls / node: 16.097560975609756 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 -3.675802e+02 -3.643700e+02 3.210201e+00 8.810280e-03 2.127100e+01 1.410371e-01 8847 130 20 42 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -1.946113e+02 -3.929303e+02 1.983190e+02 0.000000e+00 Inf 1 LD 2 -3.643700e+02 -3.643700e+02 0.000000e+00 1.846771e-01 1.082971e+01 1 Last 2 -3.643700e+02 -3.643700e+02 0.000000e+00 3.690544e-01 5.419256e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -3.643700e+02 -3.643700e+02 0.000000e+00 3.744789e-01 5.340755e+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: -364.36996657060087 Dual Bound: -367.5801679302825 Dual Gap (relative): 0.008810279809545303 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 25 Total time (s): 23.651 LMO calls / sec: 1.057037757388694 Nodes / sec: 0.12684453088664327 LMO calls / node: 8.333333333333334 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.690811e+02 3.433428e+02 1.742617e+02 1.030640e+00 1.684900e+01 1.780521e-01 8143 167 25 150 8 0 * 3 4 1.863458e+02 3.364563e+02 1.501104e+02 8.055476e-01 1.737400e+01 4.029009e-01 315 147 66 95 5 0 * 4 5 1.863458e+02 3.342302e+02 1.478844e+02 7.936020e-01 1.757700e+01 5.120328e-01 197 118 85 55 8 0 * 14 15 2.076640e+02 3.335991e+02 1.259350e+02 6.064364e-01 1.949000e+01 1.487943e+00 172 100 254 43 3 0 * 18 19 2.219976e+02 3.333464e+02 1.113488e+02 5.015764e-01 2.027900e+01 1.824548e+00 160 93 320 41 3 1 * 19 20 2.220020e+02 3.299608e+02 1.079588e+02 4.862963e-01 2.046900e+01 1.905320e+00 183 102 336 54 5 0 * 64 65 2.579681e+02 3.296917e+02 7.172358e+01 2.780328e-01 2.868200e+01 4.497594e+00 130 79 1025 34 5 0 100 101 2.668518e+02 3.296917e+02 6.283988e+01 2.354861e-01 3.410200e+01 5.894082e+00 227 97 1504 99 4 1 200 169 2.909186e+02 3.296917e+02 3.877309e+01 1.332782e-01 5.225000e+01 7.062201e+00 333 83 2625 198 1 0 300 177 3.076558e+02 3.296917e+02 2.203584e+01 7.162497e-02 5.913800e+01 8.065880e+00 19 14 3341 2 2 0 * 358 149 3.138487e+02 3.290044e+02 1.515573e+01 4.828993e-02 6.181400e+01 8.299091e+00 21 14 3627 2 2 0 400 127 3.172681e+02 3.290044e+02 1.173626e+01 3.699162e-02 6.390700e+01 8.340244e+00 130 73 3849 45 2 0 495 46 3.262695e+02 3.290044e+02 2.734860e+00 8.382212e-03 6.659100e+01 8.214323e+00 18 12 4188 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.299608e+02 3.159528e+02 1.400797e+01 0.000000e+00 Inf 1 LD 2 3.290044e+02 3.290044e+02 4.481421e-09 1.577717e-01 1.267654e+01 2 Last 2 3.290044e+02 3.290044e+02 4.481421e-09 3.249979e-01 6.153885e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.290044e+02 3.290044e+02 4.481421e-09 3.302586e-01 6.055860e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 329.00439496259065 Dual Bound: 326.2695344935868 Dual Gap (relative): 0.008382212189221834 Search Statistics. Total number of nodes processed: 547 Total number of lmo calls: 4193 Total time (s): 68.835 LMO calls / sec: 60.913779327377064 Nodes / sec: 7.946538824725795 LMO calls / node: 7.6654478976234 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.690811e+02 3.433428e+02 1.742617e+02 1.030640e+00 2.003900e+01 1.497081e-01 7991 170 25 150 5 0 * 3 4 1.854928e+02 3.399563e+02 1.544636e+02 8.327202e-01 2.248700e+01 3.112910e-01 262 133 68 76 5 0 * 4 5 1.854928e+02 3.333464e+02 1.478536e+02 7.970855e-01 2.349600e+01 3.830439e-01 191 124 87 44 7 0 * 40 41 2.412338e+02 3.296917e+02 8.845789e+01 3.666895e-01 5.645600e+01 1.434746e+00 187 99 698 63 4 0 100 91 2.692101e+02 3.296917e+02 6.048156e+01 2.246630e-01 9.677700e+01 1.973609e+00 114 71 1493 34 2 1 200 157 2.940339e+02 3.296917e+02 3.565781e+01 1.212711e-01 1.456860e+02 2.450476e+00 88 55 2488 21 2 0 300 167 3.099050e+02 3.296917e+02 1.978665e+01 6.384747e-02 1.713550e+02 2.725336e+00 17 12 3030 2 1 0 * 340 151 3.144279e+02 3.290044e+02 1.457650e+01 4.635880e-02 1.779370e+02 2.759404e+00 14 9 3235 2 2 0 400 109 3.194790e+02 3.290044e+02 9.525444e+00 2.981556e-02 1.838710e+02 2.768245e+00 14 9 3478 2 2 0 489 26 3.259165e+02 3.290044e+02 3.087896e+00 9.474501e-03 1.867110e+02 2.758273e+00 8 6 3725 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.299608e+02 3.159528e+02 1.400797e+01 0.000000e+00 Inf 1 LD 2 3.290044e+02 3.290044e+02 4.481421e-09 1.605097e-01 1.246030e+01 2 Last 2 3.290044e+02 3.290044e+02 4.481421e-09 3.363909e-01 5.945463e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.290044e+02 3.290044e+02 4.481421e-09 3.410816e-01 5.863699e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 329.00439496259065 Dual Bound: 325.91649889480317 Dual Gap (relative): 0.009474500610612445 Search Statistics. Total number of nodes processed: 515 Total number of lmo calls: 3730 Total time (s): 188.837 LMO calls / sec: 19.752484947335535 Nodes / sec: 2.727219771549008 LMO calls / node: 7.242718446601942 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 = 0x5d9b8f5cbd428b11 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 -3.284104e+01 1.845048e+01 5.129152e+01 Inf 1.748300e+01 1.715953e-01 8613 134 35 3094 17 5 * 2 3 -3.284104e+01 1.726052e+01 5.010156e+01 Inf 1.763600e+01 2.835110e-01 150 36 48 2755 18 6 * 4 5 -2.928458e+01 1.335992e+01 4.264449e+01 Inf 1.798000e+01 5.005562e-01 132 34 96 3157 17 7 * 6 7 -2.842604e+01 3.495032e+00 3.192108e+01 Inf 1.859000e+01 6.993007e-01 168 63 144 2812 19 2 * 15 16 -2.442894e+01 -1.391582e+00 2.303736e+01 1.655479e+01 2.031500e+01 1.525966e+00 354 147 425 5701 20 4 * 23 24 -2.276099e+01 -8.236833e+00 1.452416e+01 1.763318e+00 2.205700e+01 2.130843e+00 535 181 681 10001 17 13 100 101 -1.688011e+01 -8.236833e+00 8.643279e+00 1.049345e+00 3.951600e+01 5.086547e+00 22 12 3067 251 11 1 178 171 -1.455945e+01 -8.236833e+00 6.322617e+00 7.676029e-01 6.000500e+01 5.816182e+00 446 102 5523 9609 24 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -8.236832859825725 Dual Bound: -14.559449893517709 Dual Gap (relative): 0.7676029295835144 Search Statistics. Total number of nodes processed: 349 Total number of lmo calls: 5523 Total time (s): 60.801 LMO calls / sec: 90.83732175457641 Nodes / sec: 5.740037170441275 LMO calls / node: 15.825214899713467 Total number of global tightenings: 30 Global tightenings / node: 0.17 Total number of local tightenings: 1037 Local tightenings / node: 5.83 Total number of potential local tightenings: 1469 Time Limit Test seed = 0x67f46adeed31e038 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.665128e-01 0.000000e+00 8.665128e-01 Inf 1.638300e+01 1.831166e-01 8282 95 23 617 8 0 35 0 0.000000e+00 0.000000e+00 0.000000e+00 0.000000e+00 1.808500e+01 1.935306e+00 3 2 490 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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: 35 Total number of lmo calls: 490 Total time (s): 18.885 LMO calls / sec: 25.946518400847232 Nodes / sec: 1.8533227429176593 LMO calls / node: 14.0 Total number of global tightenings: 6 Global tightenings / node: 0.17 Total number of local tightenings: 69 Local tightenings / node: 1.97 Total number of potential local tightenings: 82 Strong Convexity and Sharpness Tests seed = 0x2abd2a2268ceee02 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.943516e+02 1.949733e+02 6.216961e-01 3.198821e-03 1.634600e+01 1.835311e-01 7458 1000 14 33 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 194.97332596512317 Dual Bound: 194.3516298882833 Dual Gap (relative): 0.003198821009102057 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 14 Total time (s): 17.227 LMO calls / sec: 0.8126777732629012 Nodes / sec: 0.17414523712776456 LMO calls / node: 4.666666666666667 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 15 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 0 1.860910e+02 1.860933e+02 2.236970e-03 1.202084e-05 1.482200e+01 6.746728e-02 5812 0 4 2 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 186.0932714292205 Dual Bound: 186.09103445957604 Dual Gap (relative): 1.2020835130254522e-5 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 4 Total time (s): 15.754 LMO calls / sec: 0.2539037704709915 Nodes / sec: 0.06347594261774787 LMO calls / node: 4.0 Total number of global tightenings: 10 Global tightenings / node: 10.0 Total number of local tightenings: 10 Local tightenings / node: 10.0 Total number of potential local tightenings: 20 Branching Strategy Tests seed = 0x18a3d6d97cf69ca7 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.527600e+01 1.963865e-01 7988 55 48 3749 20 5 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.703900e+01 3.814778e+00 12 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): 17.947 LMO calls / sec: 53.10079679054996 Nodes / sec: 3.621775227057447 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.700000e-01 8.108108e+00 238 52 48 3749 1 2 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.999000e+00 4.352176e+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): 2.0 LMO calls / sec: 507.5 Nodes / sec: 43.5 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.670000e-01 8.174387e+00 225 46 48 3749 20 5 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.691000e+00 3.489060e+01 4 2 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.692 LMO calls / sec: 507.68321513002365 Nodes / sec: 34.86997635933806 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.760000e-01 7.978723e+00 228 43 48 3749 4 2 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.764000e+00 4.251701e+01 12 8 902 27 10 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.765 LMO calls / sec: 511.04815864022663 Nodes / sec: 42.492917847025495 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.470000e-01 8.645533e+00 245 41 48 3749 4 2 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 2.106000e+00 4.605888e+01 4 3 1174 2 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.325011777780223 Dual Gap (relative): 0.007807821244322148 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1174 Total time (s): 2.107 LMO calls / sec: 557.1903179876601 Nodes / sec: 46.03701945894637 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.710000e-01 6.369427e+00 467 83 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.330000e-01 1.080432e+01 121 46 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.760000e-01 1.127049e+01 140 55 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.099000e+00 2.209034e+01 95 42 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.736000e+00 2.228841e+01 70 30 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.562800e+01 2.565907e+01 35 18 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.977400e+01 3.019116e+01 38 16 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.589100e+01 3.062840e+01 55 27 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.112300e+01 3.107027e+01 13 8 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.573300e+01 3.187530e+01 60 27 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.014500e+01 3.171005e+01 14 9 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.396500e+01 3.113841e+01 7 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.679600e+01 3.045132e+01 11 7 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.895900e+01 3.004555e+01 31 14 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.080900e+01 2.942392e+01 8 6 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.207200e+01 2.901751e+01 9 6 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.319600e+01 2.851718e+01 14 9 26318 33 12 12 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.429800e+01 2.804892e+01 10 6 27126 17 9 2 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.478200e+01 2.780110e+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): 54.783 LMO calls / sec: 502.4368873555665 Nodes / sec: 27.800595075114543 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 1.916000e+00 1.565762e+00 475 78 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.188000e+00 4.113346e+00 59 26 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.281000e+00 4.822446e+00 90 35 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.065700e+01 1.886084e+01 77 34 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.123500e+01 1.931464e+01 73 31 3485 420 10 10 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.768000e+01 2.245475e+01 86 29 6038 662 16 7 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.300900e+01 2.438176e+01 70 25 8396 223 5 6 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.776200e+01 2.568259e+01 22 13 10594 67 10 19 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.199900e+01 2.653208e+01 49 24 12514 245 1 0 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.647700e+01 2.705815e+01 30 18 14423 73 2 2 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 4.032900e+01 2.739964e+01 12 8 16134 16 8 7 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.408700e+01 2.769524e+01 7 5 17857 8 5 1 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.767200e+01 2.758433e+01 13 9 19379 12 5 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 5.055300e+01 2.775305e+01 15 10 20802 22 9 5 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 5.277100e+01 2.768566e+01 12 8 22010 10 5 1 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 5.497700e+01 2.762974e+01 8 5 23131 12 9 5 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.655900e+01 2.788239e+01 11 7 24076 18 5 4 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.821600e+01 2.784458e+01 13 9 24995 22 9 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.979700e+01 2.774387e+01 13 8 25874 36 9 12 1520 143 2.775558e+01 2.836265e+01 6.070610e-01 2.187167e-02 6.000000e+01 2.771667e+01 6 4 26015 7 4 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.75558397933754 Dual Gap (relative): 0.021871672616197105 Search Statistics. Total number of nodes processed: 1663 Total number of lmo calls: 26015 Total time (s): 60.001 LMO calls / sec: 433.57610706488225 Nodes / sec: 27.71620472992117 LMO calls / node: 15.643415514131089 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2192 Local tightenings / node: 1.44 Total number of potential local tightenings: 5412 Number of alternative decisions: 438 Number of stable decisions: 393 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.380000e-01 5.576208e+00 472 85 64 4885 36 6 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.296000e+00 1.003086e+01 107 44 256 696 19 22 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.757000e+00 1.909131e+01 68 32 2096 346 11 15 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 9.583000e+00 2.097464e+01 83 41 3186 412 13 6 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.662900e+01 2.411450e+01 85 44 6017 417 2 1 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.262200e+01 2.630183e+01 49 28 8679 179 9 3 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.776100e+01 2.755664e+01 16 10 11070 27 9 3 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.265500e+01 2.851018e+01 68 33 13344 339 17 8 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.743000e+01 2.888058e+01 56 25 15506 341 8 3 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 4.195800e+01 2.881453e+01 56 31 17444 229 10 6 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.618500e+01 2.890549e+01 8 5 19379 9 7 6 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.958400e+01 2.914247e+01 51 26 21026 246 8 7 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 5.295600e+01 2.906186e+01 43 24 22661 137 4 3 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.544700e+01 2.934334e+01 5 3 24161 6 4 6 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.691100e+01 2.964278e+01 7 5 25390 20 6 3 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.838600e+01 2.999007e+01 23 12 26657 170 13 4 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.964700e+01 3.009372e+01 6 4 27751 16 7 3 1433 374 2.636038e+01 2.836265e+01 2.002265e+00 7.595735e-02 6.000100e+01 3.011616e+01 16 9 28093 78 11 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.360380360251305 Dual Gap (relative): 0.07595735106208394 Search Statistics. Total number of nodes processed: 1807 Total number of lmo calls: 28093 Total time (s): 60.002 LMO calls / sec: 468.2010599646678 Nodes / sec: 30.115662811239623 LMO calls / node: 15.546762589928058 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2466 Local tightenings / node: 1.72 Total number of potential local tightenings: 5900 Number of alternative decisions: 543 Number of stable decisions: 360 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 3.500000e-01 8.571429e+00 308 55 64 4885 2 2 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 1.647000e+00 2.489375e+01 69 31 678 489 23 5 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 2.268000e+00 2.777778e+01 43 23 968 257 17 12 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 6.163000e+00 3.261399e+01 16 9 2918 60 2 4 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 9.848000e+00 3.889115e+01 21 11 5197 153 21 2 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.275700e+01 4.444619e+01 14 8 7469 83 5 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 1.618600e+01 4.540961e+01 30 15 9610 131 7 3 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.045200e+01 4.464111e+01 41 20 11880 193 7 5 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.469600e+01 4.336735e+01 37 22 13971 113 6 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 2.858900e+01 4.277869e+01 21 13 15981 55 3 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.125400e+01 4.329046e+01 36 20 17719 139 13 1 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 3.491200e+01 4.219180e+01 19 12 19510 37 9 3 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 3.847100e+01 4.151179e+01 69 30 21254 396 7 4 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.087300e+01 4.146992e+01 8 5 22747 24 8 3 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.230100e+01 4.181934e+01 3 2 24101 6 4 1 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 4.358900e+01 4.196013e+01 10 7 25317 23 11 5 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 4.468600e+01 4.173567e+01 5 3 26374 10 5 1 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 4.571700e+01 4.140692e+01 7 5 27346 16 8 1 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 4.702500e+01 4.055290e+01 20 12 28188 61 3 1 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 4.831600e+01 3.975909e+01 6 4 29039 10 7 8 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 4.943100e+01 3.902409e+01 7 4 29805 14 8 2 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.003300e+01 3.859453e+01 4 3 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): 50.034 LMO calls / sec: 604.7887436543151 Nodes / sec: 38.593756245752886 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.430000e-01 6.772009e+00 440 69 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.620000e-01 1.181102e+01 91 39 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.000000e-01 1.222222e+01 135 50 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.288000e+00 2.425193e+01 80 30 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.822000e+00 2.459760e+01 53 23 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.412000e+01 2.839943e+01 45 21 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.952800e+01 3.057149e+01 45 18 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.491000e+01 3.183460e+01 53 25 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.026200e+01 3.195427e+01 23 14 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.547700e+01 3.210531e+01 58 26 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.978300e+01 3.199859e+01 15 9 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.335900e+01 3.157361e+01 9 6 20396 14 8 12 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.658100e+01 3.063481e+01 65 29 21910 381 1 1 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 4.895000e+01 3.005107e+01 12 8 23162 19 11 10 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 5.113800e+01 2.931284e+01 41 23 24363 145 12 7 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 5.265900e+01 2.877001e+01 10 6 25359 25 10 8 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 5.398400e+01 2.828616e+01 38 19 26283 172 9 5 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.519500e+01 2.777425e+01 12 8 27090 27 10 9 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.593700e+01 2.744159e+01 8 5 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): 55.938 LMO calls / sec: 493.0458722156673 Nodes / sec: 27.44109549858772 LMO calls / node: 17.96742671009772 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2409 Local tightenings / node: 1.64 Total number of potential local tightenings: 5193 Number of alternative decisions: 718 Number of stable decisions: 49 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.780000e-01 6.276151e+00 475 74 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.130000e-01 1.107011e+01 95 43 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.720000e-01 1.131687e+01 155 55 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.218000e+00 2.180516e+01 101 41 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.946000e+00 2.181782e+01 72 32 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.625200e+01 2.467389e+01 50 25 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.257900e+01 2.644050e+01 57 25 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.925300e+01 2.710833e+01 53 26 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.450000e+01 2.802899e+01 20 11 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.984100e+01 2.858864e+01 59 26 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.453200e+01 2.858619e+01 16 10 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.838500e+01 2.829389e+01 7 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 5.131100e+01 2.777182e+01 9 5 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.357700e+01 2.745581e+01 32 15 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.563300e+01 2.687254e+01 10 7 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.704100e+01 2.648972e+01 10 6 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.831300e+01 2.601478e+01 14 9 26318 33 12 12 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.945300e+01 2.561687e+01 9 6 27126 17 9 2 1451 74 2.807374e+01 2.836265e+01 2.889019e-01 1.029082e-02 6.000100e+01 2.541624e+01 5 3 27524 3 1 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 28.073743082147622 Dual Gap (relative): 0.010290823792608893 Search Statistics. Total number of nodes processed: 1525 Total number of lmo calls: 27524 Total time (s): 60.002 LMO calls / sec: 458.7180427319089 Nodes / sec: 25.415819472684245 LMO calls / node: 18.048524590163936 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2412 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.486000e+00 8.605852e-01 457 70 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 3.819000e+00 2.356638e+00 96 43 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 3.961000e+00 2.777076e+00 138 53 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.241900e+01 1.618488e+01 103 47 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.303000e+01 1.665388e+01 72 32 3485 420 10 10 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 1.891200e+01 2.109772e+01 66 27 6090 444 9 4 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.374600e+01 2.463573e+01 31 15 8720 225 8 5 400 347 2.074745e+01 2.836265e+01 7.615193e+00 3.670423e-01 2.779800e+01 2.687244e+01 66 30 11144 379 18 5 500 399 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 3.240800e+01 2.774006e+01 12 7 13355 21 11 7 600 411 2.367246e+01 2.836265e+01 4.690187e+00 1.981284e-01 3.633800e+01 2.782211e+01 56 23 15250 331 10 3 700 407 2.449500e+01 2.836265e+01 3.867641e+00 1.578951e-01 3.994800e+01 2.771102e+01 59 27 17024 329 12 3 ====================================================================================== 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 __libc_sigaction at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) SCIPsolve at /home/pkgeval/.julia/artifacts/a0004f9e1a144045568d337f726030bc46a0c532/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/packages/SCIP/4grSV/src/LibSCIP.jl:18664 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/4grSV/src/wrapper.jl:16 [inlined] optimize! at /home/pkgeval/.julia/packages/SCIP/4grSV/src/MOI_wrapper.jl:427 _optimize_and_return at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/moi_oracle.jl:358 #compute_extreme_point#108 at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/moi_oracle.jl:43 compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/moi_oracle.jl:24 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/time_tracking_lmo.jl:116 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/time_tracking_lmo.jl:108 [inlined] #blended_pairwise_conditional_gradient#356 at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:166 unknown function (ip: 0x7eb51e10908a) 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: 0x7eb51e2f7d37) 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: 0x7eb51e2eaed7) 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: 0x7eb51e2d22bd) 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: 0x7eb51e2ca918) 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:3003 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3063 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_42396.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:3003 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3063 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_42396.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_73133.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: 0x7eb556ec1249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 800 363 2.539631e+01 2.836265e+01 2.966336e+00 1.168019e-01 4.287500e+01 2.712536e+01 20 12 18354 67 15 10 900 301 2.616952e+01 2.836265e+01 2.193126e+00 8.380461e-02 4.494500e+01 2.672155e+01 10 6 19533 32 11 9 1000 225 2.691767e+01 2.836265e+01 1.444975e+00 5.368128e-02 5.060100e+01 2.420901e+01 7 5 20674 8 4 4 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 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_33345.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 ============================================================== 1100 137 2.763514e+01 2.836265e+01 7.275008e-01 2.632520e-02 5.319500e+01 2.325407e+01 51 37 21524 68 13 10 ┌ 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 0x00007d34aa06e2c0 Total snapshots: 448. Utilization: 0% ╎448 @Base/task.jl:1168 wait_forever() 447╎ 448 @Base/task.jl:1246 wait() ┌ 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 1182 57 2.806738e+01 2.836265e+01 2.952651e-01 1.051987e-02 6.000100e+01 2.064966e+01 6 4 22179 9 5 4 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007eb53cdfc010 Total snapshots: 100. Utilization: 100% ╎86 @Base/client.jl:577 _start() ╎ 86 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 86 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ 86 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ 86 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path::St… ╎ 86 @Base/loading.jl:3063 _include(mapexpr::Function, mod::Module, _pa… ╎ ╎ 86 @Base/loading.jl:3003 include_string(mapexpr::typeof(identity), m… ╎ ╎ 86 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 86 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ ╎ 86 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 86 @Base/loading.jl:3063 _include(mapexpr::Function, mod::Module… ╎ ╎ ╎ 86 @Base/loading.jl:3003 include_string(mapexpr::typeof(identit… ╎ ╎ ╎ 86 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ 86 @Boscia/…oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 86 @Boscia/…oracle.jl:834 #solve#145 ╎ ╎ ╎ 86 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Na… ╎ ╎ ╎ ╎ 86 @Boscia/…rface.jl:270 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 86 @Boscia/…onobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 85 @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:341 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 @Boscia/…le.jl:249 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:47 get ╎ ╎ ╎ ╎ ╎ 1 @MathOptInterface/…:115 throw_if_not_valid ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:32 is_valid ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:550 haskey ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::Dict{SCIP.V… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:46 hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ 82 @Boscia/…node.jl:353 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 82 @Boscia/…ants.jl:138 kwcall(::@NamedTuple{epsilon::… ╎ ╎ ╎ ╎ ╎ 82 @Boscia/…nts.jl:158 #solve_frank_wolfe#6 ╎ ╎ ╎ ╎ ╎ 82 @FrankWolfe/…jl:76 kwcall(::@NamedTuple{line_sear… ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:110 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:49 free_model 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18686 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:16 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:18664 SCIPsolve 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:181 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:211 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:355 active_set_argminmax ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:361 active_set_argminmax(active… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:18 dot ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:406 dot 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:356 dot ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:438 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float64},… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:0 macro expansion ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:467 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 10 @FrankWolfe/…l:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…ks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 9 @Boscia/…s.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 9 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ay.jl:864 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 none:? #sol_values##0 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:479 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:395 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:396 getindex ╎ ╎ ╎ ╎ ╎ ╎ 5 @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:435 _zip_iterate_some ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:433 _zip_iterate_some ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1245 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1245 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ay.jl:1253 _iterate_abst… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:965 getindex ╎ ╎ ╎ ╎ ╎ ╎ 4 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1045 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…op.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 + ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:119 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:45 (::var"#f#build_examples##0… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float64… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 54 @FrankWolfe/…l:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 54 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 38 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 38 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 38 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 38 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 38 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 38 @SCIP/…er.jl:16 macro expansion 38╎ ╎ ╎ ╎ ╎ ╎ ╎ 38 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…mo.jl:118 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…e.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/….jl:234 is_linear_feasible(o::SCIP… ╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/….jl:247 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:394 get(o::SCIP.Optimizer, :… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1345 push! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1348 _push! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1205 _growend! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1181 _growend_internal!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1101 array_new_memory 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:588 GenericMemory ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:395 get(o::SCIP.Optimizer, :… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/set.jl:176 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:714 iterate 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:686 skip_deleted ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:396 get(o::SCIP.Optimizer, :… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 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::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…rt.jl:1123 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…rt.jl:1154 _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…rt.jl:1123 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Base/…rt.jl:1165 _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +5 1 @Base/…rt.jl:852 _sort!(v::Vect… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +6 1 @Base/…ge.jl:925 iterate 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:250 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:251 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:428 get(o::SCIP.Optimizer, :… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:39 is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/set.jl:92 in ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:550 haskey ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::Dict{… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:46 hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…t.jl:49 free_model 9╎ ╎ ╎ ╎ ╎ ╎ 10 @SCIP/…IP.jl:18686 SCIPfreeTransform 1╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:356 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:59 process_FW_callback_logic 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:97 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:374 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:96 active_set_update! ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:110 active_set_update!(active_s… ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:318 find_atom ╎ ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…:504 _unsafe_equal 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:965 getindex ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:411 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…ks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:77 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:893 materialize ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:918 copy ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:946 copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:1005 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:973 preprocess ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:976 preprocess_args ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:974 preprocess ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:967 broadcast_unalias ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1548 unalias ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1585 mightalias ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1608 dataids 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:97 process_FW_callback_logic(t… 1╎ ╎ ╎ ╎ ╎ ╎ 2 @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 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @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 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:483 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…er.jl:16 macro expansion 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:506 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:97 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 2 @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 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1042 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:964 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:381 checkbounds ╎ ╎ ╎ ╎ 1 @Boscia/…onobo.jl:84 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 1 @Base/array.jl:828 collect(itr::Base.Generator{DataS… ╎ ╎ ╎ ╎ 1 @Base/…erator.jl:45 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:399 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:401 iterate(pq::DataStructures.… ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:384 copy 1╎ ╎ ╎ ╎ ╎ 1 @Base/boot.jl:588 GenericMemory ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 28.067379909798163 Dual Gap (relative): 0.010519867424594848 Search Statistics. Total number of nodes processed: 1239 Total number of lmo calls: 22179 Total time (s): 60.016 LMO calls / sec: 369.5514529458811 Nodes / sec: 20.644494801386298 LMO calls / node: 17.900726392251816 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2158 Local tightenings / node: 1.83 Total number of potential local tightenings: 4710 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.900000e-01 6.122449e+00 486 91 64 4885 36 6 [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_33345.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: 28450422 (Pool: 28449733; Big: 689); GC: 22 [39] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/Kl8FO/test/branching_strategy_test.jl:275 ddot_kernel_8.constprop.0 at /opt/julia/bin/../lib/julia/libopenblas64_.so (unknown line) dot_compute at /opt/julia/bin/../lib/julia/libopenblas64_.so (unknown line) dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/blas.jl:356 [inlined] dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/blas.jl:406 [inlined] dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/matmul.jl:18 [inlined] storage_find_argmin_vertex at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/active_set.jl:480 [inlined] #blended_pairwise_conditional_gradient#356 at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:282 unknown function (ip: 0x7eb51e10908a) 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: 0x7eb51e2f7d37) 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: 0x7eb51e2eaed7) 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: 0x7eb51e2d22bd) 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: 0x7eb51e2ca918) 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:3003 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3063 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_42396.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:3003 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3063 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_42396.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_73133.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: 0x7eb556ec1249) 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: 5251656358 (Pool: 5251652479; Big: 3879); GC: 2772 PkgEval terminated after 2723.43s: test duration exceeded the time limit