Package evaluation of HiGHS on Julia 1.10.8 (92f03a4775*) started at 2025-02-25T08:18:42.638 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 5.12s ################################################################################ # Installation # Installing HiGHS... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [87dc4568] + HiGHS v1.13.0 Updating `~/.julia/environments/v1.10/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.16.0 [864edb3b] + DataStructures v0.18.20 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.3 [f6369f11] + ForwardDiff v0.10.38 [87dc4568] + HiGHS v1.13.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.1 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.15 [b8f27783] + MathOptInterface v1.37.0 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.2 [bac558e1] + OrderedCollections v1.8.0 [69de0a69] + Parsers v2.8.1 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [276daf66] + SpecialFunctions v2.5.0 [1e83bf80] + StaticArraysCore v1.4.3 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [8fd58aa0] + HiGHS_jll v1.9.0+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [b77e0a4c] + InteractiveUtils [76f85450] + LibGit2 [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [a63ad114] + Mmap [ca575930] + NetworkOptions v1.2.0 [de0858da] + Printf [9abbd945] + Profile [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [e37daf67] + LibGit2_jll v1.6.4+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.2+1 [4536629a] + OpenBLAS_jll v0.3.23+4 [05823500] + OpenLibm_jll v0.8.1+4 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 Installation completed after 5.79s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 10.09s ################################################################################ # Testing # Testing HiGHS Status `/tmp/jl_1Gh7eA/Project.toml` [87dc4568] HiGHS v1.13.0 [b8f27783] MathOptInterface v1.37.0 [aea7be01] PrecompileTools v1.2.1 [8fd58aa0] HiGHS_jll v1.9.0+0 [2f01184e] SparseArrays v1.10.0 [8dfed614] Test Status `/tmp/jl_1Gh7eA/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.16.0 [864edb3b] DataStructures v0.18.20 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.3 [f6369f11] ForwardDiff v0.10.38 [87dc4568] HiGHS v1.13.0 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.15 [b8f27783] MathOptInterface v1.37.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.2 [bac558e1] OrderedCollections v1.8.0 [69de0a69] Parsers v2.8.1 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [276daf66] SpecialFunctions v2.5.0 [1e83bf80] StaticArraysCore v1.4.3 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.9.0+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [b77e0a4c] InteractiveUtils [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [ca575930] NetworkOptions v1.2.0 [de0858da] Printf [9abbd945] Profile [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [fa267f1f] TOML v1.0.3 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.2+1 [4536629a] OpenBLAS_jll v0.3.23+4 [05823500] OpenLibm_jll v0.8.1+4 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 Testing Running tests... Test Summary: | Pass Total Time C_wrapper.jl | 5 5 7.7s Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [6e-03, 9e-01] Cost [3e-02, 1e+00] Bound [1e+00, 1e+00] RHS [1e+01, 1e+01] Presolve is switched off Solving MIP model with: 1 rows 30 cols (30 binary, 0 integer, 0 implied int., 0 continuous) 30 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time z 0 0 0 0.00% inf -0 Large 0 -1 0 0 0.0s S 0 0 0 0.00% 14.00521786 12.99744733 7.75% 0 0 0 0 0.0s 0 0 0 0.00% 13.03000195 12.99744733 0.25% 0 0 2 1 0.0s 1 0 1 100.00% 12.99744733 12.99744733 0.00% 0 0 2 2 0.0s Solving report Status Optimal Primal bound 12.997447327 Dual bound 12.997447327 Gap 0% (tolerance: 0.01%) P-D integral 1.02243967296e-05 Solution status feasible 12.997447327 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 2 (total) 0 (strong br.) 1 (separation) 0 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [6e-03, 9e-01] Cost [3e-02, 1e+00] Bound [1e+00, 1e+00] RHS [1e+01, 1e+01] Presolve is switched off Solving MIP model with: 1 rows 30 cols (30 binary, 0 integer, 0 implied int., 0 continuous) 30 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time z 0 0 0 0.00% inf -0 Large 0 -1 0 0 0.0s S 0 0 0 0.00% 14.00521786 12.99744733 7.75% 0 0 0 0 0.0s 0 0 0 0.00% 13.03000195 12.99744733 0.25% 0 0 2 1 0.0s 1 0 1 100.00% 12.99744733 12.99744733 0.00% 0 0 2 2 0.0s Solving report Status Optimal Primal bound 12.997447327 Dual bound 12.997447327 Gap 0% (tolerance: 0.01%) P-D integral 2.80714916781e-05 Solution status feasible 12.997447327 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 2 (total) 0 (strong br.) 1 (separation) 0 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [6e-03, 9e-01] Cost [3e-02, 1e+00] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -3.3980362463e+04 Ph1: 1(56658.9); Du: 30(33.9804) 0s 1 -2.8455973556e+04 Ph1: 0(0); Du: 29(28.456) 0s 1 4.9637402488e+00 Pr: 0(0); Du: 29(28.456) 0s Using EKK primal simplex solver Iteration Objective Infeasibilities num(sum) 1 4.9637414054e+00 Pr: 0(0); Du: 29(9.18179) 0s 1 4.9637402488e+00 Pr: 0(0); Du: 29(9.18179) 0s Model status : Unbounded Simplex iterations: 1 Objective value : 4.9637402488e+00 Relative P-D gap : 1.4003020712e+00 HiGHS run time : 0.00 Solving linear system to compute primal ray Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [3e-02, 1e+00] Cost [2e-02, 1e+00] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Solving LP without presolve, or with basis, or unconstrained IPX model has 1 rows, 30 columns and 30 nonzeros Input Number of variables: 30 Number of free variables: 30 Number of constraints: 1 Number of equality constraints: 0 Number of matrix entries: 30 Matrix range: [3e-02, 1e+00] RHS range: [1e+01, 1e+01] Objective range: [2e-02, 1e+00] Bounds range: [0e+00, 0e+00] Preprocessing Dualized model: no Number of dense columns: 0 Range of scaling factors: [1.00e+00, 1.60e+01] IPX version 1.0 Interior point solve Iter P.res D.res P.obj D.obj mu Time 0 1.69e+00 1.28e+01 -2.57323959e+01 -2.57323959e+01 1.06e+01 0s 1 1.69e-06 1.27e+01 -1.96751995e+02 -2.70272416e+01 1.25e+00 0s 2 1.69e-12 1.27e+01 -5.02007739e+02 -2.67633929e+01 2.46e-04 0s 3 1.13e-11 1.27e+01 -1.54123148e+06 -2.70606805e+01 3.09e-08 0s 4 2.05e-07 1.27e+01 -1.22612979e+10 -2.70606808e+01 1.04e-05 0s 5 2.16e-07 1.27e+01 -1.22979327e+10 -2.70606808e+01 2.71e-30 0s 6 5.09e+89 3.34e+74 6.46753055e+105 -3.33848561e+75 7.98e+179 0s Constructing starting basis... Summary Runtime: 0.00s Status interior point solve: dual infeas Status crossover: not run WARNING: Ipx: IPM dual infeasible WARNING: Ipx: Crossover not run WARNING: LP solver residuals: primal = 5.09259e+89; dual = 3.33579e+74 yield num/max/sum primal (1/5.09259e+89/5.09259e+89) and dual (30/3.33579e+74/5.1833e+75) corrections WARNING: Unwelcome IPX status of Primal infeasible or unbounded: basis is not valid; solution is valid; run_crossover is "on" WARNING: IPX solution is imprecise, so clean up with simplex Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -4.5437299601e+04 Ph1: 1(42723.6); Du: 30(45.4373) 0s 1 -4.1232970101e+04 Ph1: 0(0); Du: 29(41.233) 0s 1 3.3822121369e+00 Pr: 0(0); Du: 29(41.233) 0s Using EKK primal simplex solver Iteration Objective Infeasibilities num(sum) 1 3.3822129250e+00 Pr: 0(0); Du: 29(12.8362) 0s 1 3.3822121369e+00 Pr: 0(0); Du: 29(12.8362) 0s Model status : Unbounded Simplex iterations: 1 IPM iterations: 6 Objective value : 3.3822121369e+00 Relative P-D gap : 3.3102057618e+00 HiGHS run time : 0.00 Solving linear system to compute primal ray Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained IPX model has 3 rows, 3 columns and 3 nonzeros Input Number of variables: 3 Number of free variables: 3 Number of constraints: 3 Number of equality constraints: 3 Number of matrix entries: 3 Matrix range: [1e+00, 1e+00] RHS range: [1e+00, 3e+00] Objective range: [1e+00, 1e+00] Bounds range: [0e+00, 0e+00] Preprocessing Dualized model: no Number of dense columns: 0 Range of scaling factors: [1.00e+00, 1.00e+00] IPX version 1.0 Interior point solve Iter P.res D.res P.obj D.obj mu Time Summary Runtime: 0.01s Status interior point solve: unknown Status crossover: not run WARNING: Ipx: Stopped WARNING: Ipx: IPM user interrupt WARNING: Ipx: Crossover not run WARNING: LP solver residuals: primal = 3; dual = 1 yield num/max/sum primal (3/3/6) and dual (3/1/3) corrections Model status : Interrupted by user Objective value : 0.0000000000e+00 Relative P-D gap : 3.0000000000e+00 HiGHS run time : 0.01 Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [5e-01, 2e+00] RHS [1e+00, 4e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-4); columns 0(-4); elements 0(-8) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 6.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms ERROR: Set supplied to Highs::deleteRows not ordered Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Iteration Objective NullspaceDim 0 1.0000001 1 0.00s 1 -0.12499997 1 0.00s Model status : Optimal QP ASM iterations: 1 Objective value : -1.2500000000e-01 HiGHS run time : 0.00 Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] Solving LP without presolve, or with basis, or unconstrained Solving an unconstrained LP with 1 columns Model status : Unbounded Objective value : 0.0000000000e+00 Relative P-D gap : 1.0000000000e+00 HiGHS run time : 0.00 WARNING: checkOptionValue: Value -1 for option "time_limit" is below lower bound of 0 Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Writing the model to /tmp/jl_45dd22/test.mps.gz WARNING: There are empty or excessively-long column names: using constructed names with prefix "c" Model has 1 zero columns with no costs: 1 have finite upper bounds or nonzero lower bounds and are written in MPS file Test Summary: | Pass Total Time MOI_wrapper.jl | 6191 6191 33m56.2s Test Summary: |Time runtests.jl | None 0.0s Testing HiGHS tests passed Testing completed after 2046.1s PkgEval succeeded after 2076.52s