Package evaluation of LiftAndLearn on Julia 1.13.0-DEV.1080 (ed57414aec*) started at 2025-09-04T19:39:23.642 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.63s ################################################################################ # Installation # Installing LiftAndLearn... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [192fc49d] + LiftAndLearn v1.1.0 Updating `~/.julia/environments/v1.13/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.13.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v1.1.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.0 [2c470bb0] + Kronecker v0.5.5 [192fc49d] + LiftAndLearn v1.1.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.43.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.6+1 [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 v0.6.4 [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 v0.7.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.15.0+1 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.8.12 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.2+0 [efcefdf7] + PCRE2_jll v10.46.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.13.1+0 [8e850ede] + nghttp2_jll v1.67.0+0 [3f19e933] + p7zip_jll v17.6.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.04s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 358.29s ################################################################################ # Testing # Testing LiftAndLearn Status `/tmp/jl_XjSZPJ/Project.toml` [192fc49d] LiftAndLearn v1.1.0 [37e2e46d] LinearAlgebra v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_XjSZPJ/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.13.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v1.1.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.0 [2c470bb0] Kronecker v0.5.5 [192fc49d] LiftAndLearn v1.1.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.43.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.6+1 [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 v0.6.4 [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 v0.7.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.15.0+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.8.12 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.2+0 [efcefdf7] PCRE2_jll v10.46.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.13.1+0 [8e850ede] nghttp2_jll v1.67.0+0 [3f19e933] p7zip_jll v17.6.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.83e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.9948346e+01 4.44e-16 6.34e-14 -1.0 1.83e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.9948346027537035e+01 1.9948346027537035e+01 Dual infeasibility......: 6.3379345132284364e-14 6.3379345132284364e-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.......: 6.3379345132284364e-14 6.3379345132284364e-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 = 3.132 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.2714600563049316 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 39.89669205507408 └ objective_value = 19.948346027537035 [ 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.83e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.1017717e+00 6.66e-16 1.81e-04 -1.0 1.81e+00 -4.0 1.00e+00 1.00e+00h 1 2 3.1017717e+00 6.66e-16 2.74e-10 -5.7 8.21e-06 -4.5 1.00e+00 1.00e+00h 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 3.1017717186065275e+00 3.1017717186065275e+00 Dual infeasibility......: 2.7380537546318887e-10 2.7380537546318887e-10 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 2.7380537546318887e-10 2.7380537546318887e-10 Number of objective function evaluations = 3 Number of objective gradient evaluations = 3 Number of equality constraint evaluations = 3 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.326 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Hard Equality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 1.3410470485687256 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 6.203543438176585 └ objective_value = 3.1017717186065275 [ 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.83e+00 4.49e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.2556458e-01 1.67e+00 1.85e+01 -1.0 1.84e+00 - 1.00e+00 8.81e-02h 1 2 1.5384539e+01 2.27e-01 3.60e+00 -1.0 1.66e+00 - 1.00e+00 8.64e-01h 1 3 1.6422886e+01 1.67e-01 8.06e+01 -1.0 2.28e-01 - 1.00e+00 2.63e-01h 1 4 1.9940618e+01 6.66e-16 1.00e-06 -1.0 1.67e-01 - 1.00e+00 1.00e+00h 1 5 1.9936801e+01 4.44e-16 5.46e+00 -2.5 8.72e-05 - 9.48e-01 1.00e+00f 1 6 1.9906800e+01 4.44e-16 2.83e-08 -2.5 8.02e-04 - 1.00e+00 1.00e+00f 1 7 1.9900789e+01 4.44e-16 3.91e-01 -3.8 3.57e-04 - 8.31e-01 1.00e+00f 1 8 1.9899085e+01 5.55e-16 1.50e-09 -3.8 4.34e-04 - 1.00e+00 1.00e+00f 1 9 1.9898545e+01 6.66e-16 1.24e-03 -5.7 4.31e-05 - 9.88e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.9898538e+01 4.44e-16 1.84e-11 -5.7 1.92e-06 - 1.00e+00 1.00e+00f 1 11 1.9898530e+01 6.66e-16 2.17e-13 -8.6 8.15e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 1.9898530333386780e+01 1.9898530333386780e+01 Dual infeasibility......: 2.1671553440683056e-13 2.1671553440683056e-13 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.2589648739873729e-09 3.2589648739873729e-09 Overall NLP error.......: 3.2589648739873729e-09 3.2589648739873729e-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.253 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.2675459384918213 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 39.797061144543 └ objective_value = 19.89853033338678 [ 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.83e+00 5.53e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8715391e-01 1.36e+00 9.64e+00 -1.0 1.81e+00 - 1.00e+00 2.53e-01h 1 2 2.0357824e+00 3.52e-01 4.96e+00 -1.0 1.35e+00 - 1.00e+00 7.42e-01h 1 3 2.6252392e+00 1.43e-01 1.60e+01 -1.0 3.50e-01 - 1.00e+00 5.93e-01h 1 4 3.1062794e+00 1.59e-10 1.00e-06 -1.0 1.41e-01 - 1.00e+00 1.00e+00h 1 5 3.1059848e+00 3.81e-14 2.52e+00 -2.5 4.63e-05 -4.0 9.68e-01 1.00e+00h 1 6 3.1007982e+00 7.02e-13 6.29e+00 -2.5 2.86e-03 -4.5 1.00e+00 2.90e-01f 2 7 3.0990281e+00 2.32e-13 3.11e-08 -2.5 2.51e-04 -5.0 1.00e+00 1.00e+00f 1 8 3.0960216e+00 1.85e-13 4.87e-01 -3.8 4.62e-04 - 8.18e-01 1.00e+00f 1 9 3.0950051e+00 1.10e-13 1.50e-09 -3.8 4.12e-04 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.0945568e+00 4.31e-14 3.74e-02 -5.7 4.08e-04 -5.4 7.48e-01 1.00e+00f 1 11 3.0944872e+00 4.69e-14 5.46e-10 -5.7 4.28e-04 -5.9 1.00e+00 1.00e+00f 1 12 3.0944816e+00 7.77e-16 1.03e-05 -8.6 1.33e-05 -6.4 9.94e-01 1.00e+00h 1 13 3.0944816e+00 6.66e-16 4.06e-14 -8.6 1.13e-07 -6.9 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 3.0944816230483485e+00 3.0944816230483485e+00 Dual infeasibility......: 4.0610873106879499e-14 4.0610873106879499e-14 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5060456179884713e-09 2.5060456179884713e-09 Overall NLP error.......: 2.5060456179884713e-09 2.5060456179884713e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 15 Number of inequality constraint evaluations = 15 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 5.149 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.173069953918457 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 6.188963298886337 └ objective_value = 3.0944816230483485 [ 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.83e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.9948344e+01 4.44e-16 4.49e-09 -1.0 1.83e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.9948343822482428e+01 1.9948343822482428e+01 Dual infeasibility......: 4.4883528005357221e-09 4.4883528005357221e-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.4883528005357221e-09 4.4883528005357221e-09 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.213 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.2250628471374512 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 39.896687657316576 └ objective_value = 19.94834382248243 [ 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.83e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.1017716e+00 6.66e-16 2.05e-08 -1.0 1.81e+00 - 1.00e+00 1.00e+00h 1 2 3.1017716e+00 6.66e-16 7.45e-09 -9.0 1.53e-15 - 1.00e+00 1.00e+00 0 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 3.1017716182929749e+00 3.1017716182929749e+00 Dual infeasibility......: 7.4505798368734073e-09 7.4505798368734073e-09 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 7.4505798368734073e-09 7.4505798368734073e-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.538 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.5506939888000488 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 6.20354324020545 └ objective_value = 3.101771618292975 [ 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.83e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.9948346e+01 4.44e-16 6.34e-14 -1.0 1.83e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.9948346027537035e+01 1.9948346027537035e+01 Dual infeasibility......: 6.3379345132284364e-14 6.3379345132284364e-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.......: 6.3379345132284364e-14 6.3379345132284364e-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.764 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.7761268615722656 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 39.89669205507408 └ objective_value = 19.948346027537035 [ 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.83e+00 4.49e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.2556458e-01 1.67e+00 1.85e+01 -1.0 1.84e+00 - 1.00e+00 8.81e-02h 1 2 1.5384539e+01 2.27e-01 3.60e+00 -1.0 1.66e+00 - 1.00e+00 8.64e-01h 1 3 1.6422886e+01 1.67e-01 8.06e+01 -1.0 2.28e-01 - 1.00e+00 2.63e-01h 1 4 1.9940618e+01 6.66e-16 1.00e-06 -1.0 1.67e-01 - 1.00e+00 1.00e+00h 1 5 1.9936801e+01 4.44e-16 5.46e+00 -2.5 8.72e-05 - 9.48e-01 1.00e+00f 1 6 1.9906800e+01 4.44e-16 2.83e-08 -2.5 8.02e-04 - 1.00e+00 1.00e+00f 1 7 1.9900789e+01 4.44e-16 3.91e-01 -3.8 3.57e-04 - 8.31e-01 1.00e+00f 1 8 1.9899085e+01 5.55e-16 1.50e-09 -3.8 4.34e-04 - 1.00e+00 1.00e+00f 1 9 1.9898545e+01 6.66e-16 1.24e-03 -5.7 4.31e-05 - 9.88e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.9898538e+01 4.44e-16 1.84e-11 -5.7 1.92e-06 - 1.00e+00 1.00e+00f 1 11 1.9898530e+01 6.66e-16 2.17e-13 -8.6 8.15e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 1.9898530333386780e+01 1.9898530333386780e+01 Dual infeasibility......: 2.1671553440683056e-13 2.1671553440683056e-13 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.2589648739873729e-09 3.2589648739873729e-09 Overall NLP error.......: 3.2589648739873729e-09 3.2589648739873729e-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.318 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.32855486869812 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 39.797061144543 └ objective_value = 19.89853033338678 [ 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.83e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.9948344e+01 4.44e-16 4.49e-09 -1.0 1.83e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.9948343822482428e+01 1.9948343822482428e+01 Dual infeasibility......: 4.4883528005357221e-09 4.4883528005357221e-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.4883528005357221e-09 4.4883528005357221e-09 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.225 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.2371861934661865 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 39.896687657316576 └ objective_value = 19.94834382248243 Test Summary: | Pass Total Time LiftAndLearn | 80 80 4m27.6s Testing LiftAndLearn tests passed Testing completed after 283.88s PkgEval succeeded after 691.77s