==> Building on luxio ==> Checking for remote environment... ==> Syncing package to remote host... sending incremental file list ./ .SRCINFO 1,125 100% 0.00kB/s 0:00:00 1,125 100% 0.00kB/s 0:00:00 (xfr#1, to-chk=7/9) .nvchecker.toml 59 100% 57.62kB/s 0:00:00 59 100% 57.62kB/s 0:00:00 (xfr#2, to-chk=6/9) LICENSE 646 100% 630.86kB/s 0:00:00 646 100% 630.86kB/s 0:00:00 (xfr#3, to-chk=5/9) PKGBUILD 1,400 65% 1.34MB/s 0:00:00 2,140 100% 2.04MB/s 0:00:00 (xfr#4, to-chk=4/9) REUSE.toml 375 100% 366.21kB/s 0:00:00 375 100% 366.21kB/s 0:00:00 (xfr#5, to-chk=3/9) haskell-arithmoi-0.13.2.0-26.log 803 100% 784.18kB/s 0:00:00 803 100% 784.18kB/s 0:00:00 (xfr#6, to-chk=2/9) LICENSES/ sent 1,460 bytes received 198 bytes 1,105.33 bytes/sec total size is 4,547 speedup is 2.74 ==> Patching arch to riscv64... ==> Running pkgctl build --arch riscv64 on remote host... ==> WARNING: invalid architecture: riscv64 ==> Updating pacman database cache [?25l:: Synchronizing package databases... core downloading... extra downloading... multilib downloading... [?25h==> Building haskell-arithmoi  -> repo: extra  -> arch: riscv64  -> worker: felix-0 ==> Building haskell-arithmoi for [extra] (riscv64) ]3008;start=11a4f54a5f5b4317885ff3b629906dd4;user=root;hostname=luxio.felixc.at;machineid=034671f853064b64986c14a44f8f2a41;bootid=772d3bc0bb2c4f308db63f2fa8d2fcbc;pid=2258835;pidfdid=10645698;comm=systemd-nspawn;container=arch-nspawn-2258835;type=container\]11;?\]2;🔵 Container arch-nspawn-2258835 on luxio.felixc.at\:: Synchronizing package databases... core downloading... extra downloading... :: Starting full system upgrade... there is nothing to do [!p]104[?7h]3008;end=11a4f54a5f5b4317885ff3b629906dd4\==> Building in chroot for [extra] (riscv64)... ==> Synchronizing chroot copy [/var/lib/archbuild/extra-riscv64/root] -> [felix-0]...done ==> Making package: haskell-arithmoi 0.13.2.0-26 (Thu Feb 5 13:51:47 2026) ==> Retrieving sources...  -> Found arithmoi-0.13.2.0.tar.gz ==> Validating source files with sha512sums... arithmoi-0.13.2.0.tar.gz ... Passed ]3008;start=721d25afd1ce471eb8ce614f74697a2b;user=root;hostname=luxio.felixc.at;machineid=034671f853064b64986c14a44f8f2a41;bootid=772d3bc0bb2c4f308db63f2fa8d2fcbc;pid=2260015;pidfdid=10646878;comm=systemd-nspawn;container=arch-nspawn-2260015;type=container\]11;?\]2;🔵 Container arch-nspawn-2260015 on luxio.felixc.at\==> Making package: haskell-arithmoi 0.13.2.0-26 (Thu Feb 5 12:52:01 2026) ==> Checking runtime dependencies... ==> Installing missing dependencies... resolving dependencies... looking for conflicting packages... Package (46) New Version Net Change Download Size extra/haskell-adjunctions 4.4.3-98 1.07 MiB extra/haskell-ansi-terminal 1.1-2.1 0.25 MiB extra/haskell-ansi-terminal-types 1.1-2.1 0.49 MiB extra/haskell-assoc 1.1.1-40 0.04 MiB extra/haskell-base-orphans 0.9.3-86.1 0.39 MiB extra/haskell-bifunctors 5.6.2-59 2.83 MiB extra/haskell-boring 0.2.2-2 0.08 MiB extra/haskell-colour 2.3.6-408.1 0.91 MiB extra/haskell-comonad 5.0.9-122 0.56 MiB extra/haskell-contravariant 1.5.5-6 0.36 MiB extra/haskell-distributive 0.6.2.1-415.2 0.23 MiB extra/haskell-foldable1-classes-compat 0.1.2-58.1 0.00 MiB extra/haskell-free 5.2-120 4.01 MiB extra/haskell-hashable 1.4.7.0-21.2 0.69 MiB extra/haskell-indexed-traversable 0.1.4-177 0.75 MiB extra/haskell-numtype-dk 0.5.0.3-5 0.11 MiB 0.03 MiB extra/haskell-optparse-applicative 0.18.1.0-260.2 1.46 MiB extra/haskell-os-string 2.0.8-90.1 0.91 MiB extra/haskell-prettyprinter 1.7.1-362.1 1.62 MiB extra/haskell-prettyprinter-ansi-terminal 1.1.3-471.2 0.28 MiB extra/haskell-primitive 0.9.1.0-114.1 1.68 MiB extra/haskell-profunctors 5.6.3-79 1.97 MiB extra/haskell-semigroupoids 6.0.1-98 2.23 MiB extra/haskell-splitmix 0.1.3-8.1 0.17 MiB extra/haskell-statevar 1.2.2-5 0.08 MiB extra/haskell-tagged 0.8.9-3 0.32 MiB extra/haskell-tasty 1.5.2-70.2 1.58 MiB extra/haskell-th-abstraction 0.5.0.0-2 0.89 MiB extra/haskell-transformers-base 0.4.6-270.1 0.11 MiB extra/haskell-transformers-compat 0.7.2-4 0.60 MiB extra/haskell-unordered-containers 0.2.20.1-19.2 1.84 MiB extra/haskell-vector-stream 0.1.0.1-4 0.57 MiB extra/haskell-void 0.7.3-375.2 0.01 MiB extra/numactl 2.0.19-1 0.20 MiB extra/ghc-libs 9.6.7.20250817-1 138.07 MiB extra/haskell-bitvec 1.1.5.0-38 2.72 MiB extra/haskell-chimera 0.4.1.0-140 0.61 MiB 0.12 MiB extra/haskell-constraints 0.14.2-81.1 1.36 MiB extra/haskell-exact-pi 0.5.0.2-163 0.15 MiB 0.04 MiB extra/haskell-infinite-list 0.1.3-2 0.33 MiB 0.07 MiB extra/haskell-integer-logarithms 1.0.4-144.1 0.16 MiB extra/haskell-integer-roots 1.0.3.0-68 0.50 MiB 0.11 MiB extra/haskell-mod 0.2.1.0-25 0.49 MiB 0.09 MiB extra/haskell-random 1.2.1.3-181.1 1.82 MiB extra/haskell-semirings 0.7-66 1.56 MiB extra/haskell-vector 0.13.2.0-333.3 11.38 MiB Total Download Size: 0.45 MiB Total Installed Size: 188.44 MiB :: Proceed with installation? [Y/n] :: Retrieving packages... haskell-chimera-0.4.1.0-140-riscv64 downloading... haskell-integer-roots-1.0.3.0-68-riscv64 downloading... haskell-mod-0.2.1.0-25-riscv64 downloading... haskell-infinite-list-0.1.3-2-riscv64 downloading... haskell-exact-pi-0.5.0.2-163-riscv64 downloading... haskell-numtype-dk-0.5.0.3-5-riscv64 downloading... checking keyring... checking package integrity... loading package files... checking for file conflicts... :: Processing package changes... installing numactl... installing ghc-libs... installing haskell-primitive... installing haskell-splitmix... installing haskell-random... installing haskell-colour... installing haskell-ansi-terminal-types... installing haskell-ansi-terminal... installing haskell-prettyprinter... installing haskell-prettyprinter-ansi-terminal... installing haskell-transformers-compat... installing haskell-optparse-applicative... installing haskell-tagged... installing haskell-tasty... installing haskell-vector-stream... installing haskell-vector... installing haskell-bitvec... installing haskell-base-orphans... installing haskell-distributive... installing haskell-foldable1-classes-compat... installing haskell-indexed-traversable... installing haskell-comonad... installing haskell-statevar... installing haskell-contravariant... installing haskell-assoc... installing haskell-th-abstraction... installing haskell-bifunctors... installing haskell-profunctors... installing haskell-os-string... installing haskell-hashable... installing haskell-unordered-containers... installing haskell-semigroupoids... installing haskell-transformers-base... installing haskell-free... installing haskell-void... installing haskell-adjunctions... installing haskell-infinite-list... installing haskell-chimera... installing haskell-boring... installing haskell-constraints... installing haskell-numtype-dk... installing haskell-exact-pi... installing haskell-integer-logarithms... installing haskell-integer-roots... installing haskell-semirings... installing haskell-mod... :: Running post-transaction hooks... (1/2) Arming ConditionNeedsUpdate... (2/2) Registering Haskell modules... ==> Checking buildtime dependencies... ==> Installing missing dependencies... resolving dependencies... looking for conflicting packages... Package (33) New Version Net Change Download Size extra/haskell-aeson 2.2.0.0-2 9.25 MiB extra/haskell-call-stack 0.4.0-384.1 0.05 MiB extra/haskell-data-fix 0.3.4-144.2 0.19 MiB extra/haskell-dlist 1.0-387 0.24 MiB extra/haskell-erf 2.0.0.0-27 0.06 MiB extra/haskell-generically 0.1.1-89 0.01 MiB extra/haskell-indexed-traversable-instances 0.1.2-126 0.08 MiB extra/haskell-integer-conversion 0.1.1-55 0.04 MiB extra/haskell-logict 0.8.2.0-36.1 0.48 MiB extra/haskell-network-uri 2.6.4.2-134 0.82 MiB extra/haskell-onetuple 0.4.2-184.1 0.02 MiB extra/haskell-primitive-addr 0.1.0.3-48 0.05 MiB 0.01 MiB extra/haskell-quickcheck-classes-base 0.6.2.0-570.1 1.25 MiB 0.21 MiB extra/haskell-scientific 0.3.8.0-152.2 0.55 MiB extra/haskell-semialign 1.3.1-54 0.74 MiB extra/haskell-split 0.2.5-148 0.16 MiB extra/haskell-strict 0.5.1-21.3 0.98 MiB extra/haskell-text-iso8601 0.1.1-55 0.55 MiB extra/haskell-text-short 0.1.6-182.3 0.33 MiB extra/haskell-th-compat 0.1.6-84 0.09 MiB extra/haskell-these 1.2.1-230.3 0.59 MiB extra/haskell-time-compat 1.9.8-30.1 0.49 MiB extra/haskell-uuid-types 1.0.6-227.4 0.31 MiB extra/haskell-witherable 0.4.2-231 0.88 MiB extra/ghc 9.6.7.20250817-1 293.11 MiB extra/haskell-quickcheck 2.15.0.1-95.1 3.53 MiB extra/haskell-quickcheck-classes 0.6.5.0-337 0.45 MiB 0.09 MiB extra/haskell-smallcheck 1.2.1.1-243.1 1.14 MiB extra/haskell-tasty-hunit 0.10.2-129.3 0.13 MiB extra/haskell-tasty-quickcheck 0.11.1-8.4 0.18 MiB extra/haskell-tasty-rerun 1.1.20-39 0.22 MiB 0.05 MiB extra/haskell-tasty-smallcheck 0.8.2-847.3 0.08 MiB 0.02 MiB extra/uusi 0.4.3.0-212.1 0.37 MiB Total Download Size: 0.39 MiB Total Installed Size: 317.41 MiB :: Proceed with installation? [Y/n] :: Retrieving packages... haskell-quickcheck-classes-base-0.6.2.0-570.1-riscv64 downloading... haskell-quickcheck-classes-0.6.5.0-337-riscv64 downloading... haskell-tasty-rerun-1.1.20-39-riscv64 downloading... haskell-tasty-smallcheck-0.8.2-847.3-riscv64 downloading... haskell-primitive-addr-0.1.0.3-48-riscv64 downloading... checking keyring... checking package integrity... loading package files... checking for file conflicts... :: Processing package changes... installing ghc... installing uusi... installing haskell-erf... installing haskell-quickcheck... installing haskell-data-fix... installing haskell-dlist... installing haskell-generically... installing haskell-integer-conversion... installing haskell-th-compat... installing haskell-network-uri... installing haskell-onetuple... installing haskell-scientific... installing haskell-indexed-traversable-instances... installing haskell-these... installing haskell-semialign... installing haskell-strict... installing haskell-time-compat... installing haskell-text-iso8601... installing haskell-text-short... installing haskell-uuid-types... installing haskell-witherable... installing haskell-aeson... installing haskell-primitive-addr... installing haskell-quickcheck-classes-base... installing haskell-quickcheck-classes... installing haskell-logict... installing haskell-smallcheck... installing haskell-call-stack... installing haskell-tasty-hunit... installing haskell-tasty-quickcheck... installing haskell-split... installing haskell-tasty-rerun... installing haskell-tasty-smallcheck... :: Running post-transaction hooks... (1/2) Arming ConditionNeedsUpdate... (2/2) Registering Haskell modules... ==> Retrieving sources... -> Found arithmoi-0.13.2.0.tar.gz ==> WARNING: Skipping all source file integrity checks. ==> Extracting sources... -> Extracting arithmoi-0.13.2.0.tar.gz with bsdtar ==> Starting prepare()... Write file: /build/haskell-arithmoi/src/arithmoi-0.13.2.0/Setup.hs ==> Starting build()... Configuring arithmoi-0.13.2.0... Preprocessing library for arithmoi-0.13.2.0.. Building library for arithmoi-0.13.2.0.. [ 1 of 56] Compiling Math.NumberTheory.Euclidean.Coprimes ( Math/NumberTheory/Euclidean/Coprimes.hs, dist/build/Math/NumberTheory/Euclidean/Coprimes.dyn_o ) [ 2 of 56] Compiling Math.NumberTheory.Moduli.SomeMod ( Math/NumberTheory/Moduli/SomeMod.hs, dist/build/Math/NumberTheory/Moduli/SomeMod.dyn_o ) [ 3 of 56] Compiling Math.NumberTheory.Moduli.Chinese ( Math/NumberTheory/Moduli/Chinese.hs, dist/build/Math/NumberTheory/Moduli/Chinese.dyn_o ) [ 4 of 56] Compiling Math.NumberTheory.Primes.Counting.Approximate ( Math/NumberTheory/Primes/Counting/Approximate.hs, dist/build/Math/NumberTheory/Primes/Counting/Approximate.dyn_o ) [ 5 of 56] Compiling Math.NumberTheory.Primes.Sieve.Indexing ( Math/NumberTheory/Primes/Sieve/Indexing.hs, dist/build/Math/NumberTheory/Primes/Sieve/Indexing.dyn_o ) [ 6 of 56] Compiling Math.NumberTheory.Primes.Small ( Math/NumberTheory/Primes/Small.hs, dist/build/Math/NumberTheory/Primes/Small.dyn_o ) [ 7 of 56] Compiling Math.NumberTheory.Recurrences.Pentagonal ( Math/NumberTheory/Recurrences/Pentagonal.hs, dist/build/Math/NumberTheory/Recurrences/Pentagonal.dyn_o ) [ 8 of 56] Compiling Math.NumberTheory.RootsOfUnity ( Math/NumberTheory/RootsOfUnity.hs, dist/build/Math/NumberTheory/RootsOfUnity.dyn_o ) [ 9 of 56] Compiling Math.NumberTheory.SmoothNumbers ( Math/NumberTheory/SmoothNumbers.hs, dist/build/Math/NumberTheory/SmoothNumbers.dyn_o ) [10 of 56] Compiling Math.NumberTheory.Utils.DirichletSeries ( Math/NumberTheory/Utils/DirichletSeries.hs, dist/build/Math/NumberTheory/Utils/DirichletSeries.dyn_o ) [11 of 56] Compiling Math.NumberTheory.Utils.FromIntegral ( Math/NumberTheory/Utils/FromIntegral.hs, dist/build/Math/NumberTheory/Utils/FromIntegral.dyn_o ) [12 of 56] Compiling Math.NumberTheory.Utils ( Math/NumberTheory/Utils.hs, dist/build/Math/NumberTheory/Utils.dyn_o ) [13 of 56] Compiling Math.NumberTheory.Moduli.JacobiSymbol ( Math/NumberTheory/Moduli/JacobiSymbol.hs, dist/build/Math/NumberTheory/Moduli/JacobiSymbol.dyn_o ) [14 of 56] Compiling Math.NumberTheory.Primes.Testing.Probabilistic ( Math/NumberTheory/Primes/Testing/Probabilistic.hs, dist/build/Math/NumberTheory/Primes/Testing/Probabilistic.dyn_o ) [15 of 56] Compiling Math.NumberTheory.Curves.Montgomery ( Math/NumberTheory/Curves/Montgomery.hs, dist/build/Math/NumberTheory/Curves/Montgomery.dyn_o ) [16 of 56] Compiling Math.NumberTheory.Primes.Types ( Math/NumberTheory/Primes/Types.hs, dist/build/Math/NumberTheory/Primes/Types.dyn_o ) [17 of 56] Compiling Math.NumberTheory.Primes.Sieve.Eratosthenes ( Math/NumberTheory/Primes/Sieve/Eratosthenes.hs, dist/build/Math/NumberTheory/Primes/Sieve/Eratosthenes.dyn_o ) [18 of 56] Compiling Math.NumberTheory.Primes.Factorisation.TrialDivision ( Math/NumberTheory/Primes/Factorisation/TrialDivision.hs, dist/build/Math/NumberTheory/Primes/Factorisation/TrialDivision.dyn_o ) [19 of 56] Compiling Math.NumberTheory.Primes.IntSet ( Math/NumberTheory/Primes/IntSet.hs, dist/build/Math/NumberTheory/Primes/IntSet.dyn_o ) [20 of 56] Compiling Math.NumberTheory.Primes.Factorisation.Montgomery ( Math/NumberTheory/Primes/Factorisation/Montgomery.hs, dist/build/Math/NumberTheory/Primes/Factorisation/Montgomery.dyn_o ) [21 of 56] Compiling Math.NumberTheory.Primes.Counting.Impl ( Math/NumberTheory/Primes/Counting/Impl.hs, dist/build/Math/NumberTheory/Primes/Counting/Impl.dyn_o ) [22 of 56] Compiling Math.NumberTheory.Primes.Counting ( Math/NumberTheory/Primes/Counting.hs, dist/build/Math/NumberTheory/Primes/Counting.dyn_o ) [23 of 56] Compiling Math.NumberTheory.Primes ( Math/NumberTheory/Primes.hs, dist/build/Math/NumberTheory/Primes.dyn_o ) [24 of 56] Compiling Math.NumberTheory.Recurrences.Linear ( Math/NumberTheory/Recurrences/Linear.hs, dist/build/Math/NumberTheory/Recurrences/Linear.dyn_o ) [25 of 56] Compiling Math.NumberTheory.Recurrences.Bilinear ( Math/NumberTheory/Recurrences/Bilinear.hs, dist/build/Math/NumberTheory/Recurrences/Bilinear.dyn_o ) [26 of 56] Compiling Math.NumberTheory.Recurrences ( Math/NumberTheory/Recurrences.hs, dist/build/Math/NumberTheory/Recurrences.dyn_o ) [27 of 56] Compiling Math.NumberTheory.Primes.Testing.Certified ( Math/NumberTheory/Primes/Testing/Certified.hs, dist/build/Math/NumberTheory/Primes/Testing/Certified.dyn_o ) [28 of 56] Compiling Math.NumberTheory.Primes.Testing ( Math/NumberTheory/Primes/Testing.hs, dist/build/Math/NumberTheory/Primes/Testing.dyn_o ) [29 of 56] Compiling Math.NumberTheory.Prefactored ( Math/NumberTheory/Prefactored.hs, dist/build/Math/NumberTheory/Prefactored.dyn_o ) [30 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.Class ( Math/NumberTheory/ArithmeticFunctions/Class.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/Class.dyn_o ) [31 of 56] Compiling Math.NumberTheory.MoebiusInversion ( Math/NumberTheory/MoebiusInversion.hs, dist/build/Math/NumberTheory/MoebiusInversion.dyn_o ) [32 of 56] Compiling Math.NumberTheory.Moduli.Singleton ( Math/NumberTheory/Moduli/Singleton.hs, dist/build/Math/NumberTheory/Moduli/Singleton.dyn_o ) [33 of 56] Compiling Math.NumberTheory.Moduli.Sqrt ( Math/NumberTheory/Moduli/Sqrt.hs, dist/build/Math/NumberTheory/Moduli/Sqrt.dyn_o ) [34 of 56] Compiling Math.NumberTheory.Quadratic.GaussianIntegers ( Math/NumberTheory/Quadratic/GaussianIntegers.hs, dist/build/Math/NumberTheory/Quadratic/GaussianIntegers.dyn_o ) [35 of 56] Compiling Math.NumberTheory.Quadratic.EisensteinIntegers ( Math/NumberTheory/Quadratic/EisensteinIntegers.hs, dist/build/Math/NumberTheory/Quadratic/EisensteinIntegers.dyn_o ) [36 of 56] Compiling Math.NumberTheory.Moduli.Equations ( Math/NumberTheory/Moduli/Equations.hs, dist/build/Math/NumberTheory/Moduli/Equations.dyn_o ) [37 of 56] Compiling Math.NumberTheory.Moduli.Internal ( Math/NumberTheory/Moduli/Internal.hs, dist/build/Math/NumberTheory/Moduli/Internal.dyn_o ) [38 of 56] Compiling Math.NumberTheory.Moduli.Multiplicative ( Math/NumberTheory/Moduli/Multiplicative.hs, dist/build/Math/NumberTheory/Moduli/Multiplicative.dyn_o ) [39 of 56] Compiling Math.NumberTheory.Moduli.Class ( Math/NumberTheory/Moduli/Class.hs, dist/build/Math/NumberTheory/Moduli/Class.dyn_o ) [40 of 56] Compiling Math.NumberTheory.Moduli ( Math/NumberTheory/Moduli.hs, dist/build/Math/NumberTheory/Moduli.dyn_o ) [41 of 56] Compiling Math.NumberTheory.Moduli.Cbrt ( Math/NumberTheory/Moduli/Cbrt.hs, dist/build/Math/NumberTheory/Moduli/Cbrt.dyn_o ) [42 of 56] Compiling Math.NumberTheory.Diophantine ( Math/NumberTheory/Diophantine.hs, dist/build/Math/NumberTheory/Diophantine.dyn_o ) [43 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.NFreedom ( Math/NumberTheory/ArithmeticFunctions/NFreedom.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/NFreedom.dyn_o ) [44 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.Moebius ( Math/NumberTheory/ArithmeticFunctions/Moebius.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/Moebius.dyn_o ) [45 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.Standard ( Math/NumberTheory/ArithmeticFunctions/Standard.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/Standard.dyn_o ) [46 of 56] Compiling Math.NumberTheory.ArithmeticFunctions ( Math/NumberTheory/ArithmeticFunctions.hs, dist/build/Math/NumberTheory/ArithmeticFunctions.dyn_o ) [47 of 56] Compiling Math.NumberTheory.DirichletCharacters ( Math/NumberTheory/DirichletCharacters.hs, dist/build/Math/NumberTheory/DirichletCharacters.dyn_o ) [48 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.SieveBlock ( Math/NumberTheory/ArithmeticFunctions/SieveBlock.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/SieveBlock.dyn_o ) [49 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.Mertens ( Math/NumberTheory/ArithmeticFunctions/Mertens.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/Mertens.dyn_o ) [50 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.Inverse ( Math/NumberTheory/ArithmeticFunctions/Inverse.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/Inverse.dyn_o ) [51 of 56] Compiling Math.NumberTheory.Utils.Hyperbola ( Math/NumberTheory/Utils/Hyperbola.hs, dist/build/Math/NumberTheory/Utils/Hyperbola.dyn_o ) [52 of 56] Compiling Math.NumberTheory.Zeta.Utils ( Math/NumberTheory/Zeta/Utils.hs, dist/build/Math/NumberTheory/Zeta/Utils.dyn_o ) [53 of 56] Compiling Math.NumberTheory.Zeta.Hurwitz ( Math/NumberTheory/Zeta/Hurwitz.hs, dist/build/Math/NumberTheory/Zeta/Hurwitz.dyn_o ) [54 of 56] Compiling Math.NumberTheory.Zeta.Riemann ( Math/NumberTheory/Zeta/Riemann.hs, dist/build/Math/NumberTheory/Zeta/Riemann.dyn_o ) [55 of 56] Compiling Math.NumberTheory.Zeta.Dirichlet ( Math/NumberTheory/Zeta/Dirichlet.hs, dist/build/Math/NumberTheory/Zeta/Dirichlet.dyn_o ) [56 of 56] Compiling Math.NumberTheory.Zeta ( Math/NumberTheory/Zeta.hs, dist/build/Math/NumberTheory/Zeta.dyn_o ) Preprocessing test suite 'arithmoi-tests' for arithmoi-0.13.2.0.. Building test suite 'arithmoi-tests' for arithmoi-0.13.2.0.. [ 1 of 39] Compiling Math.NumberTheory.ArithmeticFunctions.SieveBlockTests ( test-suite/Math/NumberTheory/ArithmeticFunctions/SieveBlockTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/ArithmeticFunctions/SieveBlockTests.dyn_o ) [ 2 of 39] Compiling Math.NumberTheory.TestUtils.MyCompose ( test-suite/Math/NumberTheory/TestUtils/MyCompose.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/TestUtils/MyCompose.dyn_o ) [ 3 of 39] Compiling Math.NumberTheory.TestUtils.Wrappers ( test-suite/Math/NumberTheory/TestUtils/Wrappers.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/TestUtils/Wrappers.dyn_o ) [ 4 of 39] Compiling Math.NumberTheory.TestUtils ( test-suite/Math/NumberTheory/TestUtils.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/TestUtils.dyn_o ) [ 5 of 39] Compiling Math.NumberTheory.SmoothNumbersTests ( test-suite/Math/NumberTheory/SmoothNumbersTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/SmoothNumbersTests.dyn_o ) [ 6 of 39] Compiling Math.NumberTheory.RootsOfUnityTests ( test-suite/Math/NumberTheory/RootsOfUnityTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/RootsOfUnityTests.dyn_o ) [ 7 of 39] Compiling Math.NumberTheory.Recurrences.PentagonalTests ( test-suite/Math/NumberTheory/Recurrences/PentagonalTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Recurrences/PentagonalTests.dyn_o ) [ 8 of 39] Compiling Math.NumberTheory.Recurrences.LinearTests ( test-suite/Math/NumberTheory/Recurrences/LinearTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Recurrences/LinearTests.dyn_o ) [ 9 of 39] Compiling Math.NumberTheory.Recurrences.BilinearTests ( test-suite/Math/NumberTheory/Recurrences/BilinearTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Recurrences/BilinearTests.dyn_o ) [10 of 39] Compiling Math.NumberTheory.PrimesTests ( test-suite/Math/NumberTheory/PrimesTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/PrimesTests.dyn_o ) [11 of 39] Compiling Math.NumberTheory.Primes.TestingTests ( test-suite/Math/NumberTheory/Primes/TestingTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Primes/TestingTests.dyn_o ) [12 of 39] Compiling Math.NumberTheory.Primes.SieveTests ( test-suite/Math/NumberTheory/Primes/SieveTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Primes/SieveTests.dyn_o ) [13 of 39] Compiling Math.NumberTheory.Primes.SequenceTests ( test-suite/Math/NumberTheory/Primes/SequenceTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Primes/SequenceTests.dyn_o ) [14 of 39] Compiling Math.NumberTheory.Primes.FactorisationTests ( test-suite/Math/NumberTheory/Primes/FactorisationTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Primes/FactorisationTests.dyn_o ) [15 of 39] Compiling Math.NumberTheory.Primes.CountingTests ( test-suite/Math/NumberTheory/Primes/CountingTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Primes/CountingTests.dyn_o ) [16 of 39] Compiling Math.NumberTheory.PrefactoredTests ( test-suite/Math/NumberTheory/PrefactoredTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/PrefactoredTests.dyn_o ) [17 of 39] Compiling Math.NumberTheory.MoebiusInversionTests ( test-suite/Math/NumberTheory/MoebiusInversionTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/MoebiusInversionTests.dyn_o ) [18 of 39] Compiling Math.NumberTheory.Moduli.SqrtTests ( test-suite/Math/NumberTheory/Moduli/SqrtTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/SqrtTests.dyn_o ) [19 of 39] Compiling Math.NumberTheory.Moduli.SingletonTests ( test-suite/Math/NumberTheory/Moduli/SingletonTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/SingletonTests.dyn_o ) [20 of 39] Compiling Math.NumberTheory.Moduli.PrimitiveRootTests ( test-suite/Math/NumberTheory/Moduli/PrimitiveRootTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/PrimitiveRootTests.dyn_o ) [21 of 39] Compiling Math.NumberTheory.Moduli.JacobiTests ( test-suite/Math/NumberTheory/Moduli/JacobiTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/JacobiTests.dyn_o ) [22 of 39] Compiling Math.NumberTheory.Moduli.EquationsTests ( test-suite/Math/NumberTheory/Moduli/EquationsTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/EquationsTests.dyn_o ) [23 of 39] Compiling Math.NumberTheory.Moduli.DiscreteLogarithmTests ( test-suite/Math/NumberTheory/Moduli/DiscreteLogarithmTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/DiscreteLogarithmTests.dyn_o ) [24 of 39] Compiling Math.NumberTheory.Moduli.ClassTests ( test-suite/Math/NumberTheory/Moduli/ClassTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/ClassTests.dyn_o ) [25 of 39] Compiling Math.NumberTheory.Moduli.ChineseTests ( test-suite/Math/NumberTheory/Moduli/ChineseTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/ChineseTests.dyn_o ) [26 of 39] Compiling Math.NumberTheory.Moduli.CbrtTests ( test-suite/Math/NumberTheory/Moduli/CbrtTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/CbrtTests.dyn_o ) [27 of 39] Compiling Math.NumberTheory.GaussianIntegersTests ( test-suite/Math/NumberTheory/GaussianIntegersTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/GaussianIntegersTests.dyn_o ) [28 of 39] Compiling Math.NumberTheory.EuclideanTests ( test-suite/Math/NumberTheory/EuclideanTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/EuclideanTests.dyn_o ) [29 of 39] Compiling Math.NumberTheory.EisensteinIntegersTests ( test-suite/Math/NumberTheory/EisensteinIntegersTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/EisensteinIntegersTests.dyn_o ) [30 of 39] Compiling Math.NumberTheory.DirichletCharactersTests ( test-suite/Math/NumberTheory/DirichletCharactersTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/DirichletCharactersTests.dyn_o ) [31 of 39] Compiling Math.NumberTheory.DiophantineTests ( test-suite/Math/NumberTheory/DiophantineTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/DiophantineTests.dyn_o ) [32 of 39] Compiling Math.NumberTheory.CurvesTests ( test-suite/Math/NumberTheory/CurvesTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/CurvesTests.dyn_o ) [33 of 39] Compiling Math.NumberTheory.ArithmeticFunctionsTests ( test-suite/Math/NumberTheory/ArithmeticFunctionsTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/ArithmeticFunctionsTests.dyn_o ) [34 of 39] Compiling Math.NumberTheory.ArithmeticFunctions.MertensTests ( test-suite/Math/NumberTheory/ArithmeticFunctions/MertensTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/ArithmeticFunctions/MertensTests.dyn_o ) [35 of 39] Compiling Math.NumberTheory.ArithmeticFunctions.InverseTests ( test-suite/Math/NumberTheory/ArithmeticFunctions/InverseTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/ArithmeticFunctions/InverseTests.dyn_o ) [36 of 39] Compiling Math.NumberTheory.UniqueFactorisationTests ( test-suite/Math/NumberTheory/UniqueFactorisationTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/UniqueFactorisationTests.dyn_o ) [37 of 39] Compiling Math.NumberTheory.Zeta.DirichletTests ( test-suite/Math/NumberTheory/Zeta/DirichletTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Zeta/DirichletTests.dyn_o ) [38 of 39] Compiling Math.NumberTheory.Zeta.RiemannTests ( test-suite/Math/NumberTheory/Zeta/RiemannTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Zeta/RiemannTests.dyn_o ) [39 of 39] Compiling Main ( test-suite/Test.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Main.dyn_o ) [40 of 40] Linking dist/build/arithmoi-tests/arithmoi-tests Unregistering arithmoi-0.13.2.0... ==> Starting check()... Running 1 test suites... Test suite arithmoi-tests: RUNNING... All Euclidean coprime smallcheck Int: OK 121 tests completed smallcheck Word: OK 36 tests completed smallcheck Integer: OK 121 tests completed smallcheck Natural: OK 36 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK (0.02s) +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK +++ OK, passed 100 tests. quickcheck Large Word: OK +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.16s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.17s) +++ OK, passed 100 tests. splitIntoCoprimes preserves product of factors Natural smallcheck: OK (0.03s) 229 tests completed quickcheck: OK (0.10s) +++ OK, passed 100 tests. Integer smallcheck: OK (0.30s) 862 tests completed quickcheck: OK (0.12s) +++ OK, passed 100 tests. Gaussian smallcheck: OK (2.74s) 2776 tests completed quickcheck: OK (1.13s) +++ OK, passed 100 tests. number of factors is non-decreasing Natural smallcheck: OK 82 tests completed quickcheck: OK (0.11s) +++ OK, passed 100 tests. Integer smallcheck: OK (0.10s) 451 tests completed quickcheck: OK (0.13s) +++ OK, passed 100 tests. Gaussian smallcheck: OK (0.60s) 1225 tests completed quickcheck: OK (0.92s) +++ OK, passed 100 tests. output factors are coprime Natural smallcheck: OK (0.03s) 229 tests completed quickcheck: OK (0.08s) +++ OK, passed 100 tests. Integer smallcheck: OK (0.36s) 862 tests completed quickcheck: OK (0.10s) +++ OK, passed 100 tests. Gaussian smallcheck: OK (2.69s) 2776 tests completed quickcheck: OK (1.49s) +++ OK, passed 100 tests. does not freeze case 1: OK case 2: OK Natural smallcheck: OK (0.63s) 1313 tests completed quickcheck: OK (0.05s) +++ OK, passed 100 tests. Integer: OK (0.09s) +++ OK, passed 100 tests. Gaussian: OK (0.96s) +++ OK, passed 100 tests. output factors are non-unit Natural smallcheck: OK (0.62s) 1313 tests completed quickcheck: OK (0.06s) +++ OK, passed 100 tests. Integer: OK (0.10s) +++ OK, passed 100 tests. Gaussian: OK (0.96s) +++ OK, passed 100 tests. Coprimes test equality: OK test union: OK test insert with coprime base: OK test insert with non-coprime base: OK property union Natural smallcheck: OK (7.39s) 52441 tests completed quickcheck: OK (0.19s) +++ OK, passed 100 tests. Integer: OK (0.43s) +++ OK, passed 100 tests. Recurrences Pentagonal partition matches definition smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. mod n smallcheck: OK 30 tests completed quickcheck: OK (0.03s) +++ OK, passed 100 tests. first 20 elements of partition are correct: OK Generalized pentagonal numbers matches definition smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. Linear fibonacci matches definition smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. negative indices smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. pair smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. fibonacci 0: OK fibonacci 1: OK lucas matches definition smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. negative indices smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. pair smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. lucas 0: OK lucas 1: OK generalLucas matches definition smallcheck: OK (0.01s) 726 tests completed quickcheck: OK +++ OK, passed 100 tests. generalLucas 1 (-1) smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. generalLucas _ _ 0 smallcheck: OK 121 tests completed quickcheck: OK +++ OK, passed 100 tests. factorial factorise . factorial = factorialFactors smallcheck: OK 6 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. factorial = factorBack . factorialFactors smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Bilinear binomial shape smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. left side smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. right side smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. recurrency smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. factorise . binomial = binomialFactors smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. binomial = factorBack . binomialFactors smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. line smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. diagonal smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. binomialRotated left side smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. right side smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. recurrency smallcheck: OK 25 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. line smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. diagonal smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. stirling1 shape smallcheck: OK 6 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. left side smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. right side smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. recurrency smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. stirling2 shape smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. left side smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. right side smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. recurrency smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. lah shape smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. left side smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. right side smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. zip stirlings smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. eulerian1 shape smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. left side smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. right side smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. recurrency smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. eulerian2 shape smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. left side smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. right side smallcheck: OK 5 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. recurrency smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. bernoulli B_0: OK B_1: OK sign smallcheck: OK 6 tests completed quickcheck: OK (0.03s) +++ OK, passed 100 tests. recursive definition smallcheck: OK 6 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. Euler numbers First 20 elements of E_n are correct: OK E_n with n odd is 0 smallcheck: OK 5 tests completed quickcheck: OK (0.26s) +++ OK, passed 100 tests. E_n for n in [2,6,8,12..] is negative smallcheck: OK 6 tests completed quickcheck: OK (0.82s) +++ OK, passed 100 tests. Euler Polynomial of order N evaluated at 1 First 20 elements of E_n(1) are correct: OK E_n(1) with n in [2,4,6..] is 0 smallcheck: OK 5 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. Moduli chinese smallcheck: OK (0.07s) 3025 tests completed quickcheck: OK +++ OK, passed 100 tests. Class invertMod smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. powerMod generic multiplicative by base smallcheck Int: OK (0.10s) 3630 tests completed smallcheck Word: OK (0.09s) 3630 tests completed smallcheck Integer: OK (0.09s) 3630 tests completed smallcheck Natural: OK (0.09s) 3630 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK +++ OK, passed 100 tests. quickcheck Large Word: OK +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.03s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.03s) +++ OK, passed 100 tests. additive by exponent smallcheck Int: OK (0.06s) 1980 tests completed smallcheck Word: OK (0.05s) 1980 tests completed smallcheck Integer: OK (0.05s) 1980 tests completed smallcheck Natural: OK (0.05s) 1980 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK +++ OK, passed 100 tests. quickcheck Large Word: OK +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.05s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.04s) +++ OK, passed 100 tests. Integer multiplicative by base smallcheck: OK (0.09s) 3630 tests completed quickcheck: OK +++ OK, passed 100 tests. additive by exponent smallcheck: OK (0.05s) 1980 tests completed quickcheck: OK +++ OK, passed 100 tests. Same SomeMod mul smallcheck: OK 605 tests completed quickcheck: OK +++ OK, passed 100 tests. mul huge: OK (0.01s) +++ OK, passed 100 tests. mul huge all: OK (0.01s) +++ OK, passed 100 tests. SomeMod add smallcheck: OK (0.03s) 3025 tests completed quickcheck: OK +++ OK, passed 100 tests. sub smallcheck: OK (0.03s) 3025 tests completed quickcheck: OK +++ OK, passed 100 tests. mul smallcheck: OK (0.03s) 3025 tests completed quickcheck: OK +++ OK, passed 100 tests. neg smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. abs smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. InfMod add smallcheck: OK 605 tests completed quickcheck: OK +++ OK, passed 100 tests. sub smallcheck: OK 605 tests completed quickcheck: OK +++ OK, passed 100 tests. mul smallcheck: OK 605 tests completed quickcheck: OK +++ OK, passed 100 tests. getVal/getMod smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. CubicSymbol multiplicative property of numerators smallcheck: OK (37.26s) 531441 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. multiplicative property of denominators smallcheck: OK (33.41s) 531441 tests completed quickcheck: OK +++ OK, passed 100 tests. cubic residue with prime denominator smallcheck: OK (0.42s) 3564 tests completed quickcheck: OK (0.34s) +++ OK, passed 100 tests. Discrete logarithm output is correct range smallcheck: OK (0.02s) 605 tests completed quickcheck: OK +++ OK, passed 100 tests. a^(log_a b) == b smallcheck: OK (0.02s) 605 tests completed quickcheck: OK +++ OK, passed 100 tests. log_a a^k == k smallcheck: OK 330 tests completed quickcheck: OK +++ OK, passed 100 tests. Equations solveLinear smallcheck: OK (0.04s) 324 tests completed quickcheck: OK +++ OK, passed 100 tests. solveQuadratic smallcheck: OK (2.82s) 2916 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. Jacobi same modulo n smallcheck Int: OK 22 tests completed smallcheck Word: OK 12 tests completed smallcheck Integer: OK 22 tests completed smallcheck Natural: OK 12 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK (0.01s) +++ OK, passed 100 tests. quickcheck Large Word: OK (0.01s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.25s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.28s) +++ OK, passed 100 tests. consistent with gcd smallcheck Int: OK 22 tests completed smallcheck Word: OK 12 tests completed smallcheck Integer: OK 22 tests completed smallcheck Natural: OK 12 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK +++ OK, passed 100 tests. quickcheck Large Word: OK +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.21s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.21s) +++ OK, passed 100 tests. multiplicative 1 smallcheck Int: OK (0.01s) 242 tests completed smallcheck Word: OK 72 tests completed smallcheck Integer: OK (0.01s) 242 tests completed smallcheck Natural: OK 72 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK +++ OK, passed 100 tests. quickcheck Large Word: OK +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.40s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.39s) +++ OK, passed 100 tests. multiplicative 2 smallcheck Int: OK 44 tests completed smallcheck Word: OK 24 tests completed smallcheck Integer: OK 44 tests completed smallcheck Natural: OK 24 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK (0.01s) +++ OK, passed 100 tests. quickcheck Large Word: OK +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.39s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.46s) +++ OK, passed 100 tests. law of quadratic reciprocity smallcheck Int: OK 4 tests completed smallcheck Word: OK 4 tests completed smallcheck Integer: OK 4 tests completed smallcheck Natural: OK 4 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK (0.02s) +++ OK, passed 100 tests. quickcheck Large Word: OK (0.01s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.36s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.29s) +++ OK, passed 100 tests. -1 Int smallcheck: OK 2 tests completed quickcheck: OK +++ OK, passed 100 tests. -1 Integer smallcheck: OK 2 tests completed quickcheck: OK +++ OK, passed 100 tests. 2 smallcheck Int: OK 2 tests completed smallcheck Word: OK 2 tests completed smallcheck Integer: OK 2 tests completed smallcheck Natural: OK 2 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK +++ OK, passed 100 tests. quickcheck Large Word: OK +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.02s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.02s) +++ OK, passed 100 tests. minBound Int smallcheck: OK 2 tests completed quickcheck: OK +++ OK, passed 100 tests. Primitive root CyclicGroup cyclicGroupFromModulo smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK (0.02s) +++ OK, passed 100 tests. quickcheck Large Word: OK (0.02s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.23s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.19s) +++ OK, passed 100 tests. cyclic group mod p smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK (0.01s) +++ OK, passed 100 tests. quickcheck Large Word: OK (0.01s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.06s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.07s) +++ OK, passed 100 tests. cyclic group mod 2p smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK +++ OK, passed 100 tests. quickcheck Large Word: OK +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.02s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.20s) +++ OK, passed 100 tests. cyclic group mod 8: OK isPrimitiveRoot' primitive root is coprime with modulo Integer smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. Natural smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. Int smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. Word smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. isPrimitiveRoot primitive root is coprime with modulo smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. cyclic group has a primitive root smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. primitive root generates cyclic group smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. cyclic group has right number of primitive roots smallcheck: OK 5 tests completed quickcheck: OK (0.03s) +++ OK, passed 100 tests. Singleton unSFactors . someSFactors = id smallcheck: OK (0.01s) 113 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. cyclicGroupFromModulo = cyclicGroupFromFactors . factorise smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. Sqrt sqrtsModPrime matches jacobi smallcheck: OK 66 tests completed quickcheck: OK +++ OK, passed 100 tests. is residue smallcheck: OK 66 tests completed quickcheck: OK +++ OK, passed 100 tests. distinct smallcheck: OK 66 tests completed quickcheck: OK +++ OK, passed 100 tests. bounded smallcheck: OK 66 tests completed quickcheck: OK +++ OK, passed 100 tests. tonelliShanks generic smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. smallest residue smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. -1 smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. OEIS A002224: OK (0.01s) sqrtsModPrimePower generic smallcheck: OK 176 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. _ 2 _ smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. distinct smallcheck: OK 176 tests completed quickcheck: OK +++ OK, passed 100 tests. _ 2 _ smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. bounded smallcheck: OK 176 tests completed quickcheck: OK +++ OK, passed 100 tests. _ 2 _ smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. 16 2 2: OK 16 3 2: OK 0 3 2: OK 0 3 3: OK 0 2 4: OK 9 3 3: OK 4 2 3: OK 1 2 2: OK -1 2 2: OK 4 2 4: OK 16 2 6: OK sqrtsModFactorisation generic smallcheck: OK (0.07s) 671 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. distinct smallcheck: OK (0.06s) 671 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. bounded smallcheck: OK (0.06s) 671 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. 0 [(2,1), (3,1), (5,1)]: OK 0 [(3,1), (5,1)]: OK sqrtsMod generic smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. MoebiusInversion totientSum matches definitions smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. special case 1: OK zero: OK generalInversion: OK (0.02s) +++ OK, passed 100 tests. Prefactored fromValue smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. fromFactors smallcheck: OK (0.30s) 862 tests completed quickcheck: OK (0.18s) +++ OK, passed 100 tests. Num instance plus smallcheck: OK 121 tests completed quickcheck: OK +++ OK, passed 100 tests. minus smallcheck: OK 121 tests completed quickcheck: OK +++ OK, passed 100 tests. minusNatural smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. multiply smallcheck: OK 121 tests completed quickcheck: OK +++ OK, passed 100 tests. negate smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. absSignum smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. fromInteger smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. Primes Primes primesSum smallcheck: OK (0.16s) 6 tests completed quickcheck: OK +++ OK, passed 100 tests. symmetricDifference smallcheck: OK (0.20s) 2809 tests completed quickcheck: OK (0.07s) +++ OK, passed 100 tests. toPrimeIntegral Int -> Integer smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Int -> Int8 smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Integer -> Int smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Counting primeCount non-negative smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. monotonic smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. increases on primes smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. special case 1: OK special case 2: OK special case 3: OK special case 4: OK special case 5: OK (0.16s) special case 6: OK (0.16s) special case 7: OK (0.16s) special case 8: OK (0.16s) special case 9: OK (0.19s) special case 10: OK (0.47s) special case 11: OK (1.84s) special case 12: OK (8.32s) nthPrime positive smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. monotonic smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. is prime smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. special case 1: OK special case 2: OK special case 3: OK special case 4: OK special case 5: OK special case 6: OK (0.04s) special case 7: OK (0.33s) special case 8: OK (0.35s) special case 9: OK (0.40s) special case 10: OK (0.71s) special case 11: OK (2.11s) special case 12: OK (8.75s) approxPrimeCount non-negative smallcheck Int: OK 11 tests completed smallcheck Word: OK 6 tests completed smallcheck Integer: OK 11 tests completed smallcheck Natural: OK 6 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK +++ OK, passed 100 tests. quickcheck Large Word: OK +++ OK, passed 100 tests. quickcheck Huge Integer: OK +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.01s) +++ OK, passed 100 tests. overestimates primeCount smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK (3.71s) +++ OK, passed 100 tests. quickcheck Large Word: OK (3.27s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (0.01s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.01s) +++ OK, passed 100 tests. nthPrimeApprox positive smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. underestimates nthPrime smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. Factorisation factorise 0: OK negate smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. bases are prime smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. bases are distinct smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. factorback smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. special case 35: OK special case 75: OK special case 4293001441: OK special case 4295098369: OK special case 2147483647: OK special case 4294967291: OK special case 19000...00001: OK special case 41890...00525: OK special case 92233...75783: OK special case 18446...51557: OK special case 41813...70917: OK (0.17s) special case 41813...70918: OK special case 22271...44929: OK special case 10489...67281: OK (0.01s) special case 10489...67282: OK (0.02s) special case 10489...67283: OK (0.10s) special case 10489...67287: OK (1.39s) special case 62930...00748: OK special case 62930...00749: OK (0.03s) special case 62930...00750: OK (0.51s) special case 62930...00751: OK special case 62930...00753: OK (0.15s) special case 62930...00754: OK special case 11999...77057: OK (0.05s) special case 11999...77062: OK special case 16757...78160: OK (0.04s) special case 16757...78162: OK (0.11s) special case 16757...78163: OK (9.36s) special case 11111...11111: OK (0.13s) special case 62350...06937: OK special case 62647...15862: OK (0.01s) special case 63839...24037: OK (0.01s) laziness 14145...65857: OK (0.45s) Sequence nextPrime smallcheck Int: OK 11 tests completed smallcheck Word: OK 6 tests completed smallcheck Integer: OK 11 tests completed smallcheck Natural: OK 6 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. precPrime smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. toEnum Int smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. Word smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. Integer smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. Natural smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. fromEnum Int smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Word smallcheck: OK 3 tests completed quickcheck: OK +++ OK, passed 100 tests. Integer smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Natural smallcheck: OK 3 tests completed quickcheck: OK +++ OK, passed 100 tests. succ Int smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Word smallcheck: OK 3 tests completed quickcheck: OK +++ OK, passed 100 tests. Integer smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Natural smallcheck: OK 3 tests completed quickcheck: OK +++ OK, passed 100 tests. pred Int smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Word smallcheck: OK 3 tests completed quickcheck: OK +++ OK, passed 100 tests. Integer smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Natural smallcheck: OK 3 tests completed quickcheck: OK +++ OK, passed 100 tests. [2..2] == [2]: OK [65500..65600]: OK [2..100000]: OK (0.05s) enumFrom Int smallcheck: OK 36 tests completed quickcheck: FAIL (0.63s) *** Failed! Falsified (after 19 tests): Prime 7 Prime 17 Use --quickcheck-replay="(SMGen 1492207746350445949 11854858045900138793,18)" to reproduce. Use -p '/enumFrom.Int.quickcheck/' to rerun this test only. Word smallcheck: OK 9 tests completed quickcheck: FAIL (0.20s) *** Failed! Falsified (after 13 tests): Prime 11 Prime 11 Use --quickcheck-replay="(SMGen 12569320835680424404 16327619665690036827,12)" to reproduce. Use -p '/enumFrom.Word.quickcheck/' to rerun this test only. Integer smallcheck: OK (0.02s) 36 tests completed quickcheck: FAIL (0.16s) *** Failed! Falsified (after 16 tests): Prime 11 Prime 11 Use --quickcheck-replay="(SMGen 8714076116920027949 5036877367566646577,15)" to reproduce. Use -p '/enumFrom.Integer.quickcheck/' to rerun this test only. Natural smallcheck: OK (0.02s) 9 tests completed quickcheck: FAIL (0.32s) *** Failed! Falsified (after 14 tests): Prime 7 Prime 7 Use --quickcheck-replay="(SMGen 7035343457794366343 9875991880291739161,13)" to reproduce. Use -p '/enumFrom.Natural.quickcheck/' to rerun this test only. enumFromTo Int smallcheck: OK 36 tests completed quickcheck: FAIL (0.02s) *** Failed! Falsified (after 18 tests): Prime 7 Prime 13 Use --quickcheck-replay="(SMGen 12032436696711836631 3069442940061538201,17)" to reproduce. Use -p '/enumFromTo.Int.quickcheck/' to rerun this test only. Word smallcheck: OK 9 tests completed quickcheck: FAIL (0.02s) *** Failed! Falsified (after 13 tests): Prime 11 Prime 13 Use --quickcheck-replay="(SMGen 3370154767813745398 13045876687263034207,12)" to reproduce. Use -p '/enumFromTo.Word.quickcheck/' to rerun this test only. Integer smallcheck: OK 36 tests completed quickcheck: FAIL (0.02s) *** Failed! Falsified (after 18 tests): Prime 11 Prime 17 Use --quickcheck-replay="(SMGen 17078748465743711105 12145877016408405241,17)" to reproduce. Use -p '/enumFromTo.Integer.quickcheck/' to rerun this test only. Natural smallcheck: OK (0.02s) 9 tests completed quickcheck: FAIL *** Failed! Falsified (after 19 tests): Prime 11 Prime 11 Use --quickcheck-replay="(SMGen 17321105180907747139 18182528054533540523,18)" to reproduce. Use -p '/enumFromTo.Natural.quickcheck/' to rerun this test only. enumFromThen Int smallcheck: OK (0.02s) 216 tests completed quickcheck: FAIL (0.78s) *** Failed! Falsified (after 45 tests): Prime 11 Prime 17 Prime 31 Use --quickcheck-replay="(SMGen 3789847096755836844 12554906365654929205,44)" to reproduce. Use -p '/enumFromThen.Int.quickcheck/' to rerun this test only. Word smallcheck: OK (0.01s) 27 tests completed quickcheck: FAIL *** Failed! Falsified (after 10 tests): Prime 11 Prime 7 Prime 7 Use --quickcheck-replay="(SMGen 18341696241571655113 10285262518557106983,9)" to reproduce. Use -p '/enumFromThen.Word.quickcheck/' to rerun this test only. Integer smallcheck: OK (0.03s) 216 tests completed quickcheck: FAIL *** Failed! Falsified (after 20 tests): Prime 7 Prime 5 Prime 7 Use --quickcheck-replay="(SMGen 18176497255209553452 5131742319489118317,19)" to reproduce. Use -p '/enumFromThen.Integer.quickcheck/' to rerun this test only. Natural smallcheck: OK 27 tests completed quickcheck: FAIL (0.02s) *** Failed! Falsified (after 18 tests): Prime 13 Prime 11 Prime 7 Use --quickcheck-replay="(SMGen 16588786983237653779 200356425041920909,17)" to reproduce. Use -p '/enumFromThen.Natural.quickcheck/' to rerun this test only. enumFromThenTo Int smallcheck: OK (0.02s) 216 tests completed quickcheck: FAIL *** Failed! Falsified (after 17 tests): Prime 7 Prime 17 Prime 7 Use --quickcheck-replay="(SMGen 8530801738380015842 185944417655519847,16)" to reproduce. Use -p '/enumFromThenTo.Int.quickcheck/' to rerun this test only. Word smallcheck: OK (0.02s) 27 tests completed quickcheck: FAIL *** Failed! Falsified (after 41 tests): Prime 11 Prime 7 Prime 7 Use --quickcheck-replay="(SMGen 10571191601009724919 14366626428080275913,40)" to reproduce. Use -p '/enumFromThenTo.Word.quickcheck/' to rerun this test only. Integer smallcheck: OK (0.02s) 216 tests completed quickcheck: FAIL *** Failed! Falsified (after 13 tests): Prime 7 Prime 11 Prime 7 Use --quickcheck-replay="(SMGen 6339626913063516843 4739555747751168443,12)" to reproduce. Use -p '/enumFromThenTo.Integer.quickcheck/' to rerun this test only. Natural smallcheck: OK 27 tests completed quickcheck: FAIL *** Failed! Falsified (after 31 tests): Prime 29 Prime 11 Prime 11 Use --quickcheck-replay="(SMGen 10360275290138412857 1541556455915859705,30)" to reproduce. Use -p '/enumFromThenTo.Natural.quickcheck/' to rerun this test only. Sieve primes Int: OK (5.73s) Word: OK (5.59s) Integer: OK (5.83s) Natural: OK (6.23s) Int8: OK Int16: OK (0.14s) Word8: OK Word16: OK (0.29s) primeSieve smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. psieveList Int: OK (0.35s) Word: OK (0.26s) Integer: OK (0.31s) Natural: OK (0.69s) Int8: OK Int16: OK (0.13s) Word8: OK Word16: OK (0.28s) Testing isPrime [0..100]: OK negate smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. Carmichael pseudoprimes: OK strong pseudoprimes base 2: OK strong Lucas pseudoprimes: OK isStrongFermatPP matches isPrime smallcheck: OK 66 tests completed quickcheck: OK +++ OK, passed 100 tests. EisensteinIntegers forall z . z == signum z * abs z smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. abs z rotates to the first sextant smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. Division The remainder's norm is smaller than the divisor's smallcheck: OK (0.28s) 6561 tests completed quickcheck: OK +++ OK, passed 100 tests. quotE and remE work properly smallcheck: OK (0.28s) 6561 tests completed quickcheck: OK +++ OK, passed 100 tests. quotRemE works properly smallcheck: OK (0.27s) 6561 tests completed quickcheck: OK +++ OK, passed 100 tests. g.c.d. The g.c.d. of two Eisenstein integers divides them smallcheck: OK (0.31s) 6561 tests completed quickcheck: OK +++ OK, passed 100 tests. Common divisor divides gcd: OK +++ OK, passed 100 tests. g.c.d. (12 :+ 23) (23 :+ 34): OK The Eisenstein norm function is multiplicative smallcheck: OK (0.26s) 6561 tests completed quickcheck: OK +++ OK, passed 100 tests. Primality findPrime returns prime smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. primes are actually prime smallcheck: OK 5 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. primes is ordered smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. primes are in the first sextant smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. Factorisation factorise produces correct results smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. factorise produces no factors with exponent 0 smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. factorise produces no unit factors smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. factorise 15:+12: OK GcdDomain divide1: OK +++ OK, passed 100 tests; 10 discarded. divide2: OK +++ OK, passed 100 tests; 10 discarded. gcd1: OK +++ OK, passed 100 tests; 10 discarded. gcd2: OK +++ OK, passed 100 tests; 10 discarded. lcm1: OK +++ OK, passed 100 tests; 12 discarded. lcm2: OK +++ OK, passed 100 tests; 10 discarded. coprime: OK +++ OK, passed 100 tests; 11 discarded. Euclidean degree: OK +++ OK, passed 100 tests; 10 discarded. quotRem: OK +++ OK, passed 100 tests; 10 discarded. quot: OK +++ OK, passed 100 tests; 11 discarded. rem: OK +++ OK, passed 100 tests; 10 discarded. GaussianIntegers factorise factor back smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. powers are > 0 smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. factors are > 1 smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. factorise 63:+36: OK laziness: OK (0.08s) findPrime' smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. isPrime smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. primes matches reference: OK primes smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. primes are ordered: OK (0.03s) counting primes: OK (3.77s) signumAbsProperty smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. absProperty smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. remProperty smallcheck: OK (0.28s) 6561 tests completed quickcheck: OK +++ OK, passed 100 tests. gcd is divisor smallcheck: OK (0.30s) 6561 tests completed quickcheck: OK +++ OK, passed 100 tests. is greatest: OK +++ OK, passed 100 tests. (12 :+ 23) (23 :+ 34): OK (0 :+ 3) (2 :+ 2): OK GcdDomain divide1: OK +++ OK, passed 100 tests; 11 discarded. divide2: OK +++ OK, passed 100 tests; 12 discarded. gcd1: OK +++ OK, passed 100 tests; 10 discarded. gcd2: OK +++ OK, passed 100 tests; 12 discarded. lcm1: OK +++ OK, passed 100 tests; 10 discarded. lcm2: OK +++ OK, passed 100 tests; 10 discarded. coprime: OK +++ OK, passed 100 tests; 12 discarded. Euclidean degree: OK +++ OK, passed 100 tests; 10 discarded. quotRem: OK +++ OK, passed 100 tests; 11 discarded. quot: OK +++ OK, passed 100 tests; 10 discarded. rem: OK +++ OK, passed 100 tests; 10 discarded. ArithmeticFunctions ArithmeticFunctions Divisors length . divisors = tau smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. sum . divisors = sigma_1 smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. matches definition smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. divisors = divisorsSmall smallcheck: OK 10 tests completed quickcheck: OK +++ OK, passed 100 tests. divisors = divisorsList smallcheck: OK 10 tests completed quickcheck: OK +++ OK, passed 100 tests. divisors = divisorsTo smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. Tau OEIS: OK Sigma sigma_0 = tau smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. sigma_1 n > n smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. OEIS sigma_1: OK OEIS sigma_2: OK Totient totient is even smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. totient n < n smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. OEIS: OK Jordan jordan_0 = [== 1] smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. jordan_1 = totient smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. OEIS jordan_2: OK Ramanujan ramanujan mod 8 congruences smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. ramanujan mod 7 congruences smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. baseline ramanujan range: OK baseline ramanujan powers2: OK baseline ramanujan powers3: OK Moebius OEIS: OK Lazy: OK Liouville liouville values smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. liouville matches moebius smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. OEIS: OK Carmichael carmichael divides totient smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. OEIS: OK Omegas smallOmega <= bigOmega smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. OEIS smallOmega: OK OEIS bigOmega: OK Mangoldt OEIS: OK N-freedom `isNFree` matches the definition smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. numbers produces by `nFrees`s are `n`-free smallcheck: OK 30 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. distribution of n-free numbers matches expected smallcheck: OK (0.02s) 25 tests completed quickcheck: OK (0.20s) +++ OK, passed 100 tests. nFreesBlock matches nFrees smallcheck: OK 150 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. `1` is the only 0-free number: OK `1` is the only 1-free number: OK Inverse Totient forward smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.02s) +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK (0.01s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.01s) +++ OK, passed 100 tests. backward smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK (0.01s) +++ OK, passed 100 tests. count factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK factorial 6: OK factorial 7: OK factorial 8: OK factorial 9: OK factorial 10: OK factorial 11: OK (0.02s) factorial 12: OK (0.03s) factorial 13: OK (0.07s) factorial 14: OK (0.17s) factorial 15: OK (0.38s) factorial 16: OK (0.71s) factorial 17: OK (1.89s) factorial 18: OK (3.31s) min factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK factorial 6: OK factorial 7: OK factorial 8: OK factorial 9: OK factorial 10: OK factorial 11: OK (0.02s) factorial 12: OK (0.03s) factorial 13: OK (0.07s) factorial 14: OK (0.17s) factorial 15: OK (0.39s) factorial 16: OK (0.71s) factorial 17: OK (1.89s) factorial 18: OK (3.31s) max factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK factorial 6: OK factorial 7: OK factorial 8: OK factorial 9: OK factorial 10: OK factorial 11: OK (0.02s) factorial 12: OK (0.03s) factorial 13: OK (0.07s) factorial 14: OK (0.17s) factorial 15: OK (0.39s) factorial 16: OK (0.71s) factorial 17: OK (1.89s) factorial 18: OK (3.31s) Sigma1 forward smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.03s) +++ OK, passed 100 tests. quickcheck Word: OK (0.02s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.02s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.02s) +++ OK, passed 100 tests. backward smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.02s) +++ OK, passed 100 tests. quickcheck Word: OK (0.01s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.02s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.02s) +++ OK, passed 100 tests. 200: OK count factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK factorial 6: OK factorial 7: OK factorial 8: OK factorial 9: OK factorial 10: OK factorial 11: OK (0.02s) factorial 12: OK (0.03s) factorial 13: OK (0.08s) factorial 14: OK (0.19s) factorial 15: OK (0.42s) factorial 16: OK (0.78s) factorial 17: OK (2.12s) factorial 18: OK (3.80s) min factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK factorial 6: OK factorial 7: OK factorial 8: OK factorial 9: OK (0.02s) factorial 10: OK (0.03s) factorial 11: OK (0.08s) factorial 12: OK (0.19s) factorial 13: OK (0.42s) factorial 14: OK (0.78s) factorial 15: OK (2.09s) factorial 16: OK (4.25s) max factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK factorial 6: OK factorial 7: OK factorial 8: OK factorial 9: OK (0.02s) factorial 10: OK (0.03s) factorial 11: OK (0.07s) factorial 12: OK (0.18s) factorial 13: OK (0.42s) factorial 14: OK (0.78s) factorial 15: OK (2.11s) factorial 16: OK (3.77s) Jordan forward smallcheck Integer: OK 25 tests completed smallcheck Natural: OK 25 tests completed quickcheck Integer: OK (1.89s) +++ OK, passed 100 tests. quickcheck Natural: OK (1.86s) +++ OK, passed 100 tests. backward smallcheck Integer: OK 25 tests completed smallcheck Natural: OK 25 tests completed quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. inverseJordan inverseJordan 51: OK inverseJordan 531: OK inverseJordan 5242: OK inverseJordan 5992: OK inverseJordan 53124: OK inverseJordan 57502: OK inverseJordan 516806: OK inverseJordan 531744: OK inverseJordan 558806: OK inverseJordan 596844: OK inverseJordan 5161050: OK inverseJordan 5240064: OK inverseJordan 5371292: OK inverseJordan 5520986: OK inverseJordan 5756008: OK inverseJordan 51015808: OK inverseJordan 51419856: OK inverseJordan 51822986: OK inverseJordan 52476098: OK inverseJordan 53099008: OK inverseJordan 54067052: OK inverseJordan 54992550: OK inverseJordan 56436342: OK inverseJordan 57682048: OK inverseJordan 59762500: OK inverseJordan 511510052: OK inverseJordan 514289858: OK inverseJordan 516671552: OK inverseJordan 520511148: OK SigmaK forward smallcheck Integer: OK 25 tests completed smallcheck Natural: OK 25 tests completed quickcheck Integer: OK (0.36s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.35s) +++ OK, passed 100 tests. backward smallcheck Integer: OK 25 tests completed smallcheck Natural: OK 25 tests completed quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. inverseSigma inverseSigma 51: OK inverseSigma 533: OK inverseSigma 5244: OK inverseSigma 51057: OK inverseSigma 53126: OK inverseSigma 58052: OK inverseSigma 516808: OK inverseSigma 533825: OK inverseSigma 559293: OK inverseSigma 5103158: OK inverseSigma 5161052: OK inverseSigma 5257908: OK inverseSigma 5371294: OK inverseSigma 5554664: OK inverseSigma 5762744: OK inverseSigma 51082401: OK inverseSigma 51419858: OK inverseSigma 51956669: OK inverseSigma 52476100: OK inverseSigma 53304182: OK inverseSigma 54101152: OK inverseSigma 55314716: OK inverseSigma 56436344: OK inverseSigma 58253300: OK inverseSigma 59768751: OK inverseSigma 512252702: OK inverseSigma 514408200: OK inverseSigma 517766056: OK inverseSigma 520511150: OK Mertens pointwise smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. block special smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. block unboxed smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. block boxed smallcheck: OK 36 tests completed quickcheck: OK +++ OK, passed 100 tests. SieveBlock pointwise divisors: OK (0.02s) tau: OK totient: OK moebius: OK smallOmega: OK bigOmega: OK carmichael: OK (0.02s) special moebius 1,1: OK 1,2: OK 208,298: OK 1,12835: OK 10956,4430: OK 65,16171: OK (0.01s) 120906,19456: OK (0.01s) 33800000,27002: OK (0.02s) 17266222643,5051: OK (0.05s) 1000158,48758: OK (0.03s) 1307265,3725: OK 2600000,14686: OK (0.01s) 4516141322507,100001: OK (0.78s) 1133551496949257,100001: OK (12.70s) UniqueFactorisation Int smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. Word smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Integer smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. Natural smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. GaussianInteger smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. EisensteinInteger smallcheck: OK 81 tests completed quickcheck: OK +++ OK, passed 100 tests. Montgomery range of newPoint: OK (0.42s) +++ OK, passed 1000 tests; 16061 discarded. range of double: OK (0.51s) +++ OK, passed 1000 tests; 15754 discarded. range of add: OK (0.65s) +++ OK, passed 1000 tests; 16413 discarded. range of multiply: OK (0.54s) +++ OK, passed 1000 tests; 15911 discarded. double matches multiply: OK (0.57s) +++ OK, passed 1000 tests; 16409 discarded. add matches multiply: OK (1.07s) +++ OK, passed 1000 tests; 27591 discarded. SmoothNumbers smoothOverInRange == smoothOverInRangeBF Int smallcheck: OK (2.11s) 2368 tests completed quickcheck: OK (0.11s) +++ OK, passed 100 tests. Word smallcheck: OK (0.17s) 656 tests completed quickcheck: OK (0.08s) +++ OK, passed 100 tests. Integer smallcheck: OK (2.11s) 2368 tests completed quickcheck: OK (0.12s) +++ OK, passed 100 tests. Natural smallcheck: OK (0.16s) 656 tests completed quickcheck: OK (0.09s) +++ OK, passed 100 tests. smoothOver generates a list without duplicates Integer smallcheck: OK (0.79s) 6665 tests completed quickcheck: OK (0.06s) +++ OK, passed 100 tests. Natural smallcheck: OK (0.04s) 1030 tests completed quickcheck: OK (0.05s) +++ OK, passed 100 tests. Quadratic rings smoothOver generates valid smooth numbers Gaussian smallcheck: OK 25 tests completed quickcheck: OK (0.29s) +++ OK, passed 100 tests. Eisenstein smallcheck: OK 25 tests completed quickcheck: OK (0.36s) +++ OK, passed 100 tests. all distinct for base [1+3*i,6+8*i]: OK 6 is smooth for base [4,3,6,10,7]: OK Diophantine Cornacchia correct smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. Cornacchia same solutions as brute force smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. Zeta Zeta zetasEven zeta(0): OK zeta(2): OK zeta(4): OK zeta(2n) > zeta(2n+2) smallcheck: OK 5 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. zetasEven matches zetas smallcheck: OK 5 tests completed quickcheck: OK (0.16s) +++ OK, passed 100 tests. zetas zeta(1): OK zeta(3): OK zeta(5): OK zeta(n) > zeta(n+1) smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. precision smallcheck: OK (0.18s) 36 tests completed quickcheck: OK (0.80s) +++ OK, passed 100 tests. Beta betasOdd beta(1): OK beta(3): OK beta(5): OK beta(2n-1) < beta(2n+1) smallcheck: OK 5 tests completed quickcheck: OK (0.18s) +++ OK, passed 100 tests. betasOdd matches betas smallcheck: OK 6 tests completed quickcheck: OK (0.78s) +++ OK, passed 100 tests. betas beta(0): OK beta(2): OK beta(4): OK beta(n) < beta(n+1) smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. precision smallcheck: OK (0.26s) 36 tests completed quickcheck: OK (1.52s) +++ OK, passed 100 tests. DirichletCharacters Dirichlet characters divide the right order smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. Dirichlet characters are multiplicative smallcheck: OK 1080 tests completed quickcheck: OK +++ OK, passed 100 tests. Dirichlet characters are 1 at 1 smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. Right number of Dirichlet characters smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. Principal character behaves as expected smallcheck: OK 25 tests completed quickcheck: OK +++ OK, passed 100 tests. Orthogonality relation 1 smallcheck: OK 30 tests completed quickcheck: OK (0.05s) +++ OK, passed 100 tests. Orthogonality relation 2 smallcheck: OK 55 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. Real character checking is correct smallcheck: OK 30 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. Real character evaluation is accurate smallcheck: OK (0.02s) 605 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. Jacobi character matches symbol smallcheck: OK 5 tests completed quickcheck: OK (0.12s) +++ OK, passed 100 tests. Bulk evaluation matches pointwise smallcheck: OK 30 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. Induced character is correct smallcheck: OK 150 tests completed quickcheck: OK (0.20s) +++ OK, passed 100 tests. Primitive character checking is correct smallcheck: OK 30 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. makePrimitive produces primitive character smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. makePrimitive is idempotent smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. Calculates correct order smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. Can construct from table smallcheck: OK 30 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. Creates valid characters indexToChar smallcheck: OK 30 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. principalChar smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. mulChars smallcheck: OK 180 tests completed quickcheck: OK +++ OK, passed 100 tests. stimesChar smallcheck: OK 330 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. succ smallcheck: OK 30 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. induced smallcheck: OK 150 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. jacobi smallcheck: OK 5 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. makePrimitive smallcheck: OK 30 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. RootOfUnity contains roots of unity smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. 16 out of 1169 tests failed (261.01s) Test suite arithmoi-tests: FAIL Test suite logged to: dist/test/arithmoi-0.13.2.0-arithmoi-tests.log 0 of 1 test suites (0 of 1 test cases) passed. ==> ERROR: A failure occurred in check(). Aborting... [!p]104[?7h]3008;end=721d25afd1ce471eb8ce614f74697a2b\==> ERROR: Build failed, check /var/lib/archbuild/extra-riscv64/felix-0/build [?25h[?25h[?25hreceiving incremental file list haskell-arithmoi-0.13.2.0-26-riscv64-build.log haskell-arithmoi-0.13.2.0-26-riscv64-check.log haskell-arithmoi-0.13.2.0-26-riscv64-prepare.log sent 81 bytes received 11,229 bytes 22,620.00 bytes/sec total size is 126,312 speedup is 11.17