Package evaluation to test LiftAndLearn on Julia 1.14.0-DEV.1871 (50d44f5be7*) started at 2026-03-08T20:00:32.429 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 12.88s ################################################################################ # 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.1.0 [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.16.0 [26cc04aa] + FiniteDifferences v0.12.33 [f6369f11] + ForwardDiff v1.3.2 [b6b21f68] + Ipopt v1.14.1 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [4076af6c] + JuMP v1.30.0 [2c470bb0] + Kronecker v0.5.5 [192fc49d] + LiftAndLearn v1.1.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.49.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.2 [43287f4e] + PtrArrays v1.4.0 [708f8203] + Richardson v1.4.2 [c946c3f1] + SCS v2.6.2 [a2af1166] + SortingAlgorithms v1.2.2 [276daf66] + SpecialFunctions v2.7.1 [90137ffa] + StaticArrays v1.9.17 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.8.0 [2913bbd2] + StatsBase v0.34.10 [ec057cc2] + StructUtils v2.6.3 [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.13.0+0 [9cc047cb] + Ipopt_jll v300.1400.1901+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.200+0 [656ef2d0] + OpenBLAS32_jll v0.3.30+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f4f2fc5b] + SCS_jll v300.200.1100+0 [319450e9] + SPRAL_jll v2025.9.18+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.13.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 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.14.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.13.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.18.0+0 [e37daf67] + LibGit2_jll v1.9.2+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.12.2 [4536629a] + OpenBLAS_jll v0.3.30+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.5+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [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.49s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 2855.2 ms ✓ UniqueKronecker 24282.5 ms ✓ LiftAndLearn 2 dependencies successfully precompiled in 30 seconds. 109 already precompiled. Precompilation completed after 50.2s ################################################################################ # Testing # Testing LiftAndLearn Status `/tmp/jl_wMdvZG/Project.toml` [192fc49d] LiftAndLearn v1.1.0 [37e2e46d] LinearAlgebra v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_wMdvZG/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.1.0 [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.16.0 [26cc04aa] FiniteDifferences v0.12.33 [f6369f11] ForwardDiff v1.3.2 [b6b21f68] Ipopt v1.14.1 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [4076af6c] JuMP v1.30.0 [2c470bb0] Kronecker v0.5.5 [192fc49d] LiftAndLearn v1.1.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.49.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.2 [43287f4e] PtrArrays v1.4.0 [708f8203] Richardson v1.4.2 [c946c3f1] SCS v2.6.2 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.1 [90137ffa] StaticArrays v1.9.17 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [ec057cc2] StructUtils v2.6.3 [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.13.0+0 [9cc047cb] Ipopt_jll v300.1400.1901+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.200+0 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f4f2fc5b] SCS_jll v300.200.1100+0 [319450e9] SPRAL_jll v2025.9.18+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.13.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 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.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.13.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.18.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.30+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.5+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [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.2. 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.69e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.7003484e+01 4.44e-16 1.32e-13 -1.0 1.90e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 3.7003483996854754e+01 3.7003483996854754e+01 Dual infeasibility......: 1.3236219141504801e-13 1.3236219141504801e-13 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.......: 1.3236219141504801e-13 1.3236219141504801e-13 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.896 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.026535987854004 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 74.00696799371036 └ objective_value = 37.003483996854754 [ 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.2. 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.69e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.6521049e+00 1.33e-15 2.88e-14 -1.0 5.93e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 2.6521048505497684e+00 2.6521048505497684e+00 Dual infeasibility......: 2.8815191642976806e-14 2.8815191642976806e-14 Constraint violation....: 1.3322676295501878e-15 1.3322676295501878e-15 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 2.8815191642976806e-14 2.8815191642976806e-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.771 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.7939739227294922 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 5.304209701099521 └ objective_value = 2.6521048505497684 [ 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.2. 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.69e+00 1.40e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 7.0609775e-02 1.60e+00 1.98e+00 -1.0 1.91e+00 - 1.24e-01 5.27e-02h 1 2 7.1517073e+00 9.45e-01 2.75e+01 -1.0 1.80e+00 - 1.00e+00 4.10e-01h 1 3 2.8734176e+01 2.00e-01 1.08e+01 -1.0 1.06e+00 - 1.00e+00 7.89e-01h 1 4 3.3906295e+01 7.11e-02 1.81e+01 -1.0 2.24e-01 - 1.00e+00 6.44e-01h 1 5 3.6998828e+01 5.55e-16 1.00e-06 -1.0 7.95e-02 - 1.00e+00 1.00e+00h 1 6 3.6983421e+01 5.55e-16 1.20e+01 -2.5 2.13e-04 - 8.66e-01 1.00e+00f 1 7 3.6929255e+01 6.66e-16 1.87e+00 -2.5 6.12e-04 - 8.33e-01 1.00e+00f 1 8 3.6919671e+01 6.66e-16 2.83e-08 -2.5 5.58e-04 - 1.00e+00 1.00e+00f 1 9 3.6911843e+01 5.55e-16 2.54e-01 -3.8 3.13e-04 - 8.72e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.6910802e+01 6.66e-16 1.50e-09 -3.8 1.33e-04 - 1.00e+00 1.00e+00f 1 11 3.6910223e+01 6.66e-16 1.95e-04 -5.7 2.73e-05 - 9.98e-01 1.00e+00f 1 12 3.6910220e+01 5.55e-16 1.85e-11 -5.7 4.58e-07 - 1.00e+00 1.00e+00f 1 13 3.6910212e+01 6.66e-16 1.95e-13 -8.6 3.77e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 3.6910212445060488e+01 3.6910212445060488e+01 Dual infeasibility......: 1.9539925233402755e-13 1.9539925233402755e-13 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.8535415229150732e-09 2.8535415229150732e-09 Overall NLP error.......: 2.8535415229150732e-09 2.8535415229150732e-09 Number of objective function evaluations = 14 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 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.222 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.2332699298858643 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 73.82042580217298 └ objective_value = 36.91021244506049 [ 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.2. 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.69e+00 1.66e-15 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.0302528e-01 1.21e+00 8.93e+00 -1.0 1.89e+00 -4.0 1.00e+00 2.85e-01h 1 2 1.7298204e+00 3.30e-01 5.29e+00 -1.0 1.35e+00 -4.5 1.00e+00 7.27e-01h 1 3 2.2608929e+00 1.27e-01 1.46e+01 -1.0 3.69e-01 -5.0 1.00e+00 6.16e-01h 1 4 2.6564304e+00 6.66e-16 1.01e-06 -1.0 1.41e-01 -5.4 1.00e+00 1.00e+00h 1 5 2.6561812e+00 6.66e-16 1.93e+00 -2.5 4.20e-05 -5.9 9.76e-01 1.00e+00f 1 6 2.6515451e+00 6.66e-16 6.64e+00 -2.5 3.35e-03 -6.4 1.00e+00 2.54e-01f 2 7 2.6497918e+00 7.77e-16 2.83e-08 -2.5 3.40e-04 -6.9 1.00e+00 1.00e+00f 1 8 2.6469115e+00 8.88e-16 5.42e-01 -3.8 4.78e-04 -7.3 7.98e-01 1.00e+00f 1 9 2.6453634e+00 6.66e-16 1.51e-09 -3.8 3.93e-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 2.6447034e+00 7.49e-16 8.91e-03 -5.7 3.52e-04 -8.3 9.40e-01 1.00e+00f 1 11 2.6446936e+00 6.66e-16 1.85e-11 -5.7 4.06e-06 -8.8 1.00e+00 1.00e+00f 1 12 2.6446881e+00 6.66e-16 8.04e-14 -8.6 2.26e-06 -9.2 1.00e+00 1.00e+00f 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 2.6446881324286013e+00 2.6446881324286013e+00 Dual infeasibility......: 8.0399493758834284e-14 8.0399493758834284e-14 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.6122983853106217e-09 4.6122983853106217e-09 Overall NLP error.......: 4.6122983853106217e-09 4.6122983853106217e-09 Number of objective function evaluations = 14 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 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.567 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.581134080886841 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 5.289376318889908 └ objective_value = 2.6446881324286013 [ 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.2. 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.69e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.7003476e+01 4.44e-16 1.82e-08 -1.0 1.90e+00 - 1.00e+00 1.00e+00h 1 2 3.7003476e+01 4.44e-16 3.26e-09 -9.0 3.52e-15 - 1.00e+00 1.00e+00 0 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 3.7003476354288310e+01 3.7003476354288310e+01 Dual infeasibility......: 3.2560834029027319e-09 3.2560834029027319e-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.......: 3.2560834029027319e-09 3.2560834029027319e-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.325 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.3351290225982666 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 74.0069527368853 └ objective_value = 37.00347635428831 [ 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.2. 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.69e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.6521048e+00 6.66e-16 1.89e-04 -1.0 1.89e+00 -4.0 1.00e+00 1.00e+00h 1 2 2.6521048e+00 6.66e-16 9.43e-05 -5.7 6.32e-05 -4.5 1.00e+00 5.00e-01h 2 3 2.6521048e+00 7.77e-16 5.60e-08 -5.7 1.71e-04 -5.0 1.00e+00 1.00e+00H 1 4 2.6521048e+00 6.66e-16 4.09e-08 -8.6 5.02e-04 -5.4 1.00e+00 1.00e+00h 1 5 2.6521048e+00 6.66e-16 2.75e-08 -8.6 6.03e-03 -5.9 1.00e+00 1.00e+00h 1 6 2.6521048e+00 6.66e-16 4.06e-08 -8.6 5.92e-10 -6.4 1.00e+00 1.00e+00h 1 7 2.6521048e+00 5.55e-16 6.24e-08 -8.6 4.23e-02 -6.9 1.00e+00 1.00e+00h 1 8 2.6521048e+00 5.55e-16 4.76e-08 -8.6 3.97e-02 -7.3 1.00e+00 1.00e+00H 1 9 2.6521048e+00 5.55e-16 1.69e-08 -8.6 6.21e-01 -7.8 1.00e+00 5.00e-01h 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.6521048e+00 7.77e-16 4.60e-08 -9.0 9.27e-02 -7.4 1.00e+00 1.00e+00h 1 11 2.6521048e+00 6.66e-16 2.75e-08 -9.0 6.87e-02 -7.0 1.00e+00 1.00e+00h 1 12 2.6521048e+00 5.55e-16 5.50e-08 -9.0 8.89e-02 -7.4 1.00e+00 5.00e-01h 2 13 2.6521048e+00 6.66e-16 3.14e-08 -9.0 7.73e-02 -7.0 1.00e+00 1.00e+00h 1 14 2.6521048e+00 5.55e-16 4.71e-08 -9.0 2.20e-01 -7.5 1.00e+00 1.00e+00h 1 15 2.6521048e+00 6.66e-16 2.60e-08 -9.0 4.34e-02 -7.1 1.00e+00 5.00e-01h 2 16 2.6521047e+00 4.44e-16 4.26e-08 -9.0 1.30e-01 -7.5 1.00e+00 5.00e-01h 2 17 2.6521048e+00 6.66e-16 4.80e-08 -9.0 2.59e-10 -8.0 1.00e+00 1.00e+00H 1 Number of Iterations....: 17 (scaled) (unscaled) Objective...............: 2.6521048106069247e+00 2.6521048106069247e+00 Dual infeasibility......: 4.8046011613678274e-08 4.8046011613678274e-08 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.8046011613678274e-08 4.8046011613678274e-08 Number of objective function evaluations = 32 Number of objective gradient evaluations = 18 Number of equality constraint evaluations = 32 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 = 10.672 EXIT: Solved To Acceptable Level. ┌ 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 = 10.6846342086792 │ termination_status = ALMOST_LOCALLY_SOLVED │ primal_status = NEARLY_FEASIBLE_POINT │ dual_state = NEARLY_FEASIBLE_POINT │ dual objective value = 5.304209548597357 └ objective_value = 2.6521048106069247 [ 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.2. 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.69e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.7003484e+01 4.44e-16 1.32e-13 -1.0 1.90e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 3.7003483996854754e+01 3.7003483996854754e+01 Dual infeasibility......: 1.3236219141504801e-13 1.3236219141504801e-13 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.......: 1.3236219141504801e-13 1.3236219141504801e-13 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.670 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.7817270755767822 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 74.00696799371036 └ objective_value = 37.003483996854754 [ 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.2. 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.69e+00 1.40e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 7.0609775e-02 1.60e+00 1.98e+00 -1.0 1.91e+00 - 1.24e-01 5.27e-02h 1 2 7.1517073e+00 9.45e-01 2.75e+01 -1.0 1.80e+00 - 1.00e+00 4.10e-01h 1 3 2.8734176e+01 2.00e-01 1.08e+01 -1.0 1.06e+00 - 1.00e+00 7.89e-01h 1 4 3.3906295e+01 7.11e-02 1.81e+01 -1.0 2.24e-01 - 1.00e+00 6.44e-01h 1 5 3.6998828e+01 5.55e-16 1.00e-06 -1.0 7.95e-02 - 1.00e+00 1.00e+00h 1 6 3.6983421e+01 5.55e-16 1.20e+01 -2.5 2.13e-04 - 8.66e-01 1.00e+00f 1 7 3.6929255e+01 6.66e-16 1.87e+00 -2.5 6.12e-04 - 8.33e-01 1.00e+00f 1 8 3.6919671e+01 6.66e-16 2.83e-08 -2.5 5.58e-04 - 1.00e+00 1.00e+00f 1 9 3.6911843e+01 5.55e-16 2.54e-01 -3.8 3.13e-04 - 8.72e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.6910802e+01 6.66e-16 1.50e-09 -3.8 1.33e-04 - 1.00e+00 1.00e+00f 1 11 3.6910223e+01 6.66e-16 1.95e-04 -5.7 2.73e-05 - 9.98e-01 1.00e+00f 1 12 3.6910220e+01 5.55e-16 1.85e-11 -5.7 4.58e-07 - 1.00e+00 1.00e+00f 1 13 3.6910212e+01 6.66e-16 1.95e-13 -8.6 3.77e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 3.6910212445060488e+01 3.6910212445060488e+01 Dual infeasibility......: 1.9539925233402755e-13 1.9539925233402755e-13 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.8535415229150732e-09 2.8535415229150732e-09 Overall NLP error.......: 2.8535415229150732e-09 2.8535415229150732e-09 Number of objective function evaluations = 14 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 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.376 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.389477014541626 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 73.82042580217298 └ objective_value = 36.91021244506049 [ 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.2. 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.69e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.7003476e+01 4.44e-16 1.82e-08 -1.0 1.90e+00 - 1.00e+00 1.00e+00h 1 2 3.7003476e+01 4.44e-16 3.26e-09 -9.0 3.52e-15 - 1.00e+00 1.00e+00 0 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 3.7003476354288310e+01 3.7003476354288310e+01 Dual infeasibility......: 3.2560834029027319e-09 3.2560834029027319e-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.......: 3.2560834029027319e-09 3.2560834029027319e-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.194 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.203138828277588 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 74.0069527368853 └ objective_value = 37.00347635428831 Test Summary: | Pass Total Time LiftAndLearn | 80 80 4m40.1s Testing LiftAndLearn tests passed Testing completed after 303.07s PkgEval succeeded after 394.82s