Package evaluation of LiftAndLearn on Julia 1.12.0-rc2.1 (1fad90817e*) started at 2025-09-11T10:26:02.821 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.93s ################################################################################ # Installation # Installing LiftAndLearn... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [192fc49d] + LiftAndLearn v1.1.0 Updating `~/.julia/environments/v1.12/Manifest.toml` [66dad0bd] + AliasTables v1.1.3 [6e4b80f9] + BenchmarkTools v1.6.0 ⌅ [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.0 [9a962f9c] + DataAPI v1.16.0 [864edb3b] + DataStructures v0.19.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [1a297f60] + FillArrays v1.14.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v1.2.0 [b6b21f68] + Ipopt v1.11.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [4076af6c] + JuMP v1.29.1 [2c470bb0] + Kronecker v0.5.5 [192fc49d] + LiftAndLearn v1.1.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.44.0 [e1d29d7a] + Missings v1.2.0 [d8a4904e] + MutableArithmetics v1.6.4 [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.2.0 [a2af1166] + SortingAlgorithms v1.2.2 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.1 [2913bbd2] + StatsBase v0.34.6 [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.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 v3.2.8+0 [319450e9] + SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] + XML2_jll v2.13.8+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.6.0 [7b1f6079] + FileWatching v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.12.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.12.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.11.1+1 [e37daf67] + LibGit2_jll v1.9.0+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.5.20 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.1+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+1 [8e850ede] + nghttp2_jll v1.64.0+1 [3f19e933] + p7zip_jll v17.5.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 4.87s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 345.74s ################################################################################ # Testing # Testing LiftAndLearn Status `/tmp/jl_nlS7gF/Project.toml` [192fc49d] LiftAndLearn v1.1.0 [37e2e46d] LinearAlgebra v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_nlS7gF/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [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.0 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [1a297f60] FillArrays v1.14.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v1.2.0 [b6b21f68] Ipopt v1.11.0 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.1 [2c470bb0] Kronecker v0.5.5 [192fc49d] LiftAndLearn v1.1.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.44.0 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.4 [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.2.0 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.5.1 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.6 [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.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 v3.2.8+0 [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.8+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.6.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.12.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.12.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.11.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.1+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+1 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.5.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.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.90e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.9967659e+01 4.44e-16 9.53e-14 -1.0 1.90e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 2.9967658879923544e+01 2.9967658879923544e+01 Dual infeasibility......: 9.5307158024770277e-14 9.5307158024770277e-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.......: 9.5307158024770277e-14 9.5307158024770277e-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.707 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 = 2.8613791465759277 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 59.93531775984744 └ objective_value = 29.967658879923544 [ 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.90e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.9741362e+00 6.66e-16 3.32e-14 -1.0 1.89e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 3.9741362019160369e+00 3.9741362019160369e+00 Dual infeasibility......: 3.3228094456650402e-14 3.3228094456650402e-14 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.......: 3.3228094456650402e-14 3.3228094456650402e-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.798 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.8215019702911377 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 7.9482724038321315 └ objective_value = 3.974136201916037 [ 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.90e+00 7.64e-17 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.9611345e-02 1.78e+00 3.53e+00 -1.0 1.91e+00 - 2.07e-01 6.35e-02h 1 2 1.0738452e+01 7.65e-01 1.61e+01 -1.0 1.78e+00 - 1.00e+00 5.69e-01h 1 3 1.6898450e+01 4.69e-01 5.47e+01 -1.0 7.65e-01 - 1.00e+00 3.88e-01h 1 4 2.9961180e+01 5.55e-16 1.00e-06 -1.0 4.69e-01 - 1.00e+00 1.00e+00h 1 5 2.9949526e+01 5.55e-16 9.68e+00 -2.5 1.87e-04 - 8.93e-01 1.00e+00f 1 6 2.9903956e+01 4.44e-16 2.83e-08 -2.5 8.90e-04 - 1.00e+00 1.00e+00f 1 7 2.9896563e+01 5.55e-16 4.65e-01 -3.8 4.54e-04 - 7.73e-01 1.00e+00f 1 8 2.9894950e+01 6.66e-16 1.50e-09 -3.8 3.09e-04 - 1.00e+00 1.00e+00f 1 9 2.9894387e+01 6.66e-16 6.26e-04 -5.7 3.38e-05 - 9.93e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.9894382e+01 6.66e-16 1.84e-11 -5.7 9.16e-07 - 1.00e+00 1.00e+00f 1 11 2.9894374e+01 6.66e-16 2.70e-13 -8.6 5.44e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 2.9894374252011445e+01 2.9894374252011445e+01 Dual infeasibility......: 2.7000623958883807e-13 2.7000623958883807e-13 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.0080171347701214e-09 3.0080171347701214e-09 Overall NLP error.......: 3.0080171347701214e-09 3.0080171347701214e-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.117 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.1288681030273438 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 59.788749216342254 └ objective_value = 29.894374252011445 [ 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.90e+00 9.29e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6150708e-01 1.50e+00 1.08e+01 -1.0 1.90e+00 -4.0 1.00e+00 2.10e-01h 1 2 2.6533412e+00 3.52e-01 4.57e+00 -1.0 1.49e+00 -4.5 1.00e+00 7.65e-01h 1 3 3.3282954e+00 1.58e-01 1.90e+01 -1.0 3.52e-01 -5.0 1.00e+00 5.52e-01h 1 4 3.9791208e+00 6.66e-16 1.01e-06 -1.0 1.57e-01 -5.4 1.00e+00 1.00e+00h 1 5 3.9786782e+00 6.66e-16 3.59e+00 -2.5 5.41e-05 -5.9 9.55e-01 1.00e+00f 1 6 3.9662094e+00 6.66e-16 2.53e+00 -2.5 2.19e-03 -6.4 1.00e+00 7.10e-01f 1 7 3.9676509e+00 6.66e-16 2.83e-08 -2.5 2.10e-04 -6.9 1.00e+00 1.00e+00f 1 8 3.9662222e+00 6.66e-16 2.22e-01 -3.8 1.72e-04 -7.3 9.17e-01 1.00e+00f 1 9 3.9652298e+00 8.88e-16 1.51e-09 -3.8 5.53e-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 3.9649582e+00 6.66e-16 3.31e-02 -5.7 3.67e-04 -8.3 7.78e-01 1.00e+00f 1 11 3.9648934e+00 6.66e-16 1.91e-11 -5.7 4.05e-04 -8.8 1.00e+00 1.00e+00f 1 12 3.9648877e+00 6.66e-16 1.04e-05 -8.6 1.35e-05 -9.2 9.94e-01 1.00e+00f 1 13 3.9648877e+00 8.88e-16 8.85e-14 -8.6 1.17e-07 -9.7 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 3.9648876672652213e+00 3.9648876672652213e+00 Dual infeasibility......: 8.8491429727192782e-14 8.8491429727192782e-14 Constraint violation....: 8.8817841970012523e-16 8.8817841970012523e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5060506190297650e-09 2.5060506190297650e-09 Overall NLP error.......: 2.5060506190297650e-09 2.5060506190297650e-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 = 5.652 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.716525077819824 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 7.9297754068922135 └ objective_value = 3.9648876672652213 [ 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.90e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.9967654e+01 4.44e-16 2.63e-08 -1.0 1.90e+00 - 1.00e+00 1.00e+00h 1 2 2.9967654e+01 4.44e-16 6.97e-09 -8.6 4.44e-15 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 2.9967654012795730e+01 2.9967654012795730e+01 Dual infeasibility......: 6.9692163151557907e-09 6.9692163151557907e-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.......: 6.9692163151557907e-09 6.9692163151557907e-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.296 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.31575608253479 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 59.93530803480243 └ objective_value = 29.96765401279573 [ 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.90e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.9741360e+00 5.55e-16 1.89e-04 -1.0 1.89e+00 -4.0 1.00e+00 1.00e+00h 1 2 3.9741360e+00 5.55e-16 9.07e-09 -5.7 6.11e-05 -4.5 1.00e+00 1.00e+00H 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 3.9741360378020785e+00 3.9741360378020785e+00 Dual infeasibility......: 9.0729592727711861e-09 9.0729592727711861e-09 Constraint violation....: 5.5511151231257827e-16 5.5511151231257827e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 9.0729592727711861e-09 9.0729592727711861e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 3 Number of equality constraint evaluations = 5 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.269 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 = 2.2962658405303955 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 7.948272079386136 └ objective_value = 3.9741360378020785 [ 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.90e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.9967659e+01 4.44e-16 9.53e-14 -1.0 1.90e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 2.9967658879923544e+01 2.9967658879923544e+01 Dual infeasibility......: 9.5307158024770277e-14 9.5307158024770277e-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.......: 9.5307158024770277e-14 9.5307158024770277e-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.704 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.7154619693756104 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 59.93531775984744 └ objective_value = 29.967658879923544 [ 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.90e+00 7.64e-17 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.9611345e-02 1.78e+00 3.53e+00 -1.0 1.91e+00 - 2.07e-01 6.35e-02h 1 2 1.0738452e+01 7.65e-01 1.61e+01 -1.0 1.78e+00 - 1.00e+00 5.69e-01h 1 3 1.6898450e+01 4.69e-01 5.47e+01 -1.0 7.65e-01 - 1.00e+00 3.88e-01h 1 4 2.9961180e+01 5.55e-16 1.00e-06 -1.0 4.69e-01 - 1.00e+00 1.00e+00h 1 5 2.9949526e+01 5.55e-16 9.68e+00 -2.5 1.87e-04 - 8.93e-01 1.00e+00f 1 6 2.9903956e+01 4.44e-16 2.83e-08 -2.5 8.90e-04 - 1.00e+00 1.00e+00f 1 7 2.9896563e+01 5.55e-16 4.65e-01 -3.8 4.54e-04 - 7.73e-01 1.00e+00f 1 8 2.9894950e+01 6.66e-16 1.50e-09 -3.8 3.09e-04 - 1.00e+00 1.00e+00f 1 9 2.9894387e+01 6.66e-16 6.26e-04 -5.7 3.38e-05 - 9.93e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.9894382e+01 6.66e-16 1.84e-11 -5.7 9.16e-07 - 1.00e+00 1.00e+00f 1 11 2.9894374e+01 6.66e-16 2.70e-13 -8.6 5.44e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 2.9894374252011445e+01 2.9894374252011445e+01 Dual infeasibility......: 2.7000623958883807e-13 2.7000623958883807e-13 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.0080171347701214e-09 3.0080171347701214e-09 Overall NLP error.......: 3.0080171347701214e-09 3.0080171347701214e-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.140 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.1520488262176514 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 59.788749216342254 └ objective_value = 29.894374252011445 [ 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.90e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.9967654e+01 4.44e-16 2.63e-08 -1.0 1.90e+00 - 1.00e+00 1.00e+00h 1 2 2.9967654e+01 4.44e-16 6.97e-09 -8.6 4.44e-15 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 2.9967654012795730e+01 2.9967654012795730e+01 Dual infeasibility......: 6.9692163151557907e-09 6.9692163151557907e-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.......: 6.9692163151557907e-09 6.9692163151557907e-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.337 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.3501439094543457 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 59.93530803480243 └ objective_value = 29.96765401279573 Test Summary: | Pass Total Time LiftAndLearn | 80 80 4m04.2s Testing LiftAndLearn tests passed Testing completed after 264.68s PkgEval succeeded after 656.39s