Package evaluation to test HiGHS on Julia 1.14.0-DEV.1730 (9c1e1fa299*) started at 2026-02-19T17:22:32.539 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 9.0s ################################################################################ # Installation # Installing HiGHS... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [87dc4568] + HiGHS v1.21.1 Updating `~/.julia/environments/v1.14/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.3 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.3.2 [87dc4568] + HiGHS v1.21.1 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [8c4f8055] + MathOptIIS v0.1.2 [b8f27783] + MathOptInterface v1.49.0 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [276daf66] + SpecialFunctions v2.7.1 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.6.3 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [8fd58aa0] + HiGHS_jll v1.13.1+0 [656ef2d0] + OpenBLAS32_jll v0.3.30+0 [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.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.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.30+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 Installation completed after 4.15s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 17.09s ################################################################################ # Testing # Testing HiGHS Status `/tmp/jl_f8Ircc/Project.toml` [87dc4568] HiGHS v1.21.1 [8c4f8055] MathOptIIS v0.1.2 [b8f27783] MathOptInterface v1.49.0 [aea7be01] PrecompileTools v1.3.3 [8fd58aa0] HiGHS_jll v1.13.1+0 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [37e2e46d] LinearAlgebra v1.13.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_f8Ircc/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.3 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.3.2 [87dc4568] HiGHS v1.21.1 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.2 [b8f27783] MathOptInterface v1.49.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [276daf66] SpecialFunctions v2.7.1 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [ec057cc2] StructUtils v2.6.3 [3bb67fe8] TranscodingStreams v0.11.3 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.13.1+0 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [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.13.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.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.30+0 [05823500] OpenLibm_jll v0.8.7+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.15.0+0 Testing Running tests... Test Summary: | Pass Total Time C_wrapper.jl | 5 5 5.8s Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline MIP has 1 row; 30 cols; 30 nonzeros; 30 integer variables (30 binary) Coefficient ranges: Matrix [5e-02, 1e+00] Cost [4e-02, 9e-01] Bound [1e+00, 1e+00] RHS [1e+01, 1e+01] Presolve is switched off Solving MIP model with: 1 row 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; H => Heuristic; I => Shifting; J => Feasibility jump; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; Y => HiGHS solution; Z => ZI Round; l => Trivial lower; p => Trivial point; u => Trivial upper; z => Trivial zero 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 0 0 0 0.4s J 0 0 0 0.00% inf 0.9208964438 Large 0 0 0 0 0.4s S 0 0 0 0.00% 14.70870253 13.02667671 12.91% 0 0 0 0 0.4s 0 0 0 0.00% 13.18231326 13.02667671 1.19% 0 0 2 0 0.4s C 0 0 0 0.00% 13.13490406 13.04478153 0.69% 37 5 2 6 0.4s H 0 0 0 0.00% 13.08780538 13.04741777 0.31% 110 5 9 26 0.4s 1 0 1 100.00% 13.04741777 13.04741777 0.00% 111 5 26 42 0.4s Solving report Status Optimal Primal bound 13.0474177665 Dual bound 13.0474177665 Gap 0% (tolerance: 0.01%) P-D integral 0.00796561298286 Solution status feasible 13.0474177665 (objective) 0 (bound viol.) 2.33146835171e-14 (int. viol.) 0 (row viol.) Timing 0.44 Max sub-MIP depth 1 Nodes 1 Repair LPs 0 LP iterations 42 4 (strong br.) 19 (separation) 14 (heuristics) Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline MIP has 1 row; 30 cols; 30 nonzeros; 30 integer variables (30 binary) Coefficient ranges: Matrix [5e-02, 1e+00] Cost [4e-02, 9e-01] Bound [1e+00, 1e+00] RHS [1e+01, 1e+01] Presolve is switched off Solving MIP model with: 1 row 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; H => Heuristic; I => Shifting; J => Feasibility jump; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; Y => HiGHS solution; Z => ZI Round; l => Trivial lower; p => Trivial point; u => Trivial upper; z => Trivial zero 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 0 0 0 0.0s J 0 0 0 0.00% inf 0.9208964438 Large 0 0 0 0 0.0s S 0 0 0 0.00% 14.70870253 13.02667671 12.91% 0 0 0 0 0.0s 0 0 0 0.00% 13.18231326 13.02667671 1.19% 0 0 2 0 0.0s C 0 0 0 0.00% 13.13490406 13.04478153 0.69% 37 5 2 6 0.0s H 0 0 0 0.00% 13.08780538 13.04741777 0.31% 110 5 9 26 0.0s 1 0 1 100.00% 13.04741777 13.04741777 0.00% 111 5 26 42 0.0s Solving report Status Optimal Primal bound 13.0474177665 Dual bound 13.0474177665 Gap 0% (tolerance: 0.01%) P-D integral 0.00717583174933 Solution status feasible 13.0474177665 (objective) 0 (bound viol.) 2.33146835171e-14 (int. viol.) 0 (row viol.) Timing 0.02 Max sub-MIP depth 1 Nodes 1 Repair LPs 0 LP iterations 42 4 (strong br.) 19 (separation) 14 (heuristics) Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline LP has 1 row; 30 cols; 30 nonzeros Coefficient ranges: Matrix [5e-02, 1e+00] Cost [4e-02, 9e-01] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Solving LP without presolve or useful basis Using dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -3.8411834551e+04 Ph1: 1(41899.1); Du: 30(38.4118) 0.0s 1 -2.9352276210e+04 Ph1: 0(0); Du: 29(29.3523) 0.0s 1 5.8368089089e+00 Pr: 0(0); Du: 29(29.3523) 0.0s Using primal simplex solver Iteration Objective Infeasibilities num(sum) 1 5.8368102690e+00 Pr: 0(0); Du: 29(8.61802) 0.0s 1 5.8368089089e+00 Pr: 0(0); Du: 29(8.61802) 0.0s Model status : Unbounded Simplex iterations: 1 Objective value : 5.8368089089e+00 P-D objective error : 3.2418975872e-01 HiGHS run time : 0.00 Solving linear system to compute primal ray Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline LP has 1 row; 30 cols; 30 nonzeros Coefficient ranges: Matrix [3e-03, 1e+00] Cost [2e-02, 8e-01] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Not presolved: solving the LP Running HiPO Threads: 64 Rows: 1.0e+00 Cols: 3.1e+01 Nnz: 3.1e+01 Range of A: [8.0e-01, 1.5e+00], ratio 1.8e+00 Range of b: [2.0e+01, 2.0e+01], ratio 1.0e+00 Range of c: [1.7e-02, 3.8e+01], ratio 2.2e+03 Range of bounds: [0.0e+00, 0.0e+00], ratio - Scaling coefficients: [5.0e-01, 1.3e+02], ratio 2.6e+02 Newton system: NE preferred Parallelism: Node preferred Factorisation statistics Size: 1.00e+00 Nnz: 1.00e+00 Fill-in: 1.00 Serial memory: 8.0e+00 B Flops: 0.0e+00 Ordering: metis iter primal obj dual obj pinf dinf gap time 0 -3.79827968e+01 -3.79827968e+01 1.54e-01 1.96e+00 0.00e+00 0.0 1 -1.56329863e+15 -3.89920720e+01 2.58e-04 2.01e+00 2.00e+00 0.0 2 -3.12659727e+15 -3.89921729e+01 4.49e-05 2.01e+00 2.00e+00 0.0 3 -4.68989590e+15 -3.89921729e+01 3.94e-04 2.01e+00 2.00e+00 0.0 4 -6.25319454e+15 -3.89921729e+01 9.77e-04 2.01e+00 2.00e+00 0.0 5 -7.81649317e+15 -3.89921729e+01 3.02e-03 2.01e+00 2.00e+00 0.0 6 -9.37979180e+15 -3.89921729e+01 4.44e-04 2.01e+00 2.00e+00 0.0 === Dual infeasible Summary HiPO runtime: 0.00 Status: dual infeasible HiPO iterations: 6 Hipo: Solved WARNING: Hipo: Crossover not run WARNING: Unwelcome IPX status of Primal infeasible or unbounded: basis is not valid; solution is valid; run_crossover is "on" WARNING: IPM solution is imprecise, so clean up with simplex Using dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -3.2445248513e+04 Ph1: 1(67089.1); Du: 30(32.4452) 0.0s 1 -2.9608534924e+04 Ph1: 0(0); Du: 29(29.6085) 0.0s 1 2.1958601529e+00 Pr: 0(0); Du: 29(29.6085) 0.0s Using primal simplex solver Iteration Objective Infeasibilities num(sum) 1 2.1958606646e+00 Pr: 0(0); Du: 29(9.78382) 0.0s 1 2.1958601529e+00 Pr: 0(0); Du: 29(9.78382) 0.0s Model status : Unbounded Simplex iterations: 1 IPM iterations: 6 Objective value : 2.1958601529e+00 P-D objective error : 6.1802879234e-01 HiGHS run time : 0.00 Solving linear system to compute primal ray Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 WARNING: Hipo: User interrupt WARNING: Hipo: Crossover not run 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.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 WARNING: Hipo: User interrupt WARNING: Hipo: Crossover not run 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.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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; H => Heuristic; I => Shifting; J => Feasibility jump; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; Y => HiGHS solution; Z => ZI Round; l => Trivial lower; p => Trivial point; u => Trivial upper; z => Trivial zero 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.2s 1 0 1 100.00% 6 6 0.00% 0 0 0 0 0.2s 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.23 Max sub-MIP depth 0 Nodes 1 Repair LPs 2 (0 feasible; 0 iterations) LP iterations 0 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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); nonzeros 0(-8) - Reduced to empty Performed postsolve 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.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline ERROR: Set supplied to Highs::deleteRows not ordered Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline QP has 1 row; 2 cols; 2 matrix nonzeros; 3 Hessian nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Hessian [1e+00, 4e+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.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline LP has 0 rows; 1 col; 0 nonzeros Solving unconstrained LP Solving an unconstrained LP with 1 columns Model status : Unbounded Objective value : 0.0000000000e+00 P-D objective error : 5.0000000000e-01 HiGHS run time : 0.00 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline LP has 29999 rows; 30000 cols; 59998 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [0e+00, 0e+00] Bound [0e+00, 0e+00] RHS [0e+00, 0e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-29999); columns 0(-30000); nonzeros 0(-59998) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 0.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.07 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline MIP has 1 row; 1 col; 1 nonzero; 1 integer variable (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; H => Heuristic; I => Shifting; J => Feasibility jump; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; Y => HiGHS solution; Z => ZI Round; l => Trivial lower; p => Trivial point; u => Trivial upper; z => Trivial zero 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 Max sub-MIP depth 0 Nodes 0 Repair LPs 0 LP iterations 0 Solving LP to try to compute dual ray MIP has 1 row; 1 col; 1 nonzero; 1 integer variable (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 useful basis Using dual simplex solver Iteration Objective Infeasibilities num(sum) 0 0.0000000000e+00 Pr: 1(0.5) 0.0s 1 0.0000000000e+00 Pr: 0(0) 0.0s WARNING: Solution optimality conditions max inf integrality violations (tolerance = 1e-06) num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-06) num/max 0 / 0 (relative 0 / 0) dual infeasibilities (tolerance = 1e-07) 0 / 0 P-D objective error (tolerance = 1e-07) 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 ERROR: checkOptionValue: Value -1 for option "time_limit" is below lower bound of 0 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline WARNING: Column names are blank or not present: using names with prefix "c", beginning with suffix 0 WARNING: Row names are blank or not present: using names with prefix "r", beginning with suffix 0 Writing the model to /tmp/jl_EBdnJP/test.mps.gz Model has 1 zero columns with no costs: 1 have finite upper bounds or nonzero lower bounds and are written in MPS file Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline WARNING: Row names are blank or not present: using names with prefix "r", beginning with suffix 0 Writing the model to /tmp/jl_tZEF7I/model.mps WARNING: Row names are blank or not present: using names with prefix "r", beginning with suffix 0 Writing the model to /tmp/jl_tZEF7I/model.lp Test Summary: | Pass Total Time MOI_wrapper.jl | 6732 6732 38m22.6s Test Summary: | Total Time runtests.jl | 0 0.0s Testing HiGHS tests passed Testing completed after 2316.87s PkgEval succeeded after 2357.76s