Package evaluation to test RationalFunctionFields on Julia 1.14.0-DEV.2360 (7c0e770819*) started at 2026-06-13T10:35:03.938 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 14.77s ################################################################################ # Installation # Installing RationalFunctionFields... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [73480bc8] + RationalFunctionFields v0.3.1 Updating `~/.julia/environments/v1.14/Manifest.toml` ⌅ [c3fe647b] + AbstractAlgebra v0.48.6 [a9b6321e] + Atomix v1.1.3 [861a8166] + Combinatorics v1.1.0 [e2ba6199] + ExprTools v0.1.10 [0b43b601] + Groebner v0.10.3 [18e54dd8] + IntegerMathUtils v0.1.3 [692b3bcd] + JLLWrappers v1.8.0 [1914dd2f] + MacroTools v0.5.16 ⌅ [2edaba10] + Nemo v0.54.2 [3e851597] + ParamPunPam v0.5.7 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [27ebfcd6] + Primes v0.5.7 [92933f4c] + ProgressMeter v1.11.0 [fb686558] + RandomExtensions v0.4.4 [73480bc8] + RationalFunctionFields v0.3.1 [a759f4b9] + TimerOutputs v0.5.29 [013be700] + UnsafeAtomics v0.3.1 ⌅ [e134572f] + FLINT_jll v301.400.1+0 [656ef2d0] + OpenBLAS32_jll v0.3.33+1 [56f22d72] + Artifacts v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.2+0 [781609d7] + GMP_jll v6.3.0+2 [3a97d323] + MPFR_jll v4.2.2+0 [4536629a] + OpenBLAS_jll v0.3.33+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.44s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... 2.4 s ✓ TestSetExtensions 14.2 s ✓ RationalFunctionFields 2 dependencies successfully precompiled in 17 seconds. 38 already precompiled. Precompilation completed after 43.9s ################################################################################ # Testing # Testing RationalFunctionFields Status `/tmp/jl_IN4oBW/Project.toml` ⌅ [c3fe647b] AbstractAlgebra v0.48.6 [861a8166] Combinatorics v1.1.0 [0b43b601] Groebner v0.10.3 ⌅ [2edaba10] Nemo v0.54.2 [3e851597] ParamPunPam v0.5.7 [73480bc8] RationalFunctionFields v0.3.1 ⌅ [98d24dd4] TestSetExtensions v3.0.0 [a759f4b9] TimerOutputs v0.5.29 [37e2e46d] LinearAlgebra v1.14.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_IN4oBW/Manifest.toml` ⌅ [c3fe647b] AbstractAlgebra v0.48.6 [a9b6321e] Atomix v1.1.3 [861a8166] Combinatorics v1.1.0 [ab62b9b5] DeepDiffs v1.2.0 [e2ba6199] ExprTools v0.1.10 [0b43b601] Groebner v0.10.3 [18e54dd8] IntegerMathUtils v0.1.3 [692b3bcd] JLLWrappers v1.8.0 [1914dd2f] MacroTools v0.5.16 ⌅ [2edaba10] Nemo v0.54.2 [3e851597] ParamPunPam v0.5.7 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [27ebfcd6] Primes v0.5.7 [92933f4c] ProgressMeter v1.11.0 [fb686558] RandomExtensions v0.4.4 [73480bc8] RationalFunctionFields v0.3.1 ⌅ [98d24dd4] TestSetExtensions v3.0.0 [a759f4b9] TimerOutputs v0.5.29 [013be700] UnsafeAtomics v0.3.1 ⌅ [e134572f] FLINT_jll v301.400.1+0 [656ef2d0] OpenBLAS32_jll v0.3.33+1 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [fa267f1f] TOML v1.0.3 [8dfed614] Test v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.2+0 [781609d7] GMP_jll v6.3.0+2 [3a97d323] MPFR_jll v4.2.2+0 [4536629a] OpenBLAS_jll v0.3.33+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [8e850b90] libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... [ Info: Testing started ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 190__Tag_3 = (x^3 + y^3 + z^3)//(x + y + z) │ 190__Tag_1 = (x^2 + y^2 + z^2)//(x + y + z) └ 190__Tag_2 = x + y + z ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 42__Tag_3 = x*y*z │ 42__Tag_1 = x + y + z └ 42__Tag_2 = x*y + x*z + y*z ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 88__Tag_3 = a + b + c │ 88__Tag_1 = a └ 88__Tag_2 = b ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 30__Tag_3 = a + b + c │ 30__Tag_1 = a └ 30__Tag_2 = b ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 174__Tag_3 = 5*a │ 174__Tag_1 = 2*c └ 174__Tag_2 = 3*b ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 174__Tag_1 = a + b + c └ 174__Tag_2 = a^2 + b^2 + c^2 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 208__Tag_3 = a^4 + b^4 │ 208__Tag_1 = a^2 + b^2 └ 208__Tag_2 = a^3 + b^3 ┌ Info: Names for generators were not provided, so they have been generated as follows: └ 119__Tag_1 = T1^2 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 47__Tag_3 = _t │ 47__Tag_1 = T1 └ 47__Tag_2 = t ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 252__Tag_3 = x │ 252__Tag_1 = x - 1 └ 252__Tag_2 = 1//(x^5 - 1) ┌ Info: Names for generators were not provided, so they have been generated as follows: └ 83__Tag_1 = x^2 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 118__Tag_3 = x^4 + y^4 │ 118__Tag_1 = x^2 + y^2 └ 118__Tag_2 = x^3 + y^3 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 239__Tag_1 = x1 │ 239__Tag_2 = a │ 239__Tag_5 = x2//(a + b) │ 239__Tag_4 = c//x2 └ 239__Tag_3 = a*c + c^2 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 43__Tag_11 = (-alpha^2*beta_W^2*gamma*zeta - 2*alpha*beta_I*beta_W*gamma*zeta^2 - beta_I^2*gamma*zeta^3)//(alpha*beta_I) │ 43__Tag_12 = (-2*alpha*beta_W*gamma - 2*alpha*beta_W*zeta - 3*beta_I*gamma*zeta - 2*beta_I*zeta^2)//alpha │ 43__Tag_4 = (alpha*beta_W + beta_I*zeta)//beta_I │ 43__Tag_13 = (-alpha^2*beta_W^2*gamma - alpha^2*beta_W^2*zeta - 4*alpha*beta_I*beta_W*gamma*zeta - 2*alpha*beta_I*beta_W*zeta^2 - 3*beta_I^2*gamma*zeta^2 - beta_I^2*zeta^3)//(alpha*beta_I) │ 43__Tag_1 = 1 │ 43__Tag_10 = (-alpha^2*beta_W^2 - 2*alpha*beta_I*beta_W*zeta - beta_I^2*zeta^2)//(alpha*beta_I) │ 43__Tag_6 = (-alpha*beta_W - beta_I*zeta)//beta_I │ 43__Tag_7 = (-2*alpha*beta_W - 2*beta_I*zeta)//alpha │ 43__Tag_2 = -1 │ 43__Tag_9 = (-alpha*beta_W*gamma - alpha*beta_W*zeta - beta_I*zeta^2)//beta_I │ 43__Tag_3 = -beta_I//alpha │ 43__Tag_8 = (alpha*beta_W*gamma + alpha*beta_W*zeta + beta_I*zeta^2)//beta_I └ 43__Tag_5 = (-beta_I*gamma - beta_I*zeta)//alpha [ Info: Search for polynomial generators concluded in 19.953727691 [ Info: Search for polynomial generators concluded in 1.131362642 [ Info: Search for polynomial generators concluded in 0.00178955 [ Info: Search for polynomial generators concluded in 0.00440524 [ Info: Search for polynomial generators concluded in 0.00077295 [ Info: Search for polynomial generators concluded in 0.064428456 [ Info: Search for polynomial generators concluded in 0.871212938 [ Info: Search for polynomial generators concluded in 0.00308953 [ Info: Search for polynomial generators concluded in 4.054759748 [ Info: Search for polynomial generators concluded in 1.840301451 [ Info: Parameter names: ["x", "y1"] [ Info: Indeterm. names: ["t1", "y1", "y2"] [ Info: Parameter names: ["a", "b", "c", "x(t)"] [ Info: Indeterm. names: ["y1", "y2", "y3", "y4"] [ Info: Parameter names: ["a", "b", "c", "x(t)"] [ Info: Indeterm. names: ["t1", "y1", "y2", "y3", "y4"] [ Info: Simplifying generating set. Simplification level: standard ⌜ # Computing specializations.. Time: 0:00:15 ✓ # Computing specializations.. Time: 0:00:17 [ Info: Search for polynomial generators concluded in 0.009662079 [ Info: Selecting generators in 0.0107003 [ Info: Inclusion checked with probability 0.99 in 0.00460842 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.007821139 [ Info: Inclusion checked with probability 0.99 in 0.00335614 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 1.207846188 [ Info: Selecting generators in 0.209565198 [ Info: Inclusion checked with probability 0.99 in 0.004988339 seconds AbstractAlgebra.Generic.FracFieldElem{QQMPolyRingElem}[k01, k21 + k31, k12 + k13, k21*k31, k12*k31 + k13*k21] [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.032446198 [ Info: Selecting generators in 0.022765539 [ Info: Inclusion checked with probability 0.99 in 0.00519429 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.00669149 [ Info: Selecting generators in 0.00065865 [ Info: Inclusion checked with probability 0.99 in 0.003280589 seconds [ Info: Simplifying generating set. Simplification level: strong [ Info: Search for polynomial generators concluded in 0.00649371 [ Info: Computing 3 Groebner bases for degrees (3, 3) for block orderings ⌜ # Computing specializations.. Time: 0:00:41 ✓ # Computing specializations.. Time: 0:00:41 [ Info: Computed Groebner bases in 54.390321508 seconds [ Info: Selecting generators in 0.00071655 [ Info: Inclusion checked with probability 0.99 in 0.00357343 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.323732401 [ Info: Selecting generators in 0.00944902 [ Info: Inclusion checked with probability 0.99 in 0.015131869 seconds [ Info: Simplifying generating set. Simplification level: strong [ Info: Search for polynomial generators concluded in 0.266309964 [ Info: Computing 5 Groebner bases for degrees (3, 3) for block orderings [ Info: Computed Groebner bases in 2.201835509 seconds [ Info: Selecting generators in 0.00762782 [ Info: Inclusion checked with probability 0.99 in 0.012854709 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.036446217 [ Info: Selecting generators in 0.018813749 [ Info: Inclusion checked with probability 0.99 in 0.00579906 seconds [ Info: Simplifying generating set. Simplification level: strong [ Info: Search for polynomial generators concluded in 0.036920598 [ Info: Computing 6 Groebner bases for degrees (3, 3) for block orderings [ Info: Computed Groebner bases in 1.034885548 seconds [ Info: Selecting generators in 0.034413338 [ Info: Inclusion checked with probability 0.99 in 0.00587966 seconds Test Summary: | Pass Total Time All the tests | 166 166 11m09.3s RationalFunctionField | 2 2 2m02.7s Transcendence basis computations and algebraicity checks | 13 13 7.7s RationalFunctionField: constructive field membership (basic) | 6 6 1m18.1s RationalFunctionField: constructive field membership | 91 91 14.0s RationalFunctionField: simplification | 1 1 2m28.8s RationalFunctionField: membership | 24 24 2m02.8s Linear relations over the rationals | 10 10 31.7s OMS raw ideal generators | 4 4 4.6s Rational function comparison | 7 7 1.4s RationalFunctionField: simplification | 8 8 2m13.5s 669.827043 seconds (307.90 M allocations: 20.879 GiB, 2.38% gc time, 70.25% compilation time: <1% of which was recompilation) Testing RationalFunctionFields tests passed Testing completed after 692.34s PkgEval succeeded after 772.4s