Package evaluation of SCS on Julia 1.13.0-DEV.791 (d5209bd37d*) started at 2025-07-04T13:39:15.759 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.24s ################################################################################ # Installation # Installing SCS... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [c946c3f1] + SCS v2.1.0 Updating `~/.julia/environments/v1.13/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.17.0 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.0.1 [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.41.0 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [c946c3f1] + SCS v2.1.0 [276daf66] + SpecialFunctions v2.5.1 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [1d63c593] + LLVMOpenMP_jll v18.1.8+0 [656ef2d0] + OpenBLAS32_jll v0.3.29+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f4f2fc5b] + SCS_jll v3.2.7+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.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 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 Installation completed after 1.71s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 12.94s ################################################################################ # Testing # Testing SCS Status `/tmp/jl_dz1Xgq/Project.toml` [b8f27783] MathOptInterface v1.41.0 [aea7be01] PrecompileTools v1.3.2 [c946c3f1] SCS v2.1.0 [f4f2fc5b] SCS_jll v3.2.7+0 [44cfe95a] Pkg v1.13.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_dz1Xgq/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.17.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.0.1 [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.41.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [c946c3f1] SCS v2.1.0 [276daf66] SpecialFunctions v2.5.1 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [6e34b625] Bzip2_jll v1.0.9+0 [1d63c593] LLVMOpenMP_jll v18.1.8+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f4f2fc5b] SCS_jll v3.2.7+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching 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.12.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 [2f01184e] SparseArrays v1.12.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.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.0+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 Testing Running tests... Resolving package versions... Updating `/tmp/jl_dz1Xgq/Project.toml` [3f2553a9] + SCS_MKL_jll v3.2.7+0 Updating `/tmp/jl_dz1Xgq/Manifest.toml` ⌅ [1d5cc7b8] + IntelOpenMP_jll v2023.2.0+0 ⌅ [856f044c] + MKL_jll v2023.2.0+0 [3f2553a9] + SCS_MKL_jll v3.2.7+0 [4af54fe1] + LazyArtifacts v1.11.0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Precompiling packages... 7821.1 ms ✓ MKL_jll 5771.2 ms ✓ SCS_MKL_jll 2 dependencies successfully precompiled in 14 seconds. 30 already precompiled. Precompiling packages... 20629.2 ms ✓ SCS → SCSSCS_MKL_jllExt 1 dependency successfully precompiled in 21 seconds. 74 already precompiled. ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 1 cones: z: primal zero / dual free vars: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 9.80e-01 1.00e+00 2.00e-02 1.99e+00 1.00e-01 2.56e-04 25| 6.76e-09 2.98e-08 2.30e-08 1.00e+00 1.00e-01 3.21e-04 ------------------------------------------------------------------ status: solved timings: total: 3.23e-04s = setup: 1.55e-04s + solve: 1.68e-04s lin-sys: 9.25e-06s, cones: 7.03e-06s, accel: 2.82e-06s ------------------------------------------------------------------ objective = 1.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 11, constraints m: 112 cones: l: linear vars: 100 q: soc vars: 12, qsize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 1012, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 7.27e+00 2.11e+00 1.92e+01 -1.08e+01 1.00e-01 3.28e-04 175| 2.75e-04 6.56e-05 8.23e-05 -2.61e+00 1.00e-01 1.52e-03 ------------------------------------------------------------------ status: solved timings: total: 1.52e-03s = setup: 2.92e-04s + solve: 1.23e-03s lin-sys: 7.04e-04s, cones: 8.73e-05s, accel: 2.33e-04s ------------------------------------------------------------------ objective = -2.612301 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 24, constraints m: 71 cones: z: primal zero / dual free vars: 10 l: linear vars: 10 q: soc vars: 6, qsize: 5 e: exp vars: 30, dual exp vars: 15 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 162, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 2.52e+01 8.33e+00 1.59e+02 -5.83e+01 1.00e-01 2.68e-04 225| 7.44e-06 3.91e-05 6.36e-05 1.49e+01 4.59e+00 2.39e-03 ------------------------------------------------------------------ status: solved timings: total: 2.39e-03s = setup: 2.29e-04s + solve: 2.17e-03s lin-sys: 5.22e-04s, cones: 1.36e-03s, accel: 2.40e-05s ------------------------------------------------------------------ objective = 14.901014 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 15, constraints m: 46 cones: z: primal zero / dual free vars: 3 l: linear vars: 3 q: soc vars: 9, qsize: 3 s: psd vars: 19, ssize: 3 e: exp vars: 6, dual exp vars: 6 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 66, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 6.45e+01 6.69e+00 4.37e+02 -2.35e+02 1.00e-01 4.01e-04 225| 5.33e-04 6.81e-04 8.20e-05 -1.02e+01 1.72e+00 3.16e-03 ------------------------------------------------------------------ status: solved timings: total: 3.16e-03s = setup: 2.20e-04s + solve: 2.94e-03s lin-sys: 2.97e-04s, cones: 2.44e-03s, accel: 2.29e-05s ------------------------------------------------------------------ objective = -10.243216 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 9, constraints m: 28 cones: z: primal zero / dual free vars: 5 l: linear vars: 5 p: primal + dual power vars: 18 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 25, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 2.10e+01 2.84e+00 3.01e+01 -2.42e+01 1.00e-01 1.45e-04 150| 8.87e-05 5.43e-06 8.49e-05 -3.73e+00 3.55e-01 1.27e-03 ------------------------------------------------------------------ status: solved timings: total: 1.27e-03s = setup: 1.07e-04s + solve: 1.16e-03s lin-sys: 1.16e-04s, cones: 9.34e-04s, accel: 1.14e-05s ------------------------------------------------------------------ objective = -3.727795 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.26e+02 3.95e+00 1.22e+03 -6.94e+02 1.00e-01 1.05e-04 125| 7.47e-05 4.88e-06 3.10e-04 -9.90e+01 1.00e-01 2.73e-04 ------------------------------------------------------------------ status: solved timings: total: 2.74e-04s = setup: 7.82e-05s + solve: 1.96e-04s lin-sys: 4.51e-05s, cones: 1.84e-05s, accel: 4.05e-05s ------------------------------------------------------------------ objective = -98.999835 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-10, eps_rel: 1.0e-10, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.26e+02 3.95e+00 1.22e+03 -6.94e+02 1.00e-01 9.32e-05 250| 7.45e-10 7.46e-12 2.23e-09 -9.90e+01 1.00e-01 3.45e-04 ------------------------------------------------------------------ status: solved timings: total: 3.47e-04s = setup: 6.96e-05s + solve: 2.77e-04s lin-sys: 7.68e-05s, cones: 3.15e-05s, accel: 5.46e-05s ------------------------------------------------------------------ objective = -99.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-10, eps_rel: 1.0e-10, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 1, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 7.05e-10 6.70e-11 4.63e-09 -9.90e+01 1.00e-01 1.17e-04 ------------------------------------------------------------------ status: solved timings: total: 1.18e-04s = setup: 8.15e-05s + solve: 3.65e-05s lin-sys: 1.36e-06s, cones: 3.39e-06s, accel: 5.00e-08s ------------------------------------------------------------------ objective = -99.000000 ------------------------------------------------------------------ Writing raw problem data to /tmp/jl_1cVud4p2rG ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-12, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.26e+02 3.95e+00 1.22e+03 -6.94e+02 1.00e-01 4.92e-04 125| 7.47e-05 4.88e-06 3.10e-04 -9.90e+01 1.00e-01 6.37e-04 ------------------------------------------------------------------ status: solved timings: total: 6.38e-04s = setup: 4.67e-04s + solve: 1.71e-04s lin-sys: 4.01e-05s, cones: 1.70e-05s, accel: 4.05e-05s ------------------------------------------------------------------ objective = -98.999835 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 1 cones: z: primal zero / dual free vars: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 9.80e-01 1.00e+00 2.00e-02 1.99e+00 1.00e-01 8.97e-05 25| 6.76e-09 2.98e-08 2.30e-08 1.00e+00 1.00e-01 1.11e-04 ------------------------------------------------------------------ status: solved timings: total: 1.12e-04s = setup: 6.19e-05s + solve: 5.04e-05s lin-sys: 5.41e-06s, cones: 4.28e-06s, accel: 1.61e-06s ------------------------------------------------------------------ objective = 1.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 1 cones: z: primal zero / dual free vars: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 9.80e-01 1.00e+00 2.00e-02 1.99e+00 1.00e-01 9.47e-05 25| 6.76e-09 2.98e-08 2.30e-08 1.00e+00 1.00e-01 1.18e-04 ------------------------------------------------------------------ status: solved timings: total: 1.19e-04s = setup: 6.03e-05s + solve: 5.89e-05s lin-sys: 5.58e-06s, cones: 4.86e-06s, accel: 1.58e-06s ------------------------------------------------------------------ objective = 1.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 1 cones: z: primal zero / dual free vars: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 9.80e-01 1.00e+00 2.00e-02 1.99e+00 1.00e-01 1.53e-04 25| 5.59e-07 6.33e-06 6.89e-06 1.00e+00 1.00e-01 2.81e-04 ------------------------------------------------------------------ status: solved timings: total: 2.82e-04s = setup: 7.76e-05s + solve: 2.05e-04s lin-sys: 1.12e-04s, cones: 5.68e-06s, accel: 2.84e-06s ------------------------------------------------------------------ objective = 0.999997 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 11, constraints m: 112 cones: l: linear vars: 100 q: soc vars: 12, qsize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 1012, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 7.27e+00 2.11e+00 1.92e+01 -1.08e+01 1.00e-01 3.12e-04 175| 2.88e-04 8.35e-05 1.01e-04 -2.61e+00 1.00e-01 3.01e-03 ------------------------------------------------------------------ status: solved timings: total: 3.02e-03s = setup: 2.28e-04s + solve: 2.79e-03s lin-sys: 2.34e-03s, cones: 9.90e-05s, accel: 8.49e-05s ------------------------------------------------------------------ objective = -2.612300 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 24, constraints m: 71 cones: z: primal zero / dual free vars: 10 l: linear vars: 10 q: soc vars: 6, qsize: 5 e: exp vars: 30, dual exp vars: 15 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 162, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 2.52e+01 8.33e+00 1.59e+02 -5.83e+01 1.00e-01 2.46e-04 250| 9.27e-03 8.15e-05 7.85e-03 1.49e+01 3.72e-01 9.97e-03 325| 2.64e-05 1.64e-04 2.54e-05 1.49e+01 4.10e+00 1.41e-02 ------------------------------------------------------------------ status: solved timings: total: 1.41e-02s = setup: 1.39e-04s + solve: 1.39e-02s lin-sys: 1.12e-02s, cones: 2.12e-03s, accel: 7.74e-05s ------------------------------------------------------------------ objective = 14.900916 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 15, constraints m: 46 cones: z: primal zero / dual free vars: 3 l: linear vars: 3 q: soc vars: 9, qsize: 3 s: psd vars: 19, ssize: 3 e: exp vars: 6, dual exp vars: 6 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 66, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 6.45e+01 6.69e+00 4.37e+02 -2.35e+02 1.00e-01 2.37e-04 250| 3.13e-03 8.96e-05 4.39e-03 -1.02e+01 3.57e-01 5.40e-03 350| 2.41e-04 5.11e-04 3.53e-04 -1.02e+01 2.32e+00 7.66e-03 ------------------------------------------------------------------ status: solved timings: total: 7.67e-03s = setup: 1.24e-04s + solve: 7.54e-03s lin-sys: 3.28e-03s, cones: 3.80e-03s, accel: 5.72e-05s ------------------------------------------------------------------ objective = -10.242430 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 9, constraints m: 28 cones: z: primal zero / dual free vars: 5 l: linear vars: 5 p: primal + dual power vars: 18 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 25, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 2.10e+01 2.84e+00 3.01e+01 -2.42e+01 1.00e-01 1.17e-04 175| 2.06e-04 1.19e-05 1.56e-04 -3.73e+00 3.23e-01 3.74e-03 ------------------------------------------------------------------ status: solved timings: total: 3.74e-03s = setup: 7.40e-05s + solve: 3.67e-03s lin-sys: 2.35e-03s, cones: 1.12e-03s, accel: 3.91e-05s ------------------------------------------------------------------ objective = -3.727842 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.26e+02 3.95e+00 1.22e+03 -6.94e+02 1.00e-01 9.45e-05 200| 2.34e-04 1.41e-04 1.18e-04 -9.90e+01 3.18e-01 1.53e-03 ------------------------------------------------------------------ status: solved timings: total: 1.53e-03s = setup: 5.58e-05s + solve: 1.48e-03s lin-sys: 1.27e-03s, cones: 2.72e-05s, accel: 3.91e-05s ------------------------------------------------------------------ objective = -99.000312 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-10, eps_rel: 1.0e-10, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.26e+02 3.95e+00 1.22e+03 -6.94e+02 1.00e-01 1.01e-04 250| 8.99e-05 2.22e-05 4.41e-05 -9.90e+01 3.18e-01 1.82e-03 500| 6.14e-10 3.16e-10 5.56e-09 -9.90e+01 3.18e-01 3.56e-03 ------------------------------------------------------------------ status: solved timings: total: 3.56e-03s = setup: 6.04e-05s + solve: 3.50e-03s lin-sys: 3.06e-03s, cones: 6.71e-05s, accel: 1.18e-04s ------------------------------------------------------------------ objective = -99.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-10, eps_rel: 1.0e-10, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 1, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 3.75e-09 3.16e-10 4.33e-09 -9.90e+01 1.00e-01 1.22e-04 1| 3.75e-09 3.16e-10 4.33e-09 -9.90e+01 1.00e-01 1.30e-04 ------------------------------------------------------------------ status: solved (inaccurate - reached max_iters) timings: total: 1.37e-04s = setup: 6.41e-05s + solve: 7.26e-05s lin-sys: 1.61e-05s, cones: 2.49e-06s, accel: 8.00e-08s ------------------------------------------------------------------ objective = -99.000000 (inaccurate) ------------------------------------------------------------------ Writing raw problem data to /tmp/jl_Vi5eN070Jm ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-12, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.26e+02 3.95e+00 1.22e+03 -6.94e+02 1.00e-01 1.15e-01 200| 2.34e-04 1.41e-04 1.18e-04 -9.90e+01 3.18e-01 1.17e-01 ------------------------------------------------------------------ status: solved timings: total: 1.17e-01s = setup: 1.15e-01s + solve: 1.59e-03s lin-sys: 1.38e-03s, cones: 2.96e-05s, accel: 4.29e-05s ------------------------------------------------------------------ objective = -99.000312 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 1 cones: z: primal zero / dual free vars: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 9.80e-01 1.00e+00 2.00e-02 1.99e+00 1.00e-01 7.63e-05 25| 5.59e-07 6.33e-06 6.89e-06 1.00e+00 1.00e-01 2.06e-04 ------------------------------------------------------------------ status: solved timings: total: 2.07e-04s = setup: 4.30e-05s + solve: 1.64e-04s lin-sys: 1.16e-04s, cones: 5.34e-06s, accel: 1.62e-06s ------------------------------------------------------------------ objective = 0.999997 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 1 cones: z: primal zero / dual free vars: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-indirect-scs nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 9.80e-01 1.00e+00 2.00e-02 1.99e+00 1.00e-01 3.05e-05 25| 5.59e-07 6.33e-06 6.89e-06 1.00e+00 1.00e-01 1.52e-04 ------------------------------------------------------------------ status: solved timings: total: 1.53e-04s = setup: 1.73e-05s + solve: 1.35e-04s lin-sys: 1.07e-04s, cones: 2.59e-06s, accel: 1.32e-06s ------------------------------------------------------------------ objective = 0.999997 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 1 cones: z: primal zero / dual free vars: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 9.80e-01 1.00e+00 2.00e-02 1.99e+00 1.00e-01 2.56e-02 25| 6.87e-09 2.98e-08 2.29e-08 1.00e+00 1.00e-01 2.59e-02 ------------------------------------------------------------------ status: solved timings: total: 2.59e-02s = setup: 2.53e-02s + solve: 5.14e-04s lin-sys: 1.91e-04s, cones: 7.15e-06s, accel: 2.79e-06s ------------------------------------------------------------------ objective = 1.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 11, constraints m: 112 cones: l: linear vars: 100 q: soc vars: 12, qsize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 1012, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 7.27e+00 2.11e+00 1.92e+01 -1.08e+01 1.00e-01 1.40e-03 175| 2.75e-04 6.56e-05 8.23e-05 -2.61e+00 1.00e-01 4.64e-03 ------------------------------------------------------------------ status: solved timings: total: 4.64e-03s = setup: 1.29e-03s + solve: 3.35e-03s lin-sys: 2.47e-03s, cones: 1.05e-04s, accel: 4.62e-04s ------------------------------------------------------------------ objective = -2.612301 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 24, constraints m: 71 cones: z: primal zero / dual free vars: 10 l: linear vars: 10 q: soc vars: 6, qsize: 5 e: exp vars: 30, dual exp vars: 15 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 162, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 2.52e+01 8.33e+00 1.59e+02 -5.83e+01 1.00e-01 9.24e-04 225| 7.44e-06 3.91e-05 6.36e-05 1.49e+01 4.59e+00 5.20e-03 ------------------------------------------------------------------ status: solved timings: total: 5.20e-03s = setup: 8.53e-04s + solve: 4.35e-03s lin-sys: 2.38e-03s, cones: 1.47e-03s, accel: 3.36e-05s ------------------------------------------------------------------ objective = 14.901014 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 15, constraints m: 46 cones: z: primal zero / dual free vars: 3 l: linear vars: 3 q: soc vars: 9, qsize: 3 s: psd vars: 19, ssize: 3 e: exp vars: 6, dual exp vars: 6 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 66, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 6.45e+01 6.69e+00 4.37e+02 -2.35e+02 1.00e-01 1.05e-03 225| 5.33e-04 6.81e-04 8.20e-05 -1.02e+01 1.72e+00 6.39e-03 ------------------------------------------------------------------ status: solved timings: total: 6.39e-03s = setup: 6.68e-04s + solve: 5.72e-03s lin-sys: 2.04e-03s, cones: 3.27e-03s, accel: 3.13e-05s ------------------------------------------------------------------ objective = -10.243216 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 9, constraints m: 28 cones: z: primal zero / dual free vars: 5 l: linear vars: 5 p: primal + dual power vars: 18 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 25, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 2.10e+01 2.84e+00 3.01e+01 -2.42e+01 1.00e-01 3.54e-04 150| 8.87e-05 5.43e-06 8.49e-05 -3.73e+00 3.55e-01 2.58e-03 ------------------------------------------------------------------ status: solved timings: total: 2.59e-03s = setup: 3.00e-04s + solve: 2.29e-03s lin-sys: 1.09e-03s, cones: 1.01e-03s, accel: 1.49e-05s ------------------------------------------------------------------ objective = -3.727795 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.26e+02 3.95e+00 1.22e+03 -6.94e+02 1.00e-01 4.33e-04 125| 7.47e-05 4.88e-06 3.10e-04 -9.90e+01 1.00e-01 1.43e-03 ------------------------------------------------------------------ status: solved timings: total: 1.43e-03s = setup: 3.69e-04s + solve: 1.06e-03s lin-sys: 8.44e-04s, cones: 2.13e-05s, accel: 5.97e-05s ------------------------------------------------------------------ objective = -98.999835 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-10, eps_rel: 1.0e-10, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.26e+02 3.95e+00 1.22e+03 -6.94e+02 1.00e-01 3.96e-04 250| 7.45e-10 7.46e-12 2.23e-09 -9.90e+01 1.00e-01 2.37e-03 ------------------------------------------------------------------ status: solved timings: total: 2.37e-03s = setup: 3.36e-04s + solve: 2.04e-03s lin-sys: 1.71e-03s, cones: 4.15e-05s, accel: 8.30e-05s ------------------------------------------------------------------ objective = -99.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-10, eps_rel: 1.0e-10, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 1, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 7.05e-10 6.70e-11 4.62e-09 -9.90e+01 1.00e-01 3.88e-04 ------------------------------------------------------------------ status: solved timings: total: 3.89e-04s = setup: 3.22e-04s + solve: 6.70e-05s lin-sys: 1.18e-05s, cones: 2.87e-06s, accel: 5.00e-08s ------------------------------------------------------------------ objective = -99.000000 ------------------------------------------------------------------ Writing raw problem data to /tmp/jl_DO9Qxe1Uny ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 5, constraints m: 8 cones: l: linear vars: 8 settings: eps_abs: 1.0e-12, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 12, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.26e+02 3.95e+00 1.22e+03 -6.94e+02 1.00e-01 3.55e-02 125| 7.47e-05 4.88e-06 3.10e-04 -9.90e+01 1.00e-01 3.65e-02 ------------------------------------------------------------------ status: solved timings: total: 3.65e-02s = setup: 3.55e-02s + solve: 1.05e-03s lin-sys: 8.41e-04s, cones: 2.21e-05s, accel: 5.37e-05s ------------------------------------------------------------------ objective = -98.999835 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 1 cones: z: primal zero / dual free vars: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 9.80e-01 1.00e+00 2.00e-02 1.99e+00 1.00e-01 2.73e-04 25| 6.87e-09 2.98e-08 2.29e-08 1.00e+00 1.00e-01 4.20e-04 ------------------------------------------------------------------ status: solved timings: total: 4.21e-04s = setup: 2.25e-04s + solve: 1.96e-04s lin-sys: 1.37e-04s, cones: 4.53e-06s, accel: 1.58e-06s ------------------------------------------------------------------ objective = 1.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 1 cones: z: primal zero / dual free vars: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-mkl-pardiso nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 9.80e-01 1.00e+00 2.00e-02 1.99e+00 1.00e-01 8.46e-05 25| 6.87e-09 2.98e-08 2.29e-08 1.00e+00 1.00e-01 2.28e-04 ------------------------------------------------------------------ status: solved timings: total: 2.29e-04s = setup: 6.25e-05s + solve: 1.66e-04s lin-sys: 1.33e-04s, cones: 2.84e-06s, accel: 1.34e-06s ------------------------------------------------------------------ objective = 1.000000 ------------------------------------------------------------------ Test Summary: | Pass Total Time test-problems.jl | 80 80 19.0s ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 3, constraints m: 4 cones: l: linear vars: 4 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 5, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 3.43e-01 1.17e-01 2.34e-01 1.17e-01 1.00e-01 9.59e-05 25| 8.88e-08 0.00e+00 0.00e+00 0.00e+00 1.00e-01 1.44e-04 ------------------------------------------------------------------ status: solved timings: total: 1.45e-04s = setup: 6.75e-05s + solve: 7.78e-05s lin-sys: 8.04e-06s, cones: 4.86e-06s, accel: 2.27e-05s ------------------------------------------------------------------ objective = 0.000000 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_ADMMIterations | 2 2 21.0s m and n must both be greater than 0; m = 3, n = 0 ERROR: Validation returned failure ERROR: missing ScsWork, ScsSolution or ScsInfo input test_nonlinear_Feasibility_internal: Test Failed at /home/pkgeval/.julia/packages/MathOptInterface/eRhCr/src/Test/test_nonlinear.jl:1075 Expression: MOI.constraint_expr(d, 1) == :(x[$(MOI.VariableIndex(1))] ^ 2 == 1.0) Evaluated: (x[MOI.VariableIndex(1)] ^ 2 == 1) == (x[MOI.VariableIndex(1)] ^ 2 == 1.0) Stacktrace: [1] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:741 [inlined] [2] test_nonlinear_Feasibility_internal(::MathOptInterface.Bridges.LazyBridgeOptimizer{MathOptInterface.Utilities.CachingOptimizer{SCS.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}}, ::MathOptInterface.Test.Config{Float64}) @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/eRhCr/src/Test/test_nonlinear.jl:1075 [3] macro expansion @ ~/.julia/packages/MathOptInterface/eRhCr/src/Test/Test.jl:270 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1855 [inlined] [5] runtests(model::MathOptInterface.Bridges.LazyBridgeOptimizer{MathOptInterface.Utilities.CachingOptimizer{SCS.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}}, config::MathOptInterface.Test.Config{Float64}; include::Vector{String}, exclude::Vector{String}, warn_unsupported::Bool, verbose::Bool, exclude_tests_after::VersionNumber, test_module::Module) @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/eRhCr/src/Test/Test.jl:265 Test Summary: | Pass Fail Total Time test_DirectSolver | 3915 1 3916 37m02.6s test_DualObjectiveValue_Max_ScalarAffine_LessThan | 1 1 27.3s test_DualObjectiveValue_Max_VariableIndex_LessThan | 1 1 4.2s test_DualObjectiveValue_Min_ScalarAffine_GreaterThan | 1 1 0.2s test_DualObjectiveValue_Min_VariableIndex_GreaterThan | 1 1 1.8s test_HermitianPSDCone_basic | 1 1 19.5s test_HermitianPSDCone_min_t | 2 2 3.0s test_NormNuclearCone_VectorAffineFunction_with_transform | 2 2 9.0s test_NormNuclearCone_VectorAffineFunction_without_transform | 2 2 0.0s test_NormNuclearCone_VectorOfVariables_with_transform | 2 2 2.1s test_NormNuclearCone_VectorOfVariables_without_transform | 2 2 0.0s test_NormSpectralCone_VectorAffineFunction_with_transform | 2 2 4.5s test_NormSpectralCone_VectorAffineFunction_without_transform | 2 2 0.0s test_NormSpectralCone_VectorOfVariables_with_transform | 2 2 0.6s test_NormSpectralCone_VectorOfVariables_without_transform | 2 2 0.0s test_add_constrained_PositiveSemidefiniteConeTriangle | 34 34 31.2s test_add_constrained_PositiveSemidefiniteConeTriangle_VariableName | 1 1 0.4s test_add_constrained_PositiveSemidefiniteConeTriangle_VariablePrimalStart | 2 2 2.0s test_add_constrained_variables_vector | 6 6 0.7s test_add_parameter | 6 6 8.8s test_attribute_AbsoluteGapTolerance | 0 0.3s test_attribute_NodeLimit | 0 0.2s test_attribute_NumberThreads | 0 0.2s test_attribute_ObjectiveLimit | 0 0.2s test_attribute_RelativeGapTolerance | 0 0.2s test_attribute_Silent | 4 4 0.5s test_attribute_SolutionLimit | 0 0.2s test_attribute_SolverName | 1 1 0.1s test_attribute_SolverVersion | 0 0.2s test_attribute_TimeLimitSec | 4 4 0.6s test_attribute_after_empty | 4 4 0.1s test_attribute_unsupported_constraint | 2 2 3.4s test_basic_ScalarAffineFunction_EqualTo | 24 24 10.6s test_basic_ScalarAffineFunction_GreaterThan | 24 24 8.3s test_basic_ScalarAffineFunction_Integer | 0 10.5s test_basic_ScalarAffineFunction_Interval | 24 24 10.1s test_basic_ScalarAffineFunction_LessThan | 24 24 4.9s test_basic_ScalarAffineFunction_Semicontinuous | 0 9.2s test_basic_ScalarAffineFunction_Semiinteger | 0 9.3s test_basic_ScalarAffineFunction_ZeroOne | 0 7.8s test_basic_ScalarNonlinearFunction_EqualTo | 0 8.3s test_basic_ScalarNonlinearFunction_GreaterThan | 0 7.5s test_basic_ScalarNonlinearFunction_Integer | 0 7.3s test_basic_ScalarNonlinearFunction_Interval | 0 7.8s test_basic_ScalarNonlinearFunction_LessThan | 0 7.9s test_basic_ScalarNonlinearFunction_Semicontinuous | 0 8.0s test_basic_ScalarNonlinearFunction_Semiinteger | 0 7.8s test_basic_ScalarNonlinearFunction_ZeroOne | 0 8.4s test_basic_ScalarQuadraticFunction_EqualTo | 1 1 17.2s test_basic_ScalarQuadraticFunction_GreaterThan | 1 1 6.2s test_basic_ScalarQuadraticFunction_Integer | 0 7.2s test_basic_ScalarQuadraticFunction_Interval | 1 1 7.4s test_basic_ScalarQuadraticFunction_LessThan | 24 24 16.1s test_basic_ScalarQuadraticFunction_Semicontinuous | 0 7.2s test_basic_ScalarQuadraticFunction_Semiinteger | 0 6.9s test_basic_ScalarQuadraticFunction_ZeroOne | 0 7.2s test_basic_VariableIndex_EqualTo | 20 20 4.1s test_basic_VariableIndex_GreaterThan | 20 20 4.0s test_basic_VariableIndex_Integer | 0 4.1s test_basic_VariableIndex_Interval | 20 20 7.2s test_basic_VariableIndex_LessThan | 20 20 2.7s test_basic_VariableIndex_Semicontinuous | 0 4.3s test_basic_VariableIndex_Semiinteger | 0 4.5s test_basic_VariableIndex_ZeroOne | 0 4.0s test_basic_VectorAffineFunction_AllDifferent | 0 11.5s test_basic_VectorAffineFunction_BinPacking | 0 10.2s test_basic_VectorAffineFunction_Circuit | 0 9.7s test_basic_VectorAffineFunction_Complements | 0 9.1s test_basic_VectorAffineFunction_CountAtLeast | 0 10.7s test_basic_VectorAffineFunction_CountBelongs | 0 8.1s test_basic_VectorAffineFunction_CountDistinct | 0 8.0s test_basic_VectorAffineFunction_CountGreaterThan | 0 9.3s test_basic_VectorAffineFunction_Cumulative | 0 9.1s test_basic_VectorAffineFunction_DualExponentialCone | 24 24 7.9s test_basic_VectorAffineFunction_DualPowerCone | 24 24 7.8s test_basic_VectorAffineFunction_ExponentialCone | 24 24 7.5s test_basic_VectorAffineFunction_GeometricMeanCone | 24 24 2m41.0s test_basic_VectorAffineFunction_HermitianPositiveSemidefiniteConeTriangle | 24 24 11.9s test_basic_VectorAffineFunction_HyperRectangle | 24 24 11.4s test_basic_VectorAffineFunction_Indicator_GreaterThan | 0 8.4s test_basic_VectorAffineFunction_Indicator_LessThan | 0 7.7s test_basic_VectorAffineFunction_LogDetConeSquare | 24 24 18.6s test_basic_VectorAffineFunction_LogDetConeTriangle | 24 24 6.1s test_basic_VectorAffineFunction_Nonnegatives | 24 24 4.9s test_basic_VectorAffineFunction_Nonpositives | 24 24 8.8s test_basic_VectorAffineFunction_NormCone | 24 24 9.3s test_basic_VectorAffineFunction_NormInfinityCone | 24 24 12.0s test_basic_VectorAffineFunction_NormNuclearCone | 24 24 8.7s test_basic_VectorAffineFunction_NormOneCone | 24 24 11.5s test_basic_VectorAffineFunction_NormSpectralCone | 24 24 8.5s test_basic_VectorAffineFunction_Path | 0 10.2s test_basic_VectorAffineFunction_PositiveSemidefiniteConeSquare | 24 24 11.1s test_basic_VectorAffineFunction_PositiveSemidefiniteConeTriangle | 24 24 5.8s test_basic_VectorAffineFunction_PowerCone | 24 24 5.2s test_basic_VectorAffineFunction_RelativeEntropyCone | 24 24 9.3s test_basic_VectorAffineFunction_RootDetConeSquare | 24 24 18.4s test_basic_VectorAffineFunction_RootDetConeTriangle | 24 24 5.7s test_basic_VectorAffineFunction_RotatedSecondOrderCone | 24 24 5.8s test_basic_VectorAffineFunction_SOS1 | 0 10.1s test_basic_VectorAffineFunction_SOS2 | 0 10.2s test_basic_VectorAffineFunction_ScaledPositiveSemidefiniteConeTriangle | 24 24 5.8s test_basic_VectorAffineFunction_SecondOrderCone | 24 24 5.1s test_basic_VectorAffineFunction_Table | 0 9.7s test_basic_VectorAffineFunction_Zeros | 24 24 4.7s test_basic_VectorNonlinearFunction_AllDifferent | 0 9.5s test_basic_VectorNonlinearFunction_BinPacking | 0 8.1s test_basic_VectorNonlinearFunction_Circuit | 0 8.0s test_basic_VectorNonlinearFunction_Complements | 0 7.9s test_basic_VectorNonlinearFunction_CountAtLeast | 0 8.3s test_basic_VectorNonlinearFunction_CountBelongs | 0 8.6s test_basic_VectorNonlinearFunction_CountDistinct | 0 8.3s test_basic_VectorNonlinearFunction_CountGreaterThan | 0 8.4s test_basic_VectorNonlinearFunction_Cumulative | 0 8.2s test_basic_VectorNonlinearFunction_DualExponentialCone | 0 9.1s test_basic_VectorNonlinearFunction_DualPowerCone | 0 8.9s test_basic_VectorNonlinearFunction_ExponentialCone | 0 8.1s test_basic_VectorNonlinearFunction_GeometricMeanCone | 0 11.8s test_basic_VectorNonlinearFunction_HermitianPositiveSemidefiniteConeTriangle | 0 8.9s test_basic_VectorNonlinearFunction_HyperRectangle | 0 9.1s test_basic_VectorNonlinearFunction_LogDetConeSquare | 0 9.5s test_basic_VectorNonlinearFunction_LogDetConeTriangle | 0 8.2s test_basic_VectorNonlinearFunction_Nonnegatives | 0 8.0s test_basic_VectorNonlinearFunction_Nonpositives | 0 8.1s test_basic_VectorNonlinearFunction_NormCone | 0 8.2s test_basic_VectorNonlinearFunction_NormInfinityCone | 0 8.2s test_basic_VectorNonlinearFunction_NormNuclearCone | 0 7.5s test_basic_VectorNonlinearFunction_NormOneCone | 0 5.8s test_basic_VectorNonlinearFunction_NormSpectralCone | 0 6.2s test_basic_VectorNonlinearFunction_Path | 0 6.0s test_basic_VectorNonlinearFunction_PositiveSemidefiniteConeSquare | 0 5.7s test_basic_VectorNonlinearFunction_PositiveSemidefiniteConeTriangle | 0 5.6s test_basic_VectorNonlinearFunction_PowerCone | 0 5.4s test_basic_VectorNonlinearFunction_RelativeEntropyCone | 0 5.9s test_basic_VectorNonlinearFunction_RootDetConeSquare | 0 8.8s test_basic_VectorNonlinearFunction_RootDetConeTriangle | 0 7.6s test_basic_VectorNonlinearFunction_RotatedSecondOrderCone | 0 8.5s test_basic_VectorNonlinearFunction_SOS1 | 0 7.7s test_basic_VectorNonlinearFunction_SOS2 | 0 7.5s test_basic_VectorNonlinearFunction_ScaledPositiveSemidefiniteConeTriangle | 0 7.5s test_basic_VectorNonlinearFunction_SecondOrderCone | 0 7.4s test_basic_VectorNonlinearFunction_Table | 0 7.7s test_basic_VectorNonlinearFunction_Zeros | 0 7.2s test_basic_VectorOfVariables_AllDifferent | 0 5.7s test_basic_VectorOfVariables_BinPacking | 0 5.7s test_basic_VectorOfVariables_Circuit | 0 5.8s test_basic_VectorOfVariables_Complements | 0 5.1s test_basic_VectorOfVariables_CountAtLeast | 0 5.9s test_basic_VectorOfVariables_CountBelongs | 0 6.0s test_basic_VectorOfVariables_CountDistinct | 0 5.9s test_basic_VectorOfVariables_CountGreaterThan | 0 6.1s test_basic_VectorOfVariables_Cumulative | 0 6.1s test_basic_VectorOfVariables_DualExponentialCone | 20 20 7.4s test_basic_VectorOfVariables_DualPowerCone | 20 20 9.2s test_basic_VectorOfVariables_ExponentialCone | 20 20 6.8s test_basic_VectorOfVariables_GeometricMeanCone | 20 20 8.9s test_basic_VectorOfVariables_HermitianPositiveSemidefiniteConeTriangle | 20 20 7.2s test_basic_VectorOfVariables_HyperRectangle | 20 20 7.8s test_basic_VectorOfVariables_LogDetConeSquare | 20 20 11.9s test_basic_VectorOfVariables_LogDetConeTriangle | 20 20 3.1s test_basic_VectorOfVariables_Nonnegatives | 20 20 3.7s test_basic_VectorOfVariables_Nonpositives | 20 20 6.1s test_basic_VectorOfVariables_NormCone | 20 20 12.0s test_basic_VectorOfVariables_NormInfinityCone | 20 20 7.5s test_basic_VectorOfVariables_NormNuclearCone | 20 20 7.2s test_basic_VectorOfVariables_NormOneCone | 20 20 8.0s test_basic_VectorOfVariables_NormSpectralCone | 20 20 6.7s test_basic_VectorOfVariables_Path | 0 6.9s test_basic_VectorOfVariables_PositiveSemidefiniteConeSquare | 20 20 7.5s test_basic_VectorOfVariables_PositiveSemidefiniteConeTriangle | 20 20 2.4s test_basic_VectorOfVariables_PowerCone | 20 20 3.8s test_basic_VectorOfVariables_RelativeEntropyCone | 20 20 8.7s test_basic_VectorOfVariables_RootDetConeSquare | 20 20 11.3s test_basic_VectorOfVariables_RootDetConeTriangle | 20 20 3.8s test_basic_VectorOfVariables_RotatedSecondOrderCone | 20 20 5.3s test_basic_VectorOfVariables_SOS1 | 0 5.0s test_basic_VectorOfVariables_SOS2 | 0 6.2s test_basic_VectorOfVariables_ScaledPositiveSemidefiniteConeTriangle | 20 20 11.6s test_basic_VectorOfVariables_SecondOrderCone | 20 20 6.8s test_basic_VectorOfVariables_Table | 0 6.4s test_basic_VectorOfVariables_Zeros | 20 20 6.0s test_basic_VectorQuadraticFunction_AllDifferent | 0 7.7s test_basic_VectorQuadraticFunction_BinPacking | 0 6.2s test_basic_VectorQuadraticFunction_Circuit | 0 5.7s test_basic_VectorQuadraticFunction_Complements | 0 7.6s test_basic_VectorQuadraticFunction_CountAtLeast | 0 8.6s test_basic_VectorQuadraticFunction_CountBelongs | 0 8.3s test_basic_VectorQuadraticFunction_CountDistinct | 0 8.3s test_basic_VectorQuadraticFunction_CountGreaterThan | 0 8.3s test_basic_VectorQuadraticFunction_Cumulative | 0 8.5s test_basic_VectorQuadraticFunction_DualExponentialCone | 1 1 10.2s test_basic_VectorQuadraticFunction_DualPowerCone | 1 1 9.0s test_basic_VectorQuadraticFunction_ExponentialCone | 1 1 8.7s test_basic_VectorQuadraticFunction_GeometricMeanCone | 1 1 11.2s test_basic_VectorQuadraticFunction_HermitianPositiveSemidefiniteConeTriangle | 1 1 10.1s test_basic_VectorQuadraticFunction_HyperRectangle | 1 1 10.2s test_basic_VectorQuadraticFunction_LogDetConeSquare | 1 1 8.9s test_basic_VectorQuadraticFunction_LogDetConeTriangle | 1 1 9.1s test_basic_VectorQuadraticFunction_Nonnegatives | 1 1 7.6s test_basic_VectorQuadraticFunction_Nonpositives | 24 24 11.6s test_basic_VectorQuadraticFunction_NormCone | 1 1 8.7s test_basic_VectorQuadraticFunction_NormInfinityCone | 1 1 7.2s test_basic_VectorQuadraticFunction_NormNuclearCone | 1 1 9.1s test_basic_VectorQuadraticFunction_NormOneCone | 1 1 8.7s test_basic_VectorQuadraticFunction_NormSpectralCone | 1 1 8.3s test_basic_VectorQuadraticFunction_Path | 0 8.4s test_basic_VectorQuadraticFunction_PositiveSemidefiniteConeSquare | 1 1 8.8s test_basic_VectorQuadraticFunction_PositiveSemidefiniteConeTriangle | 1 1 7.4s test_basic_VectorQuadraticFunction_PowerCone | 1 1 6.6s test_basic_VectorQuadraticFunction_RelativeEntropyCone | 1 1 9.1s test_basic_VectorQuadraticFunction_RootDetConeSquare | 1 1 8.9s test_basic_VectorQuadraticFunction_RootDetConeTriangle | 1 1 9.3s test_basic_VectorQuadraticFunction_RotatedSecondOrderCone | 1 1 9.0s test_basic_VectorQuadraticFunction_SOS1 | 0 8.5s test_basic_VectorQuadraticFunction_SOS2 | 0 7.7s test_basic_VectorQuadraticFunction_ScaledPositiveSemidefiniteConeTriangle | 1 1 8.8s test_basic_VectorQuadraticFunction_SecondOrderCone | 1 1 8.6s test_basic_VectorQuadraticFunction_Table | 0 8.2s test_basic_VectorQuadraticFunction_Zeros | 1 1 7.3s test_conic_DualExponentialCone_VectorAffineFunction | 19 19 11.1s test_conic_DualExponentialCone_VectorOfVariables | 19 19 0.0s test_conic_DualPowerCone_VectorAffineFunction | 18 18 3.0s test_conic_DualPowerCone_VectorOfVariables | 18 18 0.0s test_conic_Exponential_VectorAffineFunction | 16 16 3.0s test_conic_Exponential_VectorOfVariables | 16 16 0.0s test_conic_Exponential_hard | 16 16 3.2s test_conic_Exponential_hard_2 | 22 22 5.7s test_conic_GeometricMeanCone_VectorAffineFunction | 12 12 3.9s test_conic_GeometricMeanCone_VectorAffineFunction_2 | 13 13 2.3s test_conic_GeometricMeanCone_VectorAffineFunction_3 | 13 13 2.0s test_conic_GeometricMeanCone_VectorOfVariables | 12 12 2.6s test_conic_GeometricMeanCone_VectorOfVariables_2 | 13 13 0.0s test_conic_GeometricMeanCone_VectorOfVariables_3 | 13 13 0.2s test_conic_HermitianPositiveSemidefiniteConeTriangle_1 | 8 8 4.4s test_conic_LogDetConeSquare | 11 11 2.7s test_conic_LogDetConeSquare_VectorAffineFunction | 22 22 4.3s test_conic_LogDetConeSquare_VectorOfVariables | 22 22 1.3s test_conic_LogDetConeTriangle | 11 11 0.7s test_conic_LogDetConeTriangle_VectorAffineFunction | 21 21 1.8s test_conic_LogDetConeTriangle_VectorOfVariables | 21 21 0.0s test_conic_NormCone | 1 1 0.9s test_conic_NormInfinityCone_3 | 18 18 2.6s test_conic_NormInfinityCone_INFEASIBLE | 6 6 0.6s test_conic_NormInfinityCone_VectorAffineFunction | 20 20 2.3s test_conic_NormInfinityCone_VectorOfVariables | 20 20 0.4s test_conic_NormNuclearCone | 10 10 2.5s test_conic_NormNuclearCone_2 | 10 10 0.8s test_conic_NormOneCone | 17 17 2.3s test_conic_NormOneCone_INFEASIBLE | 6 6 0.5s test_conic_NormOneCone_VectorAffineFunction | 20 20 2.4s test_conic_NormOneCone_VectorOfVariables | 20 20 0.1s test_conic_NormSpectralCone | 10 10 1.9s test_conic_NormSpectralCone_2 | 10 10 0.8s test_conic_PositiveSemidefiniteConeSquare_3 | 7 7 1.7s test_conic_PositiveSemidefiniteConeSquare_VectorAffineFunction | 13 13 1.9s test_conic_PositiveSemidefiniteConeSquare_VectorAffineFunction_2 | 21 21 3.9s test_conic_PositiveSemidefiniteConeSquare_VectorOfVariables | 13 13 0.9s test_conic_PositiveSemidefiniteConeSquare_VectorOfVariables_2 | 21 21 0.0s test_conic_PositiveSemidefiniteConeTriangle | 17 17 3.7s test_conic_PositiveSemidefiniteConeTriangle_3 | 7 7 0.8s test_conic_PositiveSemidefiniteConeTriangle_4 | 10 10 2.1s test_conic_PositiveSemidefiniteConeTriangle_VectorAffineFunction | 13 13 1.2s test_conic_PositiveSemidefiniteConeTriangle_VectorAffineFunction_2 | 21 21 3.1s test_conic_PositiveSemidefiniteConeTriangle_VectorOfVariables | 13 13 0.0s test_conic_PositiveSemidefiniteConeTriangle_VectorOfVariables_2 | 21 21 0.0s test_conic_PowerCone_VectorAffineFunction | 15 15 1.6s test_conic_PowerCone_VectorOfVariables | 15 15 0.0s test_conic_RelativeEntropyCone | 10 10 1.4s test_conic_RootDetConeSquare | 10 10 2.2s test_conic_RootDetConeSquare_VectorAffineFunction | 18 18 2.4s test_conic_RootDetConeSquare_VectorOfVariables | 18 18 1.0s test_conic_RootDetConeTriangle | 10 10 0.8s test_conic_RootDetConeTriangle_VectorAffineFunction | 17 17 1.6s test_conic_RootDetConeTriangle_VectorOfVariables | 17 17 0.0s test_conic_RotatedSecondOrderCone_INFEASIBLE | 14 14 2.4s test_conic_RotatedSecondOrderCone_INFEASIBLE_2 | 34 34 5.4s test_conic_RotatedSecondOrderCone_VectorAffineFunction | 12 12 2.9s test_conic_RotatedSecondOrderCone_VectorOfVariables | 20 20 0.1s test_conic_RotatedSecondOrderCone_out_of_order | 14 14 1.0s test_conic_ScaledPositiveSemidefiniteConeTriangle_VectorAffineFunction | 13 13 1.1s test_conic_SecondOrderCone_INFEASIBLE | 6 6 0.6s test_conic_SecondOrderCone_Nonnegatives | 18 18 1.7s test_conic_SecondOrderCone_Nonpositives | 18 18 0.0s test_conic_SecondOrderCone_VectorAffineFunction | 18 18 1.7s test_conic_SecondOrderCone_VectorOfVariables | 18 18 0.0s test_conic_SecondOrderCone_negative_initial_bound | 2 2 1.3s test_conic_SecondOrderCone_negative_post_bound | 2 2 0.3s test_conic_SecondOrderCone_negative_post_bound_2 | 3 3 0.4s test_conic_SecondOrderCone_negative_post_bound_3 | 3 3 0.4s test_conic_SecondOrderCone_no_initial_bound | 2 2 0.3s test_conic_SecondOrderCone_nonnegative_initial_bound | 2 2 0.3s test_conic_SecondOrderCone_nonnegative_post_bound | 2 2 0.6s test_conic_SecondOrderCone_out_of_order | 13 13 1.5s test_conic_empty_matrix | 1 1 0.1s test_conic_linear_INFEASIBLE | 4 4 0.3s test_conic_linear_INFEASIBLE_2 | 4 4 0.3s test_conic_linear_VectorAffineFunction | 17 17 1.9s test_conic_linear_VectorAffineFunction_2 | 24 24 4.4s test_conic_linear_VectorOfVariables | 17 17 0.0s test_conic_linear_VectorOfVariables_2 | 24 24 0.1s test_constraint_ConstraintDualStart | 3 3 1.5s test_constraint_ConstraintPrimalStart | 3 3 1.1s test_constraint_Indicator_ACTIVATE_ON_ONE | 0 5.3s test_constraint_Indicator_ACTIVATE_ON_ZERO | 0 1.7s test_constraint_Indicator_ConstraintName | 0 0.2s test_constraint_PrimalStart_DualStart_SecondOrderCone | 8 8 2.5s test_constraint_ScalarAffineFunction_EqualTo | 8 8 0.9s test_constraint_ScalarAffineFunction_GreaterThan | 8 8 0.7s test_constraint_ScalarAffineFunction_Interval | 8 8 1.1s test_constraint_ScalarAffineFunction_LessThan | 8 8 0.7s test_constraint_ScalarAffineFunction_duplicate | 8 8 0.1s test_constraint_VectorAffineFunction_duplicate | 8 8 0.9s test_constraint_ZeroOne_bounds | 0 0.3s test_constraint_ZeroOne_bounds_2 | 0 0.1s test_constraint_ZeroOne_bounds_3 | 0 0.1s test_constraint_get_ConstraintIndex | 7 7 1.3s test_constraint_qcp_duplicate_diagonal | 7 7 0.6s test_constraint_qcp_duplicate_off_diagonal | 7 7 0.8s test_cpsat_AllDifferent | 0 1.4s test_cpsat_BinPacking | 0 1.6s test_cpsat_Circuit | 0 0.4s test_cpsat_CountAtLeast | 0 0.5s test_cpsat_CountBelongs | 0 0.6s test_cpsat_CountDistinct | 0 0.5s test_cpsat_CountGreaterThan | 0 0.5s test_cpsat_Cumulative | 0 1.6s test_cpsat_Path | 0 1.7s test_cpsat_ReifiedAllDifferent | 0 6.5s test_cpsat_Table | 0 0.4s test_infeasible_MAX_SENSE | 5 5 0.3s test_infeasible_MAX_SENSE_offset | 5 5 0.3s test_infeasible_MIN_SENSE | 5 5 0.3s test_infeasible_MIN_SENSE_offset | 5 5 0.3s test_infeasible_affine_MAX_SENSE | 5 5 0.3s test_infeasible_affine_MAX_SENSE_offset | 5 5 0.3s test_infeasible_affine_MIN_SENSE | 5 5 0.3s test_infeasible_affine_MIN_SENSE_offset | 5 5 0.3s test_linear_DUAL_INFEASIBLE | 5 5 0.8s test_linear_DUAL_INFEASIBLE_2 | 6 6 0.7s test_linear_FEASIBILITY_SENSE | 12 12 1.2s test_linear_HyperRectangle_VectorAffineFunction | 2 2 0.4s test_linear_HyperRectangle_VectorOfVariables | 2 2 0.8s test_linear_INFEASIBLE | 6 6 0.6s test_linear_INFEASIBLE_2 | 10 10 0.8s test_linear_Indicator_ON_ONE | 0 0.8s test_linear_Indicator_ON_ZERO | 0 2.0s test_linear_Indicator_constant_term | 0 0.9s test_linear_Indicator_integration | 0 0.9s test_linear_Interval_inactive | 12 12 1.8s test_linear_LessThan_and_GreaterThan | 16 16 2.5s test_linear_SOS1_integration | 0 2.3s test_linear_SOS2_integration | 0 3.3s test_linear_Semicontinuous_integration | 0 4.6s test_linear_Semiinteger_integration | 0 0.0s test_linear_VariablePrimalStart_partial | 5 5 0.6s test_linear_VectorAffineFunction | 16 16 1.8s test_linear_VectorAffineFunction_empty_row | 7 7 0.9s test_linear_complex_Zeros | 7 7 7.9s test_linear_complex_Zeros_duplicate | 7 7 0.6s test_linear_inactive_bounds | 20 20 2.5s test_linear_integer_integration | 0 2.0s test_linear_integer_knapsack | 0 1.7s test_linear_integer_solve_twice | 0 1.2s test_linear_integration | 110 110 33.9s test_linear_integration_2 | 18 18 1.7s test_linear_integration_Interval | 32 32 4.7s test_linear_integration_delete_variables | 33 33 5.8s test_linear_integration_modification | 22 22 3.1s test_linear_modify_GreaterThan_and_LessThan_constraints | 28 28 2.1s test_linear_open_intervals | 1 1 0.3s test_linear_transform | 10 10 1.1s test_linear_variable_open_intervals | 1 1 0.2s test_model_ListOfConstraintAttributesSet | 2 2 1.3s test_model_ListOfConstraintsWithAttributeSet | 1 1 0.7s test_model_ListOfVariablesWithAttributeSet | 1 1 0.3s test_model_LowerBoundAlreadySet | 4 4 0.4s test_model_ModelFilter_AbstractModelAttribute | 1 1 3.5s test_model_ModelFilter_AbstractVariableAttribute | 2 2 1.7s test_model_ModelFilter_ListOfConstraintIndices | 10 10 2.2s test_model_ModelFilter_ListOfConstraintTypesPresent | 3 3 2.7s test_model_Name | 7 7 0.2s test_model_Name_VariableName_ConstraintName | 72 72 10.3s test_model_ScalarAffineFunction_ConstraintName | 5 5 0.2s test_model_ScalarFunctionConstantNotZero | 2 2 0.2s test_model_UpperBoundAlreadySet | 4 4 0.3s test_model_VariableIndex_ConstraintName | 1 1 0.0s test_model_VariableName | 6 6 0.3s test_model_VariablePrimalStart | 3 3 0.3s test_model_add_constrained_variable_tuple | 6 6 0.3s test_model_copy_to_UnsupportedAttribute | 6 6 6.8s test_model_copy_to_UnsupportedConstraint | 2 2 6.8s test_model_default_DualStatus | 1 1 0.1s test_model_default_ObjectiveSense | 1 1 0.0s test_model_default_PrimalStatus | 1 1 0.1s test_model_default_TerminationStatus | 1 1 0.0s test_model_delete | 64 64 5.5s test_model_duplicate_ScalarAffineFunction_ConstraintName | 6 6 0.7s test_model_duplicate_VariableName | 6 6 0.4s test_model_empty | 3 3 0.1s test_model_is_valid | 9 9 1.3s test_model_ordered_indices | 12 12 0.5s test_model_show | 1 1 3.4s test_model_supports_constraint_ScalarAffineFunction_EqualTo | 1 1 0.4s test_model_supports_constraint_VariableIndex_EqualTo | 2 2 3.7s test_model_supports_constraint_VectorOfVariables_Nonnegatives | 2 2 3.0s test_modification_affine_deletion_edge_cases | 24 24 1.0s test_modification_coef_scalar_objective | 8 8 0.0s test_modification_coef_scalaraffine_lessthan | 16 16 0.1s test_modification_const_scalar_objective | 8 8 0.3s test_modification_const_vectoraffine_nonpos | 14 14 0.4s test_modification_const_vectoraffine_zeros | 14 14 0.7s test_modification_constraint_scalarquadraticcoefficientchange | 1 1 1.6s test_modification_delete_variable_with_single_variable_obj | 8 8 0.4s test_modification_delete_variables_in_a_batch | 8 8 0.4s test_modification_func_scalaraffine_lessthan | 8 8 1.7s test_modification_func_vectoraffine_nonneg | 15 15 1.7s test_modification_incorrect | 2 2 0.2s test_modification_incorrect_VariableIndex | 3 3 0.2s test_modification_mathoptinterface_issue_2452 | 3 3 0.6s test_modification_multirow_vectoraffine_nonpos | 12 12 0.5s test_modification_objective_scalarquadraticcoefficientchange | 5 5 2.5s test_modification_set_function_single_variable | 1 1 0.1s test_modification_set_scalaraffine_lessthan | 17 17 0.1s test_modification_set_singlevariable_lessthan | 17 17 1.0s test_modification_transform_singlevariable_lessthan | 18 18 0.3s test_multiobjective_vector_affine_function | 0 1.1s test_multiobjective_vector_affine_function_delete | 0 0.4s test_multiobjective_vector_affine_function_delete_vector | 0 0.2s test_multiobjective_vector_affine_function_modify | 0 0.7s test_multiobjective_vector_nonlinear | 0 1.7s test_multiobjective_vector_nonlinear_delete | 0 0.4s test_multiobjective_vector_nonlinear_delete_vector | 0 0.4s test_multiobjective_vector_nonlinear_modify | 0 0.8s test_multiobjective_vector_of_variables | 0 0.1s test_multiobjective_vector_of_variables_delete | 0 0.1s test_multiobjective_vector_of_variables_delete_all | 0 0.2s test_multiobjective_vector_of_variables_delete_vector | 0 0.2s test_multiobjective_vector_quadratic_function | 0 2.4s test_multiobjective_vector_quadratic_function_delete | 0 0.5s test_multiobjective_vector_quadratic_function_delete_vector | 0 0.3s test_multiobjective_vector_quadratic_function_modify | 0 0.7s test_nonlinear_Feasibility_internal | 8 1 9 9.0s test_nonlinear_HS071_internal | 11 11 1.5s test_nonlinear_InvalidEvaluator_internal | 3 3 0.2s test_nonlinear_constraint_log | 0 0.3s test_nonlinear_constraint_scalar_affine_function | 0 0.1s test_nonlinear_constraint_uminus | 0 0.1s test_nonlinear_duals | 0 14.3s test_nonlinear_expression_hs071 | 0 0.4s test_nonlinear_expression_hs071_epigraph | 0 0.4s test_nonlinear_expression_hs109 | 0 0.4s test_nonlinear_expression_hs110 | 0 0.3s test_nonlinear_expression_multivariate_function | 0 0.5s test_nonlinear_expression_overrides_objective | 0 0.7s test_nonlinear_expression_quartic | 0 0.3s test_nonlinear_expression_univariate_function | 0 0.2s test_nonlinear_hs071 | 0 1.5s test_nonlinear_hs071_NLPBlockDual | 0 1.8s test_nonlinear_hs071_hessian_vector_product | 0 0.0s test_nonlinear_hs071_no_hessian | 0 0.0s test_nonlinear_invalid | 0 0.1s test_nonlinear_mixed_complementarity | 0 0.9s test_nonlinear_objective | 0 0.5s test_nonlinear_objective_and_moi_objective_test | 0 0.5s test_nonlinear_qp_complementarity_constraint | 0 2.9s test_nonlinear_quadratic_1 | 0 0.4s test_nonlinear_quadratic_2 | 0 0.4s test_nonlinear_quadratic_3 | 0 0.3s test_nonlinear_quadratic_4 | 0 0.4s test_nonlinear_vector_complements | 0 2.2s test_nonlinear_with_scalar_quadratic_function_with_off_diag | 0 0.3s test_nonlinear_without_objective | 0 0.5s test_objective_FEASIBILITY_SENSE_clears_objective | 2 2 0.2s test_objective_ObjectiveFunction_VariableIndex | 10 10 0.2s test_objective_ObjectiveFunction_constant | 8 8 0.1s test_objective_ObjectiveFunction_duplicate_terms | 9 9 0.3s test_objective_ObjectiveSense_FEASIBILITY_SENSE | 1 1 0.0s test_objective_ObjectiveSense_MAX_SENSE | 1 1 0.0s test_objective_ObjectiveSense_MIN_SENSE | 1 1 0.0s test_objective_ObjectiveSense_in_ListOfModelAttributesSet | 2 2 0.1s test_objective_ScalarAffineFunction_in_ListOfModelAttributesSet | 2 2 0.2s test_objective_ScalarQuadraticFunction_in_ListOfModelAttributesSet | 2 2 0.2s test_objective_VariableIndex_in_ListOfModelAttributesSet | 2 2 0.2s test_objective_get_ObjectiveFunction_ScalarAffineFunction | 5 5 0.3s test_objective_qp_ObjectiveFunction_edge_cases | 21 21 1.4s test_objective_qp_ObjectiveFunction_zero_ofdiag | 7 7 0.4s test_objective_set_via_modify | 2 2 0.4s test_quadratic_Integer_SecondOrderCone | 0 1.0s test_quadratic_SecondOrderCone_basic | 2 2 2.1s test_quadratic_constraint_GreaterThan | 17 17 2.8s test_quadratic_constraint_LessThan | 17 17 0.0s test_quadratic_constraint_basic | 12 12 0.6s test_quadratic_constraint_integration | 15 15 1.9s test_quadratic_constraint_minimize | 13 13 0.7s test_quadratic_duplicate_terms | 24 24 3.6s test_quadratic_integration | 15 15 1.9s test_quadratic_nonconvex_constraint_basic | 3 3 1.0s test_quadratic_nonconvex_constraint_integration | 3 3 1.0s test_quadratic_nonhomogeneous | 23 23 2.5s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_EqualTo_lower | 5 5 1.6s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_EqualTo_upper | 5 5 0.6s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_GreaterThan | 5 5 0.6s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_Interval_lower | 5 5 0.6s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_Interval_upper | 5 5 0.6s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_LessThan | 5 5 0.6s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_VariableIndex_LessThan | 5 5 1.0s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_VariableIndex_LessThan_max | 5 5 0.8s test_solve_ObjectiveBound_MAX_SENSE_IP | 0 0.1s test_solve_ObjectiveBound_MAX_SENSE_LP | 0 0.1s test_solve_ObjectiveBound_MIN_SENSE_IP | 0 0.1s test_solve_ObjectiveBound_MIN_SENSE_LP | 0 0.1s test_solve_SOS2_add_and_delete | 0 2.0s test_solve_VariableIndex_ConstraintDual_MAX_SENSE | 4 4 0.2s test_solve_VariableIndex_ConstraintDual_MIN_SENSE | 4 4 0.2s test_solve_conflict_EqualTo | 0 0.6s test_solve_conflict_NOT_IN_CONFLICT | 0 0.3s test_solve_conflict_affine_affine | 0 0.3s test_solve_conflict_bound_bound | 0 0.1s test_solve_conflict_feasible | 0 0.1s test_solve_conflict_invalid_interval | 0 0.1s test_solve_conflict_two_affine | 0 0.2s test_solve_conflict_zeroone | 0 0.1s test_solve_conflict_zeroone_2 | 0 0.1s test_solve_optimize_twice | 0 0.1s test_solve_result_index | 15 15 1.1s test_unbounded_MAX_SENSE | 4 4 0.2s test_unbounded_MAX_SENSE_offset | 4 4 0.2s test_unbounded_MIN_SENSE | 4 4 0.2s test_unbounded_MIN_SENSE_offset | 4 4 0.2s test_variable_VariableName | 4 4 0.1s test_variable_add_variable | 3 3 0.1s test_variable_add_variables | 2 2 0.0s test_variable_delete | 3 3 0.1s test_variable_delete_Nonnegatives | 13 13 0.5s test_variable_delete_Nonnegatives_row | 12 12 0.4s test_variable_delete_SecondOrderCone | 10 10 0.4s test_variable_delete_variables | 9 9 0.3s test_variable_get_VariableIndex | 2 2 0.1s test_variable_solve_Integer_with_lower_bound | 0 0.2s test_variable_solve_Integer_with_upper_bound | 0 0.0s test_variable_solve_ZeroOne_with_0_upper_bound | 0 0.0s test_variable_solve_ZeroOne_with_1_lower_bound | 0 0.0s test_variable_solve_ZeroOne_with_bounds_then_delete | 0 0.1s test_variable_solve_ZeroOne_with_upper_bound | 0 0.0s test_variable_solve_with_lowerbound | 10 10 0.7s test_variable_solve_with_upperbound | 12 12 0.1s RNG of the outermost testset: Random.Xoshiro(0xce7722911fe4485a, 0x353152d438107c17, 0x6f3877c701b8a9b2, 0x88cf097035fd8ecf, 0x57ceb4024a9ff4c2) ERROR: LoadError: Some tests did not pass: 3915 passed, 1 failed, 0 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/SCS/p6kNH/test/MOI_wrapper.jl:346 in expression starting at /home/pkgeval/.julia/packages/SCS/p6kNH/test/runtests.jl:42 Testing failed after 2330.87s ERROR: LoadError: Package SCS 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:2423 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2278 [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:500 [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:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:151 [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:324 [12] _start() @ Base ./client.jl:557 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 2378.9s: package has test failures