Error when sudo make test (EmptyNLP) #689
Answered
by
svigerske
Girdled-Armadilo
asked this question in
Q&A
-
|
Sorry for bothering with continued questions. When running Making all in src
/Library/Developer/CommandLineTools/usr/bin/make all-recursive
Making all in .
make[3]: Nothing to be done for `all-am'.
Making all in Apps/AmplSolver
make[3]: Nothing to be done for `all'.
Making all in contrib/sIPOPT
Making all in src
make[2]: Nothing to be done for `all'.
Making all in AmplSolver
make[2]: Nothing to be done for `all'.
make[2]: Nothing to be done for `all-am'.
make[1]: Nothing to be done for `all-am'.
cd test; /Library/Developer/CommandLineTools/usr/bin/make test
CXX hs071_main.o
CXX hs071_nlp.o
CXXLD hs071_cpp
CC hs071_c.o
CCLD hs071_c
CXX emptynlp.o
CXXLD emptynlp
CXX getcurr.o
CXXLD getcurr
F77 hs071_f.o
F77LD hs071_f
CXX parametricTNLP.o
CXX parametric_driver.o
CXXLD parametric_cpp
CXX MySensTNLP.o
CXX redhess_cpp.o
CXXLD redhess_cpp
chmod u+x ./run_unitTests
./run_unitTests
Running unitTests...
Testing AMPL Solver Executable...
Test passed!
Testing C++ Example...
Test passed!
Testing C Example...
Test passed!
Testing Fortran Example...
Test passed!
Testing Java Example...
Test passed!
Testing sIpopt Example parametric_cpp...
Test passed!
Testing sIpopt Example redhess_cpp...
Test passed!
Testing EmptyNLP Example...
./run_unitTests: line 21: 86839 Abort trap: 6 $@ > tmpfile 2>&1
0
---- 8< ---- Start of test program output ---- 8< ----
*** Solve for 0 variables, 0 feasible constraint, feasible bounds
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit https://github.com/coin-or/Ipopt
******************************************************************************
This is Ipopt version 3.14.13, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 0
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 0.0000000e+00 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
Number of Iterations....: 0
(scaled) (unscaled)
Objective...............: 0.0000000000000000e+00 0.0000000000000000e+00
Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 0.0000000000000000e+00 0.0000000000000000e+00
Number of objective function evaluations = 1
Number of objective gradient evaluations = 1
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 0
Total seconds in IPOPT = 0.000
EXIT: Optimal Solution Found.
Finalize called
x =
z_L =
z_U =
lambda =
The problem solved in 0 iterations!
The final value of the objective function is 0.
*** Solve for 0 variables, 1 feasible constraint, feasible bounds
This is Ipopt version 3.14.13, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 0
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 0.0000000e+00 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
Number of Iterations....: 0
(scaled) (unscaled)
Objective...............: 0.0000000000000000e+00 0.0000000000000000e+00
Dual infeasibility......: 1.0000000000000000e+00 1.0000000000000000e+00
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0000000000000000e-02 1.0000000000000000e-02
Overall NLP error.......: 1.0000000000000000e+00 1.0000000000000000e+00
Number of objective function evaluations = 1
Number of objective gradient evaluations = 1
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 1
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 1
Number of Lagrangian Hessian evaluations = 0
Total seconds in IPOPT = 0.000
EXIT: Optimal Solution Found.
Finalize called
x =
z_L =
z_U =
lambda = 0
The problem solved in 0 iterations!
The final value of the objective function is 0.
*** Solve for 5 variables, 1 feasible constraint, feasible bounds
This is Ipopt version 3.14.13, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 0
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 0.0000000e+00 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
Number of Iterations....: 0
(scaled) (unscaled)
Objective...............: 0.0000000000000000e+00 0.0000000000000000e+00
Dual infeasibility......: 1.0000000000000000e+00 1.0000000000000000e+00
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0000000000000000e-02 1.0000000000000000e-02
Overall NLP error.......: 1.0000000000000000e+00 1.0000000000000000e+00
Number of objective function evaluations = 1
Number of objective gradient evaluations = 1
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 1
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 1
Number of Lagrangian Hessian evaluations = 0
Total seconds in IPOPT = 0.000
EXIT: Optimal Solution Found.
Finalize called
x = 0 0 0 0 0
z_L = 1 1 1 1 1
z_U = 0 0 0 0 0
lambda = 0
The problem solved in 0 iterations!
The final value of the objective function is 0.
*** Solve for 0 variables, 1 infeasible constraint, feasible bounds
libc++abi: terminating due to uncaught exception of type Ipopt::LOCALLY_INFEASIBLE
This is Ipopt version 3.14.13, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 0
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
---- 8< ---- End of test program output ---- 8< ----
******** Test FAILED! ********
Test program existed with nonzero status.
Testing GetCurr Example...
Test passed!
make[1]: *** [test] Error 1
make: *** [test] Error 2How can I solve this problem ? I think something is wrong with the initialization of the variable, but I'm not sure about it. |
Beta Was this translation helpful? Give feedback.
Answered by
svigerske
Aug 23, 2023
Replies: 1 comment 2 replies
-
|
I also have problems with Ipopt exceptions handling on macOS/arm64 (there is code that is supposed to catch this exception, but it didn't). It seems to have something to do with mixing gfortran and clang(++). I don't have a solution so far. You could try removing the |
Beta Was this translation helpful? Give feedback.
2 replies
-
|
Thanks for your quick reply...! |
Beta Was this translation helpful? Give feedback.
-
|
It works excluding ./run_unitTests
Running unitTests...
Testing AMPL Solver Executable...
Test passed!
Testing C++ Example...
Test passed!
Testing C Example...
Test passed!
Testing Fortran Example...
Test passed!
Testing Java Example...
Test passed!
Testing sIpopt Example parametric_cpp...
Test passed!
Testing sIpopt Example redhess_cpp...
Test passed!
Testing EmptyNLP Example...
Test passed!
Testing GetCurr Example...
Test passed! |
Beta Was this translation helpful? Give feedback.
Answer selected by
Girdled-Armadilo
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
I also have problems with Ipopt exceptions handling on macOS/arm64 (there is code that is supposed to catch this exception, but it didn't). It seems to have something to do with mixing gfortran and clang(++). I don't have a solution so far. You could try removing the
LDFLAGS="-Wl,-no_compact_unwind"that you mentioned in #687, but that may not help either.