Package evaluation of NLSolvers on Julia 1.11.4 (a71dd056e0*) started at 2025-04-08T08:43:13.856 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.91s ################################################################################ # Installation # Installing NLSolvers... Resolving package versions... Updating `~/.julia/environments/v1.11/Project.toml` [337daf1e] + NLSolvers v0.5.0 Updating `~/.julia/environments/v1.11/Manifest.toml` [42fd0dbc] + IterativeSolvers v0.9.4 [337daf1e] + NLSolvers v0.5.0 [85a6dd25] + PositiveFactorizations v0.2.4 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [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.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.11.0 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [4536629a] + OpenBLAS_jll v0.3.27+1 [bea87d4a] + SuiteSparse_jll v7.7.0+0 [8e850b90] + libblastrampoline_jll v5.11.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 1.74s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 65.38s ################################################################################ # Testing # Testing NLSolvers Status `/tmp/jl_2iyUiG/Project.toml` [7e558dbc] ArbNumerics v1.5.4 [497a8b3b] DoubleFloats v1.4.3 ⌅ [f6369f11] ForwardDiff v0.10.38 [14197337] GenericLinearAlgebra v0.3.15 [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.13 [10745b16] Statistics v1.11.1 [37e2e46d] LinearAlgebra v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_2iyUiG/Manifest.toml` ⌅ [79e6a3ab] Adapt v3.7.2 [7e558dbc] ArbNumerics v1.5.4 [ec485272] ArnoldiMethod v0.4.0 ⌃ [4fba245c] ArrayInterface v7.7.1 ⌅ [3da002f7] ColorTypes v0.11.5 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [187b0558] ConstructionBase v1.5.8 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.4 [497a8b3b] DoubleFloats v1.4.3 [6a86dc24] FiniteDiff v2.27.0 [53c48c17] FixedPointNumbers v0.8.5 ⌅ [f6369f11] ForwardDiff v0.10.38 [14197337] GenericLinearAlgebra v0.3.15 [4d00f742] GeometryTypes v0.8.5 [86223c79] Graphs v1.12.1 [d25df0c9] Inflate v0.1.5 [92d709cd] IrrationalConstants v0.2.4 [42fd0dbc] IterativeSolvers v0.9.4 [692b3bcd] JLLWrappers v1.7.0 [7a12625a] LinearMaps v3.11.4 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.15 [337daf1e] NLSolvers v0.5.0 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.0 [f27b6e38] Polynomials v4.0.19 [85a6dd25] PositiveFactorizations v0.2.4 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [be4d8f0f] Quadmath v0.5.11 [0d4725de] Readables v0.3.3 [3cdcf5f2] RecipesBase v1.3.4 [ae029012] Requires v1.3.1 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.4 ⌅ [47a9eef4] SparseDiffTools v1.31.0 [276daf66] SpecialFunctions v2.5.0 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [19fa3120] VertexSafeGraphs v0.2.0 [d9960996] Arb_jll v200.2300.0+0 ⌅ [e134572f] FLINT_jll v200.900.9+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [1a1011a3] SharedArrays v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [781609d7] GMP_jll v6.3.0+0 [deac9b47] LibCURL_jll v8.6.0+0 [e37daf67] LibGit2_jll v1.7.2+0 [29816b5a] LibSSH2_jll v1.11.0+1 [3a97d323] MPFR_jll v4.2.1+0 [c8ffd9c3] MbedTLS_jll v2.28.6+0 [14a3606d] MozillaCACerts_jll v2023.12.12 [4536629a] OpenBLAS_jll v0.3.27+1 [05823500] OpenLibm_jll v0.8.5+0 [bea87d4a] SuiteSparse_jll v7.7.0+0 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.59.0+0 [3f19e933] p7zip_jll v17.4.0+2 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... Precompiling IterativeSolvers... 3661.2 ms ✓ IterativeSolvers 1 dependency successfully precompiled in 4 seconds. 10 already precompiled. Precompiling DoubleFloats... 3316.3 ms ✓ Setfield 1738.7 ms ✓ Quadmath 43349.1 ms ✓ Polynomials 4937.2 ms ✓ DoubleFloats 4 dependencies successfully precompiled in 54 seconds. 29 already precompiled. Test Summary: | Pass Total Time nlequations interface | 53 53 2m38.7s Test Summary: | Total Time lsqfit | 0 0.0s Test Summary: | Pass Total Time Krylov | 2 2 10.9s Test Summary: | Total Time scalar nlsolves | 0 0.2s Test Summary: | Pass Broken Total Time optimization interface | 35 4 39 2m17.8s Test Summary: | Pass Total Time univariate nonalloc | 1 1 0.0s Test Summary: | Pass Total Time brentmin | 9 9 0.9s Test Summary: | Pass Total Time staticopt | 5 5 0.0s Test Summary: | Pass Total Time newton | 4 4 8.8s Test Summary: | Pass Total Time Newton linsolve | 4 4 6.0s Test Summary: | Pass Total Time no alloc static | 6 6 0.0s Test Summary: | Pass Total Time bound newton | 6 6 38.1s Test Summary: | Pass Total Time scalar no-alloc | 5 5 0.0s Test Summary: | Pass Total Time Test double floats | 4 4 21.5s Test Summary: | Pass Total Time scalar return types | 42 42 19.7s Precompiling GeometryTypes... 3969.0 ms ✓ GeometryTypes 1 dependency successfully precompiled in 4 seconds. 12 already precompiled. Test Summary: | Pass Total Time GeometryTypes | 8 8 5.3s 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 36.4s Test Summary: | Total Time batched | 0 0.0s 1.728622 seconds (1.40 M allocations: 72.054 MiB, 100.00% compilation time) 3.021958 seconds (357.70 k allocations: 18.105 MiB, 99.99% compilation time) 1.795653 seconds (1.14 M allocations: 57.852 MiB, 1.92% gc time, 99.99% compilation time) 0.000080 seconds (141 allocations: 5.938 KiB) 0.845765 seconds (661.86 k allocations: 33.320 MiB, 99.98% compilation time) 1.216246 seconds (109.06 k allocations: 5.265 MiB, 99.99% compilation time: 100% of which was recompilation) 0.000268 seconds (1.81 k allocations: 91.250 KiB) Test Summary: | Total Time MArray | 0 9.2s 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.906059285252365 Minimum with precon: 25.906059285254464 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: 8 Minimum without precon: 25.906059285150523 Minimum with precon: 25.906090856108293 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.906090856108296 Inverse LBFGS with backtracking (no interp) Inverse LBFGS with backtracking (no interp) Iterations without precon: 233 Iterations with precon: 7 Minimum without precon: 25.9060592851461 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.90605928514707 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.90589151060918 Minimum with precon: 101.9058912911979 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.90592549832425 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.90592549832425 Inverse LBFGS with backtracking (no interp) Inverse LBFGS with backtracking (no interp) Iterations without precon: 662 Iterations with precon: 7 Minimum without precon: 101.9058912908355 Minimum with precon: 101.90589129083423 Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 247 Iterations with precon: 7 Minimum without precon: 101.90589129083445 Minimum with precon: 101.90589129083423 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.9058592937432 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.90585929269702 Minimum with precon: 227.90589401556346 Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Conjugate Gradient Descent (Hager-Zhang update) with backtracking (no interp) Iterations without precon: 991 Iterations with precon: 7 Minimum without precon: 227.90585929290575 Minimum with precon: 227.90589401556346 Inverse LBFGS with backtracking (no interp) Inverse LBFGS with backtracking (no interp) Iterations without precon: 1065 Iterations with precon: 7 Minimum without precon: 227.90585929307932 Minimum with precon: 227.90585929269622 Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 360 Iterations with precon: 7 Minimum without precon: 227.9058592927021 Minimum with precon: 227.90585929269622 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.923069634388 Minimum with precon: 629.9058427369235 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: 438 Iterations with precon: 8 Minimum without precon: 629.9058427339953 Minimum with precon: 629.9058777252044 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.9390551371123 Minimum with precon: 629.9058777252046 Inverse LBFGS with backtracking (no interp) Inverse LBFGS with backtracking (no interp) Iterations without precon: 1662 Iterations with precon: 7 Minimum without precon: 629.9058427346115 Minimum with precon: 629.9058427339646 Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Inverse LBFGS with Approximate Wolfe Line Search (Hager & Zhang) Iterations without precon: 481 Iterations with precon: 7 Minimum without precon: 629.9058427340113 Minimum with precon: 629.9058427339646 Test Summary: | Pass Total Time optimization preconditioning | 24 24 38.5s 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 0.0s Testing NLSolvers tests passed Testing completed after 802.77s PkgEval succeeded after 888.75s