Package evaluation to test LiftAndLearn on Julia 1.14.0-DEV.1613 (8dab3f0623*) started at 2026-01-25T20:32:40.042 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 9.56s ################################################################################ # 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.1 [b6b21f68] + Ipopt v1.14.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [0f8b85d8] + JSON3 v1.14.3 [4076af6c] + JuMP v1.29.4 [2c470bb0] + Kronecker v0.5.5 [192fc49d] + LiftAndLearn v1.1.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.48.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.1 [43287f4e] + PtrArrays v1.3.0 [708f8203] + Richardson v1.4.2 [c946c3f1] + SCS v2.6.0 [a2af1166] + SortingAlgorithms v1.2.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.16 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.8.0 [2913bbd2] + StatsBase v0.34.10 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.2 [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.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 [a63ad114] + Mmap 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.4+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.68.0+1 [3f19e933] + p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.16s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 3649.9 ms ✓ UniqueKronecker 27943.1 ms ✓ LiftAndLearn 2 dependencies successfully precompiled in 41 seconds. 112 already precompiled. Precompilation completed after 51.6s ################################################################################ # Testing # Testing LiftAndLearn Status `/tmp/jl_x3Bk1M/Project.toml` [192fc49d] LiftAndLearn v1.1.0 [37e2e46d] LinearAlgebra v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_x3Bk1M/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.1 [b6b21f68] Ipopt v1.14.0 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.4 [2c470bb0] Kronecker v0.5.5 [192fc49d] LiftAndLearn v1.1.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.48.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.1 [43287f4e] PtrArrays v1.3.0 [708f8203] Richardson v1.4.2 [c946c3f1] SCS v2.6.0 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [90137ffa] StaticArrays v1.9.16 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.2 [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.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 [a63ad114] Mmap 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.4+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... ┌ Warning: The call to compilecache failed to create a usable precompiled cache file for LiftAndLearn [192fc49d-b0e9-4795-8347-9ce9b8a8946d] │ exception = Required dependency Base.PkgId(Base.UUID("a2af1166-a08f-5f64-846c-94a0d3cef48c"), "SortingAlgorithms") failed to load from a cache file. └ @ Base loading.jl:2939 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.48e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 6.3608951e+00 4.44e-16 2.11e-14 -1.0 1.79e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 6.3608951347777563e+00 6.3608951347777563e+00 Dual infeasibility......: 2.1112163661911044e-14 2.1112163661911044e-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.......: 2.1112163661911044e-14 2.1112163661911044e-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.157 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.2737619876861572 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 12.721790269555594 └ objective_value = 6.360895134777756 [ 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.48e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.5543980e+00 8.33e-16 1.39e-14 -1.0 6.72e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.5543980390661376e+00 1.5543980390661376e+00 Dual infeasibility......: 1.3919434260802407e-14 1.3919434260802407e-14 Constraint violation....: 8.3266726846886741e-16 8.3266726846886741e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 1.3919434260802407e-14 1.3919434260802407e-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.770 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.778454065322876 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 3.1087960781323103 └ objective_value = 1.5543980390661376 [ 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.48e+00 4.79e-17 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.7074380e-01 1.16e+00 1.07e+01 -1.0 1.79e+00 - 1.00e+00 2.14e-01h 1 2 4.2398261e+00 2.75e-01 4.67e+00 -1.0 1.40e+00 - 1.00e+00 7.63e-01h 1 3 5.3343190e+00 1.22e-01 1.86e+01 -1.0 3.34e-01 - 1.00e+00 5.57e-01h 1 4 6.3690479e+00 4.44e-16 1.00e-06 -1.0 1.47e-01 - 1.00e+00 1.00e+00h 1 5 6.3683066e+00 6.66e-16 3.49e+00 -2.5 5.31e-05 - 9.56e-01 1.00e+00f 1 6 6.3522870e+00 3.33e-16 2.65e+00 -2.5 2.25e-03 - 1.00e+00 6.97e-01f 1 7 6.3494529e+00 6.66e-16 2.83e-08 -2.5 5.13e-04 - 1.00e+00 1.00e+00f 1 8 6.3462000e+00 5.55e-16 2.53e-01 -3.8 2.39e-04 - 9.05e-01 1.00e+00f 1 9 6.3445174e+00 6.66e-16 1.50e-09 -3.8 4.68e-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 6.3439341e+00 4.44e-16 1.19e-02 -5.7 3.06e-04 - 8.58e-01 1.00e+00f 1 11 6.3439072e+00 4.44e-16 1.84e-11 -5.7 3.71e-05 - 1.00e+00 1.00e+00f 1 12 6.3438998e+00 4.44e-16 3.00e-07 -8.6 3.30e-06 - 1.00e+00 1.00e+00f 1 13 6.3438998e+00 4.44e-16 3.38e-14 -8.6 5.69e-09 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 6.3438998178966726e+00 6.3438998178966726e+00 Dual infeasibility......: 3.3750779948604759e-14 3.3750779948604759e-14 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059106849224660e-09 2.5059106849224660e-09 Overall NLP error.......: 2.5059106849224660e-09 2.5059106849224660e-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.596 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.606050968170166 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 12.687799785557273 └ objective_value = 6.343899817896673 [ 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.48e+00 2.19e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.4997590e-01 8.74e-01 6.77e+00 -1.0 1.80e+00 -4.0 1.00e+00 4.07e-01h 1 2 1.0156805e+00 2.87e-01 6.56e+00 -1.0 1.06e+00 -4.5 1.00e+00 6.72e-01h 1 3 1.3639151e+00 9.11e-02 1.15e+01 -1.0 3.50e-01 -5.0 1.00e+00 6.82e-01h 1 4 1.5569234e+00 5.55e-16 1.01e-06 -1.0 1.10e-01 -5.4 1.00e+00 1.00e+00h 1 5 1.5568129e+00 6.66e-16 1.44e-01 -2.5 3.47e-05 -5.9 9.98e-01 1.00e+00f 1 6 1.5540660e+00 8.88e-16 5.96e+00 -2.5 4.70e-03 -6.4 1.00e+00 1.87e-01f 2 7 1.5535991e+00 6.66e-16 2.83e-08 -2.5 1.32e-04 -6.9 1.00e+00 1.00e+00f 1 8 1.5523443e+00 5.55e-16 5.25e-01 -3.8 3.95e-04 -7.3 8.04e-01 1.00e+00f 1 9 1.5512489e+00 5.55e-16 1.51e-09 -3.8 3.19e-04 -7.8 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.5508149e+00 6.66e-16 4.37e-02 -5.7 5.72e-04 -8.3 7.06e-01 1.00e+00f 1 11 1.5507272e+00 4.44e-16 1.88e-11 -5.7 1.87e-04 -8.8 1.00e+00 1.00e+00f 1 12 1.5507217e+00 4.44e-16 3.85e-06 -8.6 6.63e-06 -9.2 9.98e-01 1.00e+00f 1 13 1.5507217e+00 6.66e-16 2.53e-14 -8.6 2.67e-08 -9.7 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 1.5507217364582830e+00 1.5507217364582830e+00 Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-14 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059370292859388e-09 2.5059370292859388e-09 Overall NLP error.......: 2.5059370292859388e-09 2.5059370292859388e-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 = 4.305 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.326115846633911 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 3.10144348958401 └ objective_value = 1.550721736458283 [ 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.48e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 6.3608949e+00 2.22e-16 1.55e-08 -1.0 1.79e+00 - 1.00e+00 1.00e+00h 1 2 6.3608949e+00 5.55e-16 1.43e-08 -9.0 3.71e-15 - 1.00e+00 1.00e+00h 1 3 6.3608949e+00 6.66e-16 6.14e-10 -9.0 4.92e-16 - 1.00e+00 1.00e+00 0 Number of Iterations....: 3 (scaled) (unscaled) Objective...............: 6.3608948877683815e+00 6.3608948877683815e+00 Dual infeasibility......: 6.1382898763895355e-10 6.1382898763895355e-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.......: 6.1382898763895355e-10 6.1382898763895355e-10 Number of objective function evaluations = 4 Number of objective gradient evaluations = 4 Number of equality constraint evaluations = 4 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.638 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.6488490104675293 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 12.721789774048219 └ objective_value = 6.3608948877683815 [ 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.48e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.5543980e+00 6.66e-16 1.79e-04 -1.0 1.79e+00 -4.0 1.00e+00 1.00e+00h 1 2 1.5543980e+00 4.44e-16 7.93e-09 -5.7 1.85e-04 -4.5 1.00e+00 1.00e+00h 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: 1.5543980075909745e+00 1.5543980075909745e+00 Dual infeasibility......: 7.9284609786253697e-09 7.9284609786253697e-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.......: 7.9284609786253697e-09 7.9284609786253697e-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 = 2.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 = 2.2337591648101807 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 3.1087960357213285 └ objective_value = 1.5543980075909745 [ 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.48e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 6.3608951e+00 4.44e-16 2.11e-14 -1.0 1.79e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 6.3608951347777563e+00 6.3608951347777563e+00 Dual infeasibility......: 2.1112163661911044e-14 2.1112163661911044e-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.......: 2.1112163661911044e-14 2.1112163661911044e-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.700 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.708914041519165 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 12.721790269555594 └ objective_value = 6.360895134777756 [ 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.48e+00 4.79e-17 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.7074380e-01 1.16e+00 1.07e+01 -1.0 1.79e+00 - 1.00e+00 2.14e-01h 1 2 4.2398261e+00 2.75e-01 4.67e+00 -1.0 1.40e+00 - 1.00e+00 7.63e-01h 1 3 5.3343190e+00 1.22e-01 1.86e+01 -1.0 3.34e-01 - 1.00e+00 5.57e-01h 1 4 6.3690479e+00 4.44e-16 1.00e-06 -1.0 1.47e-01 - 1.00e+00 1.00e+00h 1 5 6.3683066e+00 6.66e-16 3.49e+00 -2.5 5.31e-05 - 9.56e-01 1.00e+00f 1 6 6.3522870e+00 3.33e-16 2.65e+00 -2.5 2.25e-03 - 1.00e+00 6.97e-01f 1 7 6.3494529e+00 6.66e-16 2.83e-08 -2.5 5.13e-04 - 1.00e+00 1.00e+00f 1 8 6.3462000e+00 5.55e-16 2.53e-01 -3.8 2.39e-04 - 9.05e-01 1.00e+00f 1 9 6.3445174e+00 6.66e-16 1.50e-09 -3.8 4.68e-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 6.3439341e+00 4.44e-16 1.19e-02 -5.7 3.06e-04 - 8.58e-01 1.00e+00f 1 11 6.3439072e+00 4.44e-16 1.84e-11 -5.7 3.71e-05 - 1.00e+00 1.00e+00f 1 12 6.3438998e+00 4.44e-16 3.00e-07 -8.6 3.30e-06 - 1.00e+00 1.00e+00f 1 13 6.3438998e+00 4.44e-16 3.38e-14 -8.6 5.69e-09 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 6.3438998178966726e+00 6.3438998178966726e+00 Dual infeasibility......: 3.3750779948604759e-14 3.3750779948604759e-14 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059106849224660e-09 2.5059106849224660e-09 Overall NLP error.......: 2.5059106849224660e-09 2.5059106849224660e-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.575 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.5827431678771973 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 12.687799785557273 └ objective_value = 6.343899817896673 [ 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.48e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 6.3608949e+00 2.22e-16 1.55e-08 -1.0 1.79e+00 - 1.00e+00 1.00e+00h 1 2 6.3608949e+00 5.55e-16 1.43e-08 -9.0 3.71e-15 - 1.00e+00 1.00e+00h 1 3 6.3608949e+00 6.66e-16 6.14e-10 -9.0 4.92e-16 - 1.00e+00 1.00e+00 0 Number of Iterations....: 3 (scaled) (unscaled) Objective...............: 6.3608948877683815e+00 6.3608948877683815e+00 Dual infeasibility......: 6.1382898763895355e-10 6.1382898763895355e-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.......: 6.1382898763895355e-10 6.1382898763895355e-10 Number of objective function evaluations = 4 Number of objective gradient evaluations = 4 Number of equality constraint evaluations = 4 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.623 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.6317808628082275 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 12.721789774048219 └ objective_value = 6.3608948877683815 Test Summary: | Pass Total Time LiftAndLearn | 80 80 2m58.1s Testing LiftAndLearn tests passed Testing completed after 276.31s PkgEval succeeded after 362.99s