Package evaluation of LiftAndLearn on Julia 1.10.8 (92f03a4775*) started at 2025-02-25T11:09:02.883 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 5.1s ################################################################################ # Installation # Installing LiftAndLearn... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [192fc49d] + LiftAndLearn v1.1.0 Updating `~/.julia/environments/v1.10/Manifest.toml` [66dad0bd] + AliasTables v1.1.3 [6e4b80f9] + BenchmarkTools v1.6.0 [0a1fb500] + BlockDiagonals v0.1.42 [d360d2e6] + ChainRulesCore v1.25.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.0.2 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [9a962f9c] + DataAPI v1.16.0 [864edb3b] + DataStructures v0.18.20 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.3 [1a297f60] + FillArrays v1.13.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v0.10.38 [b6b21f68] + Ipopt v1.7.2 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.1 [4076af6c] + JuMP v1.24.0 [2c470bb0] + Kronecker v0.5.5 [192fc49d] + LiftAndLearn v1.1.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.15 [b8f27783] + MathOptInterface v1.37.0 [e1d29d7a] + Missings v1.2.0 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.2 [356022a1] + NamedDims v1.2.2 [bac558e1] + OrderedCollections v1.8.0 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.1 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [43287f4e] + PtrArrays v1.3.0 [ae029012] + Requires v1.3.0 [708f8203] + Richardson v1.4.2 [c946c3f1] + SCS v2.0.2 [a2af1166] + SortingAlgorithms v1.2.1 [276daf66] + SpecialFunctions v2.5.0 [90137ffa] + StaticArrays v1.9.12 [1e83bf80] + StaticArraysCore v1.4.3 [82ae8749] + StatsAPI v1.7.0 [2913bbd2] + StatsBase v0.34.4 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 ⌅ [dd29a912] + UniqueKronecker v0.1.0 [ae81ac8f] + ASL_jll v0.1.3+0 [6e34b625] + Bzip2_jll v1.0.9+0 [e33a78d0] + Hwloc_jll v2.12.0+0 [9cc047cb] + Ipopt_jll v300.1400.1700+0 [1d63c593] + LLVMOpenMP_jll v18.1.7+0 [d00139f3] + METIS_jll v5.1.3+0 [d7ed1dd3] + MUMPS_seq_jll v500.700.301+0 ⌅ [656ef2d0] + OpenBLAS32_jll v0.3.24+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f4f2fc5b] + SCS_jll v3.2.7+0 ⌅ [319450e9] + SPRAL_jll v2024.5.8+0 [0dad84c5] + ArgTools v1.1.1 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [f43a241f] + Downloads v1.6.0 [7b1f6079] + FileWatching [b77e0a4c] + InteractiveUtils [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [a63ad114] + Mmap [ca575930] + NetworkOptions v1.2.0 [44cfe95a] + Pkg v1.10.0 [de0858da] + Printf [9abbd945] + Profile [3fa0cd96] + REPL [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [6462fe0b] + Sockets [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] + LibCURL_jll v8.4.0+0 [e37daf67] + LibGit2_jll v1.6.4+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.2+1 [14a3606d] + MozillaCACerts_jll v2023.1.10 [4536629a] + OpenBLAS_jll v0.3.23+4 [05823500] + OpenLibm_jll v0.8.1+4 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 [8e850ede] + nghttp2_jll v1.52.0+1 [3f19e933] + p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 7.09s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 156.33s ################################################################################ # Testing # Testing LiftAndLearn Status `/tmp/jl_pQpmWh/Project.toml` [192fc49d] LiftAndLearn v1.1.0 [37e2e46d] LinearAlgebra [8dfed614] Test Status `/tmp/jl_pQpmWh/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [6e4b80f9] BenchmarkTools v1.6.0 [0a1fb500] BlockDiagonals v0.1.42 [d360d2e6] ChainRulesCore v1.25.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.0.2 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.20 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.3 [1a297f60] FillArrays v1.13.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v0.10.38 [b6b21f68] Ipopt v1.7.2 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.1 [4076af6c] JuMP v1.24.0 [2c470bb0] Kronecker v0.5.5 [192fc49d] LiftAndLearn v1.1.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.15 [b8f27783] MathOptInterface v1.37.0 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.2 [356022a1] NamedDims v1.2.2 [bac558e1] OrderedCollections v1.8.0 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.1 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [43287f4e] PtrArrays v1.3.0 [ae029012] Requires v1.3.0 [708f8203] Richardson v1.4.2 [c946c3f1] SCS v2.0.2 [a2af1166] SortingAlgorithms v1.2.1 [276daf66] SpecialFunctions v2.5.0 [90137ffa] StaticArrays v1.9.12 [1e83bf80] StaticArraysCore v1.4.3 [82ae8749] StatsAPI v1.7.0 [2913bbd2] StatsBase v0.34.4 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 ⌅ [dd29a912] UniqueKronecker v0.1.0 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [e33a78d0] Hwloc_jll v2.12.0+0 [9cc047cb] Ipopt_jll v300.1400.1700+0 [1d63c593] LLVMOpenMP_jll v18.1.7+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.700.301+0 ⌅ [656ef2d0] OpenBLAS32_jll v0.3.24+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f4f2fc5b] SCS_jll v3.2.7+0 ⌅ [319450e9] SPRAL_jll v2024.5.8+0 [0dad84c5] ArgTools v1.1.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [b77e0a4c] InteractiveUtils [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [9abbd945] Profile [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.2+1 [14a3606d] MozillaCACerts_jll v2023.1.10 [4536629a] OpenBLAS_jll v0.3.23+4 [05823500] OpenLibm_jll v0.8.1+4 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... running test file utilities/matrix_dimensions.jl running test file utilities/analysis.jl running test file intrusive/pod.jl running test file LnL/lifting.jl running test file LnL/opinf.jl running test file LnL/lnl.jl running test file LnL/epopinf.jl [ Info: Initialize optimization model. [ Info: Add constraints [ Info: Set objective [ Info: Setup done. [ Info: Optimize model. ****************************************************************************** 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.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 240246 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40044 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 1.42e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1805372e+01 4.44e-16 3.63e-14 -1.0 1.85e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.1805371844947269e+01 1.1805371844947269e+01 Dual infeasibility......: 3.6263553672276546e-14 3.6263553672276546e-14 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 3.6263553672276546e-14 3.6263553672276546e-14 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.542 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Hard Equality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 1.6383039951324463 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 23.610743689894743 └ objective_value = 11.805371844947269 [ Info: Initialize optimization model. [ Info: Add constraints [ Info: Set objective [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 280288 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40052 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40044 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 1.42e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8794942e+00 6.66e-16 1.86e-04 -1.0 1.86e+00 -4.0 1.00e+00 1.00e+00h 1 2 1.8794942e+00 6.66e-16 4.93e-10 -5.7 1.48e-05 -4.5 1.00e+00 1.00e+00h 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 1.8794941835966967e+00 1.8794941835966967e+00 Dual infeasibility......: 4.9292781864067619e-10 4.9292781864067619e-10 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 4.9292781864067619e-10 4.9292781864067619e-10 Number of objective function evaluations = 3 Number of objective gradient evaluations = 3 Number of equality constraint evaluations = 3 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.357 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Hard Equality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 1.3759310245513916 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 3.7589883687727195 └ objective_value = 1.8794941835966967 [ Info: Initialize optimization model. [ Info: Set objective [ Info: Add constraints [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 240240 Number of nonzeros in inequality constraint Jacobian.: 12 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 Total number of inequality constraints...............: 8 inequality constraints with only lower bounds: 4 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 4 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.42e+00 1.11e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.9441725e-01 1.23e+00 1.40e+01 -1.0 1.86e+00 - 1.00e+00 1.37e-01h 1 2 8.3785155e+00 2.28e-01 4.02e+00 -1.0 1.60e+00 - 1.00e+00 8.15e-01h 1 3 9.7283848e+00 1.29e-01 3.24e+01 -1.0 2.98e-01 - 1.00e+00 4.33e-01h 1 4 1.1811955e+01 4.44e-16 1.00e-06 -1.0 1.68e-01 - 1.00e+00 1.00e+00h 1 5 1.1809988e+01 6.66e-16 5.45e+00 -2.5 8.35e-05 - 9.36e-01 1.00e+00f 1 6 1.1783922e+01 4.44e-16 3.27e-01 -2.5 1.23e-03 - 1.00e+00 9.61e-01f 1 7 1.1783183e+01 6.66e-16 2.83e-08 -2.5 3.43e-04 - 1.00e+00 1.00e+00f 1 8 1.1777880e+01 4.44e-16 2.65e-01 -3.8 2.42e-04 - 8.94e-01 1.00e+00f 1 9 1.1776024e+01 8.88e-16 1.50e-09 -3.8 4.42e-04 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.1775498e+01 6.66e-16 1.96e-03 -5.7 5.62e-05 - 9.81e-01 1.00e+00f 1 11 1.1775488e+01 6.66e-16 1.84e-11 -5.7 3.50e-06 - 1.00e+00 1.00e+00f 1 12 1.1775481e+01 6.66e-16 1.08e-13 -8.6 1.11e-06 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 1.1775480680608750e+01 1.1775480680608750e+01 Dual infeasibility......: 1.0835776720341528e-13 1.0835776720341528e-13 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.5367707815956671e-09 3.5367707815956671e-09 Overall NLP error.......: 3.5367707815956671e-09 3.5367707815956671e-09 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 13 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 3.539 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Soft Inequality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 3.5564370155334473 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 23.55096163987132 └ objective_value = 11.77548068060875 [ Info: Initialize optimization model. [ Info: Set objective [ Info: Add constraints [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 280280 Number of nonzeros in inequality constraint Jacobian.: 14 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40052 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 Total number of inequality constraints...............: 8 inequality constraints with only lower bounds: 4 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 4 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.42e+00 3.00e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.3543146e-01 9.10e-01 7.51e+00 -1.0 1.86e+00 -4.0 1.00e+00 3.61e-01h 1 2 1.2217851e+00 2.80e-01 6.05e+00 -1.0 1.18e+00 -4.5 1.00e+00 6.93e-01h 1 3 1.6312419e+00 9.50e-02 1.24e+01 -1.0 3.66e-01 -5.0 1.00e+00 6.60e-01h 1 4 1.8826146e+00 6.66e-16 1.01e-06 -1.0 1.23e-01 -5.4 1.00e+00 1.00e+00h 1 5 1.8824685e+00 6.66e-16 7.08e-01 -2.5 3.68e-05 -5.9 9.91e-01 1.00e+00f 1 6 1.8791326e+00 6.66e-16 6.55e+00 -2.5 4.35e-03 -6.4 1.00e+00 2.02e-01f 2 7 1.8783705e+00 6.66e-16 2.83e-08 -2.5 2.30e-04 -6.9 1.00e+00 1.00e+00f 1 8 1.8766235e+00 6.66e-16 5.62e-01 -3.8 4.41e-04 -7.3 7.90e-01 1.00e+00f 1 9 1.8753977e+00 8.88e-16 1.51e-09 -3.8 3.47e-04 -7.8 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.8748893e+00 6.66e-16 4.19e-02 -5.7 4.89e-04 -8.3 7.18e-01 1.00e+00f 1 11 1.8748260e+00 6.66e-16 1.90e-11 -5.7 3.20e-04 -8.8 1.00e+00 1.00e+00f 1 12 1.8748205e+00 6.66e-16 6.60e-06 -8.6 9.42e-06 -9.2 9.96e-01 1.00e+00f 1 13 1.8748205e+00 6.66e-16 3.52e-14 -8.6 5.69e-08 -9.7 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 1.8748205321359450e+00 1.8748205321359450e+00 Dual infeasibility......: 3.5233306735966421e-14 3.5233306735966421e-14 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059748478040560e-09 2.5059748478040560e-09 Overall NLP error.......: 2.5059748478040560e-09 2.5059748478040560e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 15 Number of inequality constraint evaluations = 15 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 5.786 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Soft Inequality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 5.803643226623535 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 3.7496410909176308 └ objective_value = 1.874820532135945 [ Info: Initialize optimization model. [ Info: Set penalty [ Info: Set objective [ Info: Setup Done. [ Info: Optimize model. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 240240 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40048 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 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 1.42e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1805371e+01 4.44e-16 1.72e-08 -1.0 1.85e+00 - 1.00e+00 1.00e+00h 1 2 1.1805371e+01 4.44e-16 2.31e-09 -9.0 4.23e-15 - 1.00e+00 1.00e+00H 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 1.1805371072614054e+01 1.1805371072614054e+01 Dual infeasibility......: 2.3132571413952974e-09 2.3132571413952974e-09 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 2.3132571413952974e-09 2.3132571413952974e-09 Number of objective function evaluations = 4 Number of objective gradient evaluations = 3 Number of equality constraint evaluations = 4 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.796 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Penalty │ EP Weight = 1.0e8 │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 1.810157060623169 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 23.610742144134623 └ objective_value = 11.805371072614054 [ Info: Initialize optimization model. [ Info: Set penalty [ Info: Set objective [ Info: Setup Done. [ Info: Optimize model. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 280280 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40053 Total number of variables............................: 40052 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 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 1.42e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8794942e+00 6.66e-16 1.86e-04 -1.0 1.86e+00 -4.0 1.00e+00 1.00e+00h 1 2 1.8794941e+00 4.44e-16 1.16e-08 -5.7 1.48e-05 -4.5 1.00e+00 1.00e+00H 1 3 1.8794941e+00 4.44e-16 2.94e-08 -9.0 1.67e-04 -5.0 1.00e+00 1.00e+00h 1 4 1.8794941e+00 6.66e-16 2.54e-08 -9.0 5.02e-04 -5.4 1.00e+00 1.00e+00h 1 5 1.8794942e+00 4.44e-16 3.70e-08 -9.0 4.53e-03 -5.9 1.00e+00 5.00e-01h 2 6 1.8794942e+00 4.44e-16 1.97e-08 -9.0 9.19e-03 -6.4 1.00e+00 5.00e-01h 2 7 1.8794941e+00 6.66e-16 9.38e-09 -9.0 2.88e-02 -6.9 1.00e+00 1.00e+00H 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: 1.8794941353572956e+00 1.8794941353572956e+00 Dual infeasibility......: 9.3801753031641510e-09 9.3801753031641510e-09 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 9.3801753031641510e-09 9.3801753031641510e-09 Number of objective function evaluations = 14 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 5.485 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Penalty │ EP Weight = 1.0e8 │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 5.497322082519531 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 3.7589882893995115 └ objective_value = 1.8794941353572956 [ Info: Initialize optimization model. [ Info: Add constraints [ Info: Set objective [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 240246 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40044 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 1.42e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1805372e+01 4.44e-16 3.63e-14 -1.0 1.85e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.1805371844947269e+01 1.1805371844947269e+01 Dual infeasibility......: 3.6263553672276546e-14 3.6263553672276546e-14 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 3.6263553672276546e-14 3.6263553672276546e-14 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.781 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Hard Equality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 0.7956318855285645 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 23.610743689894743 └ objective_value = 11.805371844947269 [ Info: Initialize optimization model. [ Info: Set objective [ Info: Add constraints [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 240240 Number of nonzeros in inequality constraint Jacobian.: 12 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 Total number of inequality constraints...............: 8 inequality constraints with only lower bounds: 4 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 4 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.42e+00 1.11e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.9441725e-01 1.23e+00 1.40e+01 -1.0 1.86e+00 - 1.00e+00 1.37e-01h 1 2 8.3785155e+00 2.28e-01 4.02e+00 -1.0 1.60e+00 - 1.00e+00 8.15e-01h 1 3 9.7283848e+00 1.29e-01 3.24e+01 -1.0 2.98e-01 - 1.00e+00 4.33e-01h 1 4 1.1811955e+01 4.44e-16 1.00e-06 -1.0 1.68e-01 - 1.00e+00 1.00e+00h 1 5 1.1809988e+01 6.66e-16 5.45e+00 -2.5 8.35e-05 - 9.36e-01 1.00e+00f 1 6 1.1783922e+01 4.44e-16 3.27e-01 -2.5 1.23e-03 - 1.00e+00 9.61e-01f 1 7 1.1783183e+01 6.66e-16 2.83e-08 -2.5 3.43e-04 - 1.00e+00 1.00e+00f 1 8 1.1777880e+01 4.44e-16 2.65e-01 -3.8 2.42e-04 - 8.94e-01 1.00e+00f 1 9 1.1776024e+01 8.88e-16 1.50e-09 -3.8 4.42e-04 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.1775498e+01 6.66e-16 1.96e-03 -5.7 5.62e-05 - 9.81e-01 1.00e+00f 1 11 1.1775488e+01 6.66e-16 1.84e-11 -5.7 3.50e-06 - 1.00e+00 1.00e+00f 1 12 1.1775481e+01 6.66e-16 1.08e-13 -8.6 1.11e-06 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 1.1775480680608750e+01 1.1775480680608750e+01 Dual infeasibility......: 1.0835776720341528e-13 1.0835776720341528e-13 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.5367707815956671e-09 3.5367707815956671e-09 Overall NLP error.......: 3.5367707815956671e-09 3.5367707815956671e-09 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 13 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 3.564 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Soft Inequality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 3.5769541263580322 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 23.55096163987132 └ objective_value = 11.77548068060875 [ Info: Initialize optimization model. [ Info: Set penalty [ Info: Set objective [ Info: Setup Done. [ Info: Optimize model. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 240240 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40048 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 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 1.42e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1805371e+01 4.44e-16 1.72e-08 -1.0 1.85e+00 - 1.00e+00 1.00e+00h 1 2 1.1805371e+01 4.44e-16 2.31e-09 -9.0 4.23e-15 - 1.00e+00 1.00e+00H 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 1.1805371072614054e+01 1.1805371072614054e+01 Dual infeasibility......: 2.3132571413952974e-09 2.3132571413952974e-09 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 2.3132571413952974e-09 2.3132571413952974e-09 Number of objective function evaluations = 4 Number of objective gradient evaluations = 3 Number of equality constraint evaluations = 4 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.822 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Penalty │ EP Weight = 1.0e8 │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 1.8777060508728027 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 23.610742144134623 └ objective_value = 11.805371072614054 Test Summary: | Pass Total Time LiftAndLearn | 80 80 3m48.6s Testing LiftAndLearn tests passed Testing completed after 241.32s PkgEval succeeded after 420.19s