Package evaluation to test LiftAndLearn on Julia 1.14.0-DEV.71 (9f595ebbf8*) started at 2025-11-14T12:57:53.820 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.15s ################################################################################ # Installation # Installing LiftAndLearn... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [192fc49d] + LiftAndLearn v1.1.0 Updating `~/.julia/environments/v1.14/Manifest.toml` [66dad0bd] + AliasTables v1.1.3 [6e4b80f9] + BenchmarkTools v1.6.3 ⌅ [0a1fb500] + BlockDiagonals v0.1.42 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.0.3 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [9a962f9c] + DataAPI v1.16.0 [864edb3b] + DataStructures v0.19.3 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [1a297f60] + FillArrays v1.15.0 [26cc04aa] + FiniteDifferences v0.12.33 [f6369f11] + ForwardDiff v1.3.0 [b6b21f68] + Ipopt v1.13.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.2.1 [0f8b85d8] + JSON3 v1.14.3 [4076af6c] + JuMP v1.29.3 [2c470bb0] + Kronecker v0.5.5 [192fc49d] + LiftAndLearn v1.1.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.46.0 [e1d29d7a] + Missings v1.2.0 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [356022a1] + NamedDims v1.2.3 [bac558e1] + OrderedCollections v1.8.1 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [43287f4e] + PtrArrays v1.3.0 [708f8203] + Richardson v1.4.2 [c946c3f1] + SCS v2.4.0 [a2af1166] + SortingAlgorithms v1.2.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.1 [2913bbd2] + StatsBase v0.34.8 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.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.2+0 [9cc047cb] + Ipopt_jll v300.1400.1900+0 [1d63c593] + LLVMOpenMP_jll v18.1.8+0 [94ce4f54] + Libiconv_jll v1.18.0+0 [d00139f3] + METIS_jll v5.1.3+0 [d7ed1dd3] + MUMPS_seq_jll v500.800.100+0 [656ef2d0] + OpenBLAS32_jll v0.3.29+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f4f2fc5b] + SCS_jll v300.200.900+0 ⌅ [319450e9] + SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] + XML2_jll v2.13.9+0 [a65dc6b1] + Xorg_libpciaccess_jll v0.18.1+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.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 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.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 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.16.0+0 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.11.4 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.4+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.68.0+1 [3f19e933] + p7zip_jll v17.7.0+0 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 5.92s ################################################################################ # 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... 3309.3 ms ✓ Kronecker 1363.4 ms ✓ SCS_jll 7569.0 ms ✓ ForwardDiff 4867.5 ms ✓ BlockDiagonals 2512.6 ms ✓ UniqueKronecker 3198.3 ms ✓ ForwardDiff → ForwardDiffStaticArraysExt 76457.5 ms ✓ MathOptInterface 70748.1 ms ✓ JuMP 78648.2 ms ✓ SCS 47705.3 ms ✓ Ipopt → IpoptMathOptInterfaceExt 26550.1 ms ✓ LiftAndLearn 11 dependencies successfully precompiled in 326 seconds. 102 already precompiled. Precompilation completed after 333.99s ################################################################################ # Testing # Testing LiftAndLearn Status `/tmp/jl_pX6EJb/Project.toml` [192fc49d] LiftAndLearn v1.1.0 [37e2e46d] LinearAlgebra v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_pX6EJb/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [6e4b80f9] BenchmarkTools v1.6.3 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.0.3 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.3 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [1a297f60] FillArrays v1.15.0 [26cc04aa] FiniteDifferences v0.12.33 [f6369f11] ForwardDiff v1.3.0 [b6b21f68] Ipopt v1.13.0 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.2.1 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.3 [2c470bb0] Kronecker v0.5.5 [192fc49d] LiftAndLearn v1.1.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.46.0 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [356022a1] NamedDims v1.2.3 [bac558e1] OrderedCollections v1.8.1 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [43287f4e] PtrArrays v1.3.0 [708f8203] Richardson v1.4.2 [c946c3f1] SCS v2.4.0 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.8 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.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.2+0 [9cc047cb] Ipopt_jll v300.1400.1900+0 [1d63c593] LLVMOpenMP_jll v18.1.8+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f4f2fc5b] SCS_jll v300.200.900+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.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 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.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 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.11.4 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 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.19, running with linear solver MUMPS 5.8.1. 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.31e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8132669e+01 4.44e-16 7.98e-14 -1.0 1.71e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.8132668787540695e+01 1.8132668787540695e+01 Dual infeasibility......: 7.9832425550457166e-14 7.9832425550457166e-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.......: 7.9832425550457166e-14 7.9832425550457166e-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 = 2.988 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 = 3.123682975769043 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 36.26533757508266 └ objective_value = 18.132668787540695 [ Info: Initialize optimization model. [ Info: Add constraints [ Info: Set objective [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. 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.31e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4709591e+00 2.69e-15 1.18e-14 -1.0 1.32e+01 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.4709590898019556e+00 1.4709590898019556e+00 Dual infeasibility......: 1.1763553483282783e-14 1.1763553483282783e-14 Constraint violation....: 2.6922908347160046e-15 2.6922908347160046e-15 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 1.1763553483282783e-14 1.1763553483282783e-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.8030819892883301 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 2.941918179603968 └ objective_value = 1.4709590898019556 [ Info: Initialize optimization model. [ Info: Set objective [ Info: Add constraints [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. 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.31e+00 5.59e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.3233623e-01 1.19e+00 1.76e+01 -1.0 1.73e+00 - 1.00e+00 9.44e-02h 1 2 1.3793371e+01 1.71e-01 3.67e+00 -1.0 1.54e+00 - 1.00e+00 8.56e-01h 1 3 1.4907990e+01 1.21e-01 6.71e+01 -1.0 2.25e-01 - 1.00e+00 2.94e-01h 1 4 1.8128214e+01 6.66e-16 1.00e-06 -1.0 1.57e-01 - 1.00e+00 1.00e+00h 1 5 1.8124514e+01 4.44e-16 5.35e+00 -2.5 9.24e-05 - 9.46e-01 1.00e+00f 1 6 1.8093117e+01 6.66e-16 2.83e-08 -2.5 8.07e-04 - 1.00e+00 1.00e+00f 1 7 1.8086723e+01 4.44e-16 4.01e-01 -3.8 3.80e-04 - 8.10e-01 1.00e+00f 1 8 1.8085051e+01 4.44e-16 1.50e-09 -3.8 3.33e-04 - 1.00e+00 1.00e+00f 1 9 1.8084492e+01 4.44e-16 8.23e-04 -5.7 3.74e-05 - 9.91e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.8084486e+01 4.44e-16 1.84e-11 -5.7 1.18e-06 - 1.00e+00 1.00e+00f 1 11 1.8084479e+01 6.66e-16 1.74e-13 -8.6 6.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 1.8084479090218039e+01 1.8084479090218039e+01 Dual infeasibility......: 1.7408297026122455e-13 1.7408297026122455e-13 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.0788876400430086e-09 3.0788876400430086e-09 Overall NLP error.......: 3.0788876400430086e-09 3.0788876400430086e-09 Number of objective function evaluations = 12 Number of objective gradient evaluations = 12 Number of equality constraint evaluations = 12 Number of inequality constraint evaluations = 12 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.148 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.1590001583099365 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 36.16895864194874 └ objective_value = 18.08447909021804 [ Info: Initialize optimization model. [ Info: Set objective [ Info: Add constraints [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. 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.31e+00 1.45e-17 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.5334252e-01 7.59e-01 6.56e+00 -1.0 1.80e+00 -4.0 1.00e+00 4.22e-01h 1 2 9.6417330e-01 2.54e-01 6.75e+00 -1.0 1.03e+00 -4.5 1.00e+00 6.66e-01h 1 3 1.2947589e+00 7.90e-02 1.13e+01 -1.0 3.48e-01 -5.0 1.00e+00 6.89e-01h 1 4 1.4735191e+00 8.88e-16 1.01e-06 -1.0 1.07e-01 -5.4 1.00e+00 1.00e+00h 1 5 1.4734064e+00 6.66e-16 2.83e-08 -2.5 3.42e-05 -5.9 1.00e+00 1.00e+00f 1 6 1.4695784e+00 6.66e-16 1.92e+00 -3.8 1.25e-03 -6.4 2.81e-01 1.00e+00f 1 7 1.4679685e+00 6.66e-16 2.01e-01 -3.8 4.79e-04 -6.9 8.95e-01 1.00e+00f 1 8 1.4671808e+00 6.66e-16 1.54e-09 -3.8 7.97e-04 -7.3 1.00e+00 1.00e+00f 1 9 1.4668656e+00 6.66e-16 2.56e-02 -5.7 3.54e-04 -7.8 8.28e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.4668275e+00 6.66e-16 1.88e-11 -5.7 7.29e-05 -8.3 1.00e+00 1.00e+00f 1 11 1.4668219e+00 6.66e-16 1.72e-06 -8.6 4.48e-06 -8.8 9.99e-01 1.00e+00f 1 12 1.4668219e+00 7.77e-16 2.92e-14 -8.6 1.09e-08 -9.2 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 1.4668218696371131e+00 1.4668218696371131e+00 Dual infeasibility......: 2.9158962027406085e-14 2.9158962027406085e-14 Constraint violation....: 7.7715611723760958e-16 7.7715611723760958e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059172188699551e-09 2.5059172188699551e-09 Overall NLP error.......: 2.5059172188699551e-09 2.5059172188699551e-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 = 4.746 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 = 4.757458925247192 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 2.933643760559034 └ objective_value = 1.4668218696371131 [ Info: Initialize optimization model. [ Info: Set penalty [ Info: Set objective [ Info: Setup Done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. 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.31e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8132667e+01 4.44e-16 1.04e-08 -1.0 1.71e+00 - 1.00e+00 1.00e+00h 1 2 1.8132667e+01 4.44e-16 4.47e-09 -9.0 2.83e-15 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 1.8132666870086833e+01 1.8132666870086833e+01 Dual infeasibility......: 4.4748471594857619e-09 4.4748471594857619e-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.......: 4.4748471594857619e-09 4.4748471594857619e-09 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.514 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.523317813873291 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 36.265333742049386 └ objective_value = 18.132666870086833 [ Info: Initialize optimization model. [ Info: Set penalty [ Info: Set objective [ Info: Setup Done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. 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.31e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4709591e+00 1.34e-09 1.79e-04 -1.0 1.79e+00 -4.0 1.00e+00 1.00e+00h 1 2 1.4709591e+00 6.66e-15 5.64e-08 -5.7 5.00e-01 - 1.00e+00 1.00e+00h 1 3 1.4709591e+00 7.77e-16 4.20e-08 -8.6 2.24e-04 -4.5 1.00e+00 1.00e+00h 1 4 1.4709591e+00 6.66e-16 2.74e-08 -8.6 9.11e-10 -5.0 1.00e+00 1.00e+00h 1 5 1.4709590e+00 6.66e-16 5.72e-08 -8.6 1.56e-02 - 1.00e+00 2.50e-01h 3 6 1.4709590e+00 4.44e-16 6.47e-08 -8.6 4.02e-03 -5.4 1.00e+00 1.00e+00h 1 7 1.4709591e+00 3.33e-16 2.36e-09 -8.6 1.82e-09 -5.9 1.00e+00 1.00e+00H 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: 1.4709590854392232e+00 1.4709590854392232e+00 Dual infeasibility......: 2.3550916772308028e-09 2.3550916772308028e-09 Constraint violation....: 3.3306690738754696e-16 3.3306690738754696e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 2.3550916772308028e-09 2.3550916772308028e-09 Number of objective function evaluations = 12 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 12 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 = 6.104 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 = 6.127926826477051 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 2.9419181323341754 └ objective_value = 1.4709590854392232 [ Info: Initialize optimization model. [ Info: Add constraints [ Info: Set objective [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. 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.31e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8132669e+01 4.44e-16 7.98e-14 -1.0 1.71e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.8132668787540695e+01 1.8132668787540695e+01 Dual infeasibility......: 7.9832425550457166e-14 7.9832425550457166e-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.......: 7.9832425550457166e-14 7.9832425550457166e-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.722 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.7414188385009766 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 36.26533757508266 └ objective_value = 18.132668787540695 [ Info: Initialize optimization model. [ Info: Set objective [ Info: Add constraints [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. 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.31e+00 5.59e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.3233623e-01 1.19e+00 1.76e+01 -1.0 1.73e+00 - 1.00e+00 9.44e-02h 1 2 1.3793371e+01 1.71e-01 3.67e+00 -1.0 1.54e+00 - 1.00e+00 8.56e-01h 1 3 1.4907990e+01 1.21e-01 6.71e+01 -1.0 2.25e-01 - 1.00e+00 2.94e-01h 1 4 1.8128214e+01 6.66e-16 1.00e-06 -1.0 1.57e-01 - 1.00e+00 1.00e+00h 1 5 1.8124514e+01 4.44e-16 5.35e+00 -2.5 9.24e-05 - 9.46e-01 1.00e+00f 1 6 1.8093117e+01 6.66e-16 2.83e-08 -2.5 8.07e-04 - 1.00e+00 1.00e+00f 1 7 1.8086723e+01 4.44e-16 4.01e-01 -3.8 3.80e-04 - 8.10e-01 1.00e+00f 1 8 1.8085051e+01 4.44e-16 1.50e-09 -3.8 3.33e-04 - 1.00e+00 1.00e+00f 1 9 1.8084492e+01 4.44e-16 8.23e-04 -5.7 3.74e-05 - 9.91e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.8084486e+01 4.44e-16 1.84e-11 -5.7 1.18e-06 - 1.00e+00 1.00e+00f 1 11 1.8084479e+01 6.66e-16 1.74e-13 -8.6 6.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 1.8084479090218039e+01 1.8084479090218039e+01 Dual infeasibility......: 1.7408297026122455e-13 1.7408297026122455e-13 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.0788876400430086e-09 3.0788876400430086e-09 Overall NLP error.......: 3.0788876400430086e-09 3.0788876400430086e-09 Number of objective function evaluations = 12 Number of objective gradient evaluations = 12 Number of equality constraint evaluations = 12 Number of inequality constraint evaluations = 12 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 2.839 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 = 2.8507261276245117 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 36.16895864194874 └ objective_value = 18.08447909021804 [ Info: Initialize optimization model. [ Info: Set penalty [ Info: Set objective [ Info: Setup Done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. 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.31e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8132667e+01 4.44e-16 1.04e-08 -1.0 1.71e+00 - 1.00e+00 1.00e+00h 1 2 1.8132667e+01 4.44e-16 4.47e-09 -9.0 2.83e-15 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 1.8132666870086833e+01 1.8132666870086833e+01 Dual infeasibility......: 4.4748471594857619e-09 4.4748471594857619e-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.......: 4.4748471594857619e-09 4.4748471594857619e-09 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.495 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.509253978729248 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 36.265333742049386 └ objective_value = 18.132666870086833 Test Summary: | Pass Total Time LiftAndLearn | 80 80 4m21.1s Testing LiftAndLearn tests passed Testing completed after 286.96s PkgEval succeeded after 653.44s