Package evaluation to test OptimizationMOI on Julia 1.13.0-DEV.1307 (5a5fc987d0*) started at 2025-10-16T23:34:37.711 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 10.3s ################################################################################ # Installation # Installing OptimizationMOI... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [fd9f6733] + OptimizationMOI v0.5.8 Updating `~/.julia/environments/v1.13/Manifest.toml` [47edcb42] + ADTypes v1.18.0 [1520ce14] + AbstractTrees v0.4.5 [7d9f7c33] + Accessors v0.1.42 [79e6a3ab] + Adapt v4.4.0 [66dad0bd] + AliasTables v1.1.3 [ec485272] + ArnoldiMethod v0.4.0 [4fba245c] + ArrayInterface v7.21.0 [4c555306] + ArrayLayouts v1.12.0 [6e4b80f9] + BenchmarkTools v1.6.1 [e2ed5e7c] + Bijections v0.2.2 [62783981] + BitTwiddlingConvenienceFunctions v0.1.6 [8e7c35d0] + BlockArrays v1.7.2 [70df07ce] + BracketingNonlinearSolve v1.5.0 [2a0fbf3d] + CPUSummary v0.2.7 [d360d2e6] + ChainRulesCore v1.26.0 [fb6a15b2] + CloseOpenIntervals v0.1.13 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 ⌅ [861a8166] + Combinatorics v1.0.2 [a80b9123] + CommonMark v0.9.1 [38540f10] + CommonSolve v0.2.4 [bbf7d656] + CommonSubexpressions v0.3.1 [f70d9fcc] + CommonWorldInvalidations v1.0.0 [34da2185] + Compat v4.18.1 [b152e2b5] + CompositeTypes v0.1.4 [a33af91c] + CompositionsBase v0.1.2 [2569d6c7] + ConcreteStructs v0.2.3 [187b0558] + ConstructionBase v1.6.0 [adafc99b] + CpuId v0.3.1 [9a962f9c] + DataAPI v1.16.0 [864edb3b] + DataStructures v0.19.1 [2b5f629d] + DiffEqBase v6.190.2 [459566f4] + DiffEqCallbacks v4.10.1 [77a26b50] + DiffEqNoiseProcess v5.24.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [a0c0ee7d] + DifferentiationInterface v0.7.9 [8d63f2c5] + DispatchDoctor v0.4.26 [31c24e10] + Distributions v0.25.122 [ffbed154] + DocStringExtensions v0.9.5 [5b8099bc] + DomainSets v0.7.16 [7c1d4256] + DynamicPolynomials v0.6.4 [06fc5a27] + DynamicQuantities v1.10.0 [4e289a0a] + EnumX v1.0.5 [f151be2c] + EnzymeCore v0.8.14 [e2ba6199] + ExprTools v0.1.10 [55351af7] + ExproniconLite v0.10.14 [7034ab61] + FastBroadcast v0.3.5 [9aa1b823] + FastClosures v0.3.2 [a4df4552] + FastPower v1.1.3 [1a297f60] + FillArrays v1.14.0 [64ca27bc] + FindFirstFunctions v1.4.2 [6a86dc24] + FiniteDiff v2.29.0 [1fa38f19] + Format v1.3.7 [f6369f11] + ForwardDiff v1.2.2 [069b7b12] + FunctionWrappers v1.1.3 [77dc65aa] + FunctionWrappersWrappers v0.1.3 [46192b85] + GPUArraysCore v0.2.0 [c27321d9] + Glob v1.3.1 [86223c79] + Graphs v1.13.1 [34004b35] + HypergeometricFunctions v0.3.28 [615f187c] + IfElse v0.1.1 [3263718b] + ImplicitDiscreteSolve v1.2.0 [d25df0c9] + Inflate v0.1.5 [18e54dd8] + IntegerMathUtils v0.1.3 [8197267c] + IntervalSets v0.7.11 [3587e190] + InverseFunctions v0.1.17 [92d709cd] + IrrationalConstants v0.2.6 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.1.0 [0f8b85d8] + JSON3 v1.14.3 [ae98c720] + Jieko v0.2.1 [98e50ef6] + JuliaFormatter v2.1.6 ⌅ [70703baa] + JuliaSyntax v0.4.10 [ccbc3e58] + JumpProcesses v9.19.1 [b964fa9f] + LaTeXStrings v1.4.0 [23fbe1c1] + Latexify v0.16.10 [10f19ff3] + LayoutPointers v0.1.17 [87fe0de2] + LineSearch v0.1.4 [d3d80556] + LineSearches v7.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [d8e11817] + MLStyle v0.4.17 [1914dd2f] + MacroTools v0.5.16 [d125e4d3] + ManualMemory v0.1.8 [b8f27783] + MathOptInterface v1.45.0 [bb5d69b7] + MaybeInplace v0.1.4 [e1d29d7a] + Missings v1.2.0 [961ee093] + ModelingToolkit v10.26.0 [2e0e35c7] + Moshi v0.3.7 [46d2c3a1] + MuladdMacro v0.2.4 [102ac46a] + MultivariatePolynomials v0.5.13 [d8a4904e] + MutableArithmetics v1.6.6 [d41bc354] + NLSolversBase v7.10.0 [77ba4419] + NaNMath v1.1.3 [be0214bd] + NonlinearSolveBase v2.0.0 [6fe1bfb0] + OffsetArrays v1.17.0 [429524aa] + Optim v1.13.2 [bca83a33] + OptimizationBase v3.3.0 [fd9f6733] + OptimizationMOI v0.5.8 [bac558e1] + OrderedCollections v1.8.1 [bbf590c4] + OrdinaryDiffEqCore v1.36.0 [90014a1f] + PDMats v0.11.35 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.3 [e409e4f3] + PoissonRandom v0.4.7 [f517fe37] + Polyester v0.7.18 [1d0040c9] + PolyesterWeave v0.2.2 [85a6dd25] + PositiveFactorizations v0.2.4 [d236fae5] + PreallocationTools v0.4.34 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [27ebfcd6] + Primes v0.5.7 [43287f4e] + PtrArrays v1.3.0 [1fd47b50] + QuadGK v2.11.2 [74087812] + Random123 v1.7.1 [e6cf234a] + RandomNumbers v1.6.0 [3cdcf5f2] + RecipesBase v1.3.4 [731186ca] + RecursiveArrayTools v3.37.1 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [ae5879a3] + ResettableStacks v1.1.1 [79098fc4] + Rmath v0.8.0 [7e49a35a] + RuntimeGeneratedFunctions v0.5.15 [9dfe8606] + SCCNonlinearSolve v1.6.0 [94e857df] + SIMDTypes v0.1.0 [0bca4576] + SciMLBase v2.121.1 [19f34311] + SciMLJacobianOperators v0.1.11 [c0aeaf25] + SciMLOperators v1.9.0 [431bcebd] + SciMLPublic v1.0.0 [53ae85a6] + SciMLStructures v1.7.0 [efcf1570] + Setfield v1.1.2 [727e6d20] + SimpleNonlinearSolve v2.9.0 [699a6c99] + SimpleTraits v0.9.5 [ce78b400] + SimpleUnPack v1.1.0 [a2af1166] + SortingAlgorithms v1.2.2 [9f842d2f] + SparseConnectivityTracer v1.1.1 [0a514795] + SparseMatrixColorings v0.4.22 [276daf66] + SpecialFunctions v2.6.1 [aedffcd0] + Static v1.3.0 [0d7ed370] + StaticArrayInterface v1.8.0 [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 [4c63d2b9] + StatsFuns v1.5.0 [7792a7ef] + StrideArraysCore v0.5.8 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.5.1 [2efcf032] + SymbolicIndexingInterface v0.3.46 ⌃ [19f23fe9] + SymbolicLimits v0.2.3 ⌅ [d1185830] + SymbolicUtils v3.32.0 [0c5d862f] + Symbolics v6.56.0 [ed4db957] + TaskLocalValues v0.1.3 [8ea1fca8] + TermInterface v2.0.0 [1c621080] + TestItems v1.0.0 [8290d209] + ThreadingUtilities v0.5.5 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 [410a4b4d] + Tricks v0.1.12 [781d530d] + TruncatedStacktraces v1.4.0 [5c2747f8] + URIs v1.6.1 [3a884ed6] + UnPack v1.0.2 [1986cc42] + Unitful v1.25.0 [a7c27f48] + Unityper v0.1.6 [6e34b625] + Bzip2_jll v1.0.9+0 [61579ee1] + Ghostscript_jll v9.55.1+0 [aacddb02] + JpegTurbo_jll v3.1.3+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f50d1b31] + Rmath_jll v0.5.1+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.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 [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 [1a1011a3] + SharedArrays v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [4607b0f0] + SuiteSparse [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m` Installation completed after 7.1s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 917.16s ################################################################################ # Testing # Testing OptimizationMOI Status `/tmp/jl_WGUVOk/Project.toml` [7c4d4715] AmplNLWriter v1.3.0 [87dc4568] HiGHS v1.19.3 [b6b21f68] Ipopt v1.11.0 [2ddba703] Juniper v0.9.4 [b8f27783] MathOptInterface v1.45.0 [961ee093] ModelingToolkit v10.26.0 [76087f3c] NLopt v1.2.1 [bca83a33] OptimizationBase v3.3.0 [fd9f6733] OptimizationMOI v0.5.8 [189a3867] Reexport v1.2.2 [37e2e3b7] ReverseDiff v1.16.1 [0bca4576] SciMLBase v2.121.1 [53ae85a6] SciMLStructures v1.7.0 [2efcf032] SymbolicIndexingInterface v0.3.46 [0c5d862f] Symbolics v6.56.0 [e88e6eb3] Zygote v0.7.10 [9cc047cb] Ipopt_jll v300.1400.1900+0 [37e2e46d] LinearAlgebra v1.13.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_WGUVOk/Manifest.toml` [47edcb42] ADTypes v1.18.0 [621f4979] AbstractFFTs v1.5.0 [1520ce14] AbstractTrees v0.4.5 [7d9f7c33] Accessors v0.1.42 [79e6a3ab] Adapt v4.4.0 [66dad0bd] AliasTables v1.1.3 [7c4d4715] AmplNLWriter v1.3.0 [ec485272] ArnoldiMethod v0.4.0 [4fba245c] ArrayInterface v7.21.0 [4c555306] ArrayLayouts v1.12.0 [6e4b80f9] BenchmarkTools v1.6.1 [e2ed5e7c] Bijections v0.2.2 [62783981] BitTwiddlingConvenienceFunctions v0.1.6 [8e7c35d0] BlockArrays v1.7.2 [70df07ce] BracketingNonlinearSolve v1.5.0 [fa961155] CEnum v0.5.0 [2a0fbf3d] CPUSummary v0.2.7 [082447d4] ChainRules v1.72.6 [d360d2e6] ChainRulesCore v1.26.0 [fb6a15b2] CloseOpenIntervals v0.1.13 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 ⌅ [861a8166] Combinatorics v1.0.2 [a80b9123] CommonMark v0.9.1 [38540f10] CommonSolve v0.2.4 [bbf7d656] CommonSubexpressions v0.3.1 [f70d9fcc] CommonWorldInvalidations v1.0.0 [34da2185] Compat v4.18.1 [b152e2b5] CompositeTypes v0.1.4 [a33af91c] CompositionsBase v0.1.2 [2569d6c7] ConcreteStructs v0.2.3 [187b0558] ConstructionBase v1.6.0 [adafc99b] CpuId v0.3.1 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.1 [e2d170a0] DataValueInterfaces v1.0.0 [2b5f629d] DiffEqBase v6.190.2 [459566f4] DiffEqCallbacks v4.10.1 [77a26b50] DiffEqNoiseProcess v5.24.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [a0c0ee7d] DifferentiationInterface v0.7.9 [8d63f2c5] DispatchDoctor v0.4.26 [31c24e10] Distributions v0.25.122 [ffbed154] DocStringExtensions v0.9.5 [5b8099bc] DomainSets v0.7.16 [7c1d4256] DynamicPolynomials v0.6.4 [06fc5a27] DynamicQuantities v1.10.0 [4e289a0a] EnumX v1.0.5 [f151be2c] EnzymeCore v0.8.14 [e2ba6199] ExprTools v0.1.10 [55351af7] ExproniconLite v0.10.14 [7034ab61] FastBroadcast v0.3.5 [9aa1b823] FastClosures v0.3.2 [a4df4552] FastPower v1.1.3 [1a297f60] FillArrays v1.14.0 [64ca27bc] FindFirstFunctions v1.4.2 [6a86dc24] FiniteDiff v2.29.0 [1fa38f19] Format v1.3.7 [f6369f11] ForwardDiff v1.2.2 [069b7b12] FunctionWrappers v1.1.3 [77dc65aa] FunctionWrappersWrappers v0.1.3 [46192b85] GPUArraysCore v0.2.0 [c27321d9] Glob v1.3.1 [86223c79] Graphs v1.13.1 [87dc4568] HiGHS v1.19.3 [34004b35] HypergeometricFunctions v0.3.28 [7869d1d1] IRTools v0.4.15 [615f187c] IfElse v0.1.1 [3263718b] ImplicitDiscreteSolve v1.2.0 [d25df0c9] Inflate v0.1.5 [18e54dd8] IntegerMathUtils v0.1.3 [8197267c] IntervalSets v0.7.11 [3587e190] InverseFunctions v0.1.17 [b6b21f68] Ipopt v1.11.0 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.1.0 [0f8b85d8] JSON3 v1.14.3 [ae98c720] Jieko v0.2.1 [98e50ef6] JuliaFormatter v2.1.6 ⌅ [70703baa] JuliaSyntax v0.4.10 [ccbc3e58] JumpProcesses v9.19.1 [2ddba703] Juniper v0.9.4 [b964fa9f] LaTeXStrings v1.4.0 [23fbe1c1] Latexify v0.16.10 [10f19ff3] LayoutPointers v0.1.17 [87fe0de2] LineSearch v0.1.4 [d3d80556] LineSearches v7.4.0 [2ab3a3ac] LogExpFunctions v0.3.29 [d8e11817] MLStyle v0.4.17 [1914dd2f] MacroTools v0.5.16 [d125e4d3] ManualMemory v0.1.8 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.45.0 [bb5d69b7] MaybeInplace v0.1.4 [e1d29d7a] Missings v1.2.0 [961ee093] ModelingToolkit v10.26.0 [2e0e35c7] Moshi v0.3.7 [46d2c3a1] MuladdMacro v0.2.4 [102ac46a] MultivariatePolynomials v0.5.13 [d8a4904e] MutableArithmetics v1.6.6 [d41bc354] NLSolversBase v7.10.0 [76087f3c] NLopt v1.2.1 [77ba4419] NaNMath v1.1.3 [be0214bd] NonlinearSolveBase v2.0.0 [6fe1bfb0] OffsetArrays v1.17.0 [429524aa] Optim v1.13.2 [bca83a33] OptimizationBase v3.3.0 [fd9f6733] OptimizationMOI v0.5.8 [bac558e1] OrderedCollections v1.8.1 [bbf590c4] OrdinaryDiffEqCore v1.36.0 [90014a1f] PDMats v0.11.35 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [e409e4f3] PoissonRandom v0.4.7 [f517fe37] Polyester v0.7.18 [1d0040c9] PolyesterWeave v0.2.2 [85a6dd25] PositiveFactorizations v0.2.4 [d236fae5] PreallocationTools v0.4.34 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [27ebfcd6] Primes v0.5.7 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [74087812] Random123 v1.7.1 [e6cf234a] RandomNumbers v1.6.0 [c1ae055f] RealDot v0.1.0 [3cdcf5f2] RecipesBase v1.3.4 [731186ca] RecursiveArrayTools v3.37.1 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [ae5879a3] ResettableStacks v1.1.1 [37e2e3b7] ReverseDiff v1.16.1 [79098fc4] Rmath v0.8.0 [7e49a35a] RuntimeGeneratedFunctions v0.5.15 [9dfe8606] SCCNonlinearSolve v1.6.0 [94e857df] SIMDTypes v0.1.0 [0bca4576] SciMLBase v2.121.1 [19f34311] SciMLJacobianOperators v0.1.11 [c0aeaf25] SciMLOperators v1.9.0 [431bcebd] SciMLPublic v1.0.0 [53ae85a6] SciMLStructures v1.7.0 [efcf1570] Setfield v1.1.2 [727e6d20] SimpleNonlinearSolve v2.9.0 [699a6c99] SimpleTraits v0.9.5 [ce78b400] SimpleUnPack v1.1.0 [a2af1166] SortingAlgorithms v1.2.2 [9f842d2f] SparseConnectivityTracer v1.1.1 [dc90abb0] SparseInverseSubset v0.1.2 [0a514795] SparseMatrixColorings v0.4.22 [276daf66] SpecialFunctions v2.6.1 [aedffcd0] Static v1.3.0 [0d7ed370] StaticArrayInterface v1.8.0 [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 [4c63d2b9] StatsFuns v1.5.0 [7792a7ef] StrideArraysCore v0.5.8 [09ab397b] StructArrays v0.7.1 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.5.1 [2efcf032] SymbolicIndexingInterface v0.3.46 ⌃ [19f23fe9] SymbolicLimits v0.2.3 ⌅ [d1185830] SymbolicUtils v3.32.0 [0c5d862f] Symbolics v6.56.0 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [ed4db957] TaskLocalValues v0.1.3 [8ea1fca8] TermInterface v2.0.0 [1c621080] TestItems v1.0.0 [8290d209] ThreadingUtilities v0.5.5 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [410a4b4d] Tricks v0.1.12 [781d530d] TruncatedStacktraces v1.4.0 [5c2747f8] URIs v1.6.1 [3a884ed6] UnPack v1.0.2 [1986cc42] Unitful v1.25.0 [a7c27f48] Unityper v0.1.6 [e88e6eb3] Zygote v0.7.10 [700de1a5] ZygoteRules v0.2.7 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [61579ee1] Ghostscript_jll v9.55.1+0 [8fd58aa0] HiGHS_jll v1.11.0+1 [e33a78d0] Hwloc_jll v2.12.2+0 [9cc047cb] Ipopt_jll v300.1400.1900+0 [aacddb02] JpegTurbo_jll v3.1.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [079eb43e] NLopt_jll v2.10.0+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f50d1b31] Rmath_jll v0.5.1+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future 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 [1a1011a3] SharedArrays v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.9.9 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [efcefdf7] PCRE2_jll v10.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.15.0+0 [8e850ede] nghttp2_jll v1.67.1+0 [3f19e933] p7zip_jll v17.6.0+0 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. Testing Running tests... Test Summary: | Pass Total Time Evaluator | 4 4 1m56.4s -1.0 ****************************************************************************** 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 ****************************************************************************** -100.0 -100.0 -100.0 -100.0 -100.0 -6.5 -0.953125 -0.48320568510897727 -3.4696750001191625 -3.4696750001191567 -3.4696750001191567 -3.4696750001191567 -3.4696750001191567 -0.4570882874038832 -0.1889420536076552 -0.901785086000198 -0.9017850860001775 -0.9017850860001775 -0.9017850860001775 -0.9017850860001775 -0.1391872580265716 -0.05494099027886859 -0.0720926922228322 -0.07209269222283328 -0.07209269222283328 -0.07209269222283328 -0.07209269222283328 -0.02914463037067801 -0.009858645098333455 -0.002323747482821504 -0.0002379723633071504 -4.926737139577133e-6 -2.818950545374605e-9 -1.0095039839287204e-15 -1.3288608467480825e-28 This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 -1.0000000e+00 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -9.5312500e-01 0.00e+00 1.25e+01 -1.0 1.00e+00 - 1.00e+00 2.50e-01f 3 2 -4.8320569e-01 0.00e+00 1.01e+00 -1.0 9.03e-02 - 1.00e+00 1.00e+00f 1 3 -4.5708829e-01 0.00e+00 9.53e+00 -1.0 4.29e-01 - 1.00e+00 5.00e-01f 2 4 -1.8894205e-01 0.00e+00 4.15e-01 -1.0 9.51e-02 - 1.00e+00 1.00e+00f 1 5 -1.3918726e-01 0.00e+00 6.51e+00 -1.7 3.49e-01 - 1.00e+00 5.00e-01f 2 6 -5.4940990e-02 0.00e+00 4.51e-01 -1.7 9.29e-02 - 1.00e+00 1.00e+00f 1 7 -2.9144630e-02 0.00e+00 2.27e+00 -1.7 2.49e-01 - 1.00e+00 5.00e-01f 2 8 -9.8586451e-03 0.00e+00 1.15e+00 -1.7 1.10e-01 - 1.00e+00 1.00e+00f 1 9 -2.3237475e-03 0.00e+00 1.00e+00 -1.7 1.00e-01 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.3797236e-04 0.00e+00 2.19e-01 -1.7 5.09e-02 - 1.00e+00 1.00e+00f 1 11 -4.9267371e-06 0.00e+00 5.95e-02 -1.7 2.53e-02 - 1.00e+00 1.00e+00f 1 12 -2.8189505e-09 0.00e+00 8.31e-04 -2.5 3.20e-03 - 1.00e+00 1.00e+00f 1 13 -1.0095040e-15 0.00e+00 8.68e-07 -5.7 9.78e-05 - 1.00e+00 1.00e+00f 1 14 -1.3288608e-28 0.00e+00 2.02e-13 -8.6 4.65e-08 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 1.3288608467480825e-28 -1.3288608467480825e-28 Dual infeasibility......: 2.0183854587685121e-13 2.0183854587685121e-13 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 2.0183854587685121e-13 2.0183854587685121e-13 Number of objective function evaluations = 36 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 14 Total seconds in IPOPT = 0.221 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 1.0000000e+00 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 9.5312500e-01 0.00e+00 1.25e+01 -1.0 1.00e+00 - 1.00e+00 2.50e-01f 3 2 4.8320569e-01 0.00e+00 1.01e+00 -1.0 9.03e-02 - 1.00e+00 1.00e+00f 1 3 4.5708829e-01 0.00e+00 9.53e+00 -1.0 4.29e-01 - 1.00e+00 5.00e-01f 2 4 1.8894205e-01 0.00e+00 4.15e-01 -1.0 9.51e-02 - 1.00e+00 1.00e+00f 1 5 1.3918726e-01 0.00e+00 6.51e+00 -1.7 3.49e-01 - 1.00e+00 5.00e-01f 2 6 5.4940990e-02 0.00e+00 4.51e-01 -1.7 9.29e-02 - 1.00e+00 1.00e+00f 1 7 2.9144630e-02 0.00e+00 2.27e+00 -1.7 2.49e-01 - 1.00e+00 5.00e-01f 2 8 9.8586451e-03 0.00e+00 1.15e+00 -1.7 1.10e-01 - 1.00e+00 1.00e+00f 1 9 2.3237475e-03 0.00e+00 1.00e+00 -1.7 1.00e-01 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.3797236e-04 0.00e+00 2.19e-01 -1.7 5.09e-02 - 1.00e+00 1.00e+00f 1 11 4.9267371e-06 0.00e+00 5.95e-02 -1.7 2.53e-02 - 1.00e+00 1.00e+00f 1 12 2.8189505e-09 0.00e+00 8.31e-04 -2.5 3.20e-03 - 1.00e+00 1.00e+00f 1 13 1.0095040e-15 0.00e+00 8.68e-07 -5.7 9.78e-05 - 1.00e+00 1.00e+00f 1 14 1.3288608e-28 0.00e+00 2.02e-13 -8.6 4.65e-08 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 1.3288608467480825e-28 1.3288608467480825e-28 Dual infeasibility......: 2.0183854587685121e-13 2.0183854587685121e-13 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 2.0183854587685121e-13 2.0183854587685121e-13 Number of objective function evaluations = 36 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 14 Total seconds in IPOPT = 1.054 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 1.0000000e+00 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 9.5312500e-01 0.00e+00 1.25e+01 -1.0 1.00e+00 - 1.00e+00 2.50e-01f 3 2 4.8320569e-01 0.00e+00 1.01e+00 -1.0 9.03e-02 - 1.00e+00 1.00e+00f 1 3 4.5708829e-01 0.00e+00 9.53e+00 -1.0 4.29e-01 - 1.00e+00 5.00e-01f 2 4 1.8894205e-01 0.00e+00 4.15e-01 -1.0 9.51e-02 - 1.00e+00 1.00e+00f 1 5 1.3918726e-01 0.00e+00 6.51e+00 -1.7 3.49e-01 - 1.00e+00 5.00e-01f 2 6 5.4940990e-02 0.00e+00 4.51e-01 -1.7 9.29e-02 - 1.00e+00 1.00e+00f 1 7 2.9144630e-02 0.00e+00 2.27e+00 -1.7 2.49e-01 - 1.00e+00 5.00e-01f 2 8 9.8586451e-03 0.00e+00 1.15e+00 -1.7 1.10e-01 - 1.00e+00 1.00e+00f 1 9 2.3237475e-03 0.00e+00 1.00e+00 -1.7 1.00e-01 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.3797236e-04 0.00e+00 2.19e-01 -1.7 5.09e-02 - 1.00e+00 1.00e+00f 1 11 4.9267371e-06 0.00e+00 5.95e-02 -1.7 2.53e-02 - 1.00e+00 1.00e+00f 1 12 2.8189505e-09 0.00e+00 8.31e-04 -2.5 3.20e-03 - 1.00e+00 1.00e+00f 1 13 1.0095040e-15 0.00e+00 8.68e-07 -5.7 9.78e-05 - 1.00e+00 1.00e+00f 1 14 1.3288608e-28 0.00e+00 2.02e-13 -8.6 4.65e-08 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 1.3288608467480825e-28 1.3288608467480825e-28 Dual infeasibility......: 2.0183854587685121e-13 2.0183854587685121e-13 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 2.0183854587685121e-13 2.0183854587685121e-13 Number of objective function evaluations = 36 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 14 Total seconds in IPOPT = 0.008 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 1.0000000e+00 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 9.5312500e-01 0.00e+00 1.25e+01 -1.0 1.00e+00 - 1.00e+00 2.50e-01f 3 2 4.8320569e-01 0.00e+00 1.01e+00 -1.0 9.03e-02 - 1.00e+00 1.00e+00f 1 3 4.5708829e-01 0.00e+00 9.53e+00 -1.0 4.29e-01 - 1.00e+00 5.00e-01f 2 4 1.8894205e-01 0.00e+00 4.15e-01 -1.0 9.51e-02 - 1.00e+00 1.00e+00f 1 5 1.3918726e-01 0.00e+00 6.51e+00 -1.7 3.49e-01 - 1.00e+00 5.00e-01f 2 6 5.4940990e-02 0.00e+00 4.51e-01 -1.7 9.29e-02 - 1.00e+00 1.00e+00f 1 7 2.9144630e-02 0.00e+00 2.27e+00 -1.7 2.49e-01 - 1.00e+00 5.00e-01f 2 8 9.8586451e-03 0.00e+00 1.15e+00 -1.7 1.10e-01 - 1.00e+00 1.00e+00f 1 9 2.3237475e-03 0.00e+00 1.00e+00 -1.7 1.00e-01 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.3797236e-04 0.00e+00 2.19e-01 -1.7 5.09e-02 - 1.00e+00 1.00e+00f 1 11 4.9267371e-06 0.00e+00 5.95e-02 -1.7 2.53e-02 - 1.00e+00 1.00e+00f 1 12 2.8189505e-09 0.00e+00 8.31e-04 -2.5 3.20e-03 - 1.00e+00 1.00e+00f 1 13 1.0095040e-15 0.00e+00 8.68e-07 -5.7 9.78e-05 - 1.00e+00 1.00e+00f 1 14 1.3288608e-28 0.00e+00 2.02e-13 -8.6 4.65e-08 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 1.3288608467480825e-28 1.3288608467480825e-28 Dual infeasibility......: 2.0183854587685121e-13 2.0183854587685121e-13 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 2.0183854587685121e-13 2.0183854587685121e-13 Number of objective function evaluations = 36 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 14 Total seconds in IPOPT = 0.008 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 1.0000000e+00 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 9.5312500e-01 0.00e+00 1.25e+01 -1.0 1.00e+00 - 1.00e+00 2.50e-01f 3 2 4.8320569e-01 0.00e+00 1.01e+00 -1.0 9.03e-02 - 1.00e+00 1.00e+00f 1 3 4.5708829e-01 0.00e+00 9.53e+00 -1.0 4.29e-01 - 1.00e+00 5.00e-01f 2 4 1.8894205e-01 0.00e+00 4.15e-01 -1.0 9.51e-02 - 1.00e+00 1.00e+00f 1 5 1.3918726e-01 0.00e+00 6.51e+00 -1.7 3.49e-01 - 1.00e+00 5.00e-01f 2 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: 1.3918725802657159e-01 1.3918725802657159e-01 Dual infeasibility......: 6.5050992443982034e+00 6.5050992443982034e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 6.5050992443982034e+00 6.5050992443982034e+00 Number of objective function evaluations = 22 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 5 Total seconds in IPOPT = 0.004 EXIT: Maximum Number of Iterations Exceeded. ┌ Warning: `AutoModelingToolkit(obj_sparse, cons_sparse)` is deprecated, use `AutoSymbolics()` or `AutoSparse(AutoSymbolics())` instead. │ caller = top-level scope at runtests.jl:61 └ @ Core ~/.julia/packages/OptimizationMOI/80KeM/test/runtests.jl:61 This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 2 Number of nonzeros in Lagrangian Hessian.............: 5 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 1.0000000e+00 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 7.7276967e-01 0.00e+00 1.00e+01 -1.0 2.00e+04 -4.0 1.00e+00 7.55e-06f 18 2 7.1338234e-01 0.00e+00 5.65e+00 -1.0 2.44e-02 - 6.58e-01 1.00e+00f 1 3 6.1929429e-01 0.00e+00 9.96e+00 -1.0 2.10e-01 - 1.00e+00 1.00e+00f 1 4 3.8786333e-01 0.00e+00 1.70e+00 -1.0 6.65e-02 - 6.90e-01 1.00e+00f 1 5 5.8412391e-01 0.00e+00 1.55e+01 -1.0 2.57e-01 - 1.00e+00 1.00e+00H 1 6 1.0973452e-01 0.00e+00 6.05e-01 -1.0 1.21e-01 - 1.00e+00 1.00e+00f 1 7 5.4329638e-01 0.00e+00 2.76e+01 -1.7 7.55e-01 - 5.07e-01 1.00e+00H 1 8 3.0294339e-03 0.00e+00 1.44e-01 -1.7 1.51e-01 - 1.00e+00 1.00e+00f 1 9 1.0461906e-03 0.00e+00 1.30e+00 -2.5 3.07e-01 - 9.47e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.1021302e-05 0.00e+00 1.05e-03 -2.5 3.01e-02 - 1.00e+00 1.00e+00h 1 11 6.2934824e-08 0.00e+00 3.78e-03 -3.8 1.86e-02 - 1.00e+00 1.00e+00h 1 12 5.0958844e-08 0.00e+00 7.36e-08 -3.8 9.86e-06 - 1.00e+00 1.00e+00h 1 13 8.0046761e-12 0.00e+00 1.98e-05 -5.7 1.34e-03 - 1.00e+00 1.00e+00h 1 14 7.6665220e-12 0.00e+00 1.84e-11 -5.7 1.49e-07 - 1.00e+00 1.00e+00h 1 15 1.4169215e-17 0.00e+00 3.04e-09 -8.6 1.66e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 15 (scaled) (unscaled) Objective...............: 1.4169215024199082e-17 1.4169215024199082e-17 Dual infeasibility......: 3.0395673496319721e-09 3.0395673496319721e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5211951276246747e-09 2.5211951276246747e-09 Overall NLP error.......: 3.0395673496319721e-09 3.0395673496319721e-09 Number of objective function evaluations = 31 Number of objective gradient evaluations = 16 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 40 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 16 Number of Lagrangian Hessian evaluations = 15 Total seconds in IPOPT = 2.288 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 2 Number of nonzeros in Lagrangian Hessian.............: 5 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 1.0000000e+00 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 7.7276967e-01 0.00e+00 1.00e+01 -1.0 2.00e+04 -4.0 1.00e+00 7.55e-06f 18 2 7.1338234e-01 0.00e+00 5.65e+00 -1.0 2.44e-02 - 6.58e-01 1.00e+00f 1 3 6.1929429e-01 0.00e+00 9.96e+00 -1.0 2.10e-01 - 1.00e+00 1.00e+00f 1 4 3.8786333e-01 0.00e+00 1.70e+00 -1.0 6.65e-02 - 6.90e-01 1.00e+00f 1 5 5.8412391e-01 0.00e+00 1.55e+01 -1.0 2.57e-01 - 1.00e+00 1.00e+00H 1 6 1.0973452e-01 0.00e+00 6.05e-01 -1.0 1.21e-01 - 1.00e+00 1.00e+00f 1 7 5.4329638e-01 0.00e+00 2.76e+01 -1.7 7.55e-01 - 5.07e-01 1.00e+00H 1 8 3.0294339e-03 0.00e+00 1.44e-01 -1.7 1.51e-01 - 1.00e+00 1.00e+00f 1 9 1.0461906e-03 0.00e+00 1.30e+00 -2.5 3.07e-01 - 9.47e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.1021302e-05 0.00e+00 1.05e-03 -2.5 3.01e-02 - 1.00e+00 1.00e+00h 1 11 6.2934824e-08 0.00e+00 3.78e-03 -3.8 1.86e-02 - 1.00e+00 1.00e+00h 1 12 5.0958844e-08 0.00e+00 7.36e-08 -3.8 9.86e-06 - 1.00e+00 1.00e+00h 1 13 8.0046761e-12 0.00e+00 1.98e-05 -5.7 1.34e-03 - 1.00e+00 1.00e+00h 1 14 7.6665220e-12 0.00e+00 1.84e-11 -5.7 1.49e-07 - 1.00e+00 1.00e+00h 1 15 1.4169215e-17 0.00e+00 3.04e-09 -8.6 1.66e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 15 (scaled) (unscaled) Objective...............: 1.4169215024199082e-17 1.4169215024199082e-17 Dual infeasibility......: 3.0395673496319721e-09 3.0395673496319721e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5211951276246747e-09 2.5211951276246747e-09 Overall NLP error.......: 3.0395673496319721e-09 3.0395673496319721e-09 Number of objective function evaluations = 31 Number of objective gradient evaluations = 16 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 40 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 16 Number of Lagrangian Hessian evaluations = 15 Total seconds in IPOPT = 0.008 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time NLP | 16 16 3m26.1s ┌ Warning: `AutoModelingToolkit(obj_sparse, cons_sparse)` is deprecated, use `AutoSymbolics()` or `AutoSparse(AutoSymbolics())` instead. │ caller = macro expansion at runtests.jl:143 [inlined] └ @ Core ~/.julia/packages/OptimizationMOI/80KeM/test/runtests.jl:143 ┌ Warning: `AutoModelingToolkit(obj_sparse, cons_sparse)` is deprecated, use `AutoSymbolics()` or `AutoSparse(AutoSymbolics())` instead. │ caller = macro expansion at runtests.jl:143 [inlined] └ @ Core ~/.julia/packages/OptimizationMOI/80KeM/test/runtests.jl:143 ┌ Warning: `AutoModelingToolkit(obj_sparse, cons_sparse)` is deprecated, use `AutoSymbolics()` or `AutoSparse(AutoSymbolics())` instead. │ caller = macro expansion at runtests.jl:143 [inlined] └ @ Core ~/.julia/packages/OptimizationMOI/80KeM/test/runtests.jl:143 ┌ Warning: `AutoModelingToolkit(obj_sparse, cons_sparse)` is deprecated, use `AutoSymbolics()` or `AutoSparse(AutoSymbolics())` instead. │ caller = macro expansion at runtests.jl:143 [inlined] └ @ Core ~/.julia/packages/OptimizationMOI/80KeM/test/runtests.jl:143 This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 4 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 10 Total number of variables............................: 4 variables with only lower bounds: 0 variables with lower and upper bounds: 4 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 1.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1 2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1 3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1 4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1 5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1 6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1 7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1 8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: 1.7014017145179164e+01 1.7014017145179164e+01 Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11 Constraint violation....: 1.7713830402499298e-11 1.7713830402499298e-11 Variable bound violation: 7.6764621326219640e-09 7.6764621326219640e-09 Complementarity.........: 2.5277100427932946e-09 2.5277100427932946e-09 Overall NLP error.......: 2.5277100427932946e-09 2.5277100427932946e-09 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 9 Number of inequality constraint evaluations = 9 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total seconds in IPOPT = 1.614 EXIT: Optimal Solution Found. ┌ Warning: amplexe() is deprecated, use the non-do-block form │ caller = ip:0x0 └ @ Core :-1 Ipopt 3.14.19: ****************************************************************************** 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...: 3 Number of nonzeros in inequality constraint Jacobian.: 3 Number of nonzeros in Lagrangian Hessian.............: 9 Total number of variables............................: 4 variables with only lower bounds: 0 variables with lower and upper bounds: 4 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 1.6109693e+01 1.02e+01 1.10e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6368535e+01 6.54e+00 1.07e+01 -1.0 5.58e-01 - 7.21e-02 3.69e-01h 1 2 1.7766887e+01 3.65e-01 6.83e-01 -1.0 5.46e-01 - 1.00e+00 1.00e+00h 1 3 1.7300156e+01 4.80e-02 8.48e-02 -1.7 1.81e-01 - 9.11e-01 9.98e-01h 1 4 1.7306854e+01 5.50e-03 1.62e-03 -2.5 5.94e-02 - 1.00e+00 1.00e+00h 1 5 1.7305182e+01 1.24e-04 7.31e-05 -3.8 8.92e-03 - 1.00e+00 1.00e+00h 1 6 1.7304980e+01 2.25e-07 1.33e-07 -5.7 3.74e-04 - 1.00e+00 1.00e+00h 1 7 1.7304976e+01 8.59e-12 5.28e-12 -8.6 2.88e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: 1.7304976315414592e+01 1.7304976315414592e+01 Dual infeasibility......: 5.2779709093763718e-12 5.2779709093763718e-12 Constraint violation....: 8.5904616753396112e-12 8.5904616753396112e-12 Variable bound violation: 9.8122274749812277e-09 9.8122274749812277e-09 Complementarity.........: 2.5222952639409042e-09 2.5222952639409042e-09 Overall NLP error.......: 2.5222952639409042e-09 2.5222952639409042e-09 Number of objective function evaluations = 8 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 8 Number of inequality constraint evaluations = 8 Number of equality constraint Jacobian evaluations = 8 Number of inequality constraint Jacobian evaluations = 8 Number of Lagrangian Hessian evaluations = 7 Total seconds in IPOPT = 0.005 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 4 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 4 variables with only lower bounds: 0 variables with lower and upper bounds: 4 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 1.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1 2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1 3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1 4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1 5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1 6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1 7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1 8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: 1.7014017145179164e+01 1.7014017145179164e+01 Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11 Constraint violation....: 1.7713830402499298e-11 1.7713830402499298e-11 Variable bound violation: 7.6764621326219640e-09 7.6764621326219640e-09 Complementarity.........: 2.5277100427932946e-09 2.5277100427932946e-09 Overall NLP error.......: 2.5277100427932946e-09 2.5277100427932946e-09 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 9 Number of inequality constraint evaluations = 9 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total seconds in IPOPT = 1.158 EXIT: Optimal Solution Found. Ipopt 3.14.19: ****************************************************************************** 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...: 3 Number of nonzeros in inequality constraint Jacobian.: 3 Number of nonzeros in Lagrangian Hessian.............: 9 Total number of variables............................: 4 variables with only lower bounds: 0 variables with lower and upper bounds: 4 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 1.6109693e+01 1.02e+01 1.10e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6368535e+01 6.54e+00 1.07e+01 -1.0 5.58e-01 - 7.21e-02 3.69e-01h 1 2 1.7766887e+01 3.65e-01 6.83e-01 -1.0 5.46e-01 - 1.00e+00 1.00e+00h 1 3 1.7300156e+01 4.80e-02 8.48e-02 -1.7 1.81e-01 - 9.11e-01 9.98e-01h 1 4 1.7306854e+01 5.50e-03 1.62e-03 -2.5 5.94e-02 - 1.00e+00 1.00e+00h 1 5 1.7305182e+01 1.24e-04 7.31e-05 -3.8 8.92e-03 - 1.00e+00 1.00e+00h 1 6 1.7304980e+01 2.25e-07 1.33e-07 -5.7 3.74e-04 - 1.00e+00 1.00e+00h 1 7 1.7304976e+01 8.59e-12 5.28e-12 -8.6 2.88e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: 1.7304976315414592e+01 1.7304976315414592e+01 Dual infeasibility......: 5.2779709093763718e-12 5.2779709093763718e-12 Constraint violation....: 8.5904616753396112e-12 8.5904616753396112e-12 Variable bound violation: 9.8122274749812277e-09 9.8122274749812277e-09 Complementarity.........: 2.5222952639409042e-09 2.5222952639409042e-09 Overall NLP error.......: 2.5222952639409042e-09 2.5222952639409042e-09 Number of objective function evaluations = 8 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 8 Number of inequality constraint evaluations = 8 Number of equality constraint Jacobian evaluations = 8 Number of inequality constraint Jacobian evaluations = 8 Number of Lagrangian Hessian evaluations = 7 Total seconds in IPOPT = 0.004 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 4 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 4 variables with only lower bounds: 0 variables with lower and upper bounds: 4 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 1.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1 2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1 3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1 4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1 5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1 6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1 7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1 8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: 1.7014017145179164e+01 1.7014017145179164e+01 Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11 Constraint violation....: 1.7713830402499298e-11 1.7713830402499298e-11 Variable bound violation: 7.6764621326219640e-09 7.6764621326219640e-09 Complementarity.........: 2.5277100427932946e-09 2.5277100427932946e-09 Overall NLP error.......: 2.5277100427932946e-09 2.5277100427932946e-09 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 9 Number of inequality constraint evaluations = 9 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total seconds in IPOPT = 0.005 EXIT: Optimal Solution Found. Ipopt 3.14.19: ****************************************************************************** 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...: 3 Number of nonzeros in inequality constraint Jacobian.: 3 Number of nonzeros in Lagrangian Hessian.............: 9 Total number of variables............................: 4 variables with only lower bounds: 0 variables with lower and upper bounds: 4 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 1.6109693e+01 1.02e+01 1.10e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6368535e+01 6.54e+00 1.07e+01 -1.0 5.58e-01 - 7.21e-02 3.69e-01h 1 2 1.7766887e+01 3.65e-01 6.83e-01 -1.0 5.46e-01 - 1.00e+00 1.00e+00h 1 3 1.7300156e+01 4.80e-02 8.48e-02 -1.7 1.81e-01 - 9.11e-01 9.98e-01h 1 4 1.7306854e+01 5.50e-03 1.62e-03 -2.5 5.94e-02 - 1.00e+00 1.00e+00h 1 5 1.7305182e+01 1.24e-04 7.31e-05 -3.8 8.92e-03 - 1.00e+00 1.00e+00h 1 6 1.7304980e+01 2.25e-07 1.33e-07 -5.7 3.74e-04 - 1.00e+00 1.00e+00h 1 7 1.7304976e+01 8.59e-12 5.28e-12 -8.6 2.88e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: 1.7304976315414592e+01 1.7304976315414592e+01 Dual infeasibility......: 5.2779709093763718e-12 5.2779709093763718e-12 Constraint violation....: 8.5904616753396112e-12 8.5904616753396112e-12 Variable bound violation: 9.8122274749812277e-09 9.8122274749812277e-09 Complementarity.........: 2.5222952639409042e-09 2.5222952639409042e-09 Overall NLP error.......: 2.5222952639409042e-09 2.5222952639409042e-09 Number of objective function evaluations = 8 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 8 Number of inequality constraint evaluations = 8 Number of equality constraint Jacobian evaluations = 8 Number of inequality constraint Jacobian evaluations = 8 Number of Lagrangian Hessian evaluations = 7 Total seconds in IPOPT = 0.005 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 4 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 4 variables with only lower bounds: 0 variables with lower and upper bounds: 4 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 1.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1 2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1 3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1 4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1 5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1 6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1 7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1 8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: 1.7014017145179164e+01 1.7014017145179164e+01 Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11 Constraint violation....: 1.7713830402499298e-11 1.7713830402499298e-11 Variable bound violation: 7.6764621326219640e-09 7.6764621326219640e-09 Complementarity.........: 2.5277100427932946e-09 2.5277100427932946e-09 Overall NLP error.......: 2.5277100427932946e-09 2.5277100427932946e-09 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 9 Number of inequality constraint evaluations = 9 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total seconds in IPOPT = 0.005 EXIT: Optimal Solution Found. Ipopt 3.14.19: ****************************************************************************** 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...: 3 Number of nonzeros in inequality constraint Jacobian.: 3 Number of nonzeros in Lagrangian Hessian.............: 9 Total number of variables............................: 4 variables with only lower bounds: 0 variables with lower and upper bounds: 4 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 1.6109693e+01 1.02e+01 1.10e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6368535e+01 6.54e+00 1.07e+01 -1.0 5.58e-01 - 7.21e-02 3.69e-01h 1 2 1.7766887e+01 3.65e-01 6.83e-01 -1.0 5.46e-01 - 1.00e+00 1.00e+00h 1 3 1.7300156e+01 4.80e-02 8.48e-02 -1.7 1.81e-01 - 9.11e-01 9.98e-01h 1 4 1.7306854e+01 5.50e-03 1.62e-03 -2.5 5.94e-02 - 1.00e+00 1.00e+00h 1 5 1.7305182e+01 1.24e-04 7.31e-05 -3.8 8.92e-03 - 1.00e+00 1.00e+00h 1 6 1.7304980e+01 2.25e-07 1.33e-07 -5.7 3.74e-04 - 1.00e+00 1.00e+00h 1 7 1.7304976e+01 8.59e-12 5.28e-12 -8.6 2.88e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: 1.7304976315414592e+01 1.7304976315414592e+01 Dual infeasibility......: 5.2779709093763718e-12 5.2779709093763718e-12 Constraint violation....: 8.5904616753396112e-12 8.5904616753396112e-12 Variable bound violation: 9.8122274749812277e-09 9.8122274749812277e-09 Complementarity.........: 2.5222952639409042e-09 2.5222952639409042e-09 Overall NLP error.......: 2.5222952639409042e-09 2.5222952639409042e-09 Number of objective function evaluations = 8 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 8 Number of inequality constraint evaluations = 8 Number of equality constraint Jacobian evaluations = 8 Number of inequality constraint Jacobian evaluations = 8 Number of Lagrangian Hessian evaluations = 7 Total seconds in IPOPT = 0.004 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time backends | 32 32 59.4s nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("print_level") => 0]) feasibility_pump : false log_levels : [:Options, :Table, :Info] #Variables: 4 #IntBinVar: 4 Obj Sense: Min Incumbent using start values: -3.0 Status of relaxation: LOCALLY_SOLVED Time for relaxation: 27.365108966827393 Relaxation Obj: -5.666666803292378 ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 -3.0 -5.67 88.89% 7.2 0 - 2 3 -3.0 -5.5 83.33% 8.4 - 79.2% 2 4 -3.0 -4.5 50.0% 8.4 - 65.3% 1 5 -4.0 -4.2 5.0% 8.4 - 58.3% #branches: 4 Obj: -4.0 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("print_level") => 0]) feasibility_pump : false log_levels : [:Options, :Table, :Info] #Variables: 1 #IntBinVar: 1 Obj Sense: Min Incumbent using start values: 480.0 Status of relaxation: LOCALLY_SOLVED Time for relaxation: 4.490674018859863 Relaxation Obj: 1.6956796324657568e-19 Obj: 1.6956796324657568e-19 Test Summary: | Pass Total Time Integer Support | 5 5 2m15.3s ┌ Warning: `OptimizationProblem(sys, u0, p; kw...)` is deprecated. Use `OptimizationProblem(sys, merge(Dict(u0), if isempty(p) │ Dict() │ else │ Dict(parameters(sys) .=> p) │ end))` │ instead. └ @ ModelingToolkit ~/.julia/packages/ModelingToolkit/80wTI/src/deprecations.jl:127 ┌ Warning: `OptimizationProblem(sys, u0, p; kw...)` is deprecated. Use `OptimizationProblem(sys, merge(Dict(u0), if isempty(p) │ Dict() │ else │ Dict(parameters(sys) .=> p) │ end))` │ instead. └ @ ModelingToolkit ~/.julia/packages/ModelingToolkit/80wTI/src/deprecations.jl:127 Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms QP has 0 rows; 1 cols; 0 matrix nonzeros; 1 Hessian nonzeros Coefficient ranges: Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] Iteration Objective NullspaceDim Model status : Optimal Objective value : -1.0000000000e+00 P-D objective error : 3.3333330985e-08 HiGHS run time : 0.00 Test Summary: | Pass Broken Total Time cache | 4 2 6 20.3s ┌ Warning: `OptimizationProblem(sys, u0, p; kw...)` is deprecated. Use `OptimizationProblem(sys, merge(Dict(u0), if isempty(p) │ Dict() │ else │ Dict(parameters(sys) .=> p) │ end))` │ instead. └ @ ModelingToolkit ~/.julia/packages/ModelingToolkit/80wTI/src/deprecations.jl:127 Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms QP has 1 rows; 2 cols; 2 matrix nonzeros; 3 Hessian nonzeros Coefficient ranges: Matrix [1e+00, 2e+00] Cost [1e+00, 5e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Iteration Objective NullspaceDim 0 1.5 0 0.00s 0 1.5 0 0.00s Model status : Optimal Objective value : 1.5000000000e+00 P-D objective error : 6.2499999230e-09 HiGHS run time : 0.00 ┌ Warning: `OptimizationProblem(sys, u0, p; kw...)` is deprecated. Use `OptimizationProblem(sys, merge(Dict(u0), if isempty(p) │ Dict() │ else │ Dict(parameters(sys) .=> p) │ end))` │ instead. └ @ ModelingToolkit ~/.julia/packages/ModelingToolkit/80wTI/src/deprecations.jl:127 Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms QP has 3 rows; 2 cols; 4 matrix nonzeros; 3 Hessian nonzeros Coefficient ranges: Matrix [1e+00, 2e+00] Cost [1e+00, 5e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Iteration Objective NullspaceDim 0 1.5 0 0.00s 0 1.5 0 0.00s Model status : Optimal Objective value : 1.5000000000e+00 P-D objective error : 6.2499999230e-09 HiGHS run time : 0.00 Test Summary: | Total Time MOI | 0 27.6s ┌ Warning: `AutoModelingToolkit(; obj_sparse, cons_sparse)` is deprecated, use `AutoSymbolics()` or `AutoSparse(AutoSymbolics())` instead. │ caller = top-level scope at runtests.jl:261 └ @ Core ~/.julia/packages/OptimizationMOI/80KeM/test/runtests.jl:261 Ipopt 3.14.19: bad line 66 of /tmp/jl_gvFZcs/model.nl: J1 0 terminate called after throwing an instance of 'Ipopt::TNLP::INVALID_TNLP' Test Summary: | Total Time tutorial | 0 6.7s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 4 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 2 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 1.0000000e+00 1.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0000000e+00 5.00e-01 3.56e+08 -1.0 1.00e+00 - 1.00e+00 1.00e+00h 1 2 2.5000000e-01 2.50e-01 2.00e+08 -1.0 5.00e-01 - 1.00e+00 1.00e+00f 1 3 4.0123457e-02 3.47e-02 1.71e+07 -1.0 1.67e-01 - 1.00e+00 1.00e+00h 1 4 5.5817051e-02 7.82e-03 2.10e+06 -1.0 6.37e-02 - 1.00e+00 1.00e+00h 1 5 8.5536016e-02 1.95e-03 5.21e+05 -1.0 3.13e-02 - 1.00e+00 1.00e+00h 1 6 1.0548619e-01 4.88e-04 1.30e+05 -1.0 1.56e-02 - 1.00e+00 1.00e+00h 1 7 1.1668450e-01 1.22e-04 3.26e+04 -1.0 7.81e-03 - 1.00e+00 1.00e+00h 1 8 1.2258334e-01 3.05e-05 8.14e+03 -1.0 3.91e-03 - 1.00e+00 1.00e+00h 1 9 1.2560692e-01 7.63e-06 2.04e+03 -1.0 1.95e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.2713716e-01 1.91e-06 5.09e+02 -1.7 9.77e-04 - 1.00e+00 1.00e+00h 1 11 1.2790688e-01 4.77e-07 1.27e+02 -1.7 4.88e-04 - 1.00e+00 1.00e+00h 1 12 1.2829288e-01 1.19e-07 3.21e+01 -2.5 2.44e-04 - 1.00e+00 1.00e+00h 1 13 1.2848617e-01 2.98e-08 8.21e+00 -2.5 1.22e-04 - 1.00e+00 1.00e+00h 1 14 1.2858289e-01 7.45e-09 2.17e-09 -2.5 6.10e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 1.2858289161325831e-01 1.2858289161325831e-01 Dual infeasibility......: 2.1725878873724014e-09 2.1725878873724014e-09 Constraint violation....: 7.4505805969238281e-09 7.4505805969238281e-09 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 7.4505805969238281e-09 7.4505805969238281e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 15 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 15 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 14 Total seconds in IPOPT = 4.726 EXIT: Optimal Solution Found. Test Summary: | Total Time tutorial | 0 9.3s Testing OptimizationMOI tests passed Testing completed after 714.0s PkgEval succeeded after 1709.61s