Package evaluation to test HiGHS on Julia 1.14.0-DEV.1260 (89243d1cdf*) started at 2025-11-16T17:47:00.125 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.54s ################################################################################ # Installation # Installing HiGHS... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [87dc4568] + HiGHS v1.20.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 [864edb3b] + DataStructures v0.19.3 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.3.0 [87dc4568] + HiGHS v1.20.1 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.3.0 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [8c4f8055] + MathOptIIS v0.1.1 [b8f27783] + MathOptInterface v1.46.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.0 [276daf66] + SpecialFunctions v2.6.1 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.0 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [8fd58aa0] + HiGHS_jll v1.12.0+0 [d00139f3] + METIS_jll v5.1.3+0 [656ef2d0] + OpenBLAS32_jll v0.3.29+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.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 v1.0.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.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 5.0s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Error: Failed to use TestEnv.jl; test dependencies will not be precompiled │ exception = │ UndefVarError: `project_rel_path` not defined in `TestEnv` │ Suggestion: this global was defined as `Pkg.Operations.project_rel_path` but not assigned a value. │ Stacktrace: │ [1] get_test_dir(ctx::Pkg.Types.Context, pkgspec::PackageSpec) │ @ TestEnv ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/common.jl:75 │ [2] test_dir_has_project_file │ @ ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/common.jl:52 [inlined] │ [3] maybe_gen_project_override! │ @ ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/common.jl:83 [inlined] │ [4] activate(pkg::String; allow_reresolve::Bool) │ @ TestEnv ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/activate_set.jl:12 │ [5] activate(pkg::String) │ @ TestEnv ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/activate_set.jl:9 │ [6] top-level scope │ @ /PkgEval.jl/scripts/precompile.jl:24 │ [7] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [8] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:344 │ [9] _start() │ @ Base ./client.jl:577 └ @ Main /PkgEval.jl/scripts/precompile.jl:26 Precompiling package dependencies... Precompiling packages... 4830.8 ms ✓ SpecialFunctions 6732.7 ms ✓ ForwardDiff 74790.5 ms ✓ MathOptInterface 6808.3 ms ✓ MathOptIIS 28046.9 ms ✓ HiGHS 5 dependencies successfully precompiled in 123 seconds. 52 already precompiled. Precompilation completed after 134.01s ################################################################################ # Testing # Testing HiGHS Status `/tmp/jl_iff1e3/Project.toml` [87dc4568] HiGHS v1.20.1 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.46.0 [aea7be01] PrecompileTools v1.3.3 [8fd58aa0] HiGHS_jll v1.12.0+0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_iff1e3/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 [864edb3b] DataStructures v0.19.3 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.3.0 [87dc4568] HiGHS v1.20.1 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.3.0 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.46.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.0 [276daf66] SpecialFunctions v2.6.1 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.0 [3bb67fe8] TranscodingStreams v0.11.3 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.12.0+0 [d00139f3] METIS_jll v5.1.3+0 [656ef2d0] OpenBLAS32_jll v0.3.29+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.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 v1.0.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.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 6.4s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 1 row; 30 cols; 30 nonzeros; 30 integer variables (30 binary) Coefficient ranges: Matrix [1e-02, 9e-01] Cost [8e-02, 1e+00] 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.966824166 Large 0 0 0 0 0.4s S 0 0 0 0.00% 17.40143043 16.56321209 5.06% 0 0 0 0 0.4s R 0 0 0 0.00% 16.89263113 16.64813016 1.47% 0 0 0 1 0.4s S 0 0 0 0.00% 16.89263113 16.79308381 0.59% 2 1 0 1 0.4s 1 0 1 100.00% 16.79308381 16.79308381 0.00% 2 1 0 4 0.5s Solving report Status Optimal Primal bound 16.7930838064 Dual bound 16.7930838064 Gap 0% (tolerance: 0.01%) P-D integral 0.0106223890382 Solution status feasible 16.7930838064 (objective) 0 (bound viol.) 1.11022302463e-16 (int. viol.) 0 (row viol.) Timing 0.45 Max sub-MIP depth 0 Nodes 1 Repair LPs 0 LP iterations 4 0 (strong br.) 3 (separation) 0 (heuristics) Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 1 row; 30 cols; 30 nonzeros; 30 integer variables (30 binary) Coefficient ranges: Matrix [1e-02, 9e-01] Cost [8e-02, 1e+00] 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.966824166 Large 0 0 0 0 0.0s S 0 0 0 0.00% 17.40143043 16.56321209 5.06% 0 0 0 0 0.0s R 0 0 0 0.00% 16.89263113 16.64813016 1.47% 0 0 0 1 0.0s S 0 0 0 0.00% 16.89263113 16.79308381 0.59% 2 1 0 1 0.0s 1 0 1 100.00% 16.79308381 16.79308381 0.00% 2 1 0 4 0.0s Solving report Status Optimal Primal bound 16.7930838064 Dual bound 16.7930838064 Gap 0% (tolerance: 0.01%) P-D integral 0.00910158963258 Solution status feasible 16.7930838064 (objective) 0 (bound viol.) 1.11022302463e-16 (int. viol.) 0 (row viol.) Timing 0.01 Max sub-MIP depth 0 Nodes 1 Repair LPs 0 LP iterations 4 0 (strong br.) 3 (separation) 0 (heuristics) Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 30 cols; 30 nonzeros Coefficient ranges: Matrix [1e-02, 9e-01] Cost [8e-02, 1e+00] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Solving LP without presolve or useful basis Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -3.4683104542e+04 Ph1: 1(62586.8); Du: 30(34.6831) 0s 1 -2.9315115608e+04 Ph1: 0(0); Du: 29(29.3151) 0s 1 6.7992804009e+00 Pr: 0(0); Du: 29(29.3151) 0s Using EKK primal simplex solver Iteration Objective Infeasibilities num(sum) 1 6.7992819853e+00 Pr: 0(0); Du: 29(12.2671) 0s 1 6.7992804009e+00 Pr: 0(0); Du: 29(12.2671) 0s Model status : Unbounded Simplex iterations: 1 Objective value : 6.7992804009e+00 P-D objective error : 3.8761723196e-01 HiGHS run time : 0.00 Solving linear system to compute primal ray Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 30 cols; 30 nonzeros Coefficient ranges: Matrix [1e-02, 1e+00] Cost [4e-03, 1e+00] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Not presolved: solving the LP HiPO model has 1 rows, 30 columns and 30 nonzeros Running HiPO BLAS: /workspace/destdir/lib/libopenblas.so Threads: 64 Rows: 1.0e+00 Cols: 3.1e+01 Nnz: 3.1e+01 Range of A: [9.1e-01, 1.7e+00], ratio 1.9e+00 Range of b: [2.0e+01, 2.0e+01], ratio 1.0e+00 Range of c: [8.2e-03, 5.2e+01], ratio 6.3e+03 Range of bounds: [0.0e+00, 0.0e+00], ratio - Scaling coefficients: [5.0e-01, 6.4e+01], ratio 1.3e+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 iter primal obj dual obj pinf dinf gap time 0 -4.00482841e+01 -4.00482841e+01 1.48e-01 1.88e+00 3.46e-16 0.0 1 -2.49129669e+15 -4.07438521e+01 6.03e-04 1.92e+00 2.00e+00 0.0 2 -4.98259339e+15 -4.07439217e+01 8.86e-05 1.92e+00 2.00e+00 0.0 3 -7.47389008e+15 -4.07439217e+01 1.95e-03 1.92e+00 2.00e+00 0.0 4 -9.96518678e+15 -4.07439217e+01 2.09e-03 1.92e+00 2.00e+00 0.0 5 -1.24564835e+16 -4.07439217e+01 5.46e-03 1.92e+00 2.00e+00 0.0 6 -1.49477802e+16 -4.07439217e+01 1.86e-03 1.92e+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 EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -4.8241318634e+04 Ph1: 1(54125.1); Du: 30(48.2413) 0s 1 -4.5744933539e+04 Ph1: 0(0); Du: 29(45.7449) 0s 1 1.2079286182e+00 Pr: 0(0); Du: 29(45.7449) 0s Using EKK primal simplex solver Iteration Objective Infeasibilities num(sum) 1 1.2079288997e+00 Pr: 0(0); Du: 29(14.8502) 0s 1 1.2079286182e+00 Pr: 0(0); Du: 29(14.8502) 0s Model status : Unbounded Simplex iterations: 1 IPM iterations: 6 Objective value : 1.2079286182e+00 P-D objective error : 8.1035299048e-01 HiGHS run time : 0.00 Solving linear system to compute primal ray Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.12.0 (git hash: 755a8e027a): 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 HiPO model has 3 rows, 3 columns and 3 nonzeros 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.49 Running HiGHS 1.12.0 (git hash: 755a8e027a): 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 HiPO model has 3 rows, 3 columns and 3 nonzeros Running HiGHS 1.12.0 (git hash: 755a8e027a): 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 HiPO model has 3 rows, 3 columns and 3 nonzeros 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.12.0 (git hash: 755a8e027a): 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 HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); 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.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 Max sub-MIP depth 0 Nodes 1 Repair LPs 2 (0 feasible; 0 iterations) LP iterations 0 Running HiGHS 1.12.0 (git hash: 755a8e027a): 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); 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.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.12.0 (git hash: 755a8e027a): 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.12.0 (git hash: 755a8e027a): 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.12.0 (git hash: 755a8e027a): 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.12.0 (git hash: 755a8e027a): 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.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms ERROR: Set supplied to Highs::deleteRows not ordered Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms 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.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms 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.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms 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.10 Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms 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 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 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.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: INFEASIBLE_POINT Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: INFEASIBLE_POINT Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: INFEASIBLE_POINT Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: NO_SOLUTION Starting bound analysis. Complete bound analysis found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: OPTIMAL Original model primal status: FEASIBLE_POINT Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: NO_SOLUTION Starting bound analysis. Complete bound analysis found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: INFEASIBLE_POINT Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 0 infeasibilities. Starting elastic filter solver. Complete elastic filter solver found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: NO_SOLUTION Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 0 infeasibilities. Starting elastic filter solver. Complete elastic filter solver found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: NO_SOLUTION Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 0 infeasibilities. Starting elastic filter solver. Complete elastic filter solver found 1 infeasibilities. ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 96 running 1 of 1 signal (10): User defined signal 1 _ZN4llvm13BasicAAResult10aliasCheckEPKNS_5ValueENS_12LocationSizeES3_S4_RNS_11AAQueryInfoEPKNS_11InstructionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) unknown function (ip: 0x7ffcaa96b6cf) at (unknown file) unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== 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:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_60660.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] start_task at /source/src/task.c:1272 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ 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.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000073f9647e1b40 Total snapshots: 409. Utilization: 0% ╎409 @Base/task.jl:1168 wait_forever() 408╎ 409 @Base/task.jl:1246 wait() HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 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:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_60660.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] start_task at /source/src/task.c:1272 unknown function (ip: (nil)) at (unknown file) Allocations: 21121262 (Pool: 21120642; Big: 620); GC: 18 [96] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/HiGHS/yay5V/test/MOI_wrapper.jl:1271 _ZN4llvm15ValueHandleBaseaSEPNS_5ValueE.isra.0 at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) unknown function (ip: 0x22) at (unknown file) unknown function (ip: 0x135fb4ff) at (unknown file) unknown function (ip: (nil)) at (unknown file) Allocations: 969225877 (Pool: 969214855; Big: 11022); GC: 177 PkgEval terminated after 2726.87s: test duration exceeded the time limit