search

jump-dev / HiGHS.jl

A Julia interface to the HiGHS solver
https://highs.dev
MIT License
103 stars 14 forks source link

Tests segfault on M1 #116

Closed odow closed 2 years ago

odow commented 2 years ago 
(jump-tests) pkg> test HiGHS
     Testing HiGHS
      Status `/private/var/folders/tz/_3rffzvd1hs3rrxssmntjnpw0000gn/T/jl_oW9CvQ/Project.toml`
  [87dc4568] HiGHS v1.1.3
  [b8f27783] MathOptInterface v1.2.0
  [8fd58aa0] HiGHS_jll v1.2.2+0
  [2f01184e] SparseArrays `@stdlib/SparseArrays`
  [8dfed614] Test `@stdlib/Test`
      Status `/private/var/folders/tz/_3rffzvd1hs3rrxssmntjnpw0000gn/T/jl_oW9CvQ/Manifest.toml`
  [6e4b80f9] BenchmarkTools v1.3.1
  [523fee87] CodecBzip2 v0.7.2
  [944b1d66] CodecZlib v0.7.0
  [87dc4568] HiGHS v1.1.3
  [692b3bcd] JLLWrappers v1.4.1
  [682c06a0] JSON v0.21.3
  [b8f27783] MathOptInterface v1.2.0
  [d8a4904e] MutableArithmetics v1.0.0
  [bac558e1] OrderedCollections v1.4.1
  [69de0a69] Parsers v2.3.1
  [21216c6a] Preferences v1.3.0
  [3bb67fe8] TranscodingStreams v0.9.6
  [6e34b625] Bzip2_jll v1.0.8+0
  [8fd58aa0] HiGHS_jll v1.2.2+0
  [0dad84c5] ArgTools `@stdlib/ArgTools`
  [56f22d72] Artifacts `@stdlib/Artifacts`
  [2a0f44e3] Base64 `@stdlib/Base64`
  [ade2ca70] Dates `@stdlib/Dates`
  [f43a241f] Downloads `@stdlib/Downloads`
  [b77e0a4c] InteractiveUtils `@stdlib/InteractiveUtils`
  [b27032c2] LibCURL `@stdlib/LibCURL`
  [76f85450] LibGit2 `@stdlib/LibGit2`
  [8f399da3] Libdl `@stdlib/Libdl`
  [37e2e46d] LinearAlgebra `@stdlib/LinearAlgebra`
  [56ddb016] Logging `@stdlib/Logging`
  [d6f4376e] Markdown `@stdlib/Markdown`
  [a63ad114] Mmap `@stdlib/Mmap`
  [ca575930] NetworkOptions `@stdlib/NetworkOptions`
  [44cfe95a] Pkg `@stdlib/Pkg`
  [de0858da] Printf `@stdlib/Printf`
  [9abbd945] Profile `@stdlib/Profile`
  [3fa0cd96] REPL `@stdlib/REPL`
  [9a3f8284] Random `@stdlib/Random`
  [ea8e919c] SHA `@stdlib/SHA`
  [9e88b42a] Serialization `@stdlib/Serialization`
  [6462fe0b] Sockets `@stdlib/Sockets`
  [2f01184e] SparseArrays `@stdlib/SparseArrays`
  [10745b16] Statistics `@stdlib/Statistics`
  [fa267f1f] TOML `@stdlib/TOML`
  [a4e569a6] Tar `@stdlib/Tar`
  [8dfed614] Test `@stdlib/Test`
  [cf7118a7] UUIDs `@stdlib/UUIDs`
  [4ec0a83e] Unicode `@stdlib/Unicode`
  [e66e0078] CompilerSupportLibraries_jll `@stdlib/CompilerSupportLibraries_jll`
  [deac9b47] LibCURL_jll `@stdlib/LibCURL_jll`
  [29816b5a] LibSSH2_jll `@stdlib/LibSSH2_jll`
  [c8ffd9c3] MbedTLS_jll `@stdlib/MbedTLS_jll`
  [14a3606d] MozillaCACerts_jll `@stdlib/MozillaCACerts_jll`
  [4536629a] OpenBLAS_jll `@stdlib/OpenBLAS_jll`
  [83775a58] Zlib_jll `@stdlib/Zlib_jll`
  [8e850b90] libblastrampoline_jll `@stdlib/libblastrampoline_jll`
  [8e850ede] nghttp2_jll `@stdlib/nghttp2_jll`
  [3f19e933] p7zip_jll `@stdlib/p7zip_jll`
     Testing Running tests...
Test Summary: | Pass  Total
C_wrapper.jl  |    5      5

Presolve is switched off

Solving MIP model with:
   1 rows
   30 cols (30 binary, 0 integer, 0 implied int., 0 continuous)
   30 nonzeros

( 0.0s) Starting symmetry detection
( 0.0s) No symmetry present

        Nodes      |    B&B Tree     |            Objective Bounds              |  Dynamic Constraints |       Work      
     Proc. InQueue |  Leaves   Expl. | BestBound       BestSol              Gap |   Cuts   InLp Confl. | LpIters     Time

         0       0         0   0.00%   16.76270083     -inf                 inf        0      0      0         0     0.0s
 S       0       0         0   0.00%   16.76270083     14.84850282       12.89%        0      0      0         0     0.0s
         0       0         0   0.00%   15.00872874     14.84850282        1.08%        0      0      0         1     0.0s

Solving report
  Status            Optimal
  Primal bound      14.9216412841
  Dual bound        14.9216412841
  Gap               0% (tolerance: 0.01%)
  Solution status   feasible
                    14.9216412841 (objective)
                    0 (bound viol.)
                    1.99840144433e-15 (int. viol.)
                    0 (row viol.)
  Timing            0.00 (total)
                    0.00 (presolve)
                    0.00 (postsolve)
  Nodes             1
  LP iterations     9 (total)
                    0 (strong br.)
                    8 (separation)
                    0 (heuristics)

Presolve is switched off

Solving MIP model with:
   1 rows
   30 cols (30 binary, 0 integer, 0 implied int., 0 continuous)
   30 nonzeros

( 0.0s) Starting symmetry detection
( 0.0s) No symmetry present

        Nodes      |    B&B Tree     |            Objective Bounds              |  Dynamic Constraints |       Work      
     Proc. InQueue |  Leaves   Expl. | BestBound       BestSol              Gap |   Cuts   InLp Confl. | LpIters     Time

         0       0         0   0.00%   16.76270083     -inf                 inf        0      0      0         0     0.0s
 S       0       0         0   0.00%   16.76270083     14.84850282       12.89%        0      0      0         0     0.0s
         0       0         0   0.00%   15.00872874     14.84850282        1.08%        0      0      0         1     0.0s

Solving report
  Status            Optimal
  Primal bound      14.9216412841
  Dual bound        14.9216412841
  Gap               0% (tolerance: 0.01%)
  Solution status   feasible
                    14.9216412841 (objective)
                    0 (bound viol.)
                    1.99840144433e-15 (int. viol.)
                    0 (row viol.)
  Timing            0.00 (total)
                    0.00 (presolve)
                    0.00 (postsolve)
  Nodes             1
  LP iterations     9 (total)
                    0 (strong br.)
                    8 (separation)
                    0 (heuristics)
Solving LP without presolve or with basis
Using EKK dual simplex solver - serial
  Iteration        Objective     Infeasibilities num(sum)
          0    -5.3687537354e+04 Ph1: 1(28324.3); Du: 30(53.6875) 0s
          1    -4.5344862766e+04 Ph1: 0(0); Du: 29(45.3449) 0s
          1     5.4698212166e+00 Pr: 0(0); Du: 29(45.3449) 0s
Using EKK primal simplex solver
  Iteration        Objective     Infeasibilities num(sum)
          1     5.4698224911e+00 Pr: 0(0); Du: 29(11.1913) 0s
          1     5.4698212166e+00 Pr: 0(0); Du: 29(11.1913) 0s
Model   status      : Unbounded
Simplex   iterations: 1
Objective value     :  5.4698212166e+00
HiGHS run time      :          0.00
Solving LP without presolve or with basis
IPX model has 1 rows, 30 columns and 30 nonzeros
Input
    Number of variables:                                30
    Number of free variables:                           30
    Number of constraints:                              1
    Number of equality constraints:                     0
    Number of matrix entries:                           30
    Matrix range:                                       [3e-03, 9e-01]
    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, 2.56e+02]
IPX version 1.0
Interior Point Solve
 Iter     P.res    D.res            P.obj           D.obj        mu     Time
   0   1.74e+00 5.87e+01  -4.43937239e+01 -4.43937239e+01  1.68e+01       0s
   1   1.74e-06 5.85e+01  -1.21593225e+03 -4.66256987e+01  1.57e+00       0s
   2   1.91e-11 5.85e+01  -3.58021136e+03 -4.67516149e+01  4.68e-30       0s
   3   1.59e+88 2.75e+73  4.59625327e+104 -2.75047935e+74  2.69e+177       0s
   4   0.00e+00 2.75e+67  4.59625327e+104 -2.75047935e+68  2.69e+171       0s
   5   0.00e+00 2.75e+61  4.59625327e+104 -2.75047935e+62  2.69e+165       0s
   6   1.59e+88 2.75e+55  4.59625327e+104 -2.75047935e+56  2.69e+159       0s
   7   1.59e+88 2.75e+49  4.59625327e+104 -2.75047936e+50  2.69e+153       0s
   8   3.18e+88 2.75e+43  4.59625327e+104 -2.75047935e+44  2.69e+147       0s
   9   1.59e+88 2.75e+37  4.59625327e+104 -2.75047936e+38  2.69e+141       0s
  10   0.00e+00 2.75e+31  4.59625327e+104 -2.75047936e+32  2.69e+135       0s
  11   0.00e+00 2.75e+25  4.59625327e+104 -2.75047936e+26  2.69e+129       0s
  12   0.00e+00 2.75e+19  4.59625327e+104 -2.75047936e+20  2.69e+123       0s
  13   0.00e+00 2.75e+13  4.59625327e+104 -2.75047936e+14  2.69e+117       0s
  14   0.00e+00 2.75e+07  4.59625326e+104 -2.75047977e+08  2.69e+111       0s
  15   0.00e+00 4.24e+01  4.59612050e+104 -3.16919045e+02  3.09e+105       0s
  16   0.00e+00 5.88e+01  -1.10537366e+106 -4.22562247e+01  3.09e+104       0s
  17   4.38e+88 5.87e+01  -7.53039543e+106 -4.45213262e+01  4.45e-30       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: Imprecise solution returned from IPX, so use simplex to clean up
Using EKK dual simplex solver - serial
  Iteration        Objective     Infeasibilities num(sum)
          0    -3.6574154110e+04 Ph1: 1(54003); Du: 30(36.5742) 0s
          1    -3.2869539556e+04 Ph1: 0(0); Du: 29(32.8695) 0s
          1     3.9749160170e+00 Pr: 0(0); Du: 29(32.8695) 0s
Using EKK primal simplex solver
  Iteration        Objective     Infeasibilities num(sum)
          1     3.9749169432e+00 Pr: 0(0); Du: 29(10.2852) 0s
          1     3.9749160170e+00 Pr: 0(0); Du: 29(10.2852) 0s
Model   status      : Unbounded
Simplex   iterations: 1
IPM       iterations: 17
Objective value     :  3.9749160170e+00
HiGHS run time      :          0.00
Presolving model
0 rows, 0 cols, 0 nonzeros
0 rows, 0 cols, 0 nonzeros
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
HiGHS run time      :          0.00
WARNING: checkOptionValue: Value -1 for option "time_limit" is below lower bound of 0
ERROR:   setLocalOptionValue: Option "write_solution_to_file" cannot be assigned an int
ERROR:   setLocalOptionValue: Option "time_limit" cannot be assigned an int
ERROR:   setLocalOptionValue: Option "presolve" cannot be assigned an int

signal (11): Segmentation fault: 11
in expression starting at /Users/oscardowson/.julia/packages/HiGHS/85iZH/test/MOI_wrapper.jl:287
_flag_to_set_type at /Users/oscardowson/.julia/packages/MathOptInterface/ajp5T/src/Utilities/variables_container.jl:0
Allocations: 488431866 (Pool: 488237119; Big: 194747); GC: 443
ERROR: Package HiGHS errored during testing (exit code: 139)
odow commented 2 years ago

Closing because tests pass in the upcoming Julia v1.8.