Package evaluation to test Boscia on Julia 1.14.0-DEV.71 (9f595ebbf8*) started at 2025-11-14T11:58:16.985 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.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.2.1 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.46.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [92933f4c] + ProgressMeter v1.11.0 [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.1+1 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.16.0+0 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.11.4 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.4+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.68.0+1 [3f19e933] + p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 6.17s ################################################################################ # 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... 1506.5 ms ✓ BlockDiagonals 7656.3 ms ✓ ForwardDiff 2370.3 ms ✓ BlockDiagonals → ChainRulesCoreExt 2316.3 ms ✓ ForwardDiff → ForwardDiffStaticArraysExt 81347.2 ms ✓ MathOptInterface 35837.9 ms ✓ FrankWolfe 11437.9 ms ✓ MathOptSetDistances 14502.2 ms ✓ Boscia 8 dependencies successfully precompiled in 158 seconds. 92 already precompiled. Precompilation completed after 170.85s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_h2Ag8p/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_h2Ag8p/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.3 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.2 [336ed68f] CSV v0.10.15 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.2 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.3 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.122 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.5.0 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.15.0 [f6369f11] ForwardDiff v1.3.0 [f55ce6ea] FrankWolfe v0.6.1 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.13.1 [06909019] GraphsFlows v0.1.1 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.20.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.2.1 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.3 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.46.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.36 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [92933f4c] ProgressMeter v1.11.0 [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.7 [91c51154] SentinelArrays v1.4.8 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.8 [4c63d2b9] StatsFuns v1.5.2 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.0 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.1+1 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.12.0+0 [e33a78d0] Hwloc_jll v2.12.2+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+0 [9f9b04fa] LEMON_jll v1.3.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.600.201+0 [68e3532b] Ncurses_jll v6.5.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.2.13+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v900.200.200+0 [e5ac4fe4] SCIP_jll v900.200.200+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.5+1 [1317d2d5] oneTBB_jll v2022.0.0+1 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [1a1011a3] SharedArrays v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.11.4 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0x8d213ec4a65aa00e [ 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 = 0xf9b6a18d15f81fb2 Indicator Tests Heuristics Tests seed = 0x9b692291a789a836 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: Polish solution [ Info: Polish solution Sparse Regression Tests seed = 0xb0fa3f946c12c03e Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.874521e+00 2.913229e+00 3.870787e-02 1.346585e-02 1.883300e+01 1.592949e-01 8157 23 6 9 1 0 3 0 2.913229e+00 2.913229e+00 0.000000e+00 0.000000e+00 2.171100e+01 1.381788e-01 7 5 10 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 5.053452e+00 2.202925e+00 2.850528e+00 0.000000e+00 Inf 1 LD 2 2.913229e+00 2.913229e+00 0.000000e+00 2.060300e+00 9.707325e-01 1 Last 2 2.913229e+00 2.913229e+00 0.000000e+00 2.240813e+00 8.925332e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.913229e+00 2.913229e+00 0.000000e+00 2.245364e+00 8.907243e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 2.913229257518615 Dual Bound: 2.913229257518615 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 15 Total time (s): 25.78 LMO calls / sec: 0.5818463925523661 Nodes / sec: 0.11636927851047323 LMO calls / node: 5.0 Total number of global tightenings: 49 Global tightenings / node: 16.33 Total number of local tightenings: 49 Local tightenings / node: 16.33 Total number of potential local tightenings: 49 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.723858e+00 3.137968e+00 4.141106e-01 1.520309e-01 1.646900e+01 1.821604e-01 7823 145 23 48 9 1 79 10 3.108172e+00 3.137968e+00 2.979610e-02 9.586375e-03 1.954500e+01 4.553594e+00 6 4 572 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 8.960702e+00 -4.403463e-01 9.401049e+00 0.000000e+00 Inf 1 LD 2 3.137968e+00 3.137968e+00 0.000000e+00 1.565786e-01 1.277314e+01 1 Last 2 3.137968e+00 3.137968e+00 0.000000e+00 3.196820e-01 6.256217e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.137968e+00 3.137968e+00 0.000000e+00 3.236629e-01 6.179268e+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: 3.1379682118063537 Dual Bound: 3.108172107624099 Dual Gap (relative): 0.00958637525546512 Search Statistics. Total number of nodes processed: 89 Total number of lmo calls: 577 Total time (s): 21.32 LMO calls / sec: 27.063789868667918 Nodes / sec: 4.174484052532833 LMO calls / node: 6.48314606741573 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Non zero entries: 21th entry: 0.17322891409023866 50th entry: 0.17322891409023866 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.776100e+00 3.137968e+00 3.618683e-01 1.303513e-01 1.770000e-01 1.694915e+01 172 141 23 48 9 1 60 6 3.111821e+00 3.137968e+00 2.614708e-02 8.402502e-03 3.235000e+00 2.040185e+01 33 26 479 14 7 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.960702e+00 -4.403463e-01 9.401049e+00 0.000000e+00 Inf 1 LD 2 3.137968e+00 3.137968e+00 0.000000e+00 1.046489e-03 1.911152e+03 1 Last 2 3.137968e+00 3.137968e+00 0.000000e+00 7.837202e-03 2.551931e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.137968e+00 3.137968e+00 0.000000e+00 3.182275e-02 6.284811e+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.1379682118063537 Dual Bound: 3.111821128702528 Dual Gap (relative): 0.008402501950594932 Search Statistics. Total number of nodes processed: 66 Total number of lmo calls: 484 Total time (s): 3.28 LMO calls / sec: 147.5609756097561 Nodes / sec: 20.121951219512198 LMO calls / node: 7.333333333333333 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Poisson Tests seed = 0x7c8be5bdd7b72247 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 -3.796383e+02 -3.545592e+02 2.507919e+01 7.073344e-02 1.886800e+01 1.589994e-01 10434 146 44 1805 17 2 * 2 3 -3.796383e+02 -3.599470e+02 1.969132e+01 5.470615e-02 2.172800e+01 2.301178e-01 2854 131 82 2127 22 6 24 25 -3.790786e+02 -3.599470e+02 1.913153e+01 5.315097e-02 1.200050e+02 4.083163e-01 3378 113 959 2502 4 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.799031e+02 -7.058674e+02 1.385771e+03 0.000000e+00 Inf 1 LD 2 -3.661802e+02 -4.029927e+02 3.681247e+01 2.674414e-01 7.478273e+00 2 LD 27 -3.707399e+02 -3.879433e+02 1.720339e+01 5.932224e-01 4.551413e+01 3 LD 61 -3.721997e+02 -3.798746e+02 7.674892e+00 6.410471e-01 9.515682e+01 3 LD 97 -3.729594e+02 -3.765979e+02 3.638438e+00 6.928338e-01 1.400047e+02 4 LD 149 -3.732520e+02 -3.749914e+02 1.739394e+00 7.670624e-01 1.942475e+02 5 LD 183 -3.732915e+02 -3.739259e+02 6.344105e-01 8.198434e-01 2.232134e+02 6 LD 258 -3.733054e+02 -3.735049e+02 1.994851e-01 9.278209e-01 2.780709e+02 7 LD 372 -3.733078e+02 -3.733511e+02 4.334668e-02 1.074899e+00 3.460791e+02 8 LD 462 -3.733079e+02 -3.733159e+02 8.051833e-03 1.183231e+00 3.904564e+02 8 LD 588 -3.733079e+02 -3.733107e+02 2.815833e-03 1.403879e+00 4.188397e+02 8 LD 673 -3.733079e+02 -3.733088e+02 8.922199e-04 1.464140e+00 4.596556e+02 8 LD 762 -3.733079e+02 -3.733081e+02 2.015707e-04 1.526622e+00 4.991411e+02 8 LD 862 -3.733079e+02 -3.733080e+02 6.830888e-05 1.600735e+00 5.385027e+02 8 LD 952 -3.733079e+02 -3.733079e+02 3.131772e-05 1.680458e+00 5.665122e+02 8 P 1000 -3.733079e+02 -3.733079e+02 3.131772e-05 1.724879e+00 5.797508e+02 8 LD 1002 -3.733079e+02 -3.733079e+02 1.199043e-05 1.789820e+00 5.598329e+02 8 P 2000 -3.733079e+02 -3.733079e+02 1.199043e-05 2.606626e+00 7.672753e+02 8 P 3000 -3.733079e+02 -3.733079e+02 1.199043e-05 3.319270e+00 9.038133e+02 8 P 4000 -3.733079e+02 -3.733079e+02 1.199043e-05 4.003939e+00 9.990161e+02 8 P 5000 -3.733079e+02 -3.733079e+02 1.199043e-05 4.672937e+00 1.069991e+03 8 P 6000 -3.733079e+02 -3.733079e+02 1.199043e-05 5.368118e+00 1.117710e+03 8 P 7000 -3.733079e+02 -3.733079e+02 1.199043e-05 6.064646e+00 1.154231e+03 8 P 8000 -3.733079e+02 -3.733079e+02 1.199043e-05 6.767364e+00 1.182144e+03 8 P 9000 -3.733079e+02 -3.733079e+02 1.199043e-05 7.464147e+00 1.205764e+03 8 P 10000 -3.733079e+02 -3.733079e+02 1.199043e-05 8.175886e+00 1.223109e+03 8 Last 10001 -3.733079e+02 -3.733079e+02 1.199043e-05 8.180744e+00 1.222505e+03 8 ---------------------------------------------------------------------------------------------------------------- PP 10001 -3.733079e+02 -3.733079e+02 2.154535e-05 8.184209e+00 1.221987e+03 8 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -373.3079039284141 Dual Bound: -379.0785624967536 Dual Gap (relative): 0.015458174090645831 Search Statistics. Total number of nodes processed: 49 Total number of lmo calls: 986 Total time (s): 130.209 LMO calls / sec: 7.572441229100907 Nodes / sec: 0.37631807325146494 LMO calls / node: 20.122448979591837 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.502528e+02 -3.467927e+02 3.460127e+00 9.977507e-03 2.054600e+01 1.460138e-01 8282 132 21 55 6 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.821047e+02 -3.754015e+02 1.932969e+02 0.000000e+00 Inf 1 LD 2 -3.467927e+02 -3.467927e+02 0.000000e+00 1.636851e-01 1.221858e+01 1 Last 2 -3.467927e+02 -3.467927e+02 0.000000e+00 3.389242e-01 5.901024e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -3.467927e+02 -3.467927e+02 0.000000e+00 3.437370e-01 5.818403e+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: -346.7926913536858 Dual Bound: -350.25281803127507 Dual Gap (relative): 0.009977507496143687 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 26 Total time (s): 22.693 LMO calls / sec: 1.145727757458247 Nodes / sec: 0.13219935662979773 LMO calls / node: 8.666666666666666 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.785285e+02 3.393920e+02 1.608635e+02 9.010522e-01 1.665400e+01 1.801369e-01 8186 171 26 58 8 0 100 97 2.818603e+02 3.393920e+02 5.753164e+01 2.041140e-01 3.152500e+01 6.249009e+00 100 63 1475 24 2 0 200 153 3.060127e+02 3.393920e+02 3.337928e+01 1.090781e-01 4.148100e+01 8.509920e+00 94 56 2504 25 2 0 300 119 3.218071e+02 3.393920e+02 1.758486e+01 5.464409e-02 4.670000e+01 8.972163e+00 19 13 3117 2 1 0 * 348 95 3.265185e+02 3.384229e+02 1.190441e+01 3.645861e-02 4.872200e+01 9.174500e+00 19 11 3374 2 2 0 400 63 3.315747e+02 3.384229e+02 6.848211e+00 2.065360e-02 5.020000e+01 9.302789e+00 17 12 3575 2 1 1 439 28 3.351221e+02 3.384229e+02 3.300865e+00 9.849739e-03 5.102400e+01 9.230950e+00 8 6 3687 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.405731e+02 3.262814e+02 1.429167e+01 0.000000e+00 Inf 1 LD 2 3.384229e+02 3.384229e+02 4.828280e-10 1.929500e-01 1.036538e+01 2 Last 2 3.384229e+02 3.384229e+02 4.828280e-10 3.896897e-01 5.132288e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.384229e+02 3.384229e+02 4.828280e-10 3.949572e-01 5.063839e+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: 338.4229295503969 Dual Bound: 335.1220646791376 Dual Gap (relative): 0.009849739003069407 Search Statistics. Total number of nodes processed: 471 Total number of lmo calls: 3692 Total time (s): 53.345 LMO calls / sec: 69.20986034304995 Nodes / sec: 8.829318586559191 LMO calls / node: 7.83864118895966 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.785285e+02 3.393920e+02 1.608635e+02 9.010522e-01 1.862900e+01 1.610392e-01 6873 166 26 58 5 0 100 85 2.849490e+02 3.393920e+02 5.444295e+01 1.910621e-01 8.889300e+01 2.081154e+00 199 98 1385 63 5 1 200 125 3.091666e+02 3.393920e+02 3.022538e+01 9.776405e-02 1.276660e+02 2.545705e+00 82 47 2175 32 2 1 300 93 3.248271e+02 3.393920e+02 1.456492e+01 4.483898e-02 1.449300e+02 2.711654e+00 8 6 2638 0 1 0 * 312 79 3.264967e+02 3.384229e+02 1.192625e+01 3.652795e-02 1.451540e+02 2.707469e+00 22 12 2665 2 2 0 369 26 3.350805e+02 3.384229e+02 3.342419e+00 9.974974e-03 1.470960e+02 2.698918e+00 8 6 2829 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.405731e+02 3.262814e+02 1.429167e+01 0.000000e+00 Inf 1 LD 2 3.384229e+02 3.384229e+02 4.828280e-10 1.638715e-01 1.220468e+01 2 Last 2 3.384229e+02 3.384229e+02 4.828280e-10 3.277066e-01 6.103021e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.384229e+02 3.384229e+02 4.828280e-10 3.323764e-01 6.017274e+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: 338.4229295503969 Dual Bound: 335.0805101897175 Dual Gap (relative): 0.009974973951146767 Search Statistics. Total number of nodes processed: 397 Total number of lmo calls: 2834 Total time (s): 149.327 LMO calls / sec: 18.978483462468276 Nodes / sec: 2.6585948957656687 LMO calls / node: 7.138539042821159 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 = 0x750b299c7be70f57 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.590014e+01 1.051057e+01 2.641071e+01 Inf 1.841800e+01 1.628841e-01 9166 149 45 10001 21 9 100 29 6.361382e+00 1.051057e+01 4.149186e+00 6.522460e-01 3.525700e+01 3.658848e+00 88 35 2422 1907 15 14 147 2 1.046863e+01 1.051057e+01 4.193562e-02 4.005836e-03 3.810700e+01 3.910043e+00 3 2 3174 6 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 10.510568231649371 Dual Bound: 10.468632607181313 Dual Gap (relative): 0.00400583591397515 Search Statistics. Total number of nodes processed: 149 Total number of lmo calls: 3174 Total time (s): 38.935 LMO calls / sec: 81.52048285604212 Nodes / sec: 3.826890972133042 LMO calls / node: 21.302013422818792 Total number of global tightenings: 11 Global tightenings / node: 0.07 Total number of local tightenings: 425 Local tightenings / node: 2.89 Total number of potential local tightenings: 593 Time Limit Test seed = 0xad104aff59f6c0b3 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 -3.155878e+00 -2.441847e+00 7.140309e-01 2.924142e-01 1.460900e+01 2.053529e-01 6554 62 25 522 9 3 * 2 3 -3.155878e+00 -2.462123e+00 6.937554e-01 2.817712e-01 1.463300e+01 3.416934e-01 21 13 32 229 8 0 47 8 -2.479475e+00 -2.462123e+00 1.735243e-02 7.047753e-03 1.628200e+01 3.377963e+00 13 10 656 24 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -2.4621227739887273 Dual Bound: -2.4794752078192515 Dual Gap (relative): 0.007047753269595342 Search Statistics. Total number of nodes processed: 55 Total number of lmo calls: 656 Total time (s): 17.036 LMO calls / sec: 38.506691711669404 Nodes / sec: 3.228457384362526 LMO calls / node: 11.927272727272728 Total number of global tightenings: 6 Global tightenings / node: 0.13 Total number of local tightenings: 54 Local tightenings / node: 1.15 Total number of potential local tightenings: 58 Strong Convexity and Sharpness Tests seed = 0x1306058192a2033c Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 0 2.214859e+02 2.214859e+02 0.000000e+00 0.000000e+00 1.374000e+01 7.278020e-02 5796 0 6 4 1 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 221.48590058699236 Dual Bound: 221.48590058699236 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 6 Total time (s): 14.627 LMO calls / sec: 0.41020031448690775 Nodes / sec: 0.06836671908115129 LMO calls / node: 6.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 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.943078e+02 1.943880e+02 8.017520e-02 4.126196e-04 1.668500e+01 1.798022e-01 7463 0 13 15 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 194.38795362264952 Dual Bound: 194.30777842745613 Dual Gap (relative): 0.0004126195865253223 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 17.553 LMO calls / sec: 0.7406141400330427 Nodes / sec: 0.17091095539224063 LMO calls / node: 4.333333333333333 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: 17 Branching Strategy Tests seed = 0xbc5ea1faa29d70bf 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.738700e+01 1.725427e-01 8501 54 48 3749 20 5 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.909400e+01 3.404211e+00 16 11 953 27 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321771298479149 Dual Gap (relative): 0.008253858173238702 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 953 Total time (s): 19.996 LMO calls / sec: 47.65953190638128 Nodes / sec: 3.2506501300260053 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 233 49 48 3749 1 2 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 2.015000e+00 4.317618e+01 6 4 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.017 LMO calls / sec: 503.22260783341596 Nodes / sec: 43.133366385721374 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.700000e-01 8.108108e+00 226 47 48 3749 20 5 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.711000e+00 3.448276e+01 3 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.712 LMO calls / sec: 501.75233644859816 Nodes / sec: 34.46261682242991 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.830000e-01 7.832898e+00 227 47 48 3749 4 2 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.874000e+00 4.002134e+01 13 9 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.876 LMO calls / sec: 480.81023454157787 Nodes / sec: 39.978678038379535 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.900000e-01 7.692308e+00 276 46 48 3749 4 2 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 2.268000e+00 4.276896e+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.269 LMO calls / sec: 517.4085500220361 Nodes / sec: 42.75011018069634 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.650000e-01 6.451613e+00 461 76 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.080000e-01 1.113861e+01 101 45 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.720000e-01 1.131687e+01 161 53 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.239000e+00 2.175560e+01 98 44 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.884000e+00 2.195467e+01 74 34 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.633600e+01 2.454701e+01 58 30 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.312900e+01 2.581175e+01 59 27 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.987700e+01 2.654216e+01 60 30 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.552900e+01 2.721720e+01 22 14 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 4.130900e+01 2.757268e+01 62 28 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.602300e+01 2.766008e+01 17 11 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.996000e+01 2.740192e+01 8 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 5.290200e+01 2.693660e+01 10 7 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.529200e+01 2.660421e+01 32 15 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.747200e+01 2.601267e+01 10 7 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.915600e+01 2.554263e+01 14 10 25388 20 10 1 1251 266 2.723581e+01 2.836265e+01 1.126834e+00 4.137325e-02 6.000200e+01 2.528249e+01 3 2 25865 1 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.23581097573112 Dual Gap (relative): 0.04137325121979805 Search Statistics. Total number of nodes processed: 1517 Total number of lmo calls: 25865 Total time (s): 60.004 LMO calls / sec: 431.05459636024267 Nodes / sec: 25.281647890140658 LMO calls / node: 17.050098879367173 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2329 Local tightenings / node: 1.86 Total number of potential local tightenings: 5079 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.210000e+00 1.357466e+00 479 82 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.544000e+00 3.537736e+00 96 43 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.685000e+00 4.096834e+00 138 54 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.053300e+01 1.908288e+01 89 38 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.115100e+01 1.946014e+01 69 30 3485 420 10 10 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.788900e+01 2.219241e+01 92 34 6038 662 16 7 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.324900e+01 2.413007e+01 50 25 8396 223 5 6 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.854800e+01 2.497548e+01 26 15 10594 67 10 19 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.304500e+01 2.569224e+01 52 27 12514 245 1 0 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.733900e+01 2.643349e+01 27 16 14423 73 2 2 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 4.104100e+01 2.692430e+01 10 7 16134 16 8 7 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.498200e+01 2.714419e+01 7 5 17857 8 5 1 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.834200e+01 2.720202e+01 12 8 19379 12 5 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 5.108800e+01 2.746242e+01 15 10 20802 22 9 5 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 5.346100e+01 2.732833e+01 10 7 22010 10 5 1 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 5.510900e+01 2.756356e+01 9 6 23131 12 9 5 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.688200e+01 2.772406e+01 13 9 24076 18 5 4 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.848800e+01 2.771509e+01 14 9 24995 22 9 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.994200e+01 2.767675e+01 14 9 25874 36 9 12 1504 157 2.767346e+01 2.836265e+01 6.891900e-01 2.490437e-02 6.000200e+01 2.768241e+01 19 10 25906 64 8 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.673455065242916 Dual Gap (relative): 0.024904369856862004 Search Statistics. Total number of nodes processed: 1661 Total number of lmo calls: 25906 Total time (s): 60.003 LMO calls / sec: 431.74507941269604 Nodes / sec: 27.68194923587154 LMO calls / node: 15.596628537025888 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2185 Local tightenings / node: 1.45 Total number of potential local tightenings: 5400 Number of alternative decisions: 438 Number of stable decisions: 392 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.330000e-01 5.628518e+00 471 70 64 4885 36 6 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.294000e+00 1.004637e+01 104 41 256 696 19 22 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.504000e+00 1.983395e+01 69 30 2096 346 11 15 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 9.437000e+00 2.129914e+01 83 41 3186 412 13 6 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.673500e+01 2.396176e+01 83 41 6017 417 2 1 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.303400e+01 2.583138e+01 66 39 8679 179 9 3 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.853600e+01 2.680824e+01 19 12 11070 27 9 3 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.361400e+01 2.769679e+01 71 35 13344 339 17 8 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.823300e+01 2.827400e+01 53 21 15506 341 8 3 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 4.267200e+01 2.833240e+01 55 30 17444 229 10 6 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.674100e+01 2.856165e+01 7 5 19379 9 7 6 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.970000e+01 2.907445e+01 48 24 21026 246 8 7 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 5.227600e+01 2.943990e+01 51 30 22661 137 4 3 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.469100e+01 2.974895e+01 7 4 24161 6 4 6 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.690900e+01 2.964382e+01 12 8 25390 20 6 3 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.883400e+01 2.976170e+01 27 13 26657 170 13 4 1391 400 2.616994e+01 2.836265e+01 2.192704e+00 8.378711e-02 6.000200e+01 2.984901e+01 17 9 27655 62 9 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.169941284716117 Dual Gap (relative): 0.08378710967798203 Search Statistics. Total number of nodes processed: 1791 Total number of lmo calls: 27655 Total time (s): 60.003 LMO calls / sec: 460.8936219855674 Nodes / sec: 29.84850757462127 LMO calls / node: 15.44109436069235 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2430 Local tightenings / node: 1.75 Total number of potential local tightenings: 5853 Number of alternative decisions: 543 Number of stable decisions: 352 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.180000e-01 5.791506e+00 462 68 64 4885 2 2 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.410000e+00 1.701245e+01 78 31 678 489 23 5 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.027000e+00 2.081269e+01 59 31 968 257 17 12 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.725000e+00 2.601942e+01 13 7 2918 60 2 4 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.227300e+01 3.120671e+01 32 16 5197 153 21 2 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.665700e+01 3.403974e+01 26 15 7469 83 5 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.099000e+01 3.501667e+01 25 13 9610 131 7 3 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.550900e+01 3.579129e+01 39 19 11880 193 7 5 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.992400e+01 3.579067e+01 36 21 13971 113 6 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.393400e+01 3.604055e+01 21 13 15981 55 3 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.709900e+01 3.646999e+01 38 21 17719 139 13 1 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 4.072500e+01 3.616943e+01 10 6 19510 37 9 3 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.408600e+01 3.622465e+01 76 30 21254 396 7 4 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.691500e+01 3.612917e+01 8 5 22747 24 8 3 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.925000e+01 3.591878e+01 6 4 24101 6 4 1 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 5.139600e+01 3.558643e+01 17 11 25317 23 11 5 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.327900e+01 3.500441e+01 7 5 26374 10 5 1 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.497000e+01 3.443697e+01 10 7 27346 16 8 1 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.641300e+01 3.380426e+01 20 12 28188 61 3 1 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.779100e+01 3.324047e+01 7 4 29039 10 7 8 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.890200e+01 3.274931e+01 7 5 29805 14 8 2 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.961900e+01 3.238900e+01 6 4 30260 6 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.106101931570876 Dual Gap (relative): 0.009127665389483692 Search Statistics. Total number of nodes processed: 1931 Total number of lmo calls: 30260 Total time (s): 59.62 LMO calls / sec: 507.5478027507548 Nodes / sec: 32.38846024823885 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.700000e-01 6.382979e+00 467 75 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.900000e-01 1.139241e+01 91 40 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.270000e-01 1.186624e+01 134 50 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.020000e+00 2.228381e+01 91 40 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.649000e+00 2.248938e+01 75 34 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.595500e+01 2.513319e+01 54 28 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.264000e+01 2.636926e+01 56 25 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.929700e+01 2.706762e+01 61 31 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.496700e+01 2.765465e+01 22 13 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 4.065000e+01 2.801968e+01 61 28 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.548500e+01 2.798725e+01 16 10 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.916900e+01 2.784275e+01 7 5 20396 14 8 12 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 5.202600e+01 2.742859e+01 59 25 21910 381 1 1 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 5.439400e+01 2.704342e+01 11 7 23162 19 11 10 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 5.632600e+01 2.661293e+01 35 19 24363 145 12 7 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 5.784900e+01 2.618887e+01 11 7 25359 25 10 8 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 5.923600e+01 2.577824e+01 35 18 26283 172 9 5 1357 176 2.766769e+01 2.836265e+01 6.949554e-01 2.511794e-02 6.000200e+01 2.554915e+01 2 2 26745 1 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.667689675109138 Dual Gap (relative): 0.025117939316814223 Search Statistics. Total number of nodes processed: 1533 Total number of lmo calls: 26745 Total time (s): 60.004 LMO calls / sec: 445.7202853143124 Nodes / sec: 25.548296780214653 LMO calls / node: 17.44618395303327 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2368 Local tightenings / node: 1.75 Total number of potential local tightenings: 5131 Number of alternative decisions: 717 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.520000e-01 6.637168e+00 449 71 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.740000e-01 1.162791e+01 90 39 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.120000e-01 1.206140e+01 136 51 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.059000e+00 2.218788e+01 89 41 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.653000e+00 2.248006e+01 67 31 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.572200e+01 2.550566e+01 57 31 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.207100e+01 2.704907e+01 53 23 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.838100e+01 2.794123e+01 58 28 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.388000e+01 2.854191e+01 22 14 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.966900e+01 2.871260e+01 64 30 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.435000e+01 2.870349e+01 15 10 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.807700e+01 2.847515e+01 8 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 5.109200e+01 2.789086e+01 10 6 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.352100e+01 2.748454e+01 33 16 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.575400e+01 2.681422e+01 15 10 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.748000e+01 2.628740e+01 14 9 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.896500e+01 2.572713e+01 17 11 26318 33 12 12 1377 148 2.778809e+01 2.836265e+01 5.745509e-01 2.067616e-02 6.000100e+01 2.541624e+01 10 7 26941 15 1 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.78809408417196 Dual Gap (relative): 0.020676155028576795 Search Statistics. Total number of nodes processed: 1525 Total number of lmo calls: 26941 Total time (s): 60.002 LMO calls / sec: 449.0016999433352 Nodes / sec: 25.415819472684245 LMO calls / node: 17.66622950819672 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2385 Local tightenings / node: 1.73 Total number of potential local tightenings: 5153 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.417000e+00 8.779631e-01 455 78 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 3.744000e+00 2.403846e+00 94 43 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 3.883000e+00 2.832861e+00 137 53 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.230200e+01 1.633881e+01 99 46 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.296300e+01 1.673995e+01 68 30 3485 420 10 10 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 1.964800e+01 2.030741e+01 77 34 6090 444 9 4 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.591300e+01 2.257554e+01 51 26 8720 225 8 5 400 347 2.074745e+01 2.836265e+01 7.615193e+00 3.670423e-01 3.148900e+01 2.372257e+01 67 30 11144 379 18 5 500 399 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 3.613800e+01 2.487686e+01 12 7 13355 21 11 7 600 411 2.367246e+01 2.836265e+01 4.690187e+00 1.981284e-01 3.983200e+01 2.538160e+01 52 22 15250 331 10 3 700 407 2.449500e+01 2.836265e+01 3.867641e+00 1.578951e-01 4.324200e+01 2.560011e+01 62 28 17024 329 12 3 800 363 2.539631e+01 2.836265e+01 2.966336e+00 1.168019e-01 4.566300e+01 2.546920e+01 17 10 18354 67 15 10 900 301 2.616952e+01 2.836265e+01 2.193126e+00 8.380461e-02 4.769900e+01 2.517872e+01 10 6 19533 32 11 9 1000 225 2.691767e+01 2.836265e+01 1.444975e+00 5.368128e-02 4.948500e+01 2.475498e+01 6 4 20674 8 4 4 1100 137 2.763514e+01 2.836265e+01 7.275008e-01 2.632520e-02 5.059300e+01 2.445002e+01 17 9 21524 68 13 10 1187 52 2.808687e+01 2.836265e+01 2.757701e-01 9.818469e-03 5.153500e+01 2.404191e+01 6 4 22214 14 10 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.0868749251736 Dual Gap (relative): 0.009818468625151686 Search Statistics. Total number of nodes processed: 1239 Total number of lmo calls: 22214 Total time (s): 51.536 LMO calls / sec: 431.038497361068 Nodes / sec: 24.04144675566594 LMO calls / node: 17.92897497982244 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2160 Local tightenings / node: 1.82 Total number of potential local tightenings: 4714 Decisions made: [(62, 1), (516, 0), (40, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.520000e-01 6.637168e+00 449 71 64 4885 36 6 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 9.760000e-01 9.221311e+00 158 47 192 1340 13 25 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 8.731000e+00 2.302142e+01 45 24 3219 200 6 6 * 118 119 1.406031e+01 2.836265e+01 1.430233e+01 1.017213e+00 9.885000e+00 2.397572e+01 37 18 3726 178 10 12 200 199 1.704058e+01 2.836265e+01 1.132207e+01 6.644180e-01 1.571900e+01 2.538329e+01 61 33 6070 226 3 0 300 287 1.921318e+01 2.836265e+01 9.149468e+00 4.762080e-01 2.217600e+01 2.647006e+01 59 30 8686 275 8 3 400 359 2.087523e+01 2.836265e+01 7.487411e+00 3.586743e-01 2.773000e+01 2.737108e+01 44 25 11090 152 12 0 500 397 2.261057e+01 2.836265e+01 5.752072e+00 2.543975e-01 3.266000e+01 2.746479e+01 77 21 13255 124 12 8 600 411 2.379062e+01 2.836265e+01 4.572023e+00 1.921775e-01 3.672300e+01 2.753043e+01 24 13 15181 90 13 10 700 393 2.462769e+01 2.836265e+01 3.734957e+00 1.516568e-01 3.997200e+01 2.734414e+01 8 5 16798 8 6 12 800 359 2.546045e+01 2.836265e+01 2.902200e+00 1.139886e-01 4.277200e+01 2.709717e+01 15 10 18259 20 8 10 ====================================================================================== 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 51 running 1 of 1 signal (10): User defined signal 1 _ZN6soplex10SoPlexBaseIdE10Statistics16clearSolvingDataEv at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) unknown function (ip: 0x22ec337f) at (unknown file) unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 900 299 2.628929e+01 2.836265e+01 2.073352e+00 7.886678e-02 4.556000e+01 2.631694e+01 48 25 19506 212 13 1 1000 217 2.696789e+01 2.836265e+01 1.394758e+00 5.171920e-02 4.738600e+01 2.568269e+01 8 5 20487 10 7 4 1100 135 2.755469e+01 2.836265e+01 8.079536e-01 2.932182e-02 5.315000e+01 2.323612e+01 11 7 21358 19 9 4 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 jfptr_wait_7463.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke92697.1 at /opt/julia/lib/julia/sys.so (unknown line) j_wait_67388.1 at /opt/julia/lib/julia/sys.so (unknown line) wait_forever at ./task.jl:1168 jfptr_wait_forever_67387.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 ============================================================== 1199 40 2.811400e+01 2.836265e+01 2.486474e-01 8.844257e-03 5.666700e+01 2.186458e+01 16 13 22136 6 4 1 ┌ 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 0x00007028c8804d30 Total snapshots: 289. Utilization: 0% ╎289 @Base/task.jl:1168 wait_forever() 288╎ 289 @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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007e9bd75fc010 Total snapshots: 215. Utilization: 100% ╎192 @Base/client.jl:577 _start() ╎ 192 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 192 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ 192 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ 192 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path::St… ╎ 192 @Base/loading.jl:3054 _include(mapexpr::Function, mod::Module, _pa… ╎ ╎ 192 @Base/loading.jl:2994 include_string(mapexpr::typeof(identity), m… ╎ ╎ 192 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 192 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ ╎ 192 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 192 @Base/loading.jl:3054 _include(mapexpr::Function, mod::Module… ╎ ╎ ╎ 192 @Base/loading.jl:2994 include_string(mapexpr::typeof(identit… ╎ ╎ ╎ 192 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ 192 @Boscia/…oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 192 @Boscia/…oracle.jl:834 #solve#145 ╎ ╎ ╎ 192 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Na… ╎ ╎ ╎ ╎ 192 @Boscia/…rface.jl:270 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 192 @Boscia/…onobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 189 @Boscia/…onobo.jl:35 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 15 @Boscia/…node.jl:325 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 15 @Boscia/…ties.jl:30 check_feasibility ╎ ╎ ╎ ╎ ╎ 15 @Boscia/…cle.jl:474 check_feasibility(lmo::FrankWo… ╎ ╎ ╎ ╎ ╎ 15 @SCIP/…apper.jl:427 optimize!(o::SCIP.Optimizer) ╎ ╎ ╎ ╎ ╎ 15 @SCIP/…apper.jl:16 macro expansion 15╎ ╎ ╎ ╎ ╎ 15 @SCIP/…CIP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ 4 @Boscia/…node.jl:341 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 4 @Boscia/…blem.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…cle.jl:229 is_linear_feasible 1╎ ╎ ╎ ╎ ╎ 4 @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:39 is_valid ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/set.jl:92 in ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:550 haskey ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:250 ht_keyindex(h::Dict{SCIP.… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:395 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:253 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:254 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…xt.jl:56 get_tol ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…pper.jl:224 get ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ata.jl:139 get_parameter(scipd::SCIP.S… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…per.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:14661 SCIPgetRealParam ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:350 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 1 @Dates/…sions.jl:70 now() 1╎ ╎ ╎ ╎ ╎ 1 @Base/libc.jl:223 TmStruct ╎ ╎ ╎ ╎ 169 @Boscia/…node.jl:353 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 169 @Boscia/…ants.jl:138 kwcall(::@NamedTuple{epsilon::… ╎ ╎ ╎ ╎ ╎ 169 @Boscia/…nts.jl:158 #solve_frank_wolfe#6 2╎ ╎ ╎ ╎ ╎ 169 @FrankWolfe/…jl:76 kwcall(::@NamedTuple{line_sear… 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:0 blended_pairwise_conditional_gr… ╎ ╎ ╎ ╎ ╎ 7 @FrankWolfe/…l:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 7 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 5 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 5 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 5 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:420 optimize!(o::SCIP.Optimiz… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:400 _set_start_values(o::SCI… ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…er.jl:16 macro expansion 4╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:49 free_model 2╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:18686 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:206 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1045 dot(x::Vector{Float64}, … 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 7 @FrankWolfe/…l:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:438 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1045 dot(x::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1046 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 5 @FrankWolfe/…l:467 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1045 dot(x::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1046 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ls.jl:965 getindex 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:492 + 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1050 dot(x::Vector{Float64},… 2╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:245 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 14 @FrankWolfe/…l:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 14 @Boscia/…ks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 14 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…s.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:833 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:701 _array_for ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:876 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:409 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:877 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:669 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:661 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:648 Array 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:588 GenericMemory ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…ay.jl:864 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:45 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1245 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1253 _iterate_abstracta… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:965 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 none:? #sol_values##0 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 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 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:890 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1020 setindex! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1025 _setindex! ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 6 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 6 @LinearAlgebra/…:1045 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:965 getindex 5╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:119 process_FW_callback_logic(t… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:45 (::var"#f#build_examples##0… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:120 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:266 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:186 active_set_update_pairwise!(… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:219 active_set_update_iterate_p… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:901 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:904 materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:946 copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:993 copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:994 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:615 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:619 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:670 _broadcast_getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:694 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:695 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:670 _broadcast_getind… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:694 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:670 _broadcast_geti… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:694 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…st.jl:695 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…st.jl:664 _broadcast_get… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…ls.jl:964 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +5 1 @Base/…ls.jl:381 checkbounds ╎ ╎ ╎ ╎ ╎ 109 @FrankWolfe/…l:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 109 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 90 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 90 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 90 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 90 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 90 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 90 @SCIP/…er.jl:16 macro expansion 89╎ ╎ ╎ ╎ ╎ ╎ ╎ 90 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ 9 @Boscia/…mo.jl:118 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 9 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 9 @Boscia/…e.jl:229 is_linear_feasible 4╎ ╎ ╎ ╎ ╎ ╎ 9 @Boscia/….jl:234 is_linear_feasible(o::SCIP… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:247 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 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:1372 _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…rt.jl:1448 _issorted ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ge.jl:5 Colon ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…ge.jl:417 UnitRange ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Base/…ge.jl:428 unitrange_last ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +5 1 @Base/…rs.jl:479 >= 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +6 1 @Base/int.jl:560 <= ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:249 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:47 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @MathOptInterface/…:115 throw_if_not_val… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:39 is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/set.jl:92 in ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:550 haskey 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:238 ht_keyindex(h::Dict… 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:253 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:254 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:56 get_tol ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:224 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:114 get_parameter(scipd::S… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:14618 SCIPgetParam ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 10 @Boscia/…t.jl:49 free_model 10╎ ╎ ╎ ╎ ╎ ╎ 10 @SCIP/…IP.jl:18686 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:327 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:453 perform_line_search(line_sea… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:52 (::var"#grad!#build_examples… 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:340 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 5 @FrankWolfe/…l:356 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…ks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…ks.jl:59 process_FW_callback_logic 1╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…s.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:828 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:? #sol_values##0 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ 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:45 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1245 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1253 _iterate_abstracta… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:965 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:118 process_FW_callback_logic(t… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:144 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╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…als.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╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…ks.jl:97 process_FW_callback_logic(t… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:584 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ 13 @FrankWolfe/…l:483 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 13 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 12 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 12 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 10 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 10 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 10 @SCIP/…er.jl:16 macro expansion 10╎ ╎ ╎ ╎ ╎ ╎ ╎ 10 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:364 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:893 materialize ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:918 copy ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:946 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:993 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:994 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:615 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:619 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:671 _broadcast_getind… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:698 _broadcast_getin… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ts.jl:92 get(o::SCIP.Opti… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:227 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:228 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:876 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:409 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:877 similar ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:669 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:661 Array ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:648 Array 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:588 GenericMemory ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:130 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/…onobo.jl:48 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 2 @Boscia/…acks.jl:232 callback ╎ ╎ ╎ ╎ 2 @Boscia/…acks.jl:295 (::Boscia.var"#callback#build_… ╎ ╎ ╎ ╎ ╎ 2 @Base/array.jl:838 collect(itr::Base.Generator{Dat… ╎ ╎ ╎ ╎ ╎ 2 @Base/array.jl:864 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ 2 @Base/array.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ 2 @Base/…ator.jl:45 iterate ╎ ╎ ╎ ╎ ╎ 2 @DataStructures/…:410 iterate ╎ ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:316 dequeue_pair!(pq::DataS… ╎ ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:140 percolate_down!(pq::Da… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:358 setindex!(h::Dict{Int64, I… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:276 ht_keyindex2_shorthash!(h… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:130 hashindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:87 + ╎ ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:318 dequeue_pair!(pq::DataS… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:679 delete!(h::Dict{Int64, Int… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:639 _delete! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ry.jl:270 setindex! 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ry.jl:262 _setindex! ╎ ╎ ╎ ╎ 1 @Boscia/…onobo.jl:97 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:232 callback ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:295 (::Boscia.var"#callback#build_… ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:838 collect(itr::Base.Generator{Dat… ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:864 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ 1 @Base/…ator.jl:45 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:410 iterate ╎ ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:316 dequeue_pair!(pq::DataS… ╎ ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:131 percolate_down!(pq::Da… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:118 lt 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…le.jl:623 isless Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.113997603576518 Dual Gap (relative): 0.008844257061358888 Search Statistics. Total number of nodes processed: 1239 Total number of lmo calls: 22136 Total time (s): 63.039 LMO calls / sec: 351.1477022160884 Nodes / sec: 19.654499595488506 LMO calls / node: 17.866020984665052 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2101 Local tightenings / node: 1.75 Total number of potential local tightenings: 4676 Decisions made: [(70, 0), (526, 0), (23, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.590000e-01 6.535948e+00 454 75 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 jfptr_wait_7463.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke92697.1 at /opt/julia/lib/julia/sys.so (unknown line) j_wait_67388.1 at /opt/julia/lib/julia/sys.so (unknown line) wait_forever at ./task.jl:1168 jfptr_wait_forever_67387.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: 40658312 (Pool: 40657644; Big: 668); GC: 24 [51] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/Kl8FO/test/branching_strategy_test.jl:275 ht_keyindex at ./dict.jl:243 getindex at ./dict.jl:478 [inlined] var at /home/pkgeval/.julia/packages/SCIP/4grSV/src/scip_data.jl:181 [inlined] var at /home/pkgeval/.julia/packages/SCIP/4grSV/src/MOI_wrapper.jl:128 [inlined] #sol_values##0 at ./none (unknown line) [inlined] iterate at ./generator.jl:48 [inlined] collect at ./array.jl:828 [inlined] sol_values at /home/pkgeval/.julia/packages/SCIP/4grSV/src/convenience.jl:25 [inlined] find_best_solution at /home/pkgeval/.julia/packages/Boscia/Kl8FO/ext/BosciaSCIPExt.jl:28 unknown function (ip: 0x7e9bb5d0a072) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 find_best_solution at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/MOI_bounded_oracle.jl:591 unknown function (ip: 0x7e9bb5d09331) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #process_FW_callback_logic#36 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/callbacks.jl:97 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/callbacks.jl:59 [inlined] #32 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/callbacks.jl:24 unknown function (ip: 0x7e9bb5d1a436) 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#356 at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:261 unknown function (ip: 0x7e9bb61f877a) 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: 0x7e9bb61ed637) 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: 0x7e9bb61d5e47) 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: 0x7e9bb61c847d) 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: 0x7e9bb61c0288) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_8983.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke93412.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_56866.1 at /opt/julia/lib/julia/sys.so (unknown line) include_string at ./loading.jl:2994 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3054 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke92563.1 at /opt/julia/lib/julia/sys.so (unknown line) include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_76314.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_8983.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke93412.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_56866.1 at /opt/julia/lib/julia/sys.so (unknown line) include_string at ./loading.jl:2994 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3054 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke92563.1 at /opt/julia/lib/julia/sys.so (unknown line) include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_76314.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_8983.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke93429.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_56806.1 at /opt/julia/lib/julia/sys.so (unknown line) exec_options at ./client.jl:310 jfptr_exec_options_56790.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke92819.1 at /opt/julia/lib/julia/sys.so (unknown line) j_exec_options_65502.1 at /opt/julia/lib/julia/sys.so (unknown line) _start at ./client.jl:577 jfptr__start_65499.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: 0x7e9bf1a78249) 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: 5183124764 (Pool: 5183120857; Big: 3907); GC: 2560 PkgEval terminated after 2727.8s: test duration exceeded the time limit