Package evaluation to test OptimalBids on Julia 1.10.10 (077106c818*) started at 2026-02-25T21:46:11.847 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.10` Set-up completed after 3.33s ################################################################################ # Installation # Installing OptimalBids... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [54ed2464] + OptimalBids v1.3.3 Updating `~/.julia/environments/v1.10/Manifest.toml` [47edcb42] + ADTypes v1.21.0 [79e6a3ab] + Adapt v4.4.0 [4fba245c] + ArrayInterface v7.22.0 [6e4b80f9] + BenchmarkTools v1.6.3 ⌅ [d360d2e6] + ChainRulesCore v1.25.2 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [a0c0ee7d] + DifferentiationInterface v0.7.16 [b4f34e82] + Distances v0.10.12 [ffbed154] + DocStringExtensions v0.9.5 [6a86dc24] + FiniteDiff v2.29.0 [f6369f11] + ForwardDiff v1.3.2 [2030c09a] + InfrastructureModels v0.7.8 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 ⌅ [682c06a0] + JSON v0.21.4 [4076af6c] + JuMP v1.29.4 ⌃ [d3d80556] + LineSearches v7.5.1 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.49.0 [f28f55f0] + Memento v1.4.1 [d8a4904e] + MutableArithmetics v1.6.7 ⌅ [d41bc354] + NLSolversBase v7.10.0 [2774e3e8] + NLsolve v4.5.1 [77ba4419] + NaNMath v1.1.3 [54ed2464] + OptimalBids v1.3.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [c36e90e8] + PowerModels v0.21.5 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.5.2 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.7.1 [1e83bf80] + StaticArraysCore v1.4.4 [82ae8749] + StatsAPI v1.8.0 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [8ba89e20] + Distributed [9fa8497b] + Future [b77e0a4c] + InteractiveUtils [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [a63ad114] + Mmap [de0858da] + Printf [9abbd945] + Profile [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [6462fe0b] + Sockets [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [4536629a] + OpenBLAS_jll v0.3.23+5 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.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 6.99s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling packages... 872.6 ms ✓ TestEnv 1 dependency successfully precompiled in 3 seconds ┌ Warning: Could not use exact versions of packages in manifest, re-resolving └ @ TestEnv ~/.julia/packages/TestEnv/VOudJ/src/julia-1.9/activate_set.jl:63 Precompiling package dependencies... Precompiling packages... 903.1 ms ✓ Combinatorics 708.7 ms ✓ FunctionWrappers 745.1 ms ✓ SolverCore 814.5 ms ✓ StructTypes 550.3 ms ✓ AbstractFFTs 428.0 ms ✓ LaTeXStrings 498.5 ms ✓ ErrorfreeArithmetic 1487.8 ms ✓ LinearMaps 445.2 ms ✓ ExprTools 380.2 ms ✓ IteratorInterfaceExtensions 2073.5 ms ✓ UnsafeAtomics 441.7 ms ✓ TensorCore 404.5 ms ✓ StatsAPI 648.4 ms ✓ ADTypes 419.9 ms ✓ CEnum 2010.0 ms ✓ ExproniconLite 385.5 ms ✓ Suppressor 527.4 ms ✓ NamedTupleTools 986.2 ms ✓ Format 380.5 ms ✓ UnPack 1049.8 ms ✓ FillArrays 634.6 ms ✓ LambertW 429.6 ms ✓ Richardson 488.5 ms ✓ InverseFunctions 381.1 ms ✓ CommonSolve 425.3 ms ✓ CompilerSupportLibraries_jll 2069.4 ms ✓ MacroTools 576.9 ms ✓ Preferences 463.9 ms ✓ CompositeTypes 578.0 ms ✓ Compat 624.9 ms ✓ OrderedCollections 494.4 ms ✓ Requires 375.9 ms ✓ DataValueInterfaces 433.6 ms ✓ EnumX 374.5 ms ✓ RealDot 388.5 ms ✓ Reexport 576.4 ms ✓ DocStringExtensions 570.6 ms ✓ AbstractTrees 1105.6 ms ✓ IrrationalConstants 540.8 ms ✓ IntervalSets 542.4 ms ✓ RoundingEmulator 396.6 ms ✓ CompositionsBase 394.6 ms ✓ PtrArrays 602.2 ms ✓ TranscodingStreams 433.5 ms ✓ HashArrayMappedTries 488.6 ms ✓ NaNMath 471.4 ms ✓ DelimitedFiles 394.2 ms ✓ SetRounding 503.9 ms ✓ Inflate 371.7 ms ✓ IfElse 500.0 ms ✓ ConstructionBase 399.8 ms ✓ CommonWorldInvalidations 437.9 ms ✓ DataAPI 383.0 ms ✓ PackageExtensionCompat 407.0 ms ✓ TermInterface 387.9 ms ✓ SciMLPublic 486.2 ms ✓ StaticArraysCore 402.0 ms ✓ Bijections 674.7 ms ✓ SuiteSparse 4784.6 ms ✓ MutableArithmetics 873.3 ms ✓ Statistics 383.1 ms ✓ FunctionWrappersWrappers 1476.1 ms ✓ AbstractFFTs → AbstractFFTsTestExt 417.9 ms ✓ FastRounding 1013.5 ms ✓ LinearMaps → LinearMapsSparseArraysExt 470.6 ms ✓ RuntimeGeneratedFunctions 1265.0 ms ✓ TimerOutputs 364.2 ms ✓ TableTraits 502.9 ms ✓ Atomix 1055.8 ms ✓ DifferentiationInterface 1399.5 ms ✓ Jieko 817.0 ms ✓ FillArrays → FillArraysSparseArraysExt 1304.6 ms ✓ InverseFunctions → InverseFunctionsTestExt 474.2 ms ✓ InverseFunctions → InverseFunctionsDatesExt 696.1 ms ✓ CommonSubexpressions 2225.7 ms ✓ IRTools 1341.7 ms ✓ SimpleTraits 691.1 ms ✓ JLLWrappers 527.1 ms ✓ PrecompileTools 533.4 ms ✓ Compat → CompatLinearAlgebraExt 664.3 ms ✓ Parameters 604.4 ms ✓ Adapt 1810.5 ms ✓ Memento 776.8 ms ✓ LogExpFunctions 475.6 ms ✓ IntervalSets → IntervalSetsRandomExt 492.3 ms ✓ CompositionsBase → CompositionsBaseInverseFunctionsExt 523.5 ms ✓ AliasTables 538.1 ms ✓ CodecZlib 493.0 ms ✓ ScopedValues 1098.4 ms ✓ Sobol 590.3 ms ✓ Unityper 469.7 ms ✓ ConstructionBase → ConstructionBaseIntervalSetsExt 460.7 ms ✓ ADTypes → ADTypesConstructionBaseExt 515.1 ms ✓ Missings 455.1 ms ✓ DiffResults 1338.3 ms ✓ Setfield 1010.3 ms ✓ PDMats 708.7 ms ✓ SparseInverseSubset 1064.2 ms ✓ Distances 716.1 ms ✓ LinearMaps → LinearMapsStatisticsExt 774.1 ms ✓ FillArrays → FillArraysStatisticsExt 732.5 ms ✓ IntervalSets → IntervalSetsStatisticsExt 840.5 ms ✓ Tables 751.2 ms ✓ DifferentiationInterface → DifferentiationInterfaceSparseArraysExt 7978.3 ms ✓ Moshi 556.9 ms ✓ Bzip2_jll 556.0 ms ✓ Xorg_libpciaccess_jll 557.4 ms ✓ METIS_jll 553.2 ms ✓ Rmath_jll 562.1 ms ✓ ASL_jll 563.9 ms ✓ CRlibm_jll 588.3 ms ✓ JpegTurbo_jll 675.9 ms ✓ LLVMExtra_jll 582.2 ms ✓ Libiconv_jll 591.5 ms ✓ HiGHS_jll 579.2 ms ✓ OpenBLAS32_jll 587.6 ms ✓ OpenSpecFun_jll 7080.8 ms ✓ StaticArrays 1249.6 ms ✓ RecipesBase 9101.9 ms ✓ Parsers 852.4 ms ✓ Static 1192.6 ms ✓ ChainRulesCore 1718.8 ms ✓ DataStructures 598.4 ms ✓ Functors 681.0 ms ✓ Adapt → AdaptSparseArraysExt 625.5 ms ✓ ArrayInterface 514.7 ms ✓ GPUArraysCore 476.6 ms ✓ LogExpFunctions → LogExpFunctionsInverseFunctionsExt 2248.7 ms ✓ Accessors 774.3 ms ✓ FillArrays → FillArraysPDMatsExt 698.5 ms ✓ Distances → DistancesSparseArraysExt 801.9 ms ✓ StructArrays 462.4 ms ✓ CodecBzip2 607.3 ms ✓ MUMPS_seq_jll 712.2 ms ✓ Rmath 570.4 ms ✓ CRlibm 641.9 ms ✓ Ghostscript_jll 5351.0 ms ✓ LLVM 560.9 ms ✓ XML2_jll 2555.5 ms ✓ SpecialFunctions 1344.9 ms ✓ ArnoldiMethod 1074.3 ms ✓ StaticArrays → StaticArraysStatisticsExt 793.8 ms ✓ FillArrays → FillArraysStaticArraysExt 2637.5 ms ✓ DomainSets 733.4 ms ✓ ConstructionBase → ConstructionBaseStaticArraysExt 764.5 ms ✓ DifferentiationInterface → DifferentiationInterfaceStaticArraysExt 720.2 ms ✓ Adapt → AdaptStaticArraysExt 1782.1 ms ✓ IterativeSolvers 597.5 ms ✓ IntervalSets → IntervalSetsRecipesBaseExt 5646.7 ms ✓ JSON3 1701.4 ms ✓ JSON 715.6 ms ✓ ChainRulesCore → ChainRulesCoreSparseArraysExt 766.8 ms ✓ AbstractDifferentiation 1107.1 ms ✓ ZygoteRules 456.6 ms ✓ AbstractFFTs → AbstractFFTsChainRulesCoreExt 437.1 ms ✓ LinearMaps → LinearMapsChainRulesCoreExt 452.3 ms ✓ ADTypes → ADTypesChainRulesCoreExt 483.3 ms ✓ DifferentiationInterface → DifferentiationInterfaceChainRulesCoreExt 1476.4 ms ✓ LogExpFunctions → LogExpFunctionsChainRulesCoreExt 747.6 ms ✓ Distances → DistancesChainRulesCoreExt 760.3 ms ✓ StaticArrays → StaticArraysChainRulesCoreExt 509.0 ms ✓ SortingAlgorithms 1006.9 ms ✓ QuadGK 1347.3 ms ✓ StaticArrayInterface 683.4 ms ✓ ArrayInterface → ArrayInterfaceSparseArraysExt 428.3 ms ✓ ArrayInterface → ArrayInterfaceChainRulesCoreExt 376.4 ms ✓ ArrayInterface → ArrayInterfaceStaticArraysCoreExt 610.7 ms ✓ SciMLStructures 759.1 ms ✓ PreallocationTools 405.9 ms ✓ DifferentiationInterface → DifferentiationInterfaceGPUArraysCoreExt 385.2 ms ✓ ArrayInterface → ArrayInterfaceGPUArraysCoreExt 864.1 ms ✓ Accessors → LinearAlgebraExt 1414.4 ms ✓ Accessors → TestExt 965.0 ms ✓ Accessors → IntervalSetsExt 862.6 ms ✓ Accessors → StaticArraysExt 992.6 ms ✓ StructArrays → StructArraysAdaptExt 695.9 ms ✓ StructArrays → StructArraysSparseArraysExt 795.2 ms ✓ StructArrays → StructArraysStaticArraysExt 491.0 ms ✓ StructArrays → StructArraysLinearAlgebraExt 534.1 ms ✓ Accessors → StructArraysExt 2664.8 ms ✓ IntervalArithmetic 2334.4 ms ✓ Latexify 1314.7 ms ✓ UnsafeAtomics → UnsafeAtomicsLLVM 668.2 ms ✓ Hwloc_jll 1761.5 ms ✓ SpecialFunctions → SpecialFunctionsChainRulesCoreExt 978.0 ms ✓ HypergeometricFunctions 624.9 ms ✓ DiffRules 4506.2 ms ✓ Graphs 822.7 ms ✓ DomainSets → DomainSetsRandomExt 3483.1 ms ✓ KernelAbstractions 1513.5 ms ✓ BenchmarkTools 826.5 ms ✓ DifferentiableFlatten 3158.0 ms ✓ MultivariatePolynomials 1400.7 ms ✓ FiniteDifferences 2229.4 ms ✓ StatsBase 800.3 ms ✓ StaticArrayInterface → StaticArrayInterfaceStaticArraysExt 636.8 ms ✓ FiniteDiff 1960.0 ms ✓ SciMLOperators 1555.3 ms ✓ SymbolicIndexingInterface 5519.3 ms ✓ ChainRules 872.9 ms ✓ Latexify → SparseArraysExt 568.2 ms ✓ SPRAL_jll 1401.2 ms ✓ StatsFuns 3293.7 ms ✓ ForwardDiff 1223.5 ms ✓ VertexSafeGraphs 2137.9 ms ✓ KernelAbstractions → SparseArraysExt 790.8 ms ✓ KernelAbstractions → LinearAlgebraExt 2153.7 ms ✓ StructArrays → StructArraysGPUArraysCoreExt 1634.8 ms ✓ DynamicPolynomials 1191.9 ms ✓ DifferentiationInterface → DifferentiationInterfaceFiniteDifferencesExt 6014.3 ms ✓ ChainRulesTestUtils 769.4 ms ✓ PDMats → StatsBaseExt 3726.1 ms ✓ KernelFunctions 682.2 ms ✓ FiniteDiff → FiniteDiffSparseArraysExt 701.1 ms ✓ FiniteDiff → FiniteDiffStaticArraysExt 493.0 ms ✓ DifferentiationInterface → DifferentiationInterfaceFiniteDiffExt 503.0 ms ✓ SciMLOperators → SciMLOperatorsStaticArraysCoreExt 795.8 ms ✓ SciMLOperators → SciMLOperatorsSparseArraysExt 1972.2 ms ✓ RecursiveArrayTools 6565.6 ms ✓ ArrayInterface → ArrayInterfaceChainRulesExt 552.7 ms ✓ Ipopt_jll 554.8 ms ✓ StatsFuns → StatsFunsInverseFunctionsExt 1474.8 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 864.3 ms ✓ ForwardDiff → ForwardDiffStaticArraysExt 695.1 ms ✓ DifferentiationInterface → DifferentiationInterfaceForwardDiffExt 550.0 ms ✓ PreallocationTools → PreallocationToolsForwardDiffExt 31908.4 ms ✓ MathOptInterface 5968.9 ms ✓ GPUArrays 4761.6 ms ✓ Distributions 2753.2 ms ✓ RecursiveArrayTools → RecursiveArrayToolsStructArraysExt 983.5 ms ✓ RecursiveArrayTools → RecursiveArrayToolsSparseArraysExt 1376.5 ms ✓ RecursiveArrayTools → RecursiveArrayToolsKernelAbstractionsExt 1084.3 ms ✓ RecursiveArrayTools → RecursiveArrayToolsForwardDiffExt 511.9 ms ✓ Ipopt 2648.3 ms ✓ SparseDiffTools 973.5 ms ✓ NLSolversBase 2246.4 ms ✓ MathOptIIS 16326.1 ms ✓ JuMP 29564.6 ms ✓ Zygote 1436.0 ms ✓ Distributions → DistributionsTestExt 1378.3 ms ✓ Distributions → DistributionsChainRulesCoreExt 10264.4 ms ✓ SciMLBase 3191.6 ms ✓ LabelledArrays 17217.7 ms ✓ Ipopt → IpoptMathOptInterfaceExt 1030.0 ms ✓ LineSearches 12125.8 ms ✓ HiGHS 4583.0 ms ✓ InfrastructureModels 2946.8 ms ✓ Zygote → ZygoteDistancesExt 1759.3 ms ✓ DifferentiationInterface → DifferentiationInterfaceZygoteExt 5412.0 ms ✓ RecursiveArrayTools → RecursiveArrayToolsZygoteExt 2926.6 ms ✓ SparseDiffTools → SparseDiffToolsZygoteExt 5451.5 ms ✓ NonconvexCore 2231.2 ms ✓ AbstractGPs 1453.9 ms ✓ SciMLBase → SciMLBaseChainRulesCoreExt 16767.2 ms ✓ SymbolicUtils 1393.6 ms ✓ NLsolve 4066.6 ms ✓ SciMLBase → SciMLBaseZygoteExt 2625.2 ms ✓ SymbolicLimits 38740.6 ms ✓ PowerModels 14890.2 ms ✓ Symbolics 4994.4 ms ✓ OptimalBids ✗ Symbolics → SymbolicsPreallocationToolsExt 10566.4 ms ✓ DifferentiationInterface → DifferentiationInterfaceSymbolicsExt 10459.5 ms ✓ SparseDiffTools → SparseDiffToolsSymbolicsExt 14662.7 ms ✓ NonconvexUtils 14214.7 ms ✓ Nonconvex 14890.7 ms ✓ NonconvexIpopt 15157.5 ms ✓ NonconvexBayesian 267 dependencies successfully precompiled in 595 seconds. 9 already precompiled. 6 dependencies had output during precompilation: ┌ SparseDiffTools → SparseDiffToolsSymbolicsExt │ ERROR: LoadError: UndefVarError: `ForwardDiff` not defined │ Stacktrace: │ [1] include │ @ ./Base.jl:495 [inlined] │ [2] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::String) │ @ Base ./loading.jl:2306 │ [3] top-level scope │ @ stdin:5 │ in expression starting at /home/pkgeval/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:1 │ in expression starting at stdin:5 │ ┌ Error: Error during loading of extension SymbolicsPreallocationToolsExt of Symbolics, use `Base.retry_load_extensions()` to retry. │ │ exception = │ │ 1-element ExceptionStack: │ │ Failed to precompile SymbolicsPreallocationToolsExt [d479e226-fb54-5ebe-a75e-a7af7f39127f] to "/home/pkgeval/.julia/compiled/v1.10/SymbolicsPreallocationToolsExt/jl_xk4FW9". │ │ Stacktrace: │ │ [1] error(s::String) │ │ @ Base ./error.jl:35 │ │ [2] compilecache(pkg::Base.PkgId, path::String, internal_stderr::IO, internal_stdout::IO, keep_loaded_modules::Bool; loadable_exts::Vector{Base.PkgId}) │ │ @ Base ./loading.jl:2547 │ │ [3] compilecache │ │ @ ./loading.jl:2414 [inlined] │ │ [4] (::Base.var"#973#974"{Base.PkgId})() │ │ @ Base ./loading.jl:2058 │ │ [5] mkpidlock(f::Base.var"#973#974"{Base.PkgId}, at::String, pid::Int32; kwopts::@Kwargs{stale_age::Int64, wait::Bool}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:93 │ │ [6] #mkpidlock#6 │ │ @ /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:88 [inlined] │ │ [7] trymkpidlock(::Function, ::Vararg{Any}; kwargs::@Kwargs{stale_age::Int64}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:111 │ │ [8] #invokelatest#2 │ │ @ ./essentials.jl:894 [inlined] │ │ [9] invokelatest │ │ @ ./essentials.jl:889 [inlined] │ │ [10] maybe_cachefile_lock(f::Base.var"#973#974"{Base.PkgId}, pkg::Base.PkgId, srcpath::String; stale_age::Int64) │ │ @ Base ./loading.jl:3062 │ │ [11] maybe_cachefile_lock │ │ @ ./loading.jl:3059 [inlined] │ │ [12] _require(pkg::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:2044 │ │ [13] __require_prelocked(uuidkey::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:1886 │ │ [14] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [15] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [16] _require_prelocked │ │ @ ./loading.jl:1877 [inlined] │ │ [17] _require_prelocked │ │ @ ./loading.jl:1876 [inlined] │ │ [18] run_extension_callbacks(extid::Base.ExtensionId) │ │ @ Base ./loading.jl:1372 │ │ [19] run_extension_callbacks(pkgid::Base.PkgId) │ │ @ Base ./loading.jl:1404 │ │ [20] run_package_callbacks(modkey::Base.PkgId) │ │ @ Base ./loading.jl:1228 │ │ [21] __require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1893 │ │ [22] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [23] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [24] _require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1877 │ │ [25] macro expansion │ │ @ ./loading.jl:1864 [inlined] │ │ [26] macro expansion │ │ @ ./lock.jl:270 [inlined] │ │ [27] __require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1827 │ │ [28] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [29] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [30] require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1820 │ │ [31] include │ │ @ ./Base.jl:495 [inlined] │ │ [32] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ │ @ Base ./loading.jl:2306 │ │ [33] top-level scope │ │ @ stdin:5 │ │ [34] eval │ │ @ ./boot.jl:385 [inlined] │ │ [35] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ │ @ Base ./loading.jl:2160 │ │ [36] include_string │ │ @ ./loading.jl:2170 [inlined] │ │ [37] exec_options(opts::Base.JLOptions) │ │ @ Base ./client.jl:314 │ │ [38] _start() │ │ @ Base ./client.jl:550 │ └ @ Base loading.jl:1378 └ ┌ DifferentiationInterface → DifferentiationInterfaceSymbolicsExt │ ERROR: LoadError: UndefVarError: `ForwardDiff` not defined │ Stacktrace: │ [1] include │ @ ./Base.jl:495 [inlined] │ [2] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::String) │ @ Base ./loading.jl:2306 │ [3] top-level scope │ @ stdin:5 │ in expression starting at /home/pkgeval/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:1 │ in expression starting at stdin:5 │ ┌ Error: Error during loading of extension SymbolicsPreallocationToolsExt of Symbolics, use `Base.retry_load_extensions()` to retry. │ │ exception = │ │ 1-element ExceptionStack: │ │ Failed to precompile SymbolicsPreallocationToolsExt [d479e226-fb54-5ebe-a75e-a7af7f39127f] to "/home/pkgeval/.julia/compiled/v1.10/SymbolicsPreallocationToolsExt/jl_nqss57". │ │ Stacktrace: │ │ [1] error(s::String) │ │ @ Base ./error.jl:35 │ │ [2] compilecache(pkg::Base.PkgId, path::String, internal_stderr::IO, internal_stdout::IO, keep_loaded_modules::Bool; loadable_exts::Vector{Base.PkgId}) │ │ @ Base ./loading.jl:2547 │ │ [3] compilecache │ │ @ ./loading.jl:2414 [inlined] │ │ [4] (::Base.var"#973#974"{Base.PkgId})() │ │ @ Base ./loading.jl:2058 │ │ [5] mkpidlock(f::Base.var"#973#974"{Base.PkgId}, at::String, pid::Int32; kwopts::@Kwargs{stale_age::Int64, wait::Bool}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:93 │ │ [6] #mkpidlock#6 │ │ @ /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:88 [inlined] │ │ [7] trymkpidlock(::Function, ::Vararg{Any}; kwargs::@Kwargs{stale_age::Int64}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:111 │ │ [8] #invokelatest#2 │ │ @ ./essentials.jl:894 [inlined] │ │ [9] invokelatest │ │ @ ./essentials.jl:889 [inlined] │ │ [10] maybe_cachefile_lock(f::Base.var"#973#974"{Base.PkgId}, pkg::Base.PkgId, srcpath::String; stale_age::Int64) │ │ @ Base ./loading.jl:3062 │ │ [11] maybe_cachefile_lock │ │ @ ./loading.jl:3059 [inlined] │ │ [12] _require(pkg::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:2044 │ │ [13] __require_prelocked(uuidkey::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:1886 │ │ [14] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [15] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [16] _require_prelocked │ │ @ ./loading.jl:1877 [inlined] │ │ [17] _require_prelocked │ │ @ ./loading.jl:1876 [inlined] │ │ [18] run_extension_callbacks(extid::Base.ExtensionId) │ │ @ Base ./loading.jl:1372 │ │ [19] run_extension_callbacks(pkgid::Base.PkgId) │ │ @ Base ./loading.jl:1404 │ │ [20] run_package_callbacks(modkey::Base.PkgId) │ │ @ Base ./loading.jl:1228 │ │ [21] __require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1893 │ │ [22] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [23] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [24] _require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1877 │ │ [25] macro expansion │ │ @ ./loading.jl:1864 [inlined] │ │ [26] macro expansion │ │ @ ./lock.jl:270 [inlined] │ │ [27] __require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1827 │ │ [28] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [29] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [30] require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1820 │ │ [31] include │ │ @ ./Base.jl:495 [inlined] │ │ [32] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ │ @ Base ./loading.jl:2306 │ │ [33] top-level scope │ │ @ stdin:5 │ │ [34] eval │ │ @ ./boot.jl:385 [inlined] │ │ [35] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ │ @ Base ./loading.jl:2160 │ │ [36] include_string │ │ @ ./loading.jl:2170 [inlined] │ │ [37] exec_options(opts::Base.JLOptions) │ │ @ Base ./client.jl:314 │ │ [38] _start() │ │ @ Base ./client.jl:550 │ └ @ Base loading.jl:1378 └ ┌ NonconvexIpopt │ ERROR: LoadError: UndefVarError: `ForwardDiff` not defined │ Stacktrace: │ [1] include │ @ ./Base.jl:495 [inlined] │ [2] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::String) │ @ Base ./loading.jl:2306 │ [3] top-level scope │ @ stdin:5 │ in expression starting at /home/pkgeval/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:1 │ in expression starting at stdin:5 │ ┌ Error: Error during loading of extension SymbolicsPreallocationToolsExt of Symbolics, use `Base.retry_load_extensions()` to retry. │ │ exception = │ │ 1-element ExceptionStack: │ │ Failed to precompile SymbolicsPreallocationToolsExt [d479e226-fb54-5ebe-a75e-a7af7f39127f] to "/home/pkgeval/.julia/compiled/v1.10/SymbolicsPreallocationToolsExt/jl_w1b9yt". │ │ Stacktrace: │ │ [1] error(s::String) │ │ @ Base ./error.jl:35 │ │ [2] compilecache(pkg::Base.PkgId, path::String, internal_stderr::IO, internal_stdout::IO, keep_loaded_modules::Bool; loadable_exts::Vector{Base.PkgId}) │ │ @ Base ./loading.jl:2547 │ │ [3] compilecache │ │ @ ./loading.jl:2414 [inlined] │ │ [4] (::Base.var"#973#974"{Base.PkgId})() │ │ @ Base ./loading.jl:2058 │ │ [5] mkpidlock(f::Base.var"#973#974"{Base.PkgId}, at::String, pid::Int32; kwopts::@Kwargs{stale_age::Int64, wait::Bool}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:93 │ │ [6] #mkpidlock#6 │ │ @ /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:88 [inlined] │ │ [7] trymkpidlock(::Function, ::Vararg{Any}; kwargs::@Kwargs{stale_age::Int64}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:111 │ │ [8] #invokelatest#2 │ │ @ ./essentials.jl:894 [inlined] │ │ [9] invokelatest │ │ @ ./essentials.jl:889 [inlined] │ │ [10] maybe_cachefile_lock(f::Base.var"#973#974"{Base.PkgId}, pkg::Base.PkgId, srcpath::String; stale_age::Int64) │ │ @ Base ./loading.jl:3062 │ │ [11] maybe_cachefile_lock │ │ @ ./loading.jl:3059 [inlined] │ │ [12] _require(pkg::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:2044 │ │ [13] __require_prelocked(uuidkey::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:1886 │ │ [14] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [15] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [16] _require_prelocked │ │ @ ./loading.jl:1877 [inlined] │ │ [17] _require_prelocked │ │ @ ./loading.jl:1876 [inlined] │ │ [18] run_extension_callbacks(extid::Base.ExtensionId) │ │ @ Base ./loading.jl:1372 │ │ [19] run_extension_callbacks(pkgid::Base.PkgId) │ │ @ Base ./loading.jl:1404 │ │ [20] run_package_callbacks(modkey::Base.PkgId) │ │ @ Base ./loading.jl:1228 │ │ [21] _tryrequire_from_serialized(modkey::Base.PkgId, path::String, ocachepath::Nothing, sourcepath::String, depmods::Vector{Any}) │ │ @ Base ./loading.jl:1561 │ │ [22] _require_search_from_serialized(pkg::Base.PkgId, sourcepath::String, build_id::UInt128) │ │ @ Base ./loading.jl:1648 │ │ [23] _require(pkg::Base.PkgId, env::String) │ │ @ Base ./loading.jl:2012 │ │ [24] __require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1886 │ │ [25] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [26] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [27] _require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1877 │ │ [28] macro expansion │ │ @ ./loading.jl:1864 [inlined] │ │ [29] macro expansion │ │ @ ./lock.jl:270 [inlined] │ │ [30] __require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1827 │ │ [31] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [32] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [33] require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1820 │ │ [34] include │ │ @ ./Base.jl:495 [inlined] │ │ [35] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ │ @ Base ./loading.jl:2306 │ │ [36] top-level scope │ │ @ stdin:5 │ │ [37] eval │ │ @ ./boot.jl:385 [inlined] │ │ [38] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ │ @ Base ./loading.jl:2160 │ │ [39] include_string │ │ @ ./loading.jl:2170 [inlined] │ │ [40] exec_options(opts::Base.JLOptions) │ │ @ Base ./client.jl:314 │ │ [41] _start() │ │ @ Base ./client.jl:550 │ └ @ Base loading.jl:1378 └ ┌ Nonconvex │ ERROR: LoadError: UndefVarError: `ForwardDiff` not defined │ Stacktrace: │ [1] include │ @ ./Base.jl:495 [inlined] │ [2] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::String) │ @ Base ./loading.jl:2306 │ [3] top-level scope │ @ stdin:5 │ in expression starting at /home/pkgeval/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:1 │ in expression starting at stdin:5 │ ┌ Error: Error during loading of extension SymbolicsPreallocationToolsExt of Symbolics, use `Base.retry_load_extensions()` to retry. │ │ exception = │ │ 1-element ExceptionStack: │ │ Failed to precompile SymbolicsPreallocationToolsExt [d479e226-fb54-5ebe-a75e-a7af7f39127f] to "/home/pkgeval/.julia/compiled/v1.10/SymbolicsPreallocationToolsExt/jl_1EXl7R". │ │ Stacktrace: │ │ [1] error(s::String) │ │ @ Base ./error.jl:35 │ │ [2] compilecache(pkg::Base.PkgId, path::String, internal_stderr::IO, internal_stdout::IO, keep_loaded_modules::Bool; loadable_exts::Vector{Base.PkgId}) │ │ @ Base ./loading.jl:2547 │ │ [3] compilecache │ │ @ ./loading.jl:2414 [inlined] │ │ [4] (::Base.var"#973#974"{Base.PkgId})() │ │ @ Base ./loading.jl:2058 │ │ [5] mkpidlock(f::Base.var"#973#974"{Base.PkgId}, at::String, pid::Int32; kwopts::@Kwargs{stale_age::Int64, wait::Bool}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:93 │ │ [6] #mkpidlock#6 │ │ @ /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:88 [inlined] │ │ [7] trymkpidlock(::Function, ::Vararg{Any}; kwargs::@Kwargs{stale_age::Int64}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:111 │ │ [8] #invokelatest#2 │ │ @ ./essentials.jl:894 [inlined] │ │ [9] invokelatest │ │ @ ./essentials.jl:889 [inlined] │ │ [10] maybe_cachefile_lock(f::Base.var"#973#974"{Base.PkgId}, pkg::Base.PkgId, srcpath::String; stale_age::Int64) │ │ @ Base ./loading.jl:3062 │ │ [11] maybe_cachefile_lock │ │ @ ./loading.jl:3059 [inlined] │ │ [12] _require(pkg::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:2044 │ │ [13] __require_prelocked(uuidkey::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:1886 │ │ [14] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [15] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [16] _require_prelocked │ │ @ ./loading.jl:1877 [inlined] │ │ [17] _require_prelocked │ │ @ ./loading.jl:1876 [inlined] │ │ [18] run_extension_callbacks(extid::Base.ExtensionId) │ │ @ Base ./loading.jl:1372 │ │ [19] run_extension_callbacks(pkgid::Base.PkgId) │ │ @ Base ./loading.jl:1404 │ │ [20] run_package_callbacks(modkey::Base.PkgId) │ │ @ Base ./loading.jl:1228 │ │ [21] _tryrequire_from_serialized(modkey::Base.PkgId, path::String, ocachepath::Nothing, sourcepath::String, depmods::Vector{Any}) │ │ @ Base ./loading.jl:1561 │ │ [22] _require_search_from_serialized(pkg::Base.PkgId, sourcepath::String, build_id::UInt128) │ │ @ Base ./loading.jl:1648 │ │ [23] _require(pkg::Base.PkgId, env::String) │ │ @ Base ./loading.jl:2012 │ │ [24] __require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1886 │ │ [25] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [26] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [27] _require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1877 │ │ [28] macro expansion │ │ @ ./loading.jl:1864 [inlined] │ │ [29] macro expansion │ │ @ ./lock.jl:270 [inlined] │ │ [30] __require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1827 │ │ [31] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [32] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [33] require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1820 │ │ [34] include │ │ @ ./Base.jl:495 [inlined] │ │ [35] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ │ @ Base ./loading.jl:2306 │ │ [36] top-level scope │ │ @ stdin:5 │ │ [37] eval │ │ @ ./boot.jl:385 [inlined] │ │ [38] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ │ @ Base ./loading.jl:2160 │ │ [39] include_string │ │ @ ./loading.jl:2170 [inlined] │ │ [40] exec_options(opts::Base.JLOptions) │ │ @ Base ./client.jl:314 │ │ [41] _start() │ │ @ Base ./client.jl:550 │ └ @ Base loading.jl:1378 └ ┌ NonconvexBayesian │ ERROR: LoadError: UndefVarError: `ForwardDiff` not defined │ Stacktrace: │ [1] include │ @ ./Base.jl:495 [inlined] │ [2] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::String) │ @ Base ./loading.jl:2306 │ [3] top-level scope │ @ stdin:5 │ in expression starting at /home/pkgeval/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:1 │ in expression starting at stdin:5 │ ┌ Error: Error during loading of extension SymbolicsPreallocationToolsExt of Symbolics, use `Base.retry_load_extensions()` to retry. │ │ exception = │ │ 1-element ExceptionStack: │ │ Failed to precompile SymbolicsPreallocationToolsExt [d479e226-fb54-5ebe-a75e-a7af7f39127f] to "/home/pkgeval/.julia/compiled/v1.10/SymbolicsPreallocationToolsExt/jl_KuQam4". │ │ Stacktrace: │ │ [1] error(s::String) │ │ @ Base ./error.jl:35 │ │ [2] compilecache(pkg::Base.PkgId, path::String, internal_stderr::IO, internal_stdout::IO, keep_loaded_modules::Bool; loadable_exts::Vector{Base.PkgId}) │ │ @ Base ./loading.jl:2547 │ │ [3] compilecache │ │ @ ./loading.jl:2414 [inlined] │ │ [4] (::Base.var"#973#974"{Base.PkgId})() │ │ @ Base ./loading.jl:2058 │ │ [5] mkpidlock(f::Base.var"#973#974"{Base.PkgId}, at::String, pid::Int32; kwopts::@Kwargs{stale_age::Int64, wait::Bool}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:93 │ │ [6] #mkpidlock#6 │ │ @ /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:88 [inlined] │ │ [7] trymkpidlock(::Function, ::Vararg{Any}; kwargs::@Kwargs{stale_age::Int64}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:111 │ │ [8] #invokelatest#2 │ │ @ ./essentials.jl:894 [inlined] │ │ [9] invokelatest │ │ @ ./essentials.jl:889 [inlined] │ │ [10] maybe_cachefile_lock(f::Base.var"#973#974"{Base.PkgId}, pkg::Base.PkgId, srcpath::String; stale_age::Int64) │ │ @ Base ./loading.jl:3062 │ │ [11] maybe_cachefile_lock │ │ @ ./loading.jl:3059 [inlined] │ │ [12] _require(pkg::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:2044 │ │ [13] __require_prelocked(uuidkey::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:1886 │ │ [14] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [15] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [16] _require_prelocked │ │ @ ./loading.jl:1877 [inlined] │ │ [17] _require_prelocked │ │ @ ./loading.jl:1876 [inlined] │ │ [18] run_extension_callbacks(extid::Base.ExtensionId) │ │ @ Base ./loading.jl:1372 │ │ [19] run_extension_callbacks(pkgid::Base.PkgId) │ │ @ Base ./loading.jl:1404 │ │ [20] run_package_callbacks(modkey::Base.PkgId) │ │ @ Base ./loading.jl:1228 │ │ [21] _tryrequire_from_serialized(modkey::Base.PkgId, path::String, ocachepath::Nothing, sourcepath::String, depmods::Vector{Any}) │ │ @ Base ./loading.jl:1561 │ │ [22] _require_search_from_serialized(pkg::Base.PkgId, sourcepath::String, build_id::UInt128) │ │ @ Base ./loading.jl:1648 │ │ [23] _require(pkg::Base.PkgId, env::String) │ │ @ Base ./loading.jl:2012 │ │ [24] __require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1886 │ │ [25] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [26] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [27] _require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1877 │ │ [28] macro expansion │ │ @ ./loading.jl:1864 [inlined] │ │ [29] macro expansion │ │ @ ./lock.jl:270 [inlined] │ │ [30] __require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1827 │ │ [31] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [32] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [33] require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1820 │ │ [34] include │ │ @ ./Base.jl:495 [inlined] │ │ [35] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ │ @ Base ./loading.jl:2306 │ │ [36] top-level scope │ │ @ stdin:5 │ │ [37] eval │ │ @ ./boot.jl:385 [inlined] │ │ [38] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ │ @ Base ./loading.jl:2160 │ │ [39] include_string │ │ @ ./loading.jl:2170 [inlined] │ │ [40] exec_options(opts::Base.JLOptions) │ │ @ Base ./client.jl:314 │ │ [41] _start() │ │ @ Base ./client.jl:550 │ └ @ Base loading.jl:1378 └ ┌ NonconvexUtils │ ERROR: LoadError: UndefVarError: `ForwardDiff` not defined │ Stacktrace: │ [1] include │ @ ./Base.jl:495 [inlined] │ [2] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::String) │ @ Base ./loading.jl:2306 │ [3] top-level scope │ @ stdin:5 │ in expression starting at /home/pkgeval/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:1 │ in expression starting at stdin:5 │ ┌ Error: Error during loading of extension SymbolicsPreallocationToolsExt of Symbolics, use `Base.retry_load_extensions()` to retry. │ │ exception = │ │ 1-element ExceptionStack: │ │ Failed to precompile SymbolicsPreallocationToolsExt [d479e226-fb54-5ebe-a75e-a7af7f39127f] to "/home/pkgeval/.julia/compiled/v1.10/SymbolicsPreallocationToolsExt/jl_uRYdDS". │ │ Stacktrace: │ │ [1] error(s::String) │ │ @ Base ./error.jl:35 │ │ [2] compilecache(pkg::Base.PkgId, path::String, internal_stderr::IO, internal_stdout::IO, keep_loaded_modules::Bool; loadable_exts::Vector{Base.PkgId}) │ │ @ Base ./loading.jl:2547 │ │ [3] compilecache │ │ @ ./loading.jl:2414 [inlined] │ │ [4] (::Base.var"#973#974"{Base.PkgId})() │ │ @ Base ./loading.jl:2058 │ │ [5] mkpidlock(f::Base.var"#973#974"{Base.PkgId}, at::String, pid::Int32; kwopts::@Kwargs{stale_age::Int64, wait::Bool}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:93 │ │ [6] #mkpidlock#6 │ │ @ /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:88 [inlined] │ │ [7] trymkpidlock(::Function, ::Vararg{Any}; kwargs::@Kwargs{stale_age::Int64}) │ │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:111 │ │ [8] #invokelatest#2 │ │ @ ./essentials.jl:894 [inlined] │ │ [9] invokelatest │ │ @ ./essentials.jl:889 [inlined] │ │ [10] maybe_cachefile_lock(f::Base.var"#973#974"{Base.PkgId}, pkg::Base.PkgId, srcpath::String; stale_age::Int64) │ │ @ Base ./loading.jl:3062 │ │ [11] maybe_cachefile_lock │ │ @ ./loading.jl:3059 [inlined] │ │ [12] _require(pkg::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:2044 │ │ [13] __require_prelocked(uuidkey::Base.PkgId, env::Nothing) │ │ @ Base ./loading.jl:1886 │ │ [14] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [15] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [16] _require_prelocked │ │ @ ./loading.jl:1877 [inlined] │ │ [17] _require_prelocked │ │ @ ./loading.jl:1876 [inlined] │ │ [18] run_extension_callbacks(extid::Base.ExtensionId) │ │ @ Base ./loading.jl:1372 │ │ [19] run_extension_callbacks(pkgid::Base.PkgId) │ │ @ Base ./loading.jl:1404 │ │ [20] run_package_callbacks(modkey::Base.PkgId) │ │ @ Base ./loading.jl:1228 │ │ [21] __require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1893 │ │ [22] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [23] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [24] _require_prelocked(uuidkey::Base.PkgId, env::String) │ │ @ Base ./loading.jl:1877 │ │ [25] macro expansion │ │ @ ./loading.jl:1864 [inlined] │ │ [26] macro expansion │ │ @ ./lock.jl:270 [inlined] │ │ [27] __require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1827 │ │ [28] #invoke_in_world#3 │ │ @ ./essentials.jl:926 [inlined] │ │ [29] invoke_in_world │ │ @ ./essentials.jl:923 [inlined] │ │ [30] require(into::Module, mod::Symbol) │ │ @ Base ./loading.jl:1820 │ │ [31] include │ │ @ ./Base.jl:495 [inlined] │ │ [32] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ │ @ Base ./loading.jl:2306 │ │ [33] top-level scope │ │ @ stdin:5 │ │ [34] eval │ │ @ ./boot.jl:385 [inlined] │ │ [35] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ │ @ Base ./loading.jl:2160 │ │ [36] include_string │ │ @ ./loading.jl:2170 [inlined] │ │ [37] exec_options(opts::Base.JLOptions) │ │ @ Base ./client.jl:314 │ │ [38] _start() │ │ @ Base ./client.jl:550 │ └ @ Base loading.jl:1378 └ Precompilation completed after 608.97s ################################################################################ # Testing # Testing OptimalBids ┌ Warning: Could not use exact versions of packages in manifest, re-resolving └ @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1846 Status `/tmp/jl_9vmcsy/Project.toml` ⌅ [d360d2e6] ChainRulesCore v1.25.2 [cdddcdb0] ChainRulesTestUtils v1.13.1 [87dc4568] HiGHS v1.21.1 [4076af6c] JuMP v1.29.4 ⌃ [01bcebdf] Nonconvex v2.1.3 ⌃ [fb352abc] NonconvexBayesian v0.1.5 ⌅ [bf347577] NonconvexIpopt v0.4.3 [54ed2464] OptimalBids v1.3.3 [c36e90e8] PowerModels v0.21.5 [189a3867] Reexport v1.2.2 [f43a241f] Downloads v1.6.0 [8dfed614] Test Status `/tmp/jl_9vmcsy/Manifest.toml` [47edcb42] ADTypes v1.21.0 ⌅ [c29ec348] AbstractDifferentiation v0.4.4 [621f4979] AbstractFFTs v1.5.0 [99985d1d] AbstractGPs v0.5.24 [1520ce14] AbstractTrees v0.4.5 [7d9f7c33] Accessors v0.1.43 [79e6a3ab] Adapt v4.4.0 [66dad0bd] AliasTables v1.1.3 [ec485272] ArnoldiMethod v0.4.0 [4fba245c] ArrayInterface v7.22.0 [a9b6321e] Atomix v1.1.2 [6e4b80f9] BenchmarkTools v1.6.3 ⌅ [e2ed5e7c] Bijections v0.1.10 [fa961155] CEnum v0.5.0 [96374032] CRlibm v1.0.2 [082447d4] ChainRules v1.73.0 ⌅ [d360d2e6] ChainRulesCore v1.25.2 [cdddcdb0] ChainRulesTestUtils v1.13.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.1.0 [38540f10] CommonSolve v0.2.6 [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 ⌅ [187b0558] ConstructionBase v1.5.6 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [8bb1440f] DelimitedFiles v1.9.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [c78775a3] DifferentiableFlatten v0.1.1 [a0c0ee7d] DifferentiationInterface v0.7.16 [b4f34e82] Distances v0.10.12 [31c24e10] Distributions v0.25.123 [ffbed154] DocStringExtensions v0.9.5 [5b8099bc] DomainSets v0.7.16 ⌅ [7c1d4256] DynamicPolynomials v0.5.7 [4e289a0a] EnumX v1.0.7 [90fa49ef] ErrorfreeArithmetic v0.5.2 [e2ba6199] ExprTools v0.1.10 [55351af7] ExproniconLite v0.10.14 [fa42c844] FastRounding v0.3.1 [1a297f60] FillArrays v1.16.0 [6a86dc24] FiniteDiff v2.29.0 [26cc04aa] FiniteDifferences v0.12.33 [1fa38f19] Format v1.3.7 ⌅ [f6369f11] ForwardDiff v0.10.39 [069b7b12] FunctionWrappers v1.1.3 [77dc65aa] FunctionWrappersWrappers v0.1.3 [d9f16b24] Functors v0.5.2 [0c68f7d7] GPUArrays v11.4.1 [46192b85] GPUArraysCore v0.2.0 ⌃ [86223c79] Graphs v1.13.1 [076d061b] HashArrayMappedTries v0.2.0 [87dc4568] HiGHS v1.21.1 [34004b35] HypergeometricFunctions v0.3.28 [7869d1d1] IRTools v0.4.15 [615f187c] IfElse v0.1.1 [d25df0c9] Inflate v0.1.5 [2030c09a] InfrastructureModels v0.7.8 ⌅ [d1acc4aa] IntervalArithmetic v0.20.9 [8197267c] IntervalSets v0.7.13 [3587e190] InverseFunctions v0.1.17 [b6b21f68] Ipopt v1.14.1 [92d709cd] IrrationalConstants v0.2.6 [42fd0dbc] IterativeSolvers v0.9.4 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 ⌅ [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [ae98c720] Jieko v0.2.1 [4076af6c] JuMP v1.29.4 [63c18a36] KernelAbstractions v0.9.40 [ec8451be] KernelFunctions v0.10.67 [929cbde3] LLVM v9.4.6 [b964fa9f] LaTeXStrings v1.4.0 [2ee39098] LabelledArrays v1.18.0 ⌅ [984bce1d] LambertW v0.4.6 [23fbe1c1] Latexify v0.16.10 ⌃ [d3d80556] LineSearches v7.5.1 [7a12625a] LinearMaps v3.11.4 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.2 ⌃ [b8f27783] MathOptInterface v1.48.0 [f28f55f0] Memento v1.4.1 [e1d29d7a] Missings v1.2.0 [2e0e35c7] Moshi v0.3.7 ⌃ [102ac46a] MultivariatePolynomials v0.5.9 [d8a4904e] MutableArithmetics v1.6.7 ⌅ [d41bc354] NLSolversBase v7.10.0 [2774e3e8] NLsolve v4.5.1 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 ⌃ [01bcebdf] Nonconvex v2.1.3 ⌃ [fb352abc] NonconvexBayesian v0.1.5 [035190e5] NonconvexCore v1.5.0 ⌅ [bf347577] NonconvexIpopt v0.4.3 ⌅ [c48e48a2] NonconvexUtils v0.4.3 [54ed2464] OptimalBids v1.3.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [65ce6f38] PackageExtensionCompat v1.0.2 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [c36e90e8] PowerModels v0.21.5 ⌃ [d236fae5] PreallocationTools v0.4.34 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.5.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.2 [c1ae055f] RealDot v0.1.0 [3cdcf5f2] RecipesBase v1.3.4 ⌃ [731186ca] RecursiveArrayTools v3.36.0 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [708f8203] Richardson v1.4.2 [79098fc4] Rmath v0.9.0 [5eaf0fd0] RoundingEmulator v0.2.1 [7e49a35a] RuntimeGeneratedFunctions v0.5.17 ⌃ [0bca4576] SciMLBase v2.87.0 ⌅ [c0aeaf25] SciMLOperators v0.3.13 [431bcebd] SciMLPublic v1.0.1 [53ae85a6] SciMLStructures v1.10.0 [7e506255] ScopedValues v1.5.0 [3cc68bcd] SetRounding v0.2.1 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [ed01d8cd] Sobol v1.5.0 [ff4d7338] SolverCore v0.3.10 [a2af1166] SortingAlgorithms v1.2.2 ⌃ [47a9eef4] SparseDiffTools v2.23.1 [dc90abb0] SparseInverseSubset v0.1.2 [276daf66] SpecialFunctions v2.7.1 [aedffcd0] Static v1.3.1 [0d7ed370] StaticArrayInterface v1.9.0 [90137ffa] StaticArrays v1.9.17 [1e83bf80] StaticArraysCore v1.4.4 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [09ab397b] StructArrays v0.7.2 [856f2bd8] StructTypes v1.11.0 [fd094767] Suppressor v0.2.8 [2efcf032] SymbolicIndexingInterface v0.3.46 ⌅ [19f23fe9] SymbolicLimits v0.2.1 ⌅ [d1185830] SymbolicUtils v2.1.3 ⌅ [0c5d862f] Symbolics v5.36.0 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [62fd8b95] TensorCore v0.1.1 ⌅ [8ea1fca8] TermInterface v0.4.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [a7c27f48] Unityper v0.1.6 [013be700] UnsafeAtomics v0.3.0 [19fa3120] VertexSafeGraphs v0.2.0 ⌅ [e88e6eb3] Zygote v0.6.77 [700de1a5] ZygoteRules v0.2.7 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [4e9b3aee] CRlibm_jll v1.0.1+0 [61579ee1] Ghostscript_jll v9.55.1+0 [8fd58aa0] HiGHS_jll v1.13.1+0 [e33a78d0] Hwloc_jll v2.13.0+0 [9cc047cb] Ipopt_jll v300.1400.1901+0 [aacddb02] JpegTurbo_jll v3.1.4+0 [dad2f222] LLVMExtra_jll v0.0.38+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.24+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f50d1b31] Rmath_jll v0.5.1+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.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [8ba89e20] Distributed [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [9fa8497b] Future [b77e0a4c] InteractiveUtils [4af54fe1] LazyArtifacts [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [9abbd945] Profile [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [1a1011a3] SharedArrays [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.1010+0 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.23+5 [05823500] OpenLibm_jll v0.8.5+0 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.6.1+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... ┌ Warning: inference tests have been disabled └ @ ChainRulesTestUtils ~/.julia/packages/ChainRulesTestUtils/RZidV/src/global_config.jl:13 ERROR: LoadError: UndefVarError: `ForwardDiff` not defined Stacktrace: [1] include @ ./Base.jl:495 [inlined] [2] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::String) @ Base ./loading.jl:2306 [3] top-level scope @ stdin:5 in expression starting at /home/pkgeval/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:1 in expression starting at stdin:5 ┌ Error: Error during loading of extension SymbolicsPreallocationToolsExt of Symbolics, use `Base.retry_load_extensions()` to retry. │ exception = │ 1-element ExceptionStack: │ Failed to precompile SymbolicsPreallocationToolsExt [d479e226-fb54-5ebe-a75e-a7af7f39127f] to "/home/pkgeval/.julia/compiled/v1.10/SymbolicsPreallocationToolsExt/jl_WMUNGu". │ Stacktrace: │ [1] error(s::String) │ @ Base ./error.jl:35 │ [2] compilecache(pkg::Base.PkgId, path::String, internal_stderr::IO, internal_stdout::IO, keep_loaded_modules::Bool; loadable_exts::Vector{Base.PkgId}) │ @ Base ./loading.jl:2547 │ [3] compilecache │ @ ./loading.jl:2414 [inlined] │ [4] (::Base.var"#973#974"{Base.PkgId})() │ @ Base ./loading.jl:2058 │ [5] mkpidlock(f::Base.var"#973#974"{Base.PkgId}, at::String, pid::Int32; kwopts::@Kwargs{stale_age::Int64, wait::Bool}) │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:93 │ [6] #mkpidlock#6 │ @ /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:88 [inlined] │ [7] trymkpidlock(::Function, ::Vararg{Any}; kwargs::@Kwargs{stale_age::Int64}) │ @ FileWatching.Pidfile /opt/julia/share/julia/stdlib/v1.10/FileWatching/src/pidfile.jl:111 │ [8] #invokelatest#2 │ @ ./essentials.jl:894 [inlined] │ [9] invokelatest │ @ ./essentials.jl:889 [inlined] │ [10] maybe_cachefile_lock(f::Base.var"#973#974"{Base.PkgId}, pkg::Base.PkgId, srcpath::String; stale_age::Int64) │ @ Base ./loading.jl:3062 │ [11] maybe_cachefile_lock │ @ ./loading.jl:3059 [inlined] │ [12] _require(pkg::Base.PkgId, env::Nothing) │ @ Base ./loading.jl:2044 │ [13] __require_prelocked(uuidkey::Base.PkgId, env::Nothing) │ @ Base ./loading.jl:1886 │ [14] #invoke_in_world#3 │ @ ./essentials.jl:926 [inlined] │ [15] invoke_in_world │ @ ./essentials.jl:923 [inlined] │ [16] _require_prelocked │ @ ./loading.jl:1877 [inlined] │ [17] _require_prelocked │ @ ./loading.jl:1876 [inlined] │ [18] run_extension_callbacks(extid::Base.ExtensionId) │ @ Base ./loading.jl:1372 │ [19] run_extension_callbacks(pkgid::Base.PkgId) │ @ Base ./loading.jl:1404 │ [20] run_package_callbacks(modkey::Base.PkgId) │ @ Base ./loading.jl:1228 │ [21] _tryrequire_from_serialized(modkey::Base.PkgId, path::String, ocachepath::Nothing, sourcepath::String, depmods::Vector{Any}) │ @ Base ./loading.jl:1561 │ [22] _require_search_from_serialized(pkg::Base.PkgId, sourcepath::String, build_id::UInt128) │ @ Base ./loading.jl:1648 │ [23] _require(pkg::Base.PkgId, env::String) │ @ Base ./loading.jl:2012 │ [24] __require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base ./loading.jl:1886 │ [25] #invoke_in_world#3 │ @ ./essentials.jl:926 [inlined] │ [26] invoke_in_world │ @ ./essentials.jl:923 [inlined] │ [27] _require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base ./loading.jl:1877 │ [28] macro expansion │ @ ./loading.jl:1864 [inlined] │ [29] macro expansion │ @ ./lock.jl:270 [inlined] │ [30] __require(into::Module, mod::Symbol) │ @ Base ./loading.jl:1827 │ [31] #invoke_in_world#3 │ @ ./essentials.jl:926 [inlined] │ [32] invoke_in_world │ @ ./essentials.jl:923 [inlined] │ [33] require(into::Module, mod::Symbol) │ @ Base ./loading.jl:1820 │ [34] include(fname::String) │ @ Base.MainInclude ./client.jl:487 │ [35] top-level scope │ @ none:6 │ [36] eval │ @ ./boot.jl:385 [inlined] │ [37] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:289 │ [38] _start() │ @ Base ./client.jl:550 └ @ Base loading.jl:1378 Test Summary: | Pass Total Time Core OptimalBids.jl | 6 6 1.4s [info | PowerModels]: removing 3 cost terms from generator 32: Float64[] [info | PowerModels]: removing 1 cost terms from generator 29: [3266.8781000000004, 0.0] [info | PowerModels]: removing 3 cost terms from generator 1: Float64[] [info | PowerModels]: removing 3 cost terms from generator 54: Float64[] [info | PowerModels]: removing 3 cost terms from generator 2: Float64[] [info | PowerModels]: removing 3 cost terms from generator 41: Float64[] [info | PowerModels]: removing 1 cost terms from generator 51: [3504.3401000000003, 0.0] [info | PowerModels]: removing 3 cost terms from generator 53: Float64[] [info | PowerModels]: removing 3 cost terms from generator 27: Float64[] [info | PowerModels]: removing 3 cost terms from generator 42: Float64[] [info | PowerModels]: removing 3 cost terms from generator 33: Float64[] [info | PowerModels]: removing 1 cost terms from generator 28: [3478.1778000000004, 0.0] [info | PowerModels]: removing 3 cost terms from generator 50: Float64[] [info | PowerModels]: removing 3 cost terms from generator 52: Float64[] [info | PowerModels]: removing 1 cost terms from generator 26: [1605.6042000000002, 0.0] [info | PowerModels]: removing 3 cost terms from generator 10: Float64[] [info | PowerModels]: removing 3 cost terms from generator 24: Float64[] [info | PowerModels]: removing 1 cost terms from generator 25: [2486.1868, 0.0] [info | PowerModels]: removing 3 cost terms from generator 23: Float64[] [info | PowerModels]: removing 3 cost terms from generator 49: Float64[] [info | PowerModels]: removing 1 cost terms from generator 5: [2498.342, 0.0] [info | PowerModels]: removing 3 cost terms from generator 31: Float64[] [info | PowerModels]: removing 3 cost terms from generator 43: Float64[] [info | PowerModels]: removing 1 cost terms from generator 39: [3407.2633000000005, 0.0] [info | PowerModels]: removing 3 cost terms from generator 34: Float64[] [info | PowerModels]: removing 3 cost terms from generator 44: Float64[] [info | PowerModels]: removing 3 cost terms from generator 17: Float64[] [info | PowerModels]: removing 1 cost terms from generator 37: [2460.0771999999997, 0.0] [info | PowerModels]: removing 3 cost terms from generator 47: Float64[] [info | PowerModels]: removing 3 cost terms from generator 9: Float64[] [info | PowerModels]: removing 1 cost terms from generator 12: [2222.098, 0.0] [info | PowerModels]: removing 1 cost terms from generator 20: [2420.2306, 0.0] [info | PowerModels]: removing 1 cost terms from generator 6: [12458.1564, 0.0] [info | PowerModels]: removing 1 cost terms from generator 14: [2599.3982, 0.0] [info | PowerModels]: removing 3 cost terms from generator 7: Float64[] [info | PowerModels]: removing 3 cost terms from generator 8: Float64[] [info | PowerModels]: removing 3 cost terms from generator 19: Float64[] [info | PowerModels]: removing 3 cost terms from generator 4: Float64[] [info | PowerModels]: removing 1 cost terms from generator 22: [2727.7342999999996, 0.0] [info | PowerModels]: removing 1 cost terms from generator 11: [2894.8321, 0.0] [info | PowerModels]: removing 3 cost terms from generator 35: Float64[] [info | PowerModels]: removing 3 cost terms from generator 13: Float64[] [info | PowerModels]: removing 3 cost terms from generator 15: Float64[] [info | PowerModels]: removing 3 cost terms from generator 16: Float64[] [info | PowerModels]: removing 1 cost terms from generator 40: [2460.5101999999997, 0.0] [info | PowerModels]: removing 1 cost terms from generator 21: [1667.3942, 0.0] [info | PowerModels]: removing 3 cost terms from generator 38: Float64[] [info | PowerModels]: removing 1 cost terms from generator 46: [2864.9471, 0.0] [info | PowerModels]: removing 1 cost terms from generator 45: [1261.217, 0.0] [info | PowerModels]: removing 3 cost terms from generator 36: Float64[] [info | PowerModels]: removing 3 cost terms from generator 48: Float64[] [info | PowerModels]: removing 3 cost terms from generator 18: Float64[] [info | PowerModels]: removing 1 cost terms from generator 30: [2575.8442, 0.0] [info | PowerModels]: removing 3 cost terms from generator 3: Float64[] ****************************************************************************** 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...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -3.0000000e+00 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.0000000e+00 0.00e+00 1.91e-06 -4.3 1.92e-06 - 9.90e-01 1.00e+00f 1 Cholesky factorization failed for LBFGS update! Skipping update. 2 -3.0000000e+00 0.00e+00 0.00e+00 -0.4 2.50e+01 - 1.00e+00 1.00e+00f 1 3 -3.0000000e+00 0.00e+00 0.00e+00 -1.1 1.25e+00 - 1.00e+00 1.00e+00f 1 4 -3.0000000e+00 0.00e+00 0.00e+00 -1.8 1.00e+00 - 1.00e+00 1.00e+00f 1 5 -3.0000000e+00 0.00e+00 6.52e-06 -2.7 6.52e-06 - 1.00e+00 1.00e+00f 1 6 -3.0000000e+00 0.00e+00 2.93e-07 -4.0 2.93e-07 - 1.00e+00 1.00e+00f 1 7 -3.0000000e+00 0.00e+00 2.80e-09 -6.1 2.80e-09 - 1.00e+00 1.00e+00f 1 8 -3.0000000e+00 0.00e+00 2.93e-12 -9.0 2.93e-12 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -3.0000000000000000e+00 -3.0000000000000000e+00 Dual infeasibility......: 2.9291922335158870e-12 2.9291922335158870e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0909090913808290e-10 9.0909090913808290e-10 Overall NLP error.......: 9.0909090913808290e-10 9.0909090913808290e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 67.782 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -3.0000000e+00 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.0000000e+00 0.00e+00 8.26e-07 -4.3 8.34e-07 - 9.90e-01 1.00e+00f 1 2 -3.0000000e+00 0.00e+00 6.98e-03 -0.4 6.98e-03 - 1.00e+00 1.00e+00f 1 3 -3.0000000e+00 0.00e+00 1.40e-03 -1.1 1.40e-03 - 1.00e+00 1.00e+00f 1 4 -3.0000000e+00 0.00e+00 2.79e-04 -1.8 2.79e-04 - 1.00e+00 1.00e+00f 1 5 -3.0000000e+00 0.00e+00 3.53e-05 -2.7 3.53e-05 - 1.00e+00 1.00e+00f 1 6 -3.0000000e+00 0.00e+00 1.59e-06 -4.0 1.59e-06 - 1.00e+00 1.00e+00f 1 7 -3.0000000e+00 0.00e+00 1.52e-08 -6.1 1.52e-08 - 1.00e+00 1.00e+00f 1 8 -3.0000000e+00 0.00e+00 1.59e-11 -9.0 1.59e-11 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -3.0000000000000000e+00 -3.0000000000000000e+00 Dual infeasibility......: 1.5858008010442869e-11 1.5858008010442869e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0909090929112010e-10 9.0909090929112010e-10 Overall NLP error.......: 9.0909090929112010e-10 9.0909090929112010e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.007 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -3.0000000e+00 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.0000000e+00 0.00e+00 6.31e-06 -4.3 6.38e-06 - 9.90e-01 1.00e+00f 1 2 -3.0000000e+00 0.00e+00 5.96e-02 -0.4 5.96e-02 - 1.00e+00 1.00e+00f 1 3 -3.0000000e+00 0.00e+00 1.17e-02 -1.1 1.17e-02 - 1.00e+00 1.00e+00f 1 4 -3.0000000e+00 0.00e+00 2.36e-03 -1.8 2.36e-03 - 1.00e+00 1.00e+00f 1 5 -3.0000000e+00 0.00e+00 2.98e-04 -2.7 2.98e-04 - 1.00e+00 1.00e+00f 1 6 -3.0000000e+00 0.00e+00 1.34e-05 -4.0 1.34e-05 - 1.00e+00 1.00e+00f 1 7 -3.0000000e+00 0.00e+00 1.28e-07 -6.1 1.28e-07 - 1.00e+00 1.00e+00f 1 8 -3.0000000e+00 0.00e+00 1.34e-10 -9.0 1.34e-10 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -3.0000000000000000e+00 -3.0000000000000000e+00 Dual infeasibility......: 1.3404753483525235e-10 1.3404753483525235e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0909091033303205e-10 9.0909091033303205e-10 Overall NLP error.......: 9.0909091033303205e-10 9.0909091033303205e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.007 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -2.7326565e+03 0.00e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.5993304e+04 0.00e+00 3.24e+02 2.0 9.65e+01 - 8.66e-01 3.61e-02f 5 2 -3.4017987e+04 0.00e+00 5.22e+01 0.9 2.65e+00 - 9.95e-01 5.00e-01f 2 3 -3.4027289e+04 0.00e+00 5.04e+01 -0.9 1.85e-01 - 1.00e+00 1.00e+00f 1 4 -3.4168179e+04 0.00e+00 8.12e-04 -2.6 9.10e-02 - 1.00e+00 1.00e+00f 1 5 -3.4168179e+04 0.00e+00 6.87e-04 -8.6 1.44e-06 - 9.97e-01 1.00e+00f 1 6 -3.4168179e+04 0.00e+00 4.95e-05 -5.3 9.05e-06 - 1.00e+00 1.00e+00f 1 7 -3.4168179e+04 0.00e+00 1.75e-06 -11.0 7.03e-07 - 1.00e+00 1.00e+00f 1 8 -3.4168179e+04 0.00e+00 3.46e-10 -11.0 2.58e-08 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -5.5678538550780365e+02 -3.4168178932720257e+04 Dual infeasibility......: 3.4606855230190662e-10 2.1237145452829558e-08 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000000119588569e-11 6.1366875335943485e-10 Overall NLP error.......: 3.4606855230190662e-10 2.1237145452829558e-08 Number of objective function evaluations = 22 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.169 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -3.0000000e+00 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.0000000e+00 0.00e+00 8.26e-07 -4.3 8.34e-07 - 9.90e-01 1.00e+00f 1 2 -3.0000000e+00 0.00e+00 6.98e-03 -0.4 6.98e-03 - 1.00e+00 1.00e+00f 1 3 -3.0000000e+00 0.00e+00 1.40e-03 -1.1 1.40e-03 - 1.00e+00 1.00e+00f 1 4 -3.0000000e+00 0.00e+00 2.79e-04 -1.8 2.79e-04 - 1.00e+00 1.00e+00f 1 5 -3.0000000e+00 0.00e+00 3.53e-05 -2.7 3.53e-05 - 1.00e+00 1.00e+00f 1 6 -3.0000000e+00 0.00e+00 1.59e-06 -4.0 1.59e-06 - 1.00e+00 1.00e+00f 1 7 -3.0000000e+00 0.00e+00 1.52e-08 -6.1 1.52e-08 - 1.00e+00 1.00e+00f 1 8 -3.0000000e+00 0.00e+00 1.59e-11 -9.0 1.59e-11 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -3.0000000000000000e+00 -3.0000000000000000e+00 Dual infeasibility......: 1.5858009121306727e-11 1.5858009121306727e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0909090929112258e-10 9.0909090929112258e-10 Overall NLP error.......: 9.0909090929112258e-10 9.0909090929112258e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.163 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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.9287848e+04 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.9287848e+04 0.00e+00 1.91e-06 -4.3 1.92e-06 - 9.90e-01 1.00e+00f 1 2 -1.9287848e+04 0.00e+00 1.73e-18 -0.4 2.50e+01 - 1.00e+00 1.00e+00f 1 3 -1.9287848e+04 0.00e+00 3.33e-13 -1.1 1.25e+00 - 1.00e+00 1.00e+00f 1 4 -1.9287848e+04 0.00e+00 1.46e-09 -1.8 1.00e+00 - 1.00e+00 1.00e+00f 1 5 -1.9287848e+04 0.00e+00 6.52e-06 -2.7 6.52e-06 - 1.00e+00 1.00e+00f 1 6 -1.9287848e+04 0.00e+00 2.95e-07 -4.0 2.95e-07 - 1.00e+00 1.00e+00f 1 7 -1.9287848e+04 0.00e+00 4.26e-09 -6.1 4.26e-09 - 1.00e+00 1.00e+00f 1 8 -1.9287848e+04 0.00e+00 1.46e-09 -11.0 1.46e-09 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -1.9287848304074814e+04 -1.9287848304074814e+04 Dual infeasibility......: 1.4648596976799182e-09 1.4648596976799182e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000023568823770e-11 1.0000023568823770e-11 Overall NLP error.......: 1.4648596976799182e-09 1.4648596976799182e-09 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.008 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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.9945623e+04 0.00e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.3140853e+04 0.00e+00 3.24e+02 2.0 9.65e+01 - 8.66e-01 3.61e-02f 5 2 -2.7482598e+04 0.00e+00 5.20e+01 0.9 2.65e+00 - 9.95e-01 5.00e-01f 2 3 -2.7485156e+04 0.00e+00 5.00e+01 -0.9 1.84e-01 - 1.00e+00 1.00e+00f 1 4 -2.7518547e+04 0.00e+00 1.12e-02 -2.6 9.05e-02 - 1.00e+00 1.00e+00f 1 5 -2.7518547e+04 0.00e+00 3.91e-02 -4.5 2.03e-05 - 1.00e+00 1.00e+00f 1 6 -2.7518547e+04 0.00e+00 8.76e-02 -6.4 7.08e-05 - 1.00e+00 1.00e+00f 1 7 -2.7518547e+04 0.00e+00 4.58e-02 -8.3 1.59e-04 - 1.00e+00 1.00e+00f 1 8 -2.7518547e+04 0.00e+00 4.52e-02 -10.1 4.58e-02 - 1.00e+00 3.91e-03f 9 9 -2.7518547e+04 0.00e+00 1.50e-03 -10.2 8.88e-05 - 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.7518547e+04 0.00e+00 3.17e-05 -11.0 2.86e-06 - 1.00e+00 1.00e+00f 1 11 -2.7518547e+04 0.00e+00 3.03e-08 -11.0 6.17e-08 - 1.00e+00 1.00e+00f 1 12 -2.7518547e+04 0.00e+00 4.37e-11 -11.0 5.89e-11 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: -1.8609184686892529e+03 -2.7518546894672287e+04 Dual infeasibility......: 4.3695757197497845e-11 6.4615605883287607e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000000000000001e-11 1.4787615555266702e-10 Overall NLP error.......: 4.3695757197497845e-11 6.4615605883287607e-10 Number of objective function evaluations = 38 Number of objective gradient evaluations = 13 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 = 0 Total seconds in IPOPT = 0.014 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -2.0660146e+04 0.00e+00 4.25e-04 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.0660146e+04 0.00e+00 3.69e-04 -4.3 3.70e-04 - 9.90e-01 1.00e+00f 1 2 -2.0660146e+04 0.00e+00 3.60e-02 -0.4 1.41e+01 - 1.00e+00 1.00e+00f 1 3 -2.0660146e+04 0.00e+00 3.60e-04 -6.2 1.11e-05 - 9.90e-01 1.00e+00f 1 4 -2.0660146e+04 0.00e+00 1.13e-04 -2.3 3.74e+00 - 1.00e+00 1.00e+00f 1 5 -2.0660146e+04 0.00e+00 1.34e-06 -8.3 1.86e-02 - 9.94e-01 1.00e+00f 1 6 -2.0660146e+04 0.00e+00 8.20e-07 -10.6 8.20e-07 - 1.00e+00 1.00e+00f 1 7 -2.0660146e+04 0.00e+00 8.20e-07 -9.1 8.20e-07 - 1.00e+00 1.00e+00f 1 8 -2.0660146e+04 0.00e+00 8.20e-07 -9.1 8.20e-07 - 1.00e+00 1.00e+00f 1 9 -2.0660146e+04 0.00e+00 8.20e-07 -9.1 8.20e-07 - 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.0660146e+04 0.00e+00 8.20e-07 -9.1 8.20e-07 - 1.00e+00 1.00e+00f 1 11 -2.0660146e+04 0.00e+00 8.20e-07 -9.1 8.20e-07 - 1.00e+00 1.00e+00f 1 12 -2.0660146e+04 0.00e+00 8.20e-07 -9.1 8.20e-07 - 1.00e+00 1.00e+00f 1 13 -2.0660146e+04 0.00e+00 8.20e-07 -9.1 8.20e-07 - 1.00e+00 1.00e+00f 1 14 -2.0660146e+04 0.00e+00 8.20e-07 -9.1 8.20e-07 - 1.00e+00 1.00e+00f 1 15 -2.0660146e+04 0.00e+00 8.20e-07 -9.1 8.20e-07 - 1.00e+00 1.00e+00f 1 16 -2.0660146e+04 0.00e+00 8.20e-07 -11.0 8.20e-07 - 1.00e+00 1.00e+00f 1 17 -2.0660146e+04 0.00e+00 8.20e-07 -11.0 8.20e-07 - 1.00e+00 1.00e+00f 1 18 -2.0660146e+04 0.00e+00 8.20e-07 -11.0 8.20e-07 - 1.00e+00 1.00e+00f 1 19 -2.0660146e+04 0.00e+00 8.20e-07 -11.0 8.20e-07 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.0660146e+04 0.00e+00 8.20e-07 -11.0 8.20e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 20 (scaled) (unscaled) Objective...............: -2.0660146235319284e+04 -2.0660146235319284e+04 Dual infeasibility......: 8.2002123636138771e-07 8.2002123636138771e-07 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.9999999999999994e-12 9.9999999999999994e-12 Overall NLP error.......: 8.2002123636138771e-07 8.2002123636138771e-07 Number of objective function evaluations = 21 Number of objective gradient evaluations = 21 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 = 0 Total seconds in IPOPT = 0.017 EXIT: Solved To Acceptable Level. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -2.0660146e+04 0.00e+00 1.60e-14 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.0660146e+04 0.00e+00 4.24e-06 -4.3 4.28e-06 - 9.90e-01 1.00e+00f 1 2 -2.0662771e+04 0.00e+00 1.09e+01 -0.4 3.25e+01 - 1.00e+00 1.00e+00f 1 3 -2.1074976e+04 0.00e+00 7.88e+02 1.6 3.38e+04 - 1.44e-03 8.51e-04f 2 4 -2.1308271e+04 0.00e+00 1.07e+03 -0.3 2.84e+01 - 1.00e+00 1.25e-01f 4 5 -2.2992418e+04 0.00e+00 9.16e+02 -1.7 2.04e+00 - 1.00e+00 1.00e+00f 1 Cholesky factorization failed for LBFGS update! Skipping update. 6 -2.3171790e+04 0.00e+00 1.93e+02 -3.0 9.43e-01 - 1.00e+00 5.00e-01f 2 Cholesky factorization failed for LBFGS update! Skipping update. 7 -2.3178662e+04 0.00e+00 5.08e+01 -4.8 1.98e-01 - 1.00e+00 5.00e-01f 2 8 -2.3179156e+04 0.00e+00 9.10e+00 -6.5 5.22e-02 - 1.00e+00 5.00e-01f 2 9 -2.3179162e+04 0.00e+00 7.32e+00 -7.4 9.10e+00 - 1.00e+00 9.77e-04f 11 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.3179172e+04 0.00e+00 2.05e+00 -8.9 3.96e-03 - 1.00e+00 1.00e+00f 1 11 -2.3179173e+04 0.00e+00 4.76e-01 -10.7 8.66e-04 - 1.00e+00 1.00e+00f 1 12 -2.3179173e+04 0.00e+00 1.80e-01 -11.0 2.62e-04 - 1.00e+00 1.00e+00f 1 13 -2.3179173e+04 0.00e+00 3.59e-04 -11.0 7.20e-05 - 1.00e+00 1.00e+00f 1 14 -2.3179173e+04 0.00e+00 2.14e-07 -11.0 1.43e-07 - 1.00e+00 1.00e+00f 1 15 -2.3179173e+04 0.00e+00 7.23e-11 -11.0 8.53e-11 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 15 (scaled) (unscaled) Objective...............: -2.3179172924068633e+04 -2.3179172924068633e+04 Dual infeasibility......: 7.2308619485761754e-11 7.2308619485761754e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.9999999999999994e-12 9.9999999999999994e-12 Overall NLP error.......: 7.2308619485761754e-11 7.2308619485761754e-11 Number of objective function evaluations = 57 Number of objective gradient evaluations = 16 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 = 0 Total seconds in IPOPT = 0.020 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -2.2794497e+04 0.00e+00 2.03e-02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.2794497e+04 0.00e+00 2.16e-02 -4.3 1.94e-02 - 9.90e-01 1.00e+00f 1 2 -2.2794498e+04 0.00e+00 2.50e-02 -6.3 2.24e-02 - 9.89e-01 1.00e+00f 1 3 -2.2794499e+04 0.00e+00 2.85e-02 -4.1 2.51e-02 - 1.00e+00 1.00e+00f 1 4 -2.2794500e+04 0.00e+00 3.28e-02 -6.0 2.85e-02 - 1.00e+00 1.00e+00f 1 5 -2.2794501e+04 0.00e+00 3.87e-02 -7.9 3.28e-02 - 1.00e+00 1.00e+00f 1 6 -2.2794502e+04 0.00e+00 4.69e-02 -9.8 3.87e-02 - 1.00e+00 1.00e+00f 1 7 -2.2794505e+04 0.00e+00 5.91e-02 -11.0 4.69e-02 - 1.00e+00 1.00e+00f 1 8 -2.2794509e+04 0.00e+00 7.89e-02 -11.0 5.91e-02 - 1.00e+00 1.00e+00f 1 9 -2.2794516e+04 0.00e+00 1.15e-01 -11.0 7.89e-02 - 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.2794534e+04 0.00e+00 1.98e-01 -11.0 1.15e-01 - 1.00e+00 1.00e+00f 1 11 -2.2794597e+04 0.00e+00 4.84e-01 -11.0 1.98e-01 - 1.00e+00 1.00e+00f 1 12 -2.2795371e+04 0.00e+00 3.65e+00 -11.0 4.84e-01 - 1.00e+00 1.00e+00f 1 13 -2.7009138e+04 0.00e+00 2.06e+03 -11.0 3.65e+00 - 1.00e+00 1.00e+00f 1 14 -2.7239718e+04 0.00e+00 1.61e+03 -9.3 2.06e+03 - 1.00e+00 4.10e-04f 7 15 -2.7538633e+04 0.00e+00 5.24e+01 -10.8 3.71e-01 - 1.00e+00 1.00e+00f 1 16 -2.7538919e+04 0.00e+00 3.47e+00 -11.0 1.17e-02 - 1.00e+00 1.00e+00f 1 17 -2.7538921e+04 0.00e+00 2.70e-04 -11.0 7.26e-04 - 1.00e+00 1.00e+00f 1 18 -2.7538921e+04 0.00e+00 3.35e-10 -11.0 5.64e-08 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 18 (scaled) (unscaled) Objective...............: -2.7538920663531877e+04 -2.7538920663531877e+04 Dual infeasibility......: 3.3472702470154949e-10 3.3472702470154949e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.9999999999999994e-12 9.9999999999999994e-12 Overall NLP error.......: 3.3472702470154949e-10 3.3472702470154949e-10 Number of objective function evaluations = 29 Number of objective gradient evaluations = 19 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 = 0 Total seconds in IPOPT = 0.017 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -3.7392212e+04 0.00e+00 6.27e-07 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.7392212e+04 0.00e+00 3.60e-03 -4.3 2.34e-07 - 9.90e-01 1.00e+00f 1 2 -3.7392212e+04 0.00e+00 1.59e-01 -0.4 1.06e-02 - 1.00e+00 1.56e-02f 7 3 -3.7392212e+04 0.00e+00 5.04e-02 -2.3 1.52e-01 - 9.98e-01 1.22e-04f 14 4 -3.7392212e+04 0.00e+00 1.86e-02 -4.2 5.05e-02 - 1.00e+00 1.22e-04f 14 5 -3.7392212e+04 0.00e+00 1.62e-04 -4.2 1.66e-06 - 1.00e+00 1.00e+00f 1 6 -3.7392212e+04 0.00e+00 5.42e-07 -10.2 1.45e-08 - 1.00e+00 1.00e+00f 1 7 -3.7392212e+04 0.00e+00 2.92e-09 -8.1 4.86e-11 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: -3.7392212177581088e+04 -3.7392212177581088e+04 Dual infeasibility......: 2.9214032461524336e-09 2.9214032461524336e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 7.6182776940765133e-09 7.6182776940765133e-09 Overall NLP error.......: 7.6182776940765133e-09 7.6182776940765133e-09 Number of objective function evaluations = 52 Number of objective gradient evaluations = 8 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 = 0 Total seconds in IPOPT = 0.165 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -3.7392404e+04 0.00e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.7414383e+04 0.00e+00 2.15e+01 2.0 9.71e+01 - 8.13e-01 6.85e-04f 11 2 -3.7415214e+04 0.00e+00 1.59e-02 -4.1 1.07e-02 - 9.90e-01 1.00e+00f 1 3 -3.7415214e+04 0.00e+00 2.42e-04 -6.1 2.22e-05 - 9.90e-01 1.00e+00f 1 4 -3.7415214e+04 0.00e+00 2.39e-06 -8.1 1.37e-09 - 9.90e-01 1.00e+00f 1 5 -3.7415214e+04 0.00e+00 3.58e-12 -4.2 6.40e-10 - 1.00e+00 1.00e+00f 1 6 -3.7415214e+04 0.00e+00 4.71e-12 -6.3 6.35e-10 - 1.00e+00 1.00e+00f 1 7 -3.7415214e+04 0.00e+00 8.76e-09 -11.0 5.20e-12 - 1.00e+00 6.25e-02f 5 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: -4.5858258493569137e+03 -3.7415213839323849e+04 Dual infeasibility......: 8.7571413130528396e-09 7.1448486185971664e-08 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000000089325880e-11 8.1588824788855440e-11 Overall NLP error.......: 8.7571413130528396e-09 7.1448486185971664e-08 Number of objective function evaluations = 30 Number of objective gradient evaluations = 8 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 = 0 Total seconds in IPOPT = 0.171 EXIT: Optimal Solution Found. [info | PowerModels]: extending matpower format with data: areas 1x3 [info | PowerModels]: removing 1 cost terms from generator 4: [4000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 1: [1400.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 5: [1000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 2: [1500.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 3: [3000.0, 0.0] This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -3.0000000e+00 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.0000000e+00 0.00e+00 1.91e-06 -4.3 1.92e-06 - 9.90e-01 1.00e+00f 1 Cholesky factorization failed for LBFGS update! Skipping update. 2 -3.0000000e+00 0.00e+00 0.00e+00 -0.4 2.50e+01 - 1.00e+00 1.00e+00f 1 3 -3.0000000e+00 0.00e+00 0.00e+00 -1.1 1.25e+00 - 1.00e+00 1.00e+00f 1 4 -3.0000000e+00 0.00e+00 0.00e+00 -1.8 1.00e+00 - 1.00e+00 1.00e+00f 1 5 -3.0000000e+00 0.00e+00 6.52e-06 -2.7 6.52e-06 - 1.00e+00 1.00e+00f 1 6 -3.0000000e+00 0.00e+00 2.93e-07 -4.0 2.93e-07 - 1.00e+00 1.00e+00f 1 7 -3.0000000e+00 0.00e+00 2.80e-09 -6.1 2.80e-09 - 1.00e+00 1.00e+00f 1 8 -3.0000000e+00 0.00e+00 2.93e-12 -9.0 2.93e-12 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -3.0000000000000000e+00 -3.0000000000000000e+00 Dual infeasibility......: 2.9291922335158870e-12 2.9291922335158870e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0909090913808290e-10 9.0909090913808290e-10 Overall NLP error.......: 9.0909090913808290e-10 9.0909090913808290e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.170 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -3.0000000e+00 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.0000000e+00 0.00e+00 8.26e-07 -4.3 8.34e-07 - 9.90e-01 1.00e+00f 1 2 -3.0000000e+00 0.00e+00 6.98e-03 -0.4 6.98e-03 - 1.00e+00 1.00e+00f 1 3 -3.0000000e+00 0.00e+00 1.40e-03 -1.1 1.40e-03 - 1.00e+00 1.00e+00f 1 4 -3.0000000e+00 0.00e+00 2.79e-04 -1.8 2.79e-04 - 1.00e+00 1.00e+00f 1 5 -3.0000000e+00 0.00e+00 3.53e-05 -2.7 3.53e-05 - 1.00e+00 1.00e+00f 1 6 -3.0000000e+00 0.00e+00 1.59e-06 -4.0 1.59e-06 - 1.00e+00 1.00e+00f 1 7 -3.0000000e+00 0.00e+00 1.52e-08 -6.1 1.52e-08 - 1.00e+00 1.00e+00f 1 8 -3.0000000e+00 0.00e+00 1.59e-11 -9.0 1.59e-11 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -3.0000000000000000e+00 -3.0000000000000000e+00 Dual infeasibility......: 1.5858008010442869e-11 1.5858008010442869e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0909090929112010e-10 9.0909090929112010e-10 Overall NLP error.......: 9.0909090929112010e-10 9.0909090929112010e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.258 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -3.0000000e+00 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.0000000e+00 0.00e+00 6.31e-06 -4.3 6.38e-06 - 9.90e-01 1.00e+00f 1 2 -3.0000000e+00 0.00e+00 5.96e-02 -0.4 5.96e-02 - 1.00e+00 1.00e+00f 1 3 -3.0000000e+00 0.00e+00 1.17e-02 -1.1 1.17e-02 - 1.00e+00 1.00e+00f 1 4 -3.0000000e+00 0.00e+00 2.36e-03 -1.8 2.36e-03 - 1.00e+00 1.00e+00f 1 5 -3.0000000e+00 0.00e+00 2.98e-04 -2.7 2.98e-04 - 1.00e+00 1.00e+00f 1 6 -3.0000000e+00 0.00e+00 1.34e-05 -4.0 1.34e-05 - 1.00e+00 1.00e+00f 1 7 -3.0000000e+00 0.00e+00 1.28e-07 -6.1 1.28e-07 - 1.00e+00 1.00e+00f 1 8 -3.0000000e+00 0.00e+00 1.34e-10 -9.0 1.34e-10 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -3.0000000000000000e+00 -3.0000000000000000e+00 Dual infeasibility......: 1.3404753483525235e-10 1.3404753483525235e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0909091033303205e-10 9.0909091033303205e-10 Overall NLP error.......: 9.0909091033303205e-10 9.0909091033303205e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.257 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -6.5378013e+01 0.00e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.6812390e+02 0.00e+00 3.24e+02 2.0 9.65e+01 - 8.66e-01 3.61e-02f 5 2 -7.7780666e+02 0.00e+00 4.98e+01 0.9 2.65e+00 - 9.95e-01 5.00e-01f 2 3 -7.7839929e+02 0.00e+00 4.47e+01 -0.9 1.78e-01 - 1.00e+00 1.00e+00f 1 4 -7.8092786e+02 0.00e+00 1.74e+00 -2.6 8.43e-02 - 1.00e+00 1.00e+00f 1 5 -7.8093295e+02 0.00e+00 2.85e-01 -4.5 3.16e-03 - 1.00e+00 1.00e+00f 1 6 -7.8093305e+02 0.00e+00 5.89e-02 -6.4 6.19e-04 - 1.00e+00 1.00e+00f 1 7 -7.8093305e+02 0.00e+00 9.28e-06 -8.3 1.06e-04 - 1.00e+00 1.00e+00f 1 8 -7.8093305e+02 0.00e+00 2.48e-10 -11.0 1.67e-08 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -5.5695705259172598e+02 -7.8093305460000875e+02 Dual infeasibility......: 2.4832515449100386e-10 3.4818720856172466e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000001688958142e-11 1.4021425581422546e-11 Overall NLP error.......: 2.4832515449100386e-10 3.4818720856172466e-10 Number of objective function evaluations = 22 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.426 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -3.0000000e+00 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.0000000e+00 0.00e+00 8.26e-07 -4.3 8.34e-07 - 9.90e-01 1.00e+00f 1 2 -3.0000000e+00 0.00e+00 6.98e-03 -0.4 6.98e-03 - 1.00e+00 1.00e+00f 1 3 -3.0000000e+00 0.00e+00 1.40e-03 -1.1 1.40e-03 - 1.00e+00 1.00e+00f 1 4 -3.0000000e+00 0.00e+00 2.79e-04 -1.8 2.79e-04 - 1.00e+00 1.00e+00f 1 5 -3.0000000e+00 0.00e+00 3.53e-05 -2.7 3.53e-05 - 1.00e+00 1.00e+00f 1 6 -3.0000000e+00 0.00e+00 1.59e-06 -4.0 1.59e-06 - 1.00e+00 1.00e+00f 1 7 -3.0000000e+00 0.00e+00 1.52e-08 -6.1 1.52e-08 - 1.00e+00 1.00e+00f 1 8 -3.0000000e+00 0.00e+00 1.59e-11 -9.0 1.59e-11 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -3.0000000000000000e+00 -3.0000000000000000e+00 Dual infeasibility......: 1.5858009121306727e-11 1.5858009121306727e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0909090929112258e-10 9.0909090929112258e-10 Overall NLP error.......: 9.0909090929112258e-10 9.0909090929112258e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.259 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -8.1681330e+02 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -8.1681330e+02 0.00e+00 1.91e-06 -4.3 1.92e-06 - 9.90e-01 1.00e+00f 1 2 -8.1681330e+02 0.00e+00 1.64e-02 -0.4 1.64e-02 - 1.00e+00 1.00e+00f 1 3 -8.1681330e+02 0.00e+00 3.27e-03 -1.1 3.27e-03 - 1.00e+00 1.00e+00f 1 4 -8.1681330e+02 0.00e+00 6.55e-04 -1.8 6.55e-04 - 1.00e+00 1.00e+00f 1 5 -8.1681330e+02 0.00e+00 8.29e-05 -2.7 8.29e-05 - 1.00e+00 1.00e+00f 1 6 -8.1681330e+02 0.00e+00 3.73e-06 -4.0 3.73e-06 - 1.00e+00 1.00e+00f 1 7 -8.1681330e+02 0.00e+00 3.56e-08 -6.1 3.56e-08 - 1.00e+00 1.00e+00f 1 8 -8.1681330e+02 0.00e+00 3.72e-11 -9.0 3.72e-11 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -8.1681329503509733e+02 -8.1681329503509733e+02 Dual infeasibility......: 3.7240480667635500e-11 3.7240480667635500e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0909090948885163e-10 9.0909090948885163e-10 Overall NLP error.......: 9.0909090948885163e-10 9.0909090948885163e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.007 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -8.1681330e+02 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -8.1681330e+02 0.00e+00 2.42e-07 -4.3 2.44e-07 - 9.90e-01 1.00e+00f 1 2 -8.1681330e+02 0.00e+00 2.03e-03 -0.4 2.03e-03 - 1.00e+00 1.00e+00f 1 3 -8.1681330e+02 0.00e+00 4.06e-04 -1.1 4.06e-04 - 1.00e+00 1.00e+00f 1 4 -8.1681330e+02 0.00e+00 8.12e-05 -1.8 8.12e-05 - 1.00e+00 1.00e+00f 1 5 -8.1681330e+02 0.00e+00 1.03e-05 -2.7 1.03e-05 - 1.00e+00 1.00e+00f 1 6 -8.1681330e+02 0.00e+00 4.62e-07 -4.0 4.62e-07 - 1.00e+00 1.00e+00f 1 7 -8.1681330e+02 0.00e+00 4.41e-09 -6.1 4.41e-09 - 1.00e+00 1.00e+00f 1 8 -8.1681330e+02 0.00e+00 4.62e-12 -9.0 4.62e-12 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -8.1681329503509733e+02 -8.1681329503509733e+02 Dual infeasibility......: 4.6156762330951807e-12 4.6156762330951807e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0909090916215903e-10 9.0909090916215903e-10 Overall NLP error.......: 9.0909090916215903e-10 9.0909090916215903e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 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 = 0 Total seconds in IPOPT = 0.259 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -9.1772333e+02 0.00e+00 1.88e-05 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -9.1772333e+02 0.00e+00 2.24e-05 -4.3 2.25e-05 - 9.90e-01 1.00e+00f 1 2 -9.1772334e+02 0.00e+00 3.74e-03 -0.4 3.28e+01 - 1.00e+00 1.00e+00f 1 3 -9.1772305e+02 0.00e+00 1.45e-03 -1.1 1.74e+00 - 1.00e+00 1.00e+00f 1 4 -9.1772334e+02 0.00e+00 2.16e-04 -1.8 1.48e+00 - 1.00e+00 1.00e+00f 1 5 -9.1772334e+02 0.00e+00 1.86e-06 -7.8 3.10e-04 - 9.90e-01 1.00e+00f 1 6 -9.1772334e+02 0.00e+00 2.16e-08 -3.9 3.88e-01 - 1.00e+00 5.00e-01f 2 7 -9.1772334e+02 0.00e+00 1.54e-07 -5.8 2.62e-01 - 1.00e+00 1.00e+00f 1 8 -9.1772334e+02 0.00e+00 1.32e-07 -11.0 6.00e-02 - 9.99e-01 1.00e+00f 1 9 -9.1772334e+02 0.00e+00 5.78e-08 -11.0 1.24e-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 -9.1772334e+02 0.00e+00 2.99e-08 -11.0 9.60e-02 - 1.00e+00 1.00e+00f 1 11 -9.1772334e+02 0.00e+00 1.41e-08 -11.0 1.03e-01 - 1.00e+00 1.00e+00f 1 12 -9.1772334e+02 0.00e+00 6.20e-09 -11.0 9.16e-02 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: -9.1772333588194829e+02 -9.1772333588194829e+02 Dual infeasibility......: 6.2002524531246172e-09 6.2002524531246172e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.9999776213322168e-12 9.9999776213322168e-12 Overall NLP error.......: 6.2002524531246172e-09 6.2002524531246172e-09 Number of objective function evaluations = 18 Number of objective gradient evaluations = 13 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 = 0 Total seconds in IPOPT = 0.015 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -9.1772334e+02 0.00e+00 6.66e-16 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -9.1772334e+02 0.00e+00 4.24e-06 -4.3 4.28e-06 - 9.90e-01 1.00e+00f 1 2 -9.1772329e+02 0.00e+00 2.69e-04 -0.4 3.25e+01 - 1.00e+00 5.00e-01f 2 3 -9.1772259e+02 0.00e+00 3.47e-03 -1.1 4.07e+00 - 1.00e+00 1.25e-01f 4 4 -9.1772328e+02 0.00e+00 1.32e-04 -1.8 4.85e-01 - 1.00e+00 1.00e+00f 1 5 -9.1772329e+02 0.00e+00 2.01e-04 -2.7 3.54e-02 - 1.00e+00 1.00e+00f 1 6 -9.1772332e+02 0.00e+00 9.89e-05 -4.0 1.64e-01 - 1.00e+00 1.00e+00f 1 7 -9.1772333e+02 0.00e+00 5.43e-05 -6.1 1.10e-01 - 1.00e+00 1.00e+00f 1 8 -9.1772333e+02 0.00e+00 2.61e-05 -6.1 1.26e-01 - 1.00e+00 1.00e+00f 1 9 -9.1772333e+02 0.00e+00 1.31e-05 -6.1 1.16e-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 -9.1772333e+02 0.00e+00 6.43e-06 -6.1 1.17e-01 - 1.00e+00 1.00e+00f 1 11 -9.1772334e+02 0.00e+00 3.20e-06 -9.0 1.13e-01 - 1.00e+00 1.00e+00f 1 12 -9.1772334e+02 0.00e+00 1.58e-06 -9.0 1.12e-01 - 1.00e+00 1.00e+00f 1 13 -9.1772334e+02 0.00e+00 7.85e-07 -9.0 1.09e-01 - 1.00e+00 1.00e+00f 1 14 -9.1772334e+02 0.00e+00 3.89e-07 -9.0 1.08e-01 - 1.00e+00 1.00e+00f 1 15 -9.1772334e+02 0.00e+00 1.93e-07 -9.0 1.06e-01 - 1.00e+00 1.00e+00f 1 16 -9.1772334e+02 0.00e+00 9.57e-08 -9.0 1.04e-01 - 1.00e+00 1.00e+00f 1 17 -9.1772334e+02 0.00e+00 4.75e-08 -9.0 1.02e-01 - 1.00e+00 1.00e+00f 1 18 -9.1772334e+02 0.00e+00 2.36e-08 -9.0 1.01e-01 - 1.00e+00 1.00e+00f 1 19 -9.1772334e+02 0.00e+00 1.17e-08 -9.0 9.93e-02 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.1772334e+02 0.00e+00 5.80e-09 -9.0 9.78e-02 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 20 (scaled) (unscaled) Objective...............: -9.1772333588247761e+02 -9.1772333588247761e+02 Dual infeasibility......: 5.7994419581072772e-09 5.7994419581072772e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.0908940625398011e-10 9.0908940625398011e-10 Overall NLP error.......: 5.7994419581072772e-09 5.7994419581072772e-09 Number of objective function evaluations = 33 Number of objective gradient evaluations = 21 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 = 0 Total seconds in IPOPT = 0.441 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 -8.3364547e+02 0.00e+00 2.94e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -9.5097204e+02 0.00e+00 3.07e+01 0.5 2.85e+00 - 9.94e-01 1.00e+00f 1 2 -9.5302716e+02 0.00e+00 2.18e+01 -0.5 3.07e+01 - 1.00e+00 1.56e-02f 7 3 -9.5493982e+02 0.00e+00 2.72e+00 -1.3 1.99e-01 - 1.00e+00 1.00e+00f 1 4 -9.5496941e+02 0.00e+00 4.37e-02 -3.2 2.21e-02 - 1.00e+00 1.00e+00f 1 5 -9.5496942e+02 0.00e+00 4.05e-05 -5.1 3.49e-04 - 1.00e+00 1.00e+00f 1 6 -9.5496942e+02 0.00e+00 2.40e-10 -11.0 3.23e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 6 (scaled) (unscaled) Objective...............: -9.5496942228962746e+02 -9.5496942228962746e+02 Dual infeasibility......: 2.3958812358622071e-10 2.3958812358622071e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.0568827388689652e-10 3.0568827388689652e-10 Overall NLP error.......: 3.0568827388689652e-10 3.0568827388689652e-10 Number of objective function evaluations = 17 Number of objective gradient evaluations = 7 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 = 0 Total seconds in IPOPT = 0.170 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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.5903711e+03 0.00e+00 0.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.5903711e+03 0.00e+00 1.84e-01 -4.3 6.31e-06 - 9.90e-01 1.00e+00f 1 2 -1.5903717e+03 0.00e+00 2.71e+00 -0.4 2.43e-01 - 1.00e+00 3.12e-02f 6 3 -1.5903722e+03 0.00e+00 2.57e+00 -2.3 7.11e-03 - 1.00e+00 1.00e+00f 1 4 -1.5903767e+03 0.00e+00 3.18e-02 -4.2 3.42e-03 - 1.00e+00 1.00e+00f 1 5 -1.5903767e+03 0.00e+00 7.53e-04 -6.0 4.28e-05 - 1.00e+00 1.00e+00f 1 6 -1.5903767e+03 0.00e+00 7.71e-09 -8.1 9.91e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 6 (scaled) (unscaled) Objective...............: -1.5903767352895306e+03 -1.5903767352895306e+03 Dual infeasibility......: 7.7078997290381272e-09 7.7078997290381272e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 7.2589215804354345e-09 7.2589215804354345e-09 Overall NLP error.......: 7.7078997290381272e-09 7.7078997290381272e-09 Number of objective function evaluations = 16 Number of objective gradient evaluations = 7 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 = 0 Total seconds in IPOPT = 0.421 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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.5903711e+03 0.00e+00 1.55e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.5905242e+03 0.00e+00 6.80e+00 1.1 1.17e+01 - 9.96e-01 2.08e-03f 9 2 -1.5905302e+03 0.00e+00 4.13e-02 -4.9 3.97e-03 - 9.89e-01 1.00e+00f 1 3 -1.5905302e+03 0.00e+00 3.78e-04 -6.9 4.50e-06 - 9.90e-01 1.00e+00f 1 4 -1.5905302e+03 0.00e+00 2.49e-11 -3.0 1.94e-07 - 1.00e+00 1.00e+00f 1 5 -1.5905302e+03 0.00e+00 1.32e-11 -4.5 1.88e-07 - 1.00e+00 1.00e+00f 1 6 -1.5905302e+03 0.00e+00 1.39e-10 -10.5 6.14e-09 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 6 (scaled) (unscaled) Objective...............: -1.5905302314976630e+03 -1.5905302314976630e+03 Dual infeasibility......: 1.3905916450870190e-10 1.3905916450870190e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.9203308075422763e-10 9.9203308075422763e-10 Overall NLP error.......: 9.9203308075422763e-10 9.9203308075422763e-10 Number of objective function evaluations = 19 Number of objective gradient evaluations = 7 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 = 0 Total seconds in IPOPT = 0.171 EXIT: Optimal Solution Found. Test Summary: | Pass Broken Total Time PowerModelsMarkets | 58 4 62 5m52.0s Testing OptimalBids tests passed Testing completed after 383.67s PkgEval succeeded after 1008.76s