Package evaluation of HiGHS on Julia 1.13.0-DEV.888 (0e1aa6c7eb*) started at 2025-07-22T16:34:40.105 ################################################################################ # 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.18.2 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 [87dc4568] + HiGHS v1.18.2 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.42.0 [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 [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 Installation completed after 2.09s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 16.8s ################################################################################ # Testing # Testing HiGHS Status `/tmp/jl_jNG6CG/Project.toml` [87dc4568] HiGHS v1.18.2 [b8f27783] MathOptInterface v1.42.0 [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_jNG6CG/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 [87dc4568] HiGHS v1.18.2 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.42.0 [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 [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 Testing Running tests... Test Summary: | Pass Total Time C_wrapper.jl | 5 5 16.5s 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 [8e-02, 1e+00] Cost [1e-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.9947436222 Large 0 0 0 0 0.1s S 0 0 0 0.00% 14.67653277 12.74004689 15.20% 0 0 0 0 0.1s R 0 0 0 0.00% 13.08864153 12.79432236 2.30% 0 0 0 1 0.1s L 0 0 0 0.00% 13.01701993 12.99881247 0.14% 112 10 2 18 0.1s 1 0 1 100.00% 12.99881247 12.99881247 0.00% 129 11 9 27 0.1s Solving report Status Optimal Primal bound 12.9988124692 Dual bound 12.9988124692 Gap 0% (tolerance: 0.01%) P-D integral 0.0103537040363 Solution status feasible 12.9988124692 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.12 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 27 (total) 0 (strong br.) 18 (separation) 5 (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 [8e-02, 1e+00] Cost [1e-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.9947436222 Large 0 0 0 0 0.0s S 0 0 0 0.00% 14.67653277 12.74004689 15.20% 0 0 0 0 0.0s R 0 0 0 0.00% 13.08864153 12.79432236 2.30% 0 0 0 1 0.0s L 0 0 0 0.00% 13.01701993 12.99881247 0.14% 112 10 2 18 0.0s 1 0 1 100.00% 12.99881247 12.99881247 0.00% 129 11 9 27 0.0s Solving report Status Optimal Primal bound 12.9988124692 Dual bound 12.9988124692 Gap 0% (tolerance: 0.01%) P-D integral 0.00890999930747 Solution status feasible 12.9988124692 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 27 (total) 0 (strong br.) 18 (separation) 5 (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 [8e-02, 1e+00] Cost [1e-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 -1.4676532772e+04 Ph1: 1(16338.9); Du: 30(14.6765) 0s 1 -9.6727322323e+03 Ph1: 0(0); Du: 29(9.67273) 0s 1 5.5994551864e+00 Pr: 0(0); Du: 29(9.67273) 0s WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 29 / 0.934 (relative 29 / 0.468) dual infeasibilities (tolerance = 1e-07) 1 / 0.312 P-D objective error (tolerance = 1e-07) Model status : Unbounded Simplex iterations: 1 Objective value : 5.5994551864e+00 P-D objective error : 3.1182793559e-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 [5e-02, 9e-01] Cost [5e-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: [5e-02, 9e-01] RHS range: [1e+01, 1e+01] Objective range: [5e-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] Scaled cost norm: 8.04269 Scaled bounds norm: 10 IPX version 1.0 Interior point solve Iter P.res D.res P.obj D.obj mu Time 0 1.69e+00 6.51e+00 -2.09221550e+01 -2.09221550e+01 9.31e+00 0s 1 1.69e-06 6.43e+00 -1.04397651e+02 -2.20774042e+01 1.19e+00 0s 2 1.69e-12 6.45e+00 -2.40354066e+02 -2.17072169e+01 6.15e-04 0s 3 1.25e-13 6.43e+00 -2.60122987e+05 -2.20511141e+01 1.58e-07 0s 4 5.31e-09 6.43e+00 -1.01547150e+09 -2.20511145e+01 2.40e-08 0s 5 6.73e-08 6.43e+00 -7.67197436e+09 -2.20511145e+01 1.80e-07 0s 6 8.07e-08 6.43e+00 -8.55984650e+09 -2.20511145e+01 3.02e-08 0s 7 8.45e-08 6.43e+00 -1.38576439e+10 -2.20511145e+01 1.07e-06 0s 8 4.47e-08 6.43e+00 -1.40064525e+10 -2.20511145e+01 2.21e-30 0s 9 7.96e+87 5.11e+72 9.60460537e+103 -5.18264542e+73 2.26e+176 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 -4.4597539804e+04 Ph1: 1(42191); Du: 30(44.5975) 0s 1 -3.8141979767e+04 Ph1: 0(0); Du: 29(38.142) 0s 1 3.4870464373e+00 Pr: 0(0); Du: 29(38.142) 0s Using EKK primal simplex solver Iteration Objective Infeasibilities num(sum) 1 3.4870472499e+00 Pr: 0(0); Du: 29(11.8924) 0s 1 3.4870464373e+00 Pr: 0(0); Du: 29(11.8924) 0s WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 29 / 0.957 (relative 29 / 0.479) dual infeasibilities (tolerance = 1e-07) 1 / 0.559 P-D objective error (tolerance = 1e-07) Model status : Unbounded Simplex iterations: 1 IPM iterations: 9 Objective value : 3.4870464373e+00 P-D objective error : 5.5907701411e-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.04 (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 jl_gc_small_alloc_inner at /source/src/gc-stock.c:741 ijl_gc_small_alloc at /source/src/gc-stock.c:774 resolve_todo at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:877 #analyze_method!#194 at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:954 analyze_method! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:921 [inlined] #handle_match!#197 at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1429 handle_match! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1421 [inlined] #handle_any_const_result!#195 at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1321 handle_any_const_result! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1309 [inlined] compute_inlining_cases at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1381 handle_call! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1413 [inlined] assemble_inline_todo! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1664 ssa_inlining_pass! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:76 [inlined] run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1035 run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1048 [inlined] optimize at ./../usr/share/julia/Compiler/src/optimize.jl:1021 jfptr_optimize_82797.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 finish_nocycle at ./../usr/share/julia/Compiler/src/typeinfer.jl:232 jfptr_finish_nocycle_84211.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 typeinf at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:4476 typeinf_ext at ./../usr/share/julia/Compiler/src/typeinfer.jl:1378 typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1561 [inlined] typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1570 jfptr_typeinf_ext_toplevel_84463.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 jl_apply at /source/src/julia.h:2345 [inlined] jl_type_infer at /source/src/gf.c:462 jl_compile_method_internal at /source/src/gf.c:3306 _jl_invoke at /source/src/gf.c:3799 [inlined] ijl_apply_generic at /source/src/gf.c:4004 macro expansion at /home/pkgeval/.julia/packages/MathOptInterface/ugDMh/src/Test/Test.jl:270 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:1858 [inlined] #runtests#2 at /home/pkgeval/.julia/packages/MathOptInterface/ugDMh/src/Test/Test.jl:265 runtests at /home/pkgeval/.julia/packages/MathOptInterface/ugDMh/src/Test/Test.jl:223 [inlined] test_runtests_cache at /home/pkgeval/.julia/packages/HiGHS/kZMf2/test/MOI_wrapper.jl:45 unknown function (ip: 0x7913f6d427df) at (unknown file) _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 macro expansion at /home/pkgeval/.julia/packages/HiGHS/kZMf2/test/MOI_wrapper.jl:17 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:1858 [inlined] runtests at /home/pkgeval/.julia/packages/HiGHS/kZMf2/test/MOI_wrapper.jl:17 unknown function (ip: 0x7914238dae8f) at (unknown file) _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 jl_apply at /source/src/julia.h:2345 [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:2848 _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 _include at ./loading.jl:2908 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_56592.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 macro expansion at /home/pkgeval/.julia/packages/HiGHS/kZMf2/test/runtests.jl:12 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:1947 [inlined] top-level scope at /home/pkgeval/.julia/packages/HiGHS/kZMf2/test/runtests.jl:1970 _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_invoke at /source/src/gf.c:3814 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:2848 _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 _include at ./loading.jl:2908 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_56592.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 jl_apply at /source/src/julia.h:2345 [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_63823.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 jl_apply at /source/src/julia.h:2345 [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: 0x7914251b2249) 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_47924.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3807 [inlined] ijl_apply_generic at /source/src/gf.c:4004 jl_apply at /source/src/julia.h:2345 [inlined] start_task at /source/src/task.c:1249 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 0x00007160df801870 Total snapshots: 394. Utilization: 0% ╎394 @Base/task.jl:1129 wait_forever() 393╎ 394 @Base/task.jl:1192 wait() [13] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/HiGHS/kZMf2/test/MOI_wrapper.jl:1218 PkgEval terminated after 2721.85s: test duration exceeded the time limit