Package evaluation to test NLSolvers on Julia 1.14.0-DEV.1372 (893635dc59*) started at 2025-12-16T13:25:48.802 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 9.67s ################################################################################ # Installation # Installing NLSolvers... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [337daf1e] + NLSolvers v0.5.0 Updating `~/.julia/environments/v1.14/Manifest.toml` [42fd0dbc] + IterativeSolvers v0.9.4 [337daf1e] + NLSolvers v0.5.0 [85a6dd25] + PositiveFactorizations v0.2.4 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [3cdcf5f2] + RecipesBase v1.3.4 [10745b16] + Statistics v1.11.1 [56f22d72] + Artifacts v1.11.0 [ade2ca70] + Dates v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Installation completed after 1.1s ################################################################################ # Precompilation # ERROR: LoadError: MethodError: no method matching setindex!(::Base.ScopedValues.ScopedValue{IO}, ::Nothing) The function `setindex!` exists, but no method is defined for this combination of argument types. Stacktrace: [1] top-level scope @ /PkgEval.jl/scripts/precompile.jl:10 [2] include(mod::Module, _path::String) @ Base ./Base.jl:309 [3] exec_options(opts::Base.JLOptions) @ Base ./client.jl:344 [4] _start() @ Base ./client.jl:577 in expression starting at /PkgEval.jl/scripts/precompile.jl:6 caused by: MethodError: no method matching setindex!(::Base.ScopedValues.ScopedValue{IO}, ::Base.DevNull) The function `setindex!` exists, but no method is defined for this combination of argument types. Stacktrace: [1] top-level scope @ /PkgEval.jl/scripts/precompile.jl:7 [2] include(mod::Module, _path::String) @ Base ./Base.jl:309 [3] exec_options(opts::Base.JLOptions) @ Base ./client.jl:344 [4] _start() @ Base ./client.jl:577 Precompilation failed after 13.36s ################################################################################ # Testing # Testing NLSolvers Status `/tmp/jl_t6dgPO/Project.toml` [7e558dbc] ArbNumerics v1.6.3 [497a8b3b] DoubleFloats v1.5.0 ⌅ [f6369f11] ForwardDiff v0.10.39 [14197337] GenericLinearAlgebra v0.3.19 [4d00f742] GeometryTypes v0.8.5 [42fd0dbc] IterativeSolvers v0.9.4 [7a12625a] LinearMaps v3.11.4 [337daf1e] NLSolvers v0.5.0 [85a6dd25] PositiveFactorizations v0.2.4 ⌅ [47a9eef4] SparseDiffTools v1.31.0 [90137ffa] StaticArrays v1.9.15 [10745b16] Statistics v1.11.1 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_t6dgPO/Manifest.toml` ⌅ [79e6a3ab] Adapt v3.7.2 [7e558dbc] ArbNumerics v1.6.3 [ec485272] ArnoldiMethod v0.4.0 ⌃ [4fba245c] ArrayInterface v7.7.1 ⌅ [3da002f7] ColorTypes v0.11.5 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 ⌅ [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.5.0 [6a86dc24] FiniteDiff v2.29.0 [53c48c17] FixedPointNumbers v0.8.5 ⌅ [f6369f11] ForwardDiff v0.10.39 [14197337] GenericLinearAlgebra v0.3.19 [4d00f742] GeometryTypes v0.8.5 ⌃ [86223c79] Graphs v1.13.1 [d25df0c9] Inflate v0.1.5 [92d709cd] IrrationalConstants v0.2.6 [42fd0dbc] IterativeSolvers v0.9.4 [692b3bcd] JLLWrappers v1.7.1 [7a12625a] LinearMaps v3.11.4 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [337daf1e] NLSolvers v0.5.0 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [f27b6e38] Polynomials v4.1.0 [85a6dd25] PositiveFactorizations v0.2.4 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [be4d8f0f] Quadmath v0.5.13 [0d4725de] Readables v0.3.3 [3cdcf5f2] RecipesBase v1.3.4 [ae029012] Requires v1.3.1 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 ⌅ [47a9eef4] SparseDiffTools v1.31.0 [276daf66] SpecialFunctions v2.6.1 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [19fa3120] VertexSafeGraphs v0.2.0 [e134572f] FLINT_jll v301.400.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [1a1011a3] SharedArrays v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [3a97d323] MPFR_jll v4.2.2+0 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [8e850b90] libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. Testing Running tests... ┌ Warning: The call to compilecache failed to create a usable precompiled cache file for NLSolvers [337daf1e-9722-11e9-073e-8b9effe078ba] │ exception = Required dependency Base.PkgId(Base.UUID("10745b16-79ce-11e8-11f9-7d13ad32a3b2"), "Statistics") failed to load from a cache file. └ @ Base loading.jl:2891 Test Summary: | Pass Total Time nlequations interface | 53 53 1m38.9s Test Summary: | Total Time lsqfit | 0 0.0s Test Summary: | Pass Total Time Krylov | 2 2 5.9s Test Summary: | Total Time scalar nlsolves | 0 0.3s Test Summary: | Pass Broken Total Time optimization interface | 35 4 39 1m01.7s Test Summary: | Pass Total Time univariate nonalloc | 1 1 0.3s Test Summary: | Pass Total Time brentmin | 9 9 0.9s Test Summary: | Pass Total Time staticopt | 5 5 0.8s Test Summary: | Pass Total Time newton | 4 4 4.5s Test Summary: | Pass Total Time Newton linsolve | 4 4 3.7s Test Summary: | Pass Total Time no alloc static | 6 6 3.8s Test Summary: | Pass Total Time bound newton | 6 6 18.8s Test Summary: | Pass Total Time scalar no-alloc | 5 5 1.5s Test Summary: | Pass Total Time Test double floats | 4 4 8.5s Test Summary: | Pass Total Time scalar return types | 42 42 15.6s Test Summary: | Pass Total Time GeometryTypes | 8 8 4.0s Gradient Descent || 816 || [-7.052014328046141e-8, -1.457617169187131e-7] Inverse BFGS || 6 || [-1.0589751298084593e-11, -2.5071056342085285e-12] Direct BFGS || 6 || [-1.0589751298084593e-11, -2.5068835896036035e-12] Inverse Damped BFGS || 6 || [-1.0589751298084593e-11, -2.5068835896036035e-12] SR1 || 3 || [9.414691248821327e-14, -1.0813572259849025e-13] SR1 || 3 || [3.3306690738754696e-15, -4.440892098500626e-15] Inverse DFP || 7 || [-1.7750356740009465e-10, 8.286904495946601e-11] Newton's method with default linsolve || 1 || [0.0, 0.0] Barzilai-Borwein || 13 || [9.233433573285765e-9, 7.049518746526928e-9] Inverse LBFGS || 6 || [-1.2597478615816726e-11, -3.1672442446506466e-12] Test Summary: | Total Time quadratics | 0 16.8s Test Summary: | Total Time batched | 0 0.0s 2.077471 seconds (1.40 M allocations: 73.706 MiB, 3.53% gc time, 99.96% compilation time) 1.337071 seconds (346.49 k allocations: 18.577 MiB, 99.99% compilation time) 1.667170 seconds (1.15 M allocations: 59.475 MiB, 99.93% compilation time) 0.805213 seconds (147.44 k allocations: 7.760 MiB, 99.97% compilation time: 100% of which was recompilation) 0.757740 seconds (874.72 k allocations: 46.777 MiB, 99.97% compilation time) 0.713503 seconds (99.98 k allocations: 5.330 MiB, 99.96% compilation time: 100% of which was recompilation) 0.000355 seconds (1.83 k allocations: 92.453 KiB) Test Summary: | Total Time MArray | 0 7.9s N = 10 Gradient Descent with backtracking (no interp) Gradient Descent with backtracking (no interp) Iterations without precon: 126 Iterations with precon: 23 Minimum without precon: 1.11006697287903 Minimum with precon: 1.1100669728763246 Conjugate Gradient Descent (Hager-Zhang update) with Approximate Wolfe Line Search (Hager & Zhang) Conjugate Gradient Descent (Hager-Zhang update) with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 22 Iterations with precon: 5 Minimum without precon: 1.110066972876202 Minimum with precon: 1.1103036993074713 Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Iterations without precon: 72 Iterations with precon: 5 Minimum without precon: 1.1100669728764216 Minimum with precon: 1.1103036993074713 Inverse LBFGS with backtracking (no interp) Inverse LBFGS with backtracking (no interp) Iterations without precon: 20 Iterations with precon: 10 Minimum without precon: 1.1100669728764958 Minimum with precon: 1.1100669728766142 Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 10 Iterations with precon: 10 Minimum without precon: 1.1100669728761954 Minimum with precon: 1.1100669728766142 N = 50 Gradient Descent with backtracking (no interp) Gradient Descent with backtracking (no interp) Iterations without precon: 3783 Iterations with precon: 20 Minimum without precon: 25.90605928525236 Minimum with precon: 25.906059285254457 Conjugate Gradient Descent (Hager-Zhang update) with Approximate Wolfe Line Search (Hager & Zhang) Conjugate Gradient Descent (Hager-Zhang update) with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 89 Iterations with precon: 7 Minimum without precon: 25.906059285150526 Minimum with precon: 25.906090856108282 Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Iterations without precon: 377 Iterations with precon: 7 Minimum without precon: 25.90605928514723 Minimum with precon: 25.906090856108282 Inverse LBFGS with backtracking (no interp) Inverse LBFGS with backtracking (no interp) Iterations without precon: 233 Iterations with precon: 7 Minimum without precon: 25.906059285146107 Minimum with precon: 25.906059285146192 Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 112 Iterations with precon: 7 Minimum without precon: 25.906059285147084 Minimum with precon: 25.906059285146192 N = 100 Gradient Descent with backtracking (no interp) Gradient Descent with backtracking (no interp) Iterations without precon: 10000 Iterations with precon: 19 Minimum without precon: 101.90589151060915 Minimum with precon: 101.90589129119795 Conjugate Gradient Descent (Hager-Zhang update) with Approximate Wolfe Line Search (Hager & Zhang) Conjugate Gradient Descent (Hager-Zhang update) with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 181 Iterations with precon: 7 Minimum without precon: 101.90589129083595 Minimum with precon: 101.90592549832427 Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Iterations without precon: 531 Iterations with precon: 7 Minimum without precon: 101.9058912908434 Minimum with precon: 101.90592549832427 Inverse LBFGS with backtracking (no interp) Inverse LBFGS with backtracking (no interp) Iterations without precon: 688 Iterations with precon: 7 Minimum without precon: 101.9058912908669 Minimum with precon: 101.90589129083419 Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 246 Iterations with precon: 7 Minimum without precon: 101.9058912908387 Minimum with precon: 101.90589129083419 N = 150 Gradient Descent with backtracking (no interp) Gradient Descent with backtracking (no interp) Iterations without precon: 10000 Iterations with precon: 18 Minimum without precon: 227.90692250410328 Minimum with precon: 227.90585929374322 Conjugate Gradient Descent (Hager-Zhang update) with Approximate Wolfe Line Search (Hager & Zhang) Conjugate Gradient Descent (Hager-Zhang update) with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 273 Iterations with precon: 7 Minimum without precon: 227.90585929269704 Minimum with precon: 227.90589401556352 Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Iterations without precon: 878 Iterations with precon: 7 Minimum without precon: 227.90585929622551 Minimum with precon: 227.90589401556352 Inverse LBFGS with backtracking (no interp) Inverse LBFGS with backtracking (no interp) Iterations without precon: 771 Iterations with precon: 7 Minimum without precon: 227.90585929340372 Minimum with precon: 227.90585929269625 Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 316 Iterations with precon: 7 Minimum without precon: 227.9058592927175 Minimum with precon: 227.90585929269625 N = 250 Gradient Descent with backtracking (no interp) Gradient Descent with backtracking (no interp) Iterations without precon: 10000 Iterations with precon: 17 Minimum without precon: 629.9230696343877 Minimum with precon: 629.9058427369234 Conjugate Gradient Descent (Hager-Zhang update) with Approximate Wolfe Line Search (Hager & Zhang) Conjugate Gradient Descent (Hager-Zhang update) with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 449 Iterations with precon: 7 Minimum without precon: 629.9058427339922 Minimum with precon: 629.9058777252047 Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Iterations without precon: 10000 Iterations with precon: 7 Minimum without precon: 629.9390551371125 Minimum with precon: 629.9058777252047 Inverse LBFGS with backtracking (no interp) Inverse LBFGS with backtracking (no interp) Iterations without precon: 1742 Iterations with precon: 7 Minimum without precon: 629.9058427370272 Minimum with precon: 629.9058427339651 Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 524 Iterations with precon: 7 Minimum without precon: 629.9058427339661 Minimum with precon: 629.9058427339652 Test Summary: | Pass Total Time optimization preconditioning | 24 24 22.2s WARNING: Method definition f(Any) in module Main at /home/pkgeval/.julia/packages/NLSolvers/gB9BS/test/lsqfit/interface.jl:12 overwritten at /home/pkgeval/.julia/packages/NLSolvers/gB9BS/test/lsqfit/interface.jl:133. WARNING: Method definition g!(Any, Any) in module Main at /home/pkgeval/.julia/packages/NLSolvers/gB9BS/test/lsqfit/interface.jl:17 overwritten at /home/pkgeval/.julia/packages/NLSolvers/gB9BS/test/lsqfit/interface.jl:138. WARNING: Method definition h!(Any, Any) in module Main at /home/pkgeval/.julia/packages/NLSolvers/gB9BS/test/lsqfit/interface.jl:21 overwritten at /home/pkgeval/.julia/packages/NLSolvers/gB9BS/test/lsqfit/interface.jl:142. WARNING: Method definition fg(Any, Any) in module Main at /home/pkgeval/.julia/packages/NLSolvers/gB9BS/test/lsqfit/interface.jl:25 overwritten at /home/pkgeval/.julia/packages/NLSolvers/gB9BS/test/lsqfit/interface.jl:146. WARNING: Method definition fgh!(Any, Any, Any) in module Main at /home/pkgeval/.julia/packages/NLSolvers/gB9BS/test/lsqfit/interface.jl:30 overwritten at /home/pkgeval/.julia/packages/NLSolvers/gB9BS/test/lsqfit/interface.jl:151. Test Summary: | Pass Total Time truncated SPR solver | 4004 4004 1.2s Testing NLSolvers tests passed Testing completed after 549.07s PkgEval succeeded after 585.27s