Package evaluation of Boscia on Julia 1.13.0-DEV.888 (0e1aa6c7eb*) started at 2025-07-22T18:43:19.576 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 7.2s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [36b166db] + Boscia v0.1.39 Updating `~/.julia/environments/v1.13/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.0 ⌅ [0a1fb500] + BlockDiagonals v0.1.42 [f7b14807] + Bonobo v0.1.3 [36b166db] + Boscia v0.1.39 [d360d2e6] + ChainRulesCore v1.25.2 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.17.0 [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.13.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v1.0.1 [f55ce6ea] + FrankWolfe v0.5.5 [c145ed77] + GenericSchur v0.5.5 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.42.0 [3b969827] + MathOptSetDistances v0.2.11 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [92933f4c] + ProgressMeter v1.10.4 [dc4f5ac2] + ProximalCore v0.1.2 [708f8203] + Richardson v1.4.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.14 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.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 v0.6.4 [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 v0.7.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.14.1+1 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.7.15 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.5.1+0 [efcefdf7] + PCRE2_jll v10.45.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.65.0+0 [3f19e933] + p7zip_jll v17.5.0+2 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 3.6s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 87.59s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_FPcOEg/Project.toml` [4c88cf16] Aqua v0.8.13 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 [864edb3b] DataStructures v0.18.22 [31c24e10] Distributions v0.25.120 [497a8b3b] DoubleFloats v1.4.3 [f55ce6ea] FrankWolfe v0.5.5 [87dc4568] HiGHS v1.18.2 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.42.0 [3b969827] MathOptSetDistances v0.2.11 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.3 [10745b16] Statistics v1.11.1 [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_FPcOEg/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.13 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 [d360d2e6] ChainRulesCore v1.25.2 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.17.0 [187b0558] ConstructionBase v1.6.0 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.4.3 [e2ba6199] ExprTools v0.1.10 [1a297f60] FillArrays v1.13.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v1.0.1 [f55ce6ea] FrankWolfe v0.5.5 [14197337] GenericLinearAlgebra v0.3.18 [c145ed77] GenericSchur v0.5.5 [87dc4568] HiGHS v1.18.2 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.42.0 [3b969827] MathOptSetDistances v0.2.11 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [92933f4c] ProgressMeter v1.10.4 [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 [708f8203] Richardson v1.4.2 [79098fc4] Rmath v0.8.0 [82193955] SCIP v0.12.7 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.1 [276daf66] SpecialFunctions v2.5.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.14 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.5 [4c63d2b9] StatsFuns v1.5.0 [856f2bd8] StructTypes v1.11.0 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [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.11.0+1 [e33a78d0] Hwloc_jll v2.12.1+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+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 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [1317d2d5] oneTBB_jll v2022.0.0+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [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 v0.7.0 [9e88b42a] Serialization 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.14.1+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.7.15 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.1+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... seed = 0x90c13ef9e0b75c1b [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x1fc1cefe41a528ab seed = 0x572bce7c8516c29c seed = 0x49d6601ac1cea688 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.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 3.156018e+00 3.321889e+00 1.658708e-01 5.255698e-02 1.681900e+01 1.783697e-01 6776 56 14 15 3 1 19 6 3.295724e+00 3.321889e+00 2.616511e-02 7.939108e-03 2.051500e+01 1.218621e+00 7 5 88 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.194453e+00 1.088433e-01 8.085610e+00 0.000000e+00 Inf 1 LD 3 3.422673e+00 3.312206e+00 1.104674e-01 2.133876e+00 1.405893e+00 2 LD 5 3.321889e+00 3.321889e+00 0.000000e+00 2.301054e+00 2.172918e+00 1 Last 5 3.321889e+00 3.321889e+00 0.000000e+00 2.309337e+00 2.165124e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.321889e+00 3.321889e+00 0.000000e+00 2.313696e+00 2.161044e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.3218888556971837 Dual Bound: 3.295723747673439 Dual Gap (relative): 0.007939108380129145 Search Statistics. Total number of nodes processed: 25 Total number of lmo calls: 94 Total time (s): 24.417 LMO calls / sec: 3.8497767948560426 Nodes / sec: 1.0238768071425646 LMO calls / node: 3.76 Total number of global tightenings: 42 Global tightenings / node: 2.21 Total number of local tightenings: 48 Local tightenings / node: 2.53 Total number of potential local tightenings: 48 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 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.057359e+00 2.979599e+00 9.222398e-01 4.482639e-01 1.515800e+01 1.979153e-01 7099 250 37 80 20 1 100 47 2.634067e+00 2.979599e+00 3.455322e-01 1.311782e-01 2.296000e+01 6.402439e+00 34 25 1112 24 9 0 200 47 2.773466e+00 2.979599e+00 2.061332e-01 7.432331e-02 2.579000e+01 9.577356e+00 25 18 1560 19 13 1 300 47 2.844618e+00 2.979599e+00 1.349809e-01 4.745132e-02 2.834000e+01 1.224418e+01 33 25 1992 26 9 1 400 45 2.901121e+00 2.979599e+00 7.847855e-02 2.705112e-02 3.098700e+01 1.436086e+01 50 37 2435 28 9 0 500 43 2.938886e+00 2.979599e+00 4.071322e-02 1.385328e-02 3.349900e+01 1.620944e+01 38 28 2891 27 12 4 529 42 2.950476e+00 2.979599e+00 2.912302e-02 9.870618e-03 3.423600e+01 1.667835e+01 8 6 3022 0 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.079615e+00 -8.025708e-01 9.882186e+00 0.000000e+00 Inf 1 LD 3 3.216692e+00 2.949450e+00 2.672423e-01 2.724287e-01 1.101206e+01 2 LD 5 2.979599e+00 2.979599e+00 0.000000e+00 4.445112e-01 1.124831e+01 1 Last 5 2.979599e+00 2.979599e+00 0.000000e+00 4.520035e-01 1.106186e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.979599e+00 2.979599e+00 0.000000e+00 4.559430e-01 1.096628e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.9795990977146904 Dual Bound: 2.950476076055043 Dual Gap (relative): 0.009870617794870178 Search Statistics. Total number of nodes processed: 571 Total number of lmo calls: 3028 Total time (s): 36.379 LMO calls / sec: 83.23483328293797 Nodes / sec: 15.695868495560626 LMO calls / node: 5.302977232924693 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: 1 Non zero entries: 14th entry: 0.1791864123601242 48th entry: 0.1791864123601242 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.0 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.187793e+00 2.979599e+00 7.918060e-01 3.619199e-01 3.060000e-01 9.803922e+00 303 250 37 80 20 1 100 23 2.750105e+00 2.979599e+00 2.294940e-01 8.344917e-02 8.086000e+00 1.521148e+01 22 16 1160 17 11 1 200 22 2.918792e+00 2.979599e+00 6.080752e-02 2.083312e-02 1.178900e+01 1.883111e+01 25 19 1818 22 9 0 230 22 2.950136e+00 2.979599e+00 2.946307e-02 9.987021e-03 1.299700e+01 1.938909e+01 33 24 2022 29 11 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.079615e+00 -8.025708e-01 9.882186e+00 0.000000e+00 Inf 1 LD 3 3.216692e+00 2.949450e+00 2.672423e-01 1.424926e-03 2.105372e+03 2 LD 5 2.979599e+00 2.979599e+00 0.000000e+00 5.496499e-03 9.096700e+02 1 Last 5 2.979599e+00 2.979599e+00 0.000000e+00 1.263081e-02 3.958574e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.979599e+00 2.979599e+00 0.000000e+00 1.696261e-02 2.947659e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.9795990977146904 Dual Bound: 2.9501360275331425 Dual Gap (relative): 0.009987020905671417 Search Statistics. Total number of nodes processed: 252 Total number of lmo calls: 2028 Total time (s): 13.027 LMO calls / sec: 155.67667152836418 Nodes / sec: 19.344438473938744 LMO calls / node: 8.047619047619047 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 seed = 0x3844464d4f6391d9 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.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -6.826144e+01 -3.972560e+01 2.853583e+01 7.183234e-01 1.951800e+01 1.537043e-01 12048 16 6 10001 4 0 * 2 3 -6.826144e+01 -4.644629e+01 2.181515e+01 4.696854e-01 2.008600e+01 2.489296e-01 564 83 31 242 13 1 * 3 4 -6.508562e+01 -4.738416e+01 1.770147e+01 3.735736e-01 2.089300e+01 3.350404e-01 803 99 61 543 10 0 * 4 5 -6.508562e+01 -4.971698e+01 1.536864e+01 3.091226e-01 2.126200e+01 4.232904e-01 364 76 85 237 10 3 * 5 6 -6.508452e+01 -5.011624e+01 1.496828e+01 2.986713e-01 2.184900e+01 5.034555e-01 581 78 111 387 18 3 * 10 11 -6.508181e+01 -5.200618e+01 1.307563e+01 2.514245e-01 2.456000e+01 8.550489e-01 670 97 257 474 18 5 100 101 -6.498937e+01 -5.200618e+01 1.298319e+01 2.496471e-01 1.388860e+02 1.447230e+00 904 89 3058 736 30 15 200 201 -6.490846e+01 -5.200618e+01 1.290228e+01 2.480914e-01 2.651450e+02 1.512380e+00 1071 97 6218 957 27 6 * 289 288 -6.486939e+01 -6.277133e+01 2.098054e+00 3.342376e-02 3.794180e+02 1.520750e+00 4064 7 8967 10001 5 0 300 299 -6.486856e+01 -6.277133e+01 2.097229e+00 3.341061e-02 3.915770e+02 1.529712e+00 1155 94 9313 1010 24 6 * 341 336 -6.482340e+01 -6.424202e+01 5.813778e-01 9.049806e-03 4.329920e+02 1.563539e+00 332 59 10498 208 13 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 1.962794e+02 1.915125e+02 4.766930e+00 0.000000e+00 Inf 1 LD 3 -6.294421e+01 -6.361299e+01 6.687761e-01 2.838022e-01 1.057074e+01 2 LD 230 -6.422663e+01 -6.452997e+01 3.033402e-01 6.404760e-01 3.591079e+02 6 LD 251 -6.423855e+01 -6.436600e+01 1.274421e-01 6.553855e-01 3.829807e+02 7 LD 274 -6.424089e+01 -6.430007e+01 5.918114e-02 6.716064e-01 4.079771e+02 8 LD 320 -6.424178e+01 -6.426555e+01 2.376992e-02 6.939888e-01 4.611025e+02 9 LD 373 -6.424198e+01 -6.425049e+01 8.513136e-03 7.184136e-01 5.191995e+02 10 LD 439 -6.424202e+01 -6.424435e+01 2.334149e-03 7.550956e-01 5.813834e+02 12 LD 482 -6.424202e+01 -6.424301e+01 9.928758e-04 7.803086e-01 6.177043e+02 12 LD 540 -6.424202e+01 -6.424249e+01 4.715653e-04 8.171368e-01 6.608440e+02 13 LD 600 -6.424202e+01 -6.424223e+01 2.142601e-04 8.547103e-01 7.019922e+02 14 LD 665 -6.424202e+01 -6.424212e+01 1.002659e-04 8.940842e-01 7.437778e+02 15 LD 760 -6.424202e+01 -6.424207e+01 4.544440e-05 9.536974e-01 7.968985e+02 17 LD 892 -6.424202e+01 -6.424204e+01 2.203812e-05 1.023660e+00 8.713829e+02 17 P 1000 -6.424202e+01 -6.424204e+01 2.203812e-05 1.083901e+00 9.225931e+02 17 LD 1031 -6.424202e+01 -6.424203e+01 1.080722e-05 1.157668e+00 8.905834e+02 17 LD 1158 -6.424202e+01 -6.424203e+01 5.123411e-06 1.229988e+00 9.414727e+02 18 LD 1298 -6.424202e+01 -6.424202e+01 2.421803e-06 1.307032e+00 9.930893e+02 18 P 2000 -6.424202e+01 -6.424202e+01 2.421803e-06 2.042685e+00 9.791036e+02 18 P 3000 -6.424202e+01 -6.424202e+01 2.421803e-06 2.929994e+00 1.023893e+03 18 P 4000 -6.424202e+01 -6.424202e+01 2.421803e-06 3.740823e+00 1.069283e+03 18 P 5000 -6.424202e+01 -6.424202e+01 2.421803e-06 4.532062e+00 1.103251e+03 18 P 6000 -6.424202e+01 -6.424202e+01 2.421803e-06 5.328401e+00 1.126041e+03 18 P 7000 -6.424202e+01 -6.424202e+01 2.421803e-06 6.128749e+00 1.142158e+03 18 P 8000 -6.424202e+01 -6.424202e+01 2.421803e-06 6.936659e+00 1.153293e+03 18 P 9000 -6.424202e+01 -6.424202e+01 2.421803e-06 7.734661e+00 1.163593e+03 18 P 10000 -6.424202e+01 -6.424202e+01 2.421803e-06 8.520898e+00 1.173585e+03 18 Last 10001 -6.424202e+01 -6.424202e+01 1.795119e-06 8.526166e+00 1.172977e+03 18 ---------------------------------------------------------------------------------------------------------------- PP 10001 -6.424202e+01 -6.424202e+01 1.795120e-06 8.529687e+00 1.172493e+03 18 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -64.24202066044258 Dual Bound: -64.82339843557754 Dual Gap (relative): 0.009049805238971174 Search Statistics. Total number of nodes processed: 677 Total number of lmo calls: 10535 Total time (s): 443.288 LMO calls / sec: 23.765588060132465 Nodes / sec: 1.527223836422371 LMO calls / node: 15.561299852289512 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 [ Info: Polish solution 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.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -6.499339e+01 -5.550622e+01 9.487165e+00 1.709208e-01 1.933000e+01 1.551992e-01 7589 203 27 120 17 1 * 3 4 -6.495781e+01 -5.943415e+01 5.523663e+00 9.293752e-02 2.175600e+01 3.217503e-01 396 184 71 146 11 2 * 31 32 -6.362148e+01 -5.982246e+01 3.799022e+00 6.350494e-02 5.039800e+01 1.250050e+00 334 130 587 151 12 4 * 97 98 -6.252522e+01 -6.015491e+01 2.370308e+00 3.940340e-02 1.064240e+02 1.832293e+00 326 78 1744 346 11 3 100 101 -6.252126e+01 -6.015491e+01 2.366350e+00 3.933760e-02 1.078900e+02 1.863009e+00 116 61 1794 71 19 4 * 139 138 -6.230969e+01 -6.023751e+01 2.072186e+00 3.440025e-02 1.282280e+02 2.160215e+00 300 85 2410 308 10 2 * 148 143 -6.224397e+01 -6.041922e+01 1.824751e+00 3.020150e-02 1.345050e+02 2.193227e+00 143 58 2552 84 11 6 200 179 -6.205657e+01 -6.041922e+01 1.637347e+00 2.709976e-02 1.651400e+02 2.319244e+00 261 92 3276 149 12 4 300 211 -6.187032e+01 -6.041922e+01 1.451103e+00 2.401723e-02 2.107200e+02 2.444002e+00 117 61 4361 57 8 3 * 368 225 -6.171152e+01 -6.059634e+01 1.115177e+00 1.840337e-02 2.419350e+02 2.517205e+00 159 75 5160 74 9 3 400 229 -6.161711e+01 -6.059634e+01 1.020765e+00 1.684532e-02 2.518870e+02 2.560672e+00 155 75 5453 74 13 3 500 243 -6.146951e+01 -6.059634e+01 8.731700e-01 1.440962e-02 2.882150e+02 2.633451e+00 62 37 6380 26 7 5 600 245 -6.138169e+01 -6.059634e+01 7.853486e-01 1.296033e-02 3.153680e+02 2.730144e+00 110 62 7207 39 9 4 700 247 -6.125525e+01 -6.059634e+01 6.589066e-01 1.087370e-02 3.454330e+02 2.787805e+00 25 15 8073 6 3 3 749 244 -6.120015e+01 -6.059634e+01 6.038063e-01 9.964403e-03 3.574120e+02 2.823073e+00 21 15 8482 6 6 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -2.706546e+01 -2.775569e+01 6.902349e-01 0.000000e+00 Inf 1 LD 2 -6.059634e+01 -6.059634e+01 0.000000e+00 1.310663e-01 1.525945e+01 1 Last 2 -6.059634e+01 -6.059634e+01 0.000000e+00 2.606723e-01 7.672468e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -6.059634e+01 -6.059634e+01 0.000000e+00 2.642357e-01 7.568999e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -60.59634220875466 Dual Bound: -61.20014855362908 Dual Gap (relative): 0.009964402517800472 Search Statistics. Total number of nodes processed: 1009 Total number of lmo calls: 8487 Total time (s): 359.143 LMO calls / sec: 23.63125551660481 Nodes / sec: 2.809465867356457 LMO calls / node: 8.411298315163528 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 Test Suite: Error During Test at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Got exception outside of a @test LoadError: invalid assignment to constant Main.groups. This redefinition may be permitted using the `const` keyword. Stacktrace: [1] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/poisson.jl:192 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [3] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1858 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [7] top-level scope @ none:6 [8] eval(m::Module, e::Any) @ Core ./boot.jl:489 [9] exec_options(opts::Base.JLOptions) @ Base ./client.jl:286 [10] _start() @ Base ./client.jl:553 in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/poisson.jl:192 Test Summary: | Pass Error Total Time Boscia Test Suite | 130 1 131 28m36.5s Norm hyperbox | 4 4 41.7s Norm hyperbox - strong branching | 2 2 33.9s Normbox - Shadow set activation | 4 4 16.3s Normbox - strong convexity and sharpness | 6 6 13.2s Start with Active Set | 2 2 13.0s Interface - sparse poisson regression | 4 4 20.9s Different FW variants | 10 10 1m04.5s Different line search types | 8 8 2m25.7s Lazification | 5 5 20.6s DICG - Lazification | 10 10 1m00.0s DICG - warm_start | 5 5 51.9s User stop | 2 2 15.7s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 24.1s BLMO - Strong Branching | 4 4 21.2s Probability Simplex LMO | 4 4 49.5s Unit Simplex LMO | 4 4 51.2s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 23.6s Hyperplane Aware Rounding - Unit Simplex | 2 2 29.7s Following Gradient Heuristic - Unit Simplex | 6 6 36.6s Rounding Heuristic - Unit Simplex | 3 3 35.7s Probability Rounding - Unit Cube | 2 2 22.7s Probability rounding - Probability Simplex | 4 4 20.8s Sparse Regression | 2 2 29.7s Sparse Regression Group | 7 7 53.2s Poisson sparse regression | 2 2 7m26.7s Hybrid branching poisson sparse regression | 3 3 6m02.7s RNG of the outermost testset: Xoshiro(0x8cd72f4be32c2d8c, 0x3b965210ded894a5, 0xb2efbc188342379d, 0x8985eebbf0f32e6f, 0x80f2591ca6a74695) ERROR: LoadError: Some tests did not pass: 130 passed, 0 failed, 1 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Testing failed after 1747.16s ERROR: LoadError: Package Boscia errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2661 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2510 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:538 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:168 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:155 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:309 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:320 [12] _start() @ Base ./client.jl:553 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1870.03s: package tests unexpectedly errored