Package evaluation of HiGHS on Julia 1.13.0-DEV.974 (7bbb213719*) started at 2025-08-12T16:32:24.477 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 10.01s ################################################################################ # Installation # Installing HiGHS... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [87dc4568] + HiGHS v1.19.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.18.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 [87dc4568] + HiGHS v1.19.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [8c4f8055] + MathOptIIS v0.1.1 [b8f27783] + MathOptInterface v1.42.1 [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.5.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 [8fd58aa0] + HiGHS_jll v1.11.0+1 [efe28fd5] + OpenSpecFun_jll v0.5.6+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.13.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.13.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 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 2.21s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 16.63s ################################################################################ # Testing # Testing HiGHS Status `/tmp/jl_ZLVnqJ/Project.toml` [87dc4568] HiGHS v1.19.0 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.42.1 [aea7be01] PrecompileTools v1.3.2 [8fd58aa0] HiGHS_jll v1.11.0+1 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_ZLVnqJ/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.18.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 [87dc4568] HiGHS v1.19.0 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.42.1 [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.5.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 [8fd58aa0] HiGHS_jll v1.11.0+1 [efe28fd5] OpenSpecFun_jll v0.5.6+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.13.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.13.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 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Test Summary: | Pass Total Time C_wrapper.jl | 5 5 14.7s Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 1 rows; 30 cols; 30 nonzeros; 30 integer variables (30 binary) Coefficient ranges: Matrix [2e-02, 1e+00] 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, 0 domain fixed) 30 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; 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 J 0 0 0 0.00% inf 0.9534182561 Large 0 0 0 0 0.1s S 0 0 0 0.00% 12.77360218 11.49480078 11.13% 0 0 0 0 0.1s 0 0 0 0.00% 11.68500997 11.49480078 1.65% 0 0 1 1 0.1s S 0 0 0 100.00% 11.68500997 11.669189 0.14% 2 1 1 1 0.1s 1 0 1 100.00% 11.669189 11.669189 0.00% 2 1 1 2 0.1s Solving report Status Optimal Primal bound 11.669189002 Dual bound 11.669189002 Gap 0% (tolerance: 0.01%) P-D integral 0.00888810633033 Solution status feasible 11.669189002 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.09 (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.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 1 rows; 30 cols; 30 nonzeros; 30 integer variables (30 binary) Coefficient ranges: Matrix [2e-02, 1e+00] 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, 0 domain fixed) 30 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; 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 J 0 0 0 0.00% inf 0.9534182561 Large 0 0 0 0 0.0s S 0 0 0 0.00% 12.77360218 11.49480078 11.13% 0 0 0 0 0.0s 0 0 0 0.00% 11.68500997 11.49480078 1.65% 0 0 1 1 0.0s S 0 0 0 100.00% 11.68500997 11.669189 0.14% 2 1 1 1 0.0s 1 0 1 100.00% 11.669189 11.669189 0.00% 2 1 1 2 0.0s Solving report Status Optimal Primal bound 11.669189002 Dual bound 11.669189002 Gap 0% (tolerance: 0.01%) P-D integral 0.00711395918306 Solution status feasible 11.669189002 (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.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 rows; 30 cols; 30 nonzeros Coefficient ranges: Matrix [2e-02, 1e+00] 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.8828369345e+04 Ph1: 1(44309); Du: 30(38.8284) 0s 1 -2.6423630283e+04 Ph1: 0(0); Du: 29(26.4236) 0s 1 5.7129563148e+00 Pr: 0(0); Du: 29(26.4236) 0s Using EKK primal simplex solver Iteration Objective Infeasibilities num(sum) 1 5.7129576460e+00 Pr: 0(0); Du: 29(7.48714) 0s 1 5.7129563148e+00 Pr: 0(0); Du: 29(7.48714) 0s WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 29 / 0.862 (relative 29 / 0.441) dual infeasibilities (tolerance = 1e-07) 1 / 0.269 P-D objective error (tolerance = 1e-07) Model status : Unbounded Simplex iterations: 1 Objective value : 5.7129563148e+00 P-D objective error : 2.6894942563e-01 HiGHS run time : 0.00 Solving linear system to compute primal ray Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 rows; 30 cols; 30 nonzeros Coefficient ranges: Matrix [9e-03, 1e+00] Cost [2e-02, 1e+00] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Not presolved: solving the LP 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: [9e-03, 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, 6.40e+01] Scaled cost norm: 28.7636 Scaled bounds norm: 10 IPX version 1.0 Interior point solve Iter P.res D.res P.obj D.obj mu Time 0 1.71e+00 2.76e+01 -2.13058309e+01 -2.13058309e+01 9.66e+00 0s 1 1.71e-06 2.75e+01 -4.35594551e+02 -2.25372463e+01 1.22e+00 0s 2 1.71e-12 2.75e+01 -1.07898852e+03 -2.21603492e+01 6.59e-04 0s 3 1.06e-13 2.75e+01 -1.19272589e+06 -2.25457734e+01 2.03e-07 0s 4 1.48e-08 2.75e+01 -3.86040020e+09 -2.25457739e+01 1.33e-08 0s 5 2.37e-07 2.75e+01 -6.27646554e+10 -2.25457739e+01 9.27e-06 0s 6 4.47e-08 2.75e+01 -6.28493124e+10 -2.25457739e+01 2.25e-30 0s 7 3.98e+87 2.92e+72 5.02787056e+103 -2.92608762e+73 6.53e+175 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: 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 -3.5229419437e+04 Ph1: 1(32964.5); Du: 30(35.2294) 0s 1 -2.7982570663e+04 Ph1: 0(0); Du: 29(27.9826) 0s 1 5.8322930419e+00 Pr: 0(0); Du: 29(27.9826) 0s Using EKK primal simplex solver Iteration Objective Infeasibilities num(sum) 1 5.8322944009e+00 Pr: 0(0); Du: 29(9.12947) 0s 1 5.8322930419e+00 Pr: 0(0); Du: 29(9.12947) 0s WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 29 / 0.834 (relative 29 / 0.418) dual infeasibilities (tolerance = 1e-07) 1 / 0.351 P-D objective error (tolerance = 1e-07) Model status : Unbounded Simplex iterations: 1 IPM iterations: 7 Objective value : 5.8322930419e+00 P-D objective error : 3.5053121875e-01 HiGHS run time : 0.00 Solving linear system to compute primal ray Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 3 rows; 3 cols; 3 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 3e+00] Not presolved: solving the LP 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] Scaled cost norm: 1 Scaled bounds norm: 3 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 solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 0 / 0 (relative 0 / 0) dual infeasibilities (tolerance = 1e-07) num/max 3 / 3 (relative 3 / 0.75) primal residual errors (tolerance = 1e-07) num/max 3 / 1 (relative 3 / 0.5) dual residual errors (tolerance = 1e-07) 0 / 0 P-D objective error (tolerance = 1e-07) Model status : Interrupted by user Objective value : 0.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.01 Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 3 rows; 3 cols; 3 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 3e+00] Not presolved: solving the LP 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] Scaled cost norm: 1 Scaled bounds norm: 3 IPX version 1.0 Interior point solve Iter P.res D.res P.obj D.obj mu Time Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 3 rows; 3 cols; 3 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 3e+00] Not presolved: solving the LP 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] Scaled cost norm: 1 Scaled bounds norm: 3 IPX version 1.0 Interior point solve Iter P.res D.res P.obj D.obj mu Time Summary Runtime: 0.02s Status interior point solve: unknown Status crossover: not run WARNING: Ipx: Stopped WARNING: Ipx: IPM user interrupt WARNING: Ipx: Crossover not run WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 0 / 0 (relative 0 / 0) dual infeasibilities (tolerance = 1e-07) num/max 3 / 3 (relative 3 / 0.75) primal residual errors (tolerance = 1e-07) num/max 3 / 1 (relative 3 / 0.5) dual residual errors (tolerance = 1e-07) 0 / 0 P-D objective error (tolerance = 1e-07) Model status : Interrupted by user Objective value : 0.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.02 Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 3 rows; 3 cols; 3 nonzeros; 3 integer variables (0 binary) Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 3e+00] Presolve is switched off Objective function is integral with scale 1 Solving MIP model with: 3 rows 3 cols (0 binary, 0 integer, 0 implied int., 0 continuous, 3 domain fixed) 3 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; 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 J 0 0 0 100.00% inf 6 Large 0 0 0 0 0.0s 1 0 1 100.00% 6 6 0.00% 0 0 0 0 0.0s Solving report Status Optimal Primal bound 6 Dual bound 6 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 6 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 2 (0 feasible; 0 iterations) LP iterations 0 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 4 rows; 4 cols; 8 nonzeros 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 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 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.11.0 (git hash: 364c83a51e): Copyright (c) 2025 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.11.0 (git hash: 364c83a51e): Copyright (c) 2025 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.11.0 (git hash: 364c83a51e): Copyright (c) 2025 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.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms ERROR: Set supplied to Highs::deleteRows not ordered Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms QP has 1 rows; 2 cols; 2 matrix nonzeros; 3 Hessian nonzeros 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 P-D objective error : 5.0000002018e-08 HiGHS run time : 0.00 Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 0 rows; 1 cols; 0 nonzeros 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 WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 1 / 1 (relative 1 / 0.5) dual infeasibilities (tolerance = 1e-07) 1 / 0.5 P-D objective error (tolerance = 1e-07) Model status : Unbounded Objective value : 0.0000000000e+00 P-D objective error : 5.0000000000e-01 HiGHS run time : 0.00 Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 1 rows; 1 cols; 1 nonzeros; 1 integer variables (1 binary) Coefficient ranges: Matrix [1e+00, 1e+00] Cost [0e+00, 0e+00] Bound [1e+00, 1e+00] RHS [5e-01, 5e-01] Presolving model Presolve: Infeasible Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; 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 0 0 0 0.00% -inf inf inf 0 0 0 0 0.0s Solving report Status Infeasible Primal bound inf Dual bound -inf Gap inf P-D integral 0 Solution status - Timing 0.00 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 0 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 0 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Solving LP to try to compute dual ray MIP has 1 rows; 1 cols; 1 nonzeros; 1 integer variables (1 binary) Coefficient ranges: Matrix [1e+00, 1e+00] Cost [0e+00, 0e+00] Bound [1e+00, 1e+00] RHS [5e-01, 5e-01] Solving LP relaxation since solve_relaxation is true Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 0.0000000000e+00 Pr: 1(0.5) 0s 1 0.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 1 Objective value : 0.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 No dual ray found WARNING: checkOptionValue: Value -1 for option "time_limit" is below lower bound of 0 Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 13 running 1 of 1 signal (10): User defined signal 1 _ZN12_GLOBAL__N_18Verifier16visitInstructionERN4llvm11InstructionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN12_GLOBAL__N_18Verifier6verifyERKN4llvm8FunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm14verifyFunctionERKNS_8FunctionEPNS_11raw_ostreamE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) verifyLLVMIR at /source/src/pipeline.cpp:888 runOnFunction at /source/src/llvm-alloc-opt.cpp:1338 [inlined] run at /source/src/llvm-alloc-opt.cpp:1348 run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm11PassManagerINS_8FunctionENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm26CGSCCToFunctionPassAdaptor3runERNS_13LazyCallGraph3SCCERNS_15AnalysisManagerIS2_JRS1_EEES5_RNS_17CGSCCUpdateResultE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm11PassManagerINS_13LazyCallGraph3SCCENS_15AnalysisManagerIS2_JRS1_EEEJS4_RNS_17CGSCCUpdateResultEEE3runERS2_RS5_S4_S7_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm33ModuleToPostOrderCGSCCPassAdaptor3runERNS_6ModuleERNS_15AnalysisManagerIS1_JEEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm11PassManagerINS_6ModuleENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/src/pipeline.cpp:791 operator() at /source/src/jitlayers.cpp:1510 withModuleDo<(anonymous namespace)::sizedOptimizerT::operator()(llvm::orc::ThreadSafeModule) [with long unsigned int N = 4]:: > at /source/usr/include/llvm/ExecutionEngine/Orc/ThreadSafeModule.h:136 [inlined] operator() at /source/src/jitlayers.cpp:1471 [inlined] operator() at /source/src/jitlayers.cpp:1623 [inlined] addModule at /source/src/jitlayers.cpp:2080 jl_compile_codeinst_now at /source/src/jitlayers.cpp:682 jl_compile_codeinst_impl at /source/src/jitlayers.cpp:873 jl_compile_method_internal at /source/src/gf.c:3527 _jl_invoke at /source/src/gf.c:4007 [inlined] ijl_apply_generic at /source/src/gf.c:4212 macro expansion at /home/pkgeval/.julia/packages/MathOptInterface/vK6dk/src/Test/Test.jl:270 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:1929 [inlined] #runtests#2 at /home/pkgeval/.julia/packages/MathOptInterface/vK6dk/src/Test/Test.jl:265 runtests at /home/pkgeval/.julia/packages/MathOptInterface/vK6dk/src/Test/Test.jl:223 [inlined] test_runtests_cache at /home/pkgeval/.julia/packages/HiGHS/umjNf/test/MOI_wrapper.jl:45 unknown function (ip: 0x79d481be12bf) at (unknown file) _jl_invoke at /source/src/gf.c:4015 [inlined] ijl_apply_generic at /source/src/gf.c:4212 macro expansion at /home/pkgeval/.julia/packages/HiGHS/umjNf/test/MOI_wrapper.jl:17 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:1929 [inlined] runtests at /home/pkgeval/.julia/packages/HiGHS/umjNf/test/MOI_wrapper.jl:17 unknown function (ip: 0x79d4aff3f86f) at (unknown file) _jl_invoke at /source/src/gf.c:4015 [inlined] ijl_apply_generic at /source/src/gf.c:4212 jl_apply at /source/src/julia.h:2375 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:708 jl_interpret_toplevel_thunk at /source/src/interpreter.c:899 jl_toplevel_eval_flex at /source/src/toplevel.c:773 jl_toplevel_eval_flex at /source/src/toplevel.c:713 ijl_toplevel_eval at /source/src/toplevel.c:785 ijl_toplevel_eval_in at /source/src/toplevel.c:830 eval at ./boot.jl:489 include_string at ./loading.jl:2847 _jl_invoke at /source/src/gf.c:4015 [inlined] ijl_apply_generic at /source/src/gf.c:4212 _include at ./loading.jl:2907 include at ./Base.jl:312 IncludeInto at ./Base.jl:313 jfptr_IncludeInto_74172.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4015 [inlined] ijl_apply_generic at /source/src/gf.c:4212 macro expansion at /home/pkgeval/.julia/packages/HiGHS/umjNf/test/runtests.jl:12 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:2018 [inlined] top-level scope at /home/pkgeval/.julia/packages/HiGHS/umjNf/test/runtests.jl:2041 _jl_invoke at /source/src/gf.c:4015 [inlined] ijl_invoke at /source/src/gf.c:4022 jl_toplevel_eval_flex at /source/src/toplevel.c:762 jl_toplevel_eval_flex at /source/src/toplevel.c:713 ijl_toplevel_eval at /source/src/toplevel.c:785 ijl_toplevel_eval_in at /source/src/toplevel.c:830 eval at ./boot.jl:489 include_string at ./loading.jl:2847 _jl_invoke at /source/src/gf.c:4015 [inlined] ijl_apply_generic at /source/src/gf.c:4212 _include at ./loading.jl:2907 include at ./Base.jl:312 IncludeInto at ./Base.jl:313 jfptr_IncludeInto_74172.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4015 [inlined] ijl_apply_generic at /source/src/gf.c:4212 jl_apply at /source/src/julia.h:2375 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:708 jl_interpret_toplevel_thunk at /source/src/interpreter.c:899 jl_toplevel_eval_flex at /source/src/toplevel.c:773 jl_toplevel_eval_flex at /source/src/toplevel.c:713 ijl_toplevel_eval at /source/src/toplevel.c:785 ijl_toplevel_eval_in at /source/src/toplevel.c:830 eval at ./boot.jl:489 exec_options at ./client.jl:286 _start at ./client.jl:553 jfptr__start_75359.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4015 [inlined] ijl_apply_generic at /source/src/gf.c:4212 jl_apply at /source/src/julia.h:2375 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x79d4b1b70249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1192 wait_forever at ./task.jl:1129 jfptr_wait_forever_70431.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4015 [inlined] ijl_apply_generic at /source/src/gf.c:4212 jl_apply at /source/src/julia.h:2375 [inlined] start_task at /source/src/task.c:1253 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.13/Profile/src/Profile.jl:1362 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000076e03bf0d2d0 Total snapshots: 431. Utilization: 0% ╎431 @Base/task.jl:1129 wait_forever() 430╎ 431 @Base/task.jl:1192 wait() PkgEval terminated after 2730.63s: test duration exceeded the time limit