1. 0.03 s $ /nix/store/vzx1mi9c0xfadmsm9dhd83d005cb1qs9-coreutils-9.8/bin/timeout --kill-after=15s 1800s /nix/store/99b1z08awpxj8b6mzggn59gp1shljnff-nix-2.34.5/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --log-format internal-json build --no-link git+https://github.com/sellout/duoids?ref=renovate%2Flock-file-maintenance&rev=efcb599e94b311c8c6f8c2a5caf56f3137bbef9a#packages.x86_64-linux.default --print-build-logs
  2. 0.06 s warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
  3. 0.06 s Pass '--accept-flake-config' to trust it
  4. 0.06 s warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
  5. 0.06 s Pass '--accept-flake-config' to trust it
  6. 0.06 s warning: ignoring untrusted flake configuration setting 'extra-substituters'.
  7. 0.06 s Pass '--accept-flake-config' to trust it
  8. 0.06 s warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
  9. 0.06 s Pass '--accept-flake-config' to trust it
  10. 0.06 s warning: ignoring untrusted flake configuration setting 'sandbox'.
  11. 0.06 s Pass '--accept-flake-config' to trust it
  12. 0.06 s warning: ignoring untrusted flake configuration setting 'use-registries'.
  13. 0.06 s Pass '--accept-flake-config' to trust it
  14. 0.07 s error (ignored): SQLite database '/var/cache/private/nix-ci-worker/eval-cache-v6/19f80154faf27ddfad5dcb3251253294aea6c838e143ff7a5a949b25d9d532ff.sqlite' is busy
  15. 0.38 s 'system' has been renamed to/replaced by 'stdenv.hostPlatform.system'
  16. 1.19 s
  17. 1.22 s Building cabal2nix-algebraic-graph-duoids
  18. 1.31 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/f5pw8895liyw89qjx9a0jpa2nsbkkg5s-cabal2nix-algebraic-graph-duoids
  19. 1.76 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  20. 1.78 s [post-build-hook] Uploading to the NixCI cache: /nix/store/f5pw8895liyw89qjx9a0jpa2nsbkkg5s-cabal2nix-algebraic-graph-duoids
  21. 1.85 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22. 2.41 s [post-build-hook] copying 1 paths...
  23. 2.41 s [post-build-hook] copying path '/nix/store/f5pw8895liyw89qjx9a0jpa2nsbkkg5s-cabal2nix-algebraic-graph-duoids' to 'https://cache.nix-ci.com'...
  24. 3.21 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  25. 4.77 s [post-build-hook] copying 0 paths...
  26. 4.79 s Progress: 1 of 2 built
  27. 4.79 s
  28. 4.81 s Building cabal2nix-duoidal-transformers
  29. 4.88 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/1bbk5wy9cgafqk6l628446r4pai2ldpm-cabal2nix-duoidal-transformers
  30. 5.31 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  31. 5.33 s [post-build-hook] Uploading to the NixCI cache: /nix/store/1bbk5wy9cgafqk6l628446r4pai2ldpm-cabal2nix-duoidal-transformers
  32. 5.39 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  33. 5.62 s [post-build-hook] copying 1 paths...
  34. 5.62 s [post-build-hook] copying path '/nix/store/1bbk5wy9cgafqk6l628446r4pai2ldpm-cabal2nix-duoidal-transformers' to 'https://cache.nix-ci.com'...
  35. 5.76 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  36. 5.94 s [post-build-hook] copying 0 paths...
  37. 5.95 s Progress: 1 of 2 built
  38. 5.96 s
  39. 5.98 s Building cabal2nix-duoids
  40. 6.05 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/8cvsa25gmfb4x0lc0fmq7qkk8mdx5ybw-cabal2nix-duoids
  41. 6.48 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  42. 6.49 s [post-build-hook] Uploading to the NixCI cache: /nix/store/8cvsa25gmfb4x0lc0fmq7qkk8mdx5ybw-cabal2nix-duoids
  43. 6.53 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  44. 6.74 s [post-build-hook] copying 1 paths...
  45. 6.74 s [post-build-hook] copying path '/nix/store/8cvsa25gmfb4x0lc0fmq7qkk8mdx5ybw-cabal2nix-duoids' to 'https://cache.nix-ci.com'...
  46. 6.85 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  47. 6.99 s [post-build-hook] copying 0 paths...
  48. 7.01 s Progress: 1 of 2 built
  49. 7.01 s
  50. 7.04 s Building cabal2nix-duoids-hedgehog
  51. 7.10 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/xksxzim591rvs6p53cas0vg2wzzw3l6d-cabal2nix-duoids-hedgehog
  52. 7.66 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  53. 7.68 s [post-build-hook] Uploading to the NixCI cache: /nix/store/xksxzim591rvs6p53cas0vg2wzzw3l6d-cabal2nix-duoids-hedgehog
  54. 7.72 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  55. 7.92 s [post-build-hook] copying 1 paths...
  56. 7.92 s [post-build-hook] copying path '/nix/store/xksxzim591rvs6p53cas0vg2wzzw3l6d-cabal2nix-duoids-hedgehog' to 'https://cache.nix-ci.com'...
  57. 8.03 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  58. 8.17 s [post-build-hook] copying 0 paths...
  59. 8.18 s Progress: 1 of 2 built
  60. 8.31 s
  61. 8.38 s Building cabal2nix-ghc-compat-plugin
  62. 8.61 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/xcc8s03jf1n5kcylzqvgvnib8l6ka1ly-cabal2nix-ghc-compat-plugin
  63. 9.08 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  64. 9.10 s [post-build-hook] Uploading to the NixCI cache: /nix/store/xcc8s03jf1n5kcylzqvgvnib8l6ka1ly-cabal2nix-ghc-compat-plugin
  65. 9.14 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  66. 9.36 s [post-build-hook] copying 1 paths...
  67. 9.36 s [post-build-hook] copying path '/nix/store/xcc8s03jf1n5kcylzqvgvnib8l6ka1ly-cabal2nix-ghc-compat-plugin' to 'https://cache.nix-ci.com'...
  68. 9.46 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  69. 9.61 s [post-build-hook] copying 0 paths...
  70. 9.63 s Progress: 1 of 2 built
  71. 9.68 s
  72. 12.01 s Downloading cached colour-2.3.6-data from https://cache.nix-ci.com
  73. 12.01 s Downloading cached die-hook from https://cache.nix-ci.com
  74. 12.05 s Downloading cached pretty-show-1.10-data from https://cache.nix-ci.com
  75. 12.05 s Downloading cached ghc-9.10.3-doc from https://cache.nix-ci.com
  76. 12.05 s Downloading cached lndir from https://cache.nix-ci.com
  77. 12.05 s Downloading cached ncurses-6.5-man from https://cache.nix-ci.com
  78. 12.05 s Downloading cached setup-debug-info-dirs-hook from https://cache.nix-ci.com
  79. 12.05 s Downloading cached gmp-with-cxx-6.3.0-dev from https://cache.nix-ci.com
  80. 12.05 s Downloading cached libffi-3.5.2-dev from https://cache.nix-ci.com
  81. 12.05 s Downloading cached numactl-2.0.18-dev from https://cache.nix-ci.com
  82. 12.05 s Building builder.pl
  83. 12.05 s Downloading cached algebraic-graphs-0.7-allow-inspection-testing from https://cache.nix-ci.com
  84. 12.05 s Downloading cached algebraic-graphs-0.7-r3.cabal from https://cache.nix-ci.com
  85. 12.05 s Downloading cached algebraic-graphs from https://cache.nix-ci.com
  86. 12.05 s Downloading cached dns-root-data-2025-04 from https://cache.nix-ci.com
  87. 12.05 s Downloading cached hscolour from https://cache.nix-ci.com
  88. 12.05 s Downloading cached libtasn1 from https://cache.nix-ci.com
  89. 12.10 s Building haskell-generic-builder-test-wrapper.sh
  90. 12.14 s Progress: 0 of 107 built (2 building), 1 of 193 downloaded from cache (15 downloading)
  91. 12.14 s Progress: 0 of 107 built (2 building), 2 of 193 downloaded from cache (14 downloading)
  92. 12.14 s Progress: 0 of 107 built (2 building), 3 of 193 downloaded from cache (13 downloading)
  93. 12.14 s Progress: 0 of 107 built (2 building), 4 of 193 downloaded from cache (12 downloading)
  94. 12.14 s Progress: 0 of 107 built (2 building), 5 of 193 downloaded from cache (11 downloading)
  95. 12.14 s Progress: 0 of 107 built (2 building), 6 of 193 downloaded from cache (10 downloading)
  96. 12.14 s Progress: 0 of 107 built (2 building), 7 of 193 downloaded from cache (9 downloading)
  97. 12.14 s Progress: 0 of 107 built (2 building), 8 of 193 downloaded from cache (8 downloading)
  98. 12.14 s Progress: 0 of 107 built (2 building), 9 of 193 downloaded from cache (7 downloading)
  99. 12.14 s [builder.pl] Phase: patchPhase
  100. 12.14 s [builder.pl] Phase: updateAutotoolsGnuConfigScriptsPhase
  101. 12.14 s [builder.pl] Phase: configurePhase
  102. 12.14 s [builder.pl] no configure script, doing nothing
  103. 12.14 s [builder.pl] Phase: buildPhase
  104. 12.14 s [builder.pl] Phase: checkPhase
  105. 12.14 s [builder.pl] Phase: installPhase
  106. 12.14 s [builder.pl] no Makefile or custom installPhase, doing nothing
  107. 12.14 s [builder.pl] Phase: fixupPhase
  108. 12.14 s [builder.pl] shrinking RPATHs of ELF executables and libraries in /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl
  109. 12.14 s [builder.pl] checking for references to /build/ in /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl...
  110. 12.14 s Downloading cached cabal-doctest from https://cache.nix-ci.com
  111. 12.14 s Downloading cached doctest from https://cache.nix-ci.com
  112. 12.14 s Downloading cached extra from https://cache.nix-ci.com
  113. 12.14 s Downloading cached ghc-paths-0.1.0.12-r8.cabal from https://cache.nix-ci.com
  114. 12.14 s Downloading cached ghc-paths from https://cache.nix-ci.com
  115. 12.14 s Downloading cached jailbreak-cabal from https://cache.nix-ci.com
  116. 12.14 s Downloading cached libevent from https://cache.nix-ci.com
  117. 12.14 s Downloading cached nettle from https://cache.nix-ci.com
  118. 12.14 s Downloading cached nothunks-0.3.1-r1.cabal from https://cache.nix-ci.com
  119. 12.15 s [builder.pl] patching script interpreter paths in /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl
  120. 12.17 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/j7sa9rqsbgy8iq0bvk19y8qk5jny5wcq-haskell-generic-builder-test-wrapper.sh
  121. 12.67 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  122. 12.69 s [post-build-hook] Uploading to the NixCI cache: /nix/store/j7sa9rqsbgy8iq0bvk19y8qk5jny5wcq-haskell-generic-builder-test-wrapper.sh
  123. 12.73 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  124. 13.08 s [post-build-hook] copying 0 paths...
  125. 13.14 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  126. 13.17 s [post-build-hook] copying 0 paths...
  127. 13.18 s Progress: 1 of 105 built (1 building), 9 of 193 downloaded from cache (16 downloading)
  128. 13.18 s Progress: 1 of 104 built (1 building), 10 of 193 downloaded from cache (15 downloading)
  129. 13.18 s Progress: 1 of 104 built (1 building), 11 of 193 downloaded from cache (14 downloading)
  130. 13.18 s Progress: 1 of 104 built (1 building), 12 of 193 downloaded from cache (13 downloading)
  131. 13.18 s Progress: 1 of 104 built (1 building), 13 of 193 downloaded from cache (12 downloading)
  132. 13.18 s Progress: 1 of 104 built (1 building), 14 of 193 downloaded from cache (11 downloading)
  133. 13.18 s Progress: 1 of 104 built (1 building), 15 of 193 downloaded from cache (10 downloading)
  134. 13.18 s Progress: 1 of 104 built (1 building), 16 of 193 downloaded from cache (9 downloading)
  135. 13.18 s Progress: 1 of 104 built (1 building), 17 of 193 downloaded from cache (8 downloading)
  136. 13.18 s Progress: 1 of 104 built (1 building), 18 of 193 downloaded from cache (7 downloading)
  137. 13.18 s Progress: 1 of 104 built (1 building), 19 of 193 downloaded from cache (6 downloading)
  138. 13.18 s Progress: 1 of 104 built (1 building), 20 of 193 downloaded from cache (5 downloading)
  139. 13.18 s Progress: 1 of 104 built (1 building), 21 of 193 downloaded from cache (4 downloading)
  140. 13.18 s Progress: 1 of 104 built (1 building), 22 of 193 downloaded from cache (3 downloading)
  141. 13.18 s Progress: 1 of 104 built (1 building), 23 of 193 downloaded from cache (2 downloading)
  142. 13.18 s Progress: 1 of 104 built (1 building), 24 of 193 downloaded from cache (1 downloading)
  143. 13.20 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl
  144. 19.03 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  145. 19.07 s [post-build-hook] Uploading to the NixCI cache: /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl
  146. 19.10 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  147. 19.26 s [post-build-hook] copying 0 paths...
  148. 19.34 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  149. 19.38 s [post-build-hook] copying 0 paths...
  150. 19.39 s Progress: 2 of 105 built, 24 of 193 downloaded from cache (1 downloading)
  151. 19.39 s Downloading cached make-shell-wrapper-hook from https://cache.nix-ci.com
  152. 19.39 s Downloading cached nothunks from https://cache.nix-ci.com
  153. 19.39 s Downloading cached p11-kit from https://cache.nix-ci.com
  154. 19.39 s Downloading cached quickcheck-instances-0.3.33-r1.cabal from https://cache.nix-ci.com
  155. 19.39 s Downloading cached quickcheck-instances from https://cache.nix-ci.com
  156. 19.39 s Downloading cached remove-references-to from https://cache.nix-ci.com
  157. 19.39 s Downloading cached unordered-containers from https://cache.nix-ci.com
  158. 19.39 s Downloading cached vector-0.13.2.0-r2.cabal from https://cache.nix-ci.com
  159. 19.39 s Downloading cached vector from https://cache.nix-ci.com
  160. 19.39 s Downloading cached ncurses-6.5-dev from https://cache.nix-ci.com
  161. 19.39 s Downloading cached unbound-1.24.2-lib from https://cache.nix-ci.com
  162. 19.40 s Progress: 2 of 95 built, 25 of 193 downloaded from cache (11 downloading)
  163. 19.40 s Downloading cached Cabal-syntax-3.12.1.0-doc from https://cache.nix-ci.com
  164. 19.40 s Downloading cached OneTuple-0.4.2-doc from https://cache.nix-ci.com
  165. 19.40 s Downloading cached assoc-1.1.1-doc from https://cache.nix-ci.com
  166. 19.40 s Downloading cached base-compat-0.14.1-doc from https://cache.nix-ci.com
  167. 19.40 s Downloading cached base-orphans-0.9.3-doc from https://cache.nix-ci.com
  168. 19.49 s Progress: 2 of 94 built, 26 of 193 downloaded from cache (15 downloading)
  169. 19.49 s Downloading cached call-stack-0.4.0-doc from https://cache.nix-ci.com
  170. 19.49 s Progress: 2 of 93 built, 27 of 193 downloaded from cache (15 downloading)
  171. 19.49 s Downloading cached clock-0.8.4-doc from https://cache.nix-ci.com
  172. 19.49 s Progress: 2 of 92 built, 28 of 193 downloaded from cache (15 downloading)
  173. 19.49 s Downloading cached code-page-0.2.1-doc from https://cache.nix-ci.com
  174. 19.50 s Progress: 2 of 91 built, 29 of 193 downloaded from cache (15 downloading)
  175. 19.50 s Downloading cached colour-2.3.6-doc from https://cache.nix-ci.com
  176. 19.52 s Progress: 2 of 90 built, 30 of 193 downloaded from cache (15 downloading)
  177. 19.52 s Downloading cached erf-2.0.0.0-doc from https://cache.nix-ci.com
  178. 19.52 s Progress: 2 of 89 built, 31 of 193 downloaded from cache (15 downloading)
  179. 19.52 s Downloading cached ghc-compat-plugin-0.1.0.1-doc from https://cache.nix-ci.com
  180. 19.52 s Progress: 2 of 88 built, 32 of 193 downloaded from cache (15 downloading)
  181. 19.52 s Downloading cached hashable-1.5.0.0-doc from https://cache.nix-ci.com
  182. 19.53 s Progress: 2 of 87 built, 33 of 193 downloaded from cache (15 downloading)
  183. 19.53 s Downloading cached haskell-lexer-1.2.1-doc from https://cache.nix-ci.com
  184. 19.53 s Progress: 2 of 86 built, 34 of 193 downloaded from cache (15 downloading)
  185. 19.53 s Downloading cached hspec-discover-2.11.14-doc from https://cache.nix-ci.com
  186. 19.53 s Progress: 2 of 86 built, 35 of 193 downloaded from cache (15 downloading)
  187. 19.53 s Downloading cached inspection-testing-0.6.2-doc from https://cache.nix-ci.com
  188. 19.54 s Progress: 2 of 86 built, 36 of 193 downloaded from cache (15 downloading)
  189. 19.54 s Downloading cached integer-logarithms-1.0.4-doc from https://cache.nix-ci.com
  190. 19.55 s Progress: 2 of 86 built, 37 of 193 downloaded from cache (15 downloading)
  191. 19.55 s Downloading cached mmorph-1.2.1-doc from https://cache.nix-ci.com
  192. 19.57 s Progress: 2 of 86 built, 38 of 193 downloaded from cache (15 downloading)
  193. 19.57 s Downloading cached old-locale-1.0.0.7-doc from https://cache.nix-ci.com
  194. 19.59 s Progress: 2 of 86 built, 39 of 193 downloaded from cache (15 downloading)
  195. 19.59 s Downloading cached prettyprinter-1.7.1-doc from https://cache.nix-ci.com
  196. 19.68 s Progress: 2 of 86 built, 40 of 193 downloaded from cache (15 downloading)
  197. 19.68 s Downloading cached primitive-0.9.1.0-doc from https://cache.nix-ci.com
  198. 19.71 s Progress: 2 of 86 built, 41 of 193 downloaded from cache (15 downloading)
  199. 19.71 s Downloading cached Cabal-3.12.1.0-doc from https://cache.nix-ci.com
  200. 19.71 s Progress: 2 of 86 built, 42 of 193 downloaded from cache (15 downloading)
  201. 19.71 s Downloading cached safe-exceptions-0.1.7.4-doc from https://cache.nix-ci.com
  202. 19.72 s Progress: 2 of 86 built, 43 of 193 downloaded from cache (15 downloading)
  203. 19.72 s Downloading cached HUnit-1.6.2.0-doc from https://cache.nix-ci.com
  204. 19.74 s Progress: 2 of 86 built, 44 of 193 downloaded from cache (15 downloading)
  205. 19.74 s Downloading cached ansi-terminal-types-1.1.3-doc from https://cache.nix-ci.com
  206. 19.74 s Progress: 2 of 86 built, 45 of 193 downloaded from cache (15 downloading)
  207. 19.74 s Downloading cached async-2.2.5-doc from https://cache.nix-ci.com
  208. 19.75 s Progress: 2 of 86 built, 46 of 193 downloaded from cache (15 downloading)
  209. 19.75 s Downloading cached case-insensitive-1.2.1.0-doc from https://cache.nix-ci.com
  210. 19.76 s Progress: 2 of 86 built, 47 of 193 downloaded from cache (15 downloading)
  211. 19.76 s Downloading cached data-fix-0.3.4-doc from https://cache.nix-ci.com
  212. 19.76 s Progress: 2 of 86 built, 48 of 193 downloaded from cache (15 downloading)
  213. 19.76 s Downloading cached logging-facade-0.3.1-doc from https://cache.nix-ci.com
  214. 19.76 s Progress: 2 of 86 built, 49 of 193 downloaded from cache (15 downloading)
  215. 19.76 s Downloading cached old-time-1.1.0.4-doc from https://cache.nix-ci.com
  216. 19.78 s Progress: 2 of 86 built, 50 of 193 downloaded from cache (15 downloading)
  217. 19.78 s Downloading cached pretty-show-1.10-doc from https://cache.nix-ci.com
  218. 19.80 s Progress: 2 of 86 built, 51 of 193 downloaded from cache (15 downloading)
  219. 19.80 s Downloading cached silently-1.2.5.4-doc from https://cache.nix-ci.com
  220. 19.81 s Progress: 2 of 86 built, 52 of 193 downloaded from cache (15 downloading)
  221. 19.81 s Downloading cached splitmix-0.1.3.1-doc from https://cache.nix-ci.com
  222. 19.83 s Progress: 2 of 86 built, 53 of 193 downloaded from cache (15 downloading)
  223. 19.83 s Downloading cached scientific-0.3.8.0-doc from https://cache.nix-ci.com
  224. 19.84 s Progress: 2 of 86 built, 54 of 193 downloaded from cache (15 downloading)
  225. 19.84 s Downloading cached stringbuilder-0.5.1-doc from https://cache.nix-ci.com
  226. 19.85 s Progress: 2 of 86 built, 55 of 193 downloaded from cache (15 downloading)
  227. 19.85 s Downloading cached gnutls from https://cache.nix-ci.com
  228. 19.92 s Progress: 2 of 86 built, 56 of 193 downloaded from cache (15 downloading)
  229. 19.92 s Downloading cached syb-0.7.2.4-doc from https://cache.nix-ci.com
  230. 19.94 s Progress: 2 of 86 built, 57 of 193 downloaded from cache (15 downloading)
  231. 19.94 s Downloading cached tagged-0.8.9-doc from https://cache.nix-ci.com
  232. 19.94 s Progress: 2 of 86 built, 58 of 193 downloaded from cache (15 downloading)
  233. 19.94 s Downloading cached terminal-size-0.3.4-doc from https://cache.nix-ci.com
  234. 19.94 s Progress: 2 of 86 built, 59 of 193 downloaded from cache (15 downloading)
  235. 19.94 s Downloading cached hspec-expectations-0.8.4-doc from https://cache.nix-ci.com
  236. 19.94 s Progress: 2 of 86 built, 60 of 193 downloaded from cache (15 downloading)
  237. 19.94 s Downloading cached ansi-terminal-1.1.3-doc from https://cache.nix-ci.com
  238. 19.94 s Progress: 2 of 86 built, 61 of 193 downloaded from cache (15 downloading)
  239. 19.95 s Downloading cached text-short-0.1.6-doc from https://cache.nix-ci.com
  240. 19.95 s Progress: 2 of 86 built, 62 of 193 downloaded from cache (15 downloading)
  241. 19.95 s Downloading cached these-1.2.1-doc from https://cache.nix-ci.com
  242. 19.96 s Progress: 2 of 86 built, 63 of 193 downloaded from cache (15 downloading)
  243. 19.96 s Downloading cached time-compat-1.9.8-doc from https://cache.nix-ci.com
  244. 19.97 s Progress: 2 of 86 built, 64 of 193 downloaded from cache (15 downloading)
  245. 19.97 s Downloading cached transformers-base-0.4.6-doc from https://cache.nix-ci.com
  246. 19.98 s Progress: 2 of 86 built, 65 of 193 downloaded from cache (15 downloading)
  247. 19.98 s Downloading cached transformers-compat-0.7.2-doc from https://cache.nix-ci.com
  248. 19.98 s Progress: 2 of 86 built, 66 of 193 downloaded from cache (15 downloading)
  249. 19.98 s Downloading cached unliftio-core-0.2.1.0-doc from https://cache.nix-ci.com
  250. 19.99 s Progress: 2 of 86 built, 67 of 193 downloaded from cache (15 downloading)
  251. 19.99 s Downloading cached random-1.2.1.3-doc from https://cache.nix-ci.com
  252. 19.99 s Progress: 2 of 86 built, 68 of 193 downloaded from cache (15 downloading)
  253. 19.99 s Downloading cached vector-stream-0.1.0.1-doc from https://cache.nix-ci.com
  254. 20.03 s Progress: 2 of 86 built, 69 of 193 downloaded from cache (15 downloading)
  255. 20.03 s Downloading cached wherefrom-compat-0.1.1.1-doc from https://cache.nix-ci.com
  256. 20.04 s Progress: 2 of 86 built, 70 of 193 downloaded from cache (15 downloading)
  257. 20.04 s Downloading cached wl-pprint-annotated-0.1.0.1-doc from https://cache.nix-ci.com
  258. 20.04 s Progress: 2 of 86 built, 71 of 193 downloaded from cache (15 downloading)
  259. 20.04 s Downloading cached boring-0.2.2-doc from https://cache.nix-ci.com
  260. 20.04 s Progress: 2 of 86 built, 72 of 193 downloaded from cache (15 downloading)
  261. 20.04 s Downloading cached distributive-0.6.2.1-doc from https://cache.nix-ci.com
  262. 20.04 s Progress: 2 of 86 built, 73 of 193 downloaded from cache (15 downloading)
  263. 20.05 s Progress: 2 of 86 built, 74 of 193 downloaded from cache (14 downloading)
  264. 20.05 s Downloading cached concurrent-output-1.10.21-doc from https://cache.nix-ci.com
  265. 20.05 s Downloading cached prettyprinter-ansi-terminal-1.1.3-doc from https://cache.nix-ci.com
  266. 20.05 s Progress: 2 of 86 built, 75 of 193 downloaded from cache (15 downloading)
  267. 20.06 s Downloading cached strict-0.5.1-doc from https://cache.nix-ci.com
  268. 20.06 s Progress: 2 of 86 built, 76 of 193 downloaded from cache (15 downloading)
  269. 20.06 s Progress: 2 of 86 built, 77 of 193 downloaded from cache (14 downloading)
  270. 20.06 s Downloading cached libmicrohttpd from https://cache.nix-ci.com
  271. 20.07 s Progress: 2 of 86 built, 78 of 193 downloaded from cache (14 downloading)
  272. 20.07 s Downloading cached monad-control-1.0.3.1-doc from https://cache.nix-ci.com
  273. 20.07 s Progress: 2 of 86 built, 79 of 193 downloaded from cache (14 downloading)
  274. 20.09 s Progress: 2 of 86 built, 80 of 193 downloaded from cache (13 downloading)
  275. 20.09 s Progress: 2 of 86 built, 81 of 193 downloaded from cache (12 downloading)
  276. 20.09 s Downloading cached resourcet-1.3.0-doc from https://cache.nix-ci.com
  277. 20.10 s Progress: 2 of 86 built, 82 of 193 downloaded from cache (12 downloading)
  278. 20.10 s Progress: 2 of 86 built, 83 of 193 downloaded from cache (11 downloading)
  279. 20.10 s Downloading cached QuickCheck-2.15.0.1-doc from https://cache.nix-ci.com
  280. 20.10 s Downloading cached temporary-1.3-doc from https://cache.nix-ci.com
  281. 20.10 s Downloading cached tf-random-0.5-doc from https://cache.nix-ci.com
  282. 20.10 s Downloading cached uuid-types-1.0.6-doc from https://cache.nix-ci.com
  283. 20.10 s Progress: 2 of 86 built, 84 of 193 downloaded from cache (14 downloading)
  284. 20.13 s Progress: 2 of 86 built, 85 of 193 downloaded from cache (13 downloading)
  285. 20.13 s Downloading cached constraints-0.14.2-doc from https://cache.nix-ci.com
  286. 20.14 s Progress: 2 of 86 built, 86 of 193 downloaded from cache (13 downloading)
  287. 20.14 s Downloading cached barbies-2.1.1.0-doc from https://cache.nix-ci.com
  288. 20.14 s Progress: 2 of 86 built, 87 of 193 downloaded from cache (13 downloading)
  289. 20.14 s Downloading cached optparse-applicative-0.18.1.0-doc from https://cache.nix-ci.com
  290. 20.14 s Progress: 2 of 86 built, 88 of 193 downloaded from cache (13 downloading)
  291. 20.15 s Progress: 2 of 86 built, 89 of 193 downloaded from cache (12 downloading)
  292. 20.15 s Downloading cached elfutils-0.194-bin from https://cache.nix-ci.com
  293. 20.15 s Progress: 2 of 86 built, 90 of 193 downloaded from cache (12 downloading)
  294. 20.15 s Progress: 2 of 86 built, 91 of 193 downloaded from cache (11 downloading)
  295. 20.15 s Downloading cached lifted-base-0.2.3.12-doc from https://cache.nix-ci.com
  296. 20.19 s Progress: 2 of 86 built, 92 of 193 downloaded from cache (11 downloading)
  297. 20.21 s Progress: 2 of 86 built, 93 of 193 downloaded from cache (10 downloading)
  298. 20.21 s Progress: 2 of 86 built, 94 of 193 downloaded from cache (9 downloading)
  299. 20.21 s Progress: 2 of 86 built, 95 of 193 downloaded from cache (8 downloading)
  300. 20.21 s Downloading cached mockery-0.3.5-doc from https://cache.nix-ci.com
  301. 20.23 s Progress: 2 of 86 built, 96 of 193 downloaded from cache (8 downloading)
  302. 20.23 s Downloading cached ChasingBottoms-1.3.1.17-doc from https://cache.nix-ci.com
  303. 20.23 s Downloading cached quickcheck-io-0.2.0-doc from https://cache.nix-ci.com
  304. 20.23 s Progress: 2 of 86 built, 97 of 193 downloaded from cache (9 downloading)
  305. 20.23 s Progress: 2 of 86 built, 98 of 193 downloaded from cache (8 downloading)
  306. 20.25 s Progress: 2 of 86 built, 99 of 193 downloaded from cache (7 downloading)
  307. 20.27 s Progress: 2 of 86 built, 100 of 193 downloaded from cache (6 downloading)
  308. 20.27 s Downloading cached lifted-async-0.10.2.7-doc from https://cache.nix-ci.com
  309. 20.27 s Progress: 2 of 86 built, 101 of 193 downloaded from cache (6 downloading)
  310. 20.27 s Downloading cached tasty-1.5.3-doc from https://cache.nix-ci.com
  311. 20.29 s Progress: 2 of 86 built, 102 of 193 downloaded from cache (6 downloading)
  312. 20.29 s Downloading cached elfutils-0.194-dev from https://cache.nix-ci.com
  313. 20.32 s Progress: 2 of 86 built, 103 of 193 downloaded from cache (6 downloading)
  314. 20.32 s Progress: 2 of 86 built, 104 of 193 downloaded from cache (5 downloading)
  315. 20.32 s Downloading cached hspec-core-2.11.14-doc from https://cache.nix-ci.com
  316. 20.35 s Progress: 2 of 86 built, 105 of 193 downloaded from cache (5 downloading)
  317. 20.35 s Downloading cached ghc from https://cache.nix-ci.com
  318. 20.37 s Progress: 2 of 86 built, 106 of 193 downloaded from cache (5 downloading)
  319. 20.40 s Progress: 2 of 86 built, 107 of 193 downloaded from cache (4 downloading)
  320. 20.40 s Downloading cached hspec-2.11.14-doc from https://cache.nix-ci.com
  321. 20.42 s Progress: 2 of 86 built, 108 of 193 downloaded from cache (4 downloading)
  322. 20.44 s Progress: 2 of 86 built, 109 of 193 downloaded from cache (3 downloading)
  323. 20.44 s Downloading cached hedgehog-1.5-doc from https://cache.nix-ci.com
  324. 20.45 s Progress: 2 of 86 built, 110 of 193 downloaded from cache (3 downloading)
  325. 20.45 s Downloading cached tasty-hunit-0.10.2-doc from https://cache.nix-ci.com
  326. 20.45 s Downloading cached tasty-inspection-testing-0.2.1-doc from https://cache.nix-ci.com
  327. 20.45 s Downloading cached tasty-quickcheck-0.11.1-doc from https://cache.nix-ci.com
  328. 20.47 s Progress: 2 of 86 built, 111 of 193 downloaded from cache (5 downloading)
  329. 20.53 s Progress: 2 of 86 built, 112 of 193 downloaded from cache (4 downloading)
  330. 20.62 s Progress: 2 of 86 built, 113 of 193 downloaded from cache (3 downloading)
  331. 20.63 s Progress: 2 of 86 built, 114 of 193 downloaded from cache (2 downloading)
  332. 20.68 s Progress: 2 of 86 built, 115 of 193 downloaded from cache (1 downloading)
  333. 20.68 s Downloading cached tasty-hedgehog-1.4.0.2-doc from https://cache.nix-ci.com
  334. 20.83 s Progress: 2 of 86 built, 116 of 193 downloaded from cache (1 downloading)
  335. 37.16 s Progress: 2 of 86 built, 117 of 193 downloaded from cache
  336. 37.16 s Downloading cached Cabal-syntax from https://cache.nix-ci.com
  337. 37.24 s Downloading cached OneTuple from https://cache.nix-ci.com
  338. 37.24 s Downloading cached assoc from https://cache.nix-ci.com
  339. 37.24 s Downloading cached base-compat from https://cache.nix-ci.com
  340. 37.24 s Downloading cached base-orphans from https://cache.nix-ci.com
  341. 37.24 s Downloading cached call-stack from https://cache.nix-ci.com
  342. 37.24 s Downloading cached clock from https://cache.nix-ci.com
  343. 37.24 s Downloading cached code-page from https://cache.nix-ci.com
  344. 37.24 s Downloading cached colour from https://cache.nix-ci.com
  345. 37.24 s Downloading cached erf from https://cache.nix-ci.com
  346. 37.24 s Downloading cached hashable from https://cache.nix-ci.com
  347. 37.24 s Downloading cached ghc-compat-plugin from https://cache.nix-ci.com
  348. 37.24 s Downloading cached haskell-lexer from https://cache.nix-ci.com
  349. 37.25 s Downloading cached inspection-testing from https://cache.nix-ci.com
  350. 37.25 s Downloading cached hspec-discover from https://cache.nix-ci.com
  351. 37.25 s Downloading cached integer-logarithms from https://cache.nix-ci.com
  352. 37.33 s Progress: 2 of 85 built, 118 of 193 downloaded from cache (15 downloading)
  353. 37.33 s Downloading cached old-locale from https://cache.nix-ci.com
  354. 37.35 s Progress: 2 of 85 built, 119 of 193 downloaded from cache (15 downloading)
  355. 37.35 s Downloading cached HUnit from https://cache.nix-ci.com
  356. 37.35 s Progress: 2 of 84 built, 120 of 193 downloaded from cache (15 downloading)
  357. 37.35 s Downloading cached logging-facade from https://cache.nix-ci.com
  358. 37.40 s Progress: 2 of 84 built, 121 of 193 downloaded from cache (15 downloading)
  359. 37.40 s Downloading cached prettyprinter from https://cache.nix-ci.com
  360. 37.40 s Progress: 2 of 84 built, 122 of 193 downloaded from cache (15 downloading)
  361. 37.41 s Downloading cached primitive from https://cache.nix-ci.com
  362. 37.43 s Progress: 2 of 83 built, 123 of 193 downloaded from cache (15 downloading)
  363. 37.43 s Downloading cached safe-exceptions from https://cache.nix-ci.com
  364. 37.43 s Progress: 2 of 82 built, 124 of 193 downloaded from cache (15 downloading)
  365. 37.43 s Downloading cached silently from https://cache.nix-ci.com
  366. 37.44 s Progress: 2 of 81 built, 125 of 193 downloaded from cache (15 downloading)
  367. 37.44 s Downloading cached async from https://cache.nix-ci.com
  368. 37.44 s Progress: 2 of 80 built, 126 of 193 downloaded from cache (15 downloading)
  369. 37.44 s Downloading cached case-insensitive from https://cache.nix-ci.com
  370. 37.45 s Progress: 2 of 79 built, 127 of 193 downloaded from cache (15 downloading)
  371. 37.45 s Downloading cached data-fix from https://cache.nix-ci.com
  372. 37.45 s Progress: 2 of 78 built, 128 of 193 downloaded from cache (15 downloading)
  373. 37.45 s Downloading cached splitmix from https://cache.nix-ci.com
  374. 37.46 s Progress: 2 of 77 built, 129 of 193 downloaded from cache (15 downloading)
  375. 37.46 s Downloading cached ansi-terminal-types from https://cache.nix-ci.com
  376. 37.48 s Progress: 2 of 76 built, 130 of 193 downloaded from cache (15 downloading)
  377. 37.48 s Downloading cached stringbuilder from https://cache.nix-ci.com
  378. 37.48 s Progress: 2 of 75 built, 131 of 193 downloaded from cache (15 downloading)
  379. 37.48 s Downloading cached syb from https://cache.nix-ci.com
  380. 37.48 s Progress: 2 of 74 built, 132 of 193 downloaded from cache (15 downloading)
  381. 37.48 s Downloading cached pretty-show from https://cache.nix-ci.com
  382. 37.53 s Progress: 2 of 73 built, 133 of 193 downloaded from cache (15 downloading)
  383. 37.53 s Downloading cached tagged from https://cache.nix-ci.com
  384. 37.53 s Progress: 2 of 73 built, 134 of 193 downloaded from cache (15 downloading)
  385. 37.53 s Downloading cached terminal-size from https://cache.nix-ci.com
  386. 37.55 s Progress: 2 of 72 built, 135 of 193 downloaded from cache (15 downloading)
  387. 37.55 s Downloading cached hspec-expectations from https://cache.nix-ci.com
  388. 37.59 s Progress: 2 of 71 built, 136 of 193 downloaded from cache (15 downloading)
  389. 37.59 s Downloading cached text-short from https://cache.nix-ci.com
  390. 37.63 s Progress: 2 of 70 built, 137 of 193 downloaded from cache (15 downloading)
  391. 37.63 s Downloading cached these from https://cache.nix-ci.com
  392. 37.65 s Progress: 2 of 70 built, 138 of 193 downloaded from cache (15 downloading)
  393. 37.65 s Downloading cached old-time from https://cache.nix-ci.com
  394. 37.67 s Progress: 2 of 69 built, 139 of 193 downloaded from cache (15 downloading)
  395. 37.67 s Progress: 2 of 69 built, 140 of 193 downloaded from cache (15 downloading)
  396. 37.67 s Downloading cached time-compat from https://cache.nix-ci.com
  397. 37.67 s Downloading cached transformers-compat from https://cache.nix-ci.com
  398. 37.67 s Progress: 2 of 68 built, 141 of 193 downloaded from cache (15 downloading)
  399. 37.67 s Downloading cached unliftio-core from https://cache.nix-ci.com
  400. 37.68 s Progress: 2 of 67 built, 142 of 193 downloaded from cache (15 downloading)
  401. 37.68 s Downloading cached random from https://cache.nix-ci.com
  402. 37.69 s Progress: 2 of 66 built, 143 of 193 downloaded from cache (15 downloading)
  403. 37.69 s Downloading cached vector-stream from https://cache.nix-ci.com
  404. 37.69 s Progress: 2 of 65 built, 144 of 193 downloaded from cache (15 downloading)
  405. 37.69 s Downloading cached wherefrom-compat from https://cache.nix-ci.com
  406. 37.70 s Progress: 2 of 64 built, 145 of 193 downloaded from cache (15 downloading)
  407. 37.70 s Downloading cached ansi-terminal from https://cache.nix-ci.com
  408. 37.71 s Progress: 2 of 63 built, 146 of 193 downloaded from cache (15 downloading)
  409. 37.71 s Downloading cached wl-pprint-annotated from https://cache.nix-ci.com
  410. 37.71 s Progress: 2 of 62 built, 147 of 193 downloaded from cache (15 downloading)
  411. 37.71 s Downloading cached boring from https://cache.nix-ci.com
  412. 37.71 s Progress: 2 of 61 built, 148 of 193 downloaded from cache (15 downloading)
  413. 37.71 s Downloading cached distributive from https://cache.nix-ci.com
  414. 37.72 s Progress: 2 of 61 built, 149 of 193 downloaded from cache (15 downloading)
  415. 37.72 s Downloading cached scientific from https://cache.nix-ci.com
  416. 37.74 s Progress: 2 of 60 built, 150 of 193 downloaded from cache (15 downloading)
  417. 37.75 s Progress: 2 of 59 built, 151 of 193 downloaded from cache (14 downloading)
  418. 37.78 s Progress: 2 of 58 built, 152 of 193 downloaded from cache (13 downloading)
  419. 37.78 s Downloading cached strict from https://cache.nix-ci.com
  420. 37.80 s Progress: 2 of 57 built, 153 of 193 downloaded from cache (13 downloading)
  421. 37.80 s Progress: 2 of 56 built, 154 of 193 downloaded from cache (12 downloading)
  422. 37.80 s Downloading cached resourcet from https://cache.nix-ci.com
  423. 37.83 s Progress: 2 of 55 built, 155 of 193 downloaded from cache (12 downloading)
  424. 37.84 s Progress: 2 of 54 built, 156 of 193 downloaded from cache (11 downloading)
  425. 37.85 s Progress: 2 of 53 built, 157 of 193 downloaded from cache (10 downloading)
  426. 37.85 s Downloading cached mmorph from https://cache.nix-ci.com
  427. 37.85 s Downloading cached transformers-base from https://cache.nix-ci.com
  428. 37.86 s Progress: 2 of 52 built, 158 of 193 downloaded from cache (11 downloading)
  429. 37.87 s Progress: 2 of 51 built, 159 of 193 downloaded from cache (10 downloading)
  430. 37.87 s Downloading cached concurrent-output from https://cache.nix-ci.com
  431. 37.87 s Downloading cached prettyprinter-ansi-terminal from https://cache.nix-ci.com
  432. 37.87 s Progress: 2 of 50 built, 160 of 193 downloaded from cache (11 downloading)
  433. 37.87 s Downloading cached barbies from https://cache.nix-ci.com
  434. 37.87 s Progress: 2 of 49 built, 161 of 193 downloaded from cache (11 downloading)
  435. 37.88 s Downloading cached constraints from https://cache.nix-ci.com
  436. 37.88 s Progress: 2 of 48 built, 162 of 193 downloaded from cache (11 downloading)
  437. 37.88 s Progress: 2 of 47 built, 163 of 193 downloaded from cache (10 downloading)
  438. 37.89 s Downloading cached QuickCheck from https://cache.nix-ci.com
  439. 37.89 s Downloading cached temporary from https://cache.nix-ci.com
  440. 37.89 s Downloading cached tf-random from https://cache.nix-ci.com
  441. 37.89 s Downloading cached uuid-types from https://cache.nix-ci.com
  442. 37.89 s Progress: 2 of 46 built, 164 of 193 downloaded from cache (13 downloading)
  443. 37.94 s Progress: 2 of 45 built, 165 of 193 downloaded from cache (12 downloading)
  444. 37.97 s Progress: 2 of 45 built, 166 of 193 downloaded from cache (11 downloading)
  445. 37.99 s Progress: 2 of 44 built, 167 of 193 downloaded from cache (10 downloading)
  446. 37.99 s Progress: 2 of 43 built, 168 of 193 downloaded from cache (9 downloading)
  447. 37.99 s Downloading cached monad-control from https://cache.nix-ci.com
  448. 38.00 s Progress: 2 of 42 built, 169 of 193 downloaded from cache (9 downloading)
  449. 38.02 s Progress: 2 of 41 built, 170 of 193 downloaded from cache (8 downloading)
  450. 38.02 s Downloading cached optparse-applicative from https://cache.nix-ci.com
  451. 38.04 s Progress: 2 of 41 built, 171 of 193 downloaded from cache (8 downloading)
  452. 38.05 s Progress: 2 of 40 built, 172 of 193 downloaded from cache (7 downloading)
  453. 38.07 s Progress: 2 of 39 built, 173 of 193 downloaded from cache (6 downloading)
  454. 38.07 s Progress: 2 of 38 built, 174 of 193 downloaded from cache (5 downloading)
  455. 38.08 s Downloading cached mockery from https://cache.nix-ci.com
  456. 38.09 s Progress: 2 of 37 built, 175 of 193 downloaded from cache (5 downloading)
  457. 38.12 s Progress: 2 of 36 built, 176 of 193 downloaded from cache (4 downloading)
  458. 38.14 s Progress: 2 of 35 built, 177 of 193 downloaded from cache (3 downloading)
  459. 38.14 s Downloading cached lifted-base from https://cache.nix-ci.com
  460. 38.19 s Progress: 2 of 34 built, 178 of 193 downloaded from cache (3 downloading)
  461. 38.19 s Downloading cached ChasingBottoms from https://cache.nix-ci.com
  462. 38.19 s Downloading cached quickcheck-io from https://cache.nix-ci.com
  463. 38.21 s Progress: 2 of 33 built, 179 of 193 downloaded from cache (4 downloading)
  464. 38.21 s Downloading cached tasty from https://cache.nix-ci.com
  465. 38.24 s Progress: 2 of 33 built, 180 of 193 downloaded from cache (4 downloading)
  466. 38.24 s Downloading cached hspec-core from https://cache.nix-ci.com
  467. 38.28 s Progress: 2 of 33 built, 181 of 193 downloaded from cache (4 downloading)
  468. 38.28 s Downloading cached lifted-async from https://cache.nix-ci.com
  469. 38.34 s Progress: 2 of 32 built, 182 of 193 downloaded from cache (4 downloading)
  470. 38.38 s Progress: 2 of 31 built, 183 of 193 downloaded from cache (3 downloading)
  471. 38.38 s Downloading cached Cabal from https://cache.nix-ci.com
  472. 38.40 s Progress: 2 of 31 built, 184 of 193 downloaded from cache (3 downloading)
  473. 38.40 s Downloading cached hspec from https://cache.nix-ci.com
  474. 38.43 s Progress: 2 of 30 built, 185 of 193 downloaded from cache (3 downloading)
  475. 38.43 s Downloading cached tasty-hunit from https://cache.nix-ci.com
  476. 38.43 s Downloading cached tasty-inspection-testing from https://cache.nix-ci.com
  477. 38.43 s Downloading cached tasty-quickcheck from https://cache.nix-ci.com
  478. 38.46 s Progress: 2 of 29 built, 186 of 193 downloaded from cache (5 downloading)
  479. 38.46 s Downloading cached hedgehog from https://cache.nix-ci.com
  480. 38.47 s Progress: 2 of 28 built, 187 of 193 downloaded from cache (5 downloading)
  481. 38.54 s Progress: 2 of 27 built, 188 of 193 downloaded from cache (4 downloading)
  482. 38.63 s Progress: 2 of 26 built, 189 of 193 downloaded from cache (3 downloading)
  483. 38.63 s Progress: 2 of 25 built, 190 of 193 downloaded from cache (2 downloading)
  484. 38.81 s Progress: 2 of 24 built, 191 of 193 downloaded from cache (1 downloading)
  485. 38.81 s Downloading cached tasty-hedgehog from https://cache.nix-ci.com
  486. 38.95 s Progress: 2 of 23 built, 192 of 193 downloaded from cache (1 downloading)
  487. 39.12 s Progress: 2 of 22 built, 193 of 193 downloaded from cache
  488. 39.24 s Building cabal-doctest
  489. 39.28 s Building ghc-paths
  490. 39.32 s [cabal-doctest] Phase: setupCompilerEnvironmentPhase
  491. 39.32 s [cabal-doctest] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  492. 39.35 s [ghc-paths] Phase: setupCompilerEnvironmentPhase
  493. 39.36 s [ghc-paths] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  494. 39.52 s [cabal-doctest] Phase: unpackPhase
  495. 39.52 s [ghc-paths] Phase: unpackPhase
  496. 39.53 s [cabal-doctest] unpacking source archive /nix/store/ckph819l8a613hapx2pwbjv3yzi8gm3k-cabal-doctest-1.0.12.tar.gz
  497. 39.53 s [ghc-paths] unpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
  498. 39.54 s [ghc-paths] source root is ghc-paths-0.1.0.12
  499. 39.54 s [cabal-doctest] source root is cabal-doctest-1.0.12
  500. 39.54 s [ghc-paths] setting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
  501. 39.54 s [cabal-doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.12/src/Distribution/Extra/Doctest.hs"
  502. 39.55 s [ghc-paths] Phase: patchPhase
  503. 39.55 s [cabal-doctest] Phase: patchPhase
  504. 39.55 s [ghc-paths] Replace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/8.cabal.
  505. 39.56 s [ghc-paths] applying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
  506. 39.56 s [cabal-doctest] Phase: compileBuildDriverPhase
  507. 39.56 s [ghc-paths] patching file GHC/Paths.hs
  508. 39.57 s [ghc-paths] Phase: compileBuildDriverPhase
  509. 39.57 s [cabal-doctest] setupCompileFlags: -package-db=/build/tmp.pYcqkiqmcA/setup-package.conf.d -threaded
  510. 39.57 s [ghc-paths] setupCompileFlags: -package-db=/build/tmp.rzWYyrEQNx/setup-package.conf.d -threaded
  511. 39.64 s [cabal-doctest] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.pYcqkiqmcA/Main.o )
  512. 39.70 s [cabal-doctest] [2 of 2] Linking Setup
  513. 39.74 s [ghc-paths] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.rzWYyrEQNx/Main.o )
  514. 40.04 s [ghc-paths] [2 of 2] Linking Setup
  515. 41.51 s [cabal-doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  516. 41.52 s [cabal-doctest] Phase: configurePhase
  517. 41.52 s [cabal-doctest] configureFlags: --verbose --prefix=/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12 --with-gcc=gcc --package-db=/build/tmp.pYcqkiqmcA/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  518. 41.53 s [cabal-doctest] Using Parsec parser
  519. 41.53 s [cabal-doctest] Configuring cabal-doctest-1.0.12...
  520. 41.79 s [ghc-paths] Phase: updateAutotoolsGnuConfigScriptsPhase
  521. 41.80 s [ghc-paths] Phase: configurePhase
  522. 41.81 s [ghc-paths] configureFlags: --verbose --prefix=/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.rzWYyrEQNx/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  523. 41.82 s [ghc-paths] Using Parsec parser
  524. 41.82 s [ghc-paths] Configuring ghc-paths-0.1.0.12...
  525. 42.36 s [cabal-doctest] Dependency Cabal >=1.24 && <3.16: using Cabal-3.12.1.0
  526. 42.44 s [cabal-doctest] Dependency base >=4.9 && <5: using base-4.20.2.0
  527. 42.44 s [cabal-doctest] Dependency directory >=1.3 && <2: using directory-1.3.8.5
  528. 42.44 s [cabal-doctest] Dependency filepath >=1.4 && <2: using filepath-1.5.4.0
  529. 42.44 s [cabal-doctest] Source component graph: component lib
  530. 42.44 s [cabal-doctest] Configured component graph:
  531. 42.44 s [cabal-doctest] component cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
  532. 42.44 s [cabal-doctest] include Cabal-3.12.1.0-6pPBtuT1VEQBltj6c523Xh
  533. 42.44 s [cabal-doctest] include base-4.20.2.0-acb8
  534. 42.44 s [cabal-doctest] include directory-1.3.8.5-e377
  535. 42.44 s [cabal-doctest] include filepath-1.5.4.0-c4eb
  536. 42.44 s [cabal-doctest] Linked component graph:
  537. 42.44 s [cabal-doctest] unit cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
  538. 42.44 s [cabal-doctest] include Cabal-3.12.1.0-6pPBtuT1VEQBltj6c523Xh
  539. 42.44 s [cabal-doctest] include base-4.20.2.0-acb8
  540. 42.44 s [cabal-doctest] include directory-1.3.8.5-e377
  541. 42.44 s [cabal-doctest] include filepath-1.5.4.0-c4eb
  542. 42.44 s [cabal-doctest] Distribution.Extra.Doctest=cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m:Distribution.Extra.Doctest
  543. 42.44 s [cabal-doctest] Ready component graph:
  544. 42.44 s [cabal-doctest] definite cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
  545. 42.44 s [cabal-doctest] depends Cabal-3.12.1.0-6pPBtuT1VEQBltj6c523Xh
  546. 42.44 s [cabal-doctest] depends base-4.20.2.0-acb8
  547. 42.44 s [cabal-doctest] depends directory-1.3.8.5-e377
  548. 42.44 s [cabal-doctest] depends filepath-1.5.4.0-c4eb
  549. 42.44 s [cabal-doctest] Using Cabal-3.12.1.0 compiled by ghc-9.10
  550. 42.44 s [cabal-doctest] Using compiler: ghc-9.10.3
  551. 42.44 s [cabal-doctest] Using install prefix:
  552. 42.44 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12
  553. 42.44 s [cabal-doctest] Executables installed in:
  554. 42.44 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/bin
  555. 42.44 s [cabal-doctest] Libraries installed in:
  556. 42.44 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
  557. 42.44 s [cabal-doctest] Dynamic Libraries installed in:
  558. 42.44 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  559. 42.44 s [cabal-doctest] Private executables installed in:
  560. 42.44 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/libexec/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12
  561. 42.44 s [cabal-doctest] Data files installed in:
  562. 42.44 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/share/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12
  563. 42.44 s [cabal-doctest] Documentation installed in:
  564. 42.44 s [cabal-doctest] /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12
  565. 42.44 s [cabal-doctest] Configuration files installed in:
  566. 42.44 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/etc
  567. 42.44 s [cabal-doctest] No alex found
  568. 42.44 s [cabal-doctest] Using ar found on system at:
  569. 42.44 s [cabal-doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  570. 42.44 s [cabal-doctest] No c2hs found
  571. 42.44 s [cabal-doctest] No cpphs found
  572. 42.44 s [cabal-doctest] No doctest found
  573. 42.44 s [cabal-doctest] Using gcc version 14.3.0 given by user at:
  574. 42.44 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  575. 42.44 s [cabal-doctest] Using ghc version 9.10.3 found on system at:
  576. 42.44 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  577. 42.44 s [cabal-doctest] Using ghc-pkg version 9.10.3 found on system at:
  578. 42.44 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  579. 42.44 s [cabal-doctest] No ghcjs found
  580. 42.44 s [cabal-doctest] No ghcjs-pkg found
  581. 42.44 s [cabal-doctest] No greencard found
  582. 42.44 s [cabal-doctest] Using haddock version 2.31.1 found on system at:
  583. 42.44 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  584. 42.44 s [cabal-doctest] No happy found
  585. 42.44 s [cabal-doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  586. 42.44 s [cabal-doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  587. 42.44 s [cabal-doctest] No hmake found
  588. 42.44 s [cabal-doctest] Using hpc version 0.69 found on system at:
  589. 42.44 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  590. 42.44 s [cabal-doctest] Using hsc2hs version 0.68.10 found on system at:
  591. 42.44 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  592. 42.44 s [cabal-doctest] Using hscolour version 1.25 found on system at:
  593. 42.44 s [cabal-doctest] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  594. 42.44 s [cabal-doctest] No jhc found
  595. 42.44 s [cabal-doctest] Using ld found on system at:
  596. 42.44 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  597. 42.44 s [cabal-doctest] No pkg-config found
  598. 42.44 s [cabal-doctest] Using runghc version 9.10.3 found on system at:
  599. 42.44 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  600. 42.44 s [cabal-doctest] Using strip version 2.44 found on system at:
  601. 42.44 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  602. 42.44 s [cabal-doctest] Using tar found on system at:
  603. 42.44 s [cabal-doctest] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  604. 42.44 s [cabal-doctest] No uhc found
  605. 42.60 s [cabal-doctest] Phase: buildPhase
  606. 42.69 s [ghc-paths] Dependency base >=3 && <5: using base-4.20.2.0
  607. 42.69 s [ghc-paths] Source component graph: component lib
  608. 42.69 s [ghc-paths] Configured component graph:
  609. 42.69 s [ghc-paths] component ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  610. 42.69 s [ghc-paths] include base-4.20.2.0-acb8
  611. 42.69 s [ghc-paths] Linked component graph:
  612. 42.69 s [ghc-paths] unit ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  613. 42.69 s [ghc-paths] include base-4.20.2.0-acb8
  614. 42.69 s [ghc-paths] GHC.Paths=ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww:GHC.Paths
  615. 42.69 s [ghc-paths] Ready component graph:
  616. 42.69 s [ghc-paths] definite ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  617. 42.69 s [ghc-paths] depends base-4.20.2.0-acb8
  618. 42.69 s [ghc-paths] Using Cabal-3.12.1.0 compiled by ghc-9.10
  619. 42.69 s [ghc-paths] Using compiler: ghc-9.10.3
  620. 42.69 s [ghc-paths] Using install prefix:
  621. 42.69 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
  622. 42.69 s [ghc-paths] Executables installed in:
  623. 42.69 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/bin
  624. 42.69 s [ghc-paths] Libraries installed in:
  625. 42.69 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  626. 42.69 s [ghc-paths] Dynamic Libraries installed in:
  627. 42.69 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  628. 42.69 s [ghc-paths] Private executables installed in:
  629. 42.69 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12
  630. 42.69 s [ghc-paths] Data files installed in:
  631. 42.69 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12
  632. 42.69 s [ghc-paths] Documentation installed in:
  633. 42.69 s [ghc-paths] /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
  634. 42.69 s [ghc-paths] Configuration files installed in:
  635. 42.69 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/etc
  636. 42.69 s [ghc-paths] No alex found
  637. 42.69 s [ghc-paths] Using ar found on system at:
  638. 42.69 s [ghc-paths] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  639. 42.69 s [ghc-paths] No c2hs found
  640. 42.69 s [ghc-paths] No cpphs found
  641. 42.69 s [ghc-paths] No doctest found
  642. 42.69 s [ghc-paths] Using gcc version 14.3.0 given by user at:
  643. 42.69 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  644. 42.69 s [ghc-paths] Using ghc version 9.10.3 found on system at:
  645. 42.69 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  646. 42.69 s [ghc-paths] Using ghc-pkg version 9.10.3 found on system at:
  647. 42.69 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  648. 42.69 s [ghc-paths] No ghcjs found
  649. 42.69 s [ghc-paths] No ghcjs-pkg found
  650. 42.69 s [ghc-paths] No greencard found
  651. 42.69 s [ghc-paths] Using haddock version 2.31.1 found on system at:
  652. 42.69 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  653. 42.69 s [ghc-paths] No happy found
  654. 42.69 s [ghc-paths] Using haskell-suite found on system at: haskell-suite-dummy-location
  655. 42.69 s [ghc-paths] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  656. 42.69 s [ghc-paths] No hmake found
  657. 42.69 s [ghc-paths] Using hpc version 0.69 found on system at:
  658. 42.69 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  659. 42.69 s [ghc-paths] Using hsc2hs version 0.68.10 found on system at:
  660. 42.69 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  661. 42.69 s [ghc-paths] Using hscolour version 1.25 found on system at:
  662. 42.69 s [ghc-paths] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  663. 42.69 s [ghc-paths] No jhc found
  664. 42.69 s [ghc-paths] Using ld found on system at:
  665. 42.69 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  666. 42.69 s [ghc-paths] No pkg-config found
  667. 42.69 s [ghc-paths] Using runghc version 9.10.3 found on system at:
  668. 42.69 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  669. 42.69 s [ghc-paths] Using strip version 2.44 found on system at:
  670. 42.69 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  671. 42.69 s [ghc-paths] Using tar found on system at:
  672. 42.69 s [ghc-paths] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  673. 42.69 s [ghc-paths] No uhc found
  674. 42.69 s [ghc-paths] Running: /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
  675. 42.69 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12...
  676. 42.69 s [cabal-doctest] Building library for cabal-doctest-1.0.12...
  677. 42.79 s [ghc-paths] Phase: buildPhase
  678. 42.84 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.o, dist/build/Distribution/Extra/Doctest.dyn_o )
  679. 42.90 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  680. 42.90 s [ghc-paths] Building library for ghc-paths-0.1.0.12...
  681. 43.06 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
  682. 43.58 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
  683. 45.07 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
  684. 45.57 s [ghc-paths] Phase: checkPhase
  685. 45.65 s [ghc-paths] Package has no test suites.
  686. 45.66 s [ghc-paths] Phase: haddockPhase
  687. 45.85 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  688. 45.85 s [ghc-paths] Running Haddock on library for ghc-paths-0.1.0.12...
  689. 46.02 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, nothing )
  690. 46.08 s [ghc-paths] Haddock coverage:
  691. 46.08 s [ghc-paths] 0% ( 0 / 5) in 'GHC.Paths'
  692. 46.08 s [ghc-paths] Missing documentation for:
  693. 46.08 s [ghc-paths] Module header
  694. 46.08 s [ghc-paths] ghc (GHC/Paths.hs:34)
  695. 46.08 s [ghc-paths] ghc_pkg (GHC/Paths.hs:35)
  696. 46.08 s [ghc-paths] libdir (GHC/Paths.hs:31)
  697. 46.08 s [ghc-paths] docdir (GHC/Paths.hs:32)
  698. 49.76 s [cabal-doctest] Phase: checkPhase
  699. 49.81 s [cabal-doctest] Package has no test suites.
  700. 49.82 s [cabal-doctest] Phase: haddockPhase
  701. 50.06 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12...
  702. 50.06 s [cabal-doctest] Running Haddock on library for cabal-doctest-1.0.12...
  703. 50.39 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, nothing )
  704. 50.96 s [cabal-doctest] Haddock coverage:
  705. 50.96 s [cabal-doctest] Warning: 'UserHooks' is ambiguous. It is defined
  706. 50.96 s [cabal-doctest] * in ‘Distribution.Simple.UserHooks’
  707. 50.96 s [cabal-doctest] * in ‘Distribution.Simple.UserHooks’
  708. 50.96 s [cabal-doctest] You may be able to disambiguate the identifier by qualifying it or
  709. 50.96 s [cabal-doctest] by specifying the type/value namespace explicitly.
  710. 50.96 s [cabal-doctest] Defaulting to the one defined in ‘Distribution.Simple.UserHooks’
  711. 50.97 s [cabal-doctest] 100% ( 7 / 7) in 'Distribution.Extra.Doctest'
  712. 51.14 s [ghc-paths] Documentation created: dist/doc/html/ghc-paths/,
  713. 51.14 s [ghc-paths] dist/doc/html/ghc-paths/ghc-paths.txt
  714. 51.25 s [ghc-paths] Phase: installPhase
  715. 51.37 s [ghc-paths] Installing library in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  716. 51.67 s [ghc-paths] Phase: fixupPhase
  717. 51.69 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
  718. 51.70 s [ghc-paths] shrinking /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww-ghc9.10.3.so
  719. 51.72 s [ghc-paths] checking for references to /build/ in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12...
  720. 51.75 s [ghc-paths] patching script interpreter paths in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
  721. 51.75 s [ghc-paths] stripping (with command strip and flags -S -p) in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib
  722. 51.85 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc
  723. 51.86 s [ghc-paths] checking for references to /build/ in /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc...
  724. 51.87 s [ghc-paths] patching script interpreter paths in /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc
  725. 51.95 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
  726. 58.55 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  727. 58.60 s [post-build-hook] Uploading to the NixCI cache: /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
  728. 58.67 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  729. 58.80 s [post-build-hook] copying 1 paths...
  730. 58.80 s [post-build-hook] copying path '/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...
  731. 59.02 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  732. 59.25 s [post-build-hook] copying 0 paths...
  733. 59.30 s Progress: 3 of 22 built (1 building), 193 of 193 downloaded from cache
  734. 59.40 s Building doctest
  735. 59.59 s [doctest] Phase: setupCompilerEnvironmentPhase
  736. 59.61 s [doctest] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  737. 59.93 s [doctest] Phase: unpackPhase
  738. 59.93 s [doctest] unpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
  739. 59.95 s [doctest] source root is doctest-0.24.2
  740. 59.96 s [doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
  741. 59.96 s [doctest] Phase: patchPhase
  742. 59.98 s [doctest] Phase: compileBuildDriverPhase
  743. 59.98 s [doctest] setupCompileFlags: -package-db=/build/tmp.m0OZwq2jdg/setup-package.conf.d -threaded
  744. 60.10 s [doctest] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.m0OZwq2jdg/Main.o )
  745. 60.18 s [doctest] [2 of 2] Linking Setup
  746. 61.50 s [cabal-doctest] Documentation created: dist/doc/html/cabal-doctest/,
  747. 61.50 s [cabal-doctest] dist/doc/html/cabal-doctest/cabal-doctest.txt
  748. 61.63 s [cabal-doctest] Phase: installPhase
  749. 61.85 s [cabal-doctest] Installing library in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
  750. 62.23 s [cabal-doctest] Phase: fixupPhase
  751. 62.30 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12
  752. 62.31 s [cabal-doctest] shrinking /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHScabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m-ghc9.10.3.so
  753. 62.31 s [cabal-doctest] checking for references to /build/ in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12...
  754. 62.34 s [cabal-doctest] patching script interpreter paths in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12
  755. 62.35 s [cabal-doctest] stripping (with command strip and flags -S -p) in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib
  756. 62.40 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc
  757. 62.41 s [cabal-doctest] checking for references to /build/ in /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc...
  758. 62.44 s [cabal-doctest] patching script interpreter paths in /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc
  759. 62.61 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc
  760. 63.47 s [post-build-hook] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  761. 63.47 s [post-build-hook]
  762. 63.85 s [post-build-hook] Pushing /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 (801.50 KiB)
  763. 63.94 s [post-build-hook] Pushing /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc (379.52 KiB)
  764. 65.00 s [post-build-hook]
  765. 65.00 s [post-build-hook] All done.
  766. 65.11 s [post-build-hook] Uploading to the NixCI cache: /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc
  767. 65.24 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  768. 65.96 s [post-build-hook] copying 2 paths...
  769. 65.96 s [post-build-hook] copying path '/nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc' to 'https://cache.nix-ci.com'...
  770. 69.15 s [post-build-hook] copying path '/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12' to 'https://cache.nix-ci.com'...
  771. 70.49 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  772. 71.26 s [post-build-hook] copying 0 paths...
  773. 71.36 s Progress: 4 of 22 built (1 building), 193 of 193 downloaded from cache
  774. 71.37 s [doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  775. 71.37 s [doctest] Phase: configurePhase
  776. 71.37 s [doctest] configureFlags: --verbose --prefix=/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.m0OZwq2jdg/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  777. 71.37 s [doctest] Using Parsec parser
  778. 71.37 s [doctest] Configuring doctest-0.24.2...
  779. 71.37 s [doctest] Flags chosen: cabal-doctest=False
  780. 71.37 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  781. 71.37 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  782. 71.37 s [doctest] Dependency containers: using containers-0.7
  783. 71.37 s [doctest] Dependency deepseq: using deepseq-1.5.0.0
  784. 71.37 s [doctest] Dependency directory: using directory-1.3.8.5
  785. 71.37 s [doctest] Dependency exceptions: using exceptions-0.10.9
  786. 71.37 s [doctest] Dependency filepath: using filepath-1.5.4.0
  787. 71.37 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.10.3
  788. 71.37 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  789. 71.37 s [doctest] Dependency process: using process-1.6.26.1
  790. 71.37 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  791. 71.37 s [doctest] Dependency temporary: using temporary-1.3
  792. 71.37 s [doctest] Dependency transformers: using transformers-0.6.1.1
  793. 71.37 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  794. 71.37 s [doctest] Dependency doctest: using doctest-0.24.2
  795. 71.37 s [doctest] Dependency HUnit: using HUnit-1.6.2.0
  796. 71.37 s [doctest] Dependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
  797. 71.37 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  798. 71.37 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  799. 71.37 s [doctest] Dependency containers: using containers-0.7
  800. 71.37 s [doctest] Dependency deepseq: using deepseq-1.5.0.0
  801. 71.37 s [doctest] Dependency directory: using directory-1.3.8.5
  802. 71.37 s [doctest] Dependency exceptions: using exceptions-0.10.9
  803. 71.37 s [doctest] Dependency filepath: using filepath-1.5.4.0
  804. 71.37 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.10.3
  805. 71.37 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  806. 71.37 s [doctest] Dependency hspec >=2.3.0: using hspec-2.11.14
  807. 71.37 s [doctest] Dependency hspec-core >=2.3.0: using hspec-core-2.11.14
  808. 71.37 s [doctest] Dependency mockery: using mockery-0.3.5
  809. 71.37 s [doctest] Dependency process: using process-1.6.26.1
  810. 71.37 s [doctest] Dependency silently >=1.2.4: using silently-1.2.5.4
  811. 71.37 s [doctest] Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
  812. 71.37 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  813. 71.37 s [doctest] Dependency temporary: using temporary-1.3
  814. 71.37 s [doctest] Dependency transformers: using transformers-0.6.1.1
  815. 71.37 s [doctest] Source component graph:
  816. 71.37 s [doctest] component test:spec
  817. 71.37 s [doctest] component lib
  818. 71.37 s [doctest] component exe:doctest dependency lib
  819. 71.37 s [doctest] Configured component graph:
  820. 71.37 s [doctest] component doctest-0.24.2-DM1nRfpekBiDYfA0F1Xpwe-spec
  821. 71.37 s [doctest] include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  822. 71.37 s [doctest] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  823. 71.37 s [doctest] include base-4.20.2.0-acb8
  824. 71.38 s [doctest] include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  825. 71.38 s [doctest] include containers-0.7-a3f6
  826. 71.38 s [doctest] include deepseq-1.5.0.0-7e72
  827. 71.38 s [doctest] include directory-1.3.8.5-e377
  828. 71.38 s [doctest] include exceptions-0.10.9-0130
  829. 71.38 s [doctest] include filepath-1.5.4.0-c4eb
  830. 71.38 s [doctest] include ghc-9.10.3-5702
  831. 71.38 s [doctest] include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  832. 71.38 s [doctest] include hspec-2.11.14-K0D92V7bzH349viEnZTxvm
  833. 71.38 s [doctest] include hspec-core-2.11.14-8XRH3K8BPWG69bHF50sBfH
  834. 71.38 s [doctest] include mockery-0.3.5-3Qryyw7zMx12T20sfyazvN
  835. 71.38 s [doctest] include process-1.6.26.1-c5d9
  836. 71.38 s [doctest] include silently-1.2.5.4-ByKm4HpsZRZGBC8N5tSYGn
  837. 71.38 s [doctest] include stringbuilder-0.5.1-8L9q1CfIA5xBia3rv7hOIN
  838. 71.38 s [doctest] include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  839. 71.38 s [doctest] include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  840. 71.38 s [doctest] include transformers-0.6.1.1-74e0
  841. 71.38 s [doctest] component doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  842. 71.38 s [doctest] include base-4.20.2.0-acb8
  843. 71.38 s [doctest] include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  844. 71.38 s [doctest] include containers-0.7-a3f6
  845. 71.38 s [doctest] include deepseq-1.5.0.0-7e72
  846. 71.38 s [doctest] include directory-1.3.8.5-e377
  847. 71.38 s [doctest] include exceptions-0.10.9-0130
  848. 71.38 s [doctest] include filepath-1.5.4.0-c4eb
  849. 71.38 s [doctest] include ghc-9.10.3-5702
  850. 71.38 s [doctest] include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  851. 71.38 s [doctest] include process-1.6.26.1-c5d9
  852. 71.38 s [doctest] include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  853. 71.38 s [doctest] include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  854. 71.38 s [doctest] include transformers-0.6.1.1-74e0
  855. 71.38 s [doctest] component doctest-0.24.2-9GcIPE00TeSCcMZoB8T4Sl-doctest
  856. 71.38 s [doctest] include base-4.20.2.0-acb8
  857. 71.38 s [doctest] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  858. 71.38 s [doctest] Linked component graph:
  859. 71.38 s [doctest] unit doctest-0.24.2-DM1nRfpekBiDYfA0F1Xpwe-spec
  860. 71.38 s [doctest] include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  861. 71.38 s [doctest] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  862. 71.38 s [doctest] include base-4.20.2.0-acb8
  863. 71.38 s [doctest] include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  864. 71.38 s [doctest] include containers-0.7-a3f6
  865. 71.38 s [doctest] include deepseq-1.5.0.0-7e72
  866. 71.38 s [doctest] include directory-1.3.8.5-e377
  867. 71.38 s [doctest] include exceptions-0.10.9-0130
  868. 71.38 s [doctest] include filepath-1.5.4.0-c4eb
  869. 71.38 s [doctest] include ghc-9.10.3-5702
  870. 71.38 s [doctest] include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  871. 71.38 s [doctest] include hspec-2.11.14-K0D92V7bzH349viEnZTxvm
  872. 71.38 s [doctest] include hspec-core-2.11.14-8XRH3K8BPWG69bHF50sBfH
  873. 71.38 s [doctest] include mockery-0.3.5-3Qryyw7zMx12T20sfyazvN
  874. 71.38 s [doctest] include process-1.6.26.1-c5d9
  875. 71.38 s [doctest] include silently-1.2.5.4-ByKm4HpsZRZGBC8N5tSYGn
  876. 71.38 s [doctest] include stringbuilder-0.5.1-8L9q1CfIA5xBia3rv7hOIN
  877. 71.38 s [doctest] include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  878. 71.38 s [doctest] include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  879. 71.38 s [doctest] include transformers-0.6.1.1-74e0
  880. 71.38 s [doctest] unit doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  881. 71.38 s [doctest] include base-4.20.2.0-acb8
  882. 71.38 s [doctest] include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  883. 71.38 s [doctest] include containers-0.7-a3f6
  884. 71.38 s [doctest] include deepseq-1.5.0.0-7e72
  885. 71.38 s [doctest] include directory-1.3.8.5-e377
  886. 71.38 s [doctest] include exceptions-0.10.9-0130
  887. 71.38 s [doctest] include filepath-1.5.4.0-c4eb
  888. 71.38 s [doctest] include ghc-9.10.3-5702
  889. 71.38 s [doctest] include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  890. 71.38 s [doctest] include process-1.6.26.1-c5d9
  891. 71.38 s [doctest] include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  892. 71.38 s [doctest] include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  893. 71.38 s [doctest] include transformers-0.6.1.1-74e0
  894. 71.38 s [doctest] Test.DocTest=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Run
  895. 71.38 s [doctest] unit doctest-0.24.2-9GcIPE00TeSCcMZoB8T4Sl-doctest
  896. 71.38 s [doctest] include base-4.20.2.0-acb8
  897. 71.38 s [doctest] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  898. 71.38 s [doctest] Ready component graph:
  899. 71.38 s [doctest] definite doctest-0.24.2-DM1nRfpekBiDYfA0F1Xpwe-spec
  900. 71.38 s [doctest] depends HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  901. 71.38 s [doctest] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  902. 71.38 s [doctest] depends base-4.20.2.0-acb8
  903. 71.38 s [doctest] depends code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  904. 71.38 s [doctest] depends containers-0.7-a3f6
  905. 71.38 s [doctest] depends deepseq-1.5.0.0-7e72
  906. 71.38 s [doctest] depends directory-1.3.8.5-e377
  907. 71.38 s [doctest] depends exceptions-0.10.9-0130
  908. 71.38 s [doctest] depends filepath-1.5.4.0-c4eb
  909. 71.38 s [doctest] depends ghc-9.10.3-5702
  910. 71.38 s [doctest] depends ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  911. 71.38 s [doctest] depends hspec-2.11.14-K0D92V7bzH349viEnZTxvm
  912. 71.38 s [doctest] depends hspec-core-2.11.14-8XRH3K8BPWG69bHF50sBfH
  913. 71.38 s [doctest] depends mockery-0.3.5-3Qryyw7zMx12T20sfyazvN
  914. 71.38 s [doctest] depends process-1.6.26.1-c5d9
  915. 71.38 s [doctest] depends silently-1.2.5.4-ByKm4HpsZRZGBC8N5tSYGn
  916. 71.38 s [doctest] depends stringbuilder-0.5.1-8L9q1CfIA5xBia3rv7hOIN
  917. 71.38 s [doctest] depends syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  918. 71.38 s [doctest] depends temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  919. 71.38 s [doctest] depends transformers-0.6.1.1-74e0
  920. 71.38 s [doctest] definite doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  921. 71.38 s [doctest] depends base-4.20.2.0-acb8
  922. 71.38 s [doctest] depends code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  923. 71.38 s [doctest] depends containers-0.7-a3f6
  924. 71.38 s [doctest] depends deepseq-1.5.0.0-7e72
  925. 71.38 s [doctest] depends directory-1.3.8.5-e377
  926. 71.38 s [doctest] depends exceptions-0.10.9-0130
  927. 71.38 s [doctest] depends filepath-1.5.4.0-c4eb
  928. 71.38 s [doctest] depends ghc-9.10.3-5702
  929. 71.38 s [doctest] depends ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  930. 71.38 s [doctest] depends process-1.6.26.1-c5d9
  931. 71.38 s [doctest] depends syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  932. 71.38 s [doctest] depends temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  933. 71.38 s [doctest] depends transformers-0.6.1.1-74e0
  934. 71.38 s [doctest] definite doctest-0.24.2-9GcIPE00TeSCcMZoB8T4Sl-doctest
  935. 71.38 s [doctest] depends base-4.20.2.0-acb8
  936. 71.38 s [doctest] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  937. 71.38 s [doctest] Using Cabal-3.12.1.0 compiled by ghc-9.10
  938. 71.38 s [doctest] Using compiler: ghc-9.10.3
  939. 71.38 s [doctest] Using install prefix:
  940. 71.38 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2
  941. 71.38 s [doctest] Executables installed in:
  942. 71.38 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin
  943. 71.38 s [doctest] Libraries installed in:
  944. 71.38 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  945. 71.38 s [doctest] Dynamic Libraries installed in:
  946. 71.38 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  947. 71.38 s [doctest] Private executables installed in:
  948. 71.38 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/libexec/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2
  949. 71.38 s [doctest] Data files installed in:
  950. 71.38 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/share/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2
  951. 71.38 s [doctest] Documentation installed in:
  952. 71.38 s [doctest] /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc/share/doc/doctest-0.24.2
  953. 71.38 s [doctest] Configuration files installed in:
  954. 71.38 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/etc
  955. 71.38 s [doctest] No alex found
  956. 71.38 s [doctest] Using ar found on system at:
  957. 71.38 s [doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  958. 71.38 s [doctest] No c2hs found
  959. 71.38 s [doctest] No cpphs found
  960. 71.38 s [doctest] No doctest found
  961. 71.38 s [doctest] Using gcc version 14.3.0 given by user at:
  962. 71.38 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  963. 71.38 s [doctest] Using ghc version 9.10.3 found on system at:
  964. 71.38 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  965. 71.38 s [doctest] Using ghc-pkg version 9.10.3 found on system at:
  966. 71.38 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  967. 71.38 s [doctest] No ghcjs found
  968. 71.38 s [doctest] No ghcjs-pkg found
  969. 71.38 s [doctest] No greencard found
  970. 71.38 s [doctest] Using haddock version 2.31.1 found on system at:
  971. 71.38 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  972. 71.38 s [doctest] No happy found
  973. 71.38 s [doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  974. 71.38 s [doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  975. 71.38 s [doctest] No hmake found
  976. 71.38 s [doctest] Using hpc version 0.69 found on system at:
  977. 71.38 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  978. 71.38 s [doctest] Using hsc2hs version 0.68.10 found on system at:
  979. 71.38 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  980. 71.39 s [doctest] Using hscolour version 1.25 found on system at:
  981. 71.39 s [doctest] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  982. 71.39 s [doctest] No jhc found
  983. 71.39 s [doctest] Using ld found on system at:
  984. 71.39 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  985. 71.39 s [doctest] No pkg-config found
  986. 71.39 s [doctest] Using runghc version 9.10.3 found on system at:
  987. 71.39 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  988. 71.39 s [doctest] Using strip version 2.44 found on system at:
  989. 71.39 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  990. 71.39 s [doctest] Using tar found on system at:
  991. 71.39 s [doctest] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  992. 71.39 s [doctest] No uhc found
  993. 71.39 s [doctest] Phase: buildPhase
  994. 71.39 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  995. 71.39 s [doctest] Building test suite 'spec' for doctest-0.24.2...
  996. 71.39 s [doctest] [ 1 of 44] Compiling Imports ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
  997. 71.39 s [doctest] [ 2 of 44] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
  998. 72.04 s [doctest] [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
  999. 72.04 s [doctest] [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
  1000. 72.04 s [doctest] [ 5 of 44] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
  1001. 72.04 s [doctest] [ 6 of 44] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
  1002. 72.04 s [doctest] [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
  1003. 72.35 s [doctest] [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
  1004. 72.35 s [doctest] [ 9 of 44] Compiling Interpreter ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
  1005. 72.35 s [doctest] [10 of 44] Compiling InterpreterSpec ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
  1006. 72.35 s [doctest] [11 of 44] Compiling Info ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
  1007. 72.35 s [doctest] [12 of 44] Compiling InfoSpec ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
  1008. 72.35 s [doctest] [13 of 44] Compiling Cabal ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
  1009. 72.35 s [doctest] [14 of 44] Compiling Cabal.PathsSpec ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
  1010. 72.35 s [doctest] [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
  1011. 72.35 s [doctest] [16 of 44] Compiling Location ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
  1012. 72.35 s [doctest] [17 of 44] Compiling LocationSpec ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
  1013. 72.35 s [doctest] [18 of 44] Compiling Options ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
  1014. 72.35 s [doctest] [19 of 44] Compiling OptionsSpec ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
  1015. 72.74 s [doctest] [20 of 44] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
  1016. 72.74 s [doctest] [21 of 44] Compiling PackageDBsSpec ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
  1017. 72.74 s [doctest] [22 of 44] Compiling Paths_doctest ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
  1018. 72.74 s [doctest] [23 of 44] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Cabal.o )
  1019. 72.74 s [doctest] [24 of 44] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Location.o )
  1020. 72.74 s [doctest] [25 of 44] Compiling Util ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
  1021. 72.74 s [doctest] [26 of 44] Compiling Extract ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
  1022. 73.48 s [doctest] [27 of 44] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Extract.o )
  1023. 73.53 s [doctest] [28 of 44] Compiling Parse ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
  1024. 74.40 s [doctest] [29 of 44] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Parse.o )
  1025. 74.42 s [doctest] [30 of 44] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
  1026. 75.53 s [doctest] [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
  1027. 76.82 s [doctest] [32 of 44] Compiling Property ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
  1028. 76.82 s [doctest] [33 of 44] Compiling Runner ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
  1029. 77.03 s [doctest] [34 of 44] Compiling RunnerSpec ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
  1030. 77.27 s [doctest] [35 of 44] Compiling Run ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
  1031. 77.29 s [doctest] [36 of 44] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Run.o )
  1032. 77.33 s [doctest] [37 of 44] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
  1033. 77.36 s [doctest] [38 of 44] Compiling RunSpec ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
  1034. 78.52 s [doctest] [39 of 44] Compiling MainSpec ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
  1035. 78.96 s [doctest] [40 of 44] Compiling PropertySpec ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
  1036. 78.96 s [doctest] [41 of 44] Compiling ParseSpec ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
  1037. 78.96 s [doctest] [42 of 44] Compiling ExtractSpec ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
  1038. 78.96 s [doctest] [43 of 44] Compiling UtilSpec ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
  1039. 78.96 s [doctest] [44 of 44] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  1040. 83.13 s [doctest] [45 of 45] Linking dist/build/spec/spec
  1041. 98.63 s [doctest] Preprocessing library for doctest-0.24.2...
  1042. 98.65 s [doctest] Building library for doctest-0.24.2...
  1043. 102.05 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
  1044. 103.06 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
  1045. 113.93 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
  1046. 113.97 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
  1047. 113.97 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
  1048. 113.97 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.o, dist/build/Language/Haskell/GhciWrapper.dyn_o )
  1049. 113.97 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
  1050. 113.97 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
  1051. 113.97 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
  1052. 113.97 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.o, dist/build/Paths_doctest.dyn_o )
  1053. 113.97 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
  1054. 113.97 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
  1055. 113.97 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
  1056. 113.97 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.o, dist/build/Test/DocTest/Internal/Cabal.dyn_o )
  1057. 113.97 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.o, dist/build/Test/DocTest/Internal/Location.dyn_o )
  1058. 113.97 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  1059. 113.97 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
  1060. 117.33 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.o, dist/build/Test/DocTest/Internal/Extract.dyn_o )
  1061. 118.31 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
  1062. 119.51 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.o, dist/build/Test/DocTest/Internal/Parse.dyn_o )
  1063. 119.99 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
  1064. 122.03 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
  1065. 122.03 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
  1066. 123.96 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
  1067. 125.20 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.o, dist/build/Test/DocTest/Internal/Run.dyn_o )
  1068. 125.70 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
  1069. 130.42 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.p_o )
  1070. 131.72 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
  1071. 141.29 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
  1072. 141.33 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
  1073. 141.33 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
  1074. 141.33 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
  1075. 141.33 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.p_o )
  1076. 141.33 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.p_o )
  1077. 141.33 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
  1078. 141.33 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
  1079. 141.33 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.p_o )
  1080. 141.33 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.p_o )
  1081. 142.56 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.p_o )
  1082. 142.56 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
  1083. 142.63 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
  1084. 142.63 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.p_o )
  1085. 142.63 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.p_o )
  1086. 144.14 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
  1087. 144.55 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.p_o )
  1088. 145.63 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
  1089. 146.42 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
  1090. 147.53 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.p_o )
  1091. 147.57 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.p_o )
  1092. 149.98 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.p_o )
  1093. 151.16 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
  1094. 151.67 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
  1095. 171.20 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  1096. 171.20 s [doctest] Building executable 'doctest' for doctest-0.24.2...
  1097. 171.62 s [doctest] [1 of 2] Compiling Main ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
  1098. 172.54 s [doctest] [2 of 2] Compiling Paths_doctest ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
  1099. 173.38 s [doctest] [3 of 3] Linking dist/build/doctest/doctest
  1100. 183.84 s [doctest] buildPhase completed in 1 minutes 59 seconds
  1101. 183.84 s [doctest] Phase: checkPhase
  1102. 184.99 s [doctest] Running 1 test suites...
  1103. 185.00 s [doctest] Test suite spec: RUNNING...
  1104. 185.05 s [doctest]
  1105. 185.05 s [doctest] Extract
  1106. 185.05 s [doctest] extract
  1107. 185.24 s [doctest] extracts documentation for a top-level declaration [✔]
  1108. 185.37 s [doctest] extracts documentation from argument list [✔]
  1109. 185.46 s [doctest] extracts documentation for a type class function [✔]
  1110. 185.58 s [doctest] extracts documentation from the argument list of a type class function [✔]
  1111. 185.69 s [doctest] extracts documentation from the module header [✔]
  1112. 185.82 s [doctest] extracts documentation from imported modules [✔]
  1113. 185.93 s [doctest] extracts documentation from export list [✔]
  1114. 186.04 s [doctest] extracts documentation from named chunks [✔]
  1115. 186.16 s [doctest] returns docstrings in the same order they appear in the source [✔]
  1116. 186.26 s [doctest] extracts $setup code [✔]
  1117. 186.34 s [doctest] fails on invalid flags [✔]
  1118. 186.34 s [doctest] extract (regression tests)
  1119. 186.46 s [doctest] works with infix operators [✔]
  1120. 186.61 s [doctest] works with parallel list comprehensions [✔]
  1121. 186.70 s [doctest] works with list comprehensions in instance definitions [✔]
  1122. 186.85 s [doctest] works with foreign imports [✔]
  1123. 187.03 s [doctest] works for rewrite rules [✔]
  1124. 187.15 s [doctest] works for rewrite rules with type signatures [✔]
  1125. 187.26 s [doctest] strips CR from dos line endings [✔]
  1126. 187.45 s [doctest] works with a module that splices in an expression from an other module [✔]
  1127. 187.59 s [doctest] works for type families and GHC 7.6.1 [✔]
  1128. 187.59 s [doctest] Info
  1129. 187.59 s [doctest] formatInfo
  1130. 187.82 s [doctest] formats --info output [✔]
  1131. 187.82 s [doctest] Interpreter
  1132. 187.82 s [doctest] interpreterSupported
  1133. 187.98 s [doctest] indicates whether GHCi is supported on current platform [✔]
  1134. 187.98 s [doctest] ghcInfo
  1135. 188.15 s [doctest] includes "Have interpreter" [✔]
  1136. 188.15 s [doctest] safeEval
  1137. 188.79 s [doctest] evaluates an expression [✔]
  1138. 189.42 s [doctest] returns Left on unterminated multiline command [✔]
  1139. 189.42 s [doctest] filterExpression
  1140. 189.42 s [doctest] removes :set -XTemplateHaskell [✔]
  1141. 189.45 s [doctest] filters -XTemplateHaskell [✔]
  1142. 189.45 s [doctest] leaves :set-statement that do not set -XTemplateHaskell alone [✔]
  1143. 189.45 s [doctest] Language.Haskell.GhciWrapper
  1144. 189.45 s [doctest] evalEcho
  1145. 190.19 s [doctest] prints result to stdout [✔]
  1146. 190.19 s [doctest] evalWith
  1147. 190.19 s [doctest] with PreserveIt
  1148. 190.92 s [doctest] preserves it [✔]
  1149. 190.92 s [doctest] eval
  1150. 191.57 s [doctest] shows literals [✔]
  1151. 192.22 s [doctest] shows string literals containing Unicode [✔]
  1152. 192.94 s [doctest] evaluates simple expressions [✔]
  1153. 193.68 s [doctest] supports let bindings [✔]
  1154. 194.39 s [doctest] allows import statements [✔]
  1155. 194.98 s [doctest] captures stdout [✔]
  1156. 195.65 s [doctest] captures stdout (Unicode) [✔]
  1157. 196.40 s [doctest] captures stdout (empty line) [✔]
  1158. 197.12 s [doctest] captures stdout (multiple lines) [✔]
  1159. 197.82 s [doctest] captures stderr [✔]
  1160. 198.57 s [doctest] captures stderr (Unicode) [✔]
  1161. 199.35 s [doctest] shows exceptions [✔]
  1162. 200.09 s [doctest] shows exceptions (ExitCode) [✔]
  1163. 200.81 s [doctest] gives an error message for identifiers that are not in scope [✔]
  1164. 200.85 s [doctest] when configVerbose is True
  1165. 201.51 s [doctest] prints prompt [✔]
  1166. 201.51 s [doctest] with -XOverloadedStrings, -Wall and -Werror
  1167. 202.16 s [doctest] does not fail on marker expression (bug fix) [✔]
  1168. 202.16 s [doctest] with NoImplicitPrelude
  1169. 202.89 s [doctest] works [✔]
  1170. 202.89 s [doctest] with a strange String type
  1171. 203.66 s [doctest] works [✔]
  1172. 203.66 s [doctest] Location
  1173. 203.66 s [doctest] toLocation
  1174. 203.66 s [doctest] works for a regular SrcSpan [✔]
  1175. 203.66 s [doctest] works for a single-line SrcSpan [✔]
  1176. 203.66 s [doctest] works for a SrcSpan that corresponds to single point [✔]
  1177. 203.66 s [doctest] works for a bad SrcSpan [✔]
  1178. 203.66 s [doctest] works for a SrcLoc with bad locations [✔]
  1179. 203.66 s [doctest] enumerate
  1180. 203.66 s [doctest] replicates UnhelpfulLocation [✔]
  1181. 203.66 s [doctest] enumerates Location [✔]
  1182. 203.66 s [doctest] Main
  1183. 203.66 s [doctest] doctest
  1184. 204.46 s [doctest] testSimple [✔]
  1185. 205.48 s [doctest] it-variable [✔]
  1186. 206.46 s [doctest] it-variable in $setup [✔]
  1187. 207.27 s [doctest] failing [✔]
  1188. 207.89 s [doctest] skips subsequent examples from the same group if an example fails [✔]
  1189. 207.89 s [doctest] without --fail-fast
  1190. 208.54 s [doctest] continuous even if some tests fail [✔]
  1191. 208.54 s [doctest] with --fail-fast
  1192. 209.15 s [doctest] stops after the first failure [✔]
  1193. 209.74 s [doctest] stops after failures in $setup [✔]
  1194. 211.04 s [doctest] testImport [✔]
  1195. 211.87 s [doctest] testCommentLocation [✔]
  1196. 212.59 s [doctest] testPutStr [✔]
  1197. 213.21 s [doctest] fails on multi-line expressions, introduced with :{ [✔]
  1198. 213.93 s [doctest] testBlankline [✔]
  1199. 214.76 s [doctest] examples from the same Haddock comment share the same scope [✔]
  1200. 215.49 s [doctest] testDocumentationForArguments [✔]
  1201. 216.47 s [doctest] template-haskell [✔]
  1202. 217.23 s [doctest] handles source files with CRLF line endings [✔]
  1203. 217.83 s [doctest] runs $setup before each test group [✔]
  1204. 218.49 s [doctest] skips subsequent tests from a module, if $setup fails [✔]
  1205. 219.11 s [doctest] ignores trailing whitespace when matching test output [✔]
  1206. 219.15 s [doctest] doctest as a runner for QuickCheck properties
  1207. 220.20 s [doctest] runs a boolean property [✔]
  1208. 221.44 s [doctest] runs an explicitly quantified property [✔]
  1209. 222.71 s [doctest] runs an implicitly quantified property [✔]
  1210. 223.98 s [doctest] reports a failing property [✔]
  1211. 225.05 s [doctest] runs a boolean property with an explicit type signature [✔]
  1212. 226.27 s [doctest] runs $setup before each property [✔]
  1213. 226.27 s [doctest] doctest (regression tests)
  1214. 227.70 s [doctest] bugfixWorkingDirectory [✔]
  1215. 228.36 s [doctest] bugfixOutputToStdErr [✔]
  1216. 229.10 s [doctest] bugfixImportHierarchical [✔]
  1217. 229.90 s [doctest] bugfixMultipleModules [✔]
  1218. 231.35 s [doctest] testCPP [✔]
  1219. 232.38 s [doctest] template-haskell-bugfix [✔]
  1220. 233.09 s [doctest] doesn't clash with user bindings of stdout/stderr [✔]
  1221. 233.82 s [doctest] doesn't get confused by doctests using System.IO imports [✔]
  1222. 233.82 s [doctest] Options
  1223. 233.82 s [doctest] parseOptions
  1224. 233.82 s [doctest] strips --optghc [✔]
  1225. 233.82 s [doctest] strips --optghc= [✔]
  1226. 233.82 s [doctest] with ghc options that are not valid with --interactive
  1227. 233.89 s [doctest] returns ProxyToGhc [✔]
  1228. 233.89 s [doctest] +++ OK, passed 100 tests.
  1229. 233.89 s [doctest] with --interactive
  1230. 233.89 s [doctest] disables magic mode [✔]
  1231. 233.89 s [doctest] filters out --interactive [✔]
  1232. 233.89 s [doctest] accepts --fast [✔]
  1233. 233.89 s [doctest] --no-magic
  1234. 233.89 s [doctest] without --no-magic
  1235. 233.89 s [doctest] enables magic mode [✔]
  1236. 233.89 s [doctest] with --no-magic
  1237. 233.89 s [doctest] disables magic mode [✔]
  1238. 233.89 s [doctest] --fast
  1239. 233.89 s [doctest] without --fast
  1240. 233.89 s [doctest] disables fast mode [✔]
  1241. 233.89 s [doctest] with --fast
  1242. 233.89 s [doctest] enables fast mode [✔]
  1243. 233.90 s [doctest] --preserve-it
  1244. 233.90 s [doctest] without --preserve-it
  1245. 233.90 s [doctest] does not preserve the `it` variable [✔]
  1246. 233.90 s [doctest] with --preserve-it
  1247. 233.90 s [doctest] preserves the `it` variable [✔]
  1248. 233.90 s [doctest] --fail-fast
  1249. 233.90 s [doctest] without --fail-fast
  1250. 233.90 s [doctest] disables fail-fast mode [✔]
  1251. 233.90 s [doctest] with --fail-fast
  1252. 233.90 s [doctest] enables fail-fast mode [✔]
  1253. 233.90 s [doctest] with --help
  1254. 233.90 s [doctest] outputs usage information [✔]
  1255. 233.90 s [doctest] with --version
  1256. 233.90 s [doctest] outputs version information [✔]
  1257. 233.90 s [doctest] with --info
  1258. 234.04 s [doctest] outputs machine readable version information [✔]
  1259. 234.04 s [doctest] --verbose
  1260. 234.04 s [doctest] without --verbose
  1261. 234.04 s [doctest] is not verbose by default [✔]
  1262. 234.04 s [doctest] with --verbose
  1263. 234.04 s [doctest] parses verbose option [✔]
  1264. 234.04 s [doctest] PackageDBs
  1265. 234.04 s [doctest] getPackageDBsFromEnv
  1266. 234.04 s [doctest] uses global and user when no env used [✔]
  1267. 234.05 s [doctest] respects GHC_PACKAGE_PATH [✔]
  1268. 234.05 s [doctest] Parse
  1269. 234.05 s [doctest] extractDocTests
  1270. 234.18 s [doctest] extracts properties from a module [✔]
  1271. 234.26 s [doctest] extracts examples from a module [✔]
  1272. 234.38 s [doctest] extracts examples from documentation for non-exported names [✔]
  1273. 234.49 s [doctest] extracts multiple examples from a module [✔]
  1274. 234.61 s [doctest] returns an empty list, if documentation contains no examples [✔]
  1275. 234.72 s [doctest] sets setup code to Nothing, if it does not contain any tests [✔]
  1276. 234.80 s [doctest] keeps modules that only contain setup code [✔]
  1277. 234.80 s [doctest] parseInteractions (an internal function)
  1278. 234.80 s [doctest] parses an interaction [✔]
  1279. 234.80 s [doctest] drops whitespace as appropriate [✔]
  1280. 234.80 s [doctest] parses an interaction without a result [✔]
  1281. 234.80 s [doctest] works with a complex example [✔]
  1282. 234.81 s [doctest] attaches location information to parsed interactions [✔]
  1283. 234.81 s [doctest] basic multiline [✔]
  1284. 234.81 s [doctest] multiline align output [✔]
  1285. 234.81 s [doctest] multiline align output with >>> [✔]
  1286. 234.81 s [doctest] parses wild cards lines [✔]
  1287. 234.81 s [doctest] parses wild card chunks [✔]
  1288. 234.81 s [doctest] parseProperties (an internal function)
  1289. 234.81 s [doctest] parses a property [✔]
  1290. 234.81 s [doctest] mkLineChunks (an internal function)
  1291. 234.81 s [doctest] replaces ellipsis with WildCardChunks [✔]
  1292. 234.81 s [doctest] doesn't replace fewer than 3 consecutive dots [✔]
  1293. 234.81 s [doctest] handles leading and trailing dots [✔]
  1294. 234.81 s [doctest] handles leading and trailing ellipsis [✔]
  1295. 234.81 s [doctest] Property
  1296. 234.81 s [doctest] runProperty
  1297. 235.90 s [doctest] reports a failing property [✔]
  1298. 236.89 s [doctest] runs a Bool property [✔]
  1299. 237.74 s [doctest] runs a Bool property with an explicit type signature [✔]
  1300. 238.73 s [doctest] runs an implicitly quantified property [✔]
  1301. 239.88 s [doctest] runs an implicitly quantified property even with GHC 7.4 [✔]
  1302. 240.98 s [doctest] runs an explicitly quantified property [✔]
  1303. 242.07 s [doctest] allows to mix implicit and explicit quantification [✔]
  1304. 243.19 s [doctest] reports the value for which a property fails [✔]
  1305. 244.46 s [doctest] reports the values for which a property that takes multiple arguments fails [✔]
  1306. 245.43 s [doctest] defaults ambiguous type variables to Integer [✔]
  1307. 245.43 s [doctest] freeVariables
  1308. 246.11 s [doctest] finds a free variables in a term [✔]
  1309. 246.95 s [doctest] ignores duplicates [✔]
  1310. 248.01 s [doctest] works for terms with multiple names [✔]
  1311. 248.93 s [doctest] works for names that contain a prime [✔]
  1312. 249.58 s [doctest] works for names that are similar to other names that are in scope [✔]
  1313. 249.58 s [doctest] parseNotInScope
  1314. 249.58 s [doctest] when error message was produced by GHC 7.4.1
  1315. 249.62 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  1316. 249.62 s [doctest] ignores duplicates [✔]
  1317. 249.62 s [doctest] works for variable names that contain a prime [✔]
  1318. 249.62 s [doctest] works for error messages with suggestions [✔]
  1319. 249.62 s [doctest] when error message was produced by GHC 8.0.1
  1320. 249.62 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  1321. 249.62 s [doctest] ignores duplicates [✔]
  1322. 249.62 s [doctest] works for variable names that contain a prime [✔]
  1323. 249.62 s [doctest] works for error messages with suggestions [✔]
  1324. 249.62 s [doctest] Run
  1325. 249.62 s [doctest] doctest
  1326. 250.86 s [doctest] exits with ExitFailure if at least one test case fails [✔]
  1327. 250.86 s [doctest] prints help on --help [✔]
  1328. 250.86 s [doctest] prints version on --version [✔]
  1329. 252.04 s [doctest] accepts arbitrary GHC options [✔]
  1330. 253.02 s [doctest] accepts GHC options with --optghc [✔]
  1331. 254.14 s [doctest] prints a deprecation message for --optghc [✔]
  1332. 254.37 s [doctest] prints error message on invalid option [✔]
  1333. 255.44 s [doctest] interprets GHC response files [✔]
  1334. 256.37 s [doctest] prints verbose description of a specification [✔]
  1335. 257.37 s [doctest] prints verbose description of a property [✔]
  1336. 258.37 s [doctest] prints verbose error [✔]
  1337. 259.34 s [doctest] can deal with potentially problematic GHC options [✔]
  1338. 259.34 s [doctest] doctestWithResult
  1339. 259.34 s [doctest] on parse error
  1340. 259.44 s [doctest] aborts with (ExitFailure 1) [✔]
  1341. 259.51 s [doctest] prints a useful error message [✔]
  1342. 259.51 s [doctest] expandDirs
  1343. 259.51 s [doctest] expands a directory [✔]
  1344. 259.51 s [doctest] ignores files [✔]
  1345. 259.51 s [doctest] ignores random things [✔]
  1346. 259.51 s [doctest] Runner
  1347. 259.51 s [doctest] report
  1348. 259.51 s [doctest] when mode is interactive
  1349. 259.51 s [doctest] writes to stderr [✔]
  1350. 259.51 s [doctest] when mode is non-interactive
  1351. 259.51 s [doctest] writes to stderr [✔]
  1352. 259.51 s [doctest] report_
  1353. 259.51 s [doctest] when mode is interactive
  1354. 259.51 s [doctest] writes transient output to stderr [✔]
  1355. 259.51 s [doctest] when mode is non-interactive
  1356. 259.51 s [doctest] is ignored [✔]
  1357. 259.51 s [doctest] Runner.Example
  1358. 259.51 s [doctest] mkResult
  1359. 259.77 s [doctest] returns Equal when output matches [✔]
  1360. 259.77 s [doctest] +++ OK, passed 100 tests.
  1361. 259.78 s [doctest] ignores trailing whitespace [✔]
  1362. 259.78 s [doctest] with WildCardLine
  1363. 259.79 s [doctest] matches zero lines [✔]
  1364. 259.79 s [doctest] matches first zero line [✔]
  1365. 259.80 s [doctest] matches final zero line [✔]
  1366. 259.81 s [doctest] matches an arbitrary number of lines [✔]
  1367. 259.82 s [doctest] matches an arbitrary number of lines (quickcheck) [✔]
  1368. 259.82 s [doctest] +++ OK, passed 100 tests.
  1369. 259.82 s [doctest] with WildCardChunk
  1370. 259.82 s [doctest] matches an arbitrary line chunk [✔]
  1371. 259.82 s [doctest] matches an arbitrary line chunk at end [✔]
  1372. 259.82 s [doctest] does not match at end [✔]
  1373. 259.82 s [doctest] does not match at start [✔]
  1374. 259.82 s [doctest] when output does not match
  1375. 259.82 s [doctest] constructs failure message [✔]
  1376. 259.82 s [doctest] constructs failure message for multi-line output [✔]
  1377. 259.82 s [doctest] when any output line contains "unsafe" characters
  1378. 259.82 s [doctest] uses show to format output lines [✔]
  1379. 259.82 s [doctest] insert caret after last matching character on different lengths [✔]
  1380. 259.82 s [doctest] insert caret after mismatching line for multi-line output [✔]
  1381. 259.82 s [doctest] insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
  1382. 259.82 s [doctest] insert caret after longest match for wildcard [✔]
  1383. 259.82 s [doctest] show expanded pattern for long matches [✔]
  1384. 259.82 s [doctest] Util
  1385. 259.82 s [doctest] convertDosLineEndings
  1386. 259.82 s [doctest] converts CRLF to LF [✔]
  1387. 259.82 s [doctest] strips a trailing CR [✔]
  1388. 259.82 s [doctest] takeWhileEnd
  1389. 259.82 s [doctest] returns the longest suffix of elements that satisfy a given predicate [✔]
  1390. 259.82 s [doctest]
  1391. 259.82 s [doctest] Finished in 74.7809 seconds
  1392. 259.83 s [doctest] 198 examples, 0 failures
  1393. 259.87 s [doctest] Test suite spec: PASS
  1394. 259.87 s [doctest] Test suite logged to: dist/test/doctest-0.24.2-spec.log
  1395. 259.87 s [doctest] 1 of 1 test suites (1 of 1 test cases) passed.
  1396. 259.89 s [doctest] checkPhase completed in 1 minutes 16 seconds
  1397. 259.89 s [doctest] Phase: haddockPhase
  1398. 260.42 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  1399. 260.47 s [doctest] Preprocessing library for doctest-0.24.2...
  1400. 260.49 s [doctest] Running Haddock on library for doctest-0.24.2...
  1401. 262.89 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, nothing )
  1402. 263.23 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, nothing )
  1403. 264.80 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, nothing )
  1404. 265.01 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, nothing )
  1405. 265.15 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, nothing )
  1406. 265.23 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, nothing )
  1407. 265.41 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, nothing )
  1408. 265.48 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, nothing )
  1409. 265.58 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, nothing )
  1410. 265.62 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, nothing )
  1411. 265.67 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, nothing )
  1412. 266.20 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, nothing )
  1413. 266.35 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, nothing )
  1414. 266.56 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, nothing )
  1415. 266.57 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, nothing )
  1416. 266.58 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, nothing )
  1417. 266.60 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, nothing )
  1418. 267.14 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, nothing )
  1419. 267.14 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, nothing )
  1420. 267.36 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, nothing )
  1421. 267.38 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, nothing )
  1422. 267.59 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, nothing )
  1423. 267.70 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, nothing )
  1424. 267.97 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, nothing )
  1425. 268.08 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, nothing )
  1426. 268.09 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, nothing )
  1427. 268.09 s [doctest] Haddock coverage:
  1428. 268.10 s [doctest] Warning: Imports: Could not find documentation for exported module: Imports
  1429. 268.13 s [doctest] 0% ( 0 / 2) in 'Test.DocTest.Internal.Cabal'
  1430. 268.14 s [doctest] Missing documentation for:
  1431. 268.14 s [doctest] Module header
  1432. 268.14 s [doctest] doctest (src/Test/DocTest/Internal/Cabal.hs:10)
  1433. 268.14 s [doctest] 88% ( 8 / 9) in 'Test.DocTest.Internal.Location'
  1434. 268.14 s [doctest] Missing documentation for:
  1435. 268.14 s [doctest] Module header
  1436. 268.14 s [doctest] Warning: 'SomeException' is ambiguous. It is defined
  1437. 268.14 s [doctest] * in ‘GHC.Internal.Exception.Type’
  1438. 268.14 s [doctest] * in ‘GHC.Internal.Exception.Type’
  1439. 268.14 s [doctest] You may be able to disambiguate the identifier by qualifying it or
  1440. 268.14 s [doctest] by specifying the type/value namespace explicitly.
  1441. 268.14 s [doctest] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  1442. 268.15 s [doctest] 66% ( 2 / 3) in 'Test.DocTest.Internal.Extract'
  1443. 268.15 s [doctest] Missing documentation for:
  1444. 268.16 s [doctest] Module header
  1445. 268.17 s [doctest] 22% ( 2 / 9) in 'Test.DocTest.Internal.Parse'
  1446. 268.17 s [doctest] Missing documentation for:
  1447. 268.17 s [doctest] Module header
  1448. 268.17 s [doctest] DocTest (src/Parse.hs:29)
  1449. 268.17 s [doctest] Expression (src/Parse.hs:44)
  1450. 268.17 s [doctest] ExpectedResult (src/Parse.hs:45)
  1451. 268.17 s [doctest] ExpectedLine (src/Parse.hs:38)
  1452. 268.17 s [doctest] LineChunk (src/Parse.hs:32)
  1453. 268.17 s [doctest] parseModules (src/Parse.hs:60)
  1454. 268.18 s [doctest] Warning: 'report_' is out of scope.
  1455. 268.18 s [doctest] If you qualify the identifier, haddock can try to link it anyway.
  1456. 268.20 s [doctest] 15% ( 2 / 13) in 'Test.DocTest.Internal.Run'
  1457. 268.20 s [doctest] Missing documentation for:
  1458. 268.20 s [doctest] Module header
  1459. 268.20 s [doctest] Result (src/Run.hs:139)
  1460. 268.20 s [doctest] Config (src/Options.hs:58)
  1461. 268.20 s [doctest] isSuccess (src/Runner.hs:55)
  1462. 268.20 s [doctest] defaultConfig (src/Options.hs:68)
  1463. 268.20 s [doctest] doctestWithRepl (src/Run.hs:67)
  1464. 268.20 s [doctest] doctestWith (src/Run.hs:137)
  1465. 268.20 s [doctest] formatSummary (src/Runner.hs:58)
  1466. 268.20 s [doctest] evaluateResult (src/Run.hs:142)
  1467. 268.20 s [doctest] doctestWithResult (src/Run.hs:145)
  1468. 268.20 s [doctest] runDocTests (src/Run.hs:155)
  1469. 268.20 s [doctest] 50% ( 1 / 2) in 'Test.DocTest'
  1470. 268.20 s [doctest] Missing documentation for:
  1471. 268.20 s [doctest] Module header
  1472. 309.34 s [doctest] Documentation created: dist/doc/html/doctest/,
  1473. 309.34 s [doctest] dist/doc/html/doctest/doctest.txt
  1474. 309.58 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  1475. 309.60 s [doctest] haddockPhase completed in 50 seconds
  1476. 309.60 s [doctest] Phase: installPhase
  1477. 309.87 s [doctest] Installing library in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1478. 310.07 s [doctest] Installing executable doctest in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin
  1479. 310.07 s [doctest] Warning: The directory
  1480. 310.07 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin is not in the
  1481. 310.07 s [doctest] system search path.
  1482. 312.38 s [doctest] Phase: fixupPhase
  1483. 312.44 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2
  1484. 312.44 s [doctest] shrinking /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  1485. 312.89 s [doctest] shrinking /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSdoctest-0.24.2-18dgXXsZmap5NU7dF4zxUR-ghc9.10.3.so
  1486. 312.90 s [doctest] checking for references to /build/ in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2...
  1487. 313.25 s [doctest] patching script interpreter paths in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2
  1488. 313.27 s [doctest] stripping (with command strip and flags -S -p) in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin
  1489. 314.23 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc
  1490. 314.26 s [doctest] checking for references to /build/ in /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc...
  1491. 314.32 s [doctest] patching script interpreter paths in /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc
  1492. 315.72 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2 /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc
  1493. 323.43 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  1494. 323.57 s [post-build-hook] Uploading to the NixCI cache: /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2 /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc
  1495. 324.07 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1496. 324.32 s [post-build-hook] copying 1 paths...
  1497. 324.33 s [post-build-hook] copying path '/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2' to 'https://cache.nix-ci.com'...
  1498. 390.85 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1499. 391.05 s [post-build-hook] copying 0 paths...
  1500. 391.10 s Progress: 5 of 22 built, 193 of 193 downloaded from cache
  1501. 391.21 s Building duoids
  1502. 391.29 s Building vector
  1503. 391.38 s [duoids] Phase: setupCompilerEnvironmentPhase
  1504. 391.38 s [duoids] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  1505. 391.48 s [vector] Phase: setupCompilerEnvironmentPhase
  1506. 391.49 s [vector] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  1507. 391.83 s [duoids] Phase: unpackPhase
  1508. 391.84 s [duoids] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./core
  1509. 391.86 s [duoids] source root is core
  1510. 391.88 s [duoids] Phase: patchPhase
  1511. 391.90 s [duoids] Phase: compileBuildDriverPhase
  1512. 391.91 s [duoids] setupCompileFlags: -package-db=/build/tmp.1ad8Hl5Fcb/setup-package.conf.d -threaded
  1513. 392.09 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.1ad8Hl5Fcb/Main.o )
  1514. 392.11 s [vector] Phase: unpackPhase
  1515. 392.12 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  1516. 392.14 s [vector] source root is vector-0.13.2.0
  1517. 392.16 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  1518. 392.17 s [vector] Phase: patchPhase
  1519. 392.17 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  1520. 392.18 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  1521. 392.24 s [vector] Phase: compileBuildDriverPhase
  1522. 392.25 s [vector] setupCompileFlags: -package-db=/build/tmp.X0qFWDXGKO/setup-package.conf.d -threaded
  1523. 392.26 s [duoids] [2 of 2] Linking Setup
  1524. 392.45 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.X0qFWDXGKO/Main.o )
  1525. 392.60 s [vector] [2 of 2] Linking Setup
  1526. 395.55 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  1527. 395.58 s [vector] Phase: configurePhase
  1528. 395.60 s [vector] configureFlags: --verbose --prefix=/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.X0qFWDXGKO/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  1529. 395.65 s [vector] Using Parsec parser
  1530. 395.65 s [vector] Configuring vector-0.13.2.0...
  1531. 395.83 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  1532. 395.84 s [duoids] Phase: configurePhase
  1533. 395.85 s [duoids] configureFlags: --verbose --prefix=/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.1ad8Hl5Fcb/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  1534. 395.87 s [duoids] Using Parsec parser
  1535. 395.87 s [duoids] Configuring duoids-0.0.1.0...
  1536. 396.60 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  1537. 396.64 s [vector] wall=False
  1538. 396.70 s [duoids] Flags chosen: lint=False, noisy-deprecations=True
  1539. 397.41 s [vector] Dependency base: using base-4.20.2.0
  1540. 397.41 s [vector] Dependency deepseq: using deepseq-1.5.0.0
  1541. 397.41 s [vector] Dependency primitive: using primitive-0.9.1.0
  1542. 397.41 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  1543. 397.41 s [vector] Dependency base: using base-4.20.2.0
  1544. 397.41 s [vector] Dependency random: using random-1.2.1.3
  1545. 397.41 s [vector] Dependency tasty: using tasty-1.5.3
  1546. 397.41 s [vector] Dependency vector: using vector-0.13.2.0
  1547. 397.41 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  1548. 397.41 s [vector] Dependency base: using base-4.20.2.0
  1549. 397.41 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  1550. 397.41 s [vector] Dependency primitive: using primitive-0.9.1.0
  1551. 397.41 s [vector] Dependency random: using random-1.2.1.3
  1552. 397.41 s [vector] Dependency tasty: using tasty-1.5.3
  1553. 397.41 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  1554. 397.41 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  1555. 397.41 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  1556. 397.41 s [vector] Dependency transformers: using transformers-0.6.1.1
  1557. 397.41 s [vector] Dependency vector: using vector-0.13.2.0
  1558. 397.41 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  1559. 397.41 s [vector] Dependency base: using base-4.20.2.0
  1560. 397.41 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  1561. 397.41 s [vector] Dependency primitive: using primitive-0.9.1.0
  1562. 397.41 s [vector] Dependency random: using random-1.2.1.3
  1563. 397.41 s [vector] Dependency tasty: using tasty-1.5.3
  1564. 397.41 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  1565. 397.41 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  1566. 397.41 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  1567. 397.41 s [vector] Dependency transformers: using transformers-0.6.1.1
  1568. 397.41 s [vector] Dependency vector: using vector-0.13.2.0
  1569. 397.41 s [vector] Dependency base: using base-4.20.2.0
  1570. 397.41 s [vector] Dependency doctest: using doctest-0.24.2
  1571. 397.41 s [vector] Dependency primitive: using primitive-0.9.1.0
  1572. 397.41 s [vector] Dependency vector: using vector-0.13.2.0
  1573. 397.41 s [vector] Dependency base: using base-4.20.2.0
  1574. 397.41 s [vector] Dependency primitive: using primitive-0.9.1.0
  1575. 397.41 s [vector] Dependency tasty: using tasty-1.5.3
  1576. 397.41 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  1577. 397.41 s [vector] Dependency vector: using vector-0.13.2.0
  1578. 397.41 s [vector] Source component graph:
  1579. 397.41 s [vector] component lib
  1580. 397.41 s [vector] component lib:benchmarks-O2 dependency lib
  1581. 397.41 s [vector] component test:vector-doctest dependency lib
  1582. 397.41 s [vector] component test:vector-inspection dependency lib
  1583. 397.41 s [vector] component test:vector-tests-O0 dependency lib
  1584. 397.41 s [vector] component test:vector-tests-O2 dependency lib
  1585. 397.41 s [vector] Configured component graph:
  1586. 397.41 s [vector] component vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1587. 397.41 s [vector] include base-4.20.2.0-acb8
  1588. 397.41 s [vector] include deepseq-1.5.0.0-7e72
  1589. 397.41 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1590. 397.41 s [vector] include vector-stream-0.1.0.1-2tj7oI3vwQGAFca6yIjUY2
  1591. 397.41 s [vector] component vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
  1592. 397.41 s [vector] include base-4.20.2.0-acb8
  1593. 397.41 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1594. 397.41 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1595. 397.41 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1596. 397.41 s [vector] component vector-0.13.2.0-JbFHaIgT3rIJKb0WGEV1Eg-vector-doctest
  1597. 397.41 s [vector] include base-4.20.2.0-acb8
  1598. 397.41 s [vector] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1599. 397.41 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1600. 397.41 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1601. 397.41 s [vector] component vector-0.13.2.0-knuS4JeBvcGrPgIe2h2Ro-vector-inspection
  1602. 397.41 s [vector] include base-4.20.2.0-acb8
  1603. 397.41 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1604. 397.41 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1605. 397.41 s [vector] include tasty-inspection-testing-0.2.1-DJtNDI9X64S9lohYBgxqCJ
  1606. 397.41 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1607. 397.41 s [vector] component vector-0.13.2.0-DnSPcwBcWgq9zTMimd0nah-vector-tests-O0
  1608. 397.41 s [vector] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1609. 397.41 s [vector] include base-4.20.2.0-acb8
  1610. 397.41 s [vector] include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1611. 397.41 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1612. 397.41 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1613. 397.41 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1614. 397.41 s [vector] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1615. 397.41 s [vector] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1616. 397.41 s [vector] include template-haskell-2.22.0.0-af3f
  1617. 397.41 s [vector] include transformers-0.6.1.1-74e0
  1618. 397.41 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1619. 397.41 s [vector] component vector-0.13.2.0-CU97HsECnd7DuGJDQvy5Pn-vector-tests-O2
  1620. 397.41 s [vector] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1621. 397.41 s [vector] include base-4.20.2.0-acb8
  1622. 397.41 s [vector] include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1623. 397.41 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1624. 397.41 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1625. 397.41 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1626. 397.41 s [vector] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1627. 397.41 s [vector] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1628. 397.41 s [vector] include template-haskell-2.22.0.0-af3f
  1629. 397.41 s [vector] include transformers-0.6.1.1-74e0
  1630. 397.41 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1631. 397.41 s [vector] Linked component graph:
  1632. 397.41 s [vector] unit vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1633. 397.41 s [vector] include base-4.20.2.0-acb8
  1634. 397.41 s [vector] include deepseq-1.5.0.0-7e72
  1635. 397.41 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1636. 397.41 s [vector] include vector-stream-0.1.0.1-2tj7oI3vwQGAFca6yIjUY2
  1637. 397.41 s [vector] Data.Vector=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Unboxed.Mutable
  1638. 397.41 s [vector] unit vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
  1639. 397.41 s [vector] include base-4.20.2.0-acb8
  1640. 397.41 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1641. 397.41 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1642. 397.41 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1643. 397.49 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.TestData.ParenTree
  1644. 397.50 s [vector] unit vector-0.13.2.0-JbFHaIgT3rIJKb0WGEV1Eg-vector-doctest
  1645. 397.50 s [vector] include base-4.20.2.0-acb8
  1646. 397.50 s [vector] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1647. 397.50 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1648. 397.50 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1649. 397.50 s [vector] unit vector-0.13.2.0-knuS4JeBvcGrPgIe2h2Ro-vector-inspection
  1650. 397.50 s [vector] include base-4.20.2.0-acb8
  1651. 397.50 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1652. 397.50 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1653. 397.50 s [vector] include tasty-inspection-testing-0.2.1-DJtNDI9X64S9lohYBgxqCJ
  1654. 397.50 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1655. 397.50 s [vector] unit vector-0.13.2.0-DnSPcwBcWgq9zTMimd0nah-vector-tests-O0
  1656. 397.50 s [vector] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1657. 397.50 s [vector] include base-4.20.2.0-acb8
  1658. 397.50 s [vector] include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1659. 397.50 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1660. 397.50 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1661. 397.50 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1662. 397.50 s [vector] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1663. 397.50 s [vector] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1664. 397.50 s [vector] include template-haskell-2.22.0.0-af3f
  1665. 397.50 s [vector] include transformers-0.6.1.1-74e0
  1666. 397.50 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1667. 397.50 s [vector] unit vector-0.13.2.0-CU97HsECnd7DuGJDQvy5Pn-vector-tests-O2
  1668. 397.50 s [vector] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1669. 397.50 s [vector] include base-4.20.2.0-acb8
  1670. 397.50 s [vector] include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1671. 397.50 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1672. 397.50 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1673. 397.50 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1674. 397.50 s [vector] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1675. 397.50 s [vector] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1676. 397.50 s [vector] include template-haskell-2.22.0.0-af3f
  1677. 397.50 s [vector] include transformers-0.6.1.1-74e0
  1678. 397.50 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1679. 397.50 s [vector] Ready component graph:
  1680. 397.50 s [vector] definite vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1681. 397.50 s [vector] depends base-4.20.2.0-acb8
  1682. 397.50 s [vector] depends deepseq-1.5.0.0-7e72
  1683. 397.50 s [vector] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1684. 397.50 s [vector] depends vector-stream-0.1.0.1-2tj7oI3vwQGAFca6yIjUY2
  1685. 397.50 s [vector] definite vector-0.13.2.0-CU97HsECnd7DuGJDQvy5Pn-vector-tests-O2
  1686. 397.50 s [vector] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1687. 397.50 s [vector] depends base-4.20.2.0-acb8
  1688. 397.50 s [vector] depends base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1689. 397.50 s [vector] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1690. 397.50 s [vector] depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1691. 397.50 s [vector] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1692. 397.50 s [vector] depends tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1693. 397.50 s [vector] depends tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1694. 397.50 s [vector] depends template-haskell-2.22.0.0-af3f
  1695. 397.50 s [vector] depends transformers-0.6.1.1-74e0
  1696. 397.50 s [vector] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1697. 397.50 s [vector] definite vector-0.13.2.0-DnSPcwBcWgq9zTMimd0nah-vector-tests-O0
  1698. 397.50 s [vector] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1699. 397.50 s [vector] depends base-4.20.2.0-acb8
  1700. 397.50 s [vector] depends base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1701. 397.50 s [vector] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1702. 397.50 s [vector] depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1703. 397.50 s [vector] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1704. 397.50 s [vector] depends tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1705. 397.50 s [vector] depends tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1706. 397.50 s [vector] depends template-haskell-2.22.0.0-af3f
  1707. 397.50 s [vector] depends transformers-0.6.1.1-74e0
  1708. 397.50 s [vector] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1709. 397.50 s [vector] definite vector-0.13.2.0-JbFHaIgT3rIJKb0WGEV1Eg-vector-doctest
  1710. 397.50 s [vector] depends base-4.20.2.0-acb8
  1711. 397.50 s [vector] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1712. 397.50 s [vector] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1713. 397.50 s [vector] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1714. 397.50 s [vector] definite vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
  1715. 397.50 s [vector] depends base-4.20.2.0-acb8
  1716. 397.50 s [vector] depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1717. 397.50 s [vector] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1718. 397.50 s [vector] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1719. 397.50 s [vector] definite vector-0.13.2.0-knuS4JeBvcGrPgIe2h2Ro-vector-inspection
  1720. 397.50 s [vector] depends base-4.20.2.0-acb8
  1721. 397.50 s [vector] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1722. 397.50 s [vector] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1723. 397.50 s [vector] depends tasty-inspection-testing-0.2.1-DJtNDI9X64S9lohYBgxqCJ
  1724. 397.50 s [vector] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1725. 397.50 s [vector] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1726. 397.50 s [vector] Using compiler: ghc-9.10.3
  1727. 397.50 s [vector] Using install prefix:
  1728. 397.50 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
  1729. 397.50 s [vector] Executables installed in:
  1730. 397.50 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/bin
  1731. 397.50 s [vector] Libraries installed in:
  1732. 397.50 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1733. 397.50 s [vector] Dynamic Libraries installed in:
  1734. 397.50 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  1735. 397.50 s [vector] Private executables installed in:
  1736. 397.50 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0
  1737. 397.50 s [vector] Data files installed in:
  1738. 397.50 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/share/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0
  1739. 397.50 s [vector] Documentation installed in:
  1740. 397.50 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0
  1741. 397.50 s [vector] Configuration files installed in:
  1742. 397.50 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/etc
  1743. 397.50 s [vector] No alex found
  1744. 397.50 s [vector] Using ar found on system at:
  1745. 397.50 s [vector] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  1746. 397.50 s [vector] No c2hs found
  1747. 397.50 s [vector] No cpphs found
  1748. 397.50 s [vector] Using doctest version 0.24.2 found on system at:
  1749. 397.50 s [vector] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  1750. 397.50 s [vector] Using gcc version 14.3.0 given by user at:
  1751. 397.50 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  1752. 397.50 s [vector] Using ghc version 9.10.3 found on system at:
  1753. 397.50 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  1754. 397.50 s [vector] Using ghc-pkg version 9.10.3 found on system at:
  1755. 397.51 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1756. 397.51 s [vector] No ghcjs found
  1757. 397.51 s [vector] No ghcjs-pkg found
  1758. 397.51 s [vector] No greencard found
  1759. 397.51 s [vector] Using haddock version 2.31.1 found on system at:
  1760. 397.51 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1761. 397.51 s [vector] No happy found
  1762. 397.51 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  1763. 397.51 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1764. 397.51 s [vector] No hmake found
  1765. 397.51 s [vector] Using hpc version 0.69 found on system at:
  1766. 397.51 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1767. 397.51 s [vector] Using hsc2hs version 0.68.10 found on system at:
  1768. 397.51 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1769. 397.51 s [vector] Using hscolour version 1.25 found on system at:
  1770. 397.51 s [vector] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  1771. 397.51 s [vector] No jhc found
  1772. 397.51 s [vector] Using ld found on system at:
  1773. 397.51 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  1774. 397.51 s [vector] No pkg-config found
  1775. 397.51 s [vector] Using runghc version 9.10.3 found on system at:
  1776. 397.51 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  1777. 397.51 s [vector] Using strip version 2.44 found on system at:
  1778. 397.51 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  1779. 397.51 s [vector] Using tar found on system at:
  1780. 397.51 s [vector] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  1781. 397.51 s [vector] No uhc found
  1782. 397.51 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1783. 397.51 s [duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  1784. 397.51 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1785. 397.51 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1786. 397.51 s [duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  1787. 397.51 s [duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  1788. 397.51 s [duoids] <0.25: using doctest-0.24.2
  1789. 397.51 s [duoids] Dependency duoids: using duoids-0.0.1.0
  1790. 397.51 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1791. 397.52 s [duoids] Source component graph:
  1792. 397.52 s [duoids] component lib
  1793. 397.52 s [duoids] component test:doctests dependency lib
  1794. 397.52 s [duoids] Configured component graph:
  1795. 397.52 s [duoids] component duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1796. 397.52 s [duoids] include base-4.20.2.0-acb8
  1797. 397.52 s [duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1798. 397.52 s [duoids] component duoids-0.0.1.0-5K7xPrnULSaMCSEqoY2Nt-doctests
  1799. 397.52 s [duoids] include base-4.20.2.0-acb8
  1800. 397.52 s [duoids] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1801. 397.52 s [duoids] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1802. 397.52 s [duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1803. 397.52 s [duoids] Linked component graph:
  1804. 397.52 s [duoids] unit duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1805. 397.52 s [duoids] include base-4.20.2.0-acb8
  1806. 397.52 s [duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1807. 397.52 s [duoids] Control.Duoidal=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Data.Duoid.Laws
  1808. 397.52 s [duoids] unit duoids-0.0.1.0-5K7xPrnULSaMCSEqoY2Nt-doctests
  1809. 397.52 s [duoids] include base-4.20.2.0-acb8
  1810. 397.52 s [duoids] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1811. 397.52 s [duoids] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1812. 397.52 s [duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1813. 397.52 s [duoids] Ready component graph:
  1814. 397.52 s [duoids] definite duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1815. 397.52 s [duoids] depends base-4.20.2.0-acb8
  1816. 397.52 s [duoids] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1817. 397.52 s [duoids] definite duoids-0.0.1.0-5K7xPrnULSaMCSEqoY2Nt-doctests
  1818. 397.52 s [duoids] depends base-4.20.2.0-acb8
  1819. 397.52 s [duoids] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1820. 397.52 s [duoids] depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1821. 397.52 s [duoids] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1822. 397.52 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1823. 397.52 s [duoids] Using compiler: ghc-9.10.3
  1824. 397.52 s [duoids] Using install prefix:
  1825. 397.52 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0
  1826. 397.52 s [duoids] Executables installed in:
  1827. 397.52 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/bin
  1828. 397.52 s [duoids] Libraries installed in:
  1829. 397.52 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1830. 397.52 s [duoids] Dynamic Libraries installed in:
  1831. 397.52 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  1832. 397.52 s [duoids] Private executables installed in:
  1833. 397.52 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0
  1834. 397.52 s [duoids] Data files installed in:
  1835. 397.52 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0
  1836. 397.52 s [duoids] Documentation installed in:
  1837. 397.52 s [duoids] /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  1838. 397.52 s [duoids] Configuration files installed in:
  1839. 397.52 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/etc
  1840. 397.52 s [duoids] No alex found
  1841. 397.52 s [duoids] Using ar found on system at:
  1842. 397.52 s [duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  1843. 397.52 s [duoids] No c2hs found
  1844. 397.52 s [duoids] No cpphs found
  1845. 397.52 s [duoids] Using doctest version 0.24.2 found on system at:
  1846. 397.52 s [duoids] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  1847. 397.52 s [duoids] Using gcc version 14.3.0 given by user at:
  1848. 397.52 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  1849. 397.52 s [duoids] Using ghc version 9.10.3 found on system at:
  1850. 397.52 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  1851. 397.52 s [duoids] Using ghc-pkg version 9.10.3 found on system at:
  1852. 397.52 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1853. 397.52 s [duoids] No ghcjs found
  1854. 397.52 s [duoids] No ghcjs-pkg found
  1855. 397.52 s [duoids] No greencard found
  1856. 397.52 s [duoids] Using haddock version 2.31.1 found on system at:
  1857. 397.52 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1858. 397.52 s [duoids] No happy found
  1859. 397.52 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  1860. 397.52 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1861. 397.52 s [duoids] No hmake found
  1862. 397.52 s [duoids] Using hpc version 0.69 found on system at:
  1863. 397.52 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1864. 397.52 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  1865. 397.52 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1866. 397.52 s [duoids] Using hscolour version 1.25 found on system at:
  1867. 397.52 s [duoids] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  1868. 397.52 s [duoids] No jhc found
  1869. 397.52 s [duoids] Using ld found on system at:
  1870. 397.52 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  1871. 397.52 s [duoids] No pkg-config found
  1872. 397.52 s [duoids] Using runghc version 9.10.3 found on system at:
  1873. 397.52 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  1874. 397.52 s [duoids] Using strip version 2.44 found on system at:
  1875. 397.52 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  1876. 397.52 s [duoids] Using tar found on system at:
  1877. 397.52 s [duoids] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  1878. 397.52 s [duoids] No uhc found
  1879. 397.85 s [vector] Phase: buildPhase
  1880. 397.88 s [duoids] Phase: buildPhase
  1881. 398.09 s [duoids] Preprocessing library for duoids-0.0.1.0...
  1882. 398.10 s [duoids] Building library for duoids-0.0.1.0...
  1883. 398.13 s [vector] Preprocessing library for vector-0.13.2.0...
  1884. 398.14 s [vector] Building library for vector-0.13.2.0...
  1885. 398.42 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o )
  1886. 399.52 s [vector] [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.o, dist/build/Data/Vector/Fusion/Stream/Monadic.dyn_o )
  1887. 399.64 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  1888. 399.73 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.o, dist/build/Data/Vector/Fusion/Util.dyn_o )
  1889. 399.79 s [vector] [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.o, dist/build/Data/Vector/Fusion/Bundle/Size.dyn_o )
  1890. 400.17 s [vector] [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.o, dist/build/Data/Vector/Generic/Mutable/Base.dyn_o )
  1891. 400.17 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.o, dist/build/Data/Vector/Generic/Base.dyn_o )
  1892. 400.17 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.o, dist/build/Data/Vector/Internal/Check.dyn_o )
  1893. 400.17 s [vector] [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.o, dist/build/Data/Vector/Fusion/Bundle/Monadic.dyn_o )
  1894. 403.18 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  1895. 408.98 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o )
  1896. 409.37 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o )
  1897. 409.37 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o )
  1898. 410.38 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  1899. 412.14 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  1900. 416.49 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  1901. 416.55 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.o, dist/build/Data/Vector/Fusion/Bundle.dyn_o )
  1902. 422.32 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  1903. 422.72 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  1904. 422.76 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  1905. 425.80 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.o, dist/build/Data/Vector/Generic/Mutable.dyn_o )
  1906. 433.46 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.o, dist/build/Data/Vector/Generic/New.dyn_o )
  1907. 433.84 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  1908. 433.84 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  1909. 434.33 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1910. 435.32 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.o, dist/build/Data/Vector/Generic.dyn_o )
  1911. 435.51 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1912. 437.85 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  1913. 448.13 s [duoids] buildPhase completed in 50 seconds
  1914. 448.13 s [duoids] Phase: checkPhase
  1915. 448.68 s [duoids] Running 1 test suites...
  1916. 448.69 s [duoids] Test suite doctests: RUNNING...
  1917. 449.43 s [duoids] on the commandline: warning: [GHC-98887]
  1918. 449.43 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1919. 449.43 s [duoids]
  1920. 449.43 s [duoids] on the commandline: warning: [GHC-98887]
  1921. 449.43 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1922. 449.44 s [duoids]
  1923. 449.45 s [duoids] on the commandline: warning: [GHC-98887]
  1924. 449.45 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1925. 449.45 s [duoids]
  1926. 449.45 s [duoids] on the commandline: warning: [GHC-98887]
  1927. 449.45 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1928. 449.45 s [duoids]
  1929. 449.45 s [duoids] on the commandline: warning: [GHC-98887]
  1930. 449.45 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1931. 449.45 s [duoids]
  1932. 449.46 s [duoids] on the commandline: warning: [GHC-98887]
  1933. 449.46 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1934. 449.46 s [duoids]
  1935. 449.46 s [duoids] on the commandline: warning: [GHC-98887]
  1936. 449.46 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1937. 449.46 s [duoids]
  1938. 449.46 s [duoids] on the commandline: warning: [GHC-98887]
  1939. 449.46 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1940. 449.46 s [duoids]
  1941. 449.47 s [duoids] on the commandline: warning: [GHC-98887]
  1942. 449.47 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1943. 449.47 s [duoids]
  1944. 449.47 s [duoids] on the commandline: warning: [GHC-98887]
  1945. 449.47 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1946. 449.47 s [duoids]
  1947. 451.81 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  1948. 451.92 s [duoids] NameLib Nothing
  1949. 451.92 s [duoids] ----------------------------------------
  1950. 451.94 s [duoids] Test suite doctests: PASS
  1951. 451.94 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  1952. 451.94 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  1953. 451.95 s [duoids] Phase: haddockPhase
  1954. 452.26 s [duoids] Preprocessing library for duoids-0.0.1.0...
  1955. 452.26 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  1956. 453.27 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing )
  1957. 453.85 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing )
  1958. 454.77 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing )
  1959. 455.96 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing )
  1960. 455.98 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing )
  1961. 456.03 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing )
  1962. 456.07 s [duoids] Haddock coverage:
  1963. 456.08 s [duoids] Warning: 'cancel' is out of scope.
  1964. 456.08 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1965. 456.08 s [duoids] Warning: 'Applicative' is out of scope.
  1966. 456.08 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1967. 456.08 s [duoids] Warning: 'Alternative' is out of scope.
  1968. 456.08 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1969. 456.08 s [duoids] Warning: 'Par' is ambiguous. It is defined
  1970. 456.08 s [duoids] * at src/Data/Duoid.hs:62:5
  1971. 456.08 s [duoids] * at src/Data/Duoid.hs:58:1
  1972. 456.08 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1973. 456.08 s [duoids] by specifying the type/value namespace explicitly.
  1974. 456.08 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:58:1
  1975. 456.08 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  1976. 456.08 s [duoids] * at src/Data/Duoid.hs:118:5
  1977. 456.08 s [duoids] * at src/Data/Duoid.hs:114:1
  1978. 456.08 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1979. 456.08 s [duoids] by specifying the type/value namespace explicitly.
  1980. 456.08 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:114:1
  1981. 456.09 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  1982. 456.10 s [duoids] Warning: 'ExceptT' is out of scope.
  1983. 456.10 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1984. 456.10 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  1985. 456.10 s [duoids] * at src/Control/Duoidal.hs:238:5
  1986. 456.10 s [duoids] * at src/Control/Duoidal.hs:234:1
  1987. 456.10 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1988. 456.10 s [duoids] by specifying the type/value namespace explicitly.
  1989. 456.10 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:234:1
  1990. 456.10 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  1991. 456.10 s [duoids] * at src/Control/Duoidal.hs:308:5
  1992. 456.10 s [duoids] * at src/Control/Duoidal.hs:304:1
  1993. 456.10 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1994. 456.10 s [duoids] by specifying the type/value namespace explicitly.
  1995. 456.10 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:304:1
  1996. 456.10 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  1997. 456.10 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1998. 456.10 s [duoids] Warning: 'Validation' is out of scope.
  1999. 456.10 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  2000. 456.10 s [duoids] Warning: 'fail' is out of scope.
  2001. 456.10 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  2002. 456.10 s [duoids] Warning: 'MonadFail' is out of scope.
  2003. 456.10 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  2004. 456.10 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  2005. 456.10 s [duoids] * at src/Control/Duoidal.hs:774:5
  2006. 456.10 s [duoids] * at src/Control/Duoidal.hs:770:1
  2007. 456.10 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  2008. 456.10 s [duoids] by specifying the type/value namespace explicitly.
  2009. 456.10 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:770:1
  2010. 456.10 s [duoids] Warning: 'Writer' is out of scope.
  2011. 456.10 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  2012. 456.10 s [duoids] Warning: 'Set' is out of scope.
  2013. 456.10 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  2014. 456.10 s [duoids] Warning: 'Char' is out of scope.
  2015. 456.10 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  2016. 456.11 s [duoids] Warning: 'Const' is ambiguous. It is defined
  2017. 456.11 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  2018. 456.11 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  2019. 456.11 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  2020. 456.11 s [duoids] by specifying the type/value namespace explicitly.
  2021. 456.11 s [duoids] Defaulting to the one defined in ‘GHC.Internal.Data.Functor.Const’
  2022. 456.11 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  2023. 456.11 s [duoids] * at src/Control/Duoidal.hs:395:1
  2024. 456.11 s [duoids] * at src/Data/Duoid.hs:183:1
  2025. 456.11 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  2026. 456.11 s [duoids] by specifying the type/value namespace explicitly.
  2027. 456.11 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:183:1
  2028. 456.12 s [duoids] 100% ( 60 / 60) in 'Control.Duoidal'
  2029. 456.12 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  2030. 456.12 s [duoids] Warning: 'Normal' is out of scope.
  2031. 456.12 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  2032. 456.13 s [duoids] Warning: 'Law' is ambiguous. It is defined
  2033. 456.13 s [duoids] * at src/Data/Duoid/Laws.hs:38:5
  2034. 456.13 s [duoids] * at src/Data/Duoid/Laws.hs:34:1
  2035. 456.13 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  2036. 456.13 s [duoids] by specifying the type/value namespace explicitly.
  2037. 456.13 s [duoids] Defaulting to the one defined at src/Data/Duoid/Laws.hs:34:1
  2038. 456.13 s [duoids] 100% ( 12 / 12) in 'Data.Duoid.Laws'
  2039. 456.13 s [duoids] 100% ( 6 / 6) in 'Control.Duoidal.Laws'
  2040. 456.56 s [duoids] Warning: Data.Duoid: could not find link destinations for:
  2041. 456.56 s [duoids] - Data.Duoid.Rep_Comm
  2042. 456.56 s [duoids] - Data.Duoid.Rep1_Comm
  2043. 456.56 s [duoids] - Data.Duoid.Rep_Seq
  2044. 456.56 s [duoids] - Data.Duoid.Rep1_Seq
  2045. 456.56 s [duoids] - Data.Duoid.Rep_Par
  2046. 456.56 s [duoids] - Data.Duoid.Rep1_Par
  2047. 456.59 s [duoids] Warning: Control.Duoidal: could not find link destinations for:
  2048. 456.59 s [duoids] - Control.Duoidal.Rep_Commutative
  2049. 456.59 s [duoids] - Control.Duoidal.Rep1_Commutative
  2050. 456.59 s [duoids] - Control.Duoidal.Rep_Sequential
  2051. 456.59 s [duoids] - Control.Duoidal.Rep1_Sequential
  2052. 456.59 s [duoids] - Control.Duoidal.Rep_Parallel
  2053. 456.59 s [duoids] - Control.Duoidal.Rep1_Parallel
  2054. 456.60 s [duoids] Warning: Data.Duoid.Laws: could not find link destinations for:
  2055. 456.60 s [duoids] - Data.Duoid.Laws.Rep_NormalLaws
  2056. 456.60 s [duoids] - Data.Duoid.Laws.Rep1_NormalLaws
  2057. 456.60 s [duoids] - Data.Duoid.Laws.Rep_Laws
  2058. 456.60 s [duoids] - Data.Duoid.Laws.Rep_Law
  2059. 457.38 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.o, dist/build/Data/Vector/Mutable.dyn_o )
  2060. 457.38 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  2061. 480.20 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.o, dist/build/Data/Vector/Primitive/Mutable.dyn_o )
  2062. 480.24 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.o, dist/build/Data/Vector/Primitive.dyn_o )
  2063. 480.24 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.o, dist/build/Data/Vector/Storable/Internal.dyn_o )
  2064. 480.24 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.o, dist/build/Data/Vector/Storable/Mutable.dyn_o )
  2065. 480.24 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.o, dist/build/Data/Vector/Storable.dyn_o )
  2066. 480.89 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.o, dist/build/Data/Vector/Strict/Mutable.dyn_o )
  2067. 480.89 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.o, dist/build/Data/Vector/Strict.dyn_o )
  2068. 485.01 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  2069. 485.15 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  2070. 485.16 s [duoids] haddockPhase completed in 33 seconds
  2071. 485.16 s [duoids] Phase: installPhase
  2072. 485.37 s [duoids] Installing library in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2073. 486.48 s [duoids] Phase: fixupPhase
  2074. 486.52 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0
  2075. 486.52 s [duoids] shrinking /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSduoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c-ghc9.10.3.so
  2076. 486.54 s [duoids] checking for references to /build/ in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0...
  2077. 486.58 s [duoids] patching script interpreter paths in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0
  2078. 486.59 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib
  2079. 486.91 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc
  2080. 486.92 s [duoids] checking for references to /build/ in /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc...
  2081. 486.95 s [duoids] patching script interpreter paths in /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc
  2082. 487.36 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0 /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc
  2083. 488.08 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  2084. 488.11 s [post-build-hook] Uploading to the NixCI cache: /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0 /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc
  2085. 488.19 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2086. 488.22 s [post-build-hook] copying 2 paths...
  2087. 488.22 s [post-build-hook] copying path '/nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2088. 488.78 s [post-build-hook] copying path '/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  2089. 492.25 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2090. 493.05 s [post-build-hook] copying 0 paths...
  2091. 493.10 s Progress: 6 of 22 built (1 building), 193 of 193 downloaded from cache
  2092. 493.18 s Building duoidal-transformers
  2093. 493.27 s Building duoids-hedgehog
  2094. 493.34 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  2095. 493.35 s [duoidal-transformers] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  2096. 493.44 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  2097. 493.45 s [duoids-hedgehog] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  2098. 493.65 s [duoidal-transformers] Phase: unpackPhase
  2099. 493.66 s [duoidal-transformers] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./transformers
  2100. 493.67 s [duoidal-transformers] source root is transformers
  2101. 493.68 s [duoidal-transformers] Phase: patchPhase
  2102. 493.69 s [duoidal-transformers] Phase: compileBuildDriverPhase
  2103. 493.70 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.O0CHFuErI3/setup-package.conf.d -threaded
  2104. 493.82 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.O0CHFuErI3/Main.o )
  2105. 493.84 s [duoids-hedgehog] Phase: unpackPhase
  2106. 493.84 s [duoids-hedgehog] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./hedgehog
  2107. 493.85 s [duoids-hedgehog] source root is hedgehog
  2108. 493.87 s [duoids-hedgehog] Phase: patchPhase
  2109. 493.88 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  2110. 493.88 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.88RLIBMGhZ/setup-package.conf.d -threaded
  2111. 493.93 s [duoidal-transformers] [2 of 2] Linking Setup
  2112. 494.03 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.88RLIBMGhZ/Main.o )
  2113. 494.16 s [duoids-hedgehog] [2 of 2] Linking Setup
  2114. 494.69 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.o, dist/build/Data/Vector/Unboxed/Base.dyn_o )
  2115. 496.18 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  2116. 496.20 s [duoidal-transformers] Phase: configurePhase
  2117. 496.20 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.O0CHFuErI3/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  2118. 496.22 s [duoidal-transformers] Using Parsec parser
  2119. 496.22 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  2120. 496.41 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  2121. 496.43 s [duoids-hedgehog] Phase: configurePhase
  2122. 496.44 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.88RLIBMGhZ/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  2123. 496.45 s [duoids-hedgehog] Using Parsec parser
  2124. 496.45 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  2125. 496.74 s [duoidal-transformers] Flags chosen: lint=False, noisy-deprecations=True
  2126. 497.18 s [duoids-hedgehog] Flags chosen: lint=False, noisy-deprecations=True
  2127. 497.31 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2128. 497.31 s [duoidal-transformers] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  2129. 497.31 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  2130. 497.31 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2131. 497.31 s [duoidal-transformers] Dependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.1
  2132. 497.31 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2133. 497.31 s [duoidal-transformers] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  2134. 497.31 s [duoidal-transformers] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  2135. 497.31 s [duoidal-transformers] <0.25: using doctest-0.24.2
  2136. 497.31 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  2137. 497.31 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2138. 497.31 s [duoidal-transformers] Source component graph:
  2139. 497.31 s [duoidal-transformers] component lib
  2140. 497.31 s [duoidal-transformers] component test:doctests dependency lib
  2141. 497.31 s [duoidal-transformers] Configured component graph:
  2142. 497.31 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2143. 497.31 s [duoidal-transformers] include base-4.20.2.0-acb8
  2144. 497.31 s [duoidal-transformers] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2145. 497.31 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2146. 497.31 s [duoidal-transformers] include transformers-0.6.1.1-74e0
  2147. 497.31 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-FYwykNJN3GjCMzXCDo8yOa-doctests
  2148. 497.31 s [duoidal-transformers] include base-4.20.2.0-acb8
  2149. 497.31 s [duoidal-transformers] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2150. 497.31 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2151. 497.31 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2152. 497.31 s [duoidal-transformers] Linked component graph:
  2153. 497.31 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2154. 497.31 s [duoidal-transformers] include base-4.20.2.0-acb8
  2155. 497.31 s [duoidal-transformers] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2156. 497.31 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2157. 497.31 s [duoidal-transformers] include transformers-0.6.1.1-74e0
  2158. 497.31 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C:Control.Duoidal.Trans.Orphans
  2159. 497.31 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-FYwykNJN3GjCMzXCDo8yOa-doctests
  2160. 497.31 s [duoidal-transformers] include base-4.20.2.0-acb8
  2161. 497.31 s [duoidal-transformers] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2162. 497.31 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2163. 497.31 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2164. 497.31 s [duoidal-transformers] Ready component graph:
  2165. 497.31 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2166. 497.31 s [duoidal-transformers] depends base-4.20.2.0-acb8
  2167. 497.32 s [duoidal-transformers] depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2168. 497.32 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2169. 497.32 s [duoidal-transformers] depends transformers-0.6.1.1-74e0
  2170. 497.32 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-FYwykNJN3GjCMzXCDo8yOa-doctests
  2171. 497.32 s [duoidal-transformers] depends base-4.20.2.0-acb8
  2172. 497.32 s [duoidal-transformers] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2173. 497.32 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2174. 497.32 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2175. 497.32 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  2176. 497.32 s [duoidal-transformers] Using compiler: ghc-9.10.3
  2177. 497.32 s [duoidal-transformers] Using install prefix:
  2178. 497.32 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
  2179. 497.32 s [duoidal-transformers] Executables installed in:
  2180. 497.32 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/bin
  2181. 497.32 s [duoidal-transformers] Libraries installed in:
  2182. 497.32 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2183. 497.32 s [duoidal-transformers] Dynamic Libraries installed in:
  2184. 497.32 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  2185. 497.32 s [duoidal-transformers] Private executables installed in:
  2186. 497.32 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0
  2187. 497.32 s [duoidal-transformers] Data files installed in:
  2188. 497.32 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0
  2189. 497.32 s [duoidal-transformers] Documentation installed in:
  2190. 497.32 s [duoidal-transformers] /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  2191. 497.32 s [duoidal-transformers] Configuration files installed in:
  2192. 497.32 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/etc
  2193. 497.32 s [duoidal-transformers] No alex found
  2194. 497.32 s [duoidal-transformers] Using ar found on system at:
  2195. 497.32 s [duoidal-transformers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2196. 497.32 s [duoidal-transformers] No c2hs found
  2197. 497.32 s [duoidal-transformers] No cpphs found
  2198. 497.32 s [duoidal-transformers] Using doctest version 0.24.2 found on system at:
  2199. 497.32 s [duoidal-transformers] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  2200. 497.32 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  2201. 497.32 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2202. 497.32 s [duoidal-transformers] Using ghc version 9.10.3 found on system at:
  2203. 497.32 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  2204. 497.32 s [duoidal-transformers] Using ghc-pkg version 9.10.3 found on system at:
  2205. 497.32 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  2206. 497.32 s [duoidal-transformers] No ghcjs found
  2207. 497.32 s [duoidal-transformers] No ghcjs-pkg found
  2208. 497.32 s [duoidal-transformers] No greencard found
  2209. 497.32 s [duoidal-transformers] Using haddock version 2.31.1 found on system at:
  2210. 497.32 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  2211. 497.32 s [duoidal-transformers] No happy found
  2212. 497.32 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  2213. 497.32 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2214. 497.32 s [duoidal-transformers] No hmake found
  2215. 497.32 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  2216. 497.32 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  2217. 497.32 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  2218. 497.32 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  2219. 497.32 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  2220. 497.32 s [duoidal-transformers] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  2221. 497.32 s [duoidal-transformers] No jhc found
  2222. 497.32 s [duoidal-transformers] Using ld found on system at:
  2223. 497.32 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  2224. 497.32 s [duoidal-transformers] No pkg-config found
  2225. 497.32 s [duoidal-transformers] Using runghc version 9.10.3 found on system at:
  2226. 497.32 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  2227. 497.32 s [duoidal-transformers] Using strip version 2.44 found on system at:
  2228. 497.32 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2229. 497.32 s [duoidal-transformers] Using tar found on system at:
  2230. 497.32 s [duoidal-transformers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2231. 497.32 s [duoidal-transformers] No uhc found
  2232. 497.54 s [duoidal-transformers] Phase: buildPhase
  2233. 497.70 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  2234. 497.70 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  2235. 497.81 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2236. 497.81 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  2237. 497.81 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  2238. 497.81 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2239. 497.81 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  2240. 497.81 s [duoids-hedgehog] hedgehog-1.5
  2241. 497.81 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2242. 497.81 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  2243. 497.81 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  2244. 497.81 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2245. 497.81 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  2246. 497.81 s [duoids-hedgehog] hedgehog-1.5
  2247. 497.81 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2248. 497.81 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  2249. 497.81 s [duoids-hedgehog] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  2250. 497.81 s [duoids-hedgehog] <0.25: using doctest-0.24.2
  2251. 497.81 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  2252. 497.81 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2253. 497.81 s [duoids-hedgehog] Source component graph:
  2254. 497.81 s [duoids-hedgehog] component lib
  2255. 497.81 s [duoids-hedgehog] component test:doctests dependency lib
  2256. 497.81 s [duoids-hedgehog] component test:laws dependency lib
  2257. 497.81 s [duoids-hedgehog] Configured component graph:
  2258. 497.81 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2259. 497.81 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2260. 497.81 s [duoids-hedgehog] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2261. 497.81 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2262. 497.81 s [duoids-hedgehog] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2263. 497.81 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-3Jv1gaRZt2Z4efsDgUKshe-doctests
  2264. 497.81 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2265. 497.81 s [duoids-hedgehog] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2266. 497.81 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2267. 497.81 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2268. 497.81 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-HEJJPuqx96k3Z5VnclDp4D-laws
  2269. 497.81 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2270. 497.81 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2271. 497.81 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2272. 497.81 s [duoids-hedgehog] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2273. 497.81 s [duoids-hedgehog] Linked component graph:
  2274. 497.81 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2275. 497.81 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2276. 497.81 s [duoids-hedgehog] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2277. 497.81 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2278. 497.81 s [duoids-hedgehog] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2279. 497.81 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW:Test.Duoidal
  2280. 497.82 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-3Jv1gaRZt2Z4efsDgUKshe-doctests
  2281. 497.82 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2282. 497.82 s [duoids-hedgehog] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2283. 497.82 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2284. 497.82 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2285. 497.82 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-HEJJPuqx96k3Z5VnclDp4D-laws
  2286. 497.82 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2287. 497.82 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2288. 497.82 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2289. 497.82 s [duoids-hedgehog] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2290. 497.82 s [duoids-hedgehog] Ready component graph:
  2291. 497.82 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2292. 497.82 s [duoids-hedgehog] depends base-4.20.2.0-acb8
  2293. 497.82 s [duoids-hedgehog] depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2294. 497.82 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2295. 497.82 s [duoids-hedgehog] depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2296. 497.82 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-HEJJPuqx96k3Z5VnclDp4D-laws
  2297. 497.82 s [duoids-hedgehog] depends base-4.20.2.0-acb8
  2298. 497.82 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2299. 497.82 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2300. 497.82 s [duoids-hedgehog] depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2301. 497.82 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-3Jv1gaRZt2Z4efsDgUKshe-doctests
  2302. 497.82 s [duoids-hedgehog] depends base-4.20.2.0-acb8
  2303. 497.82 s [duoids-hedgehog] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2304. 497.82 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2305. 497.82 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2306. 497.82 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.10
  2307. 497.82 s [duoids-hedgehog] Using compiler: ghc-9.10.3
  2308. 497.82 s [duoids-hedgehog] Using install prefix:
  2309. 497.82 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0
  2310. 497.82 s [duoids-hedgehog] Executables installed in:
  2311. 497.82 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/bin
  2312. 497.82 s [duoids-hedgehog] Libraries installed in:
  2313. 497.82 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2314. 497.82 s [duoids-hedgehog] Dynamic Libraries installed in:
  2315. 497.82 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  2316. 497.82 s [duoids-hedgehog] Private executables installed in:
  2317. 497.82 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0
  2318. 497.82 s [duoids-hedgehog] Data files installed in:
  2319. 497.82 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0
  2320. 497.82 s [duoids-hedgehog] Documentation installed in:
  2321. 497.82 s [duoids-hedgehog] /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  2322. 497.82 s [duoids-hedgehog] Configuration files installed in:
  2323. 497.82 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/etc
  2324. 497.82 s [duoids-hedgehog] No alex found
  2325. 497.82 s [duoids-hedgehog] Using ar found on system at:
  2326. 497.82 s [duoids-hedgehog] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2327. 497.82 s [duoids-hedgehog] No c2hs found
  2328. 497.82 s [duoids-hedgehog] No cpphs found
  2329. 497.82 s [duoids-hedgehog] Using doctest version 0.24.2 found on system at:
  2330. 497.82 s [duoids-hedgehog] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  2331. 497.82 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  2332. 497.82 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2333. 497.82 s [duoids-hedgehog] Using ghc version 9.10.3 found on system at:
  2334. 497.82 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  2335. 497.82 s [duoids-hedgehog] Using ghc-pkg version 9.10.3 found on system at:
  2336. 497.82 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  2337. 497.82 s [duoids-hedgehog] No ghcjs found
  2338. 497.82 s [duoids-hedgehog] No ghcjs-pkg found
  2339. 497.82 s [duoids-hedgehog] No greencard found
  2340. 497.82 s [duoids-hedgehog] Using haddock version 2.31.1 found on system at:
  2341. 497.82 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  2342. 497.82 s [duoids-hedgehog] No happy found
  2343. 497.82 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  2344. 497.82 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2345. 497.82 s [duoids-hedgehog] No hmake found
  2346. 497.82 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  2347. 497.82 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  2348. 497.82 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  2349. 497.82 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  2350. 497.82 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  2351. 497.82 s [duoids-hedgehog] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  2352. 497.82 s [duoids-hedgehog] No jhc found
  2353. 497.82 s [duoids-hedgehog] Using ld found on system at:
  2354. 497.82 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  2355. 497.82 s [duoids-hedgehog] No pkg-config found
  2356. 497.82 s [duoids-hedgehog] Using runghc version 9.10.3 found on system at:
  2357. 497.82 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  2358. 497.82 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  2359. 497.82 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2360. 497.82 s [duoids-hedgehog] Using tar found on system at:
  2361. 497.82 s [duoids-hedgehog] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2362. 497.82 s [duoids-hedgehog] No uhc found
  2363. 497.96 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, dist/build/Control/Duoidal/Trans/Class.o, dist/build/Control/Duoidal/Trans/Class.dyn_o )
  2364. 498.13 s [duoids-hedgehog] Phase: buildPhase
  2365. 498.34 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  2366. 498.34 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  2367. 498.58 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, dist/build/Control/Duoidal/Trans/Orphans.o, dist/build/Control/Duoidal/Trans/Orphans.dyn_o )
  2368. 498.91 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  2369. 500.14 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, dist/build/Control/Duoidal/Trans/Class.p_o )
  2370. 500.85 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  2371. 500.94 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, dist/build/Control/Duoidal/Trans/Orphans.p_o )
  2372. 501.45 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  2373. 502.73 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  2374. 508.20 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.o, dist/build/Data/Vector/Unboxed.dyn_o )
  2375. 513.14 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  2376. 513.14 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  2377. 513.53 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  2378. 514.12 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  2379. 514.13 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  2380. 514.50 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  2381. 514.63 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  2382. 516.29 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  2383. 516.81 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  2384. 518.51 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  2385. 518.51 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  2386. 518.79 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  2387. 519.50 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  2388. 521.21 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  2389. 524.44 s [duoidal-transformers] Phase: checkPhase
  2390. 524.72 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.o, dist/build/Data/Vector/Unboxed/Mutable.dyn_o )
  2391. 524.94 s [duoidal-transformers] Running 1 test suites...
  2392. 524.94 s [duoidal-transformers] Test suite doctests: RUNNING...
  2393. 525.46 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  2394. 525.46 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  2395. 525.46 s [duoidal-transformers]
  2396. 525.46 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  2397. 525.46 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  2398. 525.46 s [duoidal-transformers]
  2399. 525.47 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  2400. 525.47 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  2401. 525.47 s [duoidal-transformers]
  2402. 525.85 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  2403. 525.92 s [duoidal-transformers] NameLib Nothing
  2404. 525.92 s [duoidal-transformers] ----------------------------------------
  2405. 525.95 s [duoidal-transformers] Test suite doctests: PASS
  2406. 525.95 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  2407. 525.95 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  2408. 525.97 s [duoidal-transformers] Phase: haddockPhase
  2409. 526.26 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  2410. 526.26 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  2411. 526.69 s [vector] [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.p_o )
  2412. 526.96 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  2413. 527.01 s [vector] [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.p_o )
  2414. 527.17 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing )
  2415. 527.53 s [vector] [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.p_o )
  2416. 527.53 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  2417. 527.53 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  2418. 527.53 s [vector] [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.p_o )
  2419. 527.60 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing )
  2420. 527.92 s [duoidal-transformers] Haddock coverage:
  2421. 527.92 s [duoidal-transformers] Warning: 'MonadTrans' is out of scope.
  2422. 527.92 s [duoidal-transformers] If you qualify the identifier, haddock can try to link it anyway.
  2423. 527.92 s [duoidal-transformers] 100% ( 3 / 3) in 'Control.Duoidal.Trans.Class'
  2424. 527.92 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  2425. 529.80 s [duoids-hedgehog] buildPhase completed in 32 seconds
  2426. 529.80 s [duoids-hedgehog] Phase: checkPhase
  2427. 530.59 s [duoids-hedgehog] Running 2 test suites...
  2428. 530.64 s [duoids-hedgehog] Test suite laws: RUNNING...
  2429. 530.64 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  2430. 530.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2431. 530.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2432. 530.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2433. 530.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2434. 530.64 s [duoids-hedgehog] ✓ 4 succeeded.
  2435. 530.64 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  2436. 530.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2437. 530.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2438. 530.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2439. 530.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2440. 530.64 s [duoids-hedgehog] ✓ 4 succeeded.
  2441. 530.64 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  2442. 530.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2443. 530.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2444. 530.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2445. 530.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2446. 530.64 s [duoids-hedgehog] ✓ 4 succeeded.
  2447. 530.64 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  2448. 530.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2449. 530.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2450. 530.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2451. 530.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2452. 530.64 s [duoids-hedgehog] ✓ 4 succeeded.
  2453. 530.64 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  2454. 530.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2455. 530.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2456. 530.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2457. 530.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2458. 530.64 s [duoids-hedgehog] ✓ 4 succeeded.
  2459. 530.64 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  2460. 530.64 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2461. 530.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2462. 530.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2463. 530.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2464. 530.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2465. 530.64 s [duoids-hedgehog] ✓ 5 succeeded.
  2466. 530.64 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  2467. 530.64 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2468. 530.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2469. 530.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2470. 530.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2471. 530.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2472. 530.64 s [duoids-hedgehog] ✓ 5 succeeded.
  2473. 530.64 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  2474. 530.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2475. 530.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2476. 530.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2477. 530.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2478. 530.64 s [duoids-hedgehog] ✓ 4 succeeded.
  2479. 530.64 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  2480. 530.64 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2481. 530.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2482. 530.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2483. 530.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2484. 530.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2485. 530.64 s [duoids-hedgehog] ✓ 5 succeeded.
  2486. 530.64 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  2487. 530.65 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2488. 530.65 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2489. 530.65 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2490. 530.65 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2491. 530.65 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2492. 530.65 s [duoids-hedgehog] ✓ 5 succeeded.
  2493. 530.65 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  2494. 530.65 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2495. 530.65 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2496. 530.65 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2497. 530.65 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2498. 530.65 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2499. 530.65 s [duoids-hedgehog] ✓ 5 succeeded.
  2500. 530.65 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  2501. 530.65 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2502. 530.65 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2503. 530.65 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2504. 530.65 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2505. 530.65 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2506. 530.66 s [duoids-hedgehog] ✓ 5 succeeded.
  2507. 530.66 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  2508. 530.66 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2509. 530.66 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2510. 530.66 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2511. 530.66 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2512. 530.66 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2513. 530.66 s [duoids-hedgehog] ✓ 5 succeeded.
  2514. 530.66 s [duoids-hedgehog] Test suite laws: PASS
  2515. 530.66 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  2516. 530.66 s [duoids-hedgehog] Test suite doctests: RUNNING...
  2517. 532.26 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  2518. 532.41 s [duoids-hedgehog] NameLib Nothing
  2519. 532.41 s [duoids-hedgehog] ----------------------------------------
  2520. 532.43 s [duoids-hedgehog] Test suite doctests: PASS
  2521. 532.43 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  2522. 532.43 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  2523. 532.45 s [duoids-hedgehog] Phase: haddockPhase
  2524. 532.93 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  2525. 532.93 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  2526. 534.31 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing )
  2527. 535.98 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing )
  2528. 536.14 s [duoids-hedgehog] Haddock coverage:
  2529. 536.15 s [duoids-hedgehog] 100% ( 3 / 3) in 'Test.Duoid'
  2530. 536.27 s [duoids-hedgehog] 100% ( 2 / 2) in 'Test.Duoidal'
  2531. 539.92 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  2532. 548.84 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  2533. 555.17 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  2534. 555.20 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  2535. 555.34 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  2536. 555.36 s [duoidal-transformers] Phase: installPhase
  2537. 555.40 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  2538. 555.52 s [duoidal-transformers] Installing library in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2539. 556.20 s [duoidal-transformers] Phase: fixupPhase
  2540. 556.24 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
  2541. 556.25 s [duoidal-transformers] shrinking /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSduoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C-ghc9.10.3.so
  2542. 556.26 s [duoidal-transformers] checking for references to /build/ in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0...
  2543. 556.31 s [duoidal-transformers] patching script interpreter paths in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
  2544. 556.32 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib
  2545. 556.53 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc
  2546. 556.54 s [duoidal-transformers] checking for references to /build/ in /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc...
  2547. 556.58 s [duoidal-transformers] patching script interpreter paths in /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc
  2548. 556.97 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
  2549. 557.87 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  2550. 557.92 s [post-build-hook] Uploading to the NixCI cache: /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
  2551. 558.03 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2552. 558.07 s [post-build-hook] copying 2 paths...
  2553. 558.07 s [post-build-hook] copying path '/nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2554. 558.36 s [post-build-hook] copying path '/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  2555. 558.69 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2556. 558.86 s [post-build-hook] copying 0 paths...
  2557. 558.90 s Progress: 7 of 21 built (2 building), 193 of 193 downloaded from cache
  2558. 558.90 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  2559. 564.45 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  2560. 564.45 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  2561. 564.59 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  2562. 564.59 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  2563. 564.60 s [duoids-hedgehog] haddockPhase completed in 33 seconds
  2564. 564.60 s [duoids-hedgehog] Phase: installPhase
  2565. 564.79 s [duoids-hedgehog] Installing library in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2566. 565.30 s [duoids-hedgehog] Phase: fixupPhase
  2567. 565.33 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0
  2568. 565.33 s [duoids-hedgehog] shrinking /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSduoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW-ghc9.10.3.so
  2569. 565.35 s [duoids-hedgehog] checking for references to /build/ in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0...
  2570. 565.38 s [duoids-hedgehog] patching script interpreter paths in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0
  2571. 565.38 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib
  2572. 565.44 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc
  2573. 565.44 s [duoids-hedgehog] checking for references to /build/ in /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc...
  2574. 565.47 s [duoids-hedgehog] patching script interpreter paths in /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc
  2575. 565.72 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0 /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc
  2576. 566.22 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  2577. 566.26 s [post-build-hook] Uploading to the NixCI cache: /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0 /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc
  2578. 566.34 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2579. 566.38 s [post-build-hook] copying 2 paths...
  2580. 566.38 s [post-build-hook] copying path '/nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2581. 566.61 s [post-build-hook] copying path '/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  2582. 567.19 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2583. 567.34 s [post-build-hook] copying 0 paths...
  2584. 567.38 s Progress: 8 of 20 built (1 building), 193 of 193 downloaded from cache
  2585. 571.68 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  2586. 571.72 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  2587. 583.63 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  2588. 583.67 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  2589. 583.67 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  2590. 583.67 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  2591. 583.67 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  2592. 584.07 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  2593. 584.08 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  2594. 593.26 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  2595. 602.14 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  2596. 614.83 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  2597. 617.66 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
  2598. 617.66 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0...
  2599. 617.84 s [vector] [ 1 of 12] Compiling Boilerplater ( tests/Boilerplater.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.dyn_o )
  2600. 618.09 s [vector] [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.dyn_o )
  2601. 630.57 s [vector] [ 3 of 12] Compiling Utilities ( tests/Utilities.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.dyn_o )
  2602. 630.63 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  2603. 630.63 s [vector] In the use of ‘tail’
  2604. 630.63 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2605. 630.63 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2606. 630.63 s [vector] |
  2607. 630.63 s [vector] 244 | postscanl f z = tail . scanl f z
  2608. 630.63 s [vector] | ^^^^
  2609. 630.63 s [vector]
  2610. 630.63 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  2611. 630.63 s [vector] In the use of ‘tail’
  2612. 630.63 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2613. 630.63 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2614. 630.63 s [vector] |
  2615. 630.63 s [vector] 245 | prescanr f z = tail . scanr f z
  2616. 630.63 s [vector] | ^^^^
  2617. 630.63 s [vector]
  2618. 630.63 s [vector] [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.dyn_o )
  2619. 630.63 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  2620. 630.63 s [vector] In the use of ‘head’
  2621. 630.63 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2622. 630.63 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2623. 630.63 s [vector] |
  2624. 630.63 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  2625. 630.63 s [vector] | ^^^^
  2626. 630.63 s [vector]
  2627. 630.63 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  2628. 630.63 s [vector] In the use of ‘head’
  2629. 630.63 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2630. 630.63 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2631. 630.63 s [vector] |
  2632. 630.63 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  2633. 630.63 s [vector] | ^^^^
  2634. 630.63 s [vector]
  2635. 630.63 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  2636. 630.63 s [vector] In the use of ‘tail’
  2637. 630.63 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2638. 630.63 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2639. 630.63 s [vector] |
  2640. 630.63 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  2641. 630.63 s [vector] | ^^^^
  2642. 630.63 s [vector]
  2643. 630.63 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  2644. 630.63 s [vector] In the use of ‘head’
  2645. 630.63 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2646. 630.63 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2647. 630.63 s [vector] |
  2648. 630.63 s [vector] 439 | = V.uniq `eq` (map head . group)
  2649. 630.63 s [vector] | ^^^^
  2650. 630.63 s [vector]
  2651. 642.34 s [vector] [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.dyn_o )
  2652. 671.79 s [vector] [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.dyn_o )
  2653. 671.82 s [vector] [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.dyn_o )
  2654. 671.83 s [vector] [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.dyn_o )
  2655. 671.83 s [vector] [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.dyn_o )
  2656. 671.83 s [vector] [10 of 12] Compiling Tests.Move ( tests/Tests/Move.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.dyn_o )
  2657. 671.83 s [vector] [11 of 12] Compiling Tests.Bundle ( tests/Tests/Bundle.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.dyn_o )
  2658. 671.83 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  2659. 671.83 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  2660. 671.83 s [vector] |
  2661. 671.83 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  2662. 671.83 s [vector] | ^^^^^^
  2663. 671.83 s [vector]
  2664. 671.83 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  2665. 671.83 s [vector] In the use of ‘head’
  2666. 671.83 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2667. 671.83 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2668. 671.83 s [vector] |
  2669. 671.83 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  2670. 671.83 s [vector] | ^^^^
  2671. 671.83 s [vector]
  2672. 671.83 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  2673. 671.83 s [vector] In the use of ‘tail’
  2674. 671.83 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2675. 671.83 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2676. 671.83 s [vector] |
  2677. 671.83 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  2678. 671.83 s [vector] | ^^^^
  2679. 671.83 s [vector]
  2680. 671.83 s [vector] [12 of 12] Compiling Main ( tests/Main.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.dyn_o )
  2681. 672.46 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  2682. 673.69 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  2683. 673.70 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  2684. 673.84 s [vector] [ 1 of 12] Compiling Boilerplater ( tests/Boilerplater.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.dyn_o )
  2685. 674.03 s [vector] [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/UnitTests.dyn_o )
  2686. 675.44 s [vector] [ 3 of 12] Compiling Utilities ( tests/Utilities.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Utilities.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Utilities.dyn_o )
  2687. 675.44 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  2688. 675.44 s [vector] In the use of ‘tail’
  2689. 675.44 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2690. 675.44 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2691. 675.44 s [vector] |
  2692. 675.44 s [vector] 244 | postscanl f z = tail . scanl f z
  2693. 675.44 s [vector] | ^^^^
  2694. 675.44 s [vector]
  2695. 675.45 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  2696. 675.45 s [vector] In the use of ‘tail’
  2697. 675.45 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2698. 675.45 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2699. 675.45 s [vector] |
  2700. 675.45 s [vector] 245 | prescanr f z = tail . scanr f z
  2701. 675.45 s [vector] | ^^^^
  2702. 675.45 s [vector]
  2703. 675.45 s [vector] [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Property.dyn_o )
  2704. 675.45 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  2705. 675.45 s [vector] In the use of ‘head’
  2706. 675.45 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2707. 675.45 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2708. 675.45 s [vector] |
  2709. 675.45 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  2710. 675.45 s [vector] | ^^^^
  2711. 675.45 s [vector]
  2712. 675.45 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  2713. 675.45 s [vector] In the use of ‘head’
  2714. 675.45 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2715. 675.45 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2716. 675.45 s [vector] |
  2717. 675.45 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  2718. 675.45 s [vector] | ^^^^
  2719. 675.45 s [vector]
  2720. 675.45 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  2721. 675.45 s [vector] In the use of ‘tail’
  2722. 675.45 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2723. 675.45 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2724. 675.45 s [vector] |
  2725. 675.45 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  2726. 675.45 s [vector] | ^^^^
  2727. 675.45 s [vector]
  2728. 675.45 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  2729. 675.45 s [vector] In the use of ‘head’
  2730. 675.45 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2731. 675.45 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2732. 675.45 s [vector] |
  2733. 675.45 s [vector] 439 | = V.uniq `eq` (map head . group)
  2734. 675.45 s [vector] | ^^^^
  2735. 675.45 s [vector]
  2736. 676.50 s [vector] [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.dyn_o )
  2737. 676.63 s [vector] [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Strict.dyn_o )
  2738. 676.63 s [vector] [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Storable.dyn_o )
  2739. 676.63 s [vector] [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Primitive.dyn_o )
  2740. 676.63 s [vector] [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Boxed.dyn_o )
  2741. 676.63 s [vector] [10 of 12] Compiling Tests.Move ( tests/Tests/Move.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Move.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Move.dyn_o )
  2742. 676.63 s [vector] [11 of 12] Compiling Tests.Bundle ( tests/Tests/Bundle.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Bundle.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Bundle.dyn_o )
  2743. 676.63 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  2744. 676.63 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  2745. 676.63 s [vector] |
  2746. 676.63 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  2747. 676.63 s [vector] | ^^^^^^
  2748. 676.63 s [vector]
  2749. 676.63 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  2750. 676.63 s [vector] In the use of ‘head’
  2751. 676.63 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2752. 676.63 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2753. 676.63 s [vector] |
  2754. 676.63 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  2755. 676.63 s [vector] | ^^^^
  2756. 676.63 s [vector]
  2757. 676.63 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  2758. 676.63 s [vector] In the use of ‘tail’
  2759. 676.63 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2760. 676.63 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2761. 676.63 s [vector] |
  2762. 676.63 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  2763. 676.63 s [vector] | ^^^^
  2764. 676.63 s [vector]
  2765. 676.63 s [vector] [12 of 12] Compiling Main ( tests/Main.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Main.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Main.dyn_o )
  2766. 677.19 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  2767. 678.12 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
  2768. 678.19 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0...
  2769. 678.19 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  2770. 678.58 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  2771. 683.81 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  2772. 683.85 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  2773. 683.89 s [vector] [ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.o, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.dyn_o )
  2774. 685.56 s [vector] [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.o, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.dyn_o )
  2775. 685.56 s [vector] [ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.o, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.dyn_o )
  2776. 685.61 s [vector] [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.dyn_o )
  2777. 685.61 s [vector] [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.o, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.dyn_o )
  2778. 685.61 s [vector] [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.o, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.dyn_o )
  2779. 685.61 s [vector] [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.o, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.dyn_o )
  2780. 685.61 s [vector] [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.dyn_o )
  2781. 685.61 s [vector] [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.dyn_o )
  2782. 685.61 s [vector] [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.dyn_o )
  2783. 685.61 s [vector] [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.dyn_o )
  2784. 685.61 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.o, dist/build/benchmarks-O2/Bench/Vector/Tasty.dyn_o )
  2785. 685.61 s [vector] [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.o, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.dyn_o )
  2786. 685.61 s [vector] [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.o, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.dyn_o )
  2787. 685.88 s [vector] [ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.p_o )
  2788. 687.48 s [vector] [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.p_o )
  2789. 687.48 s [vector] [ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.p_o )
  2790. 687.75 s [vector] [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.p_o )
  2791. 687.75 s [vector] [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.p_o )
  2792. 687.75 s [vector] [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.p_o )
  2793. 687.75 s [vector] [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.p_o )
  2794. 687.75 s [vector] [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.p_o )
  2795. 687.75 s [vector] [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.p_o )
  2796. 687.75 s [vector] [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.p_o )
  2797. 687.75 s [vector] [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.p_o )
  2798. 687.75 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  2799. 687.75 s [vector] [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.p_o )
  2800. 687.75 s [vector] [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.p_o )
  2801. 690.01 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
  2802. 690.01 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0...
  2803. 690.21 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  2804. 691.08 s [vector] [2 of 4] Compiling Inspect.DerivingVia.OtherFoo ( tests-inspect/Inspect/DerivingVia/OtherFoo.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.dyn_o )
  2805. 691.08 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  2806. 692.14 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  2807. 692.92 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  2808. 693.85 s [vector] buildPhase completed in 4 minutes 56 seconds
  2809. 693.85 s [vector] Phase: checkPhase
  2810. 694.12 s [vector] Running 2 test suites...
  2811. 694.12 s [vector] Test suite vector-tests-O0: RUNNING...
  2812. 694.29 s [vector] toplevel
  2813. 694.29 s [vector] Data.Vector.Fusion.Bundle
  2814. 694.30 s [vector] fromList.toList == id: OK
  2815. 694.30 s [vector] +++ OK, passed 100 tests.
  2816. 694.30 s [vector] toList.fromList == id: OK
  2817. 694.30 s [vector] +++ OK, passed 100 tests.
  2818. 694.31 s [vector] eq: OK
  2819. 694.31 s [vector] +++ OK, passed 100 tests.
  2820. 694.31 s [vector] length: OK
  2821. 694.31 s [vector] +++ OK, passed 100 tests.
  2822. 694.32 s [vector] null: OK
  2823. 694.32 s [vector] +++ OK, passed 100 tests.
  2824. 694.32 s [vector] empty: OK
  2825. 694.32 s [vector] +++ OK, passed 100 tests.
  2826. 694.32 s [vector] singleton: OK
  2827. 694.32 s [vector] +++ OK, passed 100 tests.
  2828. 694.32 s [vector] replicate: OK
  2829. 694.32 s [vector] +++ OK, passed 100 tests.
  2830. 694.32 s [vector] cons: OK
  2831. 694.32 s [vector] +++ OK, passed 100 tests.
  2832. 694.32 s [vector] snoc: OK
  2833. 694.32 s [vector] +++ OK, passed 100 tests.
  2834. 694.32 s [vector] append: OK
  2835. 694.32 s [vector] +++ OK, passed 100 tests.
  2836. 694.33 s [vector] head: OK
  2837. 694.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2838. 694.34 s [vector] last: OK
  2839. 694.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2840. 694.34 s [vector] index: OK
  2841. 694.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2842. 694.34 s [vector] extract: OK
  2843. 694.34 s [vector] +++ OK, passed 100 tests.
  2844. 694.34 s [vector] init: OK
  2845. 694.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2846. 694.34 s [vector] tail: OK
  2847. 694.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2848. 694.34 s [vector] take: OK
  2849. 694.34 s [vector] +++ OK, passed 100 tests.
  2850. 694.34 s [vector] drop: OK
  2851. 694.34 s [vector] +++ OK, passed 100 tests.
  2852. 694.34 s [vector] map: OK
  2853. 694.34 s [vector] +++ OK, passed 100 tests.
  2854. 694.34 s [vector] zipWith: OK
  2855. 694.34 s [vector] +++ OK, passed 100 tests.
  2856. 694.34 s [vector] zipWith3: OK
  2857. 694.34 s [vector] +++ OK, passed 100 tests.
  2858. 694.34 s [vector] filter: OK
  2859. 694.34 s [vector] +++ OK, passed 100 tests.
  2860. 694.34 s [vector] takeWhile: OK
  2861. 694.34 s [vector] +++ OK, passed 100 tests.
  2862. 694.34 s [vector] dropWhile: OK
  2863. 694.34 s [vector] +++ OK, passed 100 tests.
  2864. 694.34 s [vector] elem: OK
  2865. 694.34 s [vector] +++ OK, passed 100 tests.
  2866. 694.34 s [vector] notElem: OK
  2867. 694.34 s [vector] +++ OK, passed 100 tests.
  2868. 694.34 s [vector] find: OK
  2869. 694.34 s [vector] +++ OK, passed 100 tests.
  2870. 694.34 s [vector] findIndex: OK
  2871. 694.34 s [vector] +++ OK, passed 100 tests.
  2872. 694.34 s [vector] foldl: OK
  2873. 694.34 s [vector] +++ OK, passed 100 tests.
  2874. 694.34 s [vector] foldl1: OK
  2875. 694.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2876. 694.34 s [vector] foldl': OK
  2877. 694.34 s [vector] +++ OK, passed 100 tests.
  2878. 694.34 s [vector] foldl1': OK
  2879. 694.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2880. 694.34 s [vector] foldr: OK
  2881. 694.34 s [vector] +++ OK, passed 100 tests.
  2882. 694.34 s [vector] foldr1: OK
  2883. 694.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2884. 694.34 s [vector] prescanl: OK
  2885. 694.34 s [vector] +++ OK, passed 100 tests.
  2886. 694.34 s [vector] prescanl': OK
  2887. 694.34 s [vector] +++ OK, passed 100 tests.
  2888. 694.34 s [vector] postscanl: OK
  2889. 694.34 s [vector] +++ OK, passed 100 tests.
  2890. 694.34 s [vector] postscanl': OK
  2891. 694.34 s [vector] +++ OK, passed 100 tests.
  2892. 694.34 s [vector] scanl: OK
  2893. 694.34 s [vector] +++ OK, passed 100 tests.
  2894. 694.34 s [vector] scanl': OK
  2895. 694.34 s [vector] +++ OK, passed 100 tests.
  2896. 694.34 s [vector] scanl1: OK
  2897. 694.34 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2898. 694.34 s [vector] scanl1': OK
  2899. 694.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2900. 694.34 s [vector] concatMap: OK
  2901. 694.34 s [vector] +++ OK, passed 100 tests.
  2902. 694.34 s [vector] unfoldr: OK
  2903. 694.34 s [vector] +++ OK, passed 100 tests.
  2904. 694.34 s [vector] and: OK
  2905. 694.34 s [vector] +++ OK, passed 100 tests.
  2906. 694.34 s [vector] or: OK
  2907. 694.34 s [vector] +++ OK, passed 100 tests.
  2908. 694.34 s [vector] Tests.Vector.Boxed
  2909. 694.34 s [vector] Bool
  2910. 694.34 s [vector] fromList.toList == id: OK
  2911. 694.34 s [vector] +++ OK, passed 100 tests.
  2912. 694.34 s [vector] toList.fromList == id: OK
  2913. 694.34 s [vector] +++ OK, passed 100 tests.
  2914. 694.34 s [vector] unstream.stream == id: OK
  2915. 694.34 s [vector] +++ OK, passed 100 tests.
  2916. 694.34 s [vector] stream.unstream == id: OK
  2917. 694.34 s [vector] +++ OK, passed 100 tests.
  2918. 694.34 s [vector] eq: OK
  2919. 694.34 s [vector] +++ OK, passed 100 tests.
  2920. 694.34 s [vector] length: OK
  2921. 694.34 s [vector] +++ OK, passed 100 tests.
  2922. 694.34 s [vector] null: OK
  2923. 694.34 s [vector] +++ OK, passed 100 tests.
  2924. 694.34 s [vector] index: OK
  2925. 694.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2926. 694.34 s [vector] safeIndex: OK
  2927. 694.35 s [vector] +++ OK, passed 100 tests.
  2928. 694.35 s [vector] head: OK
  2929. 694.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2930. 694.35 s [vector] last: OK
  2931. 694.35 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2932. 694.35 s [vector] unsafeIndex: OK
  2933. 694.35 s [vector] +++ OK, passed 100 tests; 23 discarded.
  2934. 694.35 s [vector] unsafeHead: OK
  2935. 694.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2936. 694.35 s [vector] unsafeLast: OK
  2937. 694.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2938. 694.35 s [vector] slice: OK
  2939. 694.35 s [vector] +++ OK, passed 100 tests.
  2940. 694.35 s [vector] init: OK
  2941. 694.35 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2942. 694.35 s [vector] tail: OK
  2943. 694.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2944. 694.35 s [vector] take: OK
  2945. 694.35 s [vector] +++ OK, passed 100 tests.
  2946. 694.35 s [vector] drop: OK
  2947. 694.35 s [vector] +++ OK, passed 100 tests.
  2948. 694.35 s [vector] splitAt: OK
  2949. 694.35 s [vector] +++ OK, passed 100 tests.
  2950. 694.35 s [vector] empty: OK
  2951. 694.35 s [vector] +++ OK, passed 100 tests.
  2952. 694.35 s [vector] singleton: OK
  2953. 694.35 s [vector] +++ OK, passed 100 tests.
  2954. 694.35 s [vector] replicate: OK
  2955. 694.35 s [vector] +++ OK, passed 100 tests.
  2956. 694.35 s [vector] generate: OK
  2957. 694.35 s [vector] +++ OK, passed 100 tests.
  2958. 694.35 s [vector] iterateN: OK
  2959. 694.35 s [vector] +++ OK, passed 100 tests.
  2960. 694.35 s [vector] iterateNM: OK (0.04s)
  2961. 694.35 s [vector] +++ OK, passed 100 tests.
  2962. 694.35 s [vector] generateM: OK (0.02s)
  2963. 694.35 s [vector] +++ OK, passed 100 tests.
  2964. 694.35 s [vector] replicateM: OK (0.03s)
  2965. 694.35 s [vector] +++ OK, passed 100 tests.
  2966. 694.35 s [vector] create: OK
  2967. 694.35 s [vector] +++ OK, passed 100 tests.
  2968. 694.35 s [vector] createT: OK
  2969. 694.35 s [vector] +++ OK, passed 100 tests.
  2970. 694.35 s [vector] unfoldr: OK
  2971. 694.35 s [vector] +++ OK, passed 100 tests.
  2972. 694.35 s [vector] unfoldrN: OK
  2973. 694.35 s [vector] +++ OK, passed 100 tests.
  2974. 694.35 s [vector] unfoldrExactN: OK
  2975. 694.35 s [vector] +++ OK, passed 100 tests.
  2976. 694.35 s [vector] unfoldrM: OK
  2977. 694.35 s [vector] +++ OK, passed 100 tests.
  2978. 694.35 s [vector] unfoldrNM: OK
  2979. 694.35 s [vector] +++ OK, passed 100 tests.
  2980. 694.38 s [vector] unfoldrExactNM: OK (0.04s)
  2981. 694.38 s [vector] +++ OK, passed 100 tests.
  2982. 694.38 s [vector] constructN: OK
  2983. 694.38 s [vector] +++ OK, passed 100 tests.
  2984. 694.38 s [vector] constructrN: OK
  2985. 694.38 s [vector] +++ OK, passed 100 tests.
  2986. 694.38 s [vector] cons: OK
  2987. 694.38 s [vector] +++ OK, passed 100 tests.
  2988. 694.38 s [vector] snoc: OK
  2989. 694.39 s [vector] +++ OK, passed 100 tests.
  2990. 694.39 s [vector] append: OK
  2991. 694.40 s [vector] +++ OK, passed 100 tests.
  2992. 694.40 s [vector] concat: OK (0.01s)
  2993. 694.40 s [vector] +++ OK, passed 100 tests.
  2994. 694.40 s [vector] force: OK
  2995. 694.40 s [vector] +++ OK, passed 100 tests.
  2996. 694.40 s [vector] upd: OK
  2997. 694.40 s [vector] +++ OK, passed 100 tests.
  2998. 694.40 s [vector] accum: OK
  2999. 694.40 s [vector] +++ OK, passed 100 tests.
  3000. 694.40 s [vector] reverse: OK
  3001. 694.40 s [vector] +++ OK, passed 100 tests.
  3002. 694.40 s [vector] backpermute: OK
  3003. 694.40 s [vector] +++ OK, passed 100 tests.
  3004. 694.40 s [vector] map: OK
  3005. 694.40 s [vector] +++ OK, passed 100 tests.
  3006. 694.40 s [vector] imap: OK
  3007. 694.40 s [vector] +++ OK, passed 100 tests.
  3008. 694.40 s [vector] concatMap: OK
  3009. 694.40 s [vector] +++ OK, passed 100 tests.
  3010. 694.40 s [vector] mapM: OK
  3011. 694.40 s [vector] +++ OK, passed 100 tests.
  3012. 694.42 s [vector] mapM_: OK (0.01s)
  3013. 694.42 s [vector] +++ OK, passed 100 tests.
  3014. 694.42 s [vector] forM: OK
  3015. 694.42 s [vector] +++ OK, passed 100 tests.
  3016. 694.43 s [vector] forM_: OK (0.01s)
  3017. 694.44 s [vector] +++ OK, passed 100 tests.
  3018. 694.44 s [vector] imapM: OK
  3019. 694.44 s [vector] +++ OK, passed 100 tests.
  3020. 694.45 s [vector] imapM_: OK (0.01s)
  3021. 694.45 s [vector] +++ OK, passed 100 tests.
  3022. 694.45 s [vector] zipWith: OK
  3023. 694.45 s [vector] +++ OK, passed 100 tests.
  3024. 694.45 s [vector] zipWith3: OK
  3025. 694.45 s [vector] +++ OK, passed 100 tests.
  3026. 694.45 s [vector] izipWith: OK
  3027. 694.45 s [vector] +++ OK, passed 100 tests.
  3028. 694.46 s [vector] izipWith3: OK
  3029. 694.46 s [vector] +++ OK, passed 100 tests.
  3030. 694.46 s [vector] izipWithM: OK
  3031. 694.46 s [vector] +++ OK, passed 100 tests.
  3032. 694.47 s [vector] izipWithM_: OK (0.01s)
  3033. 694.48 s [vector] +++ OK, passed 100 tests.
  3034. 694.48 s [vector] zipWithM: OK
  3035. 694.48 s [vector] +++ OK, passed 100 tests.
  3036. 694.50 s [vector] zipWithM_: OK
  3037. 694.50 s [vector] +++ OK, passed 100 tests.
  3038. 694.50 s [vector] filter: OK
  3039. 694.50 s [vector] +++ OK, passed 100 tests.
  3040. 694.50 s [vector] ifilter: OK
  3041. 694.50 s [vector] +++ OK, passed 100 tests.
  3042. 694.50 s [vector] filterM: OK (0.02s)
  3043. 694.50 s [vector] +++ OK, passed 100 tests.
  3044. 694.50 s [vector] uniq: OK
  3045. 694.50 s [vector] +++ OK, passed 100 tests.
  3046. 694.50 s [vector] mapMaybe: OK
  3047. 694.50 s [vector] +++ OK, passed 100 tests.
  3048. 694.50 s [vector] imapMaybe: OK
  3049. 694.50 s [vector] +++ OK, passed 100 tests.
  3050. 694.50 s [vector] takeWhile: OK
  3051. 694.50 s [vector] +++ OK, passed 100 tests.
  3052. 694.51 s [vector] dropWhile: OK
  3053. 694.51 s [vector] +++ OK, passed 100 tests.
  3054. 694.51 s [vector] partition: OK
  3055. 694.51 s [vector] +++ OK, passed 100 tests.
  3056. 694.51 s [vector] partitionWith: OK
  3057. 694.51 s [vector] +++ OK, passed 100 tests.
  3058. 694.51 s [vector] span: OK
  3059. 694.51 s [vector] +++ OK, passed 100 tests.
  3060. 694.51 s [vector] break: OK
  3061. 694.51 s [vector] +++ OK, passed 100 tests.
  3062. 694.51 s [vector] spanR: OK
  3063. 694.51 s [vector] +++ OK, passed 100 tests.
  3064. 694.51 s [vector] breakR: OK
  3065. 694.51 s [vector] +++ OK, passed 100 tests.
  3066. 694.51 s [vector] groupBy: OK
  3067. 694.51 s [vector] +++ OK, passed 100 tests.
  3068. 694.51 s [vector] elem: OK
  3069. 694.51 s [vector] +++ OK, passed 100 tests.
  3070. 694.51 s [vector] notElem: OK
  3071. 694.51 s [vector] +++ OK, passed 100 tests.
  3072. 694.51 s [vector] find: OK
  3073. 694.51 s [vector] +++ OK, passed 100 tests.
  3074. 694.51 s [vector] findIndex: OK
  3075. 694.51 s [vector] +++ OK, passed 100 tests.
  3076. 694.52 s [vector] findIndexR: OK
  3077. 694.52 s [vector] +++ OK, passed 100 tests.
  3078. 694.52 s [vector] findIndices: OK
  3079. 694.52 s [vector] +++ OK, passed 100 tests.
  3080. 694.52 s [vector] elemIndex: OK
  3081. 694.52 s [vector] +++ OK, passed 100 tests.
  3082. 694.52 s [vector] elemIndices: OK
  3083. 694.52 s [vector] +++ OK, passed 100 tests.
  3084. 694.52 s [vector] foldl: OK
  3085. 694.52 s [vector] +++ OK, passed 100 tests.
  3086. 694.52 s [vector] foldl1: OK
  3087. 694.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3088. 694.52 s [vector] foldl': OK
  3089. 694.52 s [vector] +++ OK, passed 100 tests.
  3090. 694.52 s [vector] foldl1': OK
  3091. 694.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3092. 694.52 s [vector] foldr: OK
  3093. 694.53 s [vector] +++ OK, passed 100 tests.
  3094. 694.53 s [vector] foldr1: OK
  3095. 694.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3096. 694.53 s [vector] foldr': OK
  3097. 694.53 s [vector] +++ OK, passed 100 tests.
  3098. 694.53 s [vector] foldr1': OK
  3099. 694.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3100. 694.53 s [vector] ifoldl: OK
  3101. 694.53 s [vector] +++ OK, passed 100 tests.
  3102. 694.53 s [vector] ifoldl': OK
  3103. 694.53 s [vector] +++ OK, passed 100 tests.
  3104. 694.54 s [vector] ifoldr: OK
  3105. 694.54 s [vector] +++ OK, passed 100 tests.
  3106. 694.54 s [vector] ifoldr': OK
  3107. 694.54 s [vector] +++ OK, passed 100 tests.
  3108. 694.54 s [vector] ifoldM: OK
  3109. 694.54 s [vector] +++ OK, passed 100 tests.
  3110. 694.55 s [vector] ifoldM': OK
  3111. 694.56 s [vector] +++ OK, passed 100 tests.
  3112. 694.56 s [vector] ifoldM_: OK (0.01s)
  3113. 694.56 s [vector] +++ OK, passed 100 tests.
  3114. 694.57 s [vector] ifoldM'_: OK (0.01s)
  3115. 694.57 s [vector] +++ OK, passed 100 tests.
  3116. 694.57 s [vector] all: OK
  3117. 694.57 s [vector] +++ OK, passed 100 tests.
  3118. 694.57 s [vector] any: OK
  3119. 694.57 s [vector] +++ OK, passed 100 tests.
  3120. 694.57 s [vector] prescanl: OK
  3121. 694.58 s [vector] +++ OK, passed 100 tests.
  3122. 694.58 s [vector] prescanl': OK
  3123. 694.58 s [vector] +++ OK, passed 100 tests.
  3124. 694.58 s [vector] postscanl: OK
  3125. 694.58 s [vector] +++ OK, passed 100 tests.
  3126. 694.59 s [vector] postscanl': OK
  3127. 694.59 s [vector] +++ OK, passed 100 tests.
  3128. 694.59 s [vector] scanl: OK
  3129. 694.59 s [vector] +++ OK, passed 100 tests.
  3130. 694.59 s [vector] scanl': OK
  3131. 694.59 s [vector] +++ OK, passed 100 tests.
  3132. 694.59 s [vector] scanl1: OK
  3133. 694.59 s [vector] +++ OK, passed 100 tests.
  3134. 694.59 s [vector] scanl1': OK
  3135. 694.59 s [vector] +++ OK, passed 100 tests.
  3136. 694.59 s [vector] iscanl: OK
  3137. 694.59 s [vector] +++ OK, passed 100 tests.
  3138. 694.60 s [vector] iscanl': OK
  3139. 694.60 s [vector] +++ OK, passed 100 tests.
  3140. 694.60 s [vector] prescanr: OK
  3141. 694.60 s [vector] +++ OK, passed 100 tests.
  3142. 694.60 s [vector] prescanr': OK
  3143. 694.60 s [vector] +++ OK, passed 100 tests.
  3144. 694.60 s [vector] postscanr: OK
  3145. 694.61 s [vector] +++ OK, passed 100 tests.
  3146. 694.61 s [vector] postscanr': OK
  3147. 694.61 s [vector] +++ OK, passed 100 tests.
  3148. 694.61 s [vector] scanr: OK
  3149. 694.61 s [vector] +++ OK, passed 100 tests.
  3150. 694.61 s [vector] scanr': OK
  3151. 694.61 s [vector] +++ OK, passed 100 tests.
  3152. 694.61 s [vector] scanr1: OK
  3153. 694.61 s [vector] +++ OK, passed 100 tests.
  3154. 694.61 s [vector] scanr1': OK
  3155. 694.61 s [vector] +++ OK, passed 100 tests.
  3156. 694.61 s [vector] iscanr: OK
  3157. 694.61 s [vector] +++ OK, passed 100 tests.
  3158. 694.61 s [vector] iscanr': OK
  3159. 694.61 s [vector] +++ OK, passed 100 tests.
  3160. 694.61 s [vector] mut_read: OK
  3161. 694.61 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3162. 694.61 s [vector] mut_write: OK
  3163. 694.61 s [vector] +++ OK, passed 100 tests; 25 discarded.
  3164. 694.61 s [vector] mut_modify: OK
  3165. 694.61 s [vector] +++ OK, passed 100 tests; 23 discarded.
  3166. 694.61 s [vector] mut_generate: OK
  3167. 694.63 s [vector] +++ OK, passed 100 tests.
  3168. 694.64 s [vector] mut_generateM: OK
  3169. 694.64 s [vector] +++ OK, passed 100 tests.
  3170. 694.64 s [vector] mut_mapM_: OK (0.01s)
  3171. 694.64 s [vector] +++ OK, passed 100 tests.
  3172. 694.64 s [vector] mut_imapM_: OK (0.01s)
  3173. 694.64 s [vector] +++ OK, passed 100 tests.
  3174. 694.66 s [vector] mut_forM_: OK
  3175. 694.66 s [vector] +++ OK, passed 100 tests.
  3176. 694.67 s [vector] mut_iforM_: OK (0.01s)
  3177. 694.67 s [vector] +++ OK, passed 100 tests.
  3178. 694.67 s [vector] mut_foldr: OK
  3179. 694.67 s [vector] +++ OK, passed 100 tests.
  3180. 694.67 s [vector] mut_foldr': OK
  3181. 694.67 s [vector] +++ OK, passed 100 tests.
  3182. 694.67 s [vector] mut_foldl: OK
  3183. 694.67 s [vector] +++ OK, passed 100 tests.
  3184. 694.67 s [vector] mut_foldl': OK
  3185. 694.67 s [vector] +++ OK, passed 100 tests.
  3186. 694.67 s [vector] mut_ifoldr: OK
  3187. 694.67 s [vector] +++ OK, passed 100 tests.
  3188. 694.68 s [vector] mut_ifoldr': OK
  3189. 694.68 s [vector] +++ OK, passed 100 tests.
  3190. 694.68 s [vector] mut_ifoldl: OK
  3191. 694.68 s [vector] +++ OK, passed 100 tests.
  3192. 694.68 s [vector] mut_ifoldl': OK
  3193. 694.69 s [vector] +++ OK, passed 100 tests.
  3194. 694.69 s [vector] mut_foldM: OK
  3195. 694.69 s [vector] +++ OK, passed 100 tests.
  3196. 694.70 s [vector] mut_foldM': OK
  3197. 694.70 s [vector] +++ OK, passed 100 tests.
  3198. 694.70 s [vector] mut_foldrM: OK
  3199. 694.70 s [vector] +++ OK, passed 100 tests.
  3200. 694.70 s [vector] mut_foldrM': OK
  3201. 694.70 s [vector] +++ OK, passed 100 tests.
  3202. 694.70 s [vector] mut_ifoldM: OK
  3203. 694.70 s [vector] +++ OK, passed 100 tests.
  3204. 694.70 s [vector] mut_ifoldM': OK
  3205. 694.70 s [vector] +++ OK, passed 100 tests.
  3206. 694.70 s [vector] mut_ifoldrM: OK
  3207. 694.70 s [vector] +++ OK, passed 100 tests.
  3208. 694.70 s [vector] mut_ifoldrM': OK
  3209. 694.70 s [vector] +++ OK, passed 100 tests.
  3210. 694.70 s [vector] compare: OK
  3211. 694.70 s [vector] +++ OK, passed 100 tests.
  3212. 694.70 s [vector] maximum: OK
  3213. 694.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3214. 694.70 s [vector] minimum: OK
  3215. 694.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3216. 694.71 s [vector] minIndex: OK
  3217. 694.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3218. 694.71 s [vector] maxIndex: OK
  3219. 694.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3220. 694.71 s [vector] maximumBy: OK
  3221. 694.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3222. 694.71 s [vector] minimumBy: OK
  3223. 694.71 s [vector] +++ OK, passed 100 tests; 24 discarded.
  3224. 694.71 s [vector] maximumOn: OK
  3225. 694.72 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3226. 694.72 s [vector] minimumOn: OK
  3227. 694.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3228. 694.72 s [vector] maxIndexBy: OK
  3229. 694.72 s [vector] +++ OK, passed 100 tests; 23 discarded.
  3230. 694.72 s [vector] minIndexBy: OK
  3231. 694.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3232. 694.72 s [vector] ListFirstMaxIndexWins: OK
  3233. 694.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3234. 694.72 s [vector] FalseListFirstMaxIndexWins: OK
  3235. 694.72 s [vector] +++ OK, failed as expected. (after 1 test):
  3236. 694.73 s [vector] Exception:
  3237. 694.73 s [vector] Prelude.foldr1: empty list
  3238. 694.73 s [vector] CallStack (from HasCallStack):
  3239. 694.74 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3240. 694.74 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3241. 694.74 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3242. 694.74 s [vector] []
  3243. 694.74 s [vector] zip: OK
  3244. 694.74 s [vector] +++ OK, passed 100 tests.
  3245. 694.74 s [vector] zip3: OK
  3246. 694.74 s [vector] +++ OK, passed 100 tests.
  3247. 694.75 s [vector] unzip: OK
  3248. 694.75 s [vector] +++ OK, passed 100 tests.
  3249. 694.75 s [vector] unzip3: OK
  3250. 694.75 s [vector] +++ OK, passed 100 tests.
  3251. 694.75 s [vector] indexed: OK
  3252. 694.76 s [vector] +++ OK, passed 100 tests.
  3253. 694.76 s [vector] update: OK
  3254. 694.76 s [vector] +++ OK, passed 100 tests.
  3255. 694.76 s [vector] concat: OK
  3256. 694.77 s [vector] +++ OK, passed 100 tests.
  3257. 694.77 s [vector] mempty: OK
  3258. 694.77 s [vector] +++ OK, passed 100 tests.
  3259. 694.77 s [vector] mappend: OK
  3260. 694.77 s [vector] +++ OK, passed 100 tests.
  3261. 694.77 s [vector] mconcat: OK (0.01s)
  3262. 694.77 s [vector] +++ OK, passed 100 tests.
  3263. 694.77 s [vector] fmap: OK
  3264. 694.77 s [vector] +++ OK, passed 100 tests.
  3265. 694.77 s [vector] return: OK
  3266. 694.77 s [vector] +++ OK, passed 100 tests.
  3267. 694.78 s [vector] bind: OK (0.01s)
  3268. 694.78 s [vector] +++ OK, passed 100 tests.
  3269. 694.79 s [vector] mzip: OK
  3270. 694.79 s [vector] +++ OK, passed 100 tests.
  3271. 694.79 s [vector] munzip: OK
  3272. 694.79 s [vector] +++ OK, passed 100 tests.
  3273. 694.79 s [vector] applicative_pure: OK
  3274. 694.79 s [vector] +++ OK, passed 100 tests.
  3275. 694.79 s [vector] applicative_appl: OK (0.02s)
  3276. 694.79 s [vector] +++ OK, passed 100 tests.
  3277. 694.80 s [vector] alternative_empty: OK
  3278. 694.80 s [vector] +++ OK, passed 100 tests.
  3279. 694.80 s [vector] alternative_or: OK
  3280. 694.80 s [vector] +++ OK, passed 100 tests.
  3281. 694.81 s [vector] sequence: OK (0.04s)
  3282. 694.81 s [vector] +++ OK, passed 100 tests.
  3283. 694.81 s [vector] sequence_: OK
  3284. 694.81 s [vector] +++ OK, passed 100 tests.
  3285. 694.81 s [vector] glength: OK
  3286. 694.81 s [vector] +++ OK, passed 100 tests.
  3287. 694.81 s [vector] and: OK
  3288. 694.81 s [vector] +++ OK, passed 100 tests.
  3289. 694.81 s [vector] or: OK
  3290. 694.81 s [vector] +++ OK, passed 100 tests.
  3291. 694.82 s [vector] Int
  3292. 694.82 s [vector] fromList.toList == id: OK
  3293. 694.82 s [vector] +++ OK, passed 100 tests.
  3294. 694.82 s [vector] toList.fromList == id: OK
  3295. 694.82 s [vector] +++ OK, passed 100 tests.
  3296. 694.82 s [vector] unstream.stream == id: OK
  3297. 694.82 s [vector] +++ OK, passed 100 tests.
  3298. 694.82 s [vector] stream.unstream == id: OK
  3299. 694.82 s [vector] +++ OK, passed 100 tests.
  3300. 694.82 s [vector] eq: OK
  3301. 694.82 s [vector] +++ OK, passed 100 tests.
  3302. 694.82 s [vector] length: OK
  3303. 694.82 s [vector] +++ OK, passed 100 tests.
  3304. 694.82 s [vector] null: OK
  3305. 694.82 s [vector] +++ OK, passed 100 tests.
  3306. 694.82 s [vector] index: OK
  3307. 694.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3308. 694.82 s [vector] safeIndex: OK
  3309. 694.82 s [vector] +++ OK, passed 100 tests.
  3310. 694.82 s [vector] head: OK
  3311. 694.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3312. 694.82 s [vector] last: OK
  3313. 694.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3314. 694.82 s [vector] unsafeIndex: OK
  3315. 694.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3316. 694.82 s [vector] unsafeHead: OK
  3317. 694.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3318. 694.82 s [vector] unsafeLast: OK
  3319. 694.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3320. 694.83 s [vector] slice: OK
  3321. 694.83 s [vector] +++ OK, passed 100 tests.
  3322. 694.83 s [vector] init: OK
  3323. 694.83 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3324. 694.83 s [vector] tail: OK
  3325. 694.83 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3326. 694.83 s [vector] take: OK
  3327. 694.83 s [vector] +++ OK, passed 100 tests.
  3328. 694.83 s [vector] drop: OK
  3329. 694.83 s [vector] +++ OK, passed 100 tests.
  3330. 694.83 s [vector] splitAt: OK
  3331. 694.83 s [vector] +++ OK, passed 100 tests.
  3332. 694.83 s [vector] empty: OK
  3333. 694.83 s [vector] +++ OK, passed 100 tests.
  3334. 694.83 s [vector] singleton: OK
  3335. 694.83 s [vector] +++ OK, passed 100 tests.
  3336. 694.83 s [vector] replicate: OK
  3337. 694.83 s [vector] +++ OK, passed 100 tests.
  3338. 694.83 s [vector] generate: OK
  3339. 694.84 s [vector] +++ OK, passed 100 tests.
  3340. 694.84 s [vector] iterateN: OK
  3341. 694.84 s [vector] +++ OK, passed 100 tests.
  3342. 694.89 s [vector] iterateNM: OK (0.05s)
  3343. 694.89 s [vector] +++ OK, passed 100 tests.
  3344. 694.89 s [vector] generateM: OK (0.01s)
  3345. 694.89 s [vector] +++ OK, passed 100 tests.
  3346. 694.90 s [vector] replicateM: OK
  3347. 694.90 s [vector] +++ OK, passed 100 tests.
  3348. 694.90 s [vector] create: OK
  3349. 694.90 s [vector] +++ OK, passed 100 tests.
  3350. 694.90 s [vector] createT: OK
  3351. 694.90 s [vector] +++ OK, passed 100 tests.
  3352. 694.90 s [vector] unfoldr: OK
  3353. 694.90 s [vector] +++ OK, passed 100 tests.
  3354. 694.90 s [vector] unfoldrN: OK
  3355. 694.90 s [vector] +++ OK, passed 100 tests.
  3356. 694.91 s [vector] unfoldrExactN: OK
  3357. 694.91 s [vector] +++ OK, passed 100 tests.
  3358. 694.92 s [vector] unfoldrM: OK
  3359. 694.92 s [vector] +++ OK, passed 100 tests.
  3360. 694.92 s [vector] unfoldrNM: OK
  3361. 694.92 s [vector] +++ OK, passed 100 tests.
  3362. 694.98 s [vector] unfoldrExactNM: OK (0.06s)
  3363. 694.98 s [vector] +++ OK, passed 100 tests.
  3364. 694.98 s [vector] constructN: OK
  3365. 694.98 s [vector] +++ OK, passed 100 tests.
  3366. 694.98 s [vector] constructrN: OK
  3367. 694.98 s [vector] +++ OK, passed 100 tests.
  3368. 694.99 s [vector] cons: OK
  3369. 694.99 s [vector] +++ OK, passed 100 tests.
  3370. 694.99 s [vector] snoc: OK
  3371. 694.99 s [vector] +++ OK, passed 100 tests.
  3372. 694.99 s [vector] append: OK
  3373. 695.00 s [vector] +++ OK, passed 100 tests.
  3374. 695.00 s [vector] concat: OK (0.01s)
  3375. 695.00 s [vector] +++ OK, passed 100 tests.
  3376. 695.00 s [vector] force: OK
  3377. 695.00 s [vector] +++ OK, passed 100 tests.
  3378. 695.00 s [vector] upd: OK
  3379. 695.00 s [vector] +++ OK, passed 100 tests.
  3380. 695.00 s [vector] accum: OK
  3381. 695.00 s [vector] +++ OK, passed 100 tests.
  3382. 695.00 s [vector] reverse: OK
  3383. 695.00 s [vector] +++ OK, passed 100 tests.
  3384. 695.00 s [vector] backpermute: OK
  3385. 695.00 s [vector] +++ OK, passed 100 tests.
  3386. 695.01 s [vector] map: OK
  3387. 695.01 s [vector] +++ OK, passed 100 tests.
  3388. 695.02 s [vector] imap: OK
  3389. 695.02 s [vector] +++ OK, passed 100 tests.
  3390. 695.16 s [vector] concatMap: OK
  3391. 695.16 s [vector] +++ OK, passed 100 tests.
  3392. 695.16 s [vector] mapM: OK
  3393. 695.16 s [vector] +++ OK, passed 100 tests.
  3394. 695.16 s [vector] mapM_: OK (0.02s)
  3395. 695.16 s [vector] +++ OK, passed 100 tests.
  3396. 695.16 s [vector] forM: OK
  3397. 695.16 s [vector] +++ OK, passed 100 tests.
  3398. 695.16 s [vector] forM_: OK (0.02s)
  3399. 695.16 s [vector] +++ OK, passed 100 tests.
  3400. 695.16 s [vector] imapM: OK
  3401. 695.16 s [vector] +++ OK, passed 100 tests.
  3402. 695.16 s [vector] imapM_: OK (0.02s)
  3403. 695.16 s [vector] +++ OK, passed 100 tests.
  3404. 695.16 s [vector] zipWith: OK
  3405. 695.16 s [vector] +++ OK, passed 100 tests.
  3406. 695.16 s [vector] zipWith3: OK
  3407. 695.16 s [vector] +++ OK, passed 100 tests.
  3408. 695.16 s [vector] izipWith: OK
  3409. 695.16 s [vector] +++ OK, passed 100 tests.
  3410. 695.16 s [vector] izipWith3: OK
  3411. 695.16 s [vector] +++ OK, passed 100 tests.
  3412. 695.16 s [vector] izipWithM: OK
  3413. 695.16 s [vector] +++ OK, passed 100 tests.
  3414. 695.16 s [vector] izipWithM_: OK
  3415. 695.16 s [vector] +++ OK, passed 100 tests.
  3416. 695.16 s [vector] zipWithM: OK
  3417. 695.16 s [vector] +++ OK, passed 100 tests.
  3418. 695.16 s [vector] zipWithM_: OK (0.01s)
  3419. 695.16 s [vector] +++ OK, passed 100 tests.
  3420. 695.16 s [vector] filter: OK
  3421. 695.16 s [vector] +++ OK, passed 100 tests.
  3422. 695.16 s [vector] ifilter: OK
  3423. 695.16 s [vector] +++ OK, passed 100 tests.
  3424. 695.16 s [vector] filterM: OK (0.02s)
  3425. 695.16 s [vector] +++ OK, passed 100 tests.
  3426. 695.16 s [vector] uniq: OK
  3427. 695.16 s [vector] +++ OK, passed 100 tests.
  3428. 695.16 s [vector] mapMaybe: OK
  3429. 695.16 s [vector] +++ OK, passed 100 tests.
  3430. 695.16 s [vector] imapMaybe: OK
  3431. 695.16 s [vector] +++ OK, passed 100 tests.
  3432. 695.16 s [vector] takeWhile: OK
  3433. 695.16 s [vector] +++ OK, passed 100 tests.
  3434. 695.16 s [vector] dropWhile: OK
  3435. 695.16 s [vector] +++ OK, passed 100 tests.
  3436. 695.16 s [vector] partition: OK
  3437. 695.16 s [vector] +++ OK, passed 100 tests.
  3438. 695.16 s [vector] partitionWith: OK
  3439. 695.16 s [vector] +++ OK, passed 100 tests.
  3440. 695.16 s [vector] span: OK
  3441. 695.16 s [vector] +++ OK, passed 100 tests.
  3442. 695.16 s [vector] break: OK
  3443. 695.16 s [vector] +++ OK, passed 100 tests.
  3444. 695.16 s [vector] spanR: OK
  3445. 695.16 s [vector] +++ OK, passed 100 tests.
  3446. 695.16 s [vector] breakR: OK
  3447. 695.16 s [vector] +++ OK, passed 100 tests.
  3448. 695.16 s [vector] groupBy: OK
  3449. 695.16 s [vector] +++ OK, passed 100 tests.
  3450. 695.16 s [vector] elem: OK
  3451. 695.16 s [vector] +++ OK, passed 100 tests.
  3452. 695.16 s [vector] notElem: OK
  3453. 695.16 s [vector] +++ OK, passed 100 tests.
  3454. 695.16 s [vector] find: OK
  3455. 695.16 s [vector] +++ OK, passed 100 tests.
  3456. 695.16 s [vector] findIndex: OK
  3457. 695.16 s [vector] +++ OK, passed 100 tests.
  3458. 695.17 s [vector] findIndexR: OK
  3459. 695.17 s [vector] +++ OK, passed 100 tests.
  3460. 695.17 s [vector] findIndices: OK
  3461. 695.17 s [vector] +++ OK, passed 100 tests.
  3462. 695.18 s [vector] elemIndex: OK
  3463. 695.18 s [vector] +++ OK, passed 100 tests.
  3464. 695.18 s [vector] elemIndices: OK
  3465. 695.18 s [vector] +++ OK, passed 100 tests.
  3466. 695.18 s [vector] foldl: OK
  3467. 695.18 s [vector] +++ OK, passed 100 tests.
  3468. 695.18 s [vector] foldl1: OK
  3469. 695.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3470. 695.18 s [vector] foldl': OK
  3471. 695.18 s [vector] +++ OK, passed 100 tests.
  3472. 695.18 s [vector] foldl1': OK
  3473. 695.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3474. 695.18 s [vector] foldr: OK
  3475. 695.18 s [vector] +++ OK, passed 100 tests.
  3476. 695.18 s [vector] foldr1: OK
  3477. 695.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3478. 695.18 s [vector] foldr': OK
  3479. 695.19 s [vector] +++ OK, passed 100 tests.
  3480. 695.19 s [vector] foldr1': OK
  3481. 695.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3482. 695.19 s [vector] ifoldl: OK
  3483. 695.19 s [vector] +++ OK, passed 100 tests.
  3484. 695.19 s [vector] ifoldl': OK
  3485. 695.19 s [vector] +++ OK, passed 100 tests.
  3486. 695.20 s [vector] ifoldr: OK
  3487. 695.20 s [vector] +++ OK, passed 100 tests.
  3488. 695.20 s [vector] ifoldr': OK
  3489. 695.20 s [vector] +++ OK, passed 100 tests.
  3490. 695.20 s [vector] ifoldM: OK
  3491. 695.20 s [vector] +++ OK, passed 100 tests.
  3492. 695.21 s [vector] ifoldM': OK
  3493. 695.21 s [vector] +++ OK, passed 100 tests.
  3494. 695.24 s [vector] ifoldM_: OK (0.02s)
  3495. 695.24 s [vector] +++ OK, passed 100 tests.
  3496. 695.24 s [vector] ifoldM'_: OK (0.02s)
  3497. 695.24 s [vector] +++ OK, passed 100 tests.
  3498. 695.25 s [vector] all: OK
  3499. 695.25 s [vector] +++ OK, passed 100 tests.
  3500. 695.25 s [vector] any: OK
  3501. 695.26 s [vector] +++ OK, passed 100 tests.
  3502. 695.26 s [vector] prescanl: OK
  3503. 695.26 s [vector] +++ OK, passed 100 tests.
  3504. 695.26 s [vector] prescanl': OK
  3505. 695.26 s [vector] +++ OK, passed 100 tests.
  3506. 695.26 s [vector] postscanl: OK
  3507. 695.26 s [vector] +++ OK, passed 100 tests.
  3508. 695.26 s [vector] postscanl': OK
  3509. 695.26 s [vector] +++ OK, passed 100 tests.
  3510. 695.26 s [vector] scanl: OK
  3511. 695.26 s [vector] +++ OK, passed 100 tests.
  3512. 695.26 s [vector] scanl': OK
  3513. 695.26 s [vector] +++ OK, passed 100 tests.
  3514. 695.26 s [vector] scanl1: OK
  3515. 695.26 s [vector] +++ OK, passed 100 tests.
  3516. 695.26 s [vector] scanl1': OK
  3517. 695.27 s [vector] +++ OK, passed 100 tests.
  3518. 695.27 s [vector] iscanl: OK
  3519. 695.27 s [vector] +++ OK, passed 100 tests.
  3520. 695.27 s [vector] iscanl': OK
  3521. 695.27 s [vector] +++ OK, passed 100 tests.
  3522. 695.28 s [vector] prescanr: OK
  3523. 695.28 s [vector] +++ OK, passed 100 tests.
  3524. 695.28 s [vector] prescanr': OK
  3525. 695.28 s [vector] +++ OK, passed 100 tests.
  3526. 695.28 s [vector] postscanr: OK
  3527. 695.28 s [vector] +++ OK, passed 100 tests.
  3528. 695.28 s [vector] postscanr': OK
  3529. 695.28 s [vector] +++ OK, passed 100 tests.
  3530. 695.29 s [vector] scanr: OK
  3531. 695.29 s [vector] +++ OK, passed 100 tests.
  3532. 695.29 s [vector] scanr': OK
  3533. 695.29 s [vector] +++ OK, passed 100 tests.
  3534. 695.30 s [vector] scanr1: OK
  3535. 695.30 s [vector] +++ OK, passed 100 tests.
  3536. 695.30 s [vector] scanr1': OK
  3537. 695.30 s [vector] +++ OK, passed 100 tests.
  3538. 695.30 s [vector] iscanr: OK
  3539. 695.30 s [vector] +++ OK, passed 100 tests.
  3540. 695.30 s [vector] iscanr': OK
  3541. 695.30 s [vector] +++ OK, passed 100 tests.
  3542. 695.30 s [vector] mut_read: OK
  3543. 695.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3544. 695.31 s [vector] mut_write: OK
  3545. 695.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3546. 695.31 s [vector] mut_modify: OK
  3547. 695.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3548. 695.31 s [vector] mut_generate: OK
  3549. 695.31 s [vector] +++ OK, passed 100 tests.
  3550. 695.31 s [vector] mut_generateM: OK (0.01s)
  3551. 695.31 s [vector] +++ OK, passed 100 tests.
  3552. 695.34 s [vector] mut_mapM_: OK (0.02s)
  3553. 695.34 s [vector] +++ OK, passed 100 tests.
  3554. 695.36 s [vector] mut_imapM_: OK (0.02s)
  3555. 695.36 s [vector] +++ OK, passed 100 tests.
  3556. 695.38 s [vector] mut_forM_: OK (0.02s)
  3557. 695.38 s [vector] +++ OK, passed 100 tests.
  3558. 695.38 s [vector] mut_iforM_: OK (0.02s)
  3559. 695.39 s [vector] +++ OK, passed 100 tests.
  3560. 695.39 s [vector] mut_foldr: OK
  3561. 695.39 s [vector] +++ OK, passed 100 tests.
  3562. 695.39 s [vector] mut_foldr': OK
  3563. 695.39 s [vector] +++ OK, passed 100 tests.
  3564. 695.39 s [vector] mut_foldl: OK
  3565. 695.39 s [vector] +++ OK, passed 100 tests.
  3566. 695.39 s [vector] mut_foldl': OK
  3567. 695.40 s [vector] +++ OK, passed 100 tests.
  3568. 695.40 s [vector] mut_ifoldr: OK
  3569. 695.40 s [vector] +++ OK, passed 100 tests.
  3570. 695.40 s [vector] mut_ifoldr': OK
  3571. 695.40 s [vector] +++ OK, passed 100 tests.
  3572. 695.40 s [vector] mut_ifoldl: OK
  3573. 695.40 s [vector] +++ OK, passed 100 tests.
  3574. 695.41 s [vector] mut_ifoldl': OK
  3575. 695.41 s [vector] +++ OK, passed 100 tests.
  3576. 695.42 s [vector] mut_foldM: OK
  3577. 695.42 s [vector] +++ OK, passed 100 tests.
  3578. 695.42 s [vector] mut_foldM': OK
  3579. 695.42 s [vector] +++ OK, passed 100 tests.
  3580. 695.43 s [vector] mut_foldrM: OK
  3581. 695.43 s [vector] +++ OK, passed 100 tests.
  3582. 695.43 s [vector] mut_foldrM': OK
  3583. 695.43 s [vector] +++ OK, passed 100 tests.
  3584. 695.43 s [vector] mut_ifoldM: OK
  3585. 695.43 s [vector] +++ OK, passed 100 tests.
  3586. 695.43 s [vector] mut_ifoldM': OK
  3587. 695.44 s [vector] +++ OK, passed 100 tests.
  3588. 695.44 s [vector] mut_ifoldrM: OK
  3589. 695.44 s [vector] +++ OK, passed 100 tests.
  3590. 695.44 s [vector] mut_ifoldrM': OK
  3591. 695.44 s [vector] +++ OK, passed 100 tests.
  3592. 695.44 s [vector] compare: OK
  3593. 695.44 s [vector] +++ OK, passed 100 tests.
  3594. 695.44 s [vector] maximum: OK
  3595. 695.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3596. 695.44 s [vector] minimum: OK
  3597. 695.44 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3598. 695.44 s [vector] minIndex: OK
  3599. 695.44 s [vector] +++ OK, passed 100 tests; 10 discarded.
  3600. 695.44 s [vector] maxIndex: OK
  3601. 695.44 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3602. 695.44 s [vector] maximumBy: OK
  3603. 695.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3604. 695.44 s [vector] minimumBy: OK
  3605. 695.44 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3606. 695.44 s [vector] maximumOn: OK
  3607. 695.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3608. 695.44 s [vector] minimumOn: OK
  3609. 695.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3610. 695.44 s [vector] maxIndexBy: OK
  3611. 695.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3612. 695.44 s [vector] minIndexBy: OK
  3613. 695.44 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3614. 695.44 s [vector] ListFirstMaxIndexWins: OK
  3615. 695.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3616. 695.44 s [vector] FalseListFirstMaxIndexWins: OK
  3617. 695.44 s [vector] +++ OK, failed as expected. (after 1 test):
  3618. 695.44 s [vector] Exception:
  3619. 695.44 s [vector] Prelude.foldr1: empty list
  3620. 695.44 s [vector] CallStack (from HasCallStack):
  3621. 695.44 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3622. 695.44 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3623. 695.44 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3624. 695.44 s [vector] []
  3625. 695.44 s [vector] zip: OK
  3626. 695.44 s [vector] +++ OK, passed 100 tests.
  3627. 695.44 s [vector] zip3: OK
  3628. 695.44 s [vector] +++ OK, passed 100 tests.
  3629. 695.44 s [vector] unzip: OK
  3630. 695.44 s [vector] +++ OK, passed 100 tests.
  3631. 695.45 s [vector] unzip3: OK
  3632. 695.45 s [vector] +++ OK, passed 100 tests.
  3633. 695.45 s [vector] indexed: OK
  3634. 695.45 s [vector] +++ OK, passed 100 tests.
  3635. 695.45 s [vector] update: OK
  3636. 695.46 s [vector] +++ OK, passed 100 tests.
  3637. 695.47 s [vector] concat: OK (0.02s)
  3638. 695.47 s [vector] +++ OK, passed 100 tests.
  3639. 695.47 s [vector] mempty: OK
  3640. 695.47 s [vector] +++ OK, passed 100 tests.
  3641. 695.48 s [vector] mappend: OK
  3642. 695.48 s [vector] +++ OK, passed 100 tests.
  3643. 695.49 s [vector] mconcat: OK (0.02s)
  3644. 695.49 s [vector] +++ OK, passed 100 tests.
  3645. 695.49 s [vector] fmap: OK
  3646. 695.49 s [vector] +++ OK, passed 100 tests.
  3647. 695.50 s [vector] return: OK
  3648. 695.50 s [vector] +++ OK, passed 100 tests.
  3649. 695.51 s [vector] bind: OK (0.02s)
  3650. 695.51 s [vector] +++ OK, passed 100 tests.
  3651. 695.51 s [vector] mzip: OK
  3652. 695.51 s [vector] +++ OK, passed 100 tests.
  3653. 695.51 s [vector] munzip: OK
  3654. 695.51 s [vector] +++ OK, passed 100 tests.
  3655. 695.51 s [vector] applicative_pure: OK
  3656. 695.52 s [vector] +++ OK, passed 100 tests.
  3657. 695.55 s [vector] applicative_appl: OK (0.03s)
  3658. 695.55 s [vector] +++ OK, passed 100 tests.
  3659. 695.55 s [vector] alternative_empty: OK
  3660. 695.55 s [vector] +++ OK, passed 100 tests.
  3661. 695.55 s [vector] alternative_or: OK
  3662. 695.56 s [vector] +++ OK, passed 100 tests.
  3663. 695.58 s [vector] sequence: OK (0.03s)
  3664. 695.58 s [vector] +++ OK, passed 100 tests.
  3665. 695.59 s [vector] sequence_: OK
  3666. 695.59 s [vector] +++ OK, passed 100 tests.
  3667. 695.59 s [vector] glength: OK
  3668. 695.59 s [vector] +++ OK, passed 100 tests.
  3669. 695.59 s [vector] sum: OK
  3670. 695.59 s [vector] +++ OK, passed 100 tests.
  3671. 695.59 s [vector] product: OK
  3672. 695.59 s [vector] +++ OK, passed 100 tests.
  3673. 695.59 s [vector] enumFromN: OK
  3674. 695.60 s [vector] +++ OK, passed 100 tests.
  3675. 695.60 s [vector] enumFromThenN: OK
  3676. 695.60 s [vector] +++ OK, passed 100 tests.
  3677. 695.60 s [vector] enumFromTo: OK
  3678. 695.60 s [vector] +++ OK, passed 100 tests.
  3679. 695.60 s [vector] enumFromThenTo: OK
  3680. 695.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3681. 695.60 s [vector] unstream
  3682. 695.60 s [vector] unstream == vunstream (exact): OK
  3683. 695.60 s [vector] +++ OK, passed 100 tests.
  3684. 695.61 s [vector] unstream == vunstream (unknown): OK
  3685. 695.61 s [vector] +++ OK, passed 100 tests.
  3686. 695.61 s [vector] unstreamR ~= vunstream (exact): OK
  3687. 695.61 s [vector] +++ OK, passed 100 tests.
  3688. 695.61 s [vector] unstreamR ~= vunstream (unknown): OK
  3689. 695.61 s [vector] +++ OK, passed 100 tests.
  3690. 695.61 s [vector] Tests.Vector.Primitive
  3691. 695.61 s [vector] Int
  3692. 695.61 s [vector] fromList.toList == id: OK
  3693. 695.61 s [vector] +++ OK, passed 100 tests.
  3694. 695.61 s [vector] toList.fromList == id: OK
  3695. 695.61 s [vector] +++ OK, passed 100 tests.
  3696. 695.61 s [vector] unstream.stream == id: OK
  3697. 695.61 s [vector] +++ OK, passed 100 tests.
  3698. 695.61 s [vector] stream.unstream == id: OK
  3699. 695.61 s [vector] +++ OK, passed 100 tests.
  3700. 695.61 s [vector] eq: OK
  3701. 695.61 s [vector] +++ OK, passed 100 tests.
  3702. 695.61 s [vector] length: OK
  3703. 695.61 s [vector] +++ OK, passed 100 tests.
  3704. 695.61 s [vector] null: OK
  3705. 695.61 s [vector] +++ OK, passed 100 tests.
  3706. 695.61 s [vector] index: OK
  3707. 695.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3708. 695.61 s [vector] safeIndex: OK
  3709. 695.61 s [vector] +++ OK, passed 100 tests.
  3710. 695.61 s [vector] head: OK
  3711. 695.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3712. 695.61 s [vector] last: OK
  3713. 695.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3714. 695.61 s [vector] unsafeIndex: OK
  3715. 695.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3716. 695.61 s [vector] unsafeHead: OK
  3717. 695.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3718. 695.61 s [vector] unsafeLast: OK
  3719. 695.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3720. 695.61 s [vector] slice: OK
  3721. 695.61 s [vector] +++ OK, passed 100 tests.
  3722. 695.61 s [vector] init: OK
  3723. 695.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3724. 695.62 s [vector] tail: OK
  3725. 695.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3726. 695.62 s [vector] take: OK
  3727. 695.62 s [vector] +++ OK, passed 100 tests.
  3728. 695.62 s [vector] drop: OK
  3729. 695.62 s [vector] +++ OK, passed 100 tests.
  3730. 695.62 s [vector] splitAt: OK
  3731. 695.62 s [vector] +++ OK, passed 100 tests.
  3732. 695.62 s [vector] empty: OK
  3733. 695.62 s [vector] +++ OK, passed 100 tests.
  3734. 695.62 s [vector] singleton: OK
  3735. 695.62 s [vector] +++ OK, passed 100 tests.
  3736. 695.62 s [vector] replicate: OK
  3737. 695.62 s [vector] +++ OK, passed 100 tests.
  3738. 695.62 s [vector] generate: OK
  3739. 695.62 s [vector] +++ OK, passed 100 tests.
  3740. 695.62 s [vector] iterateN: OK
  3741. 695.62 s [vector] +++ OK, passed 100 tests.
  3742. 695.64 s [vector] iterateNM: OK (0.02s)
  3743. 695.64 s [vector] +++ OK, passed 100 tests.
  3744. 695.67 s [vector] generateM: OK (0.03s)
  3745. 695.67 s [vector] +++ OK, passed 100 tests.
  3746. 695.67 s [vector] replicateM: OK
  3747. 695.67 s [vector] +++ OK, passed 100 tests.
  3748. 695.67 s [vector] create: OK
  3749. 695.67 s [vector] +++ OK, passed 100 tests.
  3750. 695.67 s [vector] createT: OK
  3751. 695.68 s [vector] +++ OK, passed 100 tests.
  3752. 695.68 s [vector] unfoldr: OK
  3753. 695.68 s [vector] +++ OK, passed 100 tests.
  3754. 695.69 s [vector] unfoldrN: OK
  3755. 695.69 s [vector] +++ OK, passed 100 tests.
  3756. 695.69 s [vector] unfoldrExactN: OK
  3757. 695.69 s [vector] +++ OK, passed 100 tests.
  3758. 695.70 s [vector] unfoldrM: OK (0.03s)
  3759. 695.70 s [vector] +++ OK, passed 100 tests.
  3760. 695.70 s [vector] unfoldrNM: OK
  3761. 695.70 s [vector] +++ OK, passed 100 tests.
  3762. 695.74 s [vector] unfoldrExactNM: OK (0.03s)
  3763. 695.74 s [vector] +++ OK, passed 100 tests.
  3764. 695.75 s [vector] constructN: OK
  3765. 695.75 s [vector] +++ OK, passed 100 tests.
  3766. 695.75 s [vector] constructrN: OK
  3767. 695.76 s [vector] +++ OK, passed 100 tests.
  3768. 695.76 s [vector] cons: OK
  3769. 695.76 s [vector] +++ OK, passed 100 tests.
  3770. 695.76 s [vector] snoc: OK
  3771. 695.76 s [vector] +++ OK, passed 100 tests.
  3772. 695.76 s [vector] append: OK
  3773. 695.76 s [vector] +++ OK, passed 100 tests.
  3774. 695.76 s [vector] concat: OK (0.02s)
  3775. 695.76 s [vector] +++ OK, passed 100 tests.
  3776. 695.76 s [vector] force: OK
  3777. 695.76 s [vector] +++ OK, passed 100 tests.
  3778. 695.77 s [vector] upd: OK
  3779. 695.77 s [vector] +++ OK, passed 100 tests.
  3780. 695.77 s [vector] accum: OK
  3781. 695.77 s [vector] +++ OK, passed 100 tests.
  3782. 695.78 s [vector] reverse: OK
  3783. 695.78 s [vector] +++ OK, passed 100 tests.
  3784. 695.78 s [vector] backpermute: OK
  3785. 695.78 s [vector] +++ OK, passed 100 tests.
  3786. 695.78 s [vector] map: OK
  3787. 695.78 s [vector] +++ OK, passed 100 tests.
  3788. 695.78 s [vector] imap: OK
  3789. 695.78 s [vector] +++ OK, passed 100 tests.
  3790. 695.78 s [vector] concatMap: OK
  3791. 695.78 s [vector] +++ OK, passed 100 tests.
  3792. 695.78 s [vector] mapM: OK
  3793. 695.78 s [vector] +++ OK, passed 100 tests.
  3794. 695.80 s [vector] mapM_: OK (0.02s)
  3795. 695.80 s [vector] +++ OK, passed 100 tests.
  3796. 695.80 s [vector] forM: OK
  3797. 695.82 s [vector] +++ OK, passed 100 tests.
  3798. 695.82 s [vector] forM_: OK (0.02s)
  3799. 695.82 s [vector] +++ OK, passed 100 tests.
  3800. 695.82 s [vector] imapM: OK
  3801. 695.82 s [vector] +++ OK, passed 100 tests.
  3802. 695.84 s [vector] imapM_: OK (0.02s)
  3803. 695.85 s [vector] +++ OK, passed 100 tests.
  3804. 695.85 s [vector] zipWith: OK
  3805. 695.85 s [vector] +++ OK, passed 100 tests.
  3806. 695.85 s [vector] zipWith3: OK
  3807. 695.85 s [vector] +++ OK, passed 100 tests.
  3808. 695.85 s [vector] izipWith: OK
  3809. 695.85 s [vector] +++ OK, passed 100 tests.
  3810. 695.86 s [vector] izipWith3: OK
  3811. 695.86 s [vector] +++ OK, passed 100 tests.
  3812. 695.87 s [vector] izipWithM: OK
  3813. 695.87 s [vector] +++ OK, passed 100 tests.
  3814. 695.88 s [vector] izipWithM_: OK (0.01s)
  3815. 695.88 s [vector] +++ OK, passed 100 tests.
  3816. 695.88 s [vector] zipWithM: OK
  3817. 695.88 s [vector] +++ OK, passed 100 tests.
  3818. 695.89 s [vector] zipWithM_: OK (0.01s)
  3819. 695.89 s [vector] +++ OK, passed 100 tests.
  3820. 695.89 s [vector] filter: OK
  3821. 695.89 s [vector] +++ OK, passed 100 tests.
  3822. 695.90 s [vector] ifilter: OK
  3823. 695.90 s [vector] +++ OK, passed 100 tests.
  3824. 695.91 s [vector] filterM: OK (0.02s)
  3825. 695.91 s [vector] +++ OK, passed 100 tests.
  3826. 695.91 s [vector] uniq: OK
  3827. 695.91 s [vector] +++ OK, passed 100 tests.
  3828. 695.92 s [vector] mapMaybe: OK
  3829. 695.92 s [vector] +++ OK, passed 100 tests.
  3830. 695.92 s [vector] imapMaybe: OK
  3831. 695.92 s [vector] +++ OK, passed 100 tests.
  3832. 695.92 s [vector] takeWhile: OK
  3833. 695.92 s [vector] +++ OK, passed 100 tests.
  3834. 695.92 s [vector] dropWhile: OK
  3835. 695.92 s [vector] +++ OK, passed 100 tests.
  3836. 695.92 s [vector] partition: OK
  3837. 695.93 s [vector] +++ OK, passed 100 tests.
  3838. 695.93 s [vector] partitionWith: OK
  3839. 695.93 s [vector] +++ OK, passed 100 tests.
  3840. 695.93 s [vector] span: OK
  3841. 695.93 s [vector] +++ OK, passed 100 tests.
  3842. 695.93 s [vector] break: OK
  3843. 695.93 s [vector] +++ OK, passed 100 tests.
  3844. 695.93 s [vector] spanR: OK
  3845. 695.94 s [vector] +++ OK, passed 100 tests.
  3846. 695.94 s [vector] breakR: OK
  3847. 695.94 s [vector] +++ OK, passed 100 tests.
  3848. 695.94 s [vector] groupBy: OK
  3849. 695.95 s [vector] +++ OK, passed 100 tests.
  3850. 695.95 s [vector] elem: OK
  3851. 695.95 s [vector] +++ OK, passed 100 tests.
  3852. 695.96 s [vector] notElem: OK
  3853. 695.96 s [vector] +++ OK, passed 100 tests.
  3854. 695.96 s [vector] find: OK
  3855. 695.96 s [vector] +++ OK, passed 100 tests.
  3856. 695.96 s [vector] findIndex: OK
  3857. 695.97 s [vector] +++ OK, passed 100 tests.
  3858. 695.97 s [vector] findIndexR: OK
  3859. 695.97 s [vector] +++ OK, passed 100 tests.
  3860. 695.97 s [vector] findIndices: OK
  3861. 695.97 s [vector] +++ OK, passed 100 tests.
  3862. 695.97 s [vector] elemIndex: OK
  3863. 695.97 s [vector] +++ OK, passed 100 tests.
  3864. 695.97 s [vector] elemIndices: OK
  3865. 695.97 s [vector] +++ OK, passed 100 tests.
  3866. 695.97 s [vector] foldl: OK
  3867. 695.97 s [vector] +++ OK, passed 100 tests.
  3868. 695.97 s [vector] foldl1: OK
  3869. 695.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3870. 695.97 s [vector] foldl': OK
  3871. 695.97 s [vector] +++ OK, passed 100 tests.
  3872. 695.97 s [vector] foldl1': OK
  3873. 695.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3874. 695.97 s [vector] foldr: OK
  3875. 695.97 s [vector] +++ OK, passed 100 tests.
  3876. 695.98 s [vector] foldr1: OK
  3877. 695.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3878. 695.98 s [vector] foldr': OK
  3879. 695.98 s [vector] +++ OK, passed 100 tests.
  3880. 695.98 s [vector] foldr1': OK
  3881. 695.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3882. 695.98 s [vector] ifoldl: OK
  3883. 695.98 s [vector] +++ OK, passed 100 tests.
  3884. 695.98 s [vector] ifoldl': OK
  3885. 695.98 s [vector] +++ OK, passed 100 tests.
  3886. 695.99 s [vector] ifoldr: OK
  3887. 695.99 s [vector] +++ OK, passed 100 tests.
  3888. 695.99 s [vector] ifoldr': OK
  3889. 695.99 s [vector] +++ OK, passed 100 tests.
  3890. 695.99 s [vector] ifoldM: OK
  3891. 695.99 s [vector] +++ OK, passed 100 tests.
  3892. 695.99 s [vector] ifoldM': OK
  3893. 695.99 s [vector] +++ OK, passed 100 tests.
  3894. 696.00 s [vector] ifoldM_: OK (0.02s)
  3895. 696.00 s [vector] +++ OK, passed 100 tests.
  3896. 696.01 s [vector] ifoldM'_: OK (0.02s)
  3897. 696.01 s [vector] +++ OK, passed 100 tests.
  3898. 696.01 s [vector] all: OK
  3899. 696.01 s [vector] +++ OK, passed 100 tests.
  3900. 696.02 s [vector] any: OK
  3901. 696.02 s [vector] +++ OK, passed 100 tests.
  3902. 696.02 s [vector] prescanl: OK
  3903. 696.02 s [vector] +++ OK, passed 100 tests.
  3904. 696.02 s [vector] prescanl': OK
  3905. 696.03 s [vector] +++ OK, passed 100 tests.
  3906. 696.03 s [vector] postscanl: OK
  3907. 696.04 s [vector] +++ OK, passed 100 tests.
  3908. 696.04 s [vector] postscanl': OK
  3909. 696.04 s [vector] +++ OK, passed 100 tests.
  3910. 696.04 s [vector] scanl: OK
  3911. 696.04 s [vector] +++ OK, passed 100 tests.
  3912. 696.05 s [vector] scanl': OK
  3913. 696.05 s [vector] +++ OK, passed 100 tests.
  3914. 696.05 s [vector] scanl1: OK
  3915. 696.05 s [vector] +++ OK, passed 100 tests.
  3916. 696.06 s [vector] scanl1': OK
  3917. 696.06 s [vector] +++ OK, passed 100 tests.
  3918. 696.06 s [vector] iscanl: OK
  3919. 696.06 s [vector] +++ OK, passed 100 tests.
  3920. 696.06 s [vector] iscanl': OK
  3921. 696.06 s [vector] +++ OK, passed 100 tests.
  3922. 696.06 s [vector] prescanr: OK
  3923. 696.06 s [vector] +++ OK, passed 100 tests.
  3924. 696.06 s [vector] prescanr': OK
  3925. 696.07 s [vector] +++ OK, passed 100 tests.
  3926. 696.07 s [vector] postscanr: OK
  3927. 696.08 s [vector] +++ OK, passed 100 tests.
  3928. 696.08 s [vector] postscanr': OK
  3929. 696.08 s [vector] +++ OK, passed 100 tests.
  3930. 696.08 s [vector] scanr: OK
  3931. 696.08 s [vector] +++ OK, passed 100 tests.
  3932. 696.08 s [vector] scanr': OK
  3933. 696.08 s [vector] +++ OK, passed 100 tests.
  3934. 696.08 s [vector] scanr1: OK
  3935. 696.08 s [vector] +++ OK, passed 100 tests.
  3936. 696.08 s [vector] scanr1': OK
  3937. 696.08 s [vector] +++ OK, passed 100 tests.
  3938. 696.08 s [vector] iscanr: OK
  3939. 696.08 s [vector] +++ OK, passed 100 tests.
  3940. 696.08 s [vector] iscanr': OK
  3941. 696.08 s [vector] +++ OK, passed 100 tests.
  3942. 696.08 s [vector] mut_read: OK
  3943. 696.09 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3944. 696.10 s [vector] mut_write: OK
  3945. 696.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3946. 696.10 s [vector] mut_modify: OK
  3947. 696.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3948. 696.10 s [vector] mut_generate: OK
  3949. 696.10 s [vector] +++ OK, passed 100 tests.
  3950. 696.10 s [vector] mut_generateM: OK
  3951. 696.10 s [vector] +++ OK, passed 100 tests.
  3952. 696.12 s [vector] mut_mapM_: OK (0.02s)
  3953. 696.12 s [vector] +++ OK, passed 100 tests.
  3954. 696.14 s [vector] mut_imapM_: OK (0.02s)
  3955. 696.14 s [vector] +++ OK, passed 100 tests.
  3956. 696.16 s [vector] mut_forM_: OK (0.02s)
  3957. 696.16 s [vector] +++ OK, passed 100 tests.
  3958. 696.16 s [vector] mut_iforM_: OK (0.02s)
  3959. 696.16 s [vector] +++ OK, passed 100 tests.
  3960. 696.17 s [vector] mut_foldr: OK
  3961. 696.17 s [vector] +++ OK, passed 100 tests.
  3962. 696.18 s [vector] mut_foldr': OK
  3963. 696.18 s [vector] +++ OK, passed 100 tests.
  3964. 696.18 s [vector] mut_foldl: OK
  3965. 696.18 s [vector] +++ OK, passed 100 tests.
  3966. 696.18 s [vector] mut_foldl': OK
  3967. 696.18 s [vector] +++ OK, passed 100 tests.
  3968. 696.18 s [vector] mut_ifoldr: OK
  3969. 696.18 s [vector] +++ OK, passed 100 tests.
  3970. 696.18 s [vector] mut_ifoldr': OK
  3971. 696.18 s [vector] +++ OK, passed 100 tests.
  3972. 696.18 s [vector] mut_ifoldl: OK
  3973. 696.18 s [vector] +++ OK, passed 100 tests.
  3974. 696.19 s [vector] mut_ifoldl': OK
  3975. 696.19 s [vector] +++ OK, passed 100 tests.
  3976. 696.20 s [vector] mut_foldM: OK
  3977. 696.20 s [vector] +++ OK, passed 100 tests.
  3978. 696.20 s [vector] mut_foldM': OK
  3979. 696.20 s [vector] +++ OK, passed 100 tests.
  3980. 696.20 s [vector] mut_foldrM: OK
  3981. 696.20 s [vector] +++ OK, passed 100 tests.
  3982. 696.20 s [vector] mut_foldrM': OK
  3983. 696.20 s [vector] +++ OK, passed 100 tests.
  3984. 696.20 s [vector] mut_ifoldM: OK
  3985. 696.20 s [vector] +++ OK, passed 100 tests.
  3986. 696.21 s [vector] mut_ifoldM': OK
  3987. 696.21 s [vector] +++ OK, passed 100 tests.
  3988. 696.22 s [vector] mut_ifoldrM: OK
  3989. 696.22 s [vector] +++ OK, passed 100 tests.
  3990. 696.22 s [vector] mut_ifoldrM': OK
  3991. 696.22 s [vector] +++ OK, passed 100 tests.
  3992. 696.22 s [vector] compare: OK
  3993. 696.22 s [vector] +++ OK, passed 100 tests.
  3994. 696.22 s [vector] maximum: OK
  3995. 696.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3996. 696.22 s [vector] minimum: OK
  3997. 696.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3998. 696.22 s [vector] minIndex: OK
  3999. 696.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4000. 696.22 s [vector] maxIndex: OK
  4001. 696.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4002. 696.22 s [vector] maximumBy: OK
  4003. 696.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4004. 696.22 s [vector] minimumBy: OK
  4005. 696.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4006. 696.22 s [vector] maximumOn: OK
  4007. 696.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4008. 696.22 s [vector] minimumOn: OK
  4009. 696.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4010. 696.22 s [vector] maxIndexBy: OK
  4011. 696.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4012. 696.22 s [vector] minIndexBy: OK
  4013. 696.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4014. 696.22 s [vector] ListFirstMaxIndexWins: OK
  4015. 696.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4016. 696.22 s [vector] FalseListFirstMaxIndexWins: OK
  4017. 696.22 s [vector] +++ OK, failed as expected. (after 1 test):
  4018. 696.24 s [vector] Exception:
  4019. 696.24 s [vector] Prelude.foldr1: empty list
  4020. 696.24 s [vector] CallStack (from HasCallStack):
  4021. 696.24 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4022. 696.24 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4023. 696.24 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4024. 696.24 s [vector] []
  4025. 696.24 s [vector] mempty: OK
  4026. 696.24 s [vector] +++ OK, passed 100 tests.
  4027. 696.24 s [vector] mappend: OK
  4028. 696.24 s [vector] +++ OK, passed 100 tests.
  4029. 696.24 s [vector] mconcat: OK (0.02s)
  4030. 696.24 s [vector] +++ OK, passed 100 tests.
  4031. 696.25 s [vector] glength: OK
  4032. 696.25 s [vector] +++ OK, passed 100 tests.
  4033. 696.25 s [vector] sum: OK
  4034. 696.25 s [vector] +++ OK, passed 100 tests.
  4035. 696.25 s [vector] product: OK
  4036. 696.25 s [vector] +++ OK, passed 100 tests.
  4037. 696.25 s [vector] enumFromN: OK
  4038. 696.25 s [vector] +++ OK, passed 100 tests.
  4039. 696.25 s [vector] enumFromThenN: OK
  4040. 696.25 s [vector] +++ OK, passed 100 tests.
  4041. 696.25 s [vector] enumFromTo: OK
  4042. 696.26 s [vector] +++ OK, passed 100 tests.
  4043. 696.26 s [vector] enumFromThenTo: OK
  4044. 696.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4045. 696.26 s [vector] Double
  4046. 696.26 s [vector] fromList.toList == id: OK
  4047. 696.26 s [vector] +++ OK, passed 100 tests.
  4048. 696.26 s [vector] toList.fromList == id: OK
  4049. 696.26 s [vector] +++ OK, passed 100 tests.
  4050. 696.26 s [vector] unstream.stream == id: OK
  4051. 696.26 s [vector] +++ OK, passed 100 tests.
  4052. 696.26 s [vector] stream.unstream == id: OK
  4053. 696.26 s [vector] +++ OK, passed 100 tests.
  4054. 696.26 s [vector] eq: OK
  4055. 696.26 s [vector] +++ OK, passed 100 tests.
  4056. 696.26 s [vector] length: OK
  4057. 696.26 s [vector] +++ OK, passed 100 tests.
  4058. 696.26 s [vector] null: OK
  4059. 696.26 s [vector] +++ OK, passed 100 tests.
  4060. 696.27 s [vector] index: OK
  4061. 696.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4062. 696.27 s [vector] safeIndex: OK
  4063. 696.27 s [vector] +++ OK, passed 100 tests.
  4064. 696.27 s [vector] head: OK
  4065. 696.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4066. 696.27 s [vector] last: OK
  4067. 696.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4068. 696.27 s [vector] unsafeIndex: OK
  4069. 696.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4070. 696.27 s [vector] unsafeHead: OK
  4071. 696.27 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4072. 696.27 s [vector] unsafeLast: OK
  4073. 696.27 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4074. 696.27 s [vector] slice: OK
  4075. 696.27 s [vector] +++ OK, passed 100 tests.
  4076. 696.27 s [vector] init: OK
  4077. 696.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4078. 696.27 s [vector] tail: OK
  4079. 696.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4080. 696.27 s [vector] take: OK
  4081. 696.28 s [vector] +++ OK, passed 100 tests.
  4082. 696.28 s [vector] drop: OK
  4083. 696.28 s [vector] +++ OK, passed 100 tests.
  4084. 696.28 s [vector] splitAt: OK
  4085. 696.28 s [vector] +++ OK, passed 100 tests.
  4086. 696.28 s [vector] empty: OK
  4087. 696.28 s [vector] +++ OK, passed 100 tests.
  4088. 696.28 s [vector] singleton: OK
  4089. 696.28 s [vector] +++ OK, passed 100 tests.
  4090. 696.28 s [vector] replicate: OK
  4091. 696.28 s [vector] +++ OK, passed 100 tests.
  4092. 696.28 s [vector] generate: OK
  4093. 696.29 s [vector] +++ OK, passed 100 tests.
  4094. 696.29 s [vector] iterateN: OK
  4095. 696.29 s [vector] +++ OK, passed 100 tests.
  4096. 696.32 s [vector] iterateNM: OK (0.03s)
  4097. 696.32 s [vector] +++ OK, passed 100 tests.
  4098. 696.34 s [vector] generateM: OK (0.03s)
  4099. 696.34 s [vector] +++ OK, passed 100 tests.
  4100. 696.35 s [vector] replicateM: OK (0.02s)
  4101. 696.35 s [vector] +++ OK, passed 100 tests.
  4102. 696.35 s [vector] create: OK
  4103. 696.35 s [vector] +++ OK, passed 100 tests.
  4104. 696.36 s [vector] createT: OK
  4105. 696.36 s [vector] +++ OK, passed 100 tests.
  4106. 696.36 s [vector] unfoldr: OK
  4107. 696.36 s [vector] +++ OK, passed 100 tests.
  4108. 696.37 s [vector] unfoldrN: OK
  4109. 696.37 s [vector] +++ OK, passed 100 tests.
  4110. 696.37 s [vector] unfoldrExactN: OK
  4111. 696.37 s [vector] +++ OK, passed 100 tests.
  4112. 696.38 s [vector] unfoldrM: OK
  4113. 696.38 s [vector] +++ OK, passed 100 tests.
  4114. 696.38 s [vector] unfoldrNM: OK
  4115. 696.38 s [vector] +++ OK, passed 100 tests.
  4116. 696.39 s [vector] unfoldrExactNM: OK (0.02s)
  4117. 696.39 s [vector] +++ OK, passed 100 tests.
  4118. 696.42 s [vector] constructN: OK (0.01s)
  4119. 696.42 s [vector] +++ OK, passed 100 tests.
  4120. 696.42 s [vector] constructrN: OK (0.01s)
  4121. 696.42 s [vector] +++ OK, passed 100 tests.
  4122. 696.42 s [vector] cons: OK
  4123. 696.42 s [vector] +++ OK, passed 100 tests.
  4124. 696.42 s [vector] snoc: OK
  4125. 696.43 s [vector] +++ OK, passed 100 tests.
  4126. 696.44 s [vector] append: OK
  4127. 696.44 s [vector] +++ OK, passed 100 tests.
  4128. 696.46 s [vector] concat: OK (0.03s)
  4129. 696.46 s [vector] +++ OK, passed 100 tests.
  4130. 696.46 s [vector] force: OK
  4131. 696.46 s [vector] +++ OK, passed 100 tests.
  4132. 696.46 s [vector] upd: OK
  4133. 696.46 s [vector] +++ OK, passed 100 tests.
  4134. 696.48 s [vector] accum: OK (0.02s)
  4135. 696.48 s [vector] +++ OK, passed 100 tests.
  4136. 696.48 s [vector] reverse: OK
  4137. 696.50 s [vector] +++ OK, passed 100 tests.
  4138. 696.50 s [vector] backpermute: OK
  4139. 696.50 s [vector] +++ OK, passed 100 tests.
  4140. 696.50 s [vector] map: OK (0.02s)
  4141. 696.50 s [vector] +++ OK, passed 100 tests.
  4142. 696.52 s [vector] imap: OK (0.01s)
  4143. 696.52 s [vector] +++ OK, passed 100 tests.
  4144. 696.53 s [vector] concatMap: OK
  4145. 696.54 s [vector] +++ OK, passed 100 tests.
  4146. 696.54 s [vector] mapM: OK
  4147. 696.54 s [vector] +++ OK, passed 100 tests.
  4148. 696.57 s [vector] mapM_: OK (0.04s)
  4149. 696.58 s [vector] +++ OK, passed 100 tests.
  4150. 696.58 s [vector] forM: OK
  4151. 696.58 s [vector] +++ OK, passed 100 tests.
  4152. 696.63 s [vector] forM_: OK (0.05s)
  4153. 696.64 s [vector] +++ OK, passed 100 tests.
  4154. 696.64 s [vector] imapM: OK
  4155. 696.64 s [vector] +++ OK, passed 100 tests.
  4156. 696.69 s [vector] imapM_: OK (0.06s)
  4157. 696.69 s [vector] +++ OK, passed 100 tests.
  4158. 696.69 s [vector] zipWith: OK (0.01s)
  4159. 696.69 s [vector] +++ OK, passed 100 tests.
  4160. 696.72 s [vector] zipWith3: OK (0.01s)
  4161. 696.72 s [vector] +++ OK, passed 100 tests.
  4162. 696.72 s [vector] izipWith: OK (0.01s)
  4163. 696.72 s [vector] +++ OK, passed 100 tests.
  4164. 696.74 s [vector] izipWith3: OK (0.01s)
  4165. 696.74 s [vector] +++ OK, passed 100 tests.
  4166. 696.76 s [vector] izipWithM: OK (0.01s)
  4167. 696.76 s [vector] +++ OK, passed 100 tests.
  4168. 696.78 s [vector] izipWithM_: OK (0.03s)
  4169. 696.78 s [vector] +++ OK, passed 100 tests.
  4170. 696.78 s [vector] zipWithM: OK
  4171. 696.78 s [vector] +++ OK, passed 100 tests.
  4172. 696.81 s [vector] zipWithM_: OK (0.03s)
  4173. 696.81 s [vector] +++ OK, passed 100 tests.
  4174. 696.82 s [vector] filter: OK
  4175. 696.82 s [vector] +++ OK, passed 100 tests.
  4176. 696.84 s [vector] ifilter: OK (0.01s)
  4177. 696.84 s [vector] +++ OK, passed 100 tests.
  4178. 696.88 s [vector] filterM: OK (0.06s)
  4179. 696.88 s [vector] +++ OK, passed 100 tests.
  4180. 696.89 s [vector] uniq: OK
  4181. 696.89 s [vector] +++ OK, passed 100 tests.
  4182. 696.89 s [vector] mapMaybe: OK
  4183. 696.89 s [vector] +++ OK, passed 100 tests.
  4184. 696.90 s [vector] imapMaybe: OK
  4185. 696.91 s [vector] +++ OK, passed 100 tests.
  4186. 696.92 s [vector] takeWhile: OK
  4187. 696.92 s [vector] +++ OK, passed 100 tests.
  4188. 696.92 s [vector] dropWhile: OK
  4189. 696.92 s [vector] +++ OK, passed 100 tests.
  4190. 696.92 s [vector] partition: OK
  4191. 696.93 s [vector] +++ OK, passed 100 tests.
  4192. 696.93 s [vector] partitionWith: OK
  4193. 696.93 s [vector] +++ OK, passed 100 tests.
  4194. 696.93 s [vector] span: OK
  4195. 696.93 s [vector] +++ OK, passed 100 tests.
  4196. 696.94 s [vector] break: OK
  4197. 696.94 s [vector] +++ OK, passed 100 tests.
  4198. 696.94 s [vector] spanR: OK
  4199. 696.94 s [vector] +++ OK, passed 100 tests.
  4200. 696.94 s [vector] breakR: OK
  4201. 696.94 s [vector] +++ OK, passed 100 tests.
  4202. 696.94 s [vector] groupBy: OK (0.01s)
  4203. 696.94 s [vector] +++ OK, passed 100 tests.
  4204. 696.94 s [vector] elem: OK
  4205. 696.94 s [vector] +++ OK, passed 100 tests.
  4206. 696.94 s [vector] notElem: OK
  4207. 696.94 s [vector] +++ OK, passed 100 tests.
  4208. 696.94 s [vector] find: OK
  4209. 696.94 s [vector] +++ OK, passed 100 tests.
  4210. 696.94 s [vector] findIndex: OK
  4211. 696.95 s [vector] +++ OK, passed 100 tests.
  4212. 696.95 s [vector] findIndexR: OK
  4213. 696.95 s [vector] +++ OK, passed 100 tests.
  4214. 696.95 s [vector] findIndices: OK
  4215. 696.95 s [vector] +++ OK, passed 100 tests.
  4216. 696.95 s [vector] elemIndex: OK
  4217. 696.95 s [vector] +++ OK, passed 100 tests.
  4218. 696.95 s [vector] elemIndices: OK
  4219. 696.95 s [vector] +++ OK, passed 100 tests.
  4220. 696.98 s [vector] foldl: OK (0.01s)
  4221. 696.98 s [vector] +++ OK, passed 100 tests.
  4222. 697.00 s [vector] foldl1: OK (0.01s)
  4223. 697.00 s [vector] +++ OK, passed 100 tests; 24 discarded.
  4224. 697.00 s [vector] foldl': OK (0.01s)
  4225. 697.02 s [vector] +++ OK, passed 100 tests.
  4226. 697.02 s [vector] foldl1': OK (0.01s)
  4227. 697.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4228. 697.03 s [vector] foldr: OK (0.01s)
  4229. 697.03 s [vector] +++ OK, passed 100 tests.
  4230. 697.04 s [vector] foldr1: OK (0.01s)
  4231. 697.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4232. 697.06 s [vector] foldr': OK (0.01s)
  4233. 697.06 s [vector] +++ OK, passed 100 tests.
  4234. 697.06 s [vector] foldr1': OK (0.01s)
  4235. 697.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4236. 697.08 s [vector] ifoldl: OK (0.01s)
  4237. 697.08 s [vector] +++ OK, passed 100 tests.
  4238. 697.10 s [vector] ifoldl': OK (0.02s)
  4239. 697.10 s [vector] +++ OK, passed 100 tests.
  4240. 697.12 s [vector] ifoldr: OK (0.02s)
  4241. 697.12 s [vector] +++ OK, passed 100 tests.
  4242. 697.12 s [vector] ifoldr': OK (0.02s)
  4243. 697.12 s [vector] +++ OK, passed 100 tests.
  4244. 697.14 s [vector] ifoldM: OK
  4245. 697.14 s [vector] +++ OK, passed 100 tests.
  4246. 697.16 s [vector] ifoldM': OK (0.01s)
  4247. 697.16 s [vector] +++ OK, passed 100 tests.
  4248. 697.20 s [vector] ifoldM_: OK (0.04s)
  4249. 697.20 s [vector] +++ OK, passed 100 tests.
  4250. 697.23 s [vector] ifoldM'_: OK (0.03s)
  4251. 697.23 s [vector] +++ OK, passed 100 tests.
  4252. 697.23 s [vector] all: OK
  4253. 697.23 s [vector] +++ OK, passed 100 tests.
  4254. 697.24 s [vector] any: OK
  4255. 697.24 s [vector] +++ OK, passed 100 tests.
  4256. 697.26 s [vector] prescanl: OK (0.02s)
  4257. 697.26 s [vector] +++ OK, passed 100 tests.
  4258. 697.28 s [vector] prescanl': OK (0.01s)
  4259. 697.28 s [vector] +++ OK, passed 100 tests.
  4260. 697.30 s [vector] postscanl: OK (0.02s)
  4261. 697.30 s [vector] +++ OK, passed 100 tests.
  4262. 697.32 s [vector] postscanl': OK (0.03s)
  4263. 697.32 s [vector] +++ OK, passed 100 tests.
  4264. 697.34 s [vector] scanl: OK (0.02s)
  4265. 697.34 s [vector] +++ OK, passed 100 tests.
  4266. 697.38 s [vector] scanl': OK (0.03s)
  4267. 697.38 s [vector] +++ OK, passed 100 tests.
  4268. 697.40 s [vector] scanl1: OK (0.02s)
  4269. 697.40 s [vector] +++ OK, passed 100 tests.
  4270. 697.41 s [vector] scanl1': OK (0.01s)
  4271. 697.41 s [vector] +++ OK, passed 100 tests.
  4272. 697.42 s [vector] iscanl: OK (0.01s)
  4273. 697.42 s [vector] +++ OK, passed 100 tests.
  4274. 697.43 s [vector] iscanl': OK (0.01s)
  4275. 697.43 s [vector] +++ OK, passed 100 tests.
  4276. 697.44 s [vector] prescanr: OK
  4277. 697.44 s [vector] +++ OK, passed 100 tests.
  4278. 697.46 s [vector] prescanr': OK (0.01s)
  4279. 697.46 s [vector] +++ OK, passed 100 tests.
  4280. 697.47 s [vector] postscanr: OK (0.01s)
  4281. 697.47 s [vector] +++ OK, passed 100 tests.
  4282. 697.48 s [vector] postscanr': OK (0.01s)
  4283. 697.48 s [vector] +++ OK, passed 100 tests.
  4284. 697.50 s [vector] scanr: OK (0.01s)
  4285. 697.50 s [vector] +++ OK, passed 100 tests.
  4286. 697.52 s [vector] scanr': OK (0.02s)
  4287. 697.52 s [vector] +++ OK, passed 100 tests.
  4288. 697.52 s [vector] scanr1: OK (0.01s)
  4289. 697.52 s [vector] +++ OK, passed 100 tests.
  4290. 697.54 s [vector] scanr1': OK (0.01s)
  4291. 697.54 s [vector] +++ OK, passed 100 tests.
  4292. 697.56 s [vector] iscanr: OK (0.01s)
  4293. 697.56 s [vector] +++ OK, passed 100 tests.
  4294. 697.56 s [vector] iscanr': OK (0.01s)
  4295. 697.56 s [vector] +++ OK, passed 100 tests.
  4296. 697.56 s [vector] mut_read: OK
  4297. 697.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4298. 697.56 s [vector] mut_write: OK
  4299. 697.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4300. 697.58 s [vector] mut_modify: OK
  4301. 697.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4302. 697.58 s [vector] mut_generate: OK
  4303. 697.58 s [vector] +++ OK, passed 100 tests.
  4304. 697.58 s [vector] mut_generateM: OK (0.02s)
  4305. 697.58 s [vector] +++ OK, passed 100 tests.
  4306. 697.62 s [vector] mut_mapM_: OK (0.02s)
  4307. 697.62 s [vector] +++ OK, passed 100 tests.
  4308. 697.68 s [vector] mut_imapM_: OK (0.04s)
  4309. 697.68 s [vector] +++ OK, passed 100 tests.
  4310. 697.72 s [vector] mut_forM_: OK (0.05s)
  4311. 697.72 s [vector] +++ OK, passed 100 tests.
  4312. 697.75 s [vector] mut_iforM_: OK (0.04s)
  4313. 697.75 s [vector] +++ OK, passed 100 tests.
  4314. 697.78 s [vector] mut_foldr: OK
  4315. 697.78 s [vector] +++ OK, passed 100 tests.
  4316. 697.78 s [vector] mut_foldr': OK (0.01s)
  4317. 697.78 s [vector] +++ OK, passed 100 tests.
  4318. 697.80 s [vector] mut_foldl: OK (0.01s)
  4319. 697.80 s [vector] +++ OK, passed 100 tests.
  4320. 697.80 s [vector] mut_foldl': OK (0.01s)
  4321. 697.80 s [vector] +++ OK, passed 100 tests.
  4322. 697.81 s [vector] mut_ifoldr: OK
  4323. 697.82 s [vector] +++ OK, passed 100 tests.
  4324. 697.84 s [vector] mut_ifoldr': OK (0.01s)
  4325. 697.84 s [vector] +++ OK, passed 100 tests.
  4326. 697.85 s [vector] mut_ifoldl: OK (0.01s)
  4327. 697.86 s [vector] +++ OK, passed 100 tests.
  4328. 697.86 s [vector] mut_ifoldl': OK (0.01s)
  4329. 697.86 s [vector] +++ OK, passed 100 tests.
  4330. 697.88 s [vector] mut_foldM: OK (0.01s)
  4331. 697.88 s [vector] +++ OK, passed 100 tests.
  4332. 697.90 s [vector] mut_foldM': OK (0.02s)
  4333. 697.90 s [vector] +++ OK, passed 100 tests.
  4334. 697.91 s [vector] mut_foldrM: OK (0.02s)
  4335. 697.92 s [vector] +++ OK, passed 100 tests.
  4336. 697.92 s [vector] mut_foldrM': OK (0.01s)
  4337. 697.92 s [vector] +++ OK, passed 100 tests.
  4338. 697.94 s [vector] mut_ifoldM: OK (0.02s)
  4339. 697.94 s [vector] +++ OK, passed 100 tests.
  4340. 697.95 s [vector] mut_ifoldM': OK (0.02s)
  4341. 697.95 s [vector] +++ OK, passed 100 tests.
  4342. 697.95 s [vector] mut_ifoldrM: OK (0.01s)
  4343. 697.95 s [vector] +++ OK, passed 100 tests.
  4344. 697.97 s [vector] mut_ifoldrM': OK (0.01s)
  4345. 697.97 s [vector] +++ OK, passed 100 tests.
  4346. 697.97 s [vector] compare: OK
  4347. 697.97 s [vector] +++ OK, passed 100 tests.
  4348. 697.97 s [vector] maximum: OK
  4349. 697.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4350. 697.98 s [vector] minimum: OK
  4351. 697.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4352. 697.98 s [vector] minIndex: OK
  4353. 697.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4354. 697.98 s [vector] maxIndex: OK
  4355. 697.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4356. 697.98 s [vector] maximumBy: OK
  4357. 697.98 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4358. 697.98 s [vector] minimumBy: OK
  4359. 697.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4360. 697.98 s [vector] maximumOn: OK
  4361. 697.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4362. 697.98 s [vector] minimumOn: OK
  4363. 697.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4364. 697.98 s [vector] maxIndexBy: OK
  4365. 697.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4366. 697.99 s [vector] minIndexBy: OK
  4367. 697.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4368. 697.99 s [vector] ListFirstMaxIndexWins: OK
  4369. 698.00 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4370. 698.00 s [vector] FalseListFirstMaxIndexWins: OK
  4371. 698.00 s [vector] +++ OK, failed as expected. (after 1 test):
  4372. 698.00 s [vector] Exception:
  4373. 698.00 s [vector] Prelude.foldr1: empty list
  4374. 698.00 s [vector] CallStack (from HasCallStack):
  4375. 698.00 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4376. 698.00 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4377. 698.00 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4378. 698.00 s [vector] []
  4379. 698.00 s [vector] mempty: OK
  4380. 698.00 s [vector] +++ OK, passed 100 tests.
  4381. 698.00 s [vector] mappend: OK
  4382. 698.00 s [vector] +++ OK, passed 100 tests.
  4383. 698.02 s [vector] mconcat: OK (0.03s)
  4384. 698.02 s [vector] +++ OK, passed 100 tests.
  4385. 698.02 s [vector] glength: OK
  4386. 698.02 s [vector] +++ OK, passed 100 tests.
  4387. 698.02 s [vector] sum: OK
  4388. 698.02 s [vector] +++ OK, passed 100 tests.
  4389. 698.02 s [vector] product: OK
  4390. 698.02 s [vector] +++ OK, passed 100 tests.
  4391. 698.02 s [vector] enumFromN: OK
  4392. 698.02 s [vector] +++ OK, passed 100 tests.
  4393. 698.02 s [vector] enumFromThenN: OK
  4394. 698.02 s [vector] +++ OK, passed 100 tests.
  4395. 698.03 s [vector] enumFromTo: OK
  4396. 698.03 s [vector] +++ OK, passed 100 tests.
  4397. 698.03 s [vector] enumFromThenTo: OK
  4398. 698.03 s [vector] +++ OK, passed 100 tests; 5 discarded.
  4399. 698.03 s [vector] unstream
  4400. 698.03 s [vector] unstream == vunstream (exact): OK
  4401. 698.03 s [vector] +++ OK, passed 100 tests.
  4402. 698.03 s [vector] unstream == vunstream (unknown): OK
  4403. 698.03 s [vector] +++ OK, passed 100 tests.
  4404. 698.03 s [vector] unstreamR ~= vunstream (exact): OK
  4405. 698.03 s [vector] +++ OK, passed 100 tests.
  4406. 698.03 s [vector] unstreamR ~= vunstream (unknown): OK
  4407. 698.03 s [vector] +++ OK, passed 100 tests.
  4408. 698.03 s [vector] Tests.Vector.Storable
  4409. 698.03 s [vector] Data.Vector.Storable.Vector (Int)
  4410. 698.03 s [vector] fromList.toList == id: OK
  4411. 698.03 s [vector] +++ OK, passed 100 tests.
  4412. 698.03 s [vector] toList.fromList == id: OK
  4413. 698.03 s [vector] +++ OK, passed 100 tests.
  4414. 698.03 s [vector] unstream.stream == id: OK
  4415. 698.03 s [vector] +++ OK, passed 100 tests.
  4416. 698.03 s [vector] stream.unstream == id: OK
  4417. 698.03 s [vector] +++ OK, passed 100 tests.
  4418. 698.03 s [vector] eq: OK
  4419. 698.03 s [vector] +++ OK, passed 100 tests.
  4420. 698.03 s [vector] length: OK
  4421. 698.03 s [vector] +++ OK, passed 100 tests.
  4422. 698.03 s [vector] null: OK
  4423. 698.03 s [vector] +++ OK, passed 100 tests.
  4424. 698.04 s [vector] index: OK
  4425. 698.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4426. 698.04 s [vector] safeIndex: OK
  4427. 698.04 s [vector] +++ OK, passed 100 tests.
  4428. 698.04 s [vector] head: OK
  4429. 698.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4430. 698.04 s [vector] last: OK
  4431. 698.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4432. 698.04 s [vector] unsafeIndex: OK
  4433. 698.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4434. 698.04 s [vector] unsafeHead: OK
  4435. 698.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4436. 698.04 s [vector] unsafeLast: OK
  4437. 698.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4438. 698.04 s [vector] slice: OK
  4439. 698.04 s [vector] +++ OK, passed 100 tests.
  4440. 698.04 s [vector] init: OK
  4441. 698.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4442. 698.04 s [vector] tail: OK
  4443. 698.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4444. 698.04 s [vector] take: OK
  4445. 698.04 s [vector] +++ OK, passed 100 tests.
  4446. 698.04 s [vector] drop: OK
  4447. 698.04 s [vector] +++ OK, passed 100 tests.
  4448. 698.06 s [vector] splitAt: OK
  4449. 698.06 s [vector] +++ OK, passed 100 tests.
  4450. 698.06 s [vector] empty: OK
  4451. 698.06 s [vector] +++ OK, passed 100 tests.
  4452. 698.06 s [vector] singleton: OK
  4453. 698.06 s [vector] +++ OK, passed 100 tests.
  4454. 698.06 s [vector] replicate: OK
  4455. 698.07 s [vector] +++ OK, passed 100 tests.
  4456. 698.07 s [vector] generate: OK
  4457. 698.07 s [vector] +++ OK, passed 100 tests.
  4458. 698.07 s [vector] iterateN: OK
  4459. 698.07 s [vector] +++ OK, passed 100 tests.
  4460. 698.12 s [vector] iterateNM: OK (0.06s)
  4461. 698.12 s [vector] +++ OK, passed 100 tests.
  4462. 698.12 s [vector] generateM: OK (0.01s)
  4463. 698.12 s [vector] +++ OK, passed 100 tests.
  4464. 698.12 s [vector] replicateM: OK
  4465. 698.12 s [vector] +++ OK, passed 100 tests.
  4466. 698.13 s [vector] create: OK
  4467. 698.13 s [vector] +++ OK, passed 100 tests.
  4468. 698.13 s [vector] createT: OK
  4469. 698.13 s [vector] +++ OK, passed 100 tests.
  4470. 698.13 s [vector] unfoldr: OK
  4471. 698.13 s [vector] +++ OK, passed 100 tests.
  4472. 698.13 s [vector] unfoldrN: OK
  4473. 698.13 s [vector] +++ OK, passed 100 tests.
  4474. 698.13 s [vector] unfoldrExactN: OK
  4475. 698.13 s [vector] +++ OK, passed 100 tests.
  4476. 698.13 s [vector] unfoldrM: OK
  4477. 698.13 s [vector] +++ OK, passed 100 tests.
  4478. 698.13 s [vector] unfoldrNM: OK
  4479. 698.14 s [vector] +++ OK, passed 100 tests.
  4480. 698.18 s [vector] unfoldrExactNM: OK (0.05s)
  4481. 698.18 s [vector] +++ OK, passed 100 tests.
  4482. 698.18 s [vector] constructN: OK
  4483. 698.18 s [vector] +++ OK, passed 100 tests.
  4484. 698.19 s [vector] constructrN: OK
  4485. 698.19 s [vector] +++ OK, passed 100 tests.
  4486. 698.20 s [vector] cons: OK
  4487. 698.20 s [vector] +++ OK, passed 100 tests.
  4488. 698.20 s [vector] snoc: OK
  4489. 698.20 s [vector] +++ OK, passed 100 tests.
  4490. 698.20 s [vector] append: OK
  4491. 698.20 s [vector] +++ OK, passed 100 tests.
  4492. 698.21 s [vector] concat: OK (0.02s)
  4493. 698.21 s [vector] +++ OK, passed 100 tests.
  4494. 698.21 s [vector] force: OK
  4495. 698.21 s [vector] +++ OK, passed 100 tests.
  4496. 698.21 s [vector] upd: OK
  4497. 698.21 s [vector] +++ OK, passed 100 tests.
  4498. 698.22 s [vector] accum: OK
  4499. 698.22 s [vector] +++ OK, passed 100 tests.
  4500. 698.22 s [vector] reverse: OK
  4501. 698.22 s [vector] +++ OK, passed 100 tests.
  4502. 698.22 s [vector] backpermute: OK
  4503. 698.22 s [vector] +++ OK, passed 100 tests.
  4504. 698.23 s [vector] map: OK
  4505. 698.23 s [vector] +++ OK, passed 100 tests.
  4506. 698.24 s [vector] imap: OK
  4507. 698.24 s [vector] +++ OK, passed 100 tests.
  4508. 698.24 s [vector] concatMap: OK
  4509. 698.24 s [vector] +++ OK, passed 100 tests.
  4510. 698.24 s [vector] mapM: OK
  4511. 698.24 s [vector] +++ OK, passed 100 tests.
  4512. 698.26 s [vector] mapM_: OK (0.02s)
  4513. 698.26 s [vector] +++ OK, passed 100 tests.
  4514. 698.26 s [vector] forM: OK
  4515. 698.26 s [vector] +++ OK, passed 100 tests.
  4516. 698.28 s [vector] forM_: OK (0.02s)
  4517. 698.30 s [vector] +++ OK, passed 100 tests.
  4518. 698.30 s [vector] imapM: OK
  4519. 698.30 s [vector] +++ OK, passed 100 tests.
  4520. 698.31 s [vector] imapM_: OK (0.02s)
  4521. 698.31 s [vector] +++ OK, passed 100 tests.
  4522. 698.31 s [vector] zipWith: OK
  4523. 698.31 s [vector] +++ OK, passed 100 tests.
  4524. 698.31 s [vector] zipWith3: OK
  4525. 698.31 s [vector] +++ OK, passed 100 tests.
  4526. 698.31 s [vector] izipWith: OK
  4527. 698.31 s [vector] +++ OK, passed 100 tests.
  4528. 698.31 s [vector] izipWith3: OK
  4529. 698.32 s [vector] +++ OK, passed 100 tests.
  4530. 698.34 s [vector] izipWithM: OK
  4531. 698.34 s [vector] +++ OK, passed 100 tests.
  4532. 698.34 s [vector] izipWithM_: OK (0.02s)
  4533. 698.34 s [vector] +++ OK, passed 100 tests.
  4534. 698.35 s [vector] zipWithM: OK
  4535. 698.35 s [vector] +++ OK, passed 100 tests.
  4536. 698.36 s [vector] zipWithM_: OK (0.01s)
  4537. 698.36 s [vector] +++ OK, passed 100 tests.
  4538. 698.36 s [vector] filter: OK
  4539. 698.36 s [vector] +++ OK, passed 100 tests.
  4540. 698.38 s [vector] ifilter: OK
  4541. 698.38 s [vector] +++ OK, passed 100 tests.
  4542. 698.38 s [vector] filterM: OK (0.02s)
  4543. 698.38 s [vector] +++ OK, passed 100 tests.
  4544. 698.38 s [vector] uniq: OK
  4545. 698.38 s [vector] +++ OK, passed 100 tests.
  4546. 698.39 s [vector] mapMaybe: OK
  4547. 698.39 s [vector] +++ OK, passed 100 tests.
  4548. 698.39 s [vector] imapMaybe: OK
  4549. 698.39 s [vector] +++ OK, passed 100 tests.
  4550. 698.40 s [vector] takeWhile: OK
  4551. 698.40 s [vector] +++ OK, passed 100 tests.
  4552. 698.40 s [vector] dropWhile: OK
  4553. 698.40 s [vector] +++ OK, passed 100 tests.
  4554. 698.40 s [vector] partition: OK
  4555. 698.40 s [vector] +++ OK, passed 100 tests.
  4556. 698.40 s [vector] partitionWith: OK
  4557. 698.40 s [vector] +++ OK, passed 100 tests.
  4558. 698.40 s [vector] span: OK
  4559. 698.41 s [vector] +++ OK, passed 100 tests.
  4560. 698.41 s [vector] break: OK
  4561. 698.41 s [vector] +++ OK, passed 100 tests.
  4562. 698.41 s [vector] spanR: OK
  4563. 698.41 s [vector] +++ OK, passed 100 tests.
  4564. 698.41 s [vector] breakR: OK
  4565. 698.41 s [vector] +++ OK, passed 100 tests.
  4566. 698.41 s [vector] groupBy: OK
  4567. 698.41 s [vector] +++ OK, passed 100 tests.
  4568. 698.41 s [vector] elem: OK
  4569. 698.41 s [vector] +++ OK, passed 100 tests.
  4570. 698.41 s [vector] notElem: OK
  4571. 698.41 s [vector] +++ OK, passed 100 tests.
  4572. 698.41 s [vector] find: OK
  4573. 698.41 s [vector] +++ OK, passed 100 tests.
  4574. 698.41 s [vector] findIndex: OK
  4575. 698.41 s [vector] +++ OK, passed 100 tests.
  4576. 698.41 s [vector] findIndexR: OK
  4577. 698.42 s [vector] +++ OK, passed 100 tests.
  4578. 698.42 s [vector] findIndices: OK
  4579. 698.42 s [vector] +++ OK, passed 100 tests.
  4580. 698.42 s [vector] elemIndex: OK
  4581. 698.42 s [vector] +++ OK, passed 100 tests.
  4582. 698.42 s [vector] elemIndices: OK
  4583. 698.42 s [vector] +++ OK, passed 100 tests.
  4584. 698.42 s [vector] foldl: OK
  4585. 698.42 s [vector] +++ OK, passed 100 tests.
  4586. 698.42 s [vector] foldl1: OK
  4587. 698.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4588. 698.42 s [vector] foldl': OK
  4589. 698.43 s [vector] +++ OK, passed 100 tests.
  4590. 698.43 s [vector] foldl1': OK
  4591. 698.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4592. 698.44 s [vector] foldr: OK
  4593. 698.44 s [vector] +++ OK, passed 100 tests.
  4594. 698.44 s [vector] foldr1: OK
  4595. 698.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4596. 698.44 s [vector] foldr': OK
  4597. 698.44 s [vector] +++ OK, passed 100 tests.
  4598. 698.44 s [vector] foldr1': OK
  4599. 698.44 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4600. 698.44 s [vector] ifoldl: OK
  4601. 698.44 s [vector] +++ OK, passed 100 tests.
  4602. 698.44 s [vector] ifoldl': OK
  4603. 698.44 s [vector] +++ OK, passed 100 tests.
  4604. 698.44 s [vector] ifoldr: OK
  4605. 698.45 s [vector] +++ OK, passed 100 tests.
  4606. 698.45 s [vector] ifoldr': OK
  4607. 698.45 s [vector] +++ OK, passed 100 tests.
  4608. 698.45 s [vector] ifoldM: OK
  4609. 698.45 s [vector] +++ OK, passed 100 tests.
  4610. 698.46 s [vector] ifoldM': OK
  4611. 698.46 s [vector] +++ OK, passed 100 tests.
  4612. 698.48 s [vector] ifoldM_: OK (0.02s)
  4613. 698.48 s [vector] +++ OK, passed 100 tests.
  4614. 698.50 s [vector] ifoldM'_: OK (0.02s)
  4615. 698.50 s [vector] +++ OK, passed 100 tests.
  4616. 698.50 s [vector] all: OK
  4617. 698.50 s [vector] +++ OK, passed 100 tests.
  4618. 698.50 s [vector] any: OK
  4619. 698.50 s [vector] +++ OK, passed 100 tests.
  4620. 698.50 s [vector] prescanl: OK
  4621. 698.50 s [vector] +++ OK, passed 100 tests.
  4622. 698.50 s [vector] prescanl': OK
  4623. 698.50 s [vector] +++ OK, passed 100 tests.
  4624. 698.50 s [vector] postscanl: OK
  4625. 698.51 s [vector] +++ OK, passed 100 tests.
  4626. 698.51 s [vector] postscanl': OK
  4627. 698.51 s [vector] +++ OK, passed 100 tests.
  4628. 698.51 s [vector] scanl: OK
  4629. 698.51 s [vector] +++ OK, passed 100 tests.
  4630. 698.51 s [vector] scanl': OK
  4631. 698.52 s [vector] +++ OK, passed 100 tests.
  4632. 698.52 s [vector] scanl1: OK
  4633. 698.52 s [vector] +++ OK, passed 100 tests.
  4634. 698.53 s [vector] scanl1': OK
  4635. 698.53 s [vector] +++ OK, passed 100 tests.
  4636. 698.53 s [vector] iscanl: OK
  4637. 698.53 s [vector] +++ OK, passed 100 tests.
  4638. 698.54 s [vector] iscanl': OK
  4639. 698.54 s [vector] +++ OK, passed 100 tests.
  4640. 698.54 s [vector] prescanr: OK
  4641. 698.55 s [vector] +++ OK, passed 100 tests.
  4642. 698.55 s [vector] prescanr': OK
  4643. 698.55 s [vector] +++ OK, passed 100 tests.
  4644. 698.56 s [vector] postscanr: OK
  4645. 698.56 s [vector] +++ OK, passed 100 tests.
  4646. 698.56 s [vector] postscanr': OK
  4647. 698.56 s [vector] +++ OK, passed 100 tests.
  4648. 698.56 s [vector] scanr: OK
  4649. 698.56 s [vector] +++ OK, passed 100 tests.
  4650. 698.56 s [vector] scanr': OK
  4651. 698.56 s [vector] +++ OK, passed 100 tests.
  4652. 698.56 s [vector] scanr1: OK
  4653. 698.56 s [vector] +++ OK, passed 100 tests.
  4654. 698.56 s [vector] scanr1': OK
  4655. 698.56 s [vector] +++ OK, passed 100 tests.
  4656. 698.57 s [vector] iscanr: OK
  4657. 698.57 s [vector] +++ OK, passed 100 tests.
  4658. 698.57 s [vector] iscanr': OK
  4659. 698.57 s [vector] +++ OK, passed 100 tests.
  4660. 698.58 s [vector] mut_read: OK
  4661. 698.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4662. 698.58 s [vector] mut_write: OK
  4663. 698.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4664. 698.58 s [vector] mut_modify: OK
  4665. 698.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4666. 698.58 s [vector] mut_generate: OK
  4667. 698.58 s [vector] +++ OK, passed 100 tests.
  4668. 698.60 s [vector] mut_generateM: OK (0.02s)
  4669. 698.60 s [vector] +++ OK, passed 100 tests.
  4670. 698.60 s [vector] mut_mapM_: OK (0.02s)
  4671. 698.60 s [vector] +++ OK, passed 100 tests.
  4672. 698.64 s [vector] mut_imapM_: OK (0.01s)
  4673. 698.64 s [vector] +++ OK, passed 100 tests.
  4674. 698.66 s [vector] mut_forM_: OK (0.02s)
  4675. 698.66 s [vector] +++ OK, passed 100 tests.
  4676. 698.67 s [vector] mut_iforM_: OK (0.02s)
  4677. 698.67 s [vector] +++ OK, passed 100 tests.
  4678. 698.67 s [vector] mut_foldr: OK
  4679. 698.67 s [vector] +++ OK, passed 100 tests.
  4680. 698.67 s [vector] mut_foldr': OK
  4681. 698.67 s [vector] +++ OK, passed 100 tests.
  4682. 698.68 s [vector] mut_foldl: OK
  4683. 698.68 s [vector] +++ OK, passed 100 tests.
  4684. 698.69 s [vector] mut_foldl': OK
  4685. 698.69 s [vector] +++ OK, passed 100 tests.
  4686. 698.69 s [vector] mut_ifoldr: OK
  4687. 698.69 s [vector] +++ OK, passed 100 tests.
  4688. 698.69 s [vector] mut_ifoldr': OK
  4689. 698.69 s [vector] +++ OK, passed 100 tests.
  4690. 698.69 s [vector] mut_ifoldl: OK
  4691. 698.69 s [vector] +++ OK, passed 100 tests.
  4692. 698.69 s [vector] mut_ifoldl': OK
  4693. 698.69 s [vector] +++ OK, passed 100 tests.
  4694. 698.69 s [vector] mut_foldM: OK
  4695. 698.69 s [vector] +++ OK, passed 100 tests.
  4696. 698.69 s [vector] mut_foldM': OK
  4697. 698.69 s [vector] +++ OK, passed 100 tests.
  4698. 698.70 s [vector] mut_foldrM: OK
  4699. 698.70 s [vector] +++ OK, passed 100 tests.
  4700. 698.71 s [vector] mut_foldrM': OK
  4701. 698.71 s [vector] +++ OK, passed 100 tests.
  4702. 698.72 s [vector] mut_ifoldM: OK
  4703. 698.72 s [vector] +++ OK, passed 100 tests.
  4704. 698.72 s [vector] mut_ifoldM': OK
  4705. 698.72 s [vector] +++ OK, passed 100 tests.
  4706. 698.72 s [vector] mut_ifoldrM: OK
  4707. 698.72 s [vector] +++ OK, passed 100 tests.
  4708. 698.72 s [vector] mut_ifoldrM': OK
  4709. 698.72 s [vector] +++ OK, passed 100 tests.
  4710. 698.72 s [vector] compare: OK
  4711. 698.72 s [vector] +++ OK, passed 100 tests.
  4712. 698.72 s [vector] maximum: OK
  4713. 698.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4714. 698.72 s [vector] minimum: OK
  4715. 698.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4716. 698.72 s [vector] minIndex: OK
  4717. 698.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4718. 698.73 s [vector] maxIndex: OK
  4719. 698.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4720. 698.73 s [vector] maximumBy: OK
  4721. 698.73 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4722. 698.73 s [vector] minimumBy: OK
  4723. 698.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4724. 698.73 s [vector] maximumOn: OK
  4725. 698.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4726. 698.73 s [vector] minimumOn: OK
  4727. 698.73 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4728. 698.73 s [vector] maxIndexBy: OK
  4729. 698.73 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4730. 698.73 s [vector] minIndexBy: OK
  4731. 698.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4732. 698.73 s [vector] ListFirstMaxIndexWins: OK
  4733. 698.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4734. 698.73 s [vector] FalseListFirstMaxIndexWins: OK
  4735. 698.73 s [vector] +++ OK, failed as expected. (after 1 test):
  4736. 698.73 s [vector] Exception:
  4737. 698.73 s [vector] Prelude.foldr1: empty list
  4738. 698.73 s [vector] CallStack (from HasCallStack):
  4739. 698.73 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4740. 698.73 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4741. 698.74 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4742. 698.74 s [vector] []
  4743. 698.74 s [vector] mempty: OK
  4744. 698.74 s [vector] +++ OK, passed 100 tests.
  4745. 698.74 s [vector] mappend: OK
  4746. 698.74 s [vector] +++ OK, passed 100 tests.
  4747. 698.75 s [vector] mconcat: OK (0.01s)
  4748. 698.75 s [vector] +++ OK, passed 100 tests.
  4749. 698.75 s [vector] glength: OK
  4750. 698.75 s [vector] +++ OK, passed 100 tests.
  4751. 698.75 s [vector] sum: OK
  4752. 698.75 s [vector] +++ OK, passed 100 tests.
  4753. 698.75 s [vector] product: OK
  4754. 698.75 s [vector] +++ OK, passed 100 tests.
  4755. 698.75 s [vector] enumFromN: OK
  4756. 698.75 s [vector] +++ OK, passed 100 tests.
  4757. 698.75 s [vector] enumFromThenN: OK
  4758. 698.75 s [vector] +++ OK, passed 100 tests.
  4759. 698.75 s [vector] enumFromTo: OK
  4760. 698.75 s [vector] +++ OK, passed 100 tests.
  4761. 698.75 s [vector] enumFromThenTo: OK
  4762. 698.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4763. 698.75 s [vector] Data.Vector.Storable.Vector (Double)
  4764. 698.75 s [vector] fromList.toList == id: OK
  4765. 698.75 s [vector] +++ OK, passed 100 tests.
  4766. 698.76 s [vector] toList.fromList == id: OK
  4767. 698.76 s [vector] +++ OK, passed 100 tests.
  4768. 698.76 s [vector] unstream.stream == id: OK
  4769. 698.76 s [vector] +++ OK, passed 100 tests.
  4770. 698.76 s [vector] stream.unstream == id: OK
  4771. 698.76 s [vector] +++ OK, passed 100 tests.
  4772. 698.76 s [vector] eq: OK
  4773. 698.76 s [vector] +++ OK, passed 100 tests.
  4774. 698.76 s [vector] length: OK
  4775. 698.76 s [vector] +++ OK, passed 100 tests.
  4776. 698.76 s [vector] null: OK
  4777. 698.76 s [vector] +++ OK, passed 100 tests.
  4778. 698.76 s [vector] index: OK
  4779. 698.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4780. 698.76 s [vector] safeIndex: OK
  4781. 698.76 s [vector] +++ OK, passed 100 tests.
  4782. 698.76 s [vector] head: OK
  4783. 698.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4784. 698.76 s [vector] last: OK
  4785. 698.76 s [vector] +++ OK, passed 100 tests; 24 discarded.
  4786. 698.76 s [vector] unsafeIndex: OK
  4787. 698.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4788. 698.76 s [vector] unsafeHead: OK
  4789. 698.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4790. 698.76 s [vector] unsafeLast: OK
  4791. 698.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4792. 698.76 s [vector] slice: OK
  4793. 698.76 s [vector] +++ OK, passed 100 tests.
  4794. 698.77 s [vector] init: OK
  4795. 698.77 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4796. 698.77 s [vector] tail: OK
  4797. 698.77 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4798. 698.77 s [vector] take: OK
  4799. 698.77 s [vector] +++ OK, passed 100 tests.
  4800. 698.77 s [vector] drop: OK
  4801. 698.77 s [vector] +++ OK, passed 100 tests.
  4802. 698.77 s [vector] splitAt: OK
  4803. 698.77 s [vector] +++ OK, passed 100 tests.
  4804. 698.77 s [vector] empty: OK
  4805. 698.77 s [vector] +++ OK, passed 100 tests.
  4806. 698.77 s [vector] singleton: OK
  4807. 698.77 s [vector] +++ OK, passed 100 tests.
  4808. 698.77 s [vector] replicate: OK
  4809. 698.77 s [vector] +++ OK, passed 100 tests.
  4810. 698.77 s [vector] generate: OK
  4811. 698.78 s [vector] +++ OK, passed 100 tests.
  4812. 698.78 s [vector] iterateN: OK
  4813. 698.78 s [vector] +++ OK, passed 100 tests.
  4814. 698.82 s [vector] iterateNM: OK (0.04s)
  4815. 698.82 s [vector] +++ OK, passed 100 tests.
  4816. 698.86 s [vector] generateM: OK (0.03s)
  4817. 698.86 s [vector] +++ OK, passed 100 tests.
  4818. 698.87 s [vector] replicateM: OK (0.02s)
  4819. 698.87 s [vector] +++ OK, passed 100 tests.
  4820. 698.87 s [vector] create: OK
  4821. 698.87 s [vector] +++ OK, passed 100 tests.
  4822. 698.87 s [vector] createT: OK
  4823. 698.88 s [vector] +++ OK, passed 100 tests.
  4824. 698.88 s [vector] unfoldr: OK
  4825. 698.88 s [vector] +++ OK, passed 100 tests.
  4826. 698.88 s [vector] unfoldrN: OK
  4827. 698.88 s [vector] +++ OK, passed 100 tests.
  4828. 698.88 s [vector] unfoldrExactN: OK
  4829. 698.88 s [vector] +++ OK, passed 100 tests.
  4830. 698.88 s [vector] unfoldrM: OK
  4831. 698.88 s [vector] +++ OK, passed 100 tests.
  4832. 698.88 s [vector] unfoldrNM: OK
  4833. 698.88 s [vector] +++ OK, passed 100 tests.
  4834. 698.92 s [vector] unfoldrExactNM: OK (0.03s)
  4835. 698.92 s [vector] +++ OK, passed 100 tests.
  4836. 698.93 s [vector] constructN: OK (0.01s)
  4837. 698.93 s [vector] +++ OK, passed 100 tests.
  4838. 698.94 s [vector] constructrN: OK (0.01s)
  4839. 698.94 s [vector] +++ OK, passed 100 tests.
  4840. 698.94 s [vector] cons: OK
  4841. 698.94 s [vector] +++ OK, passed 100 tests.
  4842. 698.94 s [vector] snoc: OK
  4843. 698.94 s [vector] +++ OK, passed 100 tests.
  4844. 698.96 s [vector] append: OK
  4845. 698.96 s [vector] +++ OK, passed 100 tests.
  4846. 698.96 s [vector] concat: OK (0.02s)
  4847. 698.96 s [vector] +++ OK, passed 100 tests.
  4848. 698.96 s [vector] force: OK
  4849. 698.96 s [vector] +++ OK, passed 100 tests.
  4850. 698.96 s [vector] upd: OK
  4851. 698.96 s [vector] +++ OK, passed 100 tests.
  4852. 698.98 s [vector] accum: OK
  4853. 698.98 s [vector] +++ OK, passed 100 tests.
  4854. 698.98 s [vector] reverse: OK
  4855. 698.98 s [vector] +++ OK, passed 100 tests.
  4856. 698.99 s [vector] backpermute: OK
  4857. 698.99 s [vector] +++ OK, passed 100 tests.
  4858. 698.99 s [vector] map: OK
  4859. 698.99 s [vector] +++ OK, passed 100 tests.
  4860. 699.00 s [vector] imap: OK
  4861. 699.00 s [vector] +++ OK, passed 100 tests.
  4862. 699.01 s [vector] concatMap: OK
  4863. 699.02 s [vector] +++ OK, passed 100 tests.
  4864. 699.02 s [vector] mapM: OK
  4865. 699.02 s [vector] +++ OK, passed 100 tests.
  4866. 699.05 s [vector] mapM_: OK (0.03s)
  4867. 699.05 s [vector] +++ OK, passed 100 tests.
  4868. 699.05 s [vector] forM: OK
  4869. 699.06 s [vector] +++ OK, passed 100 tests.
  4870. 699.10 s [vector] forM_: OK (0.04s)
  4871. 699.10 s [vector] +++ OK, passed 100 tests.
  4872. 699.10 s [vector] imapM: OK
  4873. 699.10 s [vector] +++ OK, passed 100 tests.
  4874. 699.14 s [vector] imapM_: OK (0.04s)
  4875. 699.14 s [vector] +++ OK, passed 100 tests.
  4876. 699.16 s [vector] zipWith: OK
  4877. 699.16 s [vector] +++ OK, passed 100 tests.
  4878. 699.16 s [vector] zipWith3: OK
  4879. 699.16 s [vector] +++ OK, passed 100 tests.
  4880. 699.18 s [vector] izipWith: OK (0.01s)
  4881. 699.18 s [vector] +++ OK, passed 100 tests.
  4882. 699.18 s [vector] izipWith3: OK (0.01s)
  4883. 699.18 s [vector] +++ OK, passed 100 tests.
  4884. 699.20 s [vector] izipWithM: OK (0.01s)
  4885. 699.20 s [vector] +++ OK, passed 100 tests.
  4886. 699.26 s [vector] izipWithM_: OK (0.06s)
  4887. 699.26 s [vector] +++ OK, passed 100 tests.
  4888. 699.28 s [vector] zipWithM: OK (0.02s)
  4889. 699.28 s [vector] +++ OK, passed 100 tests.
  4890. 699.30 s [vector] zipWithM_: OK (0.04s)
  4891. 699.30 s [vector] +++ OK, passed 100 tests.
  4892. 699.32 s [vector] filter: OK
  4893. 699.32 s [vector] +++ OK, passed 100 tests.
  4894. 699.34 s [vector] ifilter: OK (0.01s)
  4895. 699.34 s [vector] +++ OK, passed 100 tests.
  4896. 699.39 s [vector] filterM: OK (0.06s)
  4897. 699.40 s [vector] +++ OK, passed 100 tests.
  4898. 699.40 s [vector] uniq: OK
  4899. 699.40 s [vector] +++ OK, passed 100 tests.
  4900. 699.42 s [vector] mapMaybe: OK (0.01s)
  4901. 699.42 s [vector] +++ OK, passed 100 tests.
  4902. 699.42 s [vector] imapMaybe: OK (0.02s)
  4903. 699.42 s [vector] +++ OK, passed 100 tests.
  4904. 699.43 s [vector] takeWhile: OK
  4905. 699.43 s [vector] +++ OK, passed 100 tests.
  4906. 699.44 s [vector] dropWhile: OK
  4907. 699.44 s [vector] +++ OK, passed 100 tests.
  4908. 699.46 s [vector] partition: OK (0.01s)
  4909. 699.46 s [vector] +++ OK, passed 100 tests.
  4910. 699.46 s [vector] partitionWith: OK (0.01s)
  4911. 699.46 s [vector] +++ OK, passed 100 tests.
  4912. 699.46 s [vector] span: OK
  4913. 699.46 s [vector] +++ OK, passed 100 tests.
  4914. 699.46 s [vector] break: OK
  4915. 699.46 s [vector] +++ OK, passed 100 tests.
  4916. 699.47 s [vector] spanR: OK
  4917. 699.47 s [vector] +++ OK, passed 100 tests.
  4918. 699.48 s [vector] breakR: OK
  4919. 699.48 s [vector] +++ OK, passed 100 tests.
  4920. 699.48 s [vector] groupBy: OK (0.02s)
  4921. 699.48 s [vector] +++ OK, passed 100 tests.
  4922. 699.48 s [vector] elem: OK
  4923. 699.48 s [vector] +++ OK, passed 100 tests.
  4924. 699.49 s [vector] notElem: OK
  4925. 699.49 s [vector] +++ OK, passed 100 tests.
  4926. 699.49 s [vector] find: OK
  4927. 699.49 s [vector] +++ OK, passed 100 tests.
  4928. 699.49 s [vector] findIndex: OK
  4929. 699.49 s [vector] +++ OK, passed 100 tests.
  4930. 699.49 s [vector] findIndexR: OK
  4931. 699.50 s [vector] +++ OK, passed 100 tests.
  4932. 699.50 s [vector] findIndices: OK
  4933. 699.50 s [vector] +++ OK, passed 100 tests.
  4934. 699.50 s [vector] elemIndex: OK
  4935. 699.50 s [vector] +++ OK, passed 100 tests.
  4936. 699.50 s [vector] elemIndices: OK
  4937. 699.50 s [vector] +++ OK, passed 100 tests.
  4938. 699.52 s [vector] foldl: OK
  4939. 699.52 s [vector] +++ OK, passed 100 tests.
  4940. 699.54 s [vector] foldl1: OK
  4941. 699.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4942. 699.56 s [vector] foldl': OK (0.01s)
  4943. 699.56 s [vector] +++ OK, passed 100 tests.
  4944. 699.56 s [vector] foldl1': OK (0.01s)
  4945. 699.56 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4946. 699.59 s [vector] foldr: OK
  4947. 699.59 s [vector] +++ OK, passed 100 tests.
  4948. 699.60 s [vector] foldr1: OK (0.01s)
  4949. 699.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4950. 699.60 s [vector] foldr': OK (0.01s)
  4951. 699.60 s [vector] +++ OK, passed 100 tests.
  4952. 699.62 s [vector] foldr1': OK
  4953. 699.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4954. 699.63 s [vector] ifoldl: OK (0.01s)
  4955. 699.63 s [vector] +++ OK, passed 100 tests.
  4956. 699.64 s [vector] ifoldl': OK (0.01s)
  4957. 699.64 s [vector] +++ OK, passed 100 tests.
  4958. 699.66 s [vector] ifoldr: OK (0.01s)
  4959. 699.66 s [vector] +++ OK, passed 100 tests.
  4960. 699.66 s [vector] ifoldr': OK (0.01s)
  4961. 699.66 s [vector] +++ OK, passed 100 tests.
  4962. 699.68 s [vector] ifoldM: OK (0.01s)
  4963. 699.68 s [vector] +++ OK, passed 100 tests.
  4964. 699.70 s [vector] ifoldM': OK (0.01s)
  4965. 699.70 s [vector] +++ OK, passed 100 tests.
  4966. 699.72 s [vector] ifoldM_: OK (0.03s)
  4967. 699.72 s [vector] +++ OK, passed 100 tests.
  4968. 699.76 s [vector] ifoldM'_: OK (0.04s)
  4969. 699.76 s [vector] +++ OK, passed 100 tests.
  4970. 699.78 s [vector] all: OK
  4971. 699.78 s [vector] +++ OK, passed 100 tests.
  4972. 699.78 s [vector] any: OK
  4973. 699.79 s [vector] +++ OK, passed 100 tests.
  4974. 699.80 s [vector] prescanl: OK (0.01s)
  4975. 699.80 s [vector] +++ OK, passed 100 tests.
  4976. 699.82 s [vector] prescanl': OK (0.01s)
  4977. 699.82 s [vector] +++ OK, passed 100 tests.
  4978. 699.83 s [vector] postscanl: OK (0.01s)
  4979. 699.84 s [vector] +++ OK, passed 100 tests.
  4980. 699.84 s [vector] postscanl': OK (0.01s)
  4981. 699.84 s [vector] +++ OK, passed 100 tests.
  4982. 699.86 s [vector] scanl: OK (0.01s)
  4983. 699.86 s [vector] +++ OK, passed 100 tests.
  4984. 699.86 s [vector] scanl': OK (0.01s)
  4985. 699.87 s [vector] +++ OK, passed 100 tests.
  4986. 699.88 s [vector] scanl1: OK (0.01s)
  4987. 699.88 s [vector] +++ OK, passed 100 tests.
  4988. 699.90 s [vector] scanl1': OK (0.01s)
  4989. 699.90 s [vector] +++ OK, passed 100 tests.
  4990. 699.90 s [vector] iscanl: OK (0.01s)
  4991. 699.90 s [vector] +++ OK, passed 100 tests.
  4992. 699.90 s [vector] iscanl': OK (0.01s)
  4993. 699.90 s [vector] +++ OK, passed 100 tests.
  4994. 699.90 s [vector] prescanr: OK (0.01s)
  4995. 699.90 s [vector] +++ OK, passed 100 tests.
  4996. 699.92 s [vector] prescanr': OK (0.02s)
  4997. 699.92 s [vector] +++ OK, passed 100 tests.
  4998. 699.94 s [vector] postscanr: OK (0.01s)
  4999. 699.94 s [vector] +++ OK, passed 100 tests.
  5000. 699.95 s [vector] postscanr': OK (0.01s)
  5001. 699.96 s [vector] +++ OK, passed 100 tests.
  5002. 699.96 s [vector] scanr: OK (0.01s)
  5003. 699.96 s [vector] +++ OK, passed 100 tests.
  5004. 699.98 s [vector] scanr': OK (0.01s)
  5005. 699.98 s [vector] +++ OK, passed 100 tests.
  5006. 699.99 s [vector] scanr1: OK (0.01s)
  5007. 700.00 s [vector] +++ OK, passed 100 tests.
  5008. 700.00 s [vector] scanr1': OK (0.01s)
  5009. 700.00 s [vector] +++ OK, passed 100 tests.
  5010. 700.02 s [vector] iscanr: OK (0.02s)
  5011. 700.26 s [vector] +++ OK, passed 100 tests.
  5012. 700.26 s [vector] iscanr': OK (0.01s)
  5013. 700.26 s [vector] +++ OK, passed 100 tests.
  5014. 700.26 s [vector] mut_read: OK
  5015. 700.26 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5016. 700.26 s [vector] mut_write: OK
  5017. 700.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5018. 700.26 s [vector] mut_modify: OK
  5019. 700.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5020. 700.26 s [vector] mut_generate: OK
  5021. 700.26 s [vector] +++ OK, passed 100 tests.
  5022. 700.26 s [vector] mut_generateM: OK (0.02s)
  5023. 700.26 s [vector] +++ OK, passed 100 tests.
  5024. 700.26 s [vector] mut_mapM_: OK (0.04s)
  5025. 700.26 s [vector] +++ OK, passed 100 tests.
  5026. 700.26 s [vector] mut_imapM_: OK (0.04s)
  5027. 700.26 s [vector] +++ OK, passed 100 tests.
  5028. 700.26 s [vector] mut_forM_: OK (0.04s)
  5029. 700.26 s [vector] +++ OK, passed 100 tests.
  5030. 700.26 s [vector] mut_iforM_: OK (0.02s)
  5031. 700.26 s [vector] +++ OK, passed 100 tests.
  5032. 700.26 s [vector] mut_foldr: OK (0.01s)
  5033. 700.26 s [vector] +++ OK, passed 100 tests.
  5034. 700.26 s [vector] mut_foldr': OK (0.01s)
  5035. 700.26 s [vector] +++ OK, passed 100 tests.
  5036. 700.26 s [vector] mut_foldl: OK (0.01s)
  5037. 700.26 s [vector] +++ OK, passed 100 tests.
  5038. 700.26 s [vector] mut_foldl': OK (0.01s)
  5039. 700.26 s [vector] +++ OK, passed 100 tests.
  5040. 700.27 s [vector] mut_ifoldr: OK (0.01s)
  5041. 700.28 s [vector] +++ OK, passed 100 tests.
  5042. 700.28 s [vector] mut_ifoldr': OK (0.01s)
  5043. 700.29 s [vector] +++ OK, passed 100 tests.
  5044. 700.30 s [vector] mut_ifoldl: OK (0.01s)
  5045. 700.30 s [vector] +++ OK, passed 100 tests.
  5046. 700.31 s [vector] mut_ifoldl': OK (0.01s)
  5047. 700.32 s [vector] +++ OK, passed 100 tests.
  5048. 700.32 s [vector] mut_foldM: OK (0.01s)
  5049. 700.32 s [vector] +++ OK, passed 100 tests.
  5050. 700.34 s [vector] mut_foldM': OK (0.02s)
  5051. 700.34 s [vector] +++ OK, passed 100 tests.
  5052. 700.35 s [vector] mut_foldrM: OK (0.01s)
  5053. 700.36 s [vector] +++ OK, passed 100 tests.
  5054. 700.36 s [vector] mut_foldrM': OK (0.01s)
  5055. 700.36 s [vector] +++ OK, passed 100 tests.
  5056. 700.38 s [vector] mut_ifoldM: OK (0.01s)
  5057. 700.38 s [vector] +++ OK, passed 100 tests.
  5058. 700.40 s [vector] mut_ifoldM': OK (0.01s)
  5059. 700.40 s [vector] +++ OK, passed 100 tests.
  5060. 700.42 s [vector] mut_ifoldrM: OK (0.02s)
  5061. 700.42 s [vector] +++ OK, passed 100 tests.
  5062. 700.42 s [vector] mut_ifoldrM': OK (0.02s)
  5063. 700.42 s [vector] +++ OK, passed 100 tests.
  5064. 700.42 s [vector] compare: OK
  5065. 700.42 s [vector] +++ OK, passed 100 tests.
  5066. 700.42 s [vector] maximum: OK
  5067. 700.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5068. 700.42 s [vector] minimum: OK
  5069. 700.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5070. 700.43 s [vector] minIndex: OK
  5071. 700.43 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5072. 700.43 s [vector] maxIndex: OK
  5073. 700.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5074. 700.43 s [vector] maximumBy: OK
  5075. 700.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5076. 700.43 s [vector] minimumBy: OK
  5077. 700.43 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5078. 700.43 s [vector] maximumOn: OK
  5079. 700.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5080. 700.43 s [vector] minimumOn: OK
  5081. 700.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5082. 700.43 s [vector] maxIndexBy: OK
  5083. 700.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5084. 700.44 s [vector] minIndexBy: OK
  5085. 700.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5086. 700.44 s [vector] ListFirstMaxIndexWins: OK
  5087. 700.44 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5088. 700.44 s [vector] FalseListFirstMaxIndexWins: OK
  5089. 700.44 s [vector] +++ OK, failed as expected. (after 1 test):
  5090. 700.44 s [vector] Exception:
  5091. 700.44 s [vector] Prelude.foldr1: empty list
  5092. 700.44 s [vector] CallStack (from HasCallStack):
  5093. 700.44 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5094. 700.44 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5095. 700.44 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5096. 700.44 s [vector] []
  5097. 700.45 s [vector] mempty: OK
  5098. 700.45 s [vector] +++ OK, passed 100 tests.
  5099. 700.45 s [vector] mappend: OK
  5100. 700.45 s [vector] +++ OK, passed 100 tests.
  5101. 700.46 s [vector] mconcat: OK (0.02s)
  5102. 700.46 s [vector] +++ OK, passed 100 tests.
  5103. 700.46 s [vector] glength: OK
  5104. 700.46 s [vector] +++ OK, passed 100 tests.
  5105. 700.46 s [vector] sum: OK
  5106. 700.46 s [vector] +++ OK, passed 100 tests.
  5107. 700.46 s [vector] product: OK
  5108. 700.46 s [vector] +++ OK, passed 100 tests.
  5109. 700.46 s [vector] enumFromN: OK
  5110. 700.46 s [vector] +++ OK, passed 100 tests.
  5111. 700.46 s [vector] enumFromThenN: OK
  5112. 700.46 s [vector] +++ OK, passed 100 tests.
  5113. 700.46 s [vector] enumFromTo: OK
  5114. 700.46 s [vector] +++ OK, passed 100 tests.
  5115. 700.46 s [vector] enumFromThenTo: OK
  5116. 700.47 s [vector] +++ OK, passed 100 tests; 5 discarded.
  5117. 700.47 s [vector] unstream
  5118. 700.47 s [vector] unstream == vunstream (exact): OK
  5119. 700.47 s [vector] +++ OK, passed 100 tests.
  5120. 700.47 s [vector] unstream == vunstream (unknown): OK
  5121. 700.47 s [vector] +++ OK, passed 100 tests.
  5122. 700.47 s [vector] unstreamR ~= vunstream (exact): OK
  5123. 700.47 s [vector] +++ OK, passed 100 tests.
  5124. 700.47 s [vector] unstreamR ~= vunstream (unknown): OK
  5125. 700.47 s [vector] +++ OK, passed 100 tests.
  5126. 700.47 s [vector] Tests.Vector.Strict
  5127. 700.47 s [vector] Bool
  5128. 700.47 s [vector] fromList.toList == id: OK
  5129. 700.47 s [vector] +++ OK, passed 100 tests.
  5130. 700.47 s [vector] toList.fromList == id: OK
  5131. 700.48 s [vector] +++ OK, passed 100 tests.
  5132. 700.48 s [vector] unstream.stream == id: OK
  5133. 700.48 s [vector] +++ OK, passed 100 tests.
  5134. 700.48 s [vector] stream.unstream == id: OK
  5135. 700.48 s [vector] +++ OK, passed 100 tests.
  5136. 700.48 s [vector] eq: OK
  5137. 700.48 s [vector] +++ OK, passed 100 tests.
  5138. 700.48 s [vector] length: OK
  5139. 700.48 s [vector] +++ OK, passed 100 tests.
  5140. 700.48 s [vector] null: OK
  5141. 700.48 s [vector] +++ OK, passed 100 tests.
  5142. 700.48 s [vector] index: OK
  5143. 700.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5144. 700.50 s [vector] safeIndex: OK
  5145. 700.50 s [vector] +++ OK, passed 100 tests.
  5146. 700.51 s [vector] head: OK
  5147. 700.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5148. 700.51 s [vector] last: OK
  5149. 700.51 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5150. 700.51 s [vector] unsafeIndex: OK
  5151. 700.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5152. 700.51 s [vector] unsafeHead: OK
  5153. 700.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5154. 700.51 s [vector] unsafeLast: OK
  5155. 700.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5156. 700.51 s [vector] slice: OK
  5157. 700.51 s [vector] +++ OK, passed 100 tests.
  5158. 700.51 s [vector] init: OK
  5159. 700.51 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5160. 700.51 s [vector] tail: OK
  5161. 700.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5162. 700.51 s [vector] take: OK
  5163. 700.51 s [vector] +++ OK, passed 100 tests.
  5164. 700.51 s [vector] drop: OK
  5165. 700.51 s [vector] +++ OK, passed 100 tests.
  5166. 700.51 s [vector] splitAt: OK
  5167. 700.51 s [vector] +++ OK, passed 100 tests.
  5168. 700.51 s [vector] empty: OK
  5169. 700.51 s [vector] +++ OK, passed 100 tests.
  5170. 700.51 s [vector] singleton: OK
  5171. 700.51 s [vector] +++ OK, passed 100 tests.
  5172. 700.51 s [vector] replicate: OK
  5173. 700.51 s [vector] +++ OK, passed 100 tests.
  5174. 700.51 s [vector] generate: OK
  5175. 700.51 s [vector] +++ OK, passed 100 tests.
  5176. 700.51 s [vector] iterateN: OK
  5177. 700.51 s [vector] +++ OK, passed 100 tests.
  5178. 700.54 s [vector] iterateNM: OK (0.04s)
  5179. 700.54 s [vector] +++ OK, passed 100 tests.
  5180. 700.55 s [vector] generateM: OK (0.02s)
  5181. 700.55 s [vector] +++ OK, passed 100 tests.
  5182. 700.55 s [vector] replicateM: OK
  5183. 700.55 s [vector] +++ OK, passed 100 tests.
  5184. 700.55 s [vector] create: OK
  5185. 700.55 s [vector] +++ OK, passed 100 tests.
  5186. 700.55 s [vector] createT: OK
  5187. 700.55 s [vector] +++ OK, passed 100 tests.
  5188. 700.55 s [vector] unfoldr: OK
  5189. 700.55 s [vector] +++ OK, passed 100 tests.
  5190. 700.55 s [vector] unfoldrN: OK
  5191. 700.55 s [vector] +++ OK, passed 100 tests.
  5192. 700.55 s [vector] unfoldrExactN: OK
  5193. 700.56 s [vector] +++ OK, passed 100 tests.
  5194. 700.57 s [vector] unfoldrM: OK (0.02s)
  5195. 700.58 s [vector] +++ OK, passed 100 tests.
  5196. 700.58 s [vector] unfoldrNM: OK
  5197. 700.58 s [vector] +++ OK, passed 100 tests.
  5198. 700.60 s [vector] unfoldrExactNM: OK (0.02s)
  5199. 700.60 s [vector] +++ OK, passed 100 tests.
  5200. 700.60 s [vector] constructN: OK
  5201. 700.60 s [vector] +++ OK, passed 100 tests.
  5202. 700.60 s [vector] constructrN: OK
  5203. 700.60 s [vector] +++ OK, passed 100 tests.
  5204. 700.60 s [vector] cons: OK
  5205. 700.60 s [vector] +++ OK, passed 100 tests.
  5206. 700.60 s [vector] snoc: OK
  5207. 700.60 s [vector] +++ OK, passed 100 tests.
  5208. 700.60 s [vector] append: OK
  5209. 700.61 s [vector] +++ OK, passed 100 tests.
  5210. 700.61 s [vector] concat: OK
  5211. 700.61 s [vector] +++ OK, passed 100 tests.
  5212. 700.61 s [vector] force: OK
  5213. 700.61 s [vector] +++ OK, passed 100 tests.
  5214. 700.62 s [vector] upd: OK
  5215. 700.62 s [vector] +++ OK, passed 100 tests.
  5216. 700.62 s [vector] accum: OK
  5217. 700.62 s [vector] +++ OK, passed 100 tests.
  5218. 700.62 s [vector] reverse: OK
  5219. 700.62 s [vector] +++ OK, passed 100 tests.
  5220. 700.62 s [vector] backpermute: OK
  5221. 700.62 s [vector] +++ OK, passed 100 tests.
  5222. 700.62 s [vector] map: OK
  5223. 700.62 s [vector] +++ OK, passed 100 tests.
  5224. 700.62 s [vector] imap: OK
  5225. 700.62 s [vector] +++ OK, passed 100 tests.
  5226. 700.62 s [vector] concatMap: OK
  5227. 700.63 s [vector] +++ OK, passed 100 tests.
  5228. 700.64 s [vector] mapM: OK
  5229. 700.64 s [vector] +++ OK, passed 100 tests.
  5230. 700.64 s [vector] mapM_: OK (0.02s)
  5231. 700.66 s [vector] +++ OK, passed 100 tests.
  5232. 700.66 s [vector] forM: OK
  5233. 700.66 s [vector] +++ OK, passed 100 tests.
  5234. 700.67 s [vector] forM_: OK (0.01s)
  5235. 700.67 s [vector] +++ OK, passed 100 tests.
  5236. 700.68 s [vector] imapM: OK
  5237. 700.68 s [vector] +++ OK, passed 100 tests.
  5238. 700.68 s [vector] imapM_: OK (0.01s)
  5239. 700.68 s [vector] +++ OK, passed 100 tests.
  5240. 700.68 s [vector] zipWith: OK
  5241. 700.68 s [vector] +++ OK, passed 100 tests.
  5242. 700.68 s [vector] zipWith3: OK
  5243. 700.68 s [vector] +++ OK, passed 100 tests.
  5244. 700.68 s [vector] izipWith: OK
  5245. 700.68 s [vector] +++ OK, passed 100 tests.
  5246. 700.68 s [vector] izipWith3: OK
  5247. 700.68 s [vector] +++ OK, passed 100 tests.
  5248. 700.68 s [vector] izipWithM: OK
  5249. 700.68 s [vector] +++ OK, passed 100 tests.
  5250. 700.70 s [vector] izipWithM_: OK (0.02s)
  5251. 700.71 s [vector] +++ OK, passed 100 tests.
  5252. 700.72 s [vector] zipWithM: OK
  5253. 700.72 s [vector] +++ OK, passed 100 tests.
  5254. 700.72 s [vector] zipWithM_: OK (0.01s)
  5255. 700.72 s [vector] +++ OK, passed 100 tests.
  5256. 700.72 s [vector] filter: OK
  5257. 700.72 s [vector] +++ OK, passed 100 tests.
  5258. 700.74 s [vector] ifilter: OK
  5259. 700.74 s [vector] +++ OK, passed 100 tests.
  5260. 700.74 s [vector] filterM: OK (0.03s)
  5261. 700.74 s [vector] +++ OK, passed 100 tests.
  5262. 700.75 s [vector] uniq: OK
  5263. 700.75 s [vector] +++ OK, passed 100 tests.
  5264. 700.75 s [vector] mapMaybe: OK
  5265. 700.75 s [vector] +++ OK, passed 100 tests.
  5266. 700.75 s [vector] imapMaybe: OK
  5267. 700.75 s [vector] +++ OK, passed 100 tests.
  5268. 700.75 s [vector] takeWhile: OK
  5269. 700.75 s [vector] +++ OK, passed 100 tests.
  5270. 700.75 s [vector] dropWhile: OK
  5271. 700.75 s [vector] +++ OK, passed 100 tests.
  5272. 700.75 s [vector] partition: OK
  5273. 700.75 s [vector] +++ OK, passed 100 tests.
  5274. 700.75 s [vector] partitionWith: OK
  5275. 700.75 s [vector] +++ OK, passed 100 tests.
  5276. 700.75 s [vector] span: OK
  5277. 700.76 s [vector] +++ OK, passed 100 tests.
  5278. 700.76 s [vector] break: OK
  5279. 700.76 s [vector] +++ OK, passed 100 tests.
  5280. 700.76 s [vector] spanR: OK
  5281. 700.76 s [vector] +++ OK, passed 100 tests.
  5282. 700.76 s [vector] breakR: OK
  5283. 700.76 s [vector] +++ OK, passed 100 tests.
  5284. 700.76 s [vector] groupBy: OK
  5285. 700.76 s [vector] +++ OK, passed 100 tests.
  5286. 700.76 s [vector] elem: OK
  5287. 700.76 s [vector] +++ OK, passed 100 tests.
  5288. 700.76 s [vector] notElem: OK
  5289. 700.76 s [vector] +++ OK, passed 100 tests.
  5290. 700.76 s [vector] find: OK
  5291. 700.76 s [vector] +++ OK, passed 100 tests.
  5292. 700.76 s [vector] findIndex: OK
  5293. 700.76 s [vector] +++ OK, passed 100 tests.
  5294. 700.76 s [vector] findIndexR: OK
  5295. 700.76 s [vector] +++ OK, passed 100 tests.
  5296. 700.76 s [vector] findIndices: OK
  5297. 700.76 s [vector] +++ OK, passed 100 tests.
  5298. 700.76 s [vector] elemIndex: OK
  5299. 700.76 s [vector] +++ OK, passed 100 tests.
  5300. 700.77 s [vector] elemIndices: OK
  5301. 700.77 s [vector] +++ OK, passed 100 tests.
  5302. 700.77 s [vector] foldl: OK
  5303. 700.77 s [vector] +++ OK, passed 100 tests.
  5304. 700.77 s [vector] foldl1: OK
  5305. 700.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5306. 700.78 s [vector] foldl': OK
  5307. 700.78 s [vector] +++ OK, passed 100 tests.
  5308. 700.78 s [vector] foldl1': OK
  5309. 700.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5310. 700.79 s [vector] foldr: OK
  5311. 700.79 s [vector] +++ OK, passed 100 tests.
  5312. 700.79 s [vector] foldr1: OK
  5313. 700.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5314. 700.79 s [vector] foldr': OK
  5315. 700.79 s [vector] +++ OK, passed 100 tests.
  5316. 700.79 s [vector] foldr1': OK
  5317. 700.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5318. 700.80 s [vector] ifoldl: OK
  5319. 700.80 s [vector] +++ OK, passed 100 tests.
  5320. 700.80 s [vector] ifoldl': OK
  5321. 700.80 s [vector] +++ OK, passed 100 tests.
  5322. 700.80 s [vector] ifoldr: OK
  5323. 700.81 s [vector] +++ OK, passed 100 tests.
  5324. 700.81 s [vector] ifoldr': OK
  5325. 700.81 s [vector] +++ OK, passed 100 tests.
  5326. 700.81 s [vector] ifoldM: OK
  5327. 700.81 s [vector] +++ OK, passed 100 tests.
  5328. 700.81 s [vector] ifoldM': OK
  5329. 700.81 s [vector] +++ OK, passed 100 tests.
  5330. 700.81 s [vector] ifoldM_: OK (0.02s)
  5331. 700.81 s [vector] +++ OK, passed 100 tests.
  5332. 700.81 s [vector] ifoldM'_: OK (0.01s)
  5333. 700.81 s [vector] +++ OK, passed 100 tests.
  5334. 700.82 s [vector] all: OK
  5335. 700.82 s [vector] +++ OK, passed 100 tests.
  5336. 700.82 s [vector] any: OK
  5337. 700.82 s [vector] +++ OK, passed 100 tests.
  5338. 700.82 s [vector] prescanl: OK
  5339. 700.82 s [vector] +++ OK, passed 100 tests.
  5340. 700.82 s [vector] prescanl': OK
  5341. 700.82 s [vector] +++ OK, passed 100 tests.
  5342. 700.82 s [vector] postscanl: OK
  5343. 700.82 s [vector] +++ OK, passed 100 tests.
  5344. 700.82 s [vector] postscanl': OK
  5345. 700.82 s [vector] +++ OK, passed 100 tests.
  5346. 700.82 s [vector] scanl: OK
  5347. 700.82 s [vector] +++ OK, passed 100 tests.
  5348. 700.83 s [vector] scanl': OK
  5349. 700.83 s [vector] +++ OK, passed 100 tests.
  5350. 700.83 s [vector] scanl1: OK
  5351. 700.83 s [vector] +++ OK, passed 100 tests.
  5352. 700.83 s [vector] scanl1': OK
  5353. 700.83 s [vector] +++ OK, passed 100 tests.
  5354. 700.83 s [vector] iscanl: OK
  5355. 700.83 s [vector] +++ OK, passed 100 tests.
  5356. 700.83 s [vector] iscanl': OK
  5357. 700.83 s [vector] +++ OK, passed 100 tests.
  5358. 700.83 s [vector] prescanr: OK
  5359. 700.83 s [vector] +++ OK, passed 100 tests.
  5360. 700.83 s [vector] prescanr': OK
  5361. 700.84 s [vector] +++ OK, passed 100 tests.
  5362. 700.84 s [vector] postscanr: OK
  5363. 700.84 s [vector] +++ OK, passed 100 tests.
  5364. 700.84 s [vector] postscanr': OK
  5365. 700.84 s [vector] +++ OK, passed 100 tests.
  5366. 700.84 s [vector] scanr: OK
  5367. 700.84 s [vector] +++ OK, passed 100 tests.
  5368. 700.84 s [vector] scanr': OK
  5369. 700.84 s [vector] +++ OK, passed 100 tests.
  5370. 700.84 s [vector] scanr1: OK
  5371. 700.84 s [vector] +++ OK, passed 100 tests.
  5372. 700.84 s [vector] scanr1': OK
  5373. 700.85 s [vector] +++ OK, passed 100 tests.
  5374. 700.85 s [vector] iscanr: OK
  5375. 700.85 s [vector] +++ OK, passed 100 tests.
  5376. 700.85 s [vector] iscanr': OK
  5377. 700.85 s [vector] +++ OK, passed 100 tests.
  5378. 700.85 s [vector] mut_read: OK
  5379. 700.85 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5380. 700.85 s [vector] mut_write: OK
  5381. 700.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5382. 700.85 s [vector] mut_modify: OK
  5383. 700.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5384. 700.86 s [vector] mut_generate: OK
  5385. 700.86 s [vector] +++ OK, passed 100 tests.
  5386. 700.86 s [vector] mut_generateM: OK
  5387. 700.87 s [vector] +++ OK, passed 100 tests.
  5388. 700.88 s [vector] mut_mapM_: OK (0.01s)
  5389. 700.88 s [vector] +++ OK, passed 100 tests.
  5390. 700.90 s [vector] mut_imapM_: OK (0.01s)
  5391. 700.90 s [vector] +++ OK, passed 100 tests.
  5392. 700.90 s [vector] mut_forM_: OK (0.01s)
  5393. 700.90 s [vector] +++ OK, passed 100 tests.
  5394. 700.92 s [vector] mut_iforM_: OK (0.02s)
  5395. 700.92 s [vector] +++ OK, passed 100 tests.
  5396. 700.92 s [vector] mut_foldr: OK
  5397. 700.92 s [vector] +++ OK, passed 100 tests.
  5398. 700.93 s [vector] mut_foldr': OK
  5399. 700.93 s [vector] +++ OK, passed 100 tests.
  5400. 700.94 s [vector] mut_foldl: OK
  5401. 700.94 s [vector] +++ OK, passed 100 tests.
  5402. 700.94 s [vector] mut_foldl': OK
  5403. 700.94 s [vector] +++ OK, passed 100 tests.
  5404. 700.94 s [vector] mut_ifoldr: OK
  5405. 700.94 s [vector] +++ OK, passed 100 tests.
  5406. 700.94 s [vector] mut_ifoldr': OK
  5407. 700.94 s [vector] +++ OK, passed 100 tests.
  5408. 700.94 s [vector] mut_ifoldl: OK
  5409. 700.94 s [vector] +++ OK, passed 100 tests.
  5410. 700.94 s [vector] mut_ifoldl': OK
  5411. 700.94 s [vector] +++ OK, passed 100 tests.
  5412. 700.94 s [vector] mut_foldM: OK
  5413. 700.95 s [vector] +++ OK, passed 100 tests.
  5414. 700.95 s [vector] mut_foldM': OK
  5415. 700.95 s [vector] +++ OK, passed 100 tests.
  5416. 700.95 s [vector] mut_foldrM: OK
  5417. 700.95 s [vector] +++ OK, passed 100 tests.
  5418. 700.95 s [vector] mut_foldrM': OK
  5419. 700.95 s [vector] +++ OK, passed 100 tests.
  5420. 700.96 s [vector] mut_ifoldM: OK
  5421. 700.96 s [vector] +++ OK, passed 100 tests.
  5422. 700.96 s [vector] mut_ifoldM': OK
  5423. 700.96 s [vector] +++ OK, passed 100 tests.
  5424. 700.96 s [vector] mut_ifoldrM: OK
  5425. 700.96 s [vector] +++ OK, passed 100 tests.
  5426. 700.96 s [vector] mut_ifoldrM': OK
  5427. 700.96 s [vector] +++ OK, passed 100 tests.
  5428. 700.97 s [vector] compare: OK
  5429. 700.97 s [vector] +++ OK, passed 100 tests.
  5430. 700.97 s [vector] maximum: OK
  5431. 700.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5432. 700.97 s [vector] minimum: OK
  5433. 700.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5434. 700.97 s [vector] minIndex: OK
  5435. 700.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5436. 700.97 s [vector] maxIndex: OK
  5437. 700.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5438. 700.97 s [vector] maximumBy: OK
  5439. 700.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5440. 700.97 s [vector] minimumBy: OK
  5441. 700.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5442. 700.97 s [vector] maximumOn: OK
  5443. 700.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5444. 700.97 s [vector] minimumOn: OK
  5445. 700.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5446. 700.97 s [vector] maxIndexBy: OK
  5447. 700.97 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5448. 700.97 s [vector] minIndexBy: OK
  5449. 700.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5450. 700.97 s [vector] ListFirstMaxIndexWins: OK
  5451. 700.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5452. 700.98 s [vector] FalseListFirstMaxIndexWins: OK
  5453. 700.98 s [vector] +++ OK, failed as expected. (after 1 test):
  5454. 700.98 s [vector] Exception:
  5455. 700.98 s [vector] Prelude.foldr1: empty list
  5456. 700.98 s [vector] CallStack (from HasCallStack):
  5457. 700.98 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5458. 700.98 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5459. 700.98 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5460. 700.98 s [vector] []
  5461. 700.98 s [vector] zip: OK
  5462. 700.98 s [vector] +++ OK, passed 100 tests.
  5463. 700.98 s [vector] zip3: OK
  5464. 700.98 s [vector] +++ OK, passed 100 tests.
  5465. 700.98 s [vector] unzip: OK
  5466. 700.98 s [vector] +++ OK, passed 100 tests.
  5467. 700.98 s [vector] unzip3: OK
  5468. 700.98 s [vector] +++ OK, passed 100 tests.
  5469. 700.98 s [vector] indexed: OK
  5470. 700.98 s [vector] +++ OK, passed 100 tests.
  5471. 700.99 s [vector] update: OK
  5472. 700.99 s [vector] +++ OK, passed 100 tests.
  5473. 700.99 s [vector] concat: OK
  5474. 700.99 s [vector] +++ OK, passed 100 tests.
  5475. 700.99 s [vector] mempty: OK
  5476. 700.99 s [vector] +++ OK, passed 100 tests.
  5477. 701.00 s [vector] mappend: OK
  5478. 701.00 s [vector] +++ OK, passed 100 tests.
  5479. 701.00 s [vector] mconcat: OK
  5480. 701.00 s [vector] +++ OK, passed 100 tests.
  5481. 701.00 s [vector] fmap: OK
  5482. 701.00 s [vector] +++ OK, passed 100 tests.
  5483. 701.01 s [vector] return: OK
  5484. 701.01 s [vector] +++ OK, passed 100 tests.
  5485. 701.01 s [vector] bind: OK (0.01s)
  5486. 701.01 s [vector] +++ OK, passed 100 tests.
  5487. 701.01 s [vector] mzip: OK
  5488. 701.01 s [vector] +++ OK, passed 100 tests.
  5489. 701.01 s [vector] munzip: OK
  5490. 701.01 s [vector] +++ OK, passed 100 tests.
  5491. 701.01 s [vector] applicative_pure: OK
  5492. 701.01 s [vector] +++ OK, passed 100 tests.
  5493. 701.03 s [vector] applicative_appl: OK (0.01s)
  5494. 701.03 s [vector] +++ OK, passed 100 tests.
  5495. 701.04 s [vector] alternative_empty: OK
  5496. 701.04 s [vector] +++ OK, passed 100 tests.
  5497. 701.04 s [vector] alternative_or: OK
  5498. 701.04 s [vector] +++ OK, passed 100 tests.
  5499. 701.06 s [vector] sequence: OK (0.02s)
  5500. 701.06 s [vector] +++ OK, passed 100 tests.
  5501. 701.06 s [vector] sequence_: OK
  5502. 701.06 s [vector] +++ OK, passed 100 tests.
  5503. 701.06 s [vector] glength: OK
  5504. 701.06 s [vector] +++ OK, passed 100 tests.
  5505. 701.06 s [vector] and: OK
  5506. 701.06 s [vector] +++ OK, passed 100 tests.
  5507. 701.06 s [vector] or: OK
  5508. 701.06 s [vector] +++ OK, passed 100 tests.
  5509. 701.06 s [vector] Int
  5510. 701.06 s [vector] fromList.toList == id: OK
  5511. 701.06 s [vector] +++ OK, passed 100 tests.
  5512. 701.07 s [vector] toList.fromList == id: OK
  5513. 701.07 s [vector] +++ OK, passed 100 tests.
  5514. 701.07 s [vector] unstream.stream == id: OK
  5515. 701.07 s [vector] +++ OK, passed 100 tests.
  5516. 701.07 s [vector] stream.unstream == id: OK
  5517. 701.07 s [vector] +++ OK, passed 100 tests.
  5518. 701.07 s [vector] eq: OK
  5519. 701.07 s [vector] +++ OK, passed 100 tests.
  5520. 701.07 s [vector] length: OK
  5521. 701.07 s [vector] +++ OK, passed 100 tests.
  5522. 701.07 s [vector] null: OK
  5523. 701.07 s [vector] +++ OK, passed 100 tests.
  5524. 701.07 s [vector] index: OK
  5525. 701.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5526. 701.07 s [vector] safeIndex: OK
  5527. 701.07 s [vector] +++ OK, passed 100 tests.
  5528. 701.07 s [vector] head: OK
  5529. 701.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5530. 701.07 s [vector] last: OK
  5531. 701.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5532. 701.07 s [vector] unsafeIndex: OK
  5533. 701.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5534. 701.07 s [vector] unsafeHead: OK
  5535. 701.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5536. 701.07 s [vector] unsafeLast: OK
  5537. 701.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5538. 701.07 s [vector] slice: OK
  5539. 701.07 s [vector] +++ OK, passed 100 tests.
  5540. 701.07 s [vector] init: OK
  5541. 701.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5542. 701.07 s [vector] tail: OK
  5543. 701.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5544. 701.07 s [vector] take: OK
  5545. 701.07 s [vector] +++ OK, passed 100 tests.
  5546. 701.08 s [vector] drop: OK
  5547. 701.08 s [vector] +++ OK, passed 100 tests.
  5548. 701.08 s [vector] splitAt: OK
  5549. 701.08 s [vector] +++ OK, passed 100 tests.
  5550. 701.08 s [vector] empty: OK
  5551. 701.08 s [vector] +++ OK, passed 100 tests.
  5552. 701.08 s [vector] singleton: OK
  5553. 701.08 s [vector] +++ OK, passed 100 tests.
  5554. 701.08 s [vector] replicate: OK
  5555. 701.08 s [vector] +++ OK, passed 100 tests.
  5556. 701.08 s [vector] generate: OK
  5557. 701.08 s [vector] +++ OK, passed 100 tests.
  5558. 701.10 s [vector] iterateN: OK
  5559. 701.10 s [vector] +++ OK, passed 100 tests.
  5560. 701.16 s [vector] iterateNM: OK (0.06s)
  5561. 701.16 s [vector] +++ OK, passed 100 tests.
  5562. 701.17 s [vector] generateM: OK (0.02s)
  5563. 701.17 s [vector] +++ OK, passed 100 tests.
  5564. 701.17 s [vector] replicateM: OK
  5565. 701.17 s [vector] +++ OK, passed 100 tests.
  5566. 701.17 s [vector] create: OK
  5567. 701.17 s [vector] +++ OK, passed 100 tests.
  5568. 701.17 s [vector] createT: OK
  5569. 701.17 s [vector] +++ OK, passed 100 tests.
  5570. 701.17 s [vector] unfoldr: OK
  5571. 701.17 s [vector] +++ OK, passed 100 tests.
  5572. 701.17 s [vector] unfoldrN: OK
  5573. 701.17 s [vector] +++ OK, passed 100 tests.
  5574. 701.17 s [vector] unfoldrExactN: OK
  5575. 701.17 s [vector] +++ OK, passed 100 tests.
  5576. 701.18 s [vector] unfoldrM: OK
  5577. 701.18 s [vector] +++ OK, passed 100 tests.
  5578. 701.18 s [vector] unfoldrNM: OK
  5579. 701.18 s [vector] +++ OK, passed 100 tests.
  5580. 701.22 s [vector] unfoldrExactNM: OK (0.04s)
  5581. 701.22 s [vector] +++ OK, passed 100 tests.
  5582. 701.22 s [vector] constructN: OK
  5583. 701.22 s [vector] +++ OK, passed 100 tests.
  5584. 701.23 s [vector] constructrN: OK
  5585. 701.23 s [vector] +++ OK, passed 100 tests.
  5586. 701.23 s [vector] cons: OK
  5587. 701.23 s [vector] +++ OK, passed 100 tests.
  5588. 701.23 s [vector] snoc: OK
  5589. 701.23 s [vector] +++ OK, passed 100 tests.
  5590. 701.23 s [vector] append: OK
  5591. 701.24 s [vector] +++ OK, passed 100 tests.
  5592. 701.24 s [vector] concat: OK (0.01s)
  5593. 701.24 s [vector] +++ OK, passed 100 tests.
  5594. 701.24 s [vector] force: OK
  5595. 701.25 s [vector] +++ OK, passed 100 tests.
  5596. 701.25 s [vector] upd: OK
  5597. 701.25 s [vector] +++ OK, passed 100 tests.
  5598. 701.26 s [vector] accum: OK
  5599. 701.26 s [vector] +++ OK, passed 100 tests.
  5600. 701.26 s [vector] reverse: OK
  5601. 701.26 s [vector] +++ OK, passed 100 tests.
  5602. 701.26 s [vector] backpermute: OK
  5603. 701.26 s [vector] +++ OK, passed 100 tests.
  5604. 701.26 s [vector] map: OK
  5605. 701.26 s [vector] +++ OK, passed 100 tests.
  5606. 701.26 s [vector] imap: OK
  5607. 701.28 s [vector] +++ OK, passed 100 tests.
  5608. 701.28 s [vector] concatMap: OK
  5609. 701.28 s [vector] +++ OK, passed 100 tests.
  5610. 701.28 s [vector] mapM: OK
  5611. 701.28 s [vector] +++ OK, passed 100 tests.
  5612. 701.28 s [vector] mapM_: OK (0.02s)
  5613. 701.28 s [vector] +++ OK, passed 100 tests.
  5614. 701.28 s [vector] forM: OK
  5615. 701.28 s [vector] +++ OK, passed 100 tests.
  5616. 701.30 s [vector] forM_: OK (0.02s)
  5617. 701.30 s [vector] +++ OK, passed 100 tests.
  5618. 701.30 s [vector] imapM: OK
  5619. 701.32 s [vector] +++ OK, passed 100 tests.
  5620. 701.33 s [vector] imapM_: OK (0.02s)
  5621. 701.33 s [vector] +++ OK, passed 100 tests.
  5622. 701.33 s [vector] zipWith: OK
  5623. 701.33 s [vector] +++ OK, passed 100 tests.
  5624. 701.34 s [vector] zipWith3: OK
  5625. 701.34 s [vector] +++ OK, passed 100 tests.
  5626. 701.35 s [vector] izipWith: OK
  5627. 701.35 s [vector] +++ OK, passed 100 tests.
  5628. 701.35 s [vector] izipWith3: OK
  5629. 701.35 s [vector] +++ OK, passed 100 tests.
  5630. 701.36 s [vector] izipWithM: OK
  5631. 701.36 s [vector] +++ OK, passed 100 tests.
  5632. 701.37 s [vector] izipWithM_: OK (0.02s)
  5633. 701.38 s [vector] +++ OK, passed 100 tests.
  5634. 701.38 s [vector] zipWithM: OK
  5635. 701.38 s [vector] +++ OK, passed 100 tests.
  5636. 701.39 s [vector] zipWithM_: OK (0.01s)
  5637. 701.39 s [vector] +++ OK, passed 100 tests.
  5638. 701.39 s [vector] filter: OK
  5639. 701.39 s [vector] +++ OK, passed 100 tests.
  5640. 701.40 s [vector] ifilter: OK
  5641. 701.40 s [vector] +++ OK, passed 100 tests.
  5642. 701.42 s [vector] filterM: OK (0.03s)
  5643. 701.42 s [vector] +++ OK, passed 100 tests.
  5644. 701.43 s [vector] uniq: OK
  5645. 701.43 s [vector] +++ OK, passed 100 tests.
  5646. 701.43 s [vector] mapMaybe: OK
  5647. 701.43 s [vector] +++ OK, passed 100 tests.
  5648. 701.43 s [vector] imapMaybe: OK
  5649. 701.43 s [vector] +++ OK, passed 100 tests.
  5650. 701.43 s [vector] takeWhile: OK
  5651. 701.43 s [vector] +++ OK, passed 100 tests.
  5652. 701.43 s [vector] dropWhile: OK
  5653. 701.43 s [vector] +++ OK, passed 100 tests.
  5654. 701.43 s [vector] partition: OK
  5655. 701.43 s [vector] +++ OK, passed 100 tests.
  5656. 701.43 s [vector] partitionWith: OK
  5657. 701.43 s [vector] +++ OK, passed 100 tests.
  5658. 701.43 s [vector] span: OK
  5659. 701.43 s [vector] +++ OK, passed 100 tests.
  5660. 701.43 s [vector] break: OK
  5661. 701.43 s [vector] +++ OK, passed 100 tests.
  5662. 701.43 s [vector] spanR: OK
  5663. 701.43 s [vector] +++ OK, passed 100 tests.
  5664. 701.44 s [vector] breakR: OK
  5665. 701.44 s [vector] +++ OK, passed 100 tests.
  5666. 701.44 s [vector] groupBy: OK
  5667. 701.44 s [vector] +++ OK, passed 100 tests.
  5668. 701.44 s [vector] elem: OK
  5669. 701.44 s [vector] +++ OK, passed 100 tests.
  5670. 701.44 s [vector] notElem: OK
  5671. 701.44 s [vector] +++ OK, passed 100 tests.
  5672. 701.44 s [vector] find: OK
  5673. 701.44 s [vector] +++ OK, passed 100 tests.
  5674. 701.44 s [vector] findIndex: OK
  5675. 701.44 s [vector] +++ OK, passed 100 tests.
  5676. 701.44 s [vector] findIndexR: OK
  5677. 701.44 s [vector] +++ OK, passed 100 tests.
  5678. 701.44 s [vector] findIndices: OK
  5679. 701.44 s [vector] +++ OK, passed 100 tests.
  5680. 701.44 s [vector] elemIndex: OK
  5681. 701.44 s [vector] +++ OK, passed 100 tests.
  5682. 701.44 s [vector] elemIndices: OK
  5683. 701.44 s [vector] +++ OK, passed 100 tests.
  5684. 701.45 s [vector] foldl: OK
  5685. 701.45 s [vector] +++ OK, passed 100 tests.
  5686. 701.45 s [vector] foldl1: OK
  5687. 701.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5688. 701.45 s [vector] foldl': OK
  5689. 701.46 s [vector] +++ OK, passed 100 tests.
  5690. 701.46 s [vector] foldl1': OK
  5691. 701.46 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5692. 701.46 s [vector] foldr: OK
  5693. 701.46 s [vector] +++ OK, passed 100 tests.
  5694. 701.46 s [vector] foldr1: OK
  5695. 701.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5696. 701.46 s [vector] foldr': OK
  5697. 701.46 s [vector] +++ OK, passed 100 tests.
  5698. 701.46 s [vector] foldr1': OK
  5699. 701.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5700. 701.46 s [vector] ifoldl: OK
  5701. 701.47 s [vector] +++ OK, passed 100 tests.
  5702. 701.47 s [vector] ifoldl': OK
  5703. 701.47 s [vector] +++ OK, passed 100 tests.
  5704. 701.47 s [vector] ifoldr: OK
  5705. 701.47 s [vector] +++ OK, passed 100 tests.
  5706. 701.48 s [vector] ifoldr': OK
  5707. 701.48 s [vector] +++ OK, passed 100 tests.
  5708. 701.48 s [vector] ifoldM: OK
  5709. 701.48 s [vector] +++ OK, passed 100 tests.
  5710. 701.50 s [vector] ifoldM': OK
  5711. 701.50 s [vector] +++ OK, passed 100 tests.
  5712. 701.52 s [vector] ifoldM_: OK (0.02s)
  5713. 701.52 s [vector] +++ OK, passed 100 tests.
  5714. 701.52 s [vector] ifoldM'_: OK (0.02s)
  5715. 701.52 s [vector] +++ OK, passed 100 tests.
  5716. 701.52 s [vector] all: OK
  5717. 701.53 s [vector] +++ OK, passed 100 tests.
  5718. 701.53 s [vector] any: OK
  5719. 701.53 s [vector] +++ OK, passed 100 tests.
  5720. 701.53 s [vector] prescanl: OK
  5721. 701.53 s [vector] +++ OK, passed 100 tests.
  5722. 701.53 s [vector] prescanl': OK
  5723. 701.53 s [vector] +++ OK, passed 100 tests.
  5724. 701.53 s [vector] postscanl: OK
  5725. 701.53 s [vector] +++ OK, passed 100 tests.
  5726. 701.53 s [vector] postscanl': OK
  5727. 701.54 s [vector] +++ OK, passed 100 tests.
  5728. 701.54 s [vector] scanl: OK
  5729. 701.54 s [vector] +++ OK, passed 100 tests.
  5730. 701.55 s [vector] scanl': OK
  5731. 701.55 s [vector] +++ OK, passed 100 tests.
  5732. 701.55 s [vector] scanl1: OK
  5733. 701.55 s [vector] +++ OK, passed 100 tests.
  5734. 701.55 s [vector] scanl1': OK
  5735. 701.55 s [vector] +++ OK, passed 100 tests.
  5736. 701.55 s [vector] iscanl: OK
  5737. 701.55 s [vector] +++ OK, passed 100 tests.
  5738. 701.56 s [vector] iscanl': OK
  5739. 701.56 s [vector] +++ OK, passed 100 tests.
  5740. 701.56 s [vector] prescanr: OK
  5741. 701.56 s [vector] +++ OK, passed 100 tests.
  5742. 701.56 s [vector] prescanr': OK
  5743. 701.56 s [vector] +++ OK, passed 100 tests.
  5744. 701.56 s [vector] postscanr: OK
  5745. 701.56 s [vector] +++ OK, passed 100 tests.
  5746. 701.56 s [vector] postscanr': OK
  5747. 701.56 s [vector] +++ OK, passed 100 tests.
  5748. 701.56 s [vector] scanr: OK
  5749. 701.56 s [vector] +++ OK, passed 100 tests.
  5750. 701.57 s [vector] scanr': OK
  5751. 701.57 s [vector] +++ OK, passed 100 tests.
  5752. 701.57 s [vector] scanr1: OK
  5753. 701.57 s [vector] +++ OK, passed 100 tests.
  5754. 701.57 s [vector] scanr1': OK
  5755. 701.57 s [vector] +++ OK, passed 100 tests.
  5756. 701.58 s [vector] iscanr: OK
  5757. 701.58 s [vector] +++ OK, passed 100 tests.
  5758. 701.58 s [vector] iscanr': OK
  5759. 701.58 s [vector] +++ OK, passed 100 tests.
  5760. 701.58 s [vector] mut_read: OK
  5761. 701.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5762. 701.58 s [vector] mut_write: OK
  5763. 701.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5764. 701.58 s [vector] mut_modify: OK
  5765. 701.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5766. 701.58 s [vector] mut_generate: OK
  5767. 701.59 s [vector] +++ OK, passed 100 tests.
  5768. 701.60 s [vector] mut_generateM: OK (0.01s)
  5769. 701.60 s [vector] +++ OK, passed 100 tests.
  5770. 701.62 s [vector] mut_mapM_: OK (0.01s)
  5771. 701.62 s [vector] +++ OK, passed 100 tests.
  5772. 701.64 s [vector] mut_imapM_: OK (0.02s)
  5773. 701.64 s [vector] +++ OK, passed 100 tests.
  5774. 701.66 s [vector] mut_forM_: OK (0.02s)
  5775. 701.66 s [vector] +++ OK, passed 100 tests.
  5776. 701.67 s [vector] mut_iforM_: OK (0.02s)
  5777. 701.67 s [vector] +++ OK, passed 100 tests.
  5778. 701.67 s [vector] mut_foldr: OK
  5779. 701.67 s [vector] +++ OK, passed 100 tests.
  5780. 701.67 s [vector] mut_foldr': OK
  5781. 701.67 s [vector] +++ OK, passed 100 tests.
  5782. 701.67 s [vector] mut_foldl: OK
  5783. 701.67 s [vector] +++ OK, passed 100 tests.
  5784. 701.67 s [vector] mut_foldl': OK
  5785. 701.67 s [vector] +++ OK, passed 100 tests.
  5786. 701.68 s [vector] mut_ifoldr: OK
  5787. 701.69 s [vector] +++ OK, passed 100 tests.
  5788. 701.69 s [vector] mut_ifoldr': OK
  5789. 701.69 s [vector] +++ OK, passed 100 tests.
  5790. 701.70 s [vector] mut_ifoldl: OK
  5791. 701.70 s [vector] +++ OK, passed 100 tests.
  5792. 701.71 s [vector] mut_ifoldl': OK
  5793. 701.71 s [vector] +++ OK, passed 100 tests.
  5794. 701.71 s [vector] mut_foldM: OK
  5795. 701.71 s [vector] +++ OK, passed 100 tests.
  5796. 701.71 s [vector] mut_foldM': OK
  5797. 701.71 s [vector] +++ OK, passed 100 tests.
  5798. 701.71 s [vector] mut_foldrM: OK
  5799. 701.71 s [vector] +++ OK, passed 100 tests.
  5800. 701.71 s [vector] mut_foldrM': OK
  5801. 701.71 s [vector] +++ OK, passed 100 tests.
  5802. 701.71 s [vector] mut_ifoldM: OK
  5803. 701.71 s [vector] +++ OK, passed 100 tests.
  5804. 701.71 s [vector] mut_ifoldM': OK
  5805. 701.71 s [vector] +++ OK, passed 100 tests.
  5806. 701.72 s [vector] mut_ifoldrM: OK
  5807. 701.72 s [vector] +++ OK, passed 100 tests.
  5808. 701.72 s [vector] mut_ifoldrM': OK
  5809. 701.72 s [vector] +++ OK, passed 100 tests.
  5810. 701.72 s [vector] compare: OK
  5811. 701.72 s [vector] +++ OK, passed 100 tests.
  5812. 701.72 s [vector] maximum: OK
  5813. 701.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5814. 701.72 s [vector] minimum: OK
  5815. 701.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5816. 701.72 s [vector] minIndex: OK
  5817. 701.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5818. 701.72 s [vector] maxIndex: OK
  5819. 701.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5820. 701.72 s [vector] maximumBy: OK
  5821. 701.73 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5822. 701.73 s [vector] minimumBy: OK
  5823. 701.73 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5824. 701.73 s [vector] maximumOn: OK
  5825. 701.73 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5826. 701.73 s [vector] minimumOn: OK
  5827. 701.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5828. 701.73 s [vector] maxIndexBy: OK
  5829. 701.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5830. 701.73 s [vector] minIndexBy: OK
  5831. 701.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5832. 701.73 s [vector] ListFirstMaxIndexWins: OK
  5833. 701.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5834. 701.73 s [vector] FalseListFirstMaxIndexWins: OK
  5835. 701.73 s [vector] +++ OK, failed as expected. (after 1 test):
  5836. 701.73 s [vector] Exception:
  5837. 701.73 s [vector] Prelude.foldr1: empty list
  5838. 701.73 s [vector] CallStack (from HasCallStack):
  5839. 701.73 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5840. 701.73 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5841. 701.73 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5842. 701.73 s [vector] []
  5843. 701.73 s [vector] zip: OK
  5844. 701.73 s [vector] +++ OK, passed 100 tests.
  5845. 701.73 s [vector] zip3: OK
  5846. 701.73 s [vector] +++ OK, passed 100 tests.
  5847. 701.73 s [vector] unzip: OK
  5848. 701.73 s [vector] +++ OK, passed 100 tests.
  5849. 701.73 s [vector] unzip3: OK
  5850. 701.73 s [vector] +++ OK, passed 100 tests.
  5851. 701.73 s [vector] indexed: OK
  5852. 701.73 s [vector] +++ OK, passed 100 tests.
  5853. 701.74 s [vector] update: OK
  5854. 701.74 s [vector] +++ OK, passed 100 tests.
  5855. 701.75 s [vector] concat: OK (0.01s)
  5856. 701.75 s [vector] +++ OK, passed 100 tests.
  5857. 701.75 s [vector] mempty: OK
  5858. 701.75 s [vector] +++ OK, passed 100 tests.
  5859. 701.75 s [vector] mappend: OK
  5860. 701.75 s [vector] +++ OK, passed 100 tests.
  5861. 701.76 s [vector] mconcat: OK (0.01s)
  5862. 701.76 s [vector] +++ OK, passed 100 tests.
  5863. 701.76 s [vector] fmap: OK
  5864. 701.78 s [vector] +++ OK, passed 100 tests.
  5865. 701.78 s [vector] return: OK
  5866. 701.78 s [vector] +++ OK, passed 100 tests.
  5867. 701.78 s [vector] bind: OK (0.02s)
  5868. 701.78 s [vector] +++ OK, passed 100 tests.
  5869. 701.80 s [vector] mzip: OK
  5870. 701.80 s [vector] +++ OK, passed 100 tests.
  5871. 701.80 s [vector] munzip: OK
  5872. 701.80 s [vector] +++ OK, passed 100 tests.
  5873. 701.80 s [vector] applicative_pure: OK
  5874. 701.80 s [vector] +++ OK, passed 100 tests.
  5875. 701.81 s [vector] applicative_appl: OK (0.03s)
  5876. 701.81 s [vector] +++ OK, passed 100 tests.
  5877. 701.81 s [vector] alternative_empty: OK
  5878. 701.81 s [vector] +++ OK, passed 100 tests.
  5879. 701.82 s [vector] alternative_or: OK
  5880. 701.82 s [vector] +++ OK, passed 100 tests.
  5881. 701.86 s [vector] sequence: OK (0.05s)
  5882. 701.86 s [vector] +++ OK, passed 100 tests.
  5883. 701.87 s [vector] sequence_: OK (0.01s)
  5884. 701.87 s [vector] +++ OK, passed 100 tests.
  5885. 701.87 s [vector] glength: OK
  5886. 701.87 s [vector] +++ OK, passed 100 tests.
  5887. 701.87 s [vector] sum: OK
  5888. 701.87 s [vector] +++ OK, passed 100 tests.
  5889. 701.87 s [vector] product: OK
  5890. 701.87 s [vector] +++ OK, passed 100 tests.
  5891. 701.87 s [vector] enumFromN: OK
  5892. 701.87 s [vector] +++ OK, passed 100 tests.
  5893. 701.87 s [vector] enumFromThenN: OK
  5894. 701.87 s [vector] +++ OK, passed 100 tests.
  5895. 701.87 s [vector] enumFromTo: OK
  5896. 701.87 s [vector] +++ OK, passed 100 tests.
  5897. 701.87 s [vector] enumFromThenTo: OK
  5898. 701.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5899. 701.87 s [vector] unstream
  5900. 701.88 s [vector] unstream == vunstream (exact): OK
  5901. 701.88 s [vector] +++ OK, passed 100 tests.
  5902. 701.88 s [vector] unstream == vunstream (unknown): OK
  5903. 701.88 s [vector] +++ OK, passed 100 tests.
  5904. 701.88 s [vector] unstreamR ~= vunstream (exact): OK
  5905. 701.88 s [vector] +++ OK, passed 100 tests.
  5906. 701.88 s [vector] unstreamR ~= vunstream (unknown): OK
  5907. 701.88 s [vector] +++ OK, passed 100 tests.
  5908. 701.88 s [vector] Tests.Vector.Unboxed
  5909. 701.88 s [vector] ()
  5910. 701.88 s [vector] fromList.toList == id: OK
  5911. 701.88 s [vector] +++ OK, passed 100 tests.
  5912. 701.88 s [vector] toList.fromList == id: OK
  5913. 701.88 s [vector] +++ OK, passed 100 tests.
  5914. 701.88 s [vector] unstream.stream == id: OK
  5915. 701.88 s [vector] +++ OK, passed 100 tests.
  5916. 701.89 s [vector] stream.unstream == id: OK
  5917. 701.89 s [vector] +++ OK, passed 100 tests.
  5918. 701.89 s [vector] eq: OK
  5919. 701.89 s [vector] +++ OK, passed 100 tests.
  5920. 701.89 s [vector] length: OK
  5921. 701.89 s [vector] +++ OK, passed 100 tests.
  5922. 701.89 s [vector] null: OK
  5923. 701.89 s [vector] +++ OK, passed 100 tests.
  5924. 701.89 s [vector] index: OK
  5925. 701.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5926. 701.89 s [vector] safeIndex: OK
  5927. 701.89 s [vector] +++ OK, passed 100 tests.
  5928. 701.89 s [vector] head: OK
  5929. 701.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5930. 701.89 s [vector] last: OK
  5931. 701.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5932. 701.89 s [vector] unsafeIndex: OK
  5933. 701.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5934. 701.89 s [vector] unsafeHead: OK
  5935. 701.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5936. 701.89 s [vector] unsafeLast: OK
  5937. 701.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5938. 701.89 s [vector] slice: OK
  5939. 701.89 s [vector] +++ OK, passed 100 tests.
  5940. 701.89 s [vector] init: OK
  5941. 701.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5942. 701.89 s [vector] tail: OK
  5943. 701.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5944. 701.90 s [vector] take: OK
  5945. 701.90 s [vector] +++ OK, passed 100 tests.
  5946. 701.90 s [vector] drop: OK
  5947. 701.90 s [vector] +++ OK, passed 100 tests.
  5948. 701.90 s [vector] splitAt: OK
  5949. 701.90 s [vector] +++ OK, passed 100 tests.
  5950. 701.90 s [vector] empty: OK
  5951. 701.90 s [vector] +++ OK, passed 100 tests.
  5952. 701.90 s [vector] singleton: OK
  5953. 701.90 s [vector] +++ OK, passed 100 tests.
  5954. 701.90 s [vector] replicate: OK
  5955. 701.90 s [vector] +++ OK, passed 100 tests.
  5956. 701.90 s [vector] generate: OK
  5957. 701.90 s [vector] +++ OK, passed 100 tests.
  5958. 701.92 s [vector] iterateN: OK
  5959. 701.92 s [vector] +++ OK, passed 100 tests.
  5960. 702.00 s [vector] iterateNM: OK (0.09s)
  5961. 702.00 s [vector] +++ OK, passed 100 tests.
  5962. 702.02 s [vector] generateM: OK (0.02s)
  5963. 702.02 s [vector] +++ OK, passed 100 tests.
  5964. 702.02 s [vector] replicateM: OK (0.01s)
  5965. 702.02 s [vector] +++ OK, passed 100 tests.
  5966. 702.02 s [vector] create: OK
  5967. 702.02 s [vector] +++ OK, passed 100 tests.
  5968. 702.03 s [vector] createT: OK
  5969. 702.03 s [vector] +++ OK, passed 100 tests.
  5970. 702.04 s [vector] unfoldr: OK
  5971. 702.04 s [vector] +++ OK, passed 100 tests.
  5972. 702.04 s [vector] unfoldrN: OK
  5973. 702.04 s [vector] +++ OK, passed 100 tests.
  5974. 702.04 s [vector] unfoldrExactN: OK
  5975. 702.04 s [vector] +++ OK, passed 100 tests.
  5976. 702.04 s [vector] unfoldrM: OK
  5977. 702.04 s [vector] +++ OK, passed 100 tests.
  5978. 702.04 s [vector] unfoldrNM: OK
  5979. 702.04 s [vector] +++ OK, passed 100 tests.
  5980. 702.09 s [vector] unfoldrExactNM: OK (0.05s)
  5981. 702.09 s [vector] +++ OK, passed 100 tests.
  5982. 702.09 s [vector] constructN: OK
  5983. 702.09 s [vector] +++ OK, passed 100 tests.
  5984. 702.09 s [vector] constructrN: OK
  5985. 702.09 s [vector] +++ OK, passed 100 tests.
  5986. 702.09 s [vector] cons: OK
  5987. 702.10 s [vector] +++ OK, passed 100 tests.
  5988. 702.10 s [vector] snoc: OK
  5989. 702.10 s [vector] +++ OK, passed 100 tests.
  5990. 702.10 s [vector] append: OK
  5991. 702.10 s [vector] +++ OK, passed 100 tests.
  5992. 702.10 s [vector] concat: OK (0.01s)
  5993. 702.11 s [vector] +++ OK, passed 100 tests.
  5994. 702.11 s [vector] force: OK
  5995. 702.11 s [vector] +++ OK, passed 100 tests.
  5996. 702.11 s [vector] upd: OK
  5997. 702.11 s [vector] +++ OK, passed 100 tests.
  5998. 702.11 s [vector] accum: OK
  5999. 702.12 s [vector] +++ OK, passed 100 tests.
  6000. 702.12 s [vector] reverse: OK
  6001. 702.12 s [vector] +++ OK, passed 100 tests.
  6002. 702.12 s [vector] backpermute: OK
  6003. 702.12 s [vector] +++ OK, passed 100 tests.
  6004. 702.12 s [vector] map: OK
  6005. 702.12 s [vector] +++ OK, passed 100 tests.
  6006. 702.12 s [vector] imap: OK
  6007. 702.12 s [vector] +++ OK, passed 100 tests.
  6008. 702.14 s [vector] concatMap: OK
  6009. 702.14 s [vector] +++ OK, passed 100 tests.
  6010. 702.14 s [vector] mapM: OK
  6011. 702.14 s [vector] +++ OK, passed 100 tests.
  6012. 702.14 s [vector] mapM_: OK
  6013. 702.14 s [vector] +++ OK, passed 100 tests.
  6014. 702.14 s [vector] forM: OK
  6015. 702.14 s [vector] +++ OK, passed 100 tests.
  6016. 702.14 s [vector] forM_: OK (0.01s)
  6017. 702.15 s [vector] +++ OK, passed 100 tests.
  6018. 702.15 s [vector] imapM: OK
  6019. 702.15 s [vector] +++ OK, passed 100 tests.
  6020. 702.15 s [vector] imapM_: OK (0.01s)
  6021. 702.15 s [vector] +++ OK, passed 100 tests.
  6022. 702.15 s [vector] zipWith: OK
  6023. 702.15 s [vector] +++ OK, passed 100 tests.
  6024. 702.15 s [vector] zipWith3: OK
  6025. 702.15 s [vector] +++ OK, passed 100 tests.
  6026. 702.16 s [vector] izipWith: OK
  6027. 702.16 s [vector] +++ OK, passed 100 tests.
  6028. 702.16 s [vector] izipWith3: OK
  6029. 702.16 s [vector] +++ OK, passed 100 tests.
  6030. 702.16 s [vector] izipWithM: OK
  6031. 702.16 s [vector] +++ OK, passed 100 tests.
  6032. 702.16 s [vector] izipWithM_: OK
  6033. 702.16 s [vector] +++ OK, passed 100 tests.
  6034. 702.16 s [vector] zipWithM: OK
  6035. 702.16 s [vector] +++ OK, passed 100 tests.
  6036. 702.17 s [vector] zipWithM_: OK
  6037. 702.17 s [vector] +++ OK, passed 100 tests.
  6038. 702.17 s [vector] filter: OK
  6039. 702.17 s [vector] +++ OK, passed 100 tests.
  6040. 702.17 s [vector] ifilter: OK
  6041. 702.18 s [vector] +++ OK, passed 100 tests.
  6042. 702.20 s [vector] filterM: OK (0.02s)
  6043. 702.20 s [vector] +++ OK, passed 100 tests.
  6044. 702.20 s [vector] uniq: OK
  6045. 702.20 s [vector] +++ OK, passed 100 tests.
  6046. 702.20 s [vector] mapMaybe: OK
  6047. 702.21 s [vector] +++ OK, passed 100 tests.
  6048. 702.21 s [vector] imapMaybe: OK
  6049. 702.21 s [vector] +++ OK, passed 100 tests.
  6050. 702.21 s [vector] takeWhile: OK
  6051. 702.21 s [vector] +++ OK, passed 100 tests.
  6052. 702.21 s [vector] dropWhile: OK
  6053. 702.21 s [vector] +++ OK, passed 100 tests.
  6054. 702.21 s [vector] partition: OK
  6055. 702.21 s [vector] +++ OK, passed 100 tests.
  6056. 702.21 s [vector] partitionWith: OK
  6057. 702.21 s [vector] +++ OK, passed 100 tests.
  6058. 702.21 s [vector] span: OK
  6059. 702.21 s [vector] +++ OK, passed 100 tests.
  6060. 702.21 s [vector] break: OK
  6061. 702.21 s [vector] +++ OK, passed 100 tests.
  6062. 702.21 s [vector] spanR: OK
  6063. 702.21 s [vector] +++ OK, passed 100 tests.
  6064. 702.21 s [vector] breakR: OK
  6065. 702.21 s [vector] +++ OK, passed 100 tests.
  6066. 702.21 s [vector] groupBy: OK
  6067. 702.21 s [vector] +++ OK, passed 100 tests.
  6068. 702.21 s [vector] elem: OK
  6069. 702.21 s [vector] +++ OK, passed 100 tests.
  6070. 702.21 s [vector] notElem: OK
  6071. 702.21 s [vector] +++ OK, passed 100 tests.
  6072. 702.21 s [vector] find: OK
  6073. 702.21 s [vector] +++ OK, passed 100 tests.
  6074. 702.21 s [vector] findIndex: OK
  6075. 702.21 s [vector] +++ OK, passed 100 tests.
  6076. 702.22 s [vector] findIndexR: OK
  6077. 702.22 s [vector] +++ OK, passed 100 tests.
  6078. 702.22 s [vector] findIndices: OK
  6079. 702.22 s [vector] +++ OK, passed 100 tests.
  6080. 702.22 s [vector] elemIndex: OK
  6081. 702.22 s [vector] +++ OK, passed 100 tests.
  6082. 702.22 s [vector] elemIndices: OK
  6083. 702.22 s [vector] +++ OK, passed 100 tests.
  6084. 702.22 s [vector] foldl: OK
  6085. 702.22 s [vector] +++ OK, passed 100 tests.
  6086. 702.22 s [vector] foldl1: OK
  6087. 702.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6088. 702.22 s [vector] foldl': OK
  6089. 702.22 s [vector] +++ OK, passed 100 tests.
  6090. 702.22 s [vector] foldl1': OK
  6091. 702.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6092. 702.22 s [vector] foldr: OK
  6093. 702.22 s [vector] +++ OK, passed 100 tests.
  6094. 702.22 s [vector] foldr1: OK
  6095. 702.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6096. 702.22 s [vector] foldr': OK
  6097. 702.22 s [vector] +++ OK, passed 100 tests.
  6098. 702.22 s [vector] foldr1': OK
  6099. 702.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6100. 702.22 s [vector] ifoldl: OK
  6101. 702.22 s [vector] +++ OK, passed 100 tests.
  6102. 702.22 s [vector] ifoldl': OK
  6103. 702.22 s [vector] +++ OK, passed 100 tests.
  6104. 702.22 s [vector] ifoldr: OK
  6105. 702.22 s [vector] +++ OK, passed 100 tests.
  6106. 702.23 s [vector] ifoldr': OK
  6107. 702.23 s [vector] +++ OK, passed 100 tests.
  6108. 702.23 s [vector] ifoldM: OK
  6109. 702.23 s [vector] +++ OK, passed 100 tests.
  6110. 702.24 s [vector] ifoldM': OK
  6111. 702.24 s [vector] +++ OK, passed 100 tests.
  6112. 702.25 s [vector] ifoldM_: OK (0.01s)
  6113. 702.25 s [vector] +++ OK, passed 100 tests.
  6114. 702.25 s [vector] ifoldM'_: OK (0.01s)
  6115. 702.25 s [vector] +++ OK, passed 100 tests.
  6116. 702.25 s [vector] all: OK
  6117. 702.25 s [vector] +++ OK, passed 100 tests.
  6118. 702.25 s [vector] any: OK
  6119. 702.25 s [vector] +++ OK, passed 100 tests.
  6120. 702.25 s [vector] prescanl: OK
  6121. 702.25 s [vector] +++ OK, passed 100 tests.
  6122. 702.25 s [vector] prescanl': OK
  6123. 702.26 s [vector] +++ OK, passed 100 tests.
  6124. 702.26 s [vector] postscanl: OK
  6125. 702.26 s [vector] +++ OK, passed 100 tests.
  6126. 702.26 s [vector] postscanl': OK
  6127. 702.26 s [vector] +++ OK, passed 100 tests.
  6128. 702.26 s [vector] scanl: OK
  6129. 702.26 s [vector] +++ OK, passed 100 tests.
  6130. 702.26 s [vector] scanl': OK
  6131. 702.26 s [vector] +++ OK, passed 100 tests.
  6132. 702.26 s [vector] scanl1: OK
  6133. 702.26 s [vector] +++ OK, passed 100 tests.
  6134. 702.27 s [vector] scanl1': OK
  6135. 702.27 s [vector] +++ OK, passed 100 tests.
  6136. 702.27 s [vector] iscanl: OK
  6137. 702.27 s [vector] +++ OK, passed 100 tests.
  6138. 702.27 s [vector] iscanl': OK
  6139. 702.27 s [vector] +++ OK, passed 100 tests.
  6140. 702.27 s [vector] prescanr: OK
  6141. 702.27 s [vector] +++ OK, passed 100 tests.
  6142. 702.27 s [vector] prescanr': OK
  6143. 702.27 s [vector] +++ OK, passed 100 tests.
  6144. 702.27 s [vector] postscanr: OK
  6145. 702.27 s [vector] +++ OK, passed 100 tests.
  6146. 702.27 s [vector] postscanr': OK
  6147. 702.27 s [vector] +++ OK, passed 100 tests.
  6148. 702.27 s [vector] scanr: OK
  6149. 702.27 s [vector] +++ OK, passed 100 tests.
  6150. 702.27 s [vector] scanr': OK
  6151. 702.27 s [vector] +++ OK, passed 100 tests.
  6152. 702.28 s [vector] scanr1: OK
  6153. 702.28 s [vector] +++ OK, passed 100 tests.
  6154. 702.28 s [vector] scanr1': OK
  6155. 702.28 s [vector] +++ OK, passed 100 tests.
  6156. 702.28 s [vector] iscanr: OK
  6157. 702.28 s [vector] +++ OK, passed 100 tests.
  6158. 702.28 s [vector] iscanr': OK
  6159. 702.28 s [vector] +++ OK, passed 100 tests.
  6160. 702.28 s [vector] mut_read: OK
  6161. 702.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6162. 702.28 s [vector] mut_write: OK
  6163. 702.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6164. 702.28 s [vector] mut_modify: OK
  6165. 702.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6166. 702.28 s [vector] mut_generate: OK
  6167. 702.28 s [vector] +++ OK, passed 100 tests.
  6168. 702.29 s [vector] mut_generateM: OK
  6169. 702.29 s [vector] +++ OK, passed 100 tests.
  6170. 702.30 s [vector] mut_mapM_: OK
  6171. 702.30 s [vector] +++ OK, passed 100 tests.
  6172. 702.32 s [vector] mut_imapM_: OK (0.01s)
  6173. 702.32 s [vector] +++ OK, passed 100 tests.
  6174. 702.34 s [vector] mut_forM_: OK (0.01s)
  6175. 702.34 s [vector] +++ OK, passed 100 tests.
  6176. 702.34 s [vector] mut_iforM_: OK (0.01s)
  6177. 702.34 s [vector] +++ OK, passed 100 tests.
  6178. 702.34 s [vector] mut_foldr: OK
  6179. 702.34 s [vector] +++ OK, passed 100 tests.
  6180. 702.34 s [vector] mut_foldr': OK
  6181. 702.34 s [vector] +++ OK, passed 100 tests.
  6182. 702.34 s [vector] mut_foldl: OK
  6183. 702.34 s [vector] +++ OK, passed 100 tests.
  6184. 702.34 s [vector] mut_foldl': OK
  6185. 702.34 s [vector] +++ OK, passed 100 tests.
  6186. 702.34 s [vector] mut_ifoldr: OK
  6187. 702.34 s [vector] +++ OK, passed 100 tests.
  6188. 702.34 s [vector] mut_ifoldr': OK
  6189. 702.34 s [vector] +++ OK, passed 100 tests.
  6190. 702.34 s [vector] mut_ifoldl: OK
  6191. 702.34 s [vector] +++ OK, passed 100 tests.
  6192. 702.34 s [vector] mut_ifoldl': OK
  6193. 702.34 s [vector] +++ OK, passed 100 tests.
  6194. 702.34 s [vector] mut_foldM: OK
  6195. 702.34 s [vector] +++ OK, passed 100 tests.
  6196. 702.34 s [vector] mut_foldM': OK
  6197. 702.34 s [vector] +++ OK, passed 100 tests.
  6198. 702.35 s [vector] mut_foldrM: OK
  6199. 702.35 s [vector] +++ OK, passed 100 tests.
  6200. 702.35 s [vector] mut_foldrM': OK
  6201. 702.35 s [vector] +++ OK, passed 100 tests.
  6202. 702.35 s [vector] mut_ifoldM: OK
  6203. 702.35 s [vector] +++ OK, passed 100 tests.
  6204. 702.35 s [vector] mut_ifoldM': OK
  6205. 702.35 s [vector] +++ OK, passed 100 tests.
  6206. 702.35 s [vector] mut_ifoldrM: OK
  6207. 702.35 s [vector] +++ OK, passed 100 tests.
  6208. 702.35 s [vector] mut_ifoldrM': OK
  6209. 702.35 s [vector] +++ OK, passed 100 tests.
  6210. 702.35 s [vector] compare: OK
  6211. 702.35 s [vector] +++ OK, passed 100 tests.
  6212. 702.35 s [vector] maximum: OK
  6213. 702.35 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6214. 702.35 s [vector] minimum: OK
  6215. 702.35 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6216. 702.35 s [vector] minIndex: OK
  6217. 702.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6218. 702.35 s [vector] maxIndex: OK
  6219. 702.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6220. 702.35 s [vector] maximumBy: OK
  6221. 702.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6222. 702.35 s [vector] minimumBy: OK
  6223. 702.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6224. 702.35 s [vector] maximumOn: OK
  6225. 702.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6226. 702.35 s [vector] minimumOn: OK
  6227. 702.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6228. 702.35 s [vector] maxIndexBy: OK
  6229. 702.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6230. 702.36 s [vector] minIndexBy: OK
  6231. 702.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6232. 702.36 s [vector] ListFirstMaxIndexWins: OK
  6233. 702.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6234. 702.36 s [vector] FalseListFirstMaxIndexWins: OK
  6235. 702.36 s [vector] +++ OK, failed as expected. (after 1 test):
  6236. 702.36 s [vector] Exception:
  6237. 702.36 s [vector] Prelude.foldr1: empty list
  6238. 702.36 s [vector] CallStack (from HasCallStack):
  6239. 702.36 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6240. 702.36 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6241. 702.36 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6242. 702.36 s [vector] []
  6243. 702.36 s [vector] zip: OK
  6244. 702.36 s [vector] +++ OK, passed 100 tests.
  6245. 702.36 s [vector] zip3: OK
  6246. 702.36 s [vector] +++ OK, passed 100 tests.
  6247. 702.36 s [vector] unzip: OK
  6248. 702.36 s [vector] +++ OK, passed 100 tests.
  6249. 702.36 s [vector] unzip3: OK
  6250. 702.36 s [vector] +++ OK, passed 100 tests.
  6251. 702.36 s [vector] indexed: OK
  6252. 702.36 s [vector] +++ OK, passed 100 tests.
  6253. 702.37 s [vector] update: OK
  6254. 702.37 s [vector] +++ OK, passed 100 tests.
  6255. 702.37 s [vector] mempty: OK
  6256. 702.38 s [vector] +++ OK, passed 100 tests.
  6257. 702.38 s [vector] mappend: OK
  6258. 702.38 s [vector] +++ OK, passed 100 tests.
  6259. 702.38 s [vector] mconcat: OK (0.01s)
  6260. 702.38 s [vector] +++ OK, passed 100 tests.
  6261. 702.38 s [vector] glength: OK
  6262. 702.38 s [vector] +++ OK, passed 100 tests.
  6263. 702.38 s [vector] (Bool)
  6264. 702.38 s [vector] fromList.toList == id: OK
  6265. 702.38 s [vector] +++ OK, passed 100 tests.
  6266. 702.38 s [vector] toList.fromList == id: OK
  6267. 702.38 s [vector] +++ OK, passed 100 tests.
  6268. 702.38 s [vector] unstream.stream == id: OK
  6269. 702.39 s [vector] +++ OK, passed 100 tests.
  6270. 702.39 s [vector] stream.unstream == id: OK
  6271. 702.39 s [vector] +++ OK, passed 100 tests.
  6272. 702.39 s [vector] eq: OK
  6273. 702.39 s [vector] +++ OK, passed 100 tests.
  6274. 702.39 s [vector] length: OK
  6275. 702.39 s [vector] +++ OK, passed 100 tests.
  6276. 702.39 s [vector] null: OK
  6277. 702.39 s [vector] +++ OK, passed 100 tests.
  6278. 702.39 s [vector] index: OK
  6279. 702.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6280. 702.39 s [vector] safeIndex: OK
  6281. 702.39 s [vector] +++ OK, passed 100 tests.
  6282. 702.39 s [vector] head: OK
  6283. 702.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6284. 702.39 s [vector] last: OK
  6285. 702.39 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6286. 702.39 s [vector] unsafeIndex: OK
  6287. 702.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6288. 702.39 s [vector] unsafeHead: OK
  6289. 702.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6290. 702.39 s [vector] unsafeLast: OK
  6291. 702.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6292. 702.40 s [vector] slice: OK
  6293. 702.40 s [vector] +++ OK, passed 100 tests.
  6294. 702.40 s [vector] init: OK
  6295. 702.40 s [vector] +++ OK, passed 100 tests; 25 discarded.
  6296. 702.40 s [vector] tail: OK
  6297. 702.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6298. 702.40 s [vector] take: OK
  6299. 702.40 s [vector] +++ OK, passed 100 tests.
  6300. 702.40 s [vector] drop: OK
  6301. 702.40 s [vector] +++ OK, passed 100 tests.
  6302. 702.40 s [vector] splitAt: OK
  6303. 702.40 s [vector] +++ OK, passed 100 tests.
  6304. 702.40 s [vector] empty: OK
  6305. 702.40 s [vector] +++ OK, passed 100 tests.
  6306. 702.40 s [vector] singleton: OK
  6307. 702.40 s [vector] +++ OK, passed 100 tests.
  6308. 702.40 s [vector] replicate: OK
  6309. 702.40 s [vector] +++ OK, passed 100 tests.
  6310. 702.40 s [vector] generate: OK
  6311. 702.40 s [vector] +++ OK, passed 100 tests.
  6312. 702.40 s [vector] iterateN: OK
  6313. 702.42 s [vector] +++ OK, passed 100 tests.
  6314. 702.44 s [vector] iterateNM: OK (0.03s)
  6315. 702.44 s [vector] +++ OK, passed 100 tests.
  6316. 702.46 s [vector] generateM: OK (0.02s)
  6317. 702.46 s [vector] +++ OK, passed 100 tests.
  6318. 702.47 s [vector] replicateM: OK (0.02s)
  6319. 702.47 s [vector] +++ OK, passed 100 tests.
  6320. 702.47 s [vector] create: OK
  6321. 702.47 s [vector] +++ OK, passed 100 tests.
  6322. 702.48 s [vector] createT: OK
  6323. 702.48 s [vector] +++ OK, passed 100 tests.
  6324. 702.48 s [vector] unfoldr: OK
  6325. 702.48 s [vector] +++ OK, passed 100 tests.
  6326. 702.49 s [vector] unfoldrN: OK
  6327. 702.50 s [vector] +++ OK, passed 100 tests.
  6328. 702.50 s [vector] unfoldrExactN: OK
  6329. 702.50 s [vector] +++ OK, passed 100 tests.
  6330. 702.50 s [vector] unfoldrM: OK
  6331. 702.50 s [vector] +++ OK, passed 100 tests.
  6332. 702.50 s [vector] unfoldrNM: OK
  6333. 702.50 s [vector] +++ OK, passed 100 tests.
  6334. 702.55 s [vector] unfoldrExactNM: OK (0.06s)
  6335. 702.55 s [vector] +++ OK, passed 100 tests.
  6336. 702.55 s [vector] constructN: OK
  6337. 702.55 s [vector] +++ OK, passed 100 tests.
  6338. 702.55 s [vector] constructrN: OK
  6339. 702.55 s [vector] +++ OK, passed 100 tests.
  6340. 702.55 s [vector] cons: OK
  6341. 702.55 s [vector] +++ OK, passed 100 tests.
  6342. 702.55 s [vector] snoc: OK
  6343. 702.55 s [vector] +++ OK, passed 100 tests.
  6344. 702.55 s [vector] append: OK
  6345. 702.55 s [vector] +++ OK, passed 100 tests.
  6346. 702.57 s [vector] concat: OK (0.01s)
  6347. 702.57 s [vector] +++ OK, passed 100 tests.
  6348. 702.57 s [vector] force: OK
  6349. 702.57 s [vector] +++ OK, passed 100 tests.
  6350. 702.57 s [vector] upd: OK
  6351. 702.58 s [vector] +++ OK, passed 100 tests.
  6352. 702.58 s [vector] accum: OK
  6353. 702.58 s [vector] +++ OK, passed 100 tests.
  6354. 702.58 s [vector] reverse: OK
  6355. 702.58 s [vector] +++ OK, passed 100 tests.
  6356. 702.58 s [vector] backpermute: OK
  6357. 702.58 s [vector] +++ OK, passed 100 tests.
  6358. 702.58 s [vector] map: OK
  6359. 702.58 s [vector] +++ OK, passed 100 tests.
  6360. 702.58 s [vector] imap: OK
  6361. 702.58 s [vector] +++ OK, passed 100 tests.
  6362. 702.59 s [vector] concatMap: OK
  6363. 702.59 s [vector] +++ OK, passed 100 tests.
  6364. 702.60 s [vector] mapM: OK
  6365. 702.60 s [vector] +++ OK, passed 100 tests.
  6366. 702.60 s [vector] mapM_: OK
  6367. 702.60 s [vector] +++ OK, passed 100 tests.
  6368. 702.60 s [vector] forM: OK
  6369. 702.60 s [vector] +++ OK, passed 100 tests.
  6370. 702.61 s [vector] forM_: OK (0.01s)
  6371. 702.62 s [vector] +++ OK, passed 100 tests.
  6372. 702.62 s [vector] imapM: OK
  6373. 702.62 s [vector] +++ OK, passed 100 tests.
  6374. 702.63 s [vector] imapM_: OK (0.01s)
  6375. 702.63 s [vector] +++ OK, passed 100 tests.
  6376. 702.63 s [vector] zipWith: OK
  6377. 702.63 s [vector] +++ OK, passed 100 tests.
  6378. 702.63 s [vector] zipWith3: OK
  6379. 702.63 s [vector] +++ OK, passed 100 tests.
  6380. 702.63 s [vector] izipWith: OK
  6381. 702.63 s [vector] +++ OK, passed 100 tests.
  6382. 702.63 s [vector] izipWith3: OK
  6383. 702.63 s [vector] +++ OK, passed 100 tests.
  6384. 702.64 s [vector] izipWithM: OK
  6385. 702.64 s [vector] +++ OK, passed 100 tests.
  6386. 702.65 s [vector] izipWithM_: OK (0.02s)
  6387. 702.66 s [vector] +++ OK, passed 100 tests.
  6388. 702.66 s [vector] zipWithM: OK
  6389. 702.66 s [vector] +++ OK, passed 100 tests.
  6390. 702.66 s [vector] zipWithM_: OK
  6391. 702.66 s [vector] +++ OK, passed 100 tests.
  6392. 702.68 s [vector] filter: OK
  6393. 702.68 s [vector] +++ OK, passed 100 tests.
  6394. 702.68 s [vector] ifilter: OK
  6395. 702.68 s [vector] +++ OK, passed 100 tests.
  6396. 702.68 s [vector] filterM: OK (0.02s)
  6397. 702.68 s [vector] +++ OK, passed 100 tests.
  6398. 702.69 s [vector] uniq: OK
  6399. 702.69 s [vector] +++ OK, passed 100 tests.
  6400. 702.69 s [vector] mapMaybe: OK
  6401. 702.69 s [vector] +++ OK, passed 100 tests.
  6402. 702.69 s [vector] imapMaybe: OK
  6403. 702.69 s [vector] +++ OK, passed 100 tests.
  6404. 702.69 s [vector] takeWhile: OK
  6405. 702.69 s [vector] +++ OK, passed 100 tests.
  6406. 702.70 s [vector] dropWhile: OK
  6407. 702.70 s [vector] +++ OK, passed 100 tests.
  6408. 702.70 s [vector] partition: OK
  6409. 702.70 s [vector] +++ OK, passed 100 tests.
  6410. 702.70 s [vector] partitionWith: OK
  6411. 702.70 s [vector] +++ OK, passed 100 tests.
  6412. 702.70 s [vector] span: OK
  6413. 702.70 s [vector] +++ OK, passed 100 tests.
  6414. 702.70 s [vector] break: OK
  6415. 702.70 s [vector] +++ OK, passed 100 tests.
  6416. 702.70 s [vector] spanR: OK
  6417. 702.70 s [vector] +++ OK, passed 100 tests.
  6418. 702.70 s [vector] breakR: OK
  6419. 702.70 s [vector] +++ OK, passed 100 tests.
  6420. 702.70 s [vector] groupBy: OK
  6421. 702.70 s [vector] +++ OK, passed 100 tests.
  6422. 702.70 s [vector] elem: OK
  6423. 702.70 s [vector] +++ OK, passed 100 tests.
  6424. 702.70 s [vector] notElem: OK
  6425. 702.70 s [vector] +++ OK, passed 100 tests.
  6426. 702.70 s [vector] find: OK
  6427. 702.70 s [vector] +++ OK, passed 100 tests.
  6428. 702.71 s [vector] findIndex: OK
  6429. 702.71 s [vector] +++ OK, passed 100 tests.
  6430. 702.71 s [vector] findIndexR: OK
  6431. 702.71 s [vector] +++ OK, passed 100 tests.
  6432. 702.71 s [vector] findIndices: OK
  6433. 702.71 s [vector] +++ OK, passed 100 tests.
  6434. 702.71 s [vector] elemIndex: OK
  6435. 702.71 s [vector] +++ OK, passed 100 tests.
  6436. 702.71 s [vector] elemIndices: OK
  6437. 702.71 s [vector] +++ OK, passed 100 tests.
  6438. 702.71 s [vector] foldl: OK
  6439. 702.71 s [vector] +++ OK, passed 100 tests.
  6440. 702.71 s [vector] foldl1: OK
  6441. 702.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6442. 702.71 s [vector] foldl': OK
  6443. 702.71 s [vector] +++ OK, passed 100 tests.
  6444. 702.71 s [vector] foldl1': OK
  6445. 702.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6446. 702.71 s [vector] foldr: OK
  6447. 702.71 s [vector] +++ OK, passed 100 tests.
  6448. 702.71 s [vector] foldr1: OK
  6449. 702.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6450. 702.71 s [vector] foldr': OK
  6451. 702.71 s [vector] +++ OK, passed 100 tests.
  6452. 702.72 s [vector] foldr1': OK
  6453. 702.72 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6454. 702.72 s [vector] ifoldl: OK
  6455. 702.72 s [vector] +++ OK, passed 100 tests.
  6456. 702.73 s [vector] ifoldl': OK
  6457. 702.73 s [vector] +++ OK, passed 100 tests.
  6458. 702.74 s [vector] ifoldr: OK
  6459. 702.74 s [vector] +++ OK, passed 100 tests.
  6460. 702.74 s [vector] ifoldr': OK
  6461. 702.74 s [vector] +++ OK, passed 100 tests.
  6462. 702.74 s [vector] ifoldM: OK
  6463. 702.74 s [vector] +++ OK, passed 100 tests.
  6464. 702.74 s [vector] ifoldM': OK
  6465. 702.74 s [vector] +++ OK, passed 100 tests.
  6466. 702.74 s [vector] ifoldM_: OK (0.01s)
  6467. 702.75 s [vector] +++ OK, passed 100 tests.
  6468. 702.76 s [vector] ifoldM'_: OK (0.01s)
  6469. 702.76 s [vector] +++ OK, passed 100 tests.
  6470. 702.76 s [vector] all: OK
  6471. 702.76 s [vector] +++ OK, passed 100 tests.
  6472. 702.76 s [vector] any: OK
  6473. 702.76 s [vector] +++ OK, passed 100 tests.
  6474. 702.76 s [vector] prescanl: OK
  6475. 702.76 s [vector] +++ OK, passed 100 tests.
  6476. 702.76 s [vector] prescanl': OK
  6477. 702.76 s [vector] +++ OK, passed 100 tests.
  6478. 702.77 s [vector] postscanl: OK
  6479. 702.77 s [vector] +++ OK, passed 100 tests.
  6480. 702.77 s [vector] postscanl': OK
  6481. 702.77 s [vector] +++ OK, passed 100 tests.
  6482. 702.77 s [vector] scanl: OK
  6483. 702.77 s [vector] +++ OK, passed 100 tests.
  6484. 702.77 s [vector] scanl': OK
  6485. 702.77 s [vector] +++ OK, passed 100 tests.
  6486. 702.77 s [vector] scanl1: OK
  6487. 702.77 s [vector] +++ OK, passed 100 tests.
  6488. 702.77 s [vector] scanl1': OK
  6489. 702.77 s [vector] +++ OK, passed 100 tests.
  6490. 702.77 s [vector] iscanl: OK
  6491. 702.77 s [vector] +++ OK, passed 100 tests.
  6492. 702.78 s [vector] iscanl': OK
  6493. 702.78 s [vector] +++ OK, passed 100 tests.
  6494. 702.78 s [vector] prescanr: OK
  6495. 702.78 s [vector] +++ OK, passed 100 tests.
  6496. 702.79 s [vector] prescanr': OK
  6497. 702.79 s [vector] +++ OK, passed 100 tests.
  6498. 702.79 s [vector] postscanr: OK
  6499. 702.79 s [vector] +++ OK, passed 100 tests.
  6500. 702.79 s [vector] postscanr': OK
  6501. 702.79 s [vector] +++ OK, passed 100 tests.
  6502. 702.80 s [vector] scanr: OK
  6503. 702.80 s [vector] +++ OK, passed 100 tests.
  6504. 702.80 s [vector] scanr': OK
  6505. 702.80 s [vector] +++ OK, passed 100 tests.
  6506. 702.80 s [vector] scanr1: OK
  6507. 702.80 s [vector] +++ OK, passed 100 tests.
  6508. 702.80 s [vector] scanr1': OK
  6509. 702.80 s [vector] +++ OK, passed 100 tests.
  6510. 702.81 s [vector] iscanr: OK
  6511. 702.81 s [vector] +++ OK, passed 100 tests.
  6512. 702.81 s [vector] iscanr': OK
  6513. 702.81 s [vector] +++ OK, passed 100 tests.
  6514. 702.81 s [vector] mut_read: OK
  6515. 702.81 s [vector] +++ OK, passed 100 tests; 25 discarded.
  6516. 702.81 s [vector] mut_write: OK
  6517. 702.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6518. 702.81 s [vector] mut_modify: OK
  6519. 702.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6520. 702.81 s [vector] mut_generate: OK
  6521. 702.82 s [vector] +++ OK, passed 100 tests.
  6522. 702.82 s [vector] mut_generateM: OK
  6523. 702.82 s [vector] +++ OK, passed 100 tests.
  6524. 702.84 s [vector] mut_mapM_: OK
  6525. 702.84 s [vector] +++ OK, passed 100 tests.
  6526. 702.86 s [vector] mut_imapM_: OK (0.01s)
  6527. 702.86 s [vector] +++ OK, passed 100 tests.
  6528. 702.87 s [vector] mut_forM_: OK (0.01s)
  6529. 702.87 s [vector] +++ OK, passed 100 tests.
  6530. 702.88 s [vector] mut_iforM_: OK (0.01s)
  6531. 702.88 s [vector] +++ OK, passed 100 tests.
  6532. 702.88 s [vector] mut_foldr: OK
  6533. 702.88 s [vector] +++ OK, passed 100 tests.
  6534. 702.88 s [vector] mut_foldr': OK
  6535. 702.88 s [vector] +++ OK, passed 100 tests.
  6536. 702.88 s [vector] mut_foldl: OK
  6537. 702.88 s [vector] +++ OK, passed 100 tests.
  6538. 702.88 s [vector] mut_foldl': OK
  6539. 702.88 s [vector] +++ OK, passed 100 tests.
  6540. 702.89 s [vector] mut_ifoldr: OK
  6541. 702.89 s [vector] +++ OK, passed 100 tests.
  6542. 702.89 s [vector] mut_ifoldr': OK
  6543. 702.89 s [vector] +++ OK, passed 100 tests.
  6544. 702.89 s [vector] mut_ifoldl: OK
  6545. 702.89 s [vector] +++ OK, passed 100 tests.
  6546. 702.90 s [vector] mut_ifoldl': OK
  6547. 702.90 s [vector] +++ OK, passed 100 tests.
  6548. 702.90 s [vector] mut_foldM: OK
  6549. 702.90 s [vector] +++ OK, passed 100 tests.
  6550. 702.90 s [vector] mut_foldM': OK
  6551. 702.90 s [vector] +++ OK, passed 100 tests.
  6552. 702.90 s [vector] mut_foldrM: OK
  6553. 702.90 s [vector] +++ OK, passed 100 tests.
  6554. 702.90 s [vector] mut_foldrM': OK
  6555. 702.90 s [vector] +++ OK, passed 100 tests.
  6556. 702.91 s [vector] mut_ifoldM: OK
  6557. 702.91 s [vector] +++ OK, passed 100 tests.
  6558. 702.91 s [vector] mut_ifoldM': OK
  6559. 702.91 s [vector] +++ OK, passed 100 tests.
  6560. 702.91 s [vector] mut_ifoldrM: OK
  6561. 702.91 s [vector] +++ OK, passed 100 tests.
  6562. 702.91 s [vector] mut_ifoldrM': OK
  6563. 702.91 s [vector] +++ OK, passed 100 tests.
  6564. 702.91 s [vector] compare: OK
  6565. 702.91 s [vector] +++ OK, passed 100 tests.
  6566. 702.91 s [vector] maximum: OK
  6567. 702.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6568. 702.91 s [vector] minimum: OK
  6569. 702.91 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6570. 702.91 s [vector] minIndex: OK
  6571. 702.91 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6572. 702.91 s [vector] maxIndex: OK
  6573. 702.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6574. 702.91 s [vector] maximumBy: OK
  6575. 702.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6576. 702.91 s [vector] minimumBy: OK
  6577. 702.91 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6578. 702.92 s [vector] maximumOn: OK
  6579. 702.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6580. 702.92 s [vector] minimumOn: OK
  6581. 702.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6582. 702.92 s [vector] maxIndexBy: OK
  6583. 702.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6584. 702.92 s [vector] minIndexBy: OK
  6585. 702.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6586. 702.92 s [vector] ListFirstMaxIndexWins: OK
  6587. 702.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6588. 702.92 s [vector] FalseListFirstMaxIndexWins: OK
  6589. 702.92 s [vector] +++ OK, failed as expected. (after 1 test):
  6590. 702.92 s [vector] Exception:
  6591. 702.92 s [vector] Prelude.foldr1: empty list
  6592. 702.92 s [vector] CallStack (from HasCallStack):
  6593. 702.92 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6594. 702.92 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6595. 702.92 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6596. 702.92 s [vector] []
  6597. 702.92 s [vector] zip: OK
  6598. 702.92 s [vector] +++ OK, passed 100 tests.
  6599. 702.92 s [vector] zip3: OK
  6600. 702.92 s [vector] +++ OK, passed 100 tests.
  6601. 702.93 s [vector] unzip: OK
  6602. 702.93 s [vector] +++ OK, passed 100 tests.
  6603. 702.93 s [vector] unzip3: OK
  6604. 702.93 s [vector] +++ OK, passed 100 tests.
  6605. 702.93 s [vector] indexed: OK
  6606. 702.93 s [vector] +++ OK, passed 100 tests.
  6607. 702.93 s [vector] update: OK
  6608. 702.93 s [vector] +++ OK, passed 100 tests.
  6609. 702.93 s [vector] mempty: OK
  6610. 702.93 s [vector] +++ OK, passed 100 tests.
  6611. 702.94 s [vector] mappend: OK
  6612. 702.94 s [vector] +++ OK, passed 100 tests.
  6613. 702.95 s [vector] mconcat: OK (0.02s)
  6614. 702.95 s [vector] +++ OK, passed 100 tests.
  6615. 702.95 s [vector] glength: OK
  6616. 702.95 s [vector] +++ OK, passed 100 tests.
  6617. 702.95 s [vector] and: OK
  6618. 702.95 s [vector] +++ OK, passed 100 tests.
  6619. 702.96 s [vector] or: OK
  6620. 702.96 s [vector] +++ OK, passed 100 tests.
  6621. 702.96 s [vector] (Int)
  6622. 702.96 s [vector] fromList.toList == id: OK
  6623. 702.96 s [vector] +++ OK, passed 100 tests.
  6624. 702.96 s [vector] toList.fromList == id: OK
  6625. 702.96 s [vector] +++ OK, passed 100 tests.
  6626. 702.96 s [vector] unstream.stream == id: OK
  6627. 702.96 s [vector] +++ OK, passed 100 tests.
  6628. 702.96 s [vector] stream.unstream == id: OK
  6629. 702.96 s [vector] +++ OK, passed 100 tests.
  6630. 702.96 s [vector] eq: OK
  6631. 702.96 s [vector] +++ OK, passed 100 tests.
  6632. 702.97 s [vector] length: OK
  6633. 702.97 s [vector] +++ OK, passed 100 tests.
  6634. 702.97 s [vector] null: OK
  6635. 702.97 s [vector] +++ OK, passed 100 tests.
  6636. 702.97 s [vector] index: OK
  6637. 702.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6638. 702.98 s [vector] safeIndex: OK
  6639. 702.98 s [vector] +++ OK, passed 100 tests.
  6640. 702.98 s [vector] head: OK
  6641. 702.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6642. 702.98 s [vector] last: OK
  6643. 702.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6644. 702.98 s [vector] unsafeIndex: OK
  6645. 702.98 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6646. 702.98 s [vector] unsafeHead: OK
  6647. 702.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6648. 702.98 s [vector] unsafeLast: OK
  6649. 702.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6650. 702.98 s [vector] slice: OK
  6651. 702.98 s [vector] +++ OK, passed 100 tests.
  6652. 702.98 s [vector] init: OK
  6653. 702.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6654. 702.98 s [vector] tail: OK
  6655. 702.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6656. 702.98 s [vector] take: OK
  6657. 702.98 s [vector] +++ OK, passed 100 tests.
  6658. 702.98 s [vector] drop: OK
  6659. 702.98 s [vector] +++ OK, passed 100 tests.
  6660. 702.98 s [vector] splitAt: OK
  6661. 702.98 s [vector] +++ OK, passed 100 tests.
  6662. 702.98 s [vector] empty: OK
  6663. 702.98 s [vector] +++ OK, passed 100 tests.
  6664. 702.98 s [vector] singleton: OK
  6665. 702.98 s [vector] +++ OK, passed 100 tests.
  6666. 702.98 s [vector] replicate: OK
  6667. 702.98 s [vector] +++ OK, passed 100 tests.
  6668. 702.98 s [vector] generate: OK
  6669. 702.98 s [vector] +++ OK, passed 100 tests.
  6670. 702.98 s [vector] iterateN: OK
  6671. 702.98 s [vector] +++ OK, passed 100 tests.
  6672. 703.02 s [vector] iterateNM: OK (0.04s)
  6673. 703.02 s [vector] +++ OK, passed 100 tests.
  6674. 703.04 s [vector] generateM: OK (0.02s)
  6675. 703.04 s [vector] +++ OK, passed 100 tests.
  6676. 703.04 s [vector] replicateM: OK (0.02s)
  6677. 703.04 s [vector] +++ OK, passed 100 tests.
  6678. 703.04 s [vector] create: OK
  6679. 703.05 s [vector] +++ OK, passed 100 tests.
  6680. 703.05 s [vector] createT: OK
  6681. 703.06 s [vector] +++ OK, passed 100 tests.
  6682. 703.06 s [vector] unfoldr: OK
  6683. 703.06 s [vector] +++ OK, passed 100 tests.
  6684. 703.06 s [vector] unfoldrN: OK
  6685. 703.06 s [vector] +++ OK, passed 100 tests.
  6686. 703.06 s [vector] unfoldrExactN: OK
  6687. 703.06 s [vector] +++ OK, passed 100 tests.
  6688. 703.07 s [vector] unfoldrM: OK
  6689. 703.07 s [vector] +++ OK, passed 100 tests.
  6690. 703.07 s [vector] unfoldrNM: OK
  6691. 703.07 s [vector] +++ OK, passed 100 tests.
  6692. 703.09 s [vector] unfoldrExactNM: OK (0.04s)
  6693. 703.09 s [vector] +++ OK, passed 100 tests.
  6694. 703.09 s [vector] constructN: OK
  6695. 703.09 s [vector] +++ OK, passed 100 tests.
  6696. 703.09 s [vector] constructrN: OK
  6697. 703.09 s [vector] +++ OK, passed 100 tests.
  6698. 703.09 s [vector] cons: OK
  6699. 703.09 s [vector] +++ OK, passed 100 tests.
  6700. 703.10 s [vector] snoc: OK
  6701. 703.10 s [vector] +++ OK, passed 100 tests.
  6702. 703.10 s [vector] append: OK
  6703. 703.10 s [vector] +++ OK, passed 100 tests.
  6704. 703.11 s [vector] concat: OK (0.01s)
  6705. 703.11 s [vector] +++ OK, passed 100 tests.
  6706. 703.12 s [vector] force: OK
  6707. 703.12 s [vector] +++ OK, passed 100 tests.
  6708. 703.12 s [vector] upd: OK
  6709. 703.12 s [vector] +++ OK, passed 100 tests.
  6710. 703.13 s [vector] accum: OK
  6711. 703.13 s [vector] +++ OK, passed 100 tests.
  6712. 703.14 s [vector] reverse: OK
  6713. 703.14 s [vector] +++ OK, passed 100 tests.
  6714. 703.14 s [vector] backpermute: OK
  6715. 703.14 s [vector] +++ OK, passed 100 tests.
  6716. 703.14 s [vector] map: OK
  6717. 703.14 s [vector] +++ OK, passed 100 tests.
  6718. 703.14 s [vector] imap: OK
  6719. 703.15 s [vector] +++ OK, passed 100 tests.
  6720. 703.15 s [vector] concatMap: OK
  6721. 703.15 s [vector] +++ OK, passed 100 tests.
  6722. 703.15 s [vector] mapM: OK
  6723. 703.15 s [vector] +++ OK, passed 100 tests.
  6724. 703.15 s [vector] mapM_: OK (0.02s)
  6725. 703.16 s [vector] +++ OK, passed 100 tests.
  6726. 703.16 s [vector] forM: OK
  6727. 703.16 s [vector] +++ OK, passed 100 tests.
  6728. 703.17 s [vector] forM_: OK (0.02s)
  6729. 703.18 s [vector] +++ OK, passed 100 tests.
  6730. 703.18 s [vector] imapM: OK
  6731. 703.18 s [vector] +++ OK, passed 100 tests.
  6732. 703.19 s [vector] imapM_: OK (0.02s)
  6733. 703.19 s [vector] +++ OK, passed 100 tests.
  6734. 703.20 s [vector] zipWith: OK
  6735. 703.20 s [vector] +++ OK, passed 100 tests.
  6736. 703.20 s [vector] zipWith3: OK
  6737. 703.20 s [vector] +++ OK, passed 100 tests.
  6738. 703.22 s [vector] izipWith: OK
  6739. 703.22 s [vector] +++ OK, passed 100 tests.
  6740. 703.22 s [vector] izipWith3: OK
  6741. 703.23 s [vector] +++ OK, passed 100 tests.
  6742. 703.24 s [vector] izipWithM: OK
  6743. 703.24 s [vector] +++ OK, passed 100 tests.
  6744. 703.24 s [vector] izipWithM_: OK (0.01s)
  6745. 703.24 s [vector] +++ OK, passed 100 tests.
  6746. 703.24 s [vector] zipWithM: OK
  6747. 703.24 s [vector] +++ OK, passed 100 tests.
  6748. 703.24 s [vector] zipWithM_: OK (0.01s)
  6749. 703.24 s [vector] +++ OK, passed 100 tests.
  6750. 703.24 s [vector] filter: OK
  6751. 703.25 s [vector] +++ OK, passed 100 tests.
  6752. 703.25 s [vector] ifilter: OK
  6753. 703.25 s [vector] +++ OK, passed 100 tests.
  6754. 703.26 s [vector] filterM: OK (0.03s)
  6755. 703.26 s [vector] +++ OK, passed 100 tests.
  6756. 703.26 s [vector] uniq: OK
  6757. 703.26 s [vector] +++ OK, passed 100 tests.
  6758. 703.27 s [vector] mapMaybe: OK
  6759. 703.27 s [vector] +++ OK, passed 100 tests.
  6760. 703.27 s [vector] imapMaybe: OK
  6761. 703.27 s [vector] +++ OK, passed 100 tests.
  6762. 703.28 s [vector] takeWhile: OK
  6763. 703.28 s [vector] +++ OK, passed 100 tests.
  6764. 703.28 s [vector] dropWhile: OK
  6765. 703.28 s [vector] +++ OK, passed 100 tests.
  6766. 703.28 s [vector] partition: OK
  6767. 703.28 s [vector] +++ OK, passed 100 tests.
  6768. 703.28 s [vector] partitionWith: OK
  6769. 703.28 s [vector] +++ OK, passed 100 tests.
  6770. 703.28 s [vector] span: OK
  6771. 703.28 s [vector] +++ OK, passed 100 tests.
  6772. 703.28 s [vector] break: OK
  6773. 703.28 s [vector] +++ OK, passed 100 tests.
  6774. 703.28 s [vector] spanR: OK
  6775. 703.28 s [vector] +++ OK, passed 100 tests.
  6776. 703.29 s [vector] breakR: OK
  6777. 703.29 s [vector] +++ OK, passed 100 tests.
  6778. 703.29 s [vector] groupBy: OK
  6779. 703.30 s [vector] +++ OK, passed 100 tests.
  6780. 703.30 s [vector] elem: OK
  6781. 703.30 s [vector] +++ OK, passed 100 tests.
  6782. 703.30 s [vector] notElem: OK
  6783. 703.30 s [vector] +++ OK, passed 100 tests.
  6784. 703.30 s [vector] find: OK
  6785. 703.30 s [vector] +++ OK, passed 100 tests.
  6786. 703.30 s [vector] findIndex: OK
  6787. 703.30 s [vector] +++ OK, passed 100 tests.
  6788. 703.31 s [vector] findIndexR: OK
  6789. 703.31 s [vector] +++ OK, passed 100 tests.
  6790. 703.31 s [vector] findIndices: OK
  6791. 703.31 s [vector] +++ OK, passed 100 tests.
  6792. 703.31 s [vector] elemIndex: OK
  6793. 703.31 s [vector] +++ OK, passed 100 tests.
  6794. 703.31 s [vector] elemIndices: OK
  6795. 703.31 s [vector] +++ OK, passed 100 tests.
  6796. 703.31 s [vector] foldl: OK
  6797. 703.31 s [vector] +++ OK, passed 100 tests.
  6798. 703.31 s [vector] foldl1: OK
  6799. 703.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6800. 703.31 s [vector] foldl': OK
  6801. 703.31 s [vector] +++ OK, passed 100 tests.
  6802. 703.31 s [vector] foldl1': OK
  6803. 703.31 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6804. 703.31 s [vector] foldr: OK
  6805. 703.31 s [vector] +++ OK, passed 100 tests.
  6806. 703.31 s [vector] foldr1: OK
  6807. 703.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6808. 703.31 s [vector] foldr': OK
  6809. 703.31 s [vector] +++ OK, passed 100 tests.
  6810. 703.31 s [vector] foldr1': OK
  6811. 703.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6812. 703.31 s [vector] ifoldl: OK
  6813. 703.32 s [vector] +++ OK, passed 100 tests.
  6814. 703.32 s [vector] ifoldl': OK
  6815. 703.33 s [vector] +++ OK, passed 100 tests.
  6816. 703.34 s [vector] ifoldr: OK
  6817. 703.34 s [vector] +++ OK, passed 100 tests.
  6818. 703.34 s [vector] ifoldr': OK
  6819. 703.34 s [vector] +++ OK, passed 100 tests.
  6820. 703.34 s [vector] ifoldM: OK
  6821. 703.34 s [vector] +++ OK, passed 100 tests.
  6822. 703.34 s [vector] ifoldM': OK
  6823. 703.34 s [vector] +++ OK, passed 100 tests.
  6824. 703.36 s [vector] ifoldM_: OK (0.02s)
  6825. 703.36 s [vector] +++ OK, passed 100 tests.
  6826. 703.37 s [vector] ifoldM'_: OK (0.02s)
  6827. 703.37 s [vector] +++ OK, passed 100 tests.
  6828. 703.37 s [vector] all: OK
  6829. 703.38 s [vector] +++ OK, passed 100 tests.
  6830. 703.38 s [vector] any: OK
  6831. 703.38 s [vector] +++ OK, passed 100 tests.
  6832. 703.39 s [vector] prescanl: OK
  6833. 703.39 s [vector] +++ OK, passed 100 tests.
  6834. 703.39 s [vector] prescanl': OK
  6835. 703.39 s [vector] +++ OK, passed 100 tests.
  6836. 703.39 s [vector] postscanl: OK
  6837. 703.39 s [vector] +++ OK, passed 100 tests.
  6838. 703.40 s [vector] postscanl': OK
  6839. 703.40 s [vector] +++ OK, passed 100 tests.
  6840. 703.40 s [vector] scanl: OK
  6841. 703.40 s [vector] +++ OK, passed 100 tests.
  6842. 703.41 s [vector] scanl': OK
  6843. 703.41 s [vector] +++ OK, passed 100 tests.
  6844. 703.41 s [vector] scanl1: OK
  6845. 703.41 s [vector] +++ OK, passed 100 tests.
  6846. 703.42 s [vector] scanl1': OK
  6847. 703.42 s [vector] +++ OK, passed 100 tests.
  6848. 703.42 s [vector] iscanl: OK
  6849. 703.42 s [vector] +++ OK, passed 100 tests.
  6850. 703.42 s [vector] iscanl': OK
  6851. 703.43 s [vector] +++ OK, passed 100 tests.
  6852. 703.43 s [vector] prescanr: OK
  6853. 703.43 s [vector] +++ OK, passed 100 tests.
  6854. 703.43 s [vector] prescanr': OK
  6855. 703.43 s [vector] +++ OK, passed 100 tests.
  6856. 703.44 s [vector] postscanr: OK
  6857. 703.44 s [vector] +++ OK, passed 100 tests.
  6858. 703.44 s [vector] postscanr': OK
  6859. 703.44 s [vector] +++ OK, passed 100 tests.
  6860. 703.44 s [vector] scanr: OK
  6861. 703.44 s [vector] +++ OK, passed 100 tests.
  6862. 703.44 s [vector] scanr': OK
  6863. 703.44 s [vector] +++ OK, passed 100 tests.
  6864. 703.44 s [vector] scanr1: OK
  6865. 703.44 s [vector] +++ OK, passed 100 tests.
  6866. 703.44 s [vector] scanr1': OK
  6867. 703.44 s [vector] +++ OK, passed 100 tests.
  6868. 703.45 s [vector] iscanr: OK
  6869. 703.45 s [vector] +++ OK, passed 100 tests.
  6870. 703.45 s [vector] iscanr': OK
  6871. 703.45 s [vector] +++ OK, passed 100 tests.
  6872. 703.45 s [vector] mut_read: OK
  6873. 703.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6874. 703.45 s [vector] mut_write: OK
  6875. 703.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6876. 703.46 s [vector] mut_modify: OK
  6877. 703.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6878. 703.46 s [vector] mut_generate: OK
  6879. 703.46 s [vector] +++ OK, passed 100 tests.
  6880. 703.46 s [vector] mut_generateM: OK (0.01s)
  6881. 703.46 s [vector] +++ OK, passed 100 tests.
  6882. 703.48 s [vector] mut_mapM_: OK (0.02s)
  6883. 703.48 s [vector] +++ OK, passed 100 tests.
  6884. 703.48 s [vector] mut_imapM_: OK (0.02s)
  6885. 703.48 s [vector] +++ OK, passed 100 tests.
  6886. 703.51 s [vector] mut_forM_: OK
  6887. 703.52 s [vector] +++ OK, passed 100 tests.
  6888. 703.52 s [vector] mut_iforM_: OK (0.02s)
  6889. 703.52 s [vector] +++ OK, passed 100 tests.
  6890. 703.52 s [vector] mut_foldr: OK
  6891. 703.52 s [vector] +++ OK, passed 100 tests.
  6892. 703.52 s [vector] mut_foldr': OK
  6893. 703.52 s [vector] +++ OK, passed 100 tests.
  6894. 703.52 s [vector] mut_foldl: OK
  6895. 703.52 s [vector] +++ OK, passed 100 tests.
  6896. 703.52 s [vector] mut_foldl': OK
  6897. 703.52 s [vector] +++ OK, passed 100 tests.
  6898. 703.53 s [vector] mut_ifoldr: OK
  6899. 703.53 s [vector] +++ OK, passed 100 tests.
  6900. 703.53 s [vector] mut_ifoldr': OK
  6901. 703.53 s [vector] +++ OK, passed 100 tests.
  6902. 703.54 s [vector] mut_ifoldl: OK
  6903. 703.54 s [vector] +++ OK, passed 100 tests.
  6904. 703.54 s [vector] mut_ifoldl': OK
  6905. 703.54 s [vector] +++ OK, passed 100 tests.
  6906. 703.54 s [vector] mut_foldM: OK
  6907. 703.54 s [vector] +++ OK, passed 100 tests.
  6908. 703.55 s [vector] mut_foldM': OK
  6909. 703.55 s [vector] +++ OK, passed 100 tests.
  6910. 703.55 s [vector] mut_foldrM: OK
  6911. 703.55 s [vector] +++ OK, passed 100 tests.
  6912. 703.55 s [vector] mut_foldrM': OK
  6913. 703.56 s [vector] +++ OK, passed 100 tests.
  6914. 703.56 s [vector] mut_ifoldM: OK
  6915. 703.56 s [vector] +++ OK, passed 100 tests.
  6916. 703.56 s [vector] mut_ifoldM': OK
  6917. 703.56 s [vector] +++ OK, passed 100 tests.
  6918. 703.56 s [vector] mut_ifoldrM: OK
  6919. 703.56 s [vector] +++ OK, passed 100 tests.
  6920. 703.57 s [vector] mut_ifoldrM': OK
  6921. 703.57 s [vector] +++ OK, passed 100 tests.
  6922. 703.57 s [vector] compare: OK
  6923. 703.57 s [vector] +++ OK, passed 100 tests.
  6924. 703.57 s [vector] maximum: OK
  6925. 703.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6926. 703.57 s [vector] minimum: OK
  6927. 703.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6928. 703.57 s [vector] minIndex: OK
  6929. 703.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6930. 703.57 s [vector] maxIndex: OK
  6931. 703.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6932. 703.57 s [vector] maximumBy: OK
  6933. 703.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6934. 703.58 s [vector] minimumBy: OK
  6935. 703.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6936. 703.58 s [vector] maximumOn: OK
  6937. 703.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6938. 703.58 s [vector] minimumOn: OK
  6939. 703.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6940. 703.58 s [vector] maxIndexBy: OK
  6941. 703.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6942. 703.58 s [vector] minIndexBy: OK
  6943. 703.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6944. 703.58 s [vector] ListFirstMaxIndexWins: OK
  6945. 703.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6946. 703.59 s [vector] FalseListFirstMaxIndexWins: OK
  6947. 703.60 s [vector] +++ OK, failed as expected. (after 1 test):
  6948. 703.60 s [vector] Exception:
  6949. 703.60 s [vector] Prelude.foldr1: empty list
  6950. 703.60 s [vector] CallStack (from HasCallStack):
  6951. 703.60 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6952. 703.60 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6953. 703.60 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6954. 703.60 s [vector] []
  6955. 703.60 s [vector] zip: OK
  6956. 703.60 s [vector] +++ OK, passed 100 tests.
  6957. 703.60 s [vector] zip3: OK
  6958. 703.60 s [vector] +++ OK, passed 100 tests.
  6959. 703.60 s [vector] unzip: OK
  6960. 703.60 s [vector] +++ OK, passed 100 tests.
  6961. 703.60 s [vector] unzip3: OK
  6962. 703.60 s [vector] +++ OK, passed 100 tests.
  6963. 703.60 s [vector] indexed: OK
  6964. 703.60 s [vector] +++ OK, passed 100 tests.
  6965. 703.60 s [vector] update: OK
  6966. 703.60 s [vector] +++ OK, passed 100 tests.
  6967. 703.60 s [vector] mempty: OK
  6968. 703.60 s [vector] +++ OK, passed 100 tests.
  6969. 703.60 s [vector] mappend: OK
  6970. 703.60 s [vector] +++ OK, passed 100 tests.
  6971. 703.61 s [vector] mconcat: OK (0.02s)
  6972. 703.61 s [vector] +++ OK, passed 100 tests.
  6973. 703.61 s [vector] glength: OK
  6974. 703.61 s [vector] +++ OK, passed 100 tests.
  6975. 703.61 s [vector] sum: OK
  6976. 703.61 s [vector] +++ OK, passed 100 tests.
  6977. 703.61 s [vector] product: OK
  6978. 703.61 s [vector] +++ OK, passed 100 tests.
  6979. 703.61 s [vector] enumFromN: OK
  6980. 703.61 s [vector] +++ OK, passed 100 tests.
  6981. 703.61 s [vector] enumFromThenN: OK
  6982. 703.61 s [vector] +++ OK, passed 100 tests.
  6983. 703.61 s [vector] enumFromTo: OK
  6984. 703.61 s [vector] +++ OK, passed 100 tests.
  6985. 703.61 s [vector] enumFromThenTo: OK
  6986. 703.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6987. 703.61 s [vector] (Float)
  6988. 703.62 s [vector] fromList.toList == id: OK
  6989. 703.62 s [vector] +++ OK, passed 100 tests.
  6990. 703.62 s [vector] toList.fromList == id: OK
  6991. 703.62 s [vector] +++ OK, passed 100 tests.
  6992. 703.62 s [vector] unstream.stream == id: OK
  6993. 703.62 s [vector] +++ OK, passed 100 tests.
  6994. 703.62 s [vector] stream.unstream == id: OK
  6995. 703.62 s [vector] +++ OK, passed 100 tests.
  6996. 703.62 s [vector] eq: OK
  6997. 703.62 s [vector] +++ OK, passed 100 tests.
  6998. 703.62 s [vector] length: OK
  6999. 703.62 s [vector] +++ OK, passed 100 tests.
  7000. 703.62 s [vector] null: OK
  7001. 703.63 s [vector] +++ OK, passed 100 tests.
  7002. 703.63 s [vector] index: OK
  7003. 703.63 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7004. 703.63 s [vector] safeIndex: OK
  7005. 703.63 s [vector] +++ OK, passed 100 tests.
  7006. 703.63 s [vector] head: OK
  7007. 703.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7008. 703.63 s [vector] last: OK
  7009. 703.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7010. 703.63 s [vector] unsafeIndex: OK
  7011. 703.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7012. 703.63 s [vector] unsafeHead: OK
  7013. 703.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7014. 703.63 s [vector] unsafeLast: OK
  7015. 703.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7016. 703.63 s [vector] slice: OK
  7017. 703.63 s [vector] +++ OK, passed 100 tests.
  7018. 703.63 s [vector] init: OK
  7019. 703.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7020. 703.63 s [vector] tail: OK
  7021. 703.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7022. 703.63 s [vector] take: OK
  7023. 703.63 s [vector] +++ OK, passed 100 tests.
  7024. 703.63 s [vector] drop: OK
  7025. 703.63 s [vector] +++ OK, passed 100 tests.
  7026. 703.63 s [vector] splitAt: OK
  7027. 703.63 s [vector] +++ OK, passed 100 tests.
  7028. 703.63 s [vector] empty: OK
  7029. 703.63 s [vector] +++ OK, passed 100 tests.
  7030. 703.63 s [vector] singleton: OK
  7031. 703.63 s [vector] +++ OK, passed 100 tests.
  7032. 703.63 s [vector] replicate: OK
  7033. 703.63 s [vector] +++ OK, passed 100 tests.
  7034. 703.63 s [vector] generate: OK
  7035. 703.63 s [vector] +++ OK, passed 100 tests.
  7036. 703.64 s [vector] iterateN: OK
  7037. 703.64 s [vector] +++ OK, passed 100 tests.
  7038. 703.68 s [vector] iterateNM: OK (0.04s)
  7039. 703.68 s [vector] +++ OK, passed 100 tests.
  7040. 703.72 s [vector] generateM: OK (0.03s)
  7041. 703.72 s [vector] +++ OK, passed 100 tests.
  7042. 703.72 s [vector] replicateM: OK (0.01s)
  7043. 703.72 s [vector] +++ OK, passed 100 tests.
  7044. 703.72 s [vector] create: OK
  7045. 703.72 s [vector] +++ OK, passed 100 tests.
  7046. 703.72 s [vector] createT: OK
  7047. 703.72 s [vector] +++ OK, passed 100 tests.
  7048. 703.73 s [vector] unfoldr: OK
  7049. 703.73 s [vector] +++ OK, passed 100 tests.
  7050. 703.74 s [vector] unfoldrN: OK
  7051. 703.74 s [vector] +++ OK, passed 100 tests.
  7052. 703.74 s [vector] unfoldrExactN: OK
  7053. 703.74 s [vector] +++ OK, passed 100 tests.
  7054. 703.74 s [vector] unfoldrM: OK
  7055. 703.74 s [vector] +++ OK, passed 100 tests.
  7056. 703.75 s [vector] unfoldrNM: OK
  7057. 703.75 s [vector] +++ OK, passed 100 tests.
  7058. 703.78 s [vector] unfoldrExactNM: OK (0.04s)
  7059. 703.78 s [vector] +++ OK, passed 100 tests.
  7060. 703.79 s [vector] constructN: OK
  7061. 703.79 s [vector] +++ OK, passed 100 tests.
  7062. 703.79 s [vector] constructrN: OK
  7063. 703.79 s [vector] +++ OK, passed 100 tests.
  7064. 703.80 s [vector] cons: OK
  7065. 703.80 s [vector] +++ OK, passed 100 tests.
  7066. 703.80 s [vector] snoc: OK
  7067. 703.80 s [vector] +++ OK, passed 100 tests.
  7068. 703.80 s [vector] append: OK
  7069. 703.80 s [vector] +++ OK, passed 100 tests.
  7070. 703.82 s [vector] concat: OK (0.02s)
  7071. 703.82 s [vector] +++ OK, passed 100 tests.
  7072. 703.82 s [vector] force: OK
  7073. 703.82 s [vector] +++ OK, passed 100 tests.
  7074. 703.82 s [vector] upd: OK
  7075. 703.82 s [vector] +++ OK, passed 100 tests.
  7076. 703.83 s [vector] accum: OK
  7077. 703.83 s [vector] +++ OK, passed 100 tests.
  7078. 703.84 s [vector] reverse: OK
  7079. 703.84 s [vector] +++ OK, passed 100 tests.
  7080. 703.84 s [vector] backpermute: OK
  7081. 703.84 s [vector] +++ OK, passed 100 tests.
  7082. 703.84 s [vector] map: OK
  7083. 703.84 s [vector] +++ OK, passed 100 tests.
  7084. 703.85 s [vector] imap: OK
  7085. 703.86 s [vector] +++ OK, passed 100 tests.
  7086. 703.86 s [vector] concatMap: OK
  7087. 703.86 s [vector] +++ OK, passed 100 tests.
  7088. 703.86 s [vector] mapM: OK
  7089. 703.86 s [vector] +++ OK, passed 100 tests.
  7090. 703.89 s [vector] mapM_: OK (0.04s)
  7091. 703.89 s [vector] +++ OK, passed 100 tests.
  7092. 703.92 s [vector] forM: OK
  7093. 703.92 s [vector] +++ OK, passed 100 tests.
  7094. 703.95 s [vector] forM_: OK (0.04s)
  7095. 703.96 s [vector] +++ OK, passed 100 tests.
  7096. 703.96 s [vector] imapM: OK
  7097. 703.96 s [vector] +++ OK, passed 100 tests.
  7098. 704.00 s [vector] imapM_: OK (0.04s)
  7099. 704.00 s [vector] +++ OK, passed 100 tests.
  7100. 704.01 s [vector] zipWith: OK (0.01s)
  7101. 704.02 s [vector] +++ OK, passed 100 tests.
  7102. 704.02 s [vector] zipWith3: OK
  7103. 704.02 s [vector] +++ OK, passed 100 tests.
  7104. 704.02 s [vector] izipWith: OK
  7105. 704.03 s [vector] +++ OK, passed 100 tests.
  7106. 704.04 s [vector] izipWith3: OK
  7107. 704.04 s [vector] +++ OK, passed 100 tests.
  7108. 704.04 s [vector] izipWithM: OK
  7109. 704.04 s [vector] +++ OK, passed 100 tests.
  7110. 704.06 s [vector] izipWithM_: OK (0.03s)
  7111. 704.06 s [vector] +++ OK, passed 100 tests.
  7112. 704.06 s [vector] zipWithM: OK
  7113. 704.06 s [vector] +++ OK, passed 100 tests.
  7114. 704.09 s [vector] zipWithM_: OK (0.01s)
  7115. 704.09 s [vector] +++ OK, passed 100 tests.
  7116. 704.09 s [vector] filter: OK
  7117. 704.09 s [vector] +++ OK, passed 100 tests.
  7118. 704.12 s [vector] ifilter: OK
  7119. 704.12 s [vector] +++ OK, passed 100 tests.
  7120. 704.16 s [vector] filterM: OK (0.06s)
  7121. 704.16 s [vector] +++ OK, passed 100 tests.
  7122. 704.16 s [vector] uniq: OK
  7123. 704.16 s [vector] +++ OK, passed 100 tests.
  7124. 704.17 s [vector] mapMaybe: OK
  7125. 704.17 s [vector] +++ OK, passed 100 tests.
  7126. 704.17 s [vector] imapMaybe: OK
  7127. 704.18 s [vector] +++ OK, passed 100 tests.
  7128. 704.18 s [vector] takeWhile: OK
  7129. 704.18 s [vector] +++ OK, passed 100 tests.
  7130. 704.18 s [vector] dropWhile: OK
  7131. 704.18 s [vector] +++ OK, passed 100 tests.
  7132. 704.18 s [vector] partition: OK
  7133. 704.18 s [vector] +++ OK, passed 100 tests.
  7134. 704.18 s [vector] partitionWith: OK
  7135. 704.18 s [vector] +++ OK, passed 100 tests.
  7136. 704.18 s [vector] span: OK
  7137. 704.18 s [vector] +++ OK, passed 100 tests.
  7138. 704.19 s [vector] break: OK
  7139. 704.19 s [vector] +++ OK, passed 100 tests.
  7140. 704.19 s [vector] spanR: OK
  7141. 704.19 s [vector] +++ OK, passed 100 tests.
  7142. 704.19 s [vector] breakR: OK
  7143. 704.19 s [vector] +++ OK, passed 100 tests.
  7144. 704.19 s [vector] groupBy: OK
  7145. 704.19 s [vector] +++ OK, passed 100 tests.
  7146. 704.19 s [vector] elem: OK
  7147. 704.19 s [vector] +++ OK, passed 100 tests.
  7148. 704.19 s [vector] notElem: OK
  7149. 704.19 s [vector] +++ OK, passed 100 tests.
  7150. 704.20 s [vector] find: OK
  7151. 704.20 s [vector] +++ OK, passed 100 tests.
  7152. 704.20 s [vector] findIndex: OK
  7153. 704.20 s [vector] +++ OK, passed 100 tests.
  7154. 704.20 s [vector] findIndexR: OK
  7155. 704.20 s [vector] +++ OK, passed 100 tests.
  7156. 704.20 s [vector] findIndices: OK
  7157. 704.20 s [vector] +++ OK, passed 100 tests.
  7158. 704.20 s [vector] elemIndex: OK
  7159. 704.21 s [vector] +++ OK, passed 100 tests.
  7160. 704.22 s [vector] elemIndices: OK
  7161. 704.22 s [vector] +++ OK, passed 100 tests.
  7162. 704.22 s [vector] foldl: OK
  7163. 704.22 s [vector] +++ OK, passed 100 tests.
  7164. 704.22 s [vector] foldl1: OK
  7165. 704.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7166. 704.23 s [vector] foldl': OK
  7167. 704.24 s [vector] +++ OK, passed 100 tests.
  7168. 704.24 s [vector] foldl1': OK
  7169. 704.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7170. 704.24 s [vector] foldr: OK
  7171. 704.24 s [vector] +++ OK, passed 100 tests.
  7172. 704.24 s [vector] foldr1: OK
  7173. 704.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7174. 704.25 s [vector] foldr': OK
  7175. 704.25 s [vector] +++ OK, passed 100 tests.
  7176. 704.27 s [vector] foldr1': OK
  7177. 704.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7178. 704.28 s [vector] ifoldl: OK (0.01s)
  7179. 704.28 s [vector] +++ OK, passed 100 tests.
  7180. 704.29 s [vector] ifoldl': OK (0.01s)
  7181. 704.30 s [vector] +++ OK, passed 100 tests.
  7182. 704.30 s [vector] ifoldr: OK
  7183. 704.31 s [vector] +++ OK, passed 100 tests.
  7184. 704.32 s [vector] ifoldr': OK
  7185. 704.32 s [vector] +++ OK, passed 100 tests.
  7186. 704.32 s [vector] ifoldM: OK
  7187. 704.32 s [vector] +++ OK, passed 100 tests.
  7188. 704.32 s [vector] ifoldM': OK
  7189. 704.32 s [vector] +++ OK, passed 100 tests.
  7190. 704.38 s [vector] ifoldM_: OK (0.04s)
  7191. 704.38 s [vector] +++ OK, passed 100 tests.
  7192. 704.39 s [vector] ifoldM'_: OK (0.03s)
  7193. 704.39 s [vector] +++ OK, passed 100 tests.
  7194. 704.39 s [vector] all: OK
  7195. 704.39 s [vector] +++ OK, passed 100 tests.
  7196. 704.39 s [vector] any: OK
  7197. 704.40 s [vector] +++ OK, passed 100 tests.
  7198. 704.41 s [vector] prescanl: OK
  7199. 704.42 s [vector] +++ OK, passed 100 tests.
  7200. 704.43 s [vector] prescanl': OK
  7201. 704.43 s [vector] +++ OK, passed 100 tests.
  7202. 704.44 s [vector] postscanl: OK
  7203. 704.44 s [vector] +++ OK, passed 100 tests.
  7204. 704.44 s [vector] postscanl': OK
  7205. 704.44 s [vector] +++ OK, passed 100 tests.
  7206. 704.45 s [vector] scanl: OK
  7207. 704.46 s [vector] +++ OK, passed 100 tests.
  7208. 704.46 s [vector] scanl': OK
  7209. 704.46 s [vector] +++ OK, passed 100 tests.
  7210. 704.46 s [vector] scanl1: OK
  7211. 704.47 s [vector] +++ OK, passed 100 tests.
  7212. 704.48 s [vector] scanl1': OK
  7213. 704.48 s [vector] +++ OK, passed 100 tests.
  7214. 704.49 s [vector] iscanl: OK
  7215. 704.49 s [vector] +++ OK, passed 100 tests.
  7216. 704.50 s [vector] iscanl': OK
  7217. 704.50 s [vector] +++ OK, passed 100 tests.
  7218. 704.50 s [vector] prescanr: OK
  7219. 704.50 s [vector] +++ OK, passed 100 tests.
  7220. 704.50 s [vector] prescanr': OK
  7221. 704.50 s [vector] +++ OK, passed 100 tests.
  7222. 704.50 s [vector] postscanr: OK
  7223. 704.50 s [vector] +++ OK, passed 100 tests.
  7224. 704.51 s [vector] postscanr': OK
  7225. 704.51 s [vector] +++ OK, passed 100 tests.
  7226. 704.52 s [vector] scanr: OK
  7227. 704.52 s [vector] +++ OK, passed 100 tests.
  7228. 704.52 s [vector] scanr': OK
  7229. 704.53 s [vector] +++ OK, passed 100 tests.
  7230. 704.54 s [vector] scanr1: OK
  7231. 704.54 s [vector] +++ OK, passed 100 tests.
  7232. 704.54 s [vector] scanr1': OK
  7233. 704.54 s [vector] +++ OK, passed 100 tests.
  7234. 704.54 s [vector] iscanr: OK
  7235. 704.54 s [vector] +++ OK, passed 100 tests.
  7236. 704.54 s [vector] iscanr': OK
  7237. 704.54 s [vector] +++ OK, passed 100 tests.
  7238. 704.55 s [vector] mut_read: OK
  7239. 704.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7240. 704.55 s [vector] mut_write: OK
  7241. 704.55 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7242. 704.55 s [vector] mut_modify: OK
  7243. 704.55 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7244. 704.56 s [vector] mut_generate: OK
  7245. 704.56 s [vector] +++ OK, passed 100 tests.
  7246. 704.58 s [vector] mut_generateM: OK (0.02s)
  7247. 704.58 s [vector] +++ OK, passed 100 tests.
  7248. 704.60 s [vector] mut_mapM_: OK (0.03s)
  7249. 704.60 s [vector] +++ OK, passed 100 tests.
  7250. 704.64 s [vector] mut_imapM_: OK (0.03s)
  7251. 704.64 s [vector] +++ OK, passed 100 tests.
  7252. 704.68 s [vector] mut_forM_: OK (0.03s)
  7253. 704.68 s [vector] +++ OK, passed 100 tests.
  7254. 704.70 s [vector] mut_iforM_: OK (0.03s)
  7255. 704.70 s [vector] +++ OK, passed 100 tests.
  7256. 704.71 s [vector] mut_foldr: OK
  7257. 704.71 s [vector] +++ OK, passed 100 tests.
  7258. 704.72 s [vector] mut_foldr': OK
  7259. 704.72 s [vector] +++ OK, passed 100 tests.
  7260. 704.72 s [vector] mut_foldl: OK
  7261. 704.72 s [vector] +++ OK, passed 100 tests.
  7262. 704.73 s [vector] mut_foldl': OK
  7263. 704.73 s [vector] +++ OK, passed 100 tests.
  7264. 704.73 s [vector] mut_ifoldr: OK
  7265. 704.73 s [vector] +++ OK, passed 100 tests.
  7266. 704.73 s [vector] mut_ifoldr': OK
  7267. 704.73 s [vector] +++ OK, passed 100 tests.
  7268. 704.75 s [vector] mut_ifoldl: OK
  7269. 704.76 s [vector] +++ OK, passed 100 tests.
  7270. 704.76 s [vector] mut_ifoldl': OK
  7271. 704.77 s [vector] +++ OK, passed 100 tests.
  7272. 704.77 s [vector] mut_foldM: OK
  7273. 704.78 s [vector] +++ OK, passed 100 tests.
  7274. 704.78 s [vector] mut_foldM': OK
  7275. 704.78 s [vector] +++ OK, passed 100 tests.
  7276. 704.78 s [vector] mut_foldrM: OK
  7277. 704.78 s [vector] +++ OK, passed 100 tests.
  7278. 704.78 s [vector] mut_foldrM': OK
  7279. 704.78 s [vector] +++ OK, passed 100 tests.
  7280. 704.80 s [vector] mut_ifoldM: OK
  7281. 704.80 s [vector] +++ OK, passed 100 tests.
  7282. 704.82 s [vector] mut_ifoldM': OK
  7283. 704.82 s [vector] +++ OK, passed 100 tests.
  7284. 704.82 s [vector] mut_ifoldrM: OK
  7285. 704.82 s [vector] +++ OK, passed 100 tests.
  7286. 704.82 s [vector] mut_ifoldrM': OK
  7287. 704.82 s [vector] +++ OK, passed 100 tests.
  7288. 704.82 s [vector] compare: OK
  7289. 704.82 s [vector] +++ OK, passed 100 tests.
  7290. 704.82 s [vector] maximum: OK
  7291. 704.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7292. 704.82 s [vector] minimum: OK
  7293. 704.82 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7294. 704.82 s [vector] minIndex: OK
  7295. 704.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7296. 704.82 s [vector] maxIndex: OK
  7297. 704.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7298. 704.82 s [vector] maximumBy: OK
  7299. 704.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7300. 704.82 s [vector] minimumBy: OK
  7301. 704.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7302. 704.82 s [vector] maximumOn: OK
  7303. 704.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7304. 704.83 s [vector] minimumOn: OK
  7305. 704.83 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7306. 704.83 s [vector] maxIndexBy: OK
  7307. 704.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7308. 704.83 s [vector] minIndexBy: OK
  7309. 704.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7310. 704.83 s [vector] ListFirstMaxIndexWins: OK
  7311. 704.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7312. 704.84 s [vector] FalseListFirstMaxIndexWins: OK
  7313. 704.84 s [vector] +++ OK, failed as expected. (after 1 test):
  7314. 704.84 s [vector] Exception:
  7315. 704.84 s [vector] Prelude.foldr1: empty list
  7316. 704.84 s [vector] CallStack (from HasCallStack):
  7317. 704.84 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7318. 704.84 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7319. 704.84 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7320. 704.84 s [vector] []
  7321. 704.84 s [vector] zip: OK
  7322. 704.84 s [vector] +++ OK, passed 100 tests.
  7323. 704.84 s [vector] zip3: OK
  7324. 704.84 s [vector] +++ OK, passed 100 tests.
  7325. 704.84 s [vector] unzip: OK
  7326. 704.84 s [vector] +++ OK, passed 100 tests.
  7327. 704.84 s [vector] unzip3: OK
  7328. 704.84 s [vector] +++ OK, passed 100 tests.
  7329. 704.84 s [vector] indexed: OK
  7330. 704.84 s [vector] +++ OK, passed 100 tests.
  7331. 704.84 s [vector] update: OK
  7332. 704.84 s [vector] +++ OK, passed 100 tests.
  7333. 704.85 s [vector] mempty: OK
  7334. 704.85 s [vector] +++ OK, passed 100 tests.
  7335. 704.86 s [vector] mappend: OK
  7336. 704.86 s [vector] +++ OK, passed 100 tests.
  7337. 704.87 s [vector] mconcat: OK (0.02s)
  7338. 704.87 s [vector] +++ OK, passed 100 tests.
  7339. 704.87 s [vector] glength: OK
  7340. 704.87 s [vector] +++ OK, passed 100 tests.
  7341. 704.87 s [vector] sum: OK
  7342. 704.87 s [vector] +++ OK, passed 100 tests.
  7343. 704.87 s [vector] product: OK
  7344. 704.87 s [vector] +++ OK, passed 100 tests.
  7345. 704.87 s [vector] enumFromN: OK
  7346. 704.87 s [vector] +++ OK, passed 100 tests.
  7347. 704.87 s [vector] enumFromThenN: OK
  7348. 704.87 s [vector] +++ OK, passed 100 tests.
  7349. 704.88 s [vector] enumFromTo: OK
  7350. 704.88 s [vector] +++ OK, passed 100 tests.
  7351. 704.88 s [vector] enumFromThenTo: OK
  7352. 704.88 s [vector] +++ OK, passed 100 tests; 2 discarded.
  7353. 704.88 s [vector] (Double)
  7354. 704.88 s [vector] fromList.toList == id: OK
  7355. 704.88 s [vector] +++ OK, passed 100 tests.
  7356. 704.88 s [vector] toList.fromList == id: OK
  7357. 704.88 s [vector] +++ OK, passed 100 tests.
  7358. 704.88 s [vector] unstream.stream == id: OK
  7359. 704.88 s [vector] +++ OK, passed 100 tests.
  7360. 704.88 s [vector] stream.unstream == id: OK
  7361. 704.88 s [vector] +++ OK, passed 100 tests.
  7362. 704.88 s [vector] eq: OK
  7363. 704.88 s [vector] +++ OK, passed 100 tests.
  7364. 704.88 s [vector] length: OK
  7365. 704.88 s [vector] +++ OK, passed 100 tests.
  7366. 704.88 s [vector] null: OK
  7367. 704.89 s [vector] +++ OK, passed 100 tests.
  7368. 704.89 s [vector] index: OK
  7369. 704.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7370. 704.89 s [vector] safeIndex: OK
  7371. 704.89 s [vector] +++ OK, passed 100 tests.
  7372. 704.89 s [vector] head: OK
  7373. 704.89 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7374. 704.89 s [vector] last: OK
  7375. 704.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7376. 704.89 s [vector] unsafeIndex: OK
  7377. 704.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7378. 704.90 s [vector] unsafeHead: OK
  7379. 704.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7380. 704.90 s [vector] unsafeLast: OK
  7381. 704.90 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7382. 704.90 s [vector] slice: OK
  7383. 704.90 s [vector] +++ OK, passed 100 tests.
  7384. 704.90 s [vector] init: OK
  7385. 704.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7386. 704.90 s [vector] tail: OK
  7387. 704.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7388. 704.92 s [vector] take: OK
  7389. 704.93 s [vector] +++ OK, passed 100 tests.
  7390. 704.93 s [vector] drop: OK
  7391. 704.93 s [vector] +++ OK, passed 100 tests.
  7392. 704.93 s [vector] splitAt: OK
  7393. 704.93 s [vector] +++ OK, passed 100 tests.
  7394. 704.93 s [vector] empty: OK
  7395. 704.93 s [vector] +++ OK, passed 100 tests.
  7396. 704.93 s [vector] singleton: OK
  7397. 704.93 s [vector] +++ OK, passed 100 tests.
  7398. 704.93 s [vector] replicate: OK
  7399. 704.93 s [vector] +++ OK, passed 100 tests.
  7400. 704.93 s [vector] generate: OK
  7401. 704.93 s [vector] +++ OK, passed 100 tests.
  7402. 704.93 s [vector] iterateN: OK
  7403. 704.93 s [vector] +++ OK, passed 100 tests.
  7404. 704.94 s [vector] iterateNM: OK (0.03s)
  7405. 704.94 s [vector] +++ OK, passed 100 tests.
  7406. 704.96 s [vector] generateM: OK (0.02s)
  7407. 704.96 s [vector] +++ OK, passed 100 tests.
  7408. 704.97 s [vector] replicateM: OK (0.01s)
  7409. 704.97 s [vector] +++ OK, passed 100 tests.
  7410. 704.97 s [vector] create: OK
  7411. 704.97 s [vector] +++ OK, passed 100 tests.
  7412. 704.97 s [vector] createT: OK
  7413. 704.97 s [vector] +++ OK, passed 100 tests.
  7414. 704.97 s [vector] unfoldr: OK
  7415. 704.97 s [vector] +++ OK, passed 100 tests.
  7416. 704.97 s [vector] unfoldrN: OK
  7417. 704.97 s [vector] +++ OK, passed 100 tests.
  7418. 704.97 s [vector] unfoldrExactN: OK
  7419. 704.97 s [vector] +++ OK, passed 100 tests.
  7420. 704.98 s [vector] unfoldrM: OK
  7421. 704.98 s [vector] +++ OK, passed 100 tests.
  7422. 704.98 s [vector] unfoldrNM: OK
  7423. 704.98 s [vector] +++ OK, passed 100 tests.
  7424. 705.02 s [vector] unfoldrExactNM: OK (0.03s)
  7425. 705.02 s [vector] +++ OK, passed 100 tests.
  7426. 705.33 s [vector] constructN: OK (0.01s)
  7427. 705.33 s [vector] +++ OK, passed 100 tests.
  7428. 705.33 s [vector] constructrN: OK (0.01s)
  7429. 705.33 s [vector] +++ OK, passed 100 tests.
  7430. 705.33 s [vector] cons: OK
  7431. 705.33 s [vector] +++ OK, passed 100 tests.
  7432. 705.33 s [vector] snoc: OK
  7433. 705.33 s [vector] +++ OK, passed 100 tests.
  7434. 705.33 s [vector] append: OK
  7435. 705.33 s [vector] +++ OK, passed 100 tests.
  7436. 705.33 s [vector] concat: OK (0.02s)
  7437. 705.33 s [vector] +++ OK, passed 100 tests.
  7438. 705.33 s [vector] force: OK
  7439. 705.33 s [vector] +++ OK, passed 100 tests.
  7440. 705.33 s [vector] upd: OK
  7441. 705.33 s [vector] +++ OK, passed 100 tests.
  7442. 705.33 s [vector] accum: OK (0.01s)
  7443. 705.33 s [vector] +++ OK, passed 100 tests.
  7444. 705.33 s [vector] reverse: OK
  7445. 705.33 s [vector] +++ OK, passed 100 tests.
  7446. 705.33 s [vector] backpermute: OK
  7447. 705.33 s [vector] +++ OK, passed 100 tests.
  7448. 705.33 s [vector] map: OK
  7449. 705.33 s [vector] +++ OK, passed 100 tests.
  7450. 705.33 s [vector] imap: OK
  7451. 705.33 s [vector] +++ OK, passed 100 tests.
  7452. 705.33 s [vector] concatMap: OK
  7453. 705.33 s [vector] +++ OK, passed 100 tests.
  7454. 705.33 s [vector] mapM: OK
  7455. 705.33 s [vector] +++ OK, passed 100 tests.
  7456. 705.33 s [vector] mapM_: OK (0.04s)
  7457. 705.33 s [vector] +++ OK, passed 100 tests.
  7458. 705.33 s [vector] forM: OK
  7459. 705.33 s [vector] +++ OK, passed 100 tests.
  7460. 705.33 s [vector] forM_: OK (0.03s)
  7461. 705.33 s [vector] +++ OK, passed 100 tests.
  7462. 705.33 s [vector] imapM: OK
  7463. 705.33 s [vector] +++ OK, passed 100 tests.
  7464. 705.33 s [vector] imapM_: OK (0.04s)
  7465. 705.33 s [vector] +++ OK, passed 100 tests.
  7466. 705.33 s [vector] zipWith: OK
  7467. 705.33 s [vector] +++ OK, passed 100 tests.
  7468. 705.33 s [vector] zipWith3: OK
  7469. 705.33 s [vector] +++ OK, passed 100 tests.
  7470. 705.33 s [vector] izipWith: OK
  7471. 705.33 s [vector] +++ OK, passed 100 tests.
  7472. 705.33 s [vector] izipWith3: OK
  7473. 705.33 s [vector] +++ OK, passed 100 tests.
  7474. 705.33 s [vector] izipWithM: OK (0.01s)
  7475. 705.33 s [vector] +++ OK, passed 100 tests.
  7476. 705.33 s [vector] izipWithM_: OK (0.03s)
  7477. 705.33 s [vector] +++ OK, passed 100 tests.
  7478. 705.34 s [vector] zipWithM: OK
  7479. 705.34 s [vector] +++ OK, passed 100 tests.
  7480. 705.36 s [vector] zipWithM_: OK (0.03s)
  7481. 705.36 s [vector] +++ OK, passed 100 tests.
  7482. 705.36 s [vector] filter: OK
  7483. 705.36 s [vector] +++ OK, passed 100 tests.
  7484. 705.37 s [vector] ifilter: OK
  7485. 705.37 s [vector] +++ OK, passed 100 tests.
  7486. 705.42 s [vector] filterM: OK (0.06s)
  7487. 705.42 s [vector] +++ OK, passed 100 tests.
  7488. 705.43 s [vector] uniq: OK
  7489. 705.44 s [vector] +++ OK, passed 100 tests.
  7490. 705.44 s [vector] mapMaybe: OK
  7491. 705.44 s [vector] +++ OK, passed 100 tests.
  7492. 705.44 s [vector] imapMaybe: OK
  7493. 705.44 s [vector] +++ OK, passed 100 tests.
  7494. 705.44 s [vector] takeWhile: OK
  7495. 705.44 s [vector] +++ OK, passed 100 tests.
  7496. 705.44 s [vector] dropWhile: OK
  7497. 705.44 s [vector] +++ OK, passed 100 tests.
  7498. 705.46 s [vector] partition: OK
  7499. 705.46 s [vector] +++ OK, passed 100 tests.
  7500. 705.46 s [vector] partitionWith: OK
  7501. 705.46 s [vector] +++ OK, passed 100 tests.
  7502. 705.46 s [vector] span: OK
  7503. 705.46 s [vector] +++ OK, passed 100 tests.
  7504. 705.46 s [vector] break: OK
  7505. 705.46 s [vector] +++ OK, passed 100 tests.
  7506. 705.46 s [vector] spanR: OK
  7507. 705.46 s [vector] +++ OK, passed 100 tests.
  7508. 705.48 s [vector] breakR: OK
  7509. 705.48 s [vector] +++ OK, passed 100 tests.
  7510. 705.48 s [vector] groupBy: OK (0.01s)
  7511. 705.48 s [vector] +++ OK, passed 100 tests.
  7512. 705.48 s [vector] elem: OK
  7513. 705.48 s [vector] +++ OK, passed 100 tests.
  7514. 705.48 s [vector] notElem: OK
  7515. 705.48 s [vector] +++ OK, passed 100 tests.
  7516. 705.49 s [vector] find: OK
  7517. 705.49 s [vector] +++ OK, passed 100 tests.
  7518. 705.50 s [vector] findIndex: OK
  7519. 705.50 s [vector] +++ OK, passed 100 tests.
  7520. 705.52 s [vector] findIndexR: OK
  7521. 705.52 s [vector] +++ OK, passed 100 tests.
  7522. 705.52 s [vector] findIndices: OK
  7523. 705.52 s [vector] +++ OK, passed 100 tests.
  7524. 705.54 s [vector] elemIndex: OK
  7525. 705.54 s [vector] +++ OK, passed 100 tests.
  7526. 705.54 s [vector] elemIndices: OK
  7527. 705.55 s [vector] +++ OK, passed 100 tests.
  7528. 705.56 s [vector] foldl: OK (0.01s)
  7529. 705.56 s [vector] +++ OK, passed 100 tests.
  7530. 705.56 s [vector] foldl1: OK (0.01s)
  7531. 705.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7532. 705.58 s [vector] foldl': OK (0.01s)
  7533. 705.58 s [vector] +++ OK, passed 100 tests.
  7534. 705.58 s [vector] foldl1': OK (0.01s)
  7535. 705.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7536. 705.59 s [vector] foldr: OK (0.01s)
  7537. 705.60 s [vector] +++ OK, passed 100 tests.
  7538. 705.60 s [vector] foldr1: OK
  7539. 705.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7540. 705.61 s [vector] foldr': OK (0.01s)
  7541. 705.61 s [vector] +++ OK, passed 100 tests.
  7542. 705.61 s [vector] foldr1': OK
  7543. 705.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7544. 705.62 s [vector] ifoldl: OK (0.01s)
  7545. 705.62 s [vector] +++ OK, passed 100 tests.
  7546. 705.62 s [vector] ifoldl': OK (0.01s)
  7547. 705.62 s [vector] +++ OK, passed 100 tests.
  7548. 705.62 s [vector] ifoldr: OK (0.01s)
  7549. 705.63 s [vector] +++ OK, passed 100 tests.
  7550. 705.64 s [vector] ifoldr': OK
  7551. 705.64 s [vector] +++ OK, passed 100 tests.
  7552. 705.65 s [vector] ifoldM: OK (0.01s)
  7553. 705.66 s [vector] +++ OK, passed 100 tests.
  7554. 705.66 s [vector] ifoldM': OK (0.01s)
  7555. 705.66 s [vector] +++ OK, passed 100 tests.
  7556. 705.70 s [vector] ifoldM_: OK (0.04s)
  7557. 705.70 s [vector] +++ OK, passed 100 tests.
  7558. 705.73 s [vector] ifoldM'_: OK (0.04s)
  7559. 705.73 s [vector] +++ OK, passed 100 tests.
  7560. 705.73 s [vector] all: OK
  7561. 705.74 s [vector] +++ OK, passed 100 tests.
  7562. 705.74 s [vector] any: OK
  7563. 705.74 s [vector] +++ OK, passed 100 tests.
  7564. 705.76 s [vector] prescanl: OK (0.01s)
  7565. 705.76 s [vector] +++ OK, passed 100 tests.
  7566. 705.76 s [vector] prescanl': OK (0.01s)
  7567. 705.77 s [vector] +++ OK, passed 100 tests.
  7568. 705.78 s [vector] postscanl: OK (0.01s)
  7569. 705.78 s [vector] +++ OK, passed 100 tests.
  7570. 705.78 s [vector] postscanl': OK (0.01s)
  7571. 705.79 s [vector] +++ OK, passed 100 tests.
  7572. 705.80 s [vector] scanl: OK (0.01s)
  7573. 705.80 s [vector] +++ OK, passed 100 tests.
  7574. 705.81 s [vector] scanl': OK (0.01s)
  7575. 705.82 s [vector] +++ OK, passed 100 tests.
  7576. 705.82 s [vector] scanl1: OK (0.01s)
  7577. 705.82 s [vector] +++ OK, passed 100 tests.
  7578. 705.83 s [vector] scanl1': OK (0.01s)
  7579. 705.84 s [vector] +++ OK, passed 100 tests.
  7580. 705.84 s [vector] iscanl: OK (0.01s)
  7581. 705.84 s [vector] +++ OK, passed 100 tests.
  7582. 705.86 s [vector] iscanl': OK (0.01s)
  7583. 705.86 s [vector] +++ OK, passed 100 tests.
  7584. 705.86 s [vector] prescanr: OK (0.01s)
  7585. 705.86 s [vector] +++ OK, passed 100 tests.
  7586. 705.88 s [vector] prescanr': OK (0.01s)
  7587. 705.88 s [vector] +++ OK, passed 100 tests.
  7588. 705.88 s [vector] postscanr: OK (0.01s)
  7589. 705.88 s [vector] +++ OK, passed 100 tests.
  7590. 705.90 s [vector] postscanr': OK (0.01s)
  7591. 705.90 s [vector] +++ OK, passed 100 tests.
  7592. 705.91 s [vector] scanr: OK (0.01s)
  7593. 705.92 s [vector] +++ OK, passed 100 tests.
  7594. 705.92 s [vector] scanr': OK (0.01s)
  7595. 705.92 s [vector] +++ OK, passed 100 tests.
  7596. 705.94 s [vector] scanr1: OK (0.01s)
  7597. 705.94 s [vector] +++ OK, passed 100 tests.
  7598. 705.95 s [vector] scanr1': OK (0.01s)
  7599. 705.96 s [vector] +++ OK, passed 100 tests.
  7600. 705.96 s [vector] iscanr: OK (0.01s)
  7601. 705.96 s [vector] +++ OK, passed 100 tests.
  7602. 705.96 s [vector] iscanr': OK (0.01s)
  7603. 705.96 s [vector] +++ OK, passed 100 tests.
  7604. 705.97 s [vector] mut_read: OK
  7605. 705.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7606. 705.98 s [vector] mut_write: OK
  7607. 705.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7608. 705.98 s [vector] mut_modify: OK
  7609. 705.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7610. 705.98 s [vector] mut_generate: OK
  7611. 705.99 s [vector] +++ OK, passed 100 tests.
  7612. 706.00 s [vector] mut_generateM: OK (0.02s)
  7613. 706.00 s [vector] +++ OK, passed 100 tests.
  7614. 706.04 s [vector] mut_mapM_: OK (0.03s)
  7615. 706.04 s [vector] +++ OK, passed 100 tests.
  7616. 706.08 s [vector] mut_imapM_: OK (0.04s)
  7617. 706.08 s [vector] +++ OK, passed 100 tests.
  7618. 706.10 s [vector] mut_forM_: OK (0.03s)
  7619. 706.10 s [vector] +++ OK, passed 100 tests.
  7620. 706.14 s [vector] mut_iforM_: OK (0.03s)
  7621. 706.14 s [vector] +++ OK, passed 100 tests.
  7622. 706.15 s [vector] mut_foldr: OK (0.01s)
  7623. 706.16 s [vector] +++ OK, passed 100 tests.
  7624. 706.16 s [vector] mut_foldr': OK (0.01s)
  7625. 706.16 s [vector] +++ OK, passed 100 tests.
  7626. 706.16 s [vector] mut_foldl: OK (0.01s)
  7627. 706.16 s [vector] +++ OK, passed 100 tests.
  7628. 706.18 s [vector] mut_foldl': OK
  7629. 706.18 s [vector] +++ OK, passed 100 tests.
  7630. 706.20 s [vector] mut_ifoldr: OK (0.01s)
  7631. 706.20 s [vector] +++ OK, passed 100 tests.
  7632. 706.21 s [vector] mut_ifoldr': OK (0.01s)
  7633. 706.21 s [vector] +++ OK, passed 100 tests.
  7634. 706.22 s [vector] mut_ifoldl: OK (0.01s)
  7635. 706.22 s [vector] +++ OK, passed 100 tests.
  7636. 706.23 s [vector] mut_ifoldl': OK (0.01s)
  7637. 706.23 s [vector] +++ OK, passed 100 tests.
  7638. 706.24 s [vector] mut_foldM: OK (0.01s)
  7639. 706.24 s [vector] +++ OK, passed 100 tests.
  7640. 706.26 s [vector] mut_foldM': OK (0.01s)
  7641. 706.26 s [vector] +++ OK, passed 100 tests.
  7642. 706.26 s [vector] mut_foldrM: OK (0.01s)
  7643. 706.26 s [vector] +++ OK, passed 100 tests.
  7644. 706.28 s [vector] mut_foldrM': OK (0.01s)
  7645. 706.28 s [vector] +++ OK, passed 100 tests.
  7646. 706.29 s [vector] mut_ifoldM: OK (0.01s)
  7647. 706.30 s [vector] +++ OK, passed 100 tests.
  7648. 706.30 s [vector] mut_ifoldM': OK (0.01s)
  7649. 706.30 s [vector] +++ OK, passed 100 tests.
  7650. 706.32 s [vector] mut_ifoldrM: OK (0.01s)
  7651. 706.32 s [vector] +++ OK, passed 100 tests.
  7652. 706.32 s [vector] mut_ifoldrM': OK (0.01s)
  7653. 706.32 s [vector] +++ OK, passed 100 tests.
  7654. 706.32 s [vector] compare: OK
  7655. 706.32 s [vector] +++ OK, passed 100 tests.
  7656. 706.32 s [vector] maximum: OK
  7657. 706.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7658. 706.32 s [vector] minimum: OK
  7659. 706.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7660. 706.32 s [vector] minIndex: OK
  7661. 706.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7662. 706.32 s [vector] maxIndex: OK
  7663. 706.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7664. 706.32 s [vector] maximumBy: OK
  7665. 706.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7666. 706.32 s [vector] minimumBy: OK
  7667. 706.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7668. 706.33 s [vector] maximumOn: OK
  7669. 706.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7670. 706.33 s [vector] minimumOn: OK
  7671. 706.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7672. 706.33 s [vector] maxIndexBy: OK
  7673. 706.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7674. 706.33 s [vector] minIndexBy: OK
  7675. 706.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7676. 706.33 s [vector] ListFirstMaxIndexWins: OK
  7677. 706.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7678. 706.33 s [vector] FalseListFirstMaxIndexWins: OK
  7679. 706.33 s [vector] +++ OK, failed as expected. (after 1 test):
  7680. 706.33 s [vector] Exception:
  7681. 706.33 s [vector] Prelude.foldr1: empty list
  7682. 706.33 s [vector] CallStack (from HasCallStack):
  7683. 706.33 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7684. 706.33 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7685. 706.33 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7686. 706.33 s [vector] []
  7687. 706.33 s [vector] zip: OK
  7688. 706.33 s [vector] +++ OK, passed 100 tests.
  7689. 706.34 s [vector] zip3: OK
  7690. 706.34 s [vector] +++ OK, passed 100 tests.
  7691. 706.34 s [vector] unzip: OK
  7692. 706.34 s [vector] +++ OK, passed 100 tests.
  7693. 706.34 s [vector] unzip3: OK
  7694. 706.34 s [vector] +++ OK, passed 100 tests.
  7695. 706.34 s [vector] indexed: OK
  7696. 706.34 s [vector] +++ OK, passed 100 tests.
  7697. 706.34 s [vector] update: OK
  7698. 706.35 s [vector] +++ OK, passed 100 tests.
  7699. 706.35 s [vector] mempty: OK
  7700. 706.35 s [vector] +++ OK, passed 100 tests.
  7701. 706.35 s [vector] mappend: OK
  7702. 706.35 s [vector] +++ OK, passed 100 tests.
  7703. 706.38 s [vector] mconcat: OK (0.03s)
  7704. 706.38 s [vector] +++ OK, passed 100 tests.
  7705. 706.38 s [vector] glength: OK
  7706. 706.38 s [vector] +++ OK, passed 100 tests.
  7707. 706.38 s [vector] sum: OK
  7708. 706.38 s [vector] +++ OK, passed 100 tests.
  7709. 706.38 s [vector] product: OK
  7710. 706.38 s [vector] +++ OK, passed 100 tests.
  7711. 706.38 s [vector] enumFromN: OK
  7712. 706.38 s [vector] +++ OK, passed 100 tests.
  7713. 706.38 s [vector] enumFromThenN: OK
  7714. 706.38 s [vector] +++ OK, passed 100 tests.
  7715. 706.38 s [vector] enumFromTo: OK
  7716. 706.38 s [vector] +++ OK, passed 100 tests.
  7717. 706.38 s [vector] enumFromThenTo: OK
  7718. 706.38 s [vector] +++ OK, passed 100 tests; 1 discarded.
  7719. 706.38 s [vector] (Int,Bool)
  7720. 706.38 s [vector] fromList.toList == id: OK
  7721. 706.38 s [vector] +++ OK, passed 100 tests.
  7722. 706.38 s [vector] toList.fromList == id: OK
  7723. 706.38 s [vector] +++ OK, passed 100 tests.
  7724. 706.39 s [vector] unstream.stream == id: OK
  7725. 706.39 s [vector] +++ OK, passed 100 tests.
  7726. 706.39 s [vector] stream.unstream == id: OK
  7727. 706.39 s [vector] +++ OK, passed 100 tests.
  7728. 706.39 s [vector] eq: OK
  7729. 706.39 s [vector] +++ OK, passed 100 tests.
  7730. 706.39 s [vector] length: OK
  7731. 706.39 s [vector] +++ OK, passed 100 tests.
  7732. 706.39 s [vector] null: OK
  7733. 706.39 s [vector] +++ OK, passed 100 tests.
  7734. 706.39 s [vector] index: OK
  7735. 706.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7736. 706.39 s [vector] safeIndex: OK
  7737. 706.39 s [vector] +++ OK, passed 100 tests.
  7738. 706.39 s [vector] head: OK
  7739. 706.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7740. 706.39 s [vector] last: OK
  7741. 706.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7742. 706.40 s [vector] unsafeIndex: OK
  7743. 706.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7744. 706.40 s [vector] unsafeHead: OK
  7745. 706.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7746. 706.40 s [vector] unsafeLast: OK
  7747. 706.40 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7748. 706.40 s [vector] slice: OK
  7749. 706.40 s [vector] +++ OK, passed 100 tests.
  7750. 706.40 s [vector] init: OK
  7751. 706.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7752. 706.40 s [vector] tail: OK
  7753. 706.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7754. 706.40 s [vector] take: OK
  7755. 706.40 s [vector] +++ OK, passed 100 tests.
  7756. 706.40 s [vector] drop: OK
  7757. 706.41 s [vector] +++ OK, passed 100 tests.
  7758. 706.41 s [vector] splitAt: OK
  7759. 706.41 s [vector] +++ OK, passed 100 tests.
  7760. 706.41 s [vector] empty: OK
  7761. 706.41 s [vector] +++ OK, passed 100 tests.
  7762. 706.41 s [vector] singleton: OK
  7763. 706.41 s [vector] +++ OK, passed 100 tests.
  7764. 706.41 s [vector] replicate: OK
  7765. 706.41 s [vector] +++ OK, passed 100 tests.
  7766. 706.41 s [vector] generate: OK
  7767. 706.41 s [vector] +++ OK, passed 100 tests.
  7768. 706.41 s [vector] iterateN: OK
  7769. 706.42 s [vector] +++ OK, passed 100 tests.
  7770. 706.44 s [vector] iterateNM: OK (0.02s)
  7771. 706.44 s [vector] +++ OK, passed 100 tests.
  7772. 706.46 s [vector] generateM: OK (0.03s)
  7773. 706.46 s [vector] +++ OK, passed 100 tests.
  7774. 706.47 s [vector] replicateM: OK (0.01s)
  7775. 706.47 s [vector] +++ OK, passed 100 tests.
  7776. 706.47 s [vector] create: OK
  7777. 706.47 s [vector] +++ OK, passed 100 tests.
  7778. 706.47 s [vector] createT: OK
  7779. 706.47 s [vector] +++ OK, passed 100 tests.
  7780. 706.47 s [vector] unfoldr: OK
  7781. 706.47 s [vector] +++ OK, passed 100 tests.
  7782. 706.47 s [vector] unfoldrN: OK
  7783. 706.48 s [vector] +++ OK, passed 100 tests.
  7784. 706.48 s [vector] unfoldrExactN: OK
  7785. 706.48 s [vector] +++ OK, passed 100 tests.
  7786. 706.48 s [vector] unfoldrM: OK
  7787. 706.48 s [vector] +++ OK, passed 100 tests.
  7788. 706.50 s [vector] unfoldrNM: OK
  7789. 706.50 s [vector] +++ OK, passed 100 tests.
  7790. 706.52 s [vector] unfoldrExactNM: OK (0.03s)
  7791. 706.52 s [vector] +++ OK, passed 100 tests.
  7792. 706.52 s [vector] constructN: OK
  7793. 706.52 s [vector] +++ OK, passed 100 tests.
  7794. 706.53 s [vector] constructrN: OK
  7795. 706.53 s [vector] +++ OK, passed 100 tests.
  7796. 706.53 s [vector] cons: OK
  7797. 706.54 s [vector] +++ OK, passed 100 tests.
  7798. 706.54 s [vector] snoc: OK
  7799. 706.54 s [vector] +++ OK, passed 100 tests.
  7800. 706.54 s [vector] append: OK
  7801. 706.54 s [vector] +++ OK, passed 100 tests.
  7802. 706.58 s [vector] concat: OK (0.05s)
  7803. 706.58 s [vector] +++ OK, passed 100 tests.
  7804. 706.58 s [vector] force: OK
  7805. 706.58 s [vector] +++ OK, passed 100 tests.
  7806. 706.59 s [vector] upd: OK
  7807. 706.59 s [vector] +++ OK, passed 100 tests.
  7808. 706.60 s [vector] accum: OK
  7809. 706.60 s [vector] +++ OK, passed 100 tests.
  7810. 706.60 s [vector] reverse: OK
  7811. 706.60 s [vector] +++ OK, passed 100 tests.
  7812. 706.60 s [vector] backpermute: OK
  7813. 706.60 s [vector] +++ OK, passed 100 tests.
  7814. 706.60 s [vector] map: OK
  7815. 706.61 s [vector] +++ OK, passed 100 tests.
  7816. 706.62 s [vector] imap: OK
  7817. 706.62 s [vector] +++ OK, passed 100 tests.
  7818. 706.62 s [vector] concatMap: OK
  7819. 706.62 s [vector] +++ OK, passed 100 tests.
  7820. 706.62 s [vector] mapM: OK
  7821. 706.64 s [vector] +++ OK, passed 100 tests.
  7822. 706.65 s [vector] mapM_: OK (0.03s)
  7823. 706.65 s [vector] +++ OK, passed 100 tests.
  7824. 706.65 s [vector] forM: OK
  7825. 706.65 s [vector] +++ OK, passed 100 tests.
  7826. 706.68 s [vector] forM_: OK (0.02s)
  7827. 706.68 s [vector] +++ OK, passed 100 tests.
  7828. 706.68 s [vector] imapM: OK
  7829. 706.68 s [vector] +++ OK, passed 100 tests.
  7830. 706.72 s [vector] imapM_: OK (0.04s)
  7831. 706.72 s [vector] +++ OK, passed 100 tests.
  7832. 706.72 s [vector] zipWith: OK
  7833. 706.72 s [vector] +++ OK, passed 100 tests.
  7834. 706.73 s [vector] zipWith3: OK
  7835. 706.73 s [vector] +++ OK, passed 100 tests.
  7836. 706.74 s [vector] izipWith: OK
  7837. 706.74 s [vector] +++ OK, passed 100 tests.
  7838. 706.74 s [vector] izipWith3: OK
  7839. 706.76 s [vector] +++ OK, passed 100 tests.
  7840. 706.76 s [vector] izipWithM: OK
  7841. 706.76 s [vector] +++ OK, passed 100 tests.
  7842. 706.77 s [vector] izipWithM_: OK (0.02s)
  7843. 706.78 s [vector] +++ OK, passed 100 tests.
  7844. 706.78 s [vector] zipWithM: OK
  7845. 706.78 s [vector] +++ OK, passed 100 tests.
  7846. 706.79 s [vector] zipWithM_: OK (0.02s)
  7847. 706.80 s [vector] +++ OK, passed 100 tests.
  7848. 706.80 s [vector] filter: OK
  7849. 706.80 s [vector] +++ OK, passed 100 tests.
  7850. 706.80 s [vector] ifilter: OK
  7851. 706.80 s [vector] +++ OK, passed 100 tests.
  7852. 706.84 s [vector] filterM: OK (0.04s)
  7853. 706.84 s [vector] +++ OK, passed 100 tests.
  7854. 706.84 s [vector] uniq: OK
  7855. 706.84 s [vector] +++ OK, passed 100 tests.
  7856. 706.85 s [vector] mapMaybe: OK
  7857. 706.85 s [vector] +++ OK, passed 100 tests.
  7858. 706.86 s [vector] imapMaybe: OK
  7859. 706.86 s [vector] +++ OK, passed 100 tests.
  7860. 706.86 s [vector] takeWhile: OK
  7861. 706.86 s [vector] +++ OK, passed 100 tests.
  7862. 706.87 s [vector] dropWhile: OK
  7863. 706.87 s [vector] +++ OK, passed 100 tests.
  7864. 706.87 s [vector] partition: OK
  7865. 706.88 s [vector] +++ OK, passed 100 tests.
  7866. 706.88 s [vector] partitionWith: OK
  7867. 706.88 s [vector] +++ OK, passed 100 tests.
  7868. 706.88 s [vector] span: OK
  7869. 706.88 s [vector] +++ OK, passed 100 tests.
  7870. 706.88 s [vector] break: OK
  7871. 706.89 s [vector] +++ OK, passed 100 tests.
  7872. 706.89 s [vector] spanR: OK
  7873. 706.89 s [vector] +++ OK, passed 100 tests.
  7874. 706.90 s [vector] breakR: OK
  7875. 706.90 s [vector] +++ OK, passed 100 tests.
  7876. 706.90 s [vector] groupBy: OK
  7877. 706.90 s [vector] +++ OK, passed 100 tests.
  7878. 706.90 s [vector] elem: OK
  7879. 706.90 s [vector] +++ OK, passed 100 tests.
  7880. 706.90 s [vector] notElem: OK
  7881. 706.90 s [vector] +++ OK, passed 100 tests.
  7882. 706.90 s [vector] find: OK
  7883. 706.90 s [vector] +++ OK, passed 100 tests.
  7884. 706.90 s [vector] findIndex: OK
  7885. 706.90 s [vector] +++ OK, passed 100 tests.
  7886. 706.90 s [vector] findIndexR: OK
  7887. 706.91 s [vector] +++ OK, passed 100 tests.
  7888. 706.91 s [vector] findIndices: OK
  7889. 706.91 s [vector] +++ OK, passed 100 tests.
  7890. 706.91 s [vector] elemIndex: OK
  7891. 706.91 s [vector] +++ OK, passed 100 tests.
  7892. 706.91 s [vector] elemIndices: OK
  7893. 706.91 s [vector] +++ OK, passed 100 tests.
  7894. 706.91 s [vector] foldl: OK
  7895. 706.91 s [vector] +++ OK, passed 100 tests.
  7896. 706.91 s [vector] foldl1: OK
  7897. 706.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7898. 706.91 s [vector] foldl': OK
  7899. 706.91 s [vector] +++ OK, passed 100 tests.
  7900. 706.91 s [vector] foldl1': OK
  7901. 706.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7902. 706.91 s [vector] foldr: OK
  7903. 706.91 s [vector] +++ OK, passed 100 tests.
  7904. 706.91 s [vector] foldr1: OK
  7905. 706.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7906. 706.92 s [vector] foldr': OK
  7907. 706.93 s [vector] +++ OK, passed 100 tests.
  7908. 706.93 s [vector] foldr1': OK
  7909. 706.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7910. 706.94 s [vector] ifoldl: OK
  7911. 706.94 s [vector] +++ OK, passed 100 tests.
  7912. 706.96 s [vector] ifoldl': OK
  7913. 706.96 s [vector] +++ OK, passed 100 tests.
  7914. 706.96 s [vector] ifoldr: OK
  7915. 706.96 s [vector] +++ OK, passed 100 tests.
  7916. 706.96 s [vector] ifoldr': OK
  7917. 706.96 s [vector] +++ OK, passed 100 tests.
  7918. 706.96 s [vector] ifoldM: OK
  7919. 706.96 s [vector] +++ OK, passed 100 tests.
  7920. 706.97 s [vector] ifoldM': OK
  7921. 706.97 s [vector] +++ OK, passed 100 tests.
  7922. 707.02 s [vector] ifoldM_: OK (0.05s)
  7923. 707.02 s [vector] +++ OK, passed 100 tests.
  7924. 707.06 s [vector] ifoldM'_: OK (0.05s)
  7925. 707.06 s [vector] +++ OK, passed 100 tests.
  7926. 707.06 s [vector] all: OK
  7927. 707.06 s [vector] +++ OK, passed 100 tests.
  7928. 707.06 s [vector] any: OK
  7929. 707.06 s [vector] +++ OK, passed 100 tests.
  7930. 707.07 s [vector] prescanl: OK
  7931. 707.08 s [vector] +++ OK, passed 100 tests.
  7932. 707.08 s [vector] prescanl': OK
  7933. 707.08 s [vector] +++ OK, passed 100 tests.
  7934. 707.09 s [vector] postscanl: OK
  7935. 707.10 s [vector] +++ OK, passed 100 tests.
  7936. 707.10 s [vector] postscanl': OK
  7937. 707.10 s [vector] +++ OK, passed 100 tests.
  7938. 707.10 s [vector] scanl: OK
  7939. 707.10 s [vector] +++ OK, passed 100 tests.
  7940. 707.11 s [vector] scanl': OK
  7941. 707.11 s [vector] +++ OK, passed 100 tests.
  7942. 707.12 s [vector] scanl1: OK
  7943. 707.12 s [vector] +++ OK, passed 100 tests.
  7944. 707.13 s [vector] scanl1': OK
  7945. 707.13 s [vector] +++ OK, passed 100 tests.
  7946. 707.14 s [vector] iscanl: OK
  7947. 707.14 s [vector] +++ OK, passed 100 tests.
  7948. 707.14 s [vector] iscanl': OK
  7949. 707.14 s [vector] +++ OK, passed 100 tests.
  7950. 707.14 s [vector] prescanr: OK
  7951. 707.14 s [vector] +++ OK, passed 100 tests.
  7952. 707.14 s [vector] prescanr': OK
  7953. 707.14 s [vector] +++ OK, passed 100 tests.
  7954. 707.14 s [vector] postscanr: OK
  7955. 707.14 s [vector] +++ OK, passed 100 tests.
  7956. 707.14 s [vector] postscanr': OK
  7957. 707.14 s [vector] +++ OK, passed 100 tests.
  7958. 707.15 s [vector] scanr: OK
  7959. 707.15 s [vector] +++ OK, passed 100 tests.
  7960. 707.16 s [vector] scanr': OK
  7961. 707.16 s [vector] +++ OK, passed 100 tests.
  7962. 707.17 s [vector] scanr1: OK
  7963. 707.17 s [vector] +++ OK, passed 100 tests.
  7964. 707.18 s [vector] scanr1': OK
  7965. 707.18 s [vector] +++ OK, passed 100 tests.
  7966. 707.18 s [vector] iscanr: OK
  7967. 707.18 s [vector] +++ OK, passed 100 tests.
  7968. 707.20 s [vector] iscanr': OK
  7969. 707.20 s [vector] +++ OK, passed 100 tests.
  7970. 707.20 s [vector] mut_read: OK
  7971. 707.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7972. 707.20 s [vector] mut_write: OK
  7973. 707.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7974. 707.20 s [vector] mut_modify: OK
  7975. 707.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7976. 707.21 s [vector] mut_generate: OK
  7977. 707.21 s [vector] +++ OK, passed 100 tests.
  7978. 707.21 s [vector] mut_generateM: OK (0.01s)
  7979. 707.21 s [vector] +++ OK, passed 100 tests.
  7980. 707.24 s [vector] mut_mapM_: OK (0.03s)
  7981. 707.24 s [vector] +++ OK, passed 100 tests.
  7982. 707.25 s [vector] mut_imapM_: OK (0.03s)
  7983. 707.25 s [vector] +++ OK, passed 100 tests.
  7984. 707.30 s [vector] mut_forM_: OK (0.02s)
  7985. 707.30 s [vector] +++ OK, passed 100 tests.
  7986. 707.31 s [vector] mut_iforM_: OK (0.03s)
  7987. 707.32 s [vector] +++ OK, passed 100 tests.
  7988. 707.32 s [vector] mut_foldr: OK
  7989. 707.32 s [vector] +++ OK, passed 100 tests.
  7990. 707.32 s [vector] mut_foldr': OK
  7991. 707.33 s [vector] +++ OK, passed 100 tests.
  7992. 707.33 s [vector] mut_foldl: OK
  7993. 707.33 s [vector] +++ OK, passed 100 tests.
  7994. 707.33 s [vector] mut_foldl': OK
  7995. 707.33 s [vector] +++ OK, passed 100 tests.
  7996. 707.34 s [vector] mut_ifoldr: OK
  7997. 707.34 s [vector] +++ OK, passed 100 tests.
  7998. 707.34 s [vector] mut_ifoldr': OK
  7999. 707.35 s [vector] +++ OK, passed 100 tests.
  8000. 707.36 s [vector] mut_ifoldl: OK
  8001. 707.36 s [vector] +++ OK, passed 100 tests.
  8002. 707.36 s [vector] mut_ifoldl': OK
  8003. 707.36 s [vector] +++ OK, passed 100 tests.
  8004. 707.36 s [vector] mut_foldM: OK
  8005. 707.37 s [vector] +++ OK, passed 100 tests.
  8006. 707.38 s [vector] mut_foldM': OK
  8007. 707.38 s [vector] +++ OK, passed 100 tests.
  8008. 707.38 s [vector] mut_foldrM: OK
  8009. 707.38 s [vector] +++ OK, passed 100 tests.
  8010. 707.38 s [vector] mut_foldrM': OK
  8011. 707.39 s [vector] +++ OK, passed 100 tests.
  8012. 707.39 s [vector] mut_ifoldM: OK
  8013. 707.39 s [vector] +++ OK, passed 100 tests.
  8014. 707.40 s [vector] mut_ifoldM': OK
  8015. 707.40 s [vector] +++ OK, passed 100 tests.
  8016. 707.40 s [vector] mut_ifoldrM: OK
  8017. 707.40 s [vector] +++ OK, passed 100 tests.
  8018. 707.40 s [vector] mut_ifoldrM': OK
  8019. 707.40 s [vector] +++ OK, passed 100 tests.
  8020. 707.40 s [vector] compare: OK
  8021. 707.40 s [vector] +++ OK, passed 100 tests.
  8022. 707.40 s [vector] maximum: OK
  8023. 707.40 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8024. 707.40 s [vector] minimum: OK
  8025. 707.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8026. 707.40 s [vector] minIndex: OK
  8027. 707.40 s [vector] +++ OK, passed 100 tests; 26 discarded.
  8028. 707.40 s [vector] maxIndex: OK
  8029. 707.40 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8030. 707.40 s [vector] maximumBy: OK
  8031. 707.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8032. 707.40 s [vector] minimumBy: OK
  8033. 707.40 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8034. 707.40 s [vector] maximumOn: OK
  8035. 707.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8036. 707.40 s [vector] minimumOn: OK
  8037. 707.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8038. 707.41 s [vector] maxIndexBy: OK
  8039. 707.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8040. 707.41 s [vector] minIndexBy: OK
  8041. 707.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8042. 707.41 s [vector] ListFirstMaxIndexWins: OK
  8043. 707.41 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8044. 707.42 s [vector] FalseListFirstMaxIndexWins: OK
  8045. 707.42 s [vector] +++ OK, failed as expected. (after 1 test):
  8046. 707.42 s [vector] Exception:
  8047. 707.42 s [vector] Prelude.foldr1: empty list
  8048. 707.42 s [vector] CallStack (from HasCallStack):
  8049. 707.43 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8050. 707.43 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8051. 707.43 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8052. 707.43 s [vector] []
  8053. 707.43 s [vector] zip: OK
  8054. 707.43 s [vector] +++ OK, passed 100 tests.
  8055. 707.43 s [vector] zip3: OK
  8056. 707.43 s [vector] +++ OK, passed 100 tests.
  8057. 707.43 s [vector] unzip: OK
  8058. 707.43 s [vector] +++ OK, passed 100 tests.
  8059. 707.43 s [vector] unzip3: OK
  8060. 707.44 s [vector] +++ OK, passed 100 tests.
  8061. 707.44 s [vector] indexed: OK
  8062. 707.44 s [vector] +++ OK, passed 100 tests.
  8063. 707.44 s [vector] update: OK
  8064. 707.44 s [vector] +++ OK, passed 100 tests.
  8065. 707.44 s [vector] mempty: OK
  8066. 707.45 s [vector] +++ OK, passed 100 tests.
  8067. 707.45 s [vector] mappend: OK
  8068. 707.45 s [vector] +++ OK, passed 100 tests.
  8069. 707.48 s [vector] mconcat: OK (0.04s)
  8070. 707.48 s [vector] +++ OK, passed 100 tests.
  8071. 707.48 s [vector] glength: OK
  8072. 707.48 s [vector] +++ OK, passed 100 tests.
  8073. 707.48 s [vector] (Int,Bool,Int)
  8074. 707.48 s [vector] fromList.toList == id: OK
  8075. 707.49 s [vector] +++ OK, passed 100 tests.
  8076. 707.49 s [vector] toList.fromList == id: OK
  8077. 707.49 s [vector] +++ OK, passed 100 tests.
  8078. 707.49 s [vector] unstream.stream == id: OK
  8079. 707.49 s [vector] +++ OK, passed 100 tests.
  8080. 707.49 s [vector] stream.unstream == id: OK
  8081. 707.49 s [vector] +++ OK, passed 100 tests.
  8082. 707.49 s [vector] eq: OK
  8083. 707.49 s [vector] +++ OK, passed 100 tests.
  8084. 707.49 s [vector] length: OK
  8085. 707.49 s [vector] +++ OK, passed 100 tests.
  8086. 707.49 s [vector] null: OK
  8087. 707.49 s [vector] +++ OK, passed 100 tests.
  8088. 707.49 s [vector] index: OK
  8089. 707.49 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8090. 707.49 s [vector] safeIndex: OK
  8091. 707.50 s [vector] +++ OK, passed 100 tests.
  8092. 707.50 s [vector] head: OK
  8093. 707.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8094. 707.50 s [vector] last: OK
  8095. 707.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8096. 707.51 s [vector] unsafeIndex: OK
  8097. 707.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8098. 707.51 s [vector] unsafeHead: OK
  8099. 707.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8100. 707.51 s [vector] unsafeLast: OK
  8101. 707.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8102. 707.51 s [vector] slice: OK
  8103. 707.51 s [vector] +++ OK, passed 100 tests.
  8104. 707.51 s [vector] init: OK
  8105. 707.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8106. 707.51 s [vector] tail: OK
  8107. 707.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8108. 707.51 s [vector] take: OK
  8109. 707.51 s [vector] +++ OK, passed 100 tests.
  8110. 707.51 s [vector] drop: OK
  8111. 707.51 s [vector] +++ OK, passed 100 tests.
  8112. 707.52 s [vector] splitAt: OK
  8113. 707.52 s [vector] +++ OK, passed 100 tests.
  8114. 707.52 s [vector] empty: OK
  8115. 707.52 s [vector] +++ OK, passed 100 tests.
  8116. 707.52 s [vector] singleton: OK
  8117. 707.52 s [vector] +++ OK, passed 100 tests.
  8118. 707.52 s [vector] replicate: OK
  8119. 707.52 s [vector] +++ OK, passed 100 tests.
  8120. 707.52 s [vector] generate: OK
  8121. 707.54 s [vector] +++ OK, passed 100 tests.
  8122. 707.54 s [vector] iterateN: OK
  8123. 707.54 s [vector] +++ OK, passed 100 tests.
  8124. 707.58 s [vector] iterateNM: OK (0.04s)
  8125. 707.58 s [vector] +++ OK, passed 100 tests.
  8126. 707.60 s [vector] generateM: OK (0.03s)
  8127. 707.60 s [vector] +++ OK, passed 100 tests.
  8128. 707.60 s [vector] replicateM: OK
  8129. 707.60 s [vector] +++ OK, passed 100 tests.
  8130. 707.60 s [vector] create: OK
  8131. 707.60 s [vector] +++ OK, passed 100 tests.
  8132. 707.61 s [vector] createT: OK
  8133. 707.61 s [vector] +++ OK, passed 100 tests.
  8134. 707.61 s [vector] unfoldr: OK
  8135. 707.61 s [vector] +++ OK, passed 100 tests.
  8136. 707.61 s [vector] unfoldrN: OK
  8137. 707.61 s [vector] +++ OK, passed 100 tests.
  8138. 707.62 s [vector] unfoldrExactN: OK
  8139. 707.62 s [vector] +++ OK, passed 100 tests.
  8140. 707.62 s [vector] unfoldrM: OK
  8141. 707.62 s [vector] +++ OK, passed 100 tests.
  8142. 707.62 s [vector] unfoldrNM: OK
  8143. 707.62 s [vector] +++ OK, passed 100 tests.
  8144. 707.66 s [vector] unfoldrExactNM: OK (0.04s)
  8145. 707.66 s [vector] +++ OK, passed 100 tests.
  8146. 707.67 s [vector] constructN: OK
  8147. 707.67 s [vector] +++ OK, passed 100 tests.
  8148. 707.68 s [vector] constructrN: OK
  8149. 707.68 s [vector] +++ OK, passed 100 tests.
  8150. 707.68 s [vector] cons: OK
  8151. 707.68 s [vector] +++ OK, passed 100 tests.
  8152. 707.70 s [vector] snoc: OK
  8153. 707.70 s [vector] +++ OK, passed 100 tests.
  8154. 707.70 s [vector] append: OK
  8155. 707.70 s [vector] +++ OK, passed 100 tests.
  8156. 707.74 s [vector] concat: OK (0.05s)
  8157. 707.74 s [vector] +++ OK, passed 100 tests.
  8158. 707.74 s [vector] force: OK
  8159. 707.74 s [vector] +++ OK, passed 100 tests.
  8160. 707.74 s [vector] upd: OK
  8161. 707.76 s [vector] +++ OK, passed 100 tests.
  8162. 707.76 s [vector] accum: OK (0.02s)
  8163. 707.77 s [vector] +++ OK, passed 100 tests.
  8164. 707.77 s [vector] reverse: OK
  8165. 707.77 s [vector] +++ OK, passed 100 tests.
  8166. 707.77 s [vector] backpermute: OK
  8167. 707.77 s [vector] +++ OK, passed 100 tests.
  8168. 707.79 s [vector] map: OK (0.01s)
  8169. 707.80 s [vector] +++ OK, passed 100 tests.
  8170. 707.80 s [vector] imap: OK
  8171. 707.81 s [vector] +++ OK, passed 100 tests.
  8172. 707.81 s [vector] concatMap: OK
  8173. 707.81 s [vector] +++ OK, passed 100 tests.
  8174. 707.82 s [vector] mapM: OK
  8175. 707.82 s [vector] +++ OK, passed 100 tests.
  8176. 707.87 s [vector] mapM_: OK (0.05s)
  8177. 707.87 s [vector] +++ OK, passed 100 tests.
  8178. 707.88 s [vector] forM: OK
  8179. 707.88 s [vector] +++ OK, passed 100 tests.
  8180. 707.94 s [vector] forM_: OK (0.06s)
  8181. 707.94 s [vector] +++ OK, passed 100 tests.
  8182. 707.94 s [vector] imapM: OK (0.01s)
  8183. 707.94 s [vector] +++ OK, passed 100 tests.
  8184. 708.00 s [vector] imapM_: OK (0.05s)
  8185. 708.00 s [vector] +++ OK, passed 100 tests.
  8186. 708.02 s [vector] zipWith: OK (0.01s)
  8187. 708.02 s [vector] +++ OK, passed 100 tests.
  8188. 708.02 s [vector] zipWith3: OK (0.01s)
  8189. 708.02 s [vector] +++ OK, passed 100 tests.
  8190. 708.04 s [vector] izipWith: OK (0.01s)
  8191. 708.04 s [vector] +++ OK, passed 100 tests.
  8192. 708.06 s [vector] izipWith3: OK (0.01s)
  8193. 708.06 s [vector] +++ OK, passed 100 tests.
  8194. 708.06 s [vector] izipWithM: OK (0.01s)
  8195. 708.06 s [vector] +++ OK, passed 100 tests.
  8196. 708.10 s [vector] izipWithM_: OK (0.04s)
  8197. 708.10 s [vector] +++ OK, passed 100 tests.
  8198. 708.12 s [vector] zipWithM: OK (0.01s)
  8199. 708.12 s [vector] +++ OK, passed 100 tests.
  8200. 708.16 s [vector] zipWithM_: OK (0.05s)
  8201. 708.17 s [vector] +++ OK, passed 100 tests.
  8202. 708.18 s [vector] filter: OK
  8203. 708.18 s [vector] +++ OK, passed 100 tests.
  8204. 708.18 s [vector] ifilter: OK
  8205. 708.18 s [vector] +++ OK, passed 100 tests.
  8206. 708.24 s [vector] filterM: OK (0.07s)
  8207. 708.24 s [vector] +++ OK, passed 100 tests.
  8208. 708.24 s [vector] uniq: OK
  8209. 708.24 s [vector] +++ OK, passed 100 tests.
  8210. 708.25 s [vector] mapMaybe: OK
  8211. 708.25 s [vector] +++ OK, passed 100 tests.
  8212. 708.25 s [vector] imapMaybe: OK
  8213. 708.25 s [vector] +++ OK, passed 100 tests.
  8214. 708.25 s [vector] takeWhile: OK
  8215. 708.26 s [vector] +++ OK, passed 100 tests.
  8216. 708.26 s [vector] dropWhile: OK
  8217. 708.26 s [vector] +++ OK, passed 100 tests.
  8218. 708.26 s [vector] partition: OK
  8219. 708.26 s [vector] +++ OK, passed 100 tests.
  8220. 708.27 s [vector] partitionWith: OK
  8221. 708.27 s [vector] +++ OK, passed 100 tests.
  8222. 708.28 s [vector] span: OK
  8223. 708.28 s [vector] +++ OK, passed 100 tests.
  8224. 708.28 s [vector] break: OK
  8225. 708.28 s [vector] +++ OK, passed 100 tests.
  8226. 708.28 s [vector] spanR: OK
  8227. 708.28 s [vector] +++ OK, passed 100 tests.
  8228. 708.28 s [vector] breakR: OK
  8229. 708.28 s [vector] +++ OK, passed 100 tests.
  8230. 708.29 s [vector] groupBy: OK
  8231. 708.29 s [vector] +++ OK, passed 100 tests.
  8232. 708.29 s [vector] elem: OK
  8233. 708.29 s [vector] +++ OK, passed 100 tests.
  8234. 708.29 s [vector] notElem: OK
  8235. 708.30 s [vector] +++ OK, passed 100 tests.
  8236. 708.30 s [vector] find: OK
  8237. 708.30 s [vector] +++ OK, passed 100 tests.
  8238. 708.30 s [vector] findIndex: OK
  8239. 708.30 s [vector] +++ OK, passed 100 tests.
  8240. 708.30 s [vector] findIndexR: OK
  8241. 708.31 s [vector] +++ OK, passed 100 tests.
  8242. 708.31 s [vector] findIndices: OK
  8243. 708.31 s [vector] +++ OK, passed 100 tests.
  8244. 708.31 s [vector] elemIndex: OK
  8245. 708.31 s [vector] +++ OK, passed 100 tests.
  8246. 708.31 s [vector] elemIndices: OK
  8247. 708.31 s [vector] +++ OK, passed 100 tests.
  8248. 708.32 s [vector] foldl: OK
  8249. 708.32 s [vector] +++ OK, passed 100 tests.
  8250. 708.33 s [vector] foldl1: OK
  8251. 708.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8252. 708.33 s [vector] foldl': OK
  8253. 708.33 s [vector] +++ OK, passed 100 tests.
  8254. 708.34 s [vector] foldl1': OK
  8255. 708.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8256. 708.36 s [vector] foldr: OK
  8257. 708.36 s [vector] +++ OK, passed 100 tests.
  8258. 708.36 s [vector] foldr1: OK
  8259. 708.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8260. 708.36 s [vector] foldr': OK
  8261. 708.36 s [vector] +++ OK, passed 100 tests.
  8262. 708.37 s [vector] foldr1': OK
  8263. 708.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8264. 708.38 s [vector] ifoldl: OK
  8265. 708.38 s [vector] +++ OK, passed 100 tests.
  8266. 708.38 s [vector] ifoldl': OK
  8267. 708.38 s [vector] +++ OK, passed 100 tests.
  8268. 708.40 s [vector] ifoldr: OK (0.01s)
  8269. 708.40 s [vector] +++ OK, passed 100 tests.
  8270. 708.42 s [vector] ifoldr': OK (0.01s)
  8271. 708.42 s [vector] +++ OK, passed 100 tests.
  8272. 708.42 s [vector] ifoldM: OK
  8273. 708.42 s [vector] +++ OK, passed 100 tests.
  8274. 708.42 s [vector] ifoldM': OK
  8275. 708.42 s [vector] +++ OK, passed 100 tests.
  8276. 708.48 s [vector] ifoldM_: OK (0.04s)
  8277. 708.48 s [vector] +++ OK, passed 100 tests.
  8278. 708.51 s [vector] ifoldM'_: OK (0.04s)
  8279. 708.51 s [vector] +++ OK, passed 100 tests.
  8280. 708.51 s [vector] all: OK
  8281. 708.51 s [vector] +++ OK, passed 100 tests.
  8282. 708.52 s [vector] any: OK
  8283. 708.52 s [vector] +++ OK, passed 100 tests.
  8284. 708.52 s [vector] prescanl: OK
  8285. 708.52 s [vector] +++ OK, passed 100 tests.
  8286. 708.54 s [vector] prescanl': OK
  8287. 708.54 s [vector] +++ OK, passed 100 tests.
  8288. 708.54 s [vector] postscanl: OK
  8289. 708.54 s [vector] +++ OK, passed 100 tests.
  8290. 708.55 s [vector] postscanl': OK
  8291. 708.55 s [vector] +++ OK, passed 100 tests.
  8292. 708.56 s [vector] scanl: OK
  8293. 708.56 s [vector] +++ OK, passed 100 tests.
  8294. 708.56 s [vector] scanl': OK
  8295. 708.57 s [vector] +++ OK, passed 100 tests.
  8296. 708.58 s [vector] scanl1: OK
  8297. 708.58 s [vector] +++ OK, passed 100 tests.
  8298. 708.58 s [vector] scanl1': OK
  8299. 708.58 s [vector] +++ OK, passed 100 tests.
  8300. 708.60 s [vector] iscanl: OK
  8301. 708.60 s [vector] +++ OK, passed 100 tests.
  8302. 708.60 s [vector] iscanl': OK
  8303. 708.60 s [vector] +++ OK, passed 100 tests.
  8304. 708.61 s [vector] prescanr: OK
  8305. 708.61 s [vector] +++ OK, passed 100 tests.
  8306. 708.61 s [vector] prescanr': OK
  8307. 708.61 s [vector] +++ OK, passed 100 tests.
  8308. 708.63 s [vector] postscanr: OK
  8309. 708.64 s [vector] +++ OK, passed 100 tests.
  8310. 708.64 s [vector] postscanr': OK
  8311. 708.64 s [vector] +++ OK, passed 100 tests.
  8312. 708.64 s [vector] scanr: OK
  8313. 708.64 s [vector] +++ OK, passed 100 tests.
  8314. 708.64 s [vector] scanr': OK
  8315. 708.64 s [vector] +++ OK, passed 100 tests.
  8316. 708.65 s [vector] scanr1: OK
  8317. 708.65 s [vector] +++ OK, passed 100 tests.
  8318. 708.67 s [vector] scanr1': OK
  8319. 708.68 s [vector] +++ OK, passed 100 tests.
  8320. 708.68 s [vector] iscanr: OK
  8321. 708.68 s [vector] +++ OK, passed 100 tests.
  8322. 708.68 s [vector] iscanr': OK
  8323. 708.68 s [vector] +++ OK, passed 100 tests.
  8324. 708.68 s [vector] mut_read: OK
  8325. 708.68 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8326. 708.68 s [vector] mut_write: OK
  8327. 708.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8328. 708.68 s [vector] mut_modify: OK
  8329. 708.68 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8330. 708.70 s [vector] mut_generate: OK
  8331. 708.70 s [vector] +++ OK, passed 100 tests.
  8332. 708.71 s [vector] mut_generateM: OK (0.02s)
  8333. 708.71 s [vector] +++ OK, passed 100 tests.
  8334. 708.76 s [vector] mut_mapM_: OK (0.03s)
  8335. 708.76 s [vector] +++ OK, passed 100 tests.
  8336. 708.82 s [vector] mut_imapM_: OK (0.05s)
  8337. 708.82 s [vector] +++ OK, passed 100 tests.
  8338. 708.86 s [vector] mut_forM_: OK (0.04s)
  8339. 708.86 s [vector] +++ OK, passed 100 tests.
  8340. 708.90 s [vector] mut_iforM_: OK (0.04s)
  8341. 708.90 s [vector] +++ OK, passed 100 tests.
  8342. 708.90 s [vector] mut_foldr: OK
  8343. 708.90 s [vector] +++ OK, passed 100 tests.
  8344. 708.91 s [vector] mut_foldr': OK
  8345. 708.91 s [vector] +++ OK, passed 100 tests.
  8346. 708.91 s [vector] mut_foldl: OK
  8347. 708.92 s [vector] +++ OK, passed 100 tests.
  8348. 708.92 s [vector] mut_foldl': OK
  8349. 708.92 s [vector] +++ OK, passed 100 tests.
  8350. 708.92 s [vector] mut_ifoldr: OK
  8351. 708.92 s [vector] +++ OK, passed 100 tests.
  8352. 708.94 s [vector] mut_ifoldr': OK
  8353. 708.94 s [vector] +++ OK, passed 100 tests.
  8354. 708.94 s [vector] mut_ifoldl: OK
  8355. 708.95 s [vector] +++ OK, passed 100 tests.
  8356. 708.96 s [vector] mut_ifoldl': OK
  8357. 708.96 s [vector] +++ OK, passed 100 tests.
  8358. 708.96 s [vector] mut_foldM: OK
  8359. 708.96 s [vector] +++ OK, passed 100 tests.
  8360. 708.97 s [vector] mut_foldM': OK
  8361. 708.97 s [vector] +++ OK, passed 100 tests.
  8362. 708.97 s [vector] mut_foldrM: OK
  8363. 708.97 s [vector] +++ OK, passed 100 tests.
  8364. 708.99 s [vector] mut_foldrM': OK
  8365. 708.99 s [vector] +++ OK, passed 100 tests.
  8366. 709.00 s [vector] mut_ifoldM: OK
  8367. 709.00 s [vector] +++ OK, passed 100 tests.
  8368. 709.00 s [vector] mut_ifoldM': OK
  8369. 709.00 s [vector] +++ OK, passed 100 tests.
  8370. 709.01 s [vector] mut_ifoldrM: OK
  8371. 709.01 s [vector] +++ OK, passed 100 tests.
  8372. 709.01 s [vector] mut_ifoldrM': OK
  8373. 709.01 s [vector] +++ OK, passed 100 tests.
  8374. 709.01 s [vector] compare: OK
  8375. 709.01 s [vector] +++ OK, passed 100 tests.
  8376. 709.01 s [vector] maximum: OK
  8377. 709.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8378. 709.02 s [vector] minimum: OK
  8379. 709.02 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8380. 709.02 s [vector] minIndex: OK
  8381. 709.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8382. 709.02 s [vector] maxIndex: OK
  8383. 709.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8384. 709.02 s [vector] maximumBy: OK
  8385. 709.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8386. 709.02 s [vector] minimumBy: OK
  8387. 709.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8388. 709.02 s [vector] maximumOn: OK
  8389. 709.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8390. 709.02 s [vector] minimumOn: OK
  8391. 709.03 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8392. 709.03 s [vector] maxIndexBy: OK
  8393. 709.03 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8394. 709.03 s [vector] minIndexBy: OK
  8395. 709.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8396. 709.03 s [vector] ListFirstMaxIndexWins: OK
  8397. 709.03 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8398. 709.04 s [vector] FalseListFirstMaxIndexWins: OK
  8399. 709.04 s [vector] +++ OK, failed as expected. (after 1 test):
  8400. 709.04 s [vector] Exception:
  8401. 709.04 s [vector] Prelude.foldr1: empty list
  8402. 709.04 s [vector] CallStack (from HasCallStack):
  8403. 709.04 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8404. 709.04 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8405. 709.04 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8406. 709.04 s [vector] []
  8407. 709.04 s [vector] zip: OK
  8408. 709.04 s [vector] +++ OK, passed 100 tests.
  8409. 709.05 s [vector] zip3: OK
  8410. 709.05 s [vector] +++ OK, passed 100 tests.
  8411. 709.06 s [vector] unzip: OK
  8412. 709.06 s [vector] +++ OK, passed 100 tests.
  8413. 709.06 s [vector] unzip3: OK
  8414. 709.06 s [vector] +++ OK, passed 100 tests.
  8415. 709.06 s [vector] indexed: OK
  8416. 709.06 s [vector] +++ OK, passed 100 tests.
  8417. 709.06 s [vector] update: OK
  8418. 709.06 s [vector] +++ OK, passed 100 tests.
  8419. 709.06 s [vector] mempty: OK
  8420. 709.06 s [vector] +++ OK, passed 100 tests.
  8421. 709.08 s [vector] mappend: OK
  8422. 709.08 s [vector] +++ OK, passed 100 tests.
  8423. 709.13 s [vector] mconcat: OK (0.06s)
  8424. 709.13 s [vector] +++ OK, passed 100 tests.
  8425. 709.13 s [vector] glength: OK
  8426. 709.13 s [vector] +++ OK, passed 100 tests.
  8427. 709.13 s [vector] unstream
  8428. 709.13 s [vector] unstream == vunstream (exact): OK
  8429. 709.13 s [vector] +++ OK, passed 100 tests.
  8430. 709.13 s [vector] unstream == vunstream (unknown): OK
  8431. 709.13 s [vector] +++ OK, passed 100 tests.
  8432. 709.14 s [vector] unstreamR ~= vunstream (exact): OK
  8433. 709.14 s [vector] +++ OK, passed 100 tests.
  8434. 709.14 s [vector] unstreamR ~= vunstream (unknown): OK
  8435. 709.14 s [vector] +++ OK, passed 100 tests.
  8436. 709.14 s [vector] Data.Vector.Storable.Vector Alignment
  8437. 709.14 s [vector] Aligned Double: OK
  8438. 709.14 s [vector] Aligned Int: OK
  8439. 709.14 s [vector] Regression tests
  8440. 709.14 s [vector] enumFromTo crash #188
  8441. 709.14 s [vector] Word8: OK
  8442. 709.14 s [vector] Word16: OK
  8443. 709.14 s [vector] Word32: OK
  8444. 709.14 s [vector] Word64: OK
  8445. 709.14 s [vector] Word: OK
  8446. 709.14 s [vector] Int8: OK
  8447. 709.14 s [vector] Int16: OK
  8448. 709.14 s [vector] Int32: OK
  8449. 709.14 s [vector] Int64: OK
  8450. 709.14 s [vector] Int: OK
  8451. 709.14 s [vector] Char: OK
  8452. 709.14 s [vector] Negative tests
  8453. 709.14 s [vector] slice out of bounds #257
  8454. 709.14 s [vector] Boxed
  8455. 709.14 s [vector] Negative ix: OK
  8456. 709.14 s [vector] Negative size: OK
  8457. 709.14 s [vector] Negative ix and size: OK
  8458. 709.14 s [vector] Too large ix: OK
  8459. 709.14 s [vector] Too large size: OK
  8460. 709.14 s [vector] Too large ix and size: OK
  8461. 709.14 s [vector] Overflow: OK
  8462. 709.14 s [vector] OutOfMemory: OK
  8463. 709.14 s [vector] Primitive
  8464. 709.14 s [vector] Negative ix: OK
  8465. 709.14 s [vector] Negative size: OK
  8466. 709.14 s [vector] Negative ix and size: OK
  8467. 709.14 s [vector] Too large ix: OK
  8468. 709.14 s [vector] Too large size: OK
  8469. 709.14 s [vector] Too large ix and size: OK
  8470. 709.14 s [vector] Overflow: OK
  8471. 709.14 s [vector] OutOfMemory: OK
  8472. 709.14 s [vector] Storable
  8473. 709.14 s [vector] Negative ix: OK
  8474. 709.14 s [vector] Negative size: OK
  8475. 709.14 s [vector] Negative ix and size: OK
  8476. 709.14 s [vector] Too large ix: OK
  8477. 709.14 s [vector] Too large size: OK
  8478. 709.14 s [vector] Too large ix and size: OK
  8479. 709.14 s [vector] Overflow: OK
  8480. 709.14 s [vector] OutOfMemory: OK
  8481. 709.14 s [vector] Unboxed
  8482. 709.14 s [vector] Negative ix: OK
  8483. 709.14 s [vector] Negative size: OK
  8484. 709.14 s [vector] Negative ix and size: OK
  8485. 709.14 s [vector] Too large ix: OK
  8486. 709.14 s [vector] Too large size: OK
  8487. 709.14 s [vector] Too large ix and size: OK
  8488. 709.14 s [vector] Overflow: OK
  8489. 709.14 s [vector] OutOfMemory: OK
  8490. 709.14 s [vector] take #282
  8491. 709.14 s [vector] Boxed: OK
  8492. 709.14 s [vector] Primitive: OK
  8493. 709.14 s [vector] Storable: OK
  8494. 709.14 s [vector] Unboxed: OK
  8495. 709.14 s [vector] Data.Vector
  8496. 709.14 s [vector] MonadFix: OK
  8497. 709.14 s [vector] toFromArray: OK
  8498. 709.14 s [vector] toFromArraySlice: OK
  8499. 709.14 s [vector] toFromArraySliceUnsafe: OK
  8500. 709.14 s [vector] toFromMutableArray: OK
  8501. 709.14 s [vector] Data.Vector.Mutable (Move): OK
  8502. 709.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8503. 709.14 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  8504. 709.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8505. 709.14 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  8506. 709.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8507. 709.15 s [vector] Data.Vector.Storable.Mutable (Move): OK
  8508. 709.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8509. 709.15 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  8510. 709.15 s [vector] +++ OK, passed 100 tests.
  8511. 709.16 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  8512. 709.16 s [vector] +++ OK, passed 100 tests.
  8513. 709.16 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  8514. 709.16 s [vector] +++ OK, passed 100 tests.
  8515. 709.16 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  8516. 709.16 s [vector] +++ OK, passed 100 tests.
  8517. 709.16 s [vector]
  8518. 709.16 s [vector] All 2808 tests passed (15.02s)
  8519. 709.17 s [vector] Test suite vector-tests-O0: PASS
  8520. 709.17 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  8521. 709.17 s [vector] Test suite vector-tests-O2: RUNNING...
  8522. 709.30 s [vector] toplevel
  8523. 709.30 s [vector] Data.Vector.Fusion.Bundle
  8524. 709.30 s [vector] fromList.toList == id: OK
  8525. 709.30 s [vector] +++ OK, passed 100 tests.
  8526. 709.30 s [vector] toList.fromList == id: OK
  8527. 709.30 s [vector] +++ OK, passed 100 tests.
  8528. 709.30 s [vector] eq: OK
  8529. 709.30 s [vector] +++ OK, passed 100 tests.
  8530. 709.30 s [vector] length: OK
  8531. 709.30 s [vector] +++ OK, passed 100 tests.
  8532. 709.31 s [vector] null: OK
  8533. 709.31 s [vector] +++ OK, passed 100 tests.
  8534. 709.31 s [vector] empty: OK
  8535. 709.31 s [vector] +++ OK, passed 100 tests.
  8536. 709.31 s [vector] singleton: OK
  8537. 709.31 s [vector] +++ OK, passed 100 tests.
  8538. 709.31 s [vector] replicate: OK
  8539. 709.31 s [vector] +++ OK, passed 100 tests.
  8540. 709.31 s [vector] cons: OK
  8541. 709.31 s [vector] +++ OK, passed 100 tests.
  8542. 709.31 s [vector] snoc: OK
  8543. 709.31 s [vector] +++ OK, passed 100 tests.
  8544. 709.31 s [vector] append: OK
  8545. 709.31 s [vector] +++ OK, passed 100 tests.
  8546. 709.31 s [vector] head: OK
  8547. 709.31 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8548. 709.31 s [vector] last: OK
  8549. 709.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8550. 709.32 s [vector] index: OK
  8551. 709.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8552. 709.32 s [vector] extract: OK
  8553. 709.32 s [vector] +++ OK, passed 100 tests.
  8554. 709.32 s [vector] init: OK
  8555. 709.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8556. 709.32 s [vector] tail: OK
  8557. 709.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8558. 709.32 s [vector] take: OK
  8559. 709.32 s [vector] +++ OK, passed 100 tests.
  8560. 709.32 s [vector] drop: OK
  8561. 709.32 s [vector] +++ OK, passed 100 tests.
  8562. 709.32 s [vector] map: OK
  8563. 709.32 s [vector] +++ OK, passed 100 tests.
  8564. 709.32 s [vector] zipWith: OK
  8565. 709.32 s [vector] +++ OK, passed 100 tests.
  8566. 709.32 s [vector] zipWith3: OK
  8567. 709.32 s [vector] +++ OK, passed 100 tests.
  8568. 709.32 s [vector] filter: OK
  8569. 709.32 s [vector] +++ OK, passed 100 tests.
  8570. 709.32 s [vector] takeWhile: OK
  8571. 709.32 s [vector] +++ OK, passed 100 tests.
  8572. 709.32 s [vector] dropWhile: OK
  8573. 709.32 s [vector] +++ OK, passed 100 tests.
  8574. 709.32 s [vector] elem: OK
  8575. 709.32 s [vector] +++ OK, passed 100 tests.
  8576. 709.32 s [vector] notElem: OK
  8577. 709.32 s [vector] +++ OK, passed 100 tests.
  8578. 709.32 s [vector] find: OK
  8579. 709.32 s [vector] +++ OK, passed 100 tests.
  8580. 709.32 s [vector] findIndex: OK
  8581. 709.32 s [vector] +++ OK, passed 100 tests.
  8582. 709.32 s [vector] foldl: OK
  8583. 709.33 s [vector] +++ OK, passed 100 tests.
  8584. 709.33 s [vector] foldl1: OK
  8585. 709.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8586. 709.33 s [vector] foldl': OK
  8587. 709.33 s [vector] +++ OK, passed 100 tests.
  8588. 709.33 s [vector] foldl1': OK
  8589. 709.33 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8590. 709.33 s [vector] foldr: OK
  8591. 709.33 s [vector] +++ OK, passed 100 tests.
  8592. 709.33 s [vector] foldr1: OK
  8593. 709.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8594. 709.33 s [vector] prescanl: OK
  8595. 709.33 s [vector] +++ OK, passed 100 tests.
  8596. 709.33 s [vector] prescanl': OK
  8597. 709.33 s [vector] +++ OK, passed 100 tests.
  8598. 709.33 s [vector] postscanl: OK
  8599. 709.33 s [vector] +++ OK, passed 100 tests.
  8600. 709.33 s [vector] postscanl': OK
  8601. 709.33 s [vector] +++ OK, passed 100 tests.
  8602. 709.33 s [vector] scanl: OK
  8603. 709.33 s [vector] +++ OK, passed 100 tests.
  8604. 709.33 s [vector] scanl': OK
  8605. 709.33 s [vector] +++ OK, passed 100 tests.
  8606. 709.33 s [vector] scanl1: OK
  8607. 709.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8608. 709.33 s [vector] scanl1': OK
  8609. 709.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8610. 709.33 s [vector] concatMap: OK
  8611. 709.33 s [vector] +++ OK, passed 100 tests.
  8612. 709.33 s [vector] unfoldr: OK
  8613. 709.33 s [vector] +++ OK, passed 100 tests.
  8614. 709.33 s [vector] and: OK
  8615. 709.33 s [vector] +++ OK, passed 100 tests.
  8616. 709.33 s [vector] or: OK
  8617. 709.33 s [vector] +++ OK, passed 100 tests.
  8618. 709.33 s [vector] Tests.Vector.Boxed
  8619. 709.33 s [vector] Bool
  8620. 709.34 s [vector] fromList.toList == id: OK
  8621. 709.34 s [vector] +++ OK, passed 100 tests.
  8622. 709.34 s [vector] toList.fromList == id: OK
  8623. 709.34 s [vector] +++ OK, passed 100 tests.
  8624. 709.34 s [vector] unstream.stream == id: OK
  8625. 709.34 s [vector] +++ OK, passed 100 tests.
  8626. 709.34 s [vector] stream.unstream == id: OK
  8627. 709.34 s [vector] +++ OK, passed 100 tests.
  8628. 709.34 s [vector] eq: OK
  8629. 709.34 s [vector] +++ OK, passed 100 tests.
  8630. 709.34 s [vector] length: OK
  8631. 709.34 s [vector] +++ OK, passed 100 tests.
  8632. 709.34 s [vector] null: OK
  8633. 709.34 s [vector] +++ OK, passed 100 tests.
  8634. 709.34 s [vector] index: OK
  8635. 709.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8636. 709.34 s [vector] safeIndex: OK
  8637. 709.34 s [vector] +++ OK, passed 100 tests.
  8638. 709.34 s [vector] head: OK
  8639. 709.34 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8640. 709.34 s [vector] last: OK
  8641. 709.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8642. 709.34 s [vector] unsafeIndex: OK
  8643. 709.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8644. 709.34 s [vector] unsafeHead: OK
  8645. 709.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8646. 709.34 s [vector] unsafeLast: OK
  8647. 709.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8648. 709.34 s [vector] slice: OK
  8649. 709.34 s [vector] +++ OK, passed 100 tests.
  8650. 709.34 s [vector] init: OK
  8651. 709.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8652. 709.34 s [vector] tail: OK
  8653. 709.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8654. 709.35 s [vector] take: OK
  8655. 709.35 s [vector] +++ OK, passed 100 tests.
  8656. 709.35 s [vector] drop: OK
  8657. 709.35 s [vector] +++ OK, passed 100 tests.
  8658. 709.35 s [vector] splitAt: OK
  8659. 709.35 s [vector] +++ OK, passed 100 tests.
  8660. 709.35 s [vector] empty: OK
  8661. 709.35 s [vector] +++ OK, passed 100 tests.
  8662. 709.35 s [vector] singleton: OK
  8663. 709.35 s [vector] +++ OK, passed 100 tests.
  8664. 709.35 s [vector] replicate: OK
  8665. 709.35 s [vector] +++ OK, passed 100 tests.
  8666. 709.35 s [vector] generate: OK
  8667. 709.35 s [vector] +++ OK, passed 100 tests.
  8668. 709.35 s [vector] iterateN: OK
  8669. 709.35 s [vector] +++ OK, passed 100 tests.
  8670. 709.35 s [vector] iterateNM: OK (0.02s)
  8671. 709.35 s [vector] +++ OK, passed 100 tests.
  8672. 709.35 s [vector] generateM: OK (0.02s)
  8673. 709.35 s [vector] +++ OK, passed 100 tests.
  8674. 709.35 s [vector] replicateM: OK
  8675. 709.35 s [vector] +++ OK, passed 100 tests.
  8676. 709.35 s [vector] create: OK
  8677. 709.35 s [vector] +++ OK, passed 100 tests.
  8678. 709.35 s [vector] createT: OK
  8679. 709.35 s [vector] +++ OK, passed 100 tests.
  8680. 709.35 s [vector] unfoldr: OK
  8681. 709.35 s [vector] +++ OK, passed 100 tests.
  8682. 709.35 s [vector] unfoldrN: OK
  8683. 709.35 s [vector] +++ OK, passed 100 tests.
  8684. 709.35 s [vector] unfoldrExactN: OK
  8685. 709.35 s [vector] +++ OK, passed 100 tests.
  8686. 709.35 s [vector] unfoldrM: OK
  8687. 709.35 s [vector] +++ OK, passed 100 tests.
  8688. 709.35 s [vector] unfoldrNM: OK
  8689. 709.35 s [vector] +++ OK, passed 100 tests.
  8690. 709.35 s [vector] unfoldrExactNM: OK (0.01s)
  8691. 709.35 s [vector] +++ OK, passed 100 tests.
  8692. 709.35 s [vector] constructN: OK
  8693. 709.35 s [vector] +++ OK, passed 100 tests.
  8694. 709.35 s [vector] constructrN: OK
  8695. 709.35 s [vector] +++ OK, passed 100 tests.
  8696. 709.35 s [vector] cons: OK
  8697. 709.35 s [vector] +++ OK, passed 100 tests.
  8698. 709.35 s [vector] snoc: OK
  8699. 709.35 s [vector] +++ OK, passed 100 tests.
  8700. 709.35 s [vector] append: OK
  8701. 709.36 s [vector] +++ OK, passed 100 tests.
  8702. 709.37 s [vector] concat: OK
  8703. 709.37 s [vector] +++ OK, passed 100 tests.
  8704. 709.38 s [vector] force: OK
  8705. 709.38 s [vector] +++ OK, passed 100 tests.
  8706. 709.38 s [vector] upd: OK
  8707. 709.38 s [vector] +++ OK, passed 100 tests.
  8708. 709.38 s [vector] accum: OK
  8709. 709.38 s [vector] +++ OK, passed 100 tests.
  8710. 709.39 s [vector] reverse: OK
  8711. 709.39 s [vector] +++ OK, passed 100 tests.
  8712. 709.39 s [vector] backpermute: OK
  8713. 709.39 s [vector] +++ OK, passed 100 tests.
  8714. 709.39 s [vector] map: OK
  8715. 709.39 s [vector] +++ OK, passed 100 tests.
  8716. 709.39 s [vector] imap: OK
  8717. 709.39 s [vector] +++ OK, passed 100 tests.
  8718. 709.39 s [vector] concatMap: OK
  8719. 709.39 s [vector] +++ OK, passed 100 tests.
  8720. 709.39 s [vector] mapM: OK
  8721. 709.39 s [vector] +++ OK, passed 100 tests.
  8722. 709.39 s [vector] mapM_: OK (0.01s)
  8723. 709.39 s [vector] +++ OK, passed 100 tests.
  8724. 709.39 s [vector] forM: OK
  8725. 709.39 s [vector] +++ OK, passed 100 tests.
  8726. 709.39 s [vector] forM_: OK
  8727. 709.39 s [vector] +++ OK, passed 100 tests.
  8728. 709.39 s [vector] imapM: OK
  8729. 709.39 s [vector] +++ OK, passed 100 tests.
  8730. 709.39 s [vector] imapM_: OK
  8731. 709.39 s [vector] +++ OK, passed 100 tests.
  8732. 709.39 s [vector] zipWith: OK
  8733. 709.39 s [vector] +++ OK, passed 100 tests.
  8734. 709.39 s [vector] zipWith3: OK
  8735. 709.39 s [vector] +++ OK, passed 100 tests.
  8736. 709.39 s [vector] izipWith: OK
  8737. 709.39 s [vector] +++ OK, passed 100 tests.
  8738. 709.39 s [vector] izipWith3: OK
  8739. 709.39 s [vector] +++ OK, passed 100 tests.
  8740. 709.39 s [vector] izipWithM: OK
  8741. 709.39 s [vector] +++ OK, passed 100 tests.
  8742. 709.40 s [vector] izipWithM_: OK
  8743. 709.40 s [vector] +++ OK, passed 100 tests.
  8744. 709.40 s [vector] zipWithM: OK
  8745. 709.40 s [vector] +++ OK, passed 100 tests.
  8746. 709.40 s [vector] zipWithM_: OK
  8747. 709.40 s [vector] +++ OK, passed 100 tests.
  8748. 709.40 s [vector] filter: OK
  8749. 709.41 s [vector] +++ OK, passed 100 tests.
  8750. 709.42 s [vector] ifilter: OK
  8751. 709.42 s [vector] +++ OK, passed 100 tests.
  8752. 709.44 s [vector] filterM: OK (0.03s)
  8753. 709.44 s [vector] +++ OK, passed 100 tests.
  8754. 709.44 s [vector] uniq: OK
  8755. 709.44 s [vector] +++ OK, passed 100 tests.
  8756. 709.44 s [vector] mapMaybe: OK
  8757. 709.44 s [vector] +++ OK, passed 100 tests.
  8758. 709.44 s [vector] imapMaybe: OK
  8759. 709.44 s [vector] +++ OK, passed 100 tests.
  8760. 709.44 s [vector] takeWhile: OK
  8761. 709.44 s [vector] +++ OK, passed 100 tests.
  8762. 709.44 s [vector] dropWhile: OK
  8763. 709.44 s [vector] +++ OK, passed 100 tests.
  8764. 709.44 s [vector] partition: OK
  8765. 709.44 s [vector] +++ OK, passed 100 tests.
  8766. 709.44 s [vector] partitionWith: OK
  8767. 709.44 s [vector] +++ OK, passed 100 tests.
  8768. 709.44 s [vector] span: OK
  8769. 709.44 s [vector] +++ OK, passed 100 tests.
  8770. 709.45 s [vector] break: OK
  8771. 709.45 s [vector] +++ OK, passed 100 tests.
  8772. 709.45 s [vector] spanR: OK
  8773. 709.45 s [vector] +++ OK, passed 100 tests.
  8774. 709.45 s [vector] breakR: OK
  8775. 709.45 s [vector] +++ OK, passed 100 tests.
  8776. 709.45 s [vector] groupBy: OK
  8777. 709.45 s [vector] +++ OK, passed 100 tests.
  8778. 709.45 s [vector] elem: OK
  8779. 709.45 s [vector] +++ OK, passed 100 tests.
  8780. 709.45 s [vector] notElem: OK
  8781. 709.45 s [vector] +++ OK, passed 100 tests.
  8782. 709.45 s [vector] find: OK
  8783. 709.45 s [vector] +++ OK, passed 100 tests.
  8784. 709.45 s [vector] findIndex: OK
  8785. 709.45 s [vector] +++ OK, passed 100 tests.
  8786. 709.45 s [vector] findIndexR: OK
  8787. 709.45 s [vector] +++ OK, passed 100 tests.
  8788. 709.45 s [vector] findIndices: OK
  8789. 709.45 s [vector] +++ OK, passed 100 tests.
  8790. 709.45 s [vector] elemIndex: OK
  8791. 709.45 s [vector] +++ OK, passed 100 tests.
  8792. 709.45 s [vector] elemIndices: OK
  8793. 709.45 s [vector] +++ OK, passed 100 tests.
  8794. 709.45 s [vector] foldl: OK
  8795. 709.45 s [vector] +++ OK, passed 100 tests.
  8796. 709.45 s [vector] foldl1: OK
  8797. 709.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8798. 709.46 s [vector] foldl': OK
  8799. 709.46 s [vector] +++ OK, passed 100 tests.
  8800. 709.46 s [vector] foldl1': OK
  8801. 709.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8802. 709.46 s [vector] foldr: OK
  8803. 709.46 s [vector] +++ OK, passed 100 tests.
  8804. 709.46 s [vector] foldr1: OK
  8805. 709.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8806. 709.46 s [vector] foldr': OK
  8807. 709.46 s [vector] +++ OK, passed 100 tests.
  8808. 709.46 s [vector] foldr1': OK
  8809. 709.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8810. 709.46 s [vector] ifoldl: OK
  8811. 709.46 s [vector] +++ OK, passed 100 tests.
  8812. 709.47 s [vector] ifoldl': OK
  8813. 709.47 s [vector] +++ OK, passed 100 tests.
  8814. 709.47 s [vector] ifoldr: OK
  8815. 709.47 s [vector] +++ OK, passed 100 tests.
  8816. 709.47 s [vector] ifoldr': OK
  8817. 709.48 s [vector] +++ OK, passed 100 tests.
  8818. 709.48 s [vector] ifoldM: OK
  8819. 709.48 s [vector] +++ OK, passed 100 tests.
  8820. 709.48 s [vector] ifoldM': OK
  8821. 709.48 s [vector] +++ OK, passed 100 tests.
  8822. 709.48 s [vector] ifoldM_: OK
  8823. 709.48 s [vector] +++ OK, passed 100 tests.
  8824. 709.49 s [vector] ifoldM'_: OK
  8825. 709.49 s [vector] +++ OK, passed 100 tests.
  8826. 709.49 s [vector] all: OK
  8827. 709.49 s [vector] +++ OK, passed 100 tests.
  8828. 709.49 s [vector] any: OK
  8829. 709.49 s [vector] +++ OK, passed 100 tests.
  8830. 709.49 s [vector] prescanl: OK
  8831. 709.49 s [vector] +++ OK, passed 100 tests.
  8832. 709.49 s [vector] prescanl': OK
  8833. 709.49 s [vector] +++ OK, passed 100 tests.
  8834. 709.49 s [vector] postscanl: OK
  8835. 709.49 s [vector] +++ OK, passed 100 tests.
  8836. 709.49 s [vector] postscanl': OK
  8837. 709.49 s [vector] +++ OK, passed 100 tests.
  8838. 709.49 s [vector] scanl: OK
  8839. 709.50 s [vector] +++ OK, passed 100 tests.
  8840. 709.50 s [vector] scanl': OK
  8841. 709.50 s [vector] +++ OK, passed 100 tests.
  8842. 709.50 s [vector] scanl1: OK
  8843. 709.50 s [vector] +++ OK, passed 100 tests.
  8844. 709.50 s [vector] scanl1': OK
  8845. 709.50 s [vector] +++ OK, passed 100 tests.
  8846. 709.50 s [vector] iscanl: OK
  8847. 709.50 s [vector] +++ OK, passed 100 tests.
  8848. 709.50 s [vector] iscanl': OK
  8849. 709.50 s [vector] +++ OK, passed 100 tests.
  8850. 709.50 s [vector] prescanr: OK
  8851. 709.50 s [vector] +++ OK, passed 100 tests.
  8852. 709.50 s [vector] prescanr': OK
  8853. 709.50 s [vector] +++ OK, passed 100 tests.
  8854. 709.50 s [vector] postscanr: OK
  8855. 709.50 s [vector] +++ OK, passed 100 tests.
  8856. 709.51 s [vector] postscanr': OK
  8857. 709.51 s [vector] +++ OK, passed 100 tests.
  8858. 709.51 s [vector] scanr: OK
  8859. 709.51 s [vector] +++ OK, passed 100 tests.
  8860. 709.51 s [vector] scanr': OK
  8861. 709.51 s [vector] +++ OK, passed 100 tests.
  8862. 709.51 s [vector] scanr1: OK
  8863. 709.51 s [vector] +++ OK, passed 100 tests.
  8864. 709.51 s [vector] scanr1': OK
  8865. 709.51 s [vector] +++ OK, passed 100 tests.
  8866. 709.51 s [vector] iscanr: OK
  8867. 709.51 s [vector] +++ OK, passed 100 tests.
  8868. 709.51 s [vector] iscanr': OK
  8869. 709.51 s [vector] +++ OK, passed 100 tests.
  8870. 709.51 s [vector] mut_read: OK
  8871. 709.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8872. 709.51 s [vector] mut_write: OK
  8873. 709.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8874. 709.52 s [vector] mut_modify: OK
  8875. 709.52 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8876. 709.52 s [vector] mut_generate: OK
  8877. 709.52 s [vector] +++ OK, passed 100 tests.
  8878. 709.53 s [vector] mut_generateM: OK
  8879. 709.53 s [vector] +++ OK, passed 100 tests.
  8880. 709.54 s [vector] mut_mapM_: OK
  8881. 709.54 s [vector] +++ OK, passed 100 tests.
  8882. 709.54 s [vector] mut_imapM_: OK
  8883. 709.54 s [vector] +++ OK, passed 100 tests.
  8884. 709.55 s [vector] mut_forM_: OK
  8885. 709.55 s [vector] +++ OK, passed 100 tests.
  8886. 709.55 s [vector] mut_iforM_: OK
  8887. 709.55 s [vector] +++ OK, passed 100 tests.
  8888. 709.55 s [vector] mut_foldr: OK
  8889. 709.55 s [vector] +++ OK, passed 100 tests.
  8890. 709.55 s [vector] mut_foldr': OK
  8891. 709.55 s [vector] +++ OK, passed 100 tests.
  8892. 709.55 s [vector] mut_foldl: OK
  8893. 709.55 s [vector] +++ OK, passed 100 tests.
  8894. 709.55 s [vector] mut_foldl': OK
  8895. 709.56 s [vector] +++ OK, passed 100 tests.
  8896. 709.56 s [vector] mut_ifoldr: OK
  8897. 709.56 s [vector] +++ OK, passed 100 tests.
  8898. 709.56 s [vector] mut_ifoldr': OK
  8899. 709.56 s [vector] +++ OK, passed 100 tests.
  8900. 709.56 s [vector] mut_ifoldl: OK
  8901. 709.56 s [vector] +++ OK, passed 100 tests.
  8902. 709.56 s [vector] mut_ifoldl': OK
  8903. 709.56 s [vector] +++ OK, passed 100 tests.
  8904. 709.56 s [vector] mut_foldM: OK
  8905. 709.56 s [vector] +++ OK, passed 100 tests.
  8906. 709.56 s [vector] mut_foldM': OK
  8907. 709.56 s [vector] +++ OK, passed 100 tests.
  8908. 709.56 s [vector] mut_foldrM: OK
  8909. 709.56 s [vector] +++ OK, passed 100 tests.
  8910. 709.56 s [vector] mut_foldrM': OK
  8911. 709.57 s [vector] +++ OK, passed 100 tests.
  8912. 709.57 s [vector] mut_ifoldM: OK
  8913. 709.57 s [vector] +++ OK, passed 100 tests.
  8914. 709.57 s [vector] mut_ifoldM': OK
  8915. 709.57 s [vector] +++ OK, passed 100 tests.
  8916. 709.57 s [vector] mut_ifoldrM: OK
  8917. 709.57 s [vector] +++ OK, passed 100 tests.
  8918. 709.57 s [vector] mut_ifoldrM': OK
  8919. 709.57 s [vector] +++ OK, passed 100 tests.
  8920. 709.57 s [vector] compare: OK
  8921. 709.57 s [vector] +++ OK, passed 100 tests.
  8922. 709.57 s [vector] maximum: OK
  8923. 709.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8924. 709.57 s [vector] minimum: OK
  8925. 709.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8926. 709.57 s [vector] minIndex: OK
  8927. 709.57 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8928. 709.57 s [vector] maxIndex: OK
  8929. 709.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8930. 709.57 s [vector] maximumBy: OK
  8931. 709.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8932. 709.57 s [vector] minimumBy: OK
  8933. 709.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8934. 709.57 s [vector] maximumOn: OK
  8935. 709.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8936. 709.57 s [vector] minimumOn: OK
  8937. 709.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8938. 709.57 s [vector] maxIndexBy: OK
  8939. 709.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8940. 709.58 s [vector] minIndexBy: OK
  8941. 709.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8942. 709.58 s [vector] ListFirstMaxIndexWins: OK
  8943. 709.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8944. 709.58 s [vector] FalseListFirstMaxIndexWins: OK
  8945. 709.58 s [vector] +++ OK, failed as expected. (after 1 test):
  8946. 709.58 s [vector] Exception:
  8947. 709.58 s [vector] Prelude.foldr1: empty list
  8948. 709.58 s [vector] CallStack (from HasCallStack):
  8949. 709.58 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8950. 709.58 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8951. 709.58 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8952. 709.58 s [vector] []
  8953. 709.58 s [vector] zip: OK
  8954. 709.58 s [vector] +++ OK, passed 100 tests.
  8955. 709.58 s [vector] zip3: OK
  8956. 709.58 s [vector] +++ OK, passed 100 tests.
  8957. 709.58 s [vector] unzip: OK
  8958. 709.58 s [vector] +++ OK, passed 100 tests.
  8959. 709.58 s [vector] unzip3: OK
  8960. 709.58 s [vector] +++ OK, passed 100 tests.
  8961. 709.58 s [vector] indexed: OK
  8962. 709.58 s [vector] +++ OK, passed 100 tests.
  8963. 709.58 s [vector] update: OK
  8964. 709.58 s [vector] +++ OK, passed 100 tests.
  8965. 709.59 s [vector] concat: OK
  8966. 709.59 s [vector] +++ OK, passed 100 tests.
  8967. 709.59 s [vector] mempty: OK
  8968. 709.59 s [vector] +++ OK, passed 100 tests.
  8969. 709.59 s [vector] mappend: OK
  8970. 709.59 s [vector] +++ OK, passed 100 tests.
  8971. 709.59 s [vector] mconcat: OK
  8972. 709.59 s [vector] +++ OK, passed 100 tests.
  8973. 709.60 s [vector] fmap: OK
  8974. 709.60 s [vector] +++ OK, passed 100 tests.
  8975. 709.60 s [vector] return: OK
  8976. 709.60 s [vector] +++ OK, passed 100 tests.
  8977. 709.60 s [vector] bind: OK
  8978. 709.60 s [vector] +++ OK, passed 100 tests.
  8979. 709.60 s [vector] mzip: OK
  8980. 709.60 s [vector] +++ OK, passed 100 tests.
  8981. 709.60 s [vector] munzip: OK
  8982. 709.60 s [vector] +++ OK, passed 100 tests.
  8983. 709.62 s [vector] applicative_pure: OK
  8984. 709.62 s [vector] +++ OK, passed 100 tests.
  8985. 709.62 s [vector] applicative_appl: OK (0.01s)
  8986. 709.62 s [vector] +++ OK, passed 100 tests.
  8987. 709.62 s [vector] alternative_empty: OK
  8988. 709.62 s [vector] +++ OK, passed 100 tests.
  8989. 709.62 s [vector] alternative_or: OK
  8990. 709.62 s [vector] +++ OK, passed 100 tests.
  8991. 709.64 s [vector] sequence: OK (0.02s)
  8992. 709.64 s [vector] +++ OK, passed 100 tests.
  8993. 709.65 s [vector] sequence_: OK
  8994. 709.65 s [vector] +++ OK, passed 100 tests.
  8995. 709.65 s [vector] glength: OK
  8996. 709.65 s [vector] +++ OK, passed 100 tests.
  8997. 709.65 s [vector] and: OK
  8998. 709.65 s [vector] +++ OK, passed 100 tests.
  8999. 709.65 s [vector] or: OK
  9000. 709.65 s [vector] +++ OK, passed 100 tests.
  9001. 709.65 s [vector] Int
  9002. 709.65 s [vector] fromList.toList == id: OK
  9003. 709.65 s [vector] +++ OK, passed 100 tests.
  9004. 709.65 s [vector] toList.fromList == id: OK
  9005. 709.65 s [vector] +++ OK, passed 100 tests.
  9006. 709.65 s [vector] unstream.stream == id: OK
  9007. 709.65 s [vector] +++ OK, passed 100 tests.
  9008. 709.65 s [vector] stream.unstream == id: OK
  9009. 709.65 s [vector] +++ OK, passed 100 tests.
  9010. 709.65 s [vector] eq: OK
  9011. 709.66 s [vector] +++ OK, passed 100 tests.
  9012. 709.66 s [vector] length: OK
  9013. 709.66 s [vector] +++ OK, passed 100 tests.
  9014. 709.66 s [vector] null: OK
  9015. 709.66 s [vector] +++ OK, passed 100 tests.
  9016. 709.66 s [vector] index: OK
  9017. 709.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9018. 709.66 s [vector] safeIndex: OK
  9019. 709.66 s [vector] +++ OK, passed 100 tests.
  9020. 709.66 s [vector] head: OK
  9021. 709.66 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9022. 709.66 s [vector] last: OK
  9023. 709.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9024. 709.66 s [vector] unsafeIndex: OK
  9025. 709.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9026. 709.66 s [vector] unsafeHead: OK
  9027. 709.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9028. 709.66 s [vector] unsafeLast: OK
  9029. 709.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9030. 709.66 s [vector] slice: OK
  9031. 709.66 s [vector] +++ OK, passed 100 tests.
  9032. 709.66 s [vector] init: OK
  9033. 709.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9034. 709.66 s [vector] tail: OK
  9035. 709.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9036. 709.66 s [vector] take: OK
  9037. 709.66 s [vector] +++ OK, passed 100 tests.
  9038. 709.66 s [vector] drop: OK
  9039. 709.66 s [vector] +++ OK, passed 100 tests.
  9040. 709.66 s [vector] splitAt: OK
  9041. 709.66 s [vector] +++ OK, passed 100 tests.
  9042. 709.66 s [vector] empty: OK
  9043. 709.66 s [vector] +++ OK, passed 100 tests.
  9044. 709.66 s [vector] singleton: OK
  9045. 709.66 s [vector] +++ OK, passed 100 tests.
  9046. 709.66 s [vector] replicate: OK
  9047. 709.66 s [vector] +++ OK, passed 100 tests.
  9048. 709.66 s [vector] generate: OK
  9049. 709.66 s [vector] +++ OK, passed 100 tests.
  9050. 709.66 s [vector] iterateN: OK
  9051. 709.66 s [vector] +++ OK, passed 100 tests.
  9052. 709.68 s [vector] iterateNM: OK (0.02s)
  9053. 709.68 s [vector] +++ OK, passed 100 tests.
  9054. 709.70 s [vector] generateM: OK (0.01s)
  9055. 709.70 s [vector] +++ OK, passed 100 tests.
  9056. 709.70 s [vector] replicateM: OK
  9057. 709.70 s [vector] +++ OK, passed 100 tests.
  9058. 709.70 s [vector] create: OK
  9059. 709.70 s [vector] +++ OK, passed 100 tests.
  9060. 709.70 s [vector] createT: OK
  9061. 709.70 s [vector] +++ OK, passed 100 tests.
  9062. 709.72 s [vector] unfoldr: OK
  9063. 709.73 s [vector] +++ OK, passed 100 tests.
  9064. 709.73 s [vector] unfoldrN: OK
  9065. 709.73 s [vector] +++ OK, passed 100 tests.
  9066. 709.73 s [vector] unfoldrExactN: OK
  9067. 709.73 s [vector] +++ OK, passed 100 tests.
  9068. 709.73 s [vector] unfoldrM: OK
  9069. 709.73 s [vector] +++ OK, passed 100 tests.
  9070. 709.73 s [vector] unfoldrNM: OK
  9071. 709.73 s [vector] +++ OK, passed 100 tests.
  9072. 709.73 s [vector] unfoldrExactNM: OK (0.02s)
  9073. 709.73 s [vector] +++ OK, passed 100 tests.
  9074. 709.73 s [vector] constructN: OK
  9075. 709.73 s [vector] +++ OK, passed 100 tests.
  9076. 709.73 s [vector] constructrN: OK
  9077. 709.73 s [vector] +++ OK, passed 100 tests.
  9078. 709.73 s [vector] cons: OK
  9079. 709.73 s [vector] +++ OK, passed 100 tests.
  9080. 709.73 s [vector] snoc: OK
  9081. 709.73 s [vector] +++ OK, passed 100 tests.
  9082. 709.74 s [vector] append: OK
  9083. 709.74 s [vector] +++ OK, passed 100 tests.
  9084. 709.75 s [vector] concat: OK (0.01s)
  9085. 709.75 s [vector] +++ OK, passed 100 tests.
  9086. 709.75 s [vector] force: OK
  9087. 709.75 s [vector] +++ OK, passed 100 tests.
  9088. 709.75 s [vector] upd: OK
  9089. 709.75 s [vector] +++ OK, passed 100 tests.
  9090. 709.75 s [vector] accum: OK
  9091. 709.75 s [vector] +++ OK, passed 100 tests.
  9092. 709.75 s [vector] reverse: OK
  9093. 709.75 s [vector] +++ OK, passed 100 tests.
  9094. 709.76 s [vector] backpermute: OK
  9095. 709.76 s [vector] +++ OK, passed 100 tests.
  9096. 709.76 s [vector] map: OK
  9097. 709.76 s [vector] +++ OK, passed 100 tests.
  9098. 709.76 s [vector] imap: OK
  9099. 709.77 s [vector] +++ OK, passed 100 tests.
  9100. 709.77 s [vector] concatMap: OK
  9101. 709.77 s [vector] +++ OK, passed 100 tests.
  9102. 709.77 s [vector] mapM: OK
  9103. 709.77 s [vector] +++ OK, passed 100 tests.
  9104. 709.77 s [vector] mapM_: OK (0.01s)
  9105. 709.78 s [vector] +++ OK, passed 100 tests.
  9106. 709.78 s [vector] forM: OK
  9107. 709.78 s [vector] +++ OK, passed 100 tests.
  9108. 709.79 s [vector] forM_: OK (0.01s)
  9109. 709.80 s [vector] +++ OK, passed 100 tests.
  9110. 709.80 s [vector] imapM: OK
  9111. 709.80 s [vector] +++ OK, passed 100 tests.
  9112. 709.81 s [vector] imapM_: OK (0.02s)
  9113. 709.81 s [vector] +++ OK, passed 100 tests.
  9114. 709.81 s [vector] zipWith: OK
  9115. 709.82 s [vector] +++ OK, passed 100 tests.
  9116. 709.82 s [vector] zipWith3: OK
  9117. 709.82 s [vector] +++ OK, passed 100 tests.
  9118. 709.82 s [vector] izipWith: OK
  9119. 709.82 s [vector] +++ OK, passed 100 tests.
  9120. 709.83 s [vector] izipWith3: OK
  9121. 709.83 s [vector] +++ OK, passed 100 tests.
  9122. 709.84 s [vector] izipWithM: OK
  9123. 709.84 s [vector] +++ OK, passed 100 tests.
  9124. 709.84 s [vector] izipWithM_: OK (0.01s)
  9125. 709.84 s [vector] +++ OK, passed 100 tests.
  9126. 709.84 s [vector] zipWithM: OK
  9127. 709.84 s [vector] +++ OK, passed 100 tests.
  9128. 709.84 s [vector] zipWithM_: OK (0.01s)
  9129. 709.84 s [vector] +++ OK, passed 100 tests.
  9130. 709.84 s [vector] filter: OK
  9131. 709.84 s [vector] +++ OK, passed 100 tests.
  9132. 709.84 s [vector] ifilter: OK
  9133. 709.85 s [vector] +++ OK, passed 100 tests.
  9134. 709.86 s [vector] filterM: OK (0.02s)
  9135. 709.86 s [vector] +++ OK, passed 100 tests.
  9136. 709.86 s [vector] uniq: OK
  9137. 709.86 s [vector] +++ OK, passed 100 tests.
  9138. 709.87 s [vector] mapMaybe: OK
  9139. 709.87 s [vector] +++ OK, passed 100 tests.
  9140. 709.87 s [vector] imapMaybe: OK
  9141. 709.87 s [vector] +++ OK, passed 100 tests.
  9142. 709.87 s [vector] takeWhile: OK
  9143. 709.87 s [vector] +++ OK, passed 100 tests.
  9144. 709.87 s [vector] dropWhile: OK
  9145. 709.87 s [vector] +++ OK, passed 100 tests.
  9146. 709.87 s [vector] partition: OK
  9147. 709.87 s [vector] +++ OK, passed 100 tests.
  9148. 709.87 s [vector] partitionWith: OK
  9149. 709.87 s [vector] +++ OK, passed 100 tests.
  9150. 709.88 s [vector] span: OK
  9151. 709.88 s [vector] +++ OK, passed 100 tests.
  9152. 709.88 s [vector] break: OK
  9153. 709.88 s [vector] +++ OK, passed 100 tests.
  9154. 709.88 s [vector] spanR: OK
  9155. 709.88 s [vector] +++ OK, passed 100 tests.
  9156. 709.88 s [vector] breakR: OK
  9157. 709.88 s [vector] +++ OK, passed 100 tests.
  9158. 709.88 s [vector] groupBy: OK
  9159. 709.88 s [vector] +++ OK, passed 100 tests.
  9160. 709.88 s [vector] elem: OK
  9161. 709.88 s [vector] +++ OK, passed 100 tests.
  9162. 709.88 s [vector] notElem: OK
  9163. 709.88 s [vector] +++ OK, passed 100 tests.
  9164. 709.89 s [vector] find: OK
  9165. 709.89 s [vector] +++ OK, passed 100 tests.
  9166. 709.89 s [vector] findIndex: OK
  9167. 709.89 s [vector] +++ OK, passed 100 tests.
  9168. 709.89 s [vector] findIndexR: OK
  9169. 709.89 s [vector] +++ OK, passed 100 tests.
  9170. 709.89 s [vector] findIndices: OK
  9171. 709.89 s [vector] +++ OK, passed 100 tests.
  9172. 709.89 s [vector] elemIndex: OK
  9173. 709.89 s [vector] +++ OK, passed 100 tests.
  9174. 709.89 s [vector] elemIndices: OK
  9175. 709.89 s [vector] +++ OK, passed 100 tests.
  9176. 709.90 s [vector] foldl: OK
  9177. 709.90 s [vector] +++ OK, passed 100 tests.
  9178. 709.90 s [vector] foldl1: OK
  9179. 709.90 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9180. 709.90 s [vector] foldl': OK
  9181. 709.91 s [vector] +++ OK, passed 100 tests.
  9182. 709.91 s [vector] foldl1': OK
  9183. 709.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9184. 709.91 s [vector] foldr: OK
  9185. 709.91 s [vector] +++ OK, passed 100 tests.
  9186. 709.91 s [vector] foldr1: OK
  9187. 709.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9188. 709.91 s [vector] foldr': OK
  9189. 709.91 s [vector] +++ OK, passed 100 tests.
  9190. 709.92 s [vector] foldr1': OK
  9191. 709.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9192. 709.92 s [vector] ifoldl: OK
  9193. 709.92 s [vector] +++ OK, passed 100 tests.
  9194. 709.92 s [vector] ifoldl': OK
  9195. 709.92 s [vector] +++ OK, passed 100 tests.
  9196. 709.92 s [vector] ifoldr: OK
  9197. 709.92 s [vector] +++ OK, passed 100 tests.
  9198. 709.92 s [vector] ifoldr': OK
  9199. 709.92 s [vector] +++ OK, passed 100 tests.
  9200. 709.92 s [vector] ifoldM: OK
  9201. 709.92 s [vector] +++ OK, passed 100 tests.
  9202. 709.92 s [vector] ifoldM': OK
  9203. 709.92 s [vector] +++ OK, passed 100 tests.
  9204. 709.94 s [vector] ifoldM_: OK (0.02s)
  9205. 709.94 s [vector] +++ OK, passed 100 tests.
  9206. 709.94 s [vector] ifoldM'_: OK (0.02s)
  9207. 709.94 s [vector] +++ OK, passed 100 tests.
  9208. 709.94 s [vector] all: OK
  9209. 709.94 s [vector] +++ OK, passed 100 tests.
  9210. 709.94 s [vector] any: OK
  9211. 709.94 s [vector] +++ OK, passed 100 tests.
  9212. 709.94 s [vector] prescanl: OK
  9213. 709.94 s [vector] +++ OK, passed 100 tests.
  9214. 709.94 s [vector] prescanl': OK
  9215. 709.94 s [vector] +++ OK, passed 100 tests.
  9216. 709.95 s [vector] postscanl: OK
  9217. 709.95 s [vector] +++ OK, passed 100 tests.
  9218. 709.95 s [vector] postscanl': OK
  9219. 709.95 s [vector] +++ OK, passed 100 tests.
  9220. 709.95 s [vector] scanl: OK
  9221. 709.95 s [vector] +++ OK, passed 100 tests.
  9222. 709.95 s [vector] scanl': OK
  9223. 709.96 s [vector] +++ OK, passed 100 tests.
  9224. 709.96 s [vector] scanl1: OK
  9225. 709.96 s [vector] +++ OK, passed 100 tests.
  9226. 709.96 s [vector] scanl1': OK
  9227. 709.96 s [vector] +++ OK, passed 100 tests.
  9228. 709.96 s [vector] iscanl: OK
  9229. 709.96 s [vector] +++ OK, passed 100 tests.
  9230. 709.96 s [vector] iscanl': OK
  9231. 709.96 s [vector] +++ OK, passed 100 tests.
  9232. 709.96 s [vector] prescanr: OK
  9233. 709.97 s [vector] +++ OK, passed 100 tests.
  9234. 709.97 s [vector] prescanr': OK
  9235. 709.97 s [vector] +++ OK, passed 100 tests.
  9236. 709.97 s [vector] postscanr: OK
  9237. 709.98 s [vector] +++ OK, passed 100 tests.
  9238. 709.98 s [vector] postscanr': OK
  9239. 709.98 s [vector] +++ OK, passed 100 tests.
  9240. 709.98 s [vector] scanr: OK
  9241. 709.98 s [vector] +++ OK, passed 100 tests.
  9242. 709.98 s [vector] scanr': OK
  9243. 709.98 s [vector] +++ OK, passed 100 tests.
  9244. 709.98 s [vector] scanr1: OK
  9245. 709.98 s [vector] +++ OK, passed 100 tests.
  9246. 709.98 s [vector] scanr1': OK
  9247. 709.98 s [vector] +++ OK, passed 100 tests.
  9248. 709.99 s [vector] iscanr: OK
  9249. 709.99 s [vector] +++ OK, passed 100 tests.
  9250. 709.99 s [vector] iscanr': OK
  9251. 709.99 s [vector] +++ OK, passed 100 tests.
  9252. 709.99 s [vector] mut_read: OK
  9253. 709.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9254. 709.99 s [vector] mut_write: OK
  9255. 709.99 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9256. 709.99 s [vector] mut_modify: OK
  9257. 709.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9258. 709.99 s [vector] mut_generate: OK
  9259. 709.99 s [vector] +++ OK, passed 100 tests.
  9260. 709.99 s [vector] mut_generateM: OK
  9261. 710.00 s [vector] +++ OK, passed 100 tests.
  9262. 710.01 s [vector] mut_mapM_: OK (0.01s)
  9263. 710.01 s [vector] +++ OK, passed 100 tests.
  9264. 710.02 s [vector] mut_imapM_: OK
  9265. 710.02 s [vector] +++ OK, passed 100 tests.
  9266. 710.31 s [vector] mut_forM_: OK
  9267. 710.31 s [vector] +++ OK, passed 100 tests.
  9268. 710.31 s [vector] mut_iforM_: OK (0.01s)
  9269. 710.31 s [vector] +++ OK, passed 100 tests.
  9270. 710.31 s [vector] mut_foldr: OK
  9271. 710.31 s [vector] +++ OK, passed 100 tests.
  9272. 710.31 s [vector] mut_foldr': OK
  9273. 710.31 s [vector] +++ OK, passed 100 tests.
  9274. 710.31 s [vector] mut_foldl: OK
  9275. 710.31 s [vector] +++ OK, passed 100 tests.
  9276. 710.31 s [vector] mut_foldl': OK
  9277. 710.31 s [vector] +++ OK, passed 100 tests.
  9278. 710.31 s [vector] mut_ifoldr: OK
  9279. 710.31 s [vector] +++ OK, passed 100 tests.
  9280. 710.31 s [vector] mut_ifoldr': OK
  9281. 710.31 s [vector] +++ OK, passed 100 tests.
  9282. 710.31 s [vector] mut_ifoldl: OK
  9283. 710.31 s [vector] +++ OK, passed 100 tests.
  9284. 710.31 s [vector] mut_ifoldl': OK
  9285. 710.31 s [vector] +++ OK, passed 100 tests.
  9286. 710.31 s [vector] mut_foldM: OK
  9287. 710.31 s [vector] +++ OK, passed 100 tests.
  9288. 710.31 s [vector] mut_foldM': OK
  9289. 710.31 s [vector] +++ OK, passed 100 tests.
  9290. 710.31 s [vector] mut_foldrM: OK
  9291. 710.31 s [vector] +++ OK, passed 100 tests.
  9292. 710.31 s [vector] mut_foldrM': OK
  9293. 710.31 s [vector] +++ OK, passed 100 tests.
  9294. 710.31 s [vector] mut_ifoldM: OK
  9295. 710.31 s [vector] +++ OK, passed 100 tests.
  9296. 710.31 s [vector] mut_ifoldM': OK
  9297. 710.31 s [vector] +++ OK, passed 100 tests.
  9298. 710.31 s [vector] mut_ifoldrM: OK
  9299. 710.31 s [vector] +++ OK, passed 100 tests.
  9300. 710.31 s [vector] mut_ifoldrM': OK
  9301. 710.31 s [vector] +++ OK, passed 100 tests.
  9302. 710.31 s [vector] compare: OK
  9303. 710.31 s [vector] +++ OK, passed 100 tests.
  9304. 710.31 s [vector] maximum: OK
  9305. 710.31 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9306. 710.31 s [vector] minimum: OK
  9307. 710.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9308. 710.31 s [vector] minIndex: OK
  9309. 710.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9310. 710.31 s [vector] maxIndex: OK
  9311. 710.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9312. 710.31 s [vector] maximumBy: OK
  9313. 710.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9314. 710.31 s [vector] minimumBy: OK
  9315. 710.31 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9316. 710.31 s [vector] maximumOn: OK
  9317. 710.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9318. 710.31 s [vector] minimumOn: OK
  9319. 710.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9320. 710.31 s [vector] maxIndexBy: OK
  9321. 710.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9322. 710.31 s [vector] minIndexBy: OK
  9323. 710.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9324. 710.31 s [vector] ListFirstMaxIndexWins: OK
  9325. 710.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9326. 710.31 s [vector] FalseListFirstMaxIndexWins: OK
  9327. 710.31 s [vector] +++ OK, failed as expected. (after 1 test):
  9328. 710.31 s [vector] Exception:
  9329. 710.31 s [vector] Prelude.foldr1: empty list
  9330. 710.31 s [vector] CallStack (from HasCallStack):
  9331. 710.31 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9332. 710.31 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9333. 710.31 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9334. 710.31 s [vector] []
  9335. 710.31 s [vector] zip: OK
  9336. 710.31 s [vector] +++ OK, passed 100 tests.
  9337. 710.31 s [vector] zip3: OK
  9338. 710.31 s [vector] +++ OK, passed 100 tests.
  9339. 710.31 s [vector] unzip: OK
  9340. 710.31 s [vector] +++ OK, passed 100 tests.
  9341. 710.31 s [vector] unzip3: OK
  9342. 710.31 s [vector] +++ OK, passed 100 tests.
  9343. 710.31 s [vector] indexed: OK
  9344. 710.31 s [vector] +++ OK, passed 100 tests.
  9345. 710.31 s [vector] update: OK
  9346. 710.31 s [vector] +++ OK, passed 100 tests.
  9347. 710.31 s [vector] concat: OK
  9348. 710.31 s [vector] +++ OK, passed 100 tests.
  9349. 710.31 s [vector] mempty: OK
  9350. 710.31 s [vector] +++ OK, passed 100 tests.
  9351. 710.31 s [vector] mappend: OK
  9352. 710.31 s [vector] +++ OK, passed 100 tests.
  9353. 710.31 s [vector] mconcat: OK
  9354. 710.31 s [vector] +++ OK, passed 100 tests.
  9355. 710.31 s [vector] fmap: OK
  9356. 710.31 s [vector] +++ OK, passed 100 tests.
  9357. 710.31 s [vector] return: OK
  9358. 710.31 s [vector] +++ OK, passed 100 tests.
  9359. 710.31 s [vector] bind: OK (0.02s)
  9360. 710.31 s [vector] +++ OK, passed 100 tests.
  9361. 710.31 s [vector] mzip: OK
  9362. 710.31 s [vector] +++ OK, passed 100 tests.
  9363. 710.31 s [vector] munzip: OK
  9364. 710.31 s [vector] +++ OK, passed 100 tests.
  9365. 710.31 s [vector] applicative_pure: OK
  9366. 710.31 s [vector] +++ OK, passed 100 tests.
  9367. 710.31 s [vector] applicative_appl: OK (0.03s)
  9368. 710.31 s [vector] +++ OK, passed 100 tests.
  9369. 710.31 s [vector] alternative_empty: OK
  9370. 710.31 s [vector] +++ OK, passed 100 tests.
  9371. 710.31 s [vector] alternative_or: OK
  9372. 710.31 s [vector] +++ OK, passed 100 tests.
  9373. 710.31 s [vector] sequence: OK (0.02s)
  9374. 710.31 s [vector] +++ OK, passed 100 tests.
  9375. 710.31 s [vector] sequence_: OK (0.01s)
  9376. 710.31 s [vector] +++ OK, passed 100 tests.
  9377. 710.31 s [vector] glength: OK
  9378. 710.31 s [vector] +++ OK, passed 100 tests.
  9379. 710.31 s [vector] sum: OK
  9380. 710.31 s [vector] +++ OK, passed 100 tests.
  9381. 710.31 s [vector] product: OK
  9382. 710.31 s [vector] +++ OK, passed 100 tests.
  9383. 710.31 s [vector] enumFromN: OK
  9384. 710.31 s [vector] +++ OK, passed 100 tests.
  9385. 710.31 s [vector] enumFromThenN: OK
  9386. 710.31 s [vector] +++ OK, passed 100 tests.
  9387. 710.31 s [vector] enumFromTo: OK
  9388. 710.31 s [vector] +++ OK, passed 100 tests.
  9389. 710.31 s [vector] enumFromThenTo: OK
  9390. 710.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9391. 710.31 s [vector] unstream
  9392. 710.31 s [vector] unstream == vunstream (exact): OK
  9393. 710.31 s [vector] +++ OK, passed 100 tests.
  9394. 710.31 s [vector] unstream == vunstream (unknown): OK
  9395. 710.31 s [vector] +++ OK, passed 100 tests.
  9396. 710.31 s [vector] unstreamR ~= vunstream (exact): OK
  9397. 710.31 s [vector] +++ OK, passed 100 tests.
  9398. 710.31 s [vector] unstreamR ~= vunstream (unknown): OK
  9399. 710.31 s [vector] +++ OK, passed 100 tests.
  9400. 710.31 s [vector] Tests.Vector.Primitive
  9401. 710.31 s [vector] Int
  9402. 710.31 s [vector] fromList.toList == id: OK
  9403. 710.31 s [vector] +++ OK, passed 100 tests.
  9404. 710.31 s [vector] toList.fromList == id: OK
  9405. 710.31 s [vector] +++ OK, passed 100 tests.
  9406. 710.31 s [vector] unstream.stream == id: OK
  9407. 710.31 s [vector] +++ OK, passed 100 tests.
  9408. 710.31 s [vector] stream.unstream == id: OK
  9409. 710.31 s [vector] +++ OK, passed 100 tests.
  9410. 710.31 s [vector] eq: OK
  9411. 710.31 s [vector] +++ OK, passed 100 tests.
  9412. 710.31 s [vector] length: OK
  9413. 710.31 s [vector] +++ OK, passed 100 tests.
  9414. 710.31 s [vector] null: OK
  9415. 710.31 s [vector] +++ OK, passed 100 tests.
  9416. 710.31 s [vector] index: OK
  9417. 710.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9418. 710.31 s [vector] safeIndex: OK
  9419. 710.31 s [vector] +++ OK, passed 100 tests.
  9420. 710.31 s [vector] head: OK
  9421. 710.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9422. 710.31 s [vector] last: OK
  9423. 710.31 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9424. 710.31 s [vector] unsafeIndex: OK
  9425. 710.31 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9426. 710.31 s [vector] unsafeHead: OK
  9427. 710.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9428. 710.31 s [vector] unsafeLast: OK
  9429. 710.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9430. 710.31 s [vector] slice: OK
  9431. 710.31 s [vector] +++ OK, passed 100 tests.
  9432. 710.31 s [vector] init: OK
  9433. 710.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9434. 710.31 s [vector] tail: OK
  9435. 710.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9436. 710.31 s [vector] take: OK
  9437. 710.31 s [vector] +++ OK, passed 100 tests.
  9438. 710.31 s [vector] drop: OK
  9439. 710.31 s [vector] +++ OK, passed 100 tests.
  9440. 710.31 s [vector] splitAt: OK
  9441. 710.31 s [vector] +++ OK, passed 100 tests.
  9442. 710.31 s [vector] empty: OK
  9443. 710.31 s [vector] +++ OK, passed 100 tests.
  9444. 710.31 s [vector] singleton: OK
  9445. 710.31 s [vector] +++ OK, passed 100 tests.
  9446. 710.31 s [vector] replicate: OK
  9447. 710.31 s [vector] +++ OK, passed 100 tests.
  9448. 710.31 s [vector] generate: OK
  9449. 710.31 s [vector] +++ OK, passed 100 tests.
  9450. 710.31 s [vector] iterateN: OK
  9451. 710.31 s [vector] +++ OK, passed 100 tests.
  9452. 710.31 s [vector] iterateNM: OK
  9453. 710.31 s [vector] +++ OK, passed 100 tests.
  9454. 710.31 s [vector] generateM: OK (0.01s)
  9455. 710.31 s [vector] +++ OK, passed 100 tests.
  9456. 710.31 s [vector] replicateM: OK
  9457. 710.31 s [vector] +++ OK, passed 100 tests.
  9458. 710.31 s [vector] create: OK
  9459. 710.31 s [vector] +++ OK, passed 100 tests.
  9460. 710.31 s [vector] createT: OK
  9461. 710.31 s [vector] +++ OK, passed 100 tests.
  9462. 710.31 s [vector] unfoldr: OK
  9463. 710.31 s [vector] +++ OK, passed 100 tests.
  9464. 710.31 s [vector] unfoldrN: OK
  9465. 710.31 s [vector] +++ OK, passed 100 tests.
  9466. 710.31 s [vector] unfoldrExactN: OK
  9467. 710.31 s [vector] +++ OK, passed 100 tests.
  9468. 710.31 s [vector] unfoldrM: OK
  9469. 710.31 s [vector] +++ OK, passed 100 tests.
  9470. 710.31 s [vector] unfoldrNM: OK
  9471. 710.31 s [vector] +++ OK, passed 100 tests.
  9472. 710.31 s [vector] unfoldrExactNM: OK (0.02s)
  9473. 710.31 s [vector] +++ OK, passed 100 tests.
  9474. 710.31 s [vector] constructN: OK
  9475. 710.31 s [vector] +++ OK, passed 100 tests.
  9476. 710.31 s [vector] constructrN: OK
  9477. 710.31 s [vector] +++ OK, passed 100 tests.
  9478. 710.31 s [vector] cons: OK
  9479. 710.31 s [vector] +++ OK, passed 100 tests.
  9480. 710.31 s [vector] snoc: OK
  9481. 710.31 s [vector] +++ OK, passed 100 tests.
  9482. 710.31 s [vector] append: OK
  9483. 710.31 s [vector] +++ OK, passed 100 tests.
  9484. 710.31 s [vector] concat: OK (0.01s)
  9485. 710.32 s [vector] +++ OK, passed 100 tests.
  9486. 710.32 s [vector] force: OK
  9487. 710.32 s [vector] +++ OK, passed 100 tests.
  9488. 710.32 s [vector] upd: OK
  9489. 710.32 s [vector] +++ OK, passed 100 tests.
  9490. 710.32 s [vector] accum: OK
  9491. 710.32 s [vector] +++ OK, passed 100 tests.
  9492. 710.32 s [vector] reverse: OK
  9493. 710.32 s [vector] +++ OK, passed 100 tests.
  9494. 710.32 s [vector] backpermute: OK
  9495. 710.32 s [vector] +++ OK, passed 100 tests.
  9496. 710.32 s [vector] map: OK
  9497. 710.32 s [vector] +++ OK, passed 100 tests.
  9498. 710.32 s [vector] imap: OK
  9499. 710.32 s [vector] +++ OK, passed 100 tests.
  9500. 710.32 s [vector] concatMap: OK
  9501. 710.32 s [vector] +++ OK, passed 100 tests.
  9502. 710.33 s [vector] mapM: OK
  9503. 710.33 s [vector] +++ OK, passed 100 tests.
  9504. 710.33 s [vector] mapM_: OK (0.01s)
  9505. 710.34 s [vector] +++ OK, passed 100 tests.
  9506. 710.34 s [vector] forM: OK
  9507. 710.34 s [vector] +++ OK, passed 100 tests.
  9508. 710.35 s [vector] forM_: OK (0.02s)
  9509. 710.35 s [vector] +++ OK, passed 100 tests.
  9510. 710.35 s [vector] imapM: OK
  9511. 710.35 s [vector] +++ OK, passed 100 tests.
  9512. 710.37 s [vector] imapM_: OK (0.02s)
  9513. 710.37 s [vector] +++ OK, passed 100 tests.
  9514. 710.37 s [vector] zipWith: OK
  9515. 710.37 s [vector] +++ OK, passed 100 tests.
  9516. 710.38 s [vector] zipWith3: OK
  9517. 710.38 s [vector] +++ OK, passed 100 tests.
  9518. 710.38 s [vector] izipWith: OK
  9519. 710.38 s [vector] +++ OK, passed 100 tests.
  9520. 710.38 s [vector] izipWith3: OK
  9521. 710.38 s [vector] +++ OK, passed 100 tests.
  9522. 710.39 s [vector] izipWithM: OK
  9523. 710.40 s [vector] +++ OK, passed 100 tests.
  9524. 710.40 s [vector] izipWithM_: OK (0.01s)
  9525. 710.40 s [vector] +++ OK, passed 100 tests.
  9526. 710.40 s [vector] zipWithM: OK
  9527. 710.41 s [vector] +++ OK, passed 100 tests.
  9528. 710.41 s [vector] zipWithM_: OK (0.01s)
  9529. 710.41 s [vector] +++ OK, passed 100 tests.
  9530. 710.42 s [vector] filter: OK
  9531. 710.42 s [vector] +++ OK, passed 100 tests.
  9532. 710.42 s [vector] ifilter: OK
  9533. 710.42 s [vector] +++ OK, passed 100 tests.
  9534. 710.43 s [vector] filterM: OK (0.02s)
  9535. 710.43 s [vector] +++ OK, passed 100 tests.
  9536. 710.43 s [vector] uniq: OK
  9537. 710.43 s [vector] +++ OK, passed 100 tests.
  9538. 710.44 s [vector] mapMaybe: OK
  9539. 710.44 s [vector] +++ OK, passed 100 tests.
  9540. 710.44 s [vector] imapMaybe: OK
  9541. 710.44 s [vector] +++ OK, passed 100 tests.
  9542. 710.44 s [vector] takeWhile: OK
  9543. 710.44 s [vector] +++ OK, passed 100 tests.
  9544. 710.44 s [vector] dropWhile: OK
  9545. 710.45 s [vector] +++ OK, passed 100 tests.
  9546. 710.45 s [vector] partition: OK
  9547. 710.45 s [vector] +++ OK, passed 100 tests.
  9548. 710.45 s [vector] partitionWith: OK
  9549. 710.45 s [vector] +++ OK, passed 100 tests.
  9550. 710.45 s [vector] span: OK
  9551. 710.45 s [vector] +++ OK, passed 100 tests.
  9552. 710.45 s [vector] break: OK
  9553. 710.46 s [vector] +++ OK, passed 100 tests.
  9554. 710.46 s [vector] spanR: OK
  9555. 710.46 s [vector] +++ OK, passed 100 tests.
  9556. 710.46 s [vector] breakR: OK
  9557. 710.46 s [vector] +++ OK, passed 100 tests.
  9558. 710.46 s [vector] groupBy: OK
  9559. 710.46 s [vector] +++ OK, passed 100 tests.
  9560. 710.46 s [vector] elem: OK
  9561. 710.46 s [vector] +++ OK, passed 100 tests.
  9562. 710.46 s [vector] notElem: OK
  9563. 710.47 s [vector] +++ OK, passed 100 tests.
  9564. 710.47 s [vector] find: OK
  9565. 710.47 s [vector] +++ OK, passed 100 tests.
  9566. 710.48 s [vector] findIndex: OK
  9567. 710.48 s [vector] +++ OK, passed 100 tests.
  9568. 710.48 s [vector] findIndexR: OK
  9569. 710.48 s [vector] +++ OK, passed 100 tests.
  9570. 710.50 s [vector] findIndices: OK
  9571. 710.50 s [vector] +++ OK, passed 100 tests.
  9572. 710.50 s [vector] elemIndex: OK
  9573. 710.50 s [vector] +++ OK, passed 100 tests.
  9574. 710.51 s [vector] elemIndices: OK
  9575. 710.51 s [vector] +++ OK, passed 100 tests.
  9576. 710.51 s [vector] foldl: OK
  9577. 710.51 s [vector] +++ OK, passed 100 tests.
  9578. 710.51 s [vector] foldl1: OK
  9579. 710.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9580. 710.51 s [vector] foldl': OK
  9581. 710.51 s [vector] +++ OK, passed 100 tests.
  9582. 710.51 s [vector] foldl1': OK
  9583. 710.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9584. 710.52 s [vector] foldr: OK
  9585. 710.52 s [vector] +++ OK, passed 100 tests.
  9586. 710.52 s [vector] foldr1: OK
  9587. 710.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9588. 710.53 s [vector] foldr': OK
  9589. 710.53 s [vector] +++ OK, passed 100 tests.
  9590. 710.54 s [vector] foldr1': OK
  9591. 710.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9592. 710.54 s [vector] ifoldl: OK
  9593. 710.54 s [vector] +++ OK, passed 100 tests.
  9594. 710.55 s [vector] ifoldl': OK
  9595. 710.55 s [vector] +++ OK, passed 100 tests.
  9596. 710.55 s [vector] ifoldr: OK
  9597. 710.55 s [vector] +++ OK, passed 100 tests.
  9598. 710.55 s [vector] ifoldr': OK
  9599. 710.55 s [vector] +++ OK, passed 100 tests.
  9600. 710.55 s [vector] ifoldM: OK
  9601. 710.55 s [vector] +++ OK, passed 100 tests.
  9602. 710.55 s [vector] ifoldM': OK
  9603. 710.56 s [vector] +++ OK, passed 100 tests.
  9604. 710.56 s [vector] ifoldM_: OK (0.02s)
  9605. 710.56 s [vector] +++ OK, passed 100 tests.
  9606. 710.56 s [vector] ifoldM'_: OK (0.01s)
  9607. 710.56 s [vector] +++ OK, passed 100 tests.
  9608. 710.56 s [vector] all: OK
  9609. 710.56 s [vector] +++ OK, passed 100 tests.
  9610. 710.56 s [vector] any: OK
  9611. 710.56 s [vector] +++ OK, passed 100 tests.
  9612. 710.57 s [vector] prescanl: OK
  9613. 710.57 s [vector] +++ OK, passed 100 tests.
  9614. 710.58 s [vector] prescanl': OK
  9615. 710.58 s [vector] +++ OK, passed 100 tests.
  9616. 710.58 s [vector] postscanl: OK
  9617. 710.58 s [vector] +++ OK, passed 100 tests.
  9618. 710.58 s [vector] postscanl': OK
  9619. 710.58 s [vector] +++ OK, passed 100 tests.
  9620. 710.58 s [vector] scanl: OK
  9621. 710.58 s [vector] +++ OK, passed 100 tests.
  9622. 710.58 s [vector] scanl': OK
  9623. 710.58 s [vector] +++ OK, passed 100 tests.
  9624. 710.58 s [vector] scanl1: OK
  9625. 710.58 s [vector] +++ OK, passed 100 tests.
  9626. 710.58 s [vector] scanl1': OK
  9627. 710.58 s [vector] +++ OK, passed 100 tests.
  9628. 710.58 s [vector] iscanl: OK
  9629. 710.58 s [vector] +++ OK, passed 100 tests.
  9630. 710.58 s [vector] iscanl': OK
  9631. 710.58 s [vector] +++ OK, passed 100 tests.
  9632. 710.58 s [vector] prescanr: OK
  9633. 710.58 s [vector] +++ OK, passed 100 tests.
  9634. 710.58 s [vector] prescanr': OK
  9635. 710.58 s [vector] +++ OK, passed 100 tests.
  9636. 710.58 s [vector] postscanr: OK
  9637. 710.58 s [vector] +++ OK, passed 100 tests.
  9638. 710.58 s [vector] postscanr': OK
  9639. 710.58 s [vector] +++ OK, passed 100 tests.
  9640. 710.58 s [vector] scanr: OK
  9641. 710.58 s [vector] +++ OK, passed 100 tests.
  9642. 710.58 s [vector] scanr': OK
  9643. 710.58 s [vector] +++ OK, passed 100 tests.
  9644. 710.58 s [vector] scanr1: OK
  9645. 710.58 s [vector] +++ OK, passed 100 tests.
  9646. 710.59 s [vector] scanr1': OK
  9647. 710.59 s [vector] +++ OK, passed 100 tests.
  9648. 710.59 s [vector] iscanr: OK
  9649. 710.59 s [vector] +++ OK, passed 100 tests.
  9650. 710.59 s [vector] iscanr': OK
  9651. 710.59 s [vector] +++ OK, passed 100 tests.
  9652. 710.59 s [vector] mut_read: OK
  9653. 710.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9654. 710.59 s [vector] mut_write: OK
  9655. 710.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9656. 710.59 s [vector] mut_modify: OK
  9657. 710.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9658. 710.59 s [vector] mut_generate: OK
  9659. 710.59 s [vector] +++ OK, passed 100 tests.
  9660. 710.59 s [vector] mut_generateM: OK (0.01s)
  9661. 710.59 s [vector] +++ OK, passed 100 tests.
  9662. 710.60 s [vector] mut_mapM_: OK (0.02s)
  9663. 710.60 s [vector] +++ OK, passed 100 tests.
  9664. 710.62 s [vector] mut_imapM_: OK (0.01s)
  9665. 710.62 s [vector] +++ OK, passed 100 tests.
  9666. 710.62 s [vector] mut_forM_: OK (0.01s)
  9667. 710.62 s [vector] +++ OK, passed 100 tests.
  9668. 710.64 s [vector] mut_iforM_: OK (0.01s)
  9669. 710.64 s [vector] +++ OK, passed 100 tests.
  9670. 710.64 s [vector] mut_foldr: OK
  9671. 710.64 s [vector] +++ OK, passed 100 tests.
  9672. 710.64 s [vector] mut_foldr': OK
  9673. 710.64 s [vector] +++ OK, passed 100 tests.
  9674. 710.65 s [vector] mut_foldl: OK
  9675. 710.65 s [vector] +++ OK, passed 100 tests.
  9676. 710.65 s [vector] mut_foldl': OK
  9677. 710.65 s [vector] +++ OK, passed 100 tests.
  9678. 710.66 s [vector] mut_ifoldr: OK
  9679. 710.66 s [vector] +++ OK, passed 100 tests.
  9680. 710.66 s [vector] mut_ifoldr': OK
  9681. 710.66 s [vector] +++ OK, passed 100 tests.
  9682. 710.66 s [vector] mut_ifoldl: OK
  9683. 710.66 s [vector] +++ OK, passed 100 tests.
  9684. 710.66 s [vector] mut_ifoldl': OK
  9685. 710.66 s [vector] +++ OK, passed 100 tests.
  9686. 710.66 s [vector] mut_foldM: OK
  9687. 710.66 s [vector] +++ OK, passed 100 tests.
  9688. 710.66 s [vector] mut_foldM': OK
  9689. 710.66 s [vector] +++ OK, passed 100 tests.
  9690. 710.66 s [vector] mut_foldrM: OK
  9691. 710.66 s [vector] +++ OK, passed 100 tests.
  9692. 710.66 s [vector] mut_foldrM': OK
  9693. 710.66 s [vector] +++ OK, passed 100 tests.
  9694. 710.67 s [vector] mut_ifoldM: OK
  9695. 710.67 s [vector] +++ OK, passed 100 tests.
  9696. 710.67 s [vector] mut_ifoldM': OK
  9697. 710.67 s [vector] +++ OK, passed 100 tests.
  9698. 710.67 s [vector] mut_ifoldrM: OK
  9699. 710.67 s [vector] +++ OK, passed 100 tests.
  9700. 710.67 s [vector] mut_ifoldrM': OK
  9701. 710.67 s [vector] +++ OK, passed 100 tests.
  9702. 710.67 s [vector] compare: OK
  9703. 710.67 s [vector] +++ OK, passed 100 tests.
  9704. 710.68 s [vector] maximum: OK
  9705. 710.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9706. 710.68 s [vector] minimum: OK
  9707. 710.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9708. 710.68 s [vector] minIndex: OK
  9709. 710.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9710. 710.68 s [vector] maxIndex: OK
  9711. 710.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9712. 710.68 s [vector] maximumBy: OK
  9713. 710.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9714. 710.68 s [vector] minimumBy: OK
  9715. 710.68 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9716. 710.68 s [vector] maximumOn: OK
  9717. 710.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9718. 710.68 s [vector] minimumOn: OK
  9719. 710.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9720. 710.68 s [vector] maxIndexBy: OK
  9721. 710.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9722. 710.68 s [vector] minIndexBy: OK
  9723. 710.68 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9724. 710.68 s [vector] ListFirstMaxIndexWins: OK
  9725. 710.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9726. 710.68 s [vector] FalseListFirstMaxIndexWins: OK
  9727. 710.68 s [vector] +++ OK, failed as expected. (after 1 test):
  9728. 710.68 s [vector] Exception:
  9729. 710.68 s [vector] Prelude.foldr1: empty list
  9730. 710.68 s [vector] CallStack (from HasCallStack):
  9731. 710.68 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9732. 710.68 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9733. 710.68 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9734. 710.68 s [vector] []
  9735. 710.68 s [vector] mempty: OK
  9736. 710.68 s [vector] +++ OK, passed 100 tests.
  9737. 710.68 s [vector] mappend: OK
  9738. 710.68 s [vector] +++ OK, passed 100 tests.
  9739. 710.69 s [vector] mconcat: OK (0.01s)
  9740. 710.69 s [vector] +++ OK, passed 100 tests.
  9741. 710.69 s [vector] glength: OK
  9742. 710.69 s [vector] +++ OK, passed 100 tests.
  9743. 710.69 s [vector] sum: OK
  9744. 710.69 s [vector] +++ OK, passed 100 tests.
  9745. 710.70 s [vector] product: OK
  9746. 710.70 s [vector] +++ OK, passed 100 tests.
  9747. 710.70 s [vector] enumFromN: OK
  9748. 710.70 s [vector] +++ OK, passed 100 tests.
  9749. 710.70 s [vector] enumFromThenN: OK
  9750. 710.70 s [vector] +++ OK, passed 100 tests.
  9751. 710.70 s [vector] enumFromTo: OK
  9752. 710.70 s [vector] +++ OK, passed 100 tests.
  9753. 710.70 s [vector] enumFromThenTo: OK
  9754. 710.70 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9755. 710.70 s [vector] Double
  9756. 710.70 s [vector] fromList.toList == id: OK
  9757. 710.70 s [vector] +++ OK, passed 100 tests.
  9758. 710.70 s [vector] toList.fromList == id: OK
  9759. 710.70 s [vector] +++ OK, passed 100 tests.
  9760. 710.70 s [vector] unstream.stream == id: OK
  9761. 710.70 s [vector] +++ OK, passed 100 tests.
  9762. 710.70 s [vector] stream.unstream == id: OK
  9763. 710.70 s [vector] +++ OK, passed 100 tests.
  9764. 710.70 s [vector] eq: OK
  9765. 710.70 s [vector] +++ OK, passed 100 tests.
  9766. 710.70 s [vector] length: OK
  9767. 710.70 s [vector] +++ OK, passed 100 tests.
  9768. 710.70 s [vector] null: OK
  9769. 710.70 s [vector] +++ OK, passed 100 tests.
  9770. 710.70 s [vector] index: OK
  9771. 710.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9772. 710.70 s [vector] safeIndex: OK
  9773. 710.70 s [vector] +++ OK, passed 100 tests.
  9774. 710.70 s [vector] head: OK
  9775. 710.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9776. 710.71 s [vector] last: OK
  9777. 710.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9778. 710.71 s [vector] unsafeIndex: OK
  9779. 710.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9780. 710.71 s [vector] unsafeHead: OK
  9781. 710.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9782. 710.71 s [vector] unsafeLast: OK
  9783. 710.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9784. 710.71 s [vector] slice: OK
  9785. 710.71 s [vector] +++ OK, passed 100 tests.
  9786. 710.71 s [vector] init: OK
  9787. 710.71 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9788. 710.71 s [vector] tail: OK
  9789. 710.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9790. 710.71 s [vector] take: OK
  9791. 710.71 s [vector] +++ OK, passed 100 tests.
  9792. 710.71 s [vector] drop: OK
  9793. 710.71 s [vector] +++ OK, passed 100 tests.
  9794. 710.71 s [vector] splitAt: OK
  9795. 710.71 s [vector] +++ OK, passed 100 tests.
  9796. 710.71 s [vector] empty: OK
  9797. 710.71 s [vector] +++ OK, passed 100 tests.
  9798. 710.71 s [vector] singleton: OK
  9799. 710.71 s [vector] +++ OK, passed 100 tests.
  9800. 710.71 s [vector] replicate: OK
  9801. 710.71 s [vector] +++ OK, passed 100 tests.
  9802. 710.72 s [vector] generate: OK
  9803. 710.72 s [vector] +++ OK, passed 100 tests.
  9804. 710.72 s [vector] iterateN: OK
  9805. 710.72 s [vector] +++ OK, passed 100 tests.
  9806. 710.74 s [vector] iterateNM: OK (0.02s)
  9807. 710.74 s [vector] +++ OK, passed 100 tests.
  9808. 710.76 s [vector] generateM: OK (0.02s)
  9809. 710.76 s [vector] +++ OK, passed 100 tests.
  9810. 710.77 s [vector] replicateM: OK (0.01s)
  9811. 710.77 s [vector] +++ OK, passed 100 tests.
  9812. 710.77 s [vector] create: OK
  9813. 710.77 s [vector] +++ OK, passed 100 tests.
  9814. 710.77 s [vector] createT: OK
  9815. 710.78 s [vector] +++ OK, passed 100 tests.
  9816. 710.78 s [vector] unfoldr: OK
  9817. 710.78 s [vector] +++ OK, passed 100 tests.
  9818. 710.78 s [vector] unfoldrN: OK
  9819. 710.78 s [vector] +++ OK, passed 100 tests.
  9820. 710.78 s [vector] unfoldrExactN: OK
  9821. 710.78 s [vector] +++ OK, passed 100 tests.
  9822. 710.78 s [vector] unfoldrM: OK
  9823. 710.78 s [vector] +++ OK, passed 100 tests.
  9824. 710.78 s [vector] unfoldrNM: OK
  9825. 710.78 s [vector] +++ OK, passed 100 tests.
  9826. 710.82 s [vector] unfoldrExactNM: OK (0.03s)
  9827. 710.82 s [vector] +++ OK, passed 100 tests.
  9828. 710.82 s [vector] constructN: OK (0.01s)
  9829. 710.82 s [vector] +++ OK, passed 100 tests.
  9830. 710.83 s [vector] constructrN: OK (0.01s)
  9831. 710.83 s [vector] +++ OK, passed 100 tests.
  9832. 710.83 s [vector] cons: OK
  9833. 710.83 s [vector] +++ OK, passed 100 tests.
  9834. 710.83 s [vector] snoc: OK
  9835. 710.83 s [vector] +++ OK, passed 100 tests.
  9836. 710.84 s [vector] append: OK
  9837. 710.84 s [vector] +++ OK, passed 100 tests.
  9838. 710.86 s [vector] concat: OK (0.02s)
  9839. 710.86 s [vector] +++ OK, passed 100 tests.
  9840. 710.86 s [vector] force: OK
  9841. 710.86 s [vector] +++ OK, passed 100 tests.
  9842. 710.86 s [vector] upd: OK
  9843. 710.86 s [vector] +++ OK, passed 100 tests.
  9844. 710.88 s [vector] accum: OK (0.01s)
  9845. 710.88 s [vector] +++ OK, passed 100 tests.
  9846. 710.88 s [vector] reverse: OK
  9847. 710.88 s [vector] +++ OK, passed 100 tests.
  9848. 710.88 s [vector] backpermute: OK
  9849. 710.88 s [vector] +++ OK, passed 100 tests.
  9850. 710.89 s [vector] map: OK
  9851. 710.90 s [vector] +++ OK, passed 100 tests.
  9852. 710.90 s [vector] imap: OK
  9853. 710.90 s [vector] +++ OK, passed 100 tests.
  9854. 710.92 s [vector] concatMap: OK
  9855. 710.92 s [vector] +++ OK, passed 100 tests.
  9856. 710.92 s [vector] mapM: OK
  9857. 710.92 s [vector] +++ OK, passed 100 tests.
  9858. 710.94 s [vector] mapM_: OK (0.03s)
  9859. 710.94 s [vector] +++ OK, passed 100 tests.
  9860. 710.94 s [vector] forM: OK
  9861. 710.94 s [vector] +++ OK, passed 100 tests.
  9862. 710.98 s [vector] forM_: OK (0.03s)
  9863. 710.98 s [vector] +++ OK, passed 100 tests.
  9864. 710.98 s [vector] imapM: OK
  9865. 710.98 s [vector] +++ OK, passed 100 tests.
  9866. 711.02 s [vector] imapM_: OK (0.04s)
  9867. 711.02 s [vector] +++ OK, passed 100 tests.
  9868. 711.03 s [vector] zipWith: OK
  9869. 711.03 s [vector] +++ OK, passed 100 tests.
  9870. 711.04 s [vector] zipWith3: OK
  9871. 711.04 s [vector] +++ OK, passed 100 tests.
  9872. 711.04 s [vector] izipWith: OK
  9873. 711.04 s [vector] +++ OK, passed 100 tests.
  9874. 711.06 s [vector] izipWith3: OK (0.01s)
  9875. 711.06 s [vector] +++ OK, passed 100 tests.
  9876. 711.06 s [vector] izipWithM: OK
  9877. 711.06 s [vector] +++ OK, passed 100 tests.
  9878. 711.10 s [vector] izipWithM_: OK (0.03s)
  9879. 711.10 s [vector] +++ OK, passed 100 tests.
  9880. 711.10 s [vector] zipWithM: OK
  9881. 711.10 s [vector] +++ OK, passed 100 tests.
  9882. 711.13 s [vector] zipWithM_: OK (0.03s)
  9883. 711.13 s [vector] +++ OK, passed 100 tests.
  9884. 711.13 s [vector] filter: OK
  9885. 711.14 s [vector] +++ OK, passed 100 tests.
  9886. 711.14 s [vector] ifilter: OK
  9887. 711.14 s [vector] +++ OK, passed 100 tests.
  9888. 711.17 s [vector] filterM: OK (0.04s)
  9889. 711.18 s [vector] +++ OK, passed 100 tests.
  9890. 711.18 s [vector] uniq: OK
  9891. 711.18 s [vector] +++ OK, passed 100 tests.
  9892. 711.20 s [vector] mapMaybe: OK (0.01s)
  9893. 711.20 s [vector] +++ OK, passed 100 tests.
  9894. 711.20 s [vector] imapMaybe: OK
  9895. 711.20 s [vector] +++ OK, passed 100 tests.
  9896. 711.20 s [vector] takeWhile: OK
  9897. 711.20 s [vector] +++ OK, passed 100 tests.
  9898. 711.20 s [vector] dropWhile: OK
  9899. 711.20 s [vector] +++ OK, passed 100 tests.
  9900. 711.20 s [vector] partition: OK
  9901. 711.20 s [vector] +++ OK, passed 100 tests.
  9902. 711.21 s [vector] partitionWith: OK
  9903. 711.21 s [vector] +++ OK, passed 100 tests.
  9904. 711.21 s [vector] span: OK
  9905. 711.21 s [vector] +++ OK, passed 100 tests.
  9906. 711.22 s [vector] break: OK
  9907. 711.22 s [vector] +++ OK, passed 100 tests.
  9908. 711.22 s [vector] spanR: OK
  9909. 711.22 s [vector] +++ OK, passed 100 tests.
  9910. 711.22 s [vector] breakR: OK
  9911. 711.22 s [vector] +++ OK, passed 100 tests.
  9912. 711.23 s [vector] groupBy: OK
  9913. 711.23 s [vector] +++ OK, passed 100 tests.
  9914. 711.23 s [vector] elem: OK
  9915. 711.23 s [vector] +++ OK, passed 100 tests.
  9916. 711.23 s [vector] notElem: OK
  9917. 711.23 s [vector] +++ OK, passed 100 tests.
  9918. 711.23 s [vector] find: OK
  9919. 711.23 s [vector] +++ OK, passed 100 tests.
  9920. 711.23 s [vector] findIndex: OK
  9921. 711.23 s [vector] +++ OK, passed 100 tests.
  9922. 711.23 s [vector] findIndexR: OK
  9923. 711.23 s [vector] +++ OK, passed 100 tests.
  9924. 711.24 s [vector] findIndices: OK
  9925. 711.24 s [vector] +++ OK, passed 100 tests.
  9926. 711.24 s [vector] elemIndex: OK
  9927. 711.24 s [vector] +++ OK, passed 100 tests.
  9928. 711.24 s [vector] elemIndices: OK
  9929. 711.24 s [vector] +++ OK, passed 100 tests.
  9930. 711.26 s [vector] foldl: OK
  9931. 711.26 s [vector] +++ OK, passed 100 tests.
  9932. 711.26 s [vector] foldl1: OK (0.01s)
  9933. 711.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9934. 711.28 s [vector] foldl': OK (0.01s)
  9935. 711.28 s [vector] +++ OK, passed 100 tests.
  9936. 711.28 s [vector] foldl1': OK (0.01s)
  9937. 711.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9938. 711.30 s [vector] foldr: OK (0.01s)
  9939. 711.30 s [vector] +++ OK, passed 100 tests.
  9940. 711.32 s [vector] foldr1: OK (0.01s)
  9941. 711.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9942. 711.32 s [vector] foldr': OK (0.01s)
  9943. 711.32 s [vector] +++ OK, passed 100 tests.
  9944. 711.33 s [vector] foldr1': OK
  9945. 711.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9946. 711.34 s [vector] ifoldl: OK (0.01s)
  9947. 711.34 s [vector] +++ OK, passed 100 tests.
  9948. 711.36 s [vector] ifoldl': OK (0.01s)
  9949. 711.36 s [vector] +++ OK, passed 100 tests.
  9950. 711.36 s [vector] ifoldr: OK (0.01s)
  9951. 711.36 s [vector] +++ OK, passed 100 tests.
  9952. 711.38 s [vector] ifoldr': OK (0.01s)
  9953. 711.38 s [vector] +++ OK, passed 100 tests.
  9954. 711.39 s [vector] ifoldM: OK (0.01s)
  9955. 711.40 s [vector] +++ OK, passed 100 tests.
  9956. 711.40 s [vector] ifoldM': OK (0.01s)
  9957. 711.40 s [vector] +++ OK, passed 100 tests.
  9958. 711.44 s [vector] ifoldM_: OK (0.03s)
  9959. 711.44 s [vector] +++ OK, passed 100 tests.
  9960. 711.46 s [vector] ifoldM'_: OK (0.03s)
  9961. 711.46 s [vector] +++ OK, passed 100 tests.
  9962. 711.46 s [vector] all: OK
  9963. 711.46 s [vector] +++ OK, passed 100 tests.
  9964. 711.46 s [vector] any: OK
  9965. 711.46 s [vector] +++ OK, passed 100 tests.
  9966. 711.48 s [vector] prescanl: OK (0.02s)
  9967. 711.48 s [vector] +++ OK, passed 100 tests.
  9968. 711.50 s [vector] prescanl': OK (0.01s)
  9969. 711.50 s [vector] +++ OK, passed 100 tests.
  9970. 711.50 s [vector] postscanl: OK (0.01s)
  9971. 711.50 s [vector] +++ OK, passed 100 tests.
  9972. 711.53 s [vector] postscanl': OK (0.01s)
  9973. 711.53 s [vector] +++ OK, passed 100 tests.
  9974. 711.53 s [vector] scanl: OK (0.01s)
  9975. 711.53 s [vector] +++ OK, passed 100 tests.
  9976. 711.54 s [vector] scanl': OK (0.01s)
  9977. 711.54 s [vector] +++ OK, passed 100 tests.
  9978. 711.54 s [vector] scanl1: OK
  9979. 711.55 s [vector] +++ OK, passed 100 tests.
  9980. 711.56 s [vector] scanl1': OK (0.01s)
  9981. 711.56 s [vector] +++ OK, passed 100 tests.
  9982. 711.58 s [vector] iscanl: OK (0.01s)
  9983. 711.58 s [vector] +++ OK, passed 100 tests.
  9984. 711.58 s [vector] iscanl': OK (0.01s)
  9985. 711.58 s [vector] +++ OK, passed 100 tests.
  9986. 711.60 s [vector] prescanr: OK (0.01s)
  9987. 711.60 s [vector] +++ OK, passed 100 tests.
  9988. 711.61 s [vector] prescanr': OK (0.01s)
  9989. 711.62 s [vector] +++ OK, passed 100 tests.
  9990. 711.63 s [vector] postscanr: OK (0.01s)
  9991. 711.63 s [vector] +++ OK, passed 100 tests.
  9992. 711.64 s [vector] postscanr': OK (0.01s)
  9993. 711.64 s [vector] +++ OK, passed 100 tests.
  9994. 711.64 s [vector] scanr: OK (0.01s)
  9995. 711.64 s [vector] +++ OK, passed 100 tests.
  9996. 711.66 s [vector] scanr': OK (0.01s)
  9997. 711.66 s [vector] +++ OK, passed 100 tests.
  9998. 711.66 s [vector] scanr1: OK (0.01s)
  9999. 711.66 s [vector] +++ OK, passed 100 tests.
  10000. 711.68 s [vector] scanr1': OK (0.01s)
  10001. 711.68 s [vector] +++ OK, passed 100 tests.
  10002. 711.70 s [vector] iscanr: OK (0.01s)
  10003. 711.70 s [vector] +++ OK, passed 100 tests.
  10004. 711.70 s [vector] iscanr': OK (0.01s)
  10005. 711.70 s [vector] +++ OK, passed 100 tests.
  10006. 711.70 s [vector] mut_read: OK
  10007. 711.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10008. 711.70 s [vector] mut_write: OK
  10009. 711.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10010. 711.70 s [vector] mut_modify: OK
  10011. 711.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10012. 711.70 s [vector] mut_generate: OK
  10013. 711.70 s [vector] +++ OK, passed 100 tests.
  10014. 711.72 s [vector] mut_generateM: OK (0.02s)
  10015. 711.72 s [vector] +++ OK, passed 100 tests.
  10016. 711.76 s [vector] mut_mapM_: OK (0.03s)
  10017. 711.76 s [vector] +++ OK, passed 100 tests.
  10018. 711.78 s [vector] mut_imapM_: OK (0.03s)
  10019. 711.78 s [vector] +++ OK, passed 100 tests.
  10020. 711.82 s [vector] mut_forM_: OK (0.03s)
  10021. 711.82 s [vector] +++ OK, passed 100 tests.
  10022. 711.84 s [vector] mut_iforM_: OK (0.03s)
  10023. 711.84 s [vector] +++ OK, passed 100 tests.
  10024. 711.84 s [vector] mut_foldr: OK
  10025. 711.85 s [vector] +++ OK, passed 100 tests.
  10026. 711.86 s [vector] mut_foldr': OK (0.01s)
  10027. 711.86 s [vector] +++ OK, passed 100 tests.
  10028. 711.88 s [vector] mut_foldl: OK (0.01s)
  10029. 711.88 s [vector] +++ OK, passed 100 tests.
  10030. 711.88 s [vector] mut_foldl': OK (0.01s)
  10031. 711.88 s [vector] +++ OK, passed 100 tests.
  10032. 711.88 s [vector] mut_ifoldr: OK
  10033. 711.88 s [vector] +++ OK, passed 100 tests.
  10034. 711.90 s [vector] mut_ifoldr': OK (0.01s)
  10035. 711.90 s [vector] +++ OK, passed 100 tests.
  10036. 711.92 s [vector] mut_ifoldl: OK (0.01s)
  10037. 711.92 s [vector] +++ OK, passed 100 tests.
  10038. 711.92 s [vector] mut_ifoldl': OK (0.01s)
  10039. 711.92 s [vector] +++ OK, passed 100 tests.
  10040. 711.94 s [vector] mut_foldM: OK (0.01s)
  10041. 711.94 s [vector] +++ OK, passed 100 tests.
  10042. 711.95 s [vector] mut_foldM': OK (0.01s)
  10043. 711.95 s [vector] +++ OK, passed 100 tests.
  10044. 711.96 s [vector] mut_foldrM: OK (0.01s)
  10045. 711.96 s [vector] +++ OK, passed 100 tests.
  10046. 711.97 s [vector] mut_foldrM': OK (0.01s)
  10047. 711.97 s [vector] +++ OK, passed 100 tests.
  10048. 711.98 s [vector] mut_ifoldM: OK (0.01s)
  10049. 711.98 s [vector] +++ OK, passed 100 tests.
  10050. 712.00 s [vector] mut_ifoldM': OK (0.01s)
  10051. 712.00 s [vector] +++ OK, passed 100 tests.
  10052. 712.01 s [vector] mut_ifoldrM: OK (0.01s)
  10053. 712.01 s [vector] +++ OK, passed 100 tests.
  10054. 712.01 s [vector] mut_ifoldrM': OK (0.01s)
  10055. 712.01 s [vector] +++ OK, passed 100 tests.
  10056. 712.01 s [vector] compare: OK
  10057. 712.01 s [vector] +++ OK, passed 100 tests.
  10058. 712.01 s [vector] maximum: OK
  10059. 712.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10060. 712.01 s [vector] minimum: OK
  10061. 712.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10062. 712.01 s [vector] minIndex: OK
  10063. 712.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10064. 712.01 s [vector] maxIndex: OK
  10065. 712.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10066. 712.01 s [vector] maximumBy: OK
  10067. 712.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10068. 712.01 s [vector] minimumBy: OK
  10069. 712.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10070. 712.02 s [vector] maximumOn: OK
  10071. 712.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10072. 712.02 s [vector] minimumOn: OK
  10073. 712.02 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10074. 712.02 s [vector] maxIndexBy: OK
  10075. 712.02 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10076. 712.02 s [vector] minIndexBy: OK
  10077. 712.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10078. 712.02 s [vector] ListFirstMaxIndexWins: OK
  10079. 712.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10080. 712.02 s [vector] FalseListFirstMaxIndexWins: OK
  10081. 712.02 s [vector] +++ OK, failed as expected. (after 1 test):
  10082. 712.02 s [vector] Exception:
  10083. 712.02 s [vector] Prelude.foldr1: empty list
  10084. 712.02 s [vector] CallStack (from HasCallStack):
  10085. 712.02 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10086. 712.02 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10087. 712.02 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10088. 712.02 s [vector] []
  10089. 712.03 s [vector] mempty: OK
  10090. 712.03 s [vector] +++ OK, passed 100 tests.
  10091. 712.03 s [vector] mappend: OK
  10092. 712.03 s [vector] +++ OK, passed 100 tests.
  10093. 712.04 s [vector] mconcat: OK (0.02s)
  10094. 712.04 s [vector] +++ OK, passed 100 tests.
  10095. 712.04 s [vector] glength: OK
  10096. 712.04 s [vector] +++ OK, passed 100 tests.
  10097. 712.04 s [vector] sum: OK
  10098. 712.04 s [vector] +++ OK, passed 100 tests.
  10099. 712.04 s [vector] product: OK
  10100. 712.04 s [vector] +++ OK, passed 100 tests.
  10101. 712.04 s [vector] enumFromN: OK
  10102. 712.04 s [vector] +++ OK, passed 100 tests.
  10103. 712.04 s [vector] enumFromThenN: OK
  10104. 712.04 s [vector] +++ OK, passed 100 tests.
  10105. 712.04 s [vector] enumFromTo: OK
  10106. 712.04 s [vector] +++ OK, passed 100 tests.
  10107. 712.04 s [vector] enumFromThenTo: OK
  10108. 712.04 s [vector] +++ OK, passed 100 tests; 8 discarded.
  10109. 712.04 s [vector] unstream
  10110. 712.04 s [vector] unstream == vunstream (exact): OK
  10111. 712.05 s [vector] +++ OK, passed 100 tests.
  10112. 712.05 s [vector] unstream == vunstream (unknown): OK
  10113. 712.05 s [vector] +++ OK, passed 100 tests.
  10114. 712.05 s [vector] unstreamR ~= vunstream (exact): OK
  10115. 712.05 s [vector] +++ OK, passed 100 tests.
  10116. 712.05 s [vector] unstreamR ~= vunstream (unknown): OK
  10117. 712.05 s [vector] +++ OK, passed 100 tests.
  10118. 712.05 s [vector] Tests.Vector.Storable
  10119. 712.05 s [vector] Data.Vector.Storable.Vector (Int)
  10120. 712.05 s [vector] fromList.toList == id: OK
  10121. 712.05 s [vector] +++ OK, passed 100 tests.
  10122. 712.05 s [vector] toList.fromList == id: OK
  10123. 712.05 s [vector] +++ OK, passed 100 tests.
  10124. 712.05 s [vector] unstream.stream == id: OK
  10125. 712.05 s [vector] +++ OK, passed 100 tests.
  10126. 712.05 s [vector] stream.unstream == id: OK
  10127. 712.05 s [vector] +++ OK, passed 100 tests.
  10128. 712.05 s [vector] eq: OK
  10129. 712.05 s [vector] +++ OK, passed 100 tests.
  10130. 712.05 s [vector] length: OK
  10131. 712.05 s [vector] +++ OK, passed 100 tests.
  10132. 712.05 s [vector] null: OK
  10133. 712.05 s [vector] +++ OK, passed 100 tests.
  10134. 712.05 s [vector] index: OK
  10135. 712.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10136. 712.05 s [vector] safeIndex: OK
  10137. 712.05 s [vector] +++ OK, passed 100 tests.
  10138. 712.05 s [vector] head: OK
  10139. 712.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10140. 712.05 s [vector] last: OK
  10141. 712.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10142. 712.05 s [vector] unsafeIndex: OK
  10143. 712.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10144. 712.05 s [vector] unsafeHead: OK
  10145. 712.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10146. 712.05 s [vector] unsafeLast: OK
  10147. 712.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10148. 712.05 s [vector] slice: OK
  10149. 712.05 s [vector] +++ OK, passed 100 tests.
  10150. 712.05 s [vector] init: OK
  10151. 712.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10152. 712.05 s [vector] tail: OK
  10153. 712.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10154. 712.05 s [vector] take: OK
  10155. 712.05 s [vector] +++ OK, passed 100 tests.
  10156. 712.05 s [vector] drop: OK
  10157. 712.05 s [vector] +++ OK, passed 100 tests.
  10158. 712.05 s [vector] splitAt: OK
  10159. 712.05 s [vector] +++ OK, passed 100 tests.
  10160. 712.05 s [vector] empty: OK
  10161. 712.06 s [vector] +++ OK, passed 100 tests.
  10162. 712.06 s [vector] singleton: OK
  10163. 712.06 s [vector] +++ OK, passed 100 tests.
  10164. 712.06 s [vector] replicate: OK
  10165. 712.06 s [vector] +++ OK, passed 100 tests.
  10166. 712.06 s [vector] generate: OK
  10167. 712.06 s [vector] +++ OK, passed 100 tests.
  10168. 712.06 s [vector] iterateN: OK
  10169. 712.06 s [vector] +++ OK, passed 100 tests.
  10170. 712.08 s [vector] iterateNM: OK (0.02s)
  10171. 712.08 s [vector] +++ OK, passed 100 tests.
  10172. 712.11 s [vector] generateM: OK (0.02s)
  10173. 712.11 s [vector] +++ OK, passed 100 tests.
  10174. 712.11 s [vector] replicateM: OK (0.01s)
  10175. 712.11 s [vector] +++ OK, passed 100 tests.
  10176. 712.11 s [vector] create: OK
  10177. 712.11 s [vector] +++ OK, passed 100 tests.
  10178. 712.11 s [vector] createT: OK
  10179. 712.11 s [vector] +++ OK, passed 100 tests.
  10180. 712.11 s [vector] unfoldr: OK
  10181. 712.11 s [vector] +++ OK, passed 100 tests.
  10182. 712.11 s [vector] unfoldrN: OK
  10183. 712.11 s [vector] +++ OK, passed 100 tests.
  10184. 712.11 s [vector] unfoldrExactN: OK
  10185. 712.11 s [vector] +++ OK, passed 100 tests.
  10186. 712.12 s [vector] unfoldrM: OK
  10187. 712.12 s [vector] +++ OK, passed 100 tests.
  10188. 712.12 s [vector] unfoldrNM: OK
  10189. 712.12 s [vector] +++ OK, passed 100 tests.
  10190. 712.13 s [vector] unfoldrExactNM: OK (0.01s)
  10191. 712.13 s [vector] +++ OK, passed 100 tests.
  10192. 712.13 s [vector] constructN: OK
  10193. 712.13 s [vector] +++ OK, passed 100 tests.
  10194. 712.13 s [vector] constructrN: OK
  10195. 712.13 s [vector] +++ OK, passed 100 tests.
  10196. 712.13 s [vector] cons: OK
  10197. 712.13 s [vector] +++ OK, passed 100 tests.
  10198. 712.13 s [vector] snoc: OK
  10199. 712.13 s [vector] +++ OK, passed 100 tests.
  10200. 712.14 s [vector] append: OK
  10201. 712.14 s [vector] +++ OK, passed 100 tests.
  10202. 712.15 s [vector] concat: OK (0.01s)
  10203. 712.15 s [vector] +++ OK, passed 100 tests.
  10204. 712.15 s [vector] force: OK
  10205. 712.15 s [vector] +++ OK, passed 100 tests.
  10206. 712.15 s [vector] upd: OK
  10207. 712.15 s [vector] +++ OK, passed 100 tests.
  10208. 712.15 s [vector] accum: OK
  10209. 712.15 s [vector] +++ OK, passed 100 tests.
  10210. 712.15 s [vector] reverse: OK
  10211. 712.16 s [vector] +++ OK, passed 100 tests.
  10212. 712.16 s [vector] backpermute: OK
  10213. 712.16 s [vector] +++ OK, passed 100 tests.
  10214. 712.16 s [vector] map: OK
  10215. 712.16 s [vector] +++ OK, passed 100 tests.
  10216. 712.16 s [vector] imap: OK
  10217. 712.16 s [vector] +++ OK, passed 100 tests.
  10218. 712.17 s [vector] concatMap: OK
  10219. 712.17 s [vector] +++ OK, passed 100 tests.
  10220. 712.17 s [vector] mapM: OK
  10221. 712.17 s [vector] +++ OK, passed 100 tests.
  10222. 712.18 s [vector] mapM_: OK (0.02s)
  10223. 712.18 s [vector] +++ OK, passed 100 tests.
  10224. 712.18 s [vector] forM: OK
  10225. 712.18 s [vector] +++ OK, passed 100 tests.
  10226. 712.20 s [vector] forM_: OK (0.01s)
  10227. 712.20 s [vector] +++ OK, passed 100 tests.
  10228. 712.20 s [vector] imapM: OK
  10229. 712.20 s [vector] +++ OK, passed 100 tests.
  10230. 712.22 s [vector] imapM_: OK (0.02s)
  10231. 712.22 s [vector] +++ OK, passed 100 tests.
  10232. 712.22 s [vector] zipWith: OK
  10233. 712.22 s [vector] +++ OK, passed 100 tests.
  10234. 712.22 s [vector] zipWith3: OK
  10235. 712.22 s [vector] +++ OK, passed 100 tests.
  10236. 712.22 s [vector] izipWith: OK
  10237. 712.22 s [vector] +++ OK, passed 100 tests.
  10238. 712.22 s [vector] izipWith3: OK
  10239. 712.22 s [vector] +++ OK, passed 100 tests.
  10240. 712.23 s [vector] izipWithM: OK
  10241. 712.23 s [vector] +++ OK, passed 100 tests.
  10242. 712.24 s [vector] izipWithM_: OK (0.01s)
  10243. 712.24 s [vector] +++ OK, passed 100 tests.
  10244. 712.24 s [vector] zipWithM: OK
  10245. 712.24 s [vector] +++ OK, passed 100 tests.
  10246. 712.25 s [vector] zipWithM_: OK (0.01s)
  10247. 712.26 s [vector] +++ OK, passed 100 tests.
  10248. 712.26 s [vector] filter: OK
  10249. 712.26 s [vector] +++ OK, passed 100 tests.
  10250. 712.26 s [vector] ifilter: OK
  10251. 712.26 s [vector] +++ OK, passed 100 tests.
  10252. 712.29 s [vector] filterM: OK (0.03s)
  10253. 712.29 s [vector] +++ OK, passed 100 tests.
  10254. 712.29 s [vector] uniq: OK
  10255. 712.29 s [vector] +++ OK, passed 100 tests.
  10256. 712.29 s [vector] mapMaybe: OK
  10257. 712.29 s [vector] +++ OK, passed 100 tests.
  10258. 712.29 s [vector] imapMaybe: OK
  10259. 712.29 s [vector] +++ OK, passed 100 tests.
  10260. 712.29 s [vector] takeWhile: OK
  10261. 712.29 s [vector] +++ OK, passed 100 tests.
  10262. 712.29 s [vector] dropWhile: OK
  10263. 712.29 s [vector] +++ OK, passed 100 tests.
  10264. 712.30 s [vector] partition: OK
  10265. 712.30 s [vector] +++ OK, passed 100 tests.
  10266. 712.30 s [vector] partitionWith: OK
  10267. 712.30 s [vector] +++ OK, passed 100 tests.
  10268. 712.30 s [vector] span: OK
  10269. 712.30 s [vector] +++ OK, passed 100 tests.
  10270. 712.30 s [vector] break: OK
  10271. 712.30 s [vector] +++ OK, passed 100 tests.
  10272. 712.30 s [vector] spanR: OK
  10273. 712.30 s [vector] +++ OK, passed 100 tests.
  10274. 712.30 s [vector] breakR: OK
  10275. 712.30 s [vector] +++ OK, passed 100 tests.
  10276. 712.30 s [vector] groupBy: OK
  10277. 712.30 s [vector] +++ OK, passed 100 tests.
  10278. 712.30 s [vector] elem: OK
  10279. 712.30 s [vector] +++ OK, passed 100 tests.
  10280. 712.31 s [vector] notElem: OK
  10281. 712.31 s [vector] +++ OK, passed 100 tests.
  10282. 712.31 s [vector] find: OK
  10283. 712.31 s [vector] +++ OK, passed 100 tests.
  10284. 712.31 s [vector] findIndex: OK
  10285. 712.31 s [vector] +++ OK, passed 100 tests.
  10286. 712.31 s [vector] findIndexR: OK
  10287. 712.31 s [vector] +++ OK, passed 100 tests.
  10288. 712.31 s [vector] findIndices: OK
  10289. 712.31 s [vector] +++ OK, passed 100 tests.
  10290. 712.31 s [vector] elemIndex: OK
  10291. 712.31 s [vector] +++ OK, passed 100 tests.
  10292. 712.31 s [vector] elemIndices: OK
  10293. 712.31 s [vector] +++ OK, passed 100 tests.
  10294. 712.31 s [vector] foldl: OK
  10295. 712.31 s [vector] +++ OK, passed 100 tests.
  10296. 712.31 s [vector] foldl1: OK
  10297. 712.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10298. 712.31 s [vector] foldl': OK
  10299. 712.31 s [vector] +++ OK, passed 100 tests.
  10300. 712.32 s [vector] foldl1': OK
  10301. 712.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10302. 712.32 s [vector] foldr: OK
  10303. 712.32 s [vector] +++ OK, passed 100 tests.
  10304. 712.32 s [vector] foldr1: OK
  10305. 712.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10306. 712.32 s [vector] foldr': OK
  10307. 712.32 s [vector] +++ OK, passed 100 tests.
  10308. 712.32 s [vector] foldr1': OK
  10309. 712.32 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10310. 712.33 s [vector] ifoldl: OK
  10311. 712.33 s [vector] +++ OK, passed 100 tests.
  10312. 712.33 s [vector] ifoldl': OK
  10313. 712.33 s [vector] +++ OK, passed 100 tests.
  10314. 712.34 s [vector] ifoldr: OK
  10315. 712.34 s [vector] +++ OK, passed 100 tests.
  10316. 712.34 s [vector] ifoldr': OK
  10317. 712.34 s [vector] +++ OK, passed 100 tests.
  10318. 712.34 s [vector] ifoldM: OK
  10319. 712.34 s [vector] +++ OK, passed 100 tests.
  10320. 712.34 s [vector] ifoldM': OK
  10321. 712.34 s [vector] +++ OK, passed 100 tests.
  10322. 712.36 s [vector] ifoldM_: OK (0.01s)
  10323. 712.36 s [vector] +++ OK, passed 100 tests.
  10324. 712.37 s [vector] ifoldM'_: OK (0.01s)
  10325. 712.37 s [vector] +++ OK, passed 100 tests.
  10326. 712.37 s [vector] all: OK
  10327. 712.37 s [vector] +++ OK, passed 100 tests.
  10328. 712.37 s [vector] any: OK
  10329. 712.37 s [vector] +++ OK, passed 100 tests.
  10330. 712.37 s [vector] prescanl: OK
  10331. 712.37 s [vector] +++ OK, passed 100 tests.
  10332. 712.37 s [vector] prescanl': OK
  10333. 712.38 s [vector] +++ OK, passed 100 tests.
  10334. 712.38 s [vector] postscanl: OK
  10335. 712.38 s [vector] +++ OK, passed 100 tests.
  10336. 712.38 s [vector] postscanl': OK
  10337. 712.38 s [vector] +++ OK, passed 100 tests.
  10338. 712.38 s [vector] scanl: OK
  10339. 712.38 s [vector] +++ OK, passed 100 tests.
  10340. 712.39 s [vector] scanl': OK
  10341. 712.39 s [vector] +++ OK, passed 100 tests.
  10342. 712.39 s [vector] scanl1: OK
  10343. 712.39 s [vector] +++ OK, passed 100 tests.
  10344. 712.39 s [vector] scanl1': OK
  10345. 712.39 s [vector] +++ OK, passed 100 tests.
  10346. 712.39 s [vector] iscanl: OK
  10347. 712.39 s [vector] +++ OK, passed 100 tests.
  10348. 712.40 s [vector] iscanl': OK
  10349. 712.40 s [vector] +++ OK, passed 100 tests.
  10350. 712.40 s [vector] prescanr: OK
  10351. 712.40 s [vector] +++ OK, passed 100 tests.
  10352. 712.40 s [vector] prescanr': OK
  10353. 712.40 s [vector] +++ OK, passed 100 tests.
  10354. 712.40 s [vector] postscanr: OK
  10355. 712.40 s [vector] +++ OK, passed 100 tests.
  10356. 712.41 s [vector] postscanr': OK
  10357. 712.41 s [vector] +++ OK, passed 100 tests.
  10358. 712.41 s [vector] scanr: OK
  10359. 712.41 s [vector] +++ OK, passed 100 tests.
  10360. 712.41 s [vector] scanr': OK
  10361. 712.41 s [vector] +++ OK, passed 100 tests.
  10362. 712.41 s [vector] scanr1: OK
  10363. 712.42 s [vector] +++ OK, passed 100 tests.
  10364. 712.42 s [vector] scanr1': OK
  10365. 712.42 s [vector] +++ OK, passed 100 tests.
  10366. 712.42 s [vector] iscanr: OK
  10367. 712.42 s [vector] +++ OK, passed 100 tests.
  10368. 712.42 s [vector] iscanr': OK
  10369. 712.42 s [vector] +++ OK, passed 100 tests.
  10370. 712.42 s [vector] mut_read: OK
  10371. 712.42 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10372. 712.42 s [vector] mut_write: OK
  10373. 712.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10374. 712.42 s [vector] mut_modify: OK
  10375. 712.42 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10376. 712.43 s [vector] mut_generate: OK
  10377. 712.43 s [vector] +++ OK, passed 100 tests.
  10378. 712.43 s [vector] mut_generateM: OK
  10379. 712.44 s [vector] +++ OK, passed 100 tests.
  10380. 712.46 s [vector] mut_mapM_: OK (0.01s)
  10381. 712.46 s [vector] +++ OK, passed 100 tests.
  10382. 712.46 s [vector] mut_imapM_: OK (0.01s)
  10383. 712.46 s [vector] +++ OK, passed 100 tests.
  10384. 712.48 s [vector] mut_forM_: OK (0.01s)
  10385. 712.48 s [vector] +++ OK, passed 100 tests.
  10386. 712.49 s [vector] mut_iforM_: OK (0.01s)
  10387. 712.49 s [vector] +++ OK, passed 100 tests.
  10388. 712.49 s [vector] mut_foldr: OK
  10389. 712.49 s [vector] +++ OK, passed 100 tests.
  10390. 712.49 s [vector] mut_foldr': OK
  10391. 712.49 s [vector] +++ OK, passed 100 tests.
  10392. 712.49 s [vector] mut_foldl: OK
  10393. 712.49 s [vector] +++ OK, passed 100 tests.
  10394. 712.49 s [vector] mut_foldl': OK
  10395. 712.49 s [vector] +++ OK, passed 100 tests.
  10396. 712.50 s [vector] mut_ifoldr: OK
  10397. 712.50 s [vector] +++ OK, passed 100 tests.
  10398. 712.50 s [vector] mut_ifoldr': OK
  10399. 712.50 s [vector] +++ OK, passed 100 tests.
  10400. 712.51 s [vector] mut_ifoldl: OK
  10401. 712.51 s [vector] +++ OK, passed 100 tests.
  10402. 712.51 s [vector] mut_ifoldl': OK
  10403. 712.51 s [vector] +++ OK, passed 100 tests.
  10404. 712.51 s [vector] mut_foldM: OK
  10405. 712.51 s [vector] +++ OK, passed 100 tests.
  10406. 712.51 s [vector] mut_foldM': OK
  10407. 712.52 s [vector] +++ OK, passed 100 tests.
  10408. 712.52 s [vector] mut_foldrM: OK
  10409. 712.52 s [vector] +++ OK, passed 100 tests.
  10410. 712.52 s [vector] mut_foldrM': OK
  10411. 712.52 s [vector] +++ OK, passed 100 tests.
  10412. 712.52 s [vector] mut_ifoldM: OK
  10413. 712.52 s [vector] +++ OK, passed 100 tests.
  10414. 712.52 s [vector] mut_ifoldM': OK
  10415. 712.52 s [vector] +++ OK, passed 100 tests.
  10416. 712.52 s [vector] mut_ifoldrM: OK
  10417. 712.52 s [vector] +++ OK, passed 100 tests.
  10418. 712.53 s [vector] mut_ifoldrM': OK
  10419. 712.53 s [vector] +++ OK, passed 100 tests.
  10420. 712.53 s [vector] compare: OK
  10421. 712.53 s [vector] +++ OK, passed 100 tests.
  10422. 712.53 s [vector] maximum: OK
  10423. 712.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10424. 712.53 s [vector] minimum: OK
  10425. 712.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10426. 712.53 s [vector] minIndex: OK
  10427. 712.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10428. 712.53 s [vector] maxIndex: OK
  10429. 712.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10430. 712.53 s [vector] maximumBy: OK
  10431. 712.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10432. 712.53 s [vector] minimumBy: OK
  10433. 712.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10434. 712.54 s [vector] maximumOn: OK
  10435. 712.54 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10436. 712.54 s [vector] minimumOn: OK
  10437. 712.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10438. 712.54 s [vector] maxIndexBy: OK
  10439. 712.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10440. 712.54 s [vector] minIndexBy: OK
  10441. 712.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10442. 712.54 s [vector] ListFirstMaxIndexWins: OK
  10443. 712.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10444. 712.54 s [vector] FalseListFirstMaxIndexWins: OK
  10445. 712.54 s [vector] +++ OK, failed as expected. (after 1 test):
  10446. 712.54 s [vector] Exception:
  10447. 712.54 s [vector] Prelude.foldr1: empty list
  10448. 712.54 s [vector] CallStack (from HasCallStack):
  10449. 712.54 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10450. 712.54 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10451. 712.54 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10452. 712.55 s [vector] []
  10453. 712.55 s [vector] mempty: OK
  10454. 712.55 s [vector] +++ OK, passed 100 tests.
  10455. 712.55 s [vector] mappend: OK
  10456. 712.55 s [vector] +++ OK, passed 100 tests.
  10457. 712.55 s [vector] mconcat: OK (0.01s)
  10458. 712.55 s [vector] +++ OK, passed 100 tests.
  10459. 712.55 s [vector] glength: OK
  10460. 712.55 s [vector] +++ OK, passed 100 tests.
  10461. 712.55 s [vector] sum: OK
  10462. 712.55 s [vector] +++ OK, passed 100 tests.
  10463. 712.55 s [vector] product: OK
  10464. 712.55 s [vector] +++ OK, passed 100 tests.
  10465. 712.55 s [vector] enumFromN: OK
  10466. 712.55 s [vector] +++ OK, passed 100 tests.
  10467. 712.55 s [vector] enumFromThenN: OK
  10468. 712.55 s [vector] +++ OK, passed 100 tests.
  10469. 712.55 s [vector] enumFromTo: OK
  10470. 712.55 s [vector] +++ OK, passed 100 tests.
  10471. 712.55 s [vector] enumFromThenTo: OK
  10472. 712.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10473. 712.55 s [vector] Data.Vector.Storable.Vector (Double)
  10474. 712.55 s [vector] fromList.toList == id: OK
  10475. 712.55 s [vector] +++ OK, passed 100 tests.
  10476. 712.55 s [vector] toList.fromList == id: OK
  10477. 712.55 s [vector] +++ OK, passed 100 tests.
  10478. 712.55 s [vector] unstream.stream == id: OK
  10479. 712.55 s [vector] +++ OK, passed 100 tests.
  10480. 712.55 s [vector] stream.unstream == id: OK
  10481. 712.55 s [vector] +++ OK, passed 100 tests.
  10482. 712.55 s [vector] eq: OK
  10483. 712.55 s [vector] +++ OK, passed 100 tests.
  10484. 712.55 s [vector] length: OK
  10485. 712.56 s [vector] +++ OK, passed 100 tests.
  10486. 712.56 s [vector] null: OK
  10487. 712.56 s [vector] +++ OK, passed 100 tests.
  10488. 712.56 s [vector] index: OK
  10489. 712.56 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10490. 712.56 s [vector] safeIndex: OK
  10491. 712.56 s [vector] +++ OK, passed 100 tests.
  10492. 712.56 s [vector] head: OK
  10493. 712.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10494. 712.56 s [vector] last: OK
  10495. 712.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10496. 712.56 s [vector] unsafeIndex: OK
  10497. 712.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10498. 712.56 s [vector] unsafeHead: OK
  10499. 712.56 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10500. 712.56 s [vector] unsafeLast: OK
  10501. 712.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10502. 712.56 s [vector] slice: OK
  10503. 712.56 s [vector] +++ OK, passed 100 tests.
  10504. 712.56 s [vector] init: OK
  10505. 712.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10506. 712.56 s [vector] tail: OK
  10507. 712.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10508. 712.56 s [vector] take: OK
  10509. 712.56 s [vector] +++ OK, passed 100 tests.
  10510. 712.56 s [vector] drop: OK
  10511. 712.57 s [vector] +++ OK, passed 100 tests.
  10512. 712.57 s [vector] splitAt: OK
  10513. 712.57 s [vector] +++ OK, passed 100 tests.
  10514. 712.57 s [vector] empty: OK
  10515. 712.57 s [vector] +++ OK, passed 100 tests.
  10516. 712.57 s [vector] singleton: OK
  10517. 712.57 s [vector] +++ OK, passed 100 tests.
  10518. 712.57 s [vector] replicate: OK
  10519. 712.57 s [vector] +++ OK, passed 100 tests.
  10520. 712.57 s [vector] generate: OK
  10521. 712.57 s [vector] +++ OK, passed 100 tests.
  10522. 712.57 s [vector] iterateN: OK
  10523. 712.58 s [vector] +++ OK, passed 100 tests.
  10524. 712.60 s [vector] iterateNM: OK (0.01s)
  10525. 712.60 s [vector] +++ OK, passed 100 tests.
  10526. 712.62 s [vector] generateM: OK (0.02s)
  10527. 712.62 s [vector] +++ OK, passed 100 tests.
  10528. 712.62 s [vector] replicateM: OK (0.01s)
  10529. 712.62 s [vector] +++ OK, passed 100 tests.
  10530. 712.62 s [vector] create: OK
  10531. 712.62 s [vector] +++ OK, passed 100 tests.
  10532. 712.62 s [vector] createT: OK
  10533. 712.62 s [vector] +++ OK, passed 100 tests.
  10534. 712.62 s [vector] unfoldr: OK
  10535. 712.62 s [vector] +++ OK, passed 100 tests.
  10536. 712.62 s [vector] unfoldrN: OK
  10537. 712.62 s [vector] +++ OK, passed 100 tests.
  10538. 712.62 s [vector] unfoldrExactN: OK
  10539. 712.62 s [vector] +++ OK, passed 100 tests.
  10540. 712.63 s [vector] unfoldrM: OK
  10541. 712.63 s [vector] +++ OK, passed 100 tests.
  10542. 712.63 s [vector] unfoldrNM: OK
  10543. 712.63 s [vector] +++ OK, passed 100 tests.
  10544. 712.64 s [vector] unfoldrExactNM: OK
  10545. 712.64 s [vector] +++ OK, passed 100 tests.
  10546. 712.66 s [vector] constructN: OK (0.01s)
  10547. 712.66 s [vector] +++ OK, passed 100 tests.
  10548. 712.66 s [vector] constructrN: OK (0.01s)
  10549. 712.66 s [vector] +++ OK, passed 100 tests.
  10550. 712.66 s [vector] cons: OK
  10551. 712.66 s [vector] +++ OK, passed 100 tests.
  10552. 712.66 s [vector] snoc: OK
  10553. 712.66 s [vector] +++ OK, passed 100 tests.
  10554. 712.66 s [vector] append: OK
  10555. 712.66 s [vector] +++ OK, passed 100 tests.
  10556. 712.69 s [vector] concat: OK (0.02s)
  10557. 712.69 s [vector] +++ OK, passed 100 tests.
  10558. 712.69 s [vector] force: OK
  10559. 712.69 s [vector] +++ OK, passed 100 tests.
  10560. 712.69 s [vector] upd: OK
  10561. 712.69 s [vector] +++ OK, passed 100 tests.
  10562. 712.70 s [vector] accum: OK (0.01s)
  10563. 712.71 s [vector] +++ OK, passed 100 tests.
  10564. 712.71 s [vector] reverse: OK
  10565. 712.71 s [vector] +++ OK, passed 100 tests.
  10566. 712.71 s [vector] backpermute: OK
  10567. 712.71 s [vector] +++ OK, passed 100 tests.
  10568. 712.71 s [vector] map: OK
  10569. 712.71 s [vector] +++ OK, passed 100 tests.
  10570. 712.72 s [vector] imap: OK
  10571. 712.72 s [vector] +++ OK, passed 100 tests.
  10572. 712.73 s [vector] concatMap: OK
  10573. 712.73 s [vector] +++ OK, passed 100 tests.
  10574. 712.73 s [vector] mapM: OK
  10575. 712.73 s [vector] +++ OK, passed 100 tests.
  10576. 712.77 s [vector] mapM_: OK (0.03s)
  10577. 712.78 s [vector] +++ OK, passed 100 tests.
  10578. 712.78 s [vector] forM: OK
  10579. 712.78 s [vector] +++ OK, passed 100 tests.
  10580. 712.82 s [vector] forM_: OK (0.04s)
  10581. 712.82 s [vector] +++ OK, passed 100 tests.
  10582. 712.82 s [vector] imapM: OK
  10583. 712.82 s [vector] +++ OK, passed 100 tests.
  10584. 712.84 s [vector] imapM_: OK (0.03s)
  10585. 712.84 s [vector] +++ OK, passed 100 tests.
  10586. 712.86 s [vector] zipWith: OK
  10587. 712.86 s [vector] +++ OK, passed 100 tests.
  10588. 712.86 s [vector] zipWith3: OK
  10589. 712.86 s [vector] +++ OK, passed 100 tests.
  10590. 712.88 s [vector] izipWith: OK
  10591. 712.88 s [vector] +++ OK, passed 100 tests.
  10592. 712.88 s [vector] izipWith3: OK (0.01s)
  10593. 712.88 s [vector] +++ OK, passed 100 tests.
  10594. 712.90 s [vector] izipWithM: OK
  10595. 712.90 s [vector] +++ OK, passed 100 tests.
  10596. 712.92 s [vector] izipWithM_: OK (0.03s)
  10597. 712.92 s [vector] +++ OK, passed 100 tests.
  10598. 712.94 s [vector] zipWithM: OK
  10599. 712.94 s [vector] +++ OK, passed 100 tests.
  10600. 712.95 s [vector] zipWithM_: OK (0.02s)
  10601. 712.96 s [vector] +++ OK, passed 100 tests.
  10602. 712.96 s [vector] filter: OK
  10603. 712.96 s [vector] +++ OK, passed 100 tests.
  10604. 712.97 s [vector] ifilter: OK
  10605. 712.97 s [vector] +++ OK, passed 100 tests.
  10606. 713.00 s [vector] filterM: OK (0.04s)
  10607. 713.00 s [vector] +++ OK, passed 100 tests.
  10608. 713.00 s [vector] uniq: OK
  10609. 713.00 s [vector] +++ OK, passed 100 tests.
  10610. 713.01 s [vector] mapMaybe: OK
  10611. 713.01 s [vector] +++ OK, passed 100 tests.
  10612. 713.02 s [vector] imapMaybe: OK
  10613. 713.02 s [vector] +++ OK, passed 100 tests.
  10614. 713.02 s [vector] takeWhile: OK
  10615. 713.02 s [vector] +++ OK, passed 100 tests.
  10616. 713.03 s [vector] dropWhile: OK
  10617. 713.03 s [vector] +++ OK, passed 100 tests.
  10618. 713.03 s [vector] partition: OK
  10619. 713.04 s [vector] +++ OK, passed 100 tests.
  10620. 713.04 s [vector] partitionWith: OK
  10621. 713.04 s [vector] +++ OK, passed 100 tests.
  10622. 713.04 s [vector] span: OK
  10623. 713.04 s [vector] +++ OK, passed 100 tests.
  10624. 713.05 s [vector] break: OK
  10625. 713.05 s [vector] +++ OK, passed 100 tests.
  10626. 713.05 s [vector] spanR: OK
  10627. 713.05 s [vector] +++ OK, passed 100 tests.
  10628. 713.05 s [vector] breakR: OK
  10629. 713.05 s [vector] +++ OK, passed 100 tests.
  10630. 713.06 s [vector] groupBy: OK
  10631. 713.06 s [vector] +++ OK, passed 100 tests.
  10632. 713.06 s [vector] elem: OK
  10633. 713.06 s [vector] +++ OK, passed 100 tests.
  10634. 713.07 s [vector] notElem: OK
  10635. 713.07 s [vector] +++ OK, passed 100 tests.
  10636. 713.08 s [vector] find: OK
  10637. 713.08 s [vector] +++ OK, passed 100 tests.
  10638. 713.09 s [vector] findIndex: OK
  10639. 713.09 s [vector] +++ OK, passed 100 tests.
  10640. 713.10 s [vector] findIndexR: OK
  10641. 713.10 s [vector] +++ OK, passed 100 tests.
  10642. 713.11 s [vector] findIndices: OK
  10643. 713.11 s [vector] +++ OK, passed 100 tests.
  10644. 713.11 s [vector] elemIndex: OK
  10645. 713.12 s [vector] +++ OK, passed 100 tests.
  10646. 713.12 s [vector] elemIndices: OK
  10647. 713.12 s [vector] +++ OK, passed 100 tests.
  10648. 713.12 s [vector] foldl: OK (0.01s)
  10649. 713.12 s [vector] +++ OK, passed 100 tests.
  10650. 713.12 s [vector] foldl1: OK
  10651. 713.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10652. 713.14 s [vector] foldl': OK (0.01s)
  10653. 713.14 s [vector] +++ OK, passed 100 tests.
  10654. 713.16 s [vector] foldl1': OK (0.01s)
  10655. 713.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10656. 713.16 s [vector] foldr: OK (0.01s)
  10657. 713.16 s [vector] +++ OK, passed 100 tests.
  10658. 713.17 s [vector] foldr1: OK (0.01s)
  10659. 713.17 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10660. 713.18 s [vector] foldr': OK (0.01s)
  10661. 713.18 s [vector] +++ OK, passed 100 tests.
  10662. 713.18 s [vector] foldr1': OK (0.01s)
  10663. 713.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10664. 713.18 s [vector] ifoldl: OK (0.01s)
  10665. 713.18 s [vector] +++ OK, passed 100 tests.
  10666. 713.18 s [vector] ifoldl': OK (0.01s)
  10667. 713.18 s [vector] +++ OK, passed 100 tests.
  10668. 713.19 s [vector] ifoldr: OK
  10669. 713.19 s [vector] +++ OK, passed 100 tests.
  10670. 713.20 s [vector] ifoldr': OK (0.02s)
  10671. 713.20 s [vector] +++ OK, passed 100 tests.
  10672. 713.22 s [vector] ifoldM: OK (0.01s)
  10673. 713.22 s [vector] +++ OK, passed 100 tests.
  10674. 713.22 s [vector] ifoldM': OK (0.01s)
  10675. 713.22 s [vector] +++ OK, passed 100 tests.
  10676. 713.26 s [vector] ifoldM_: OK (0.03s)
  10677. 713.26 s [vector] +++ OK, passed 100 tests.
  10678. 713.28 s [vector] ifoldM'_: OK (0.03s)
  10679. 713.29 s [vector] +++ OK, passed 100 tests.
  10680. 713.30 s [vector] all: OK
  10681. 713.30 s [vector] +++ OK, passed 100 tests.
  10682. 713.31 s [vector] any: OK
  10683. 713.32 s [vector] +++ OK, passed 100 tests.
  10684. 713.32 s [vector] prescanl: OK
  10685. 713.32 s [vector] +++ OK, passed 100 tests.
  10686. 713.32 s [vector] prescanl': OK (0.01s)
  10687. 713.32 s [vector] +++ OK, passed 100 tests.
  10688. 713.32 s [vector] postscanl: OK (0.01s)
  10689. 713.32 s [vector] +++ OK, passed 100 tests.
  10690. 713.34 s [vector] postscanl': OK (0.01s)
  10691. 713.34 s [vector] +++ OK, passed 100 tests.
  10692. 713.34 s [vector] scanl: OK (0.01s)
  10693. 713.35 s [vector] +++ OK, passed 100 tests.
  10694. 713.36 s [vector] scanl': OK (0.01s)
  10695. 713.36 s [vector] +++ OK, passed 100 tests.
  10696. 713.37 s [vector] scanl1: OK
  10697. 713.37 s [vector] +++ OK, passed 100 tests.
  10698. 713.38 s [vector] scanl1': OK (0.01s)
  10699. 713.38 s [vector] +++ OK, passed 100 tests.
  10700. 713.40 s [vector] iscanl: OK (0.01s)
  10701. 713.40 s [vector] +++ OK, passed 100 tests.
  10702. 713.40 s [vector] iscanl': OK (0.01s)
  10703. 713.40 s [vector] +++ OK, passed 100 tests.
  10704. 713.42 s [vector] prescanr: OK (0.01s)
  10705. 713.42 s [vector] +++ OK, passed 100 tests.
  10706. 713.43 s [vector] prescanr': OK
  10707. 713.43 s [vector] +++ OK, passed 100 tests.
  10708. 713.44 s [vector] postscanr: OK (0.01s)
  10709. 713.44 s [vector] +++ OK, passed 100 tests.
  10710. 713.44 s [vector] postscanr': OK (0.01s)
  10711. 713.44 s [vector] +++ OK, passed 100 tests.
  10712. 713.46 s [vector] scanr: OK (0.01s)
  10713. 713.46 s [vector] +++ OK, passed 100 tests.
  10714. 713.46 s [vector] scanr': OK
  10715. 713.47 s [vector] +++ OK, passed 100 tests.
  10716. 713.48 s [vector] scanr1: OK (0.01s)
  10717. 713.48 s [vector] +++ OK, passed 100 tests.
  10718. 713.49 s [vector] scanr1': OK (0.01s)
  10719. 713.49 s [vector] +++ OK, passed 100 tests.
  10720. 713.50 s [vector] iscanr: OK (0.01s)
  10721. 713.50 s [vector] +++ OK, passed 100 tests.
  10722. 713.51 s [vector] iscanr': OK (0.01s)
  10723. 713.51 s [vector] +++ OK, passed 100 tests.
  10724. 713.51 s [vector] mut_read: OK
  10725. 713.51 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10726. 713.52 s [vector] mut_write: OK
  10727. 713.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10728. 713.52 s [vector] mut_modify: OK
  10729. 713.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10730. 713.53 s [vector] mut_generate: OK
  10731. 713.54 s [vector] +++ OK, passed 100 tests.
  10732. 713.54 s [vector] mut_generateM: OK (0.02s)
  10733. 713.55 s [vector] +++ OK, passed 100 tests.
  10734. 713.56 s [vector] mut_mapM_: OK (0.03s)
  10735. 713.56 s [vector] +++ OK, passed 100 tests.
  10736. 713.60 s [vector] mut_imapM_: OK (0.03s)
  10737. 713.60 s [vector] +++ OK, passed 100 tests.
  10738. 713.62 s [vector] mut_forM_: OK (0.03s)
  10739. 713.62 s [vector] +++ OK, passed 100 tests.
  10740. 713.66 s [vector] mut_iforM_: OK (0.03s)
  10741. 713.66 s [vector] +++ OK, passed 100 tests.
  10742. 713.66 s [vector] mut_foldr: OK
  10743. 713.66 s [vector] +++ OK, passed 100 tests.
  10744. 713.68 s [vector] mut_foldr': OK
  10745. 713.68 s [vector] +++ OK, passed 100 tests.
  10746. 713.69 s [vector] mut_foldl: OK (0.01s)
  10747. 713.69 s [vector] +++ OK, passed 100 tests.
  10748. 713.70 s [vector] mut_foldl': OK (0.01s)
  10749. 713.70 s [vector] +++ OK, passed 100 tests.
  10750. 713.72 s [vector] mut_ifoldr: OK (0.01s)
  10751. 713.72 s [vector] +++ OK, passed 100 tests.
  10752. 713.73 s [vector] mut_ifoldr': OK (0.01s)
  10753. 713.74 s [vector] +++ OK, passed 100 tests.
  10754. 713.74 s [vector] mut_ifoldl: OK (0.01s)
  10755. 713.75 s [vector] +++ OK, passed 100 tests.
  10756. 713.75 s [vector] mut_ifoldl': OK (0.01s)
  10757. 713.76 s [vector] +++ OK, passed 100 tests.
  10758. 713.76 s [vector] mut_foldM: OK (0.01s)
  10759. 713.77 s [vector] +++ OK, passed 100 tests.
  10760. 713.77 s [vector] mut_foldM': OK
  10761. 713.78 s [vector] +++ OK, passed 100 tests.
  10762. 713.78 s [vector] mut_foldrM: OK (0.01s)
  10763. 713.78 s [vector] +++ OK, passed 100 tests.
  10764. 713.79 s [vector] mut_foldrM': OK
  10765. 713.79 s [vector] +++ OK, passed 100 tests.
  10766. 713.80 s [vector] mut_ifoldM: OK (0.01s)
  10767. 713.80 s [vector] +++ OK, passed 100 tests.
  10768. 713.81 s [vector] mut_ifoldM': OK (0.01s)
  10769. 713.81 s [vector] +++ OK, passed 100 tests.
  10770. 713.82 s [vector] mut_ifoldrM: OK (0.01s)
  10771. 713.82 s [vector] +++ OK, passed 100 tests.
  10772. 713.82 s [vector] mut_ifoldrM': OK (0.01s)
  10773. 713.82 s [vector] +++ OK, passed 100 tests.
  10774. 713.82 s [vector] compare: OK
  10775. 713.82 s [vector] +++ OK, passed 100 tests.
  10776. 713.82 s [vector] maximum: OK
  10777. 713.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10778. 713.83 s [vector] minimum: OK
  10779. 713.83 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10780. 713.83 s [vector] minIndex: OK
  10781. 713.83 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10782. 713.83 s [vector] maxIndex: OK
  10783. 713.83 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10784. 713.83 s [vector] maximumBy: OK
  10785. 713.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10786. 713.83 s [vector] minimumBy: OK
  10787. 713.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10788. 713.83 s [vector] maximumOn: OK
  10789. 713.83 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10790. 713.83 s [vector] minimumOn: OK
  10791. 713.83 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10792. 713.83 s [vector] maxIndexBy: OK
  10793. 713.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10794. 713.83 s [vector] minIndexBy: OK
  10795. 713.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10796. 713.83 s [vector] ListFirstMaxIndexWins: OK
  10797. 713.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10798. 713.83 s [vector] FalseListFirstMaxIndexWins: OK
  10799. 713.83 s [vector] +++ OK, failed as expected. (after 1 test):
  10800. 713.83 s [vector] Exception:
  10801. 713.83 s [vector] Prelude.foldr1: empty list
  10802. 713.84 s [vector] CallStack (from HasCallStack):
  10803. 713.84 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10804. 713.84 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10805. 713.84 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10806. 713.84 s [vector] []
  10807. 713.84 s [vector] mempty: OK
  10808. 713.84 s [vector] +++ OK, passed 100 tests.
  10809. 713.84 s [vector] mappend: OK
  10810. 713.84 s [vector] +++ OK, passed 100 tests.
  10811. 713.85 s [vector] mconcat: OK (0.02s)
  10812. 713.85 s [vector] +++ OK, passed 100 tests.
  10813. 713.86 s [vector] glength: OK
  10814. 713.86 s [vector] +++ OK, passed 100 tests.
  10815. 713.86 s [vector] sum: OK
  10816. 713.86 s [vector] +++ OK, passed 100 tests.
  10817. 713.86 s [vector] product: OK
  10818. 713.86 s [vector] +++ OK, passed 100 tests.
  10819. 713.86 s [vector] enumFromN: OK
  10820. 713.86 s [vector] +++ OK, passed 100 tests.
  10821. 713.86 s [vector] enumFromThenN: OK
  10822. 713.86 s [vector] +++ OK, passed 100 tests.
  10823. 713.86 s [vector] enumFromTo: OK
  10824. 713.86 s [vector] +++ OK, passed 100 tests.
  10825. 713.86 s [vector] enumFromThenTo: OK
  10826. 713.86 s [vector] +++ OK, passed 100 tests; 1 discarded.
  10827. 713.86 s [vector] unstream
  10828. 713.86 s [vector] unstream == vunstream (exact): OK
  10829. 713.86 s [vector] +++ OK, passed 100 tests.
  10830. 713.86 s [vector] unstream == vunstream (unknown): OK
  10831. 713.86 s [vector] +++ OK, passed 100 tests.
  10832. 713.86 s [vector] unstreamR ~= vunstream (exact): OK
  10833. 713.86 s [vector] +++ OK, passed 100 tests.
  10834. 713.86 s [vector] unstreamR ~= vunstream (unknown): OK
  10835. 713.86 s [vector] +++ OK, passed 100 tests.
  10836. 713.86 s [vector] Tests.Vector.Strict
  10837. 713.86 s [vector] Bool
  10838. 713.86 s [vector] fromList.toList == id: OK
  10839. 713.86 s [vector] +++ OK, passed 100 tests.
  10840. 713.86 s [vector] toList.fromList == id: OK
  10841. 713.86 s [vector] +++ OK, passed 100 tests.
  10842. 713.86 s [vector] unstream.stream == id: OK
  10843. 713.86 s [vector] +++ OK, passed 100 tests.
  10844. 713.87 s [vector] stream.unstream == id: OK
  10845. 713.87 s [vector] +++ OK, passed 100 tests.
  10846. 713.87 s [vector] eq: OK
  10847. 713.87 s [vector] +++ OK, passed 100 tests.
  10848. 713.87 s [vector] length: OK
  10849. 713.87 s [vector] +++ OK, passed 100 tests.
  10850. 713.87 s [vector] null: OK
  10851. 713.88 s [vector] +++ OK, passed 100 tests.
  10852. 713.88 s [vector] index: OK
  10853. 713.88 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10854. 713.88 s [vector] safeIndex: OK
  10855. 713.88 s [vector] +++ OK, passed 100 tests.
  10856. 713.88 s [vector] head: OK
  10857. 713.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10858. 713.88 s [vector] last: OK
  10859. 713.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10860. 713.88 s [vector] unsafeIndex: OK
  10861. 713.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10862. 713.88 s [vector] unsafeHead: OK
  10863. 713.88 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10864. 713.88 s [vector] unsafeLast: OK
  10865. 713.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10866. 713.88 s [vector] slice: OK
  10867. 713.88 s [vector] +++ OK, passed 100 tests.
  10868. 713.88 s [vector] init: OK
  10869. 713.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10870. 713.88 s [vector] tail: OK
  10871. 713.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10872. 713.88 s [vector] take: OK
  10873. 713.88 s [vector] +++ OK, passed 100 tests.
  10874. 713.88 s [vector] drop: OK
  10875. 713.90 s [vector] +++ OK, passed 100 tests.
  10876. 713.90 s [vector] splitAt: OK
  10877. 713.90 s [vector] +++ OK, passed 100 tests.
  10878. 713.90 s [vector] empty: OK
  10879. 713.90 s [vector] +++ OK, passed 100 tests.
  10880. 713.90 s [vector] singleton: OK
  10881. 713.90 s [vector] +++ OK, passed 100 tests.
  10882. 713.90 s [vector] replicate: OK
  10883. 713.90 s [vector] +++ OK, passed 100 tests.
  10884. 713.90 s [vector] generate: OK
  10885. 713.90 s [vector] +++ OK, passed 100 tests.
  10886. 713.90 s [vector] iterateN: OK
  10887. 713.90 s [vector] +++ OK, passed 100 tests.
  10888. 713.90 s [vector] iterateNM: OK (0.01s)
  10889. 713.90 s [vector] +++ OK, passed 100 tests.
  10890. 713.91 s [vector] generateM: OK (0.02s)
  10891. 713.91 s [vector] +++ OK, passed 100 tests.
  10892. 713.91 s [vector] replicateM: OK (0.01s)
  10893. 713.91 s [vector] +++ OK, passed 100 tests.
  10894. 713.91 s [vector] create: OK
  10895. 713.91 s [vector] +++ OK, passed 100 tests.
  10896. 713.91 s [vector] createT: OK
  10897. 713.92 s [vector] +++ OK, passed 100 tests.
  10898. 713.92 s [vector] unfoldr: OK
  10899. 713.92 s [vector] +++ OK, passed 100 tests.
  10900. 713.92 s [vector] unfoldrN: OK
  10901. 713.92 s [vector] +++ OK, passed 100 tests.
  10902. 713.92 s [vector] unfoldrExactN: OK
  10903. 713.92 s [vector] +++ OK, passed 100 tests.
  10904. 713.92 s [vector] unfoldrM: OK
  10905. 713.92 s [vector] +++ OK, passed 100 tests.
  10906. 713.92 s [vector] unfoldrNM: OK
  10907. 713.92 s [vector] +++ OK, passed 100 tests.
  10908. 713.94 s [vector] unfoldrExactNM: OK (0.02s)
  10909. 713.94 s [vector] +++ OK, passed 100 tests.
  10910. 713.95 s [vector] constructN: OK
  10911. 713.95 s [vector] +++ OK, passed 100 tests.
  10912. 713.95 s [vector] constructrN: OK
  10913. 713.95 s [vector] +++ OK, passed 100 tests.
  10914. 713.95 s [vector] cons: OK
  10915. 713.95 s [vector] +++ OK, passed 100 tests.
  10916. 713.95 s [vector] snoc: OK
  10917. 713.95 s [vector] +++ OK, passed 100 tests.
  10918. 713.96 s [vector] append: OK
  10919. 713.96 s [vector] +++ OK, passed 100 tests.
  10920. 713.96 s [vector] concat: OK
  10921. 713.96 s [vector] +++ OK, passed 100 tests.
  10922. 713.96 s [vector] force: OK
  10923. 713.96 s [vector] +++ OK, passed 100 tests.
  10924. 713.96 s [vector] upd: OK
  10925. 713.96 s [vector] +++ OK, passed 100 tests.
  10926. 713.96 s [vector] accum: OK
  10927. 713.96 s [vector] +++ OK, passed 100 tests.
  10928. 713.96 s [vector] reverse: OK
  10929. 713.96 s [vector] +++ OK, passed 100 tests.
  10930. 713.96 s [vector] backpermute: OK
  10931. 713.96 s [vector] +++ OK, passed 100 tests.
  10932. 713.96 s [vector] map: OK
  10933. 713.96 s [vector] +++ OK, passed 100 tests.
  10934. 713.97 s [vector] imap: OK
  10935. 713.97 s [vector] +++ OK, passed 100 tests.
  10936. 713.97 s [vector] concatMap: OK
  10937. 713.97 s [vector] +++ OK, passed 100 tests.
  10938. 713.97 s [vector] mapM: OK
  10939. 713.97 s [vector] +++ OK, passed 100 tests.
  10940. 713.97 s [vector] mapM_: OK
  10941. 713.97 s [vector] +++ OK, passed 100 tests.
  10942. 713.98 s [vector] forM: OK
  10943. 713.98 s [vector] +++ OK, passed 100 tests.
  10944. 713.98 s [vector] forM_: OK
  10945. 713.98 s [vector] +++ OK, passed 100 tests.
  10946. 713.99 s [vector] imapM: OK
  10947. 713.99 s [vector] +++ OK, passed 100 tests.
  10948. 714.00 s [vector] imapM_: OK
  10949. 714.00 s [vector] +++ OK, passed 100 tests.
  10950. 714.00 s [vector] zipWith: OK
  10951. 714.00 s [vector] +++ OK, passed 100 tests.
  10952. 714.00 s [vector] zipWith3: OK
  10953. 714.00 s [vector] +++ OK, passed 100 tests.
  10954. 714.00 s [vector] izipWith: OK
  10955. 714.00 s [vector] +++ OK, passed 100 tests.
  10956. 714.00 s [vector] izipWith3: OK
  10957. 714.00 s [vector] +++ OK, passed 100 tests.
  10958. 714.00 s [vector] izipWithM: OK
  10959. 714.00 s [vector] +++ OK, passed 100 tests.
  10960. 714.01 s [vector] izipWithM_: OK
  10961. 714.01 s [vector] +++ OK, passed 100 tests.
  10962. 714.01 s [vector] zipWithM: OK
  10963. 714.01 s [vector] +++ OK, passed 100 tests.
  10964. 714.02 s [vector] zipWithM_: OK
  10965. 714.02 s [vector] +++ OK, passed 100 tests.
  10966. 714.02 s [vector] filter: OK
  10967. 714.02 s [vector] +++ OK, passed 100 tests.
  10968. 714.02 s [vector] ifilter: OK
  10969. 714.02 s [vector] +++ OK, passed 100 tests.
  10970. 714.04 s [vector] filterM: OK (0.02s)
  10971. 714.04 s [vector] +++ OK, passed 100 tests.
  10972. 714.04 s [vector] uniq: OK
  10973. 714.04 s [vector] +++ OK, passed 100 tests.
  10974. 714.04 s [vector] mapMaybe: OK
  10975. 714.04 s [vector] +++ OK, passed 100 tests.
  10976. 714.04 s [vector] imapMaybe: OK
  10977. 714.04 s [vector] +++ OK, passed 100 tests.
  10978. 714.04 s [vector] takeWhile: OK
  10979. 714.04 s [vector] +++ OK, passed 100 tests.
  10980. 714.04 s [vector] dropWhile: OK
  10981. 714.04 s [vector] +++ OK, passed 100 tests.
  10982. 714.04 s [vector] partition: OK
  10983. 714.04 s [vector] +++ OK, passed 100 tests.
  10984. 714.04 s [vector] partitionWith: OK
  10985. 714.04 s [vector] +++ OK, passed 100 tests.
  10986. 714.05 s [vector] span: OK
  10987. 714.05 s [vector] +++ OK, passed 100 tests.
  10988. 714.05 s [vector] break: OK
  10989. 714.05 s [vector] +++ OK, passed 100 tests.
  10990. 714.05 s [vector] spanR: OK
  10991. 714.05 s [vector] +++ OK, passed 100 tests.
  10992. 714.05 s [vector] breakR: OK
  10993. 714.05 s [vector] +++ OK, passed 100 tests.
  10994. 714.05 s [vector] groupBy: OK
  10995. 714.05 s [vector] +++ OK, passed 100 tests.
  10996. 714.05 s [vector] elem: OK
  10997. 714.05 s [vector] +++ OK, passed 100 tests.
  10998. 714.05 s [vector] notElem: OK
  10999. 714.05 s [vector] +++ OK, passed 100 tests.
  11000. 714.05 s [vector] find: OK
  11001. 714.05 s [vector] +++ OK, passed 100 tests.
  11002. 714.05 s [vector] findIndex: OK
  11003. 714.05 s [vector] +++ OK, passed 100 tests.
  11004. 714.05 s [vector] findIndexR: OK
  11005. 714.05 s [vector] +++ OK, passed 100 tests.
  11006. 714.05 s [vector] findIndices: OK
  11007. 714.06 s [vector] +++ OK, passed 100 tests.
  11008. 714.06 s [vector] elemIndex: OK
  11009. 714.06 s [vector] +++ OK, passed 100 tests.
  11010. 714.06 s [vector] elemIndices: OK
  11011. 714.06 s [vector] +++ OK, passed 100 tests.
  11012. 714.06 s [vector] foldl: OK
  11013. 714.06 s [vector] +++ OK, passed 100 tests.
  11014. 714.07 s [vector] foldl1: OK
  11015. 714.07 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11016. 714.07 s [vector] foldl': OK
  11017. 714.08 s [vector] +++ OK, passed 100 tests.
  11018. 714.08 s [vector] foldl1': OK
  11019. 714.08 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11020. 714.08 s [vector] foldr: OK
  11021. 714.09 s [vector] +++ OK, passed 100 tests.
  11022. 714.09 s [vector] foldr1: OK
  11023. 714.09 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11024. 714.09 s [vector] foldr': OK
  11025. 714.09 s [vector] +++ OK, passed 100 tests.
  11026. 714.09 s [vector] foldr1': OK
  11027. 714.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11028. 714.09 s [vector] ifoldl: OK
  11029. 714.09 s [vector] +++ OK, passed 100 tests.
  11030. 714.09 s [vector] ifoldl': OK
  11031. 714.09 s [vector] +++ OK, passed 100 tests.
  11032. 714.09 s [vector] ifoldr: OK
  11033. 714.09 s [vector] +++ OK, passed 100 tests.
  11034. 714.09 s [vector] ifoldr': OK
  11035. 714.09 s [vector] +++ OK, passed 100 tests.
  11036. 714.09 s [vector] ifoldM: OK
  11037. 714.09 s [vector] +++ OK, passed 100 tests.
  11038. 714.09 s [vector] ifoldM': OK
  11039. 714.09 s [vector] +++ OK, passed 100 tests.
  11040. 714.09 s [vector] ifoldM_: OK
  11041. 714.09 s [vector] +++ OK, passed 100 tests.
  11042. 714.09 s [vector] ifoldM'_: OK
  11043. 714.09 s [vector] +++ OK, passed 100 tests.
  11044. 714.09 s [vector] all: OK
  11045. 714.09 s [vector] +++ OK, passed 100 tests.
  11046. 714.09 s [vector] any: OK
  11047. 714.09 s [vector] +++ OK, passed 100 tests.
  11048. 714.09 s [vector] prescanl: OK
  11049. 714.09 s [vector] +++ OK, passed 100 tests.
  11050. 714.09 s [vector] prescanl': OK
  11051. 714.09 s [vector] +++ OK, passed 100 tests.
  11052. 714.09 s [vector] postscanl: OK
  11053. 714.09 s [vector] +++ OK, passed 100 tests.
  11054. 714.09 s [vector] postscanl': OK
  11055. 714.09 s [vector] +++ OK, passed 100 tests.
  11056. 714.09 s [vector] scanl: OK
  11057. 714.09 s [vector] +++ OK, passed 100 tests.
  11058. 714.09 s [vector] scanl': OK
  11059. 714.09 s [vector] +++ OK, passed 100 tests.
  11060. 714.09 s [vector] scanl1: OK
  11061. 714.09 s [vector] +++ OK, passed 100 tests.
  11062. 714.10 s [vector] scanl1': OK
  11063. 714.10 s [vector] +++ OK, passed 100 tests.
  11064. 714.10 s [vector] iscanl: OK
  11065. 714.10 s [vector] +++ OK, passed 100 tests.
  11066. 714.10 s [vector] iscanl': OK
  11067. 714.10 s [vector] +++ OK, passed 100 tests.
  11068. 714.10 s [vector] prescanr: OK
  11069. 714.10 s [vector] +++ OK, passed 100 tests.
  11070. 714.10 s [vector] prescanr': OK
  11071. 714.10 s [vector] +++ OK, passed 100 tests.
  11072. 714.11 s [vector] postscanr: OK
  11073. 714.11 s [vector] +++ OK, passed 100 tests.
  11074. 714.11 s [vector] postscanr': OK
  11075. 714.11 s [vector] +++ OK, passed 100 tests.
  11076. 714.11 s [vector] scanr: OK
  11077. 714.11 s [vector] +++ OK, passed 100 tests.
  11078. 714.11 s [vector] scanr': OK
  11079. 714.11 s [vector] +++ OK, passed 100 tests.
  11080. 714.11 s [vector] scanr1: OK
  11081. 714.11 s [vector] +++ OK, passed 100 tests.
  11082. 714.11 s [vector] scanr1': OK
  11083. 714.11 s [vector] +++ OK, passed 100 tests.
  11084. 714.11 s [vector] iscanr: OK
  11085. 714.11 s [vector] +++ OK, passed 100 tests.
  11086. 714.11 s [vector] iscanr': OK
  11087. 714.11 s [vector] +++ OK, passed 100 tests.
  11088. 714.11 s [vector] mut_read: OK
  11089. 714.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11090. 714.12 s [vector] mut_write: OK
  11091. 714.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11092. 714.12 s [vector] mut_modify: OK
  11093. 714.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11094. 714.12 s [vector] mut_generate: OK
  11095. 714.12 s [vector] +++ OK, passed 100 tests.
  11096. 714.12 s [vector] mut_generateM: OK
  11097. 714.12 s [vector] +++ OK, passed 100 tests.
  11098. 714.13 s [vector] mut_mapM_: OK
  11099. 714.14 s [vector] +++ OK, passed 100 tests.
  11100. 714.14 s [vector] mut_imapM_: OK
  11101. 714.15 s [vector] +++ OK, passed 100 tests.
  11102. 714.15 s [vector] mut_forM_: OK
  11103. 714.15 s [vector] +++ OK, passed 100 tests.
  11104. 714.15 s [vector] mut_iforM_: OK
  11105. 714.15 s [vector] +++ OK, passed 100 tests.
  11106. 714.15 s [vector] mut_foldr: OK
  11107. 714.15 s [vector] +++ OK, passed 100 tests.
  11108. 714.15 s [vector] mut_foldr': OK
  11109. 714.15 s [vector] +++ OK, passed 100 tests.
  11110. 714.16 s [vector] mut_foldl: OK
  11111. 714.16 s [vector] +++ OK, passed 100 tests.
  11112. 714.16 s [vector] mut_foldl': OK
  11113. 714.16 s [vector] +++ OK, passed 100 tests.
  11114. 714.16 s [vector] mut_ifoldr: OK
  11115. 714.16 s [vector] +++ OK, passed 100 tests.
  11116. 714.16 s [vector] mut_ifoldr': OK
  11117. 714.16 s [vector] +++ OK, passed 100 tests.
  11118. 714.16 s [vector] mut_ifoldl: OK
  11119. 714.16 s [vector] +++ OK, passed 100 tests.
  11120. 714.16 s [vector] mut_ifoldl': OK
  11121. 714.16 s [vector] +++ OK, passed 100 tests.
  11122. 714.17 s [vector] mut_foldM: OK
  11123. 714.17 s [vector] +++ OK, passed 100 tests.
  11124. 714.17 s [vector] mut_foldM': OK
  11125. 714.17 s [vector] +++ OK, passed 100 tests.
  11126. 714.17 s [vector] mut_foldrM: OK
  11127. 714.17 s [vector] +++ OK, passed 100 tests.
  11128. 714.17 s [vector] mut_foldrM': OK
  11129. 714.17 s [vector] +++ OK, passed 100 tests.
  11130. 714.17 s [vector] mut_ifoldM: OK
  11131. 714.17 s [vector] +++ OK, passed 100 tests.
  11132. 714.17 s [vector] mut_ifoldM': OK
  11133. 714.17 s [vector] +++ OK, passed 100 tests.
  11134. 714.17 s [vector] mut_ifoldrM: OK
  11135. 714.17 s [vector] +++ OK, passed 100 tests.
  11136. 714.18 s [vector] mut_ifoldrM': OK
  11137. 714.18 s [vector] +++ OK, passed 100 tests.
  11138. 714.18 s [vector] compare: OK
  11139. 714.18 s [vector] +++ OK, passed 100 tests.
  11140. 714.18 s [vector] maximum: OK
  11141. 714.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11142. 714.18 s [vector] minimum: OK
  11143. 714.18 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11144. 714.18 s [vector] minIndex: OK
  11145. 714.18 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11146. 714.18 s [vector] maxIndex: OK
  11147. 714.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11148. 714.18 s [vector] maximumBy: OK
  11149. 714.18 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11150. 714.18 s [vector] minimumBy: OK
  11151. 714.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11152. 714.19 s [vector] maximumOn: OK
  11153. 714.19 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11154. 714.19 s [vector] minimumOn: OK
  11155. 714.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11156. 714.20 s [vector] maxIndexBy: OK
  11157. 714.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11158. 714.20 s [vector] minIndexBy: OK
  11159. 714.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11160. 714.20 s [vector] ListFirstMaxIndexWins: OK
  11161. 714.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11162. 714.20 s [vector] FalseListFirstMaxIndexWins: OK
  11163. 714.21 s [vector] +++ OK, failed as expected. (after 1 test):
  11164. 714.21 s [vector] Exception:
  11165. 714.21 s [vector] Prelude.foldr1: empty list
  11166. 714.21 s [vector] CallStack (from HasCallStack):
  11167. 714.21 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11168. 714.21 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11169. 714.21 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11170. 714.21 s [vector] []
  11171. 714.21 s [vector] zip: OK
  11172. 714.21 s [vector] +++ OK, passed 100 tests.
  11173. 714.21 s [vector] zip3: OK
  11174. 714.21 s [vector] +++ OK, passed 100 tests.
  11175. 714.22 s [vector] unzip: OK
  11176. 714.22 s [vector] +++ OK, passed 100 tests.
  11177. 714.22 s [vector] unzip3: OK
  11178. 714.22 s [vector] +++ OK, passed 100 tests.
  11179. 714.23 s [vector] indexed: OK
  11180. 714.23 s [vector] +++ OK, passed 100 tests.
  11181. 714.23 s [vector] update: OK
  11182. 714.23 s [vector] +++ OK, passed 100 tests.
  11183. 714.23 s [vector] concat: OK
  11184. 714.23 s [vector] +++ OK, passed 100 tests.
  11185. 714.23 s [vector] mempty: OK
  11186. 714.23 s [vector] +++ OK, passed 100 tests.
  11187. 714.23 s [vector] mappend: OK
  11188. 714.23 s [vector] +++ OK, passed 100 tests.
  11189. 714.23 s [vector] mconcat: OK
  11190. 714.23 s [vector] +++ OK, passed 100 tests.
  11191. 714.23 s [vector] fmap: OK
  11192. 714.23 s [vector] +++ OK, passed 100 tests.
  11193. 714.23 s [vector] return: OK
  11194. 714.23 s [vector] +++ OK, passed 100 tests.
  11195. 714.23 s [vector] bind: OK
  11196. 714.23 s [vector] +++ OK, passed 100 tests.
  11197. 714.24 s [vector] mzip: OK
  11198. 714.24 s [vector] +++ OK, passed 100 tests.
  11199. 714.24 s [vector] munzip: OK
  11200. 714.24 s [vector] +++ OK, passed 100 tests.
  11201. 714.24 s [vector] applicative_pure: OK
  11202. 714.24 s [vector] +++ OK, passed 100 tests.
  11203. 714.24 s [vector] applicative_appl: OK (0.01s)
  11204. 714.24 s [vector] +++ OK, passed 100 tests.
  11205. 714.24 s [vector] alternative_empty: OK
  11206. 714.24 s [vector] +++ OK, passed 100 tests.
  11207. 714.24 s [vector] alternative_or: OK
  11208. 714.24 s [vector] +++ OK, passed 100 tests.
  11209. 714.25 s [vector] sequence: OK (0.03s)
  11210. 714.25 s [vector] +++ OK, passed 100 tests.
  11211. 714.25 s [vector] sequence_: OK
  11212. 714.25 s [vector] +++ OK, passed 100 tests.
  11213. 714.25 s [vector] glength: OK
  11214. 714.25 s [vector] +++ OK, passed 100 tests.
  11215. 714.25 s [vector] and: OK
  11216. 714.25 s [vector] +++ OK, passed 100 tests.
  11217. 714.25 s [vector] or: OK
  11218. 714.25 s [vector] +++ OK, passed 100 tests.
  11219. 714.26 s [vector] Int
  11220. 714.26 s [vector] fromList.toList == id: OK
  11221. 714.26 s [vector] +++ OK, passed 100 tests.
  11222. 714.26 s [vector] toList.fromList == id: OK
  11223. 714.26 s [vector] +++ OK, passed 100 tests.
  11224. 714.26 s [vector] unstream.stream == id: OK
  11225. 714.26 s [vector] +++ OK, passed 100 tests.
  11226. 714.26 s [vector] stream.unstream == id: OK
  11227. 714.26 s [vector] +++ OK, passed 100 tests.
  11228. 714.26 s [vector] eq: OK
  11229. 714.26 s [vector] +++ OK, passed 100 tests.
  11230. 714.26 s [vector] length: OK
  11231. 714.26 s [vector] +++ OK, passed 100 tests.
  11232. 714.26 s [vector] null: OK
  11233. 714.26 s [vector] +++ OK, passed 100 tests.
  11234. 714.26 s [vector] index: OK
  11235. 714.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11236. 714.26 s [vector] safeIndex: OK
  11237. 714.26 s [vector] +++ OK, passed 100 tests.
  11238. 714.26 s [vector] head: OK
  11239. 714.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11240. 714.26 s [vector] last: OK
  11241. 714.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11242. 714.26 s [vector] unsafeIndex: OK
  11243. 714.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11244. 714.26 s [vector] unsafeHead: OK
  11245. 714.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11246. 714.28 s [vector] unsafeLast: OK
  11247. 714.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11248. 714.30 s [vector] slice: OK
  11249. 714.30 s [vector] +++ OK, passed 100 tests.
  11250. 714.30 s [vector] init: OK
  11251. 714.30 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11252. 714.30 s [vector] tail: OK
  11253. 714.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11254. 714.30 s [vector] take: OK
  11255. 714.30 s [vector] +++ OK, passed 100 tests.
  11256. 714.30 s [vector] drop: OK
  11257. 714.30 s [vector] +++ OK, passed 100 tests.
  11258. 714.30 s [vector] splitAt: OK
  11259. 714.30 s [vector] +++ OK, passed 100 tests.
  11260. 714.30 s [vector] empty: OK
  11261. 714.30 s [vector] +++ OK, passed 100 tests.
  11262. 714.30 s [vector] singleton: OK
  11263. 714.30 s [vector] +++ OK, passed 100 tests.
  11264. 714.30 s [vector] replicate: OK
  11265. 714.30 s [vector] +++ OK, passed 100 tests.
  11266. 714.30 s [vector] generate: OK
  11267. 714.30 s [vector] +++ OK, passed 100 tests.
  11268. 714.30 s [vector] iterateN: OK
  11269. 714.31 s [vector] +++ OK, passed 100 tests.
  11270. 714.31 s [vector] iterateNM: OK (0.02s)
  11271. 714.31 s [vector] +++ OK, passed 100 tests.
  11272. 714.31 s [vector] generateM: OK (0.02s)
  11273. 714.31 s [vector] +++ OK, passed 100 tests.
  11274. 714.31 s [vector] replicateM: OK
  11275. 714.31 s [vector] +++ OK, passed 100 tests.
  11276. 714.31 s [vector] create: OK
  11277. 714.31 s [vector] +++ OK, passed 100 tests.
  11278. 714.31 s [vector] createT: OK
  11279. 714.31 s [vector] +++ OK, passed 100 tests.
  11280. 714.32 s [vector] unfoldr: OK
  11281. 714.32 s [vector] +++ OK, passed 100 tests.
  11282. 714.32 s [vector] unfoldrN: OK
  11283. 714.32 s [vector] +++ OK, passed 100 tests.
  11284. 714.32 s [vector] unfoldrExactN: OK
  11285. 714.33 s [vector] +++ OK, passed 100 tests.
  11286. 714.33 s [vector] unfoldrM: OK
  11287. 714.33 s [vector] +++ OK, passed 100 tests.
  11288. 714.33 s [vector] unfoldrNM: OK
  11289. 714.33 s [vector] +++ OK, passed 100 tests.
  11290. 714.33 s [vector] unfoldrExactNM: OK
  11291. 714.33 s [vector] +++ OK, passed 100 tests.
  11292. 714.33 s [vector] constructN: OK
  11293. 714.33 s [vector] +++ OK, passed 100 tests.
  11294. 714.33 s [vector] constructrN: OK
  11295. 714.33 s [vector] +++ OK, passed 100 tests.
  11296. 714.33 s [vector] cons: OK
  11297. 714.33 s [vector] +++ OK, passed 100 tests.
  11298. 714.33 s [vector] snoc: OK
  11299. 714.33 s [vector] +++ OK, passed 100 tests.
  11300. 714.33 s [vector] append: OK
  11301. 714.33 s [vector] +++ OK, passed 100 tests.
  11302. 714.34 s [vector] concat: OK
  11303. 714.34 s [vector] +++ OK, passed 100 tests.
  11304. 714.35 s [vector] force: OK
  11305. 714.35 s [vector] +++ OK, passed 100 tests.
  11306. 714.35 s [vector] upd: OK
  11307. 714.35 s [vector] +++ OK, passed 100 tests.
  11308. 714.35 s [vector] accum: OK
  11309. 714.35 s [vector] +++ OK, passed 100 tests.
  11310. 714.35 s [vector] reverse: OK
  11311. 714.35 s [vector] +++ OK, passed 100 tests.
  11312. 714.35 s [vector] backpermute: OK
  11313. 714.35 s [vector] +++ OK, passed 100 tests.
  11314. 714.35 s [vector] map: OK
  11315. 714.36 s [vector] +++ OK, passed 100 tests.
  11316. 714.36 s [vector] imap: OK
  11317. 714.36 s [vector] +++ OK, passed 100 tests.
  11318. 714.36 s [vector] concatMap: OK
  11319. 714.37 s [vector] +++ OK, passed 100 tests.
  11320. 714.37 s [vector] mapM: OK
  11321. 714.37 s [vector] +++ OK, passed 100 tests.
  11322. 714.37 s [vector] mapM_: OK (0.01s)
  11323. 714.38 s [vector] +++ OK, passed 100 tests.
  11324. 714.38 s [vector] forM: OK
  11325. 714.38 s [vector] +++ OK, passed 100 tests.
  11326. 714.40 s [vector] forM_: OK (0.01s)
  11327. 714.40 s [vector] +++ OK, passed 100 tests.
  11328. 714.40 s [vector] imapM: OK
  11329. 714.40 s [vector] +++ OK, passed 100 tests.
  11330. 714.40 s [vector] imapM_: OK (0.01s)
  11331. 714.40 s [vector] +++ OK, passed 100 tests.
  11332. 714.40 s [vector] zipWith: OK
  11333. 714.41 s [vector] +++ OK, passed 100 tests.
  11334. 714.41 s [vector] zipWith3: OK
  11335. 714.41 s [vector] +++ OK, passed 100 tests.
  11336. 714.41 s [vector] izipWith: OK
  11337. 714.41 s [vector] +++ OK, passed 100 tests.
  11338. 714.41 s [vector] izipWith3: OK
  11339. 714.41 s [vector] +++ OK, passed 100 tests.
  11340. 714.42 s [vector] izipWithM: OK
  11341. 714.42 s [vector] +++ OK, passed 100 tests.
  11342. 714.42 s [vector] izipWithM_: OK (0.01s)
  11343. 714.42 s [vector] +++ OK, passed 100 tests.
  11344. 714.44 s [vector] zipWithM: OK
  11345. 714.44 s [vector] +++ OK, passed 100 tests.
  11346. 714.44 s [vector] zipWithM_: OK (0.01s)
  11347. 714.44 s [vector] +++ OK, passed 100 tests.
  11348. 714.44 s [vector] filter: OK
  11349. 714.44 s [vector] +++ OK, passed 100 tests.
  11350. 714.44 s [vector] ifilter: OK
  11351. 714.44 s [vector] +++ OK, passed 100 tests.
  11352. 714.46 s [vector] filterM: OK (0.03s)
  11353. 714.46 s [vector] +++ OK, passed 100 tests.
  11354. 714.46 s [vector] uniq: OK
  11355. 714.46 s [vector] +++ OK, passed 100 tests.
  11356. 714.47 s [vector] mapMaybe: OK
  11357. 714.47 s [vector] +++ OK, passed 100 tests.
  11358. 714.47 s [vector] imapMaybe: OK
  11359. 714.47 s [vector] +++ OK, passed 100 tests.
  11360. 714.47 s [vector] takeWhile: OK
  11361. 714.47 s [vector] +++ OK, passed 100 tests.
  11362. 714.48 s [vector] dropWhile: OK
  11363. 714.48 s [vector] +++ OK, passed 100 tests.
  11364. 714.48 s [vector] partition: OK
  11365. 714.48 s [vector] +++ OK, passed 100 tests.
  11366. 714.48 s [vector] partitionWith: OK
  11367. 714.48 s [vector] +++ OK, passed 100 tests.
  11368. 714.48 s [vector] span: OK
  11369. 714.48 s [vector] +++ OK, passed 100 tests.
  11370. 714.48 s [vector] break: OK
  11371. 714.48 s [vector] +++ OK, passed 100 tests.
  11372. 714.48 s [vector] spanR: OK
  11373. 714.48 s [vector] +++ OK, passed 100 tests.
  11374. 714.48 s [vector] breakR: OK
  11375. 714.48 s [vector] +++ OK, passed 100 tests.
  11376. 714.49 s [vector] groupBy: OK
  11377. 714.49 s [vector] +++ OK, passed 100 tests.
  11378. 714.49 s [vector] elem: OK
  11379. 714.49 s [vector] +++ OK, passed 100 tests.
  11380. 714.50 s [vector] notElem: OK
  11381. 714.50 s [vector] +++ OK, passed 100 tests.
  11382. 714.50 s [vector] find: OK
  11383. 714.50 s [vector] +++ OK, passed 100 tests.
  11384. 714.50 s [vector] findIndex: OK
  11385. 714.51 s [vector] +++ OK, passed 100 tests.
  11386. 714.51 s [vector] findIndexR: OK
  11387. 714.51 s [vector] +++ OK, passed 100 tests.
  11388. 714.51 s [vector] findIndices: OK
  11389. 714.51 s [vector] +++ OK, passed 100 tests.
  11390. 714.51 s [vector] elemIndex: OK
  11391. 714.51 s [vector] +++ OK, passed 100 tests.
  11392. 714.51 s [vector] elemIndices: OK
  11393. 714.51 s [vector] +++ OK, passed 100 tests.
  11394. 714.51 s [vector] foldl: OK
  11395. 714.51 s [vector] +++ OK, passed 100 tests.
  11396. 714.52 s [vector] foldl1: OK
  11397. 714.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11398. 714.52 s [vector] foldl': OK
  11399. 714.52 s [vector] +++ OK, passed 100 tests.
  11400. 714.52 s [vector] foldl1': OK
  11401. 714.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11402. 714.52 s [vector] foldr: OK
  11403. 714.52 s [vector] +++ OK, passed 100 tests.
  11404. 714.52 s [vector] foldr1: OK
  11405. 714.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11406. 714.52 s [vector] foldr': OK
  11407. 714.52 s [vector] +++ OK, passed 100 tests.
  11408. 714.53 s [vector] foldr1': OK
  11409. 714.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11410. 714.53 s [vector] ifoldl: OK
  11411. 714.53 s [vector] +++ OK, passed 100 tests.
  11412. 714.53 s [vector] ifoldl': OK
  11413. 714.53 s [vector] +++ OK, passed 100 tests.
  11414. 714.53 s [vector] ifoldr: OK
  11415. 714.53 s [vector] +++ OK, passed 100 tests.
  11416. 714.53 s [vector] ifoldr': OK
  11417. 714.53 s [vector] +++ OK, passed 100 tests.
  11418. 714.53 s [vector] ifoldM: OK
  11419. 714.53 s [vector] +++ OK, passed 100 tests.
  11420. 714.54 s [vector] ifoldM': OK
  11421. 714.54 s [vector] +++ OK, passed 100 tests.
  11422. 714.54 s [vector] ifoldM_: OK (0.02s)
  11423. 714.54 s [vector] +++ OK, passed 100 tests.
  11424. 714.54 s [vector] ifoldM'_: OK (0.01s)
  11425. 714.55 s [vector] +++ OK, passed 100 tests.
  11426. 714.55 s [vector] all: OK
  11427. 714.55 s [vector] +++ OK, passed 100 tests.
  11428. 714.55 s [vector] any: OK
  11429. 714.55 s [vector] +++ OK, passed 100 tests.
  11430. 714.55 s [vector] prescanl: OK
  11431. 714.55 s [vector] +++ OK, passed 100 tests.
  11432. 714.56 s [vector] prescanl': OK
  11433. 714.56 s [vector] +++ OK, passed 100 tests.
  11434. 714.56 s [vector] postscanl: OK
  11435. 714.56 s [vector] +++ OK, passed 100 tests.
  11436. 714.56 s [vector] postscanl': OK
  11437. 714.56 s [vector] +++ OK, passed 100 tests.
  11438. 714.56 s [vector] scanl: OK
  11439. 714.56 s [vector] +++ OK, passed 100 tests.
  11440. 714.56 s [vector] scanl': OK
  11441. 714.56 s [vector] +++ OK, passed 100 tests.
  11442. 714.56 s [vector] scanl1: OK
  11443. 714.56 s [vector] +++ OK, passed 100 tests.
  11444. 714.56 s [vector] scanl1': OK
  11445. 714.56 s [vector] +++ OK, passed 100 tests.
  11446. 714.56 s [vector] iscanl: OK
  11447. 714.56 s [vector] +++ OK, passed 100 tests.
  11448. 714.56 s [vector] iscanl': OK
  11449. 714.56 s [vector] +++ OK, passed 100 tests.
  11450. 714.57 s [vector] prescanr: OK
  11451. 714.57 s [vector] +++ OK, passed 100 tests.
  11452. 714.57 s [vector] prescanr': OK
  11453. 714.57 s [vector] +++ OK, passed 100 tests.
  11454. 714.57 s [vector] postscanr: OK
  11455. 714.57 s [vector] +++ OK, passed 100 tests.
  11456. 714.58 s [vector] postscanr': OK
  11457. 714.58 s [vector] +++ OK, passed 100 tests.
  11458. 714.58 s [vector] scanr: OK
  11459. 714.58 s [vector] +++ OK, passed 100 tests.
  11460. 714.58 s [vector] scanr': OK
  11461. 714.58 s [vector] +++ OK, passed 100 tests.
  11462. 714.58 s [vector] scanr1: OK
  11463. 714.58 s [vector] +++ OK, passed 100 tests.
  11464. 714.58 s [vector] scanr1': OK
  11465. 714.58 s [vector] +++ OK, passed 100 tests.
  11466. 714.59 s [vector] iscanr: OK
  11467. 714.59 s [vector] +++ OK, passed 100 tests.
  11468. 714.59 s [vector] iscanr': OK
  11469. 714.59 s [vector] +++ OK, passed 100 tests.
  11470. 714.60 s [vector] mut_read: OK
  11471. 714.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11472. 714.60 s [vector] mut_write: OK
  11473. 714.60 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11474. 714.61 s [vector] mut_modify: OK
  11475. 714.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11476. 714.61 s [vector] mut_generate: OK
  11477. 714.61 s [vector] +++ OK, passed 100 tests.
  11478. 714.61 s [vector] mut_generateM: OK
  11479. 714.61 s [vector] +++ OK, passed 100 tests.
  11480. 714.62 s [vector] mut_mapM_: OK (0.01s)
  11481. 714.62 s [vector] +++ OK, passed 100 tests.
  11482. 714.64 s [vector] mut_imapM_: OK (0.01s)
  11483. 714.64 s [vector] +++ OK, passed 100 tests.
  11484. 714.66 s [vector] mut_forM_: OK (0.02s)
  11485. 714.66 s [vector] +++ OK, passed 100 tests.
  11486. 714.66 s [vector] mut_iforM_: OK (0.01s)
  11487. 714.66 s [vector] +++ OK, passed 100 tests.
  11488. 714.66 s [vector] mut_foldr: OK
  11489. 714.67 s [vector] +++ OK, passed 100 tests.
  11490. 714.67 s [vector] mut_foldr': OK
  11491. 714.67 s [vector] +++ OK, passed 100 tests.
  11492. 714.67 s [vector] mut_foldl: OK
  11493. 714.67 s [vector] +++ OK, passed 100 tests.
  11494. 714.67 s [vector] mut_foldl': OK
  11495. 714.68 s [vector] +++ OK, passed 100 tests.
  11496. 714.68 s [vector] mut_ifoldr: OK
  11497. 714.68 s [vector] +++ OK, passed 100 tests.
  11498. 714.68 s [vector] mut_ifoldr': OK
  11499. 714.68 s [vector] +++ OK, passed 100 tests.
  11500. 714.68 s [vector] mut_ifoldl: OK
  11501. 714.68 s [vector] +++ OK, passed 100 tests.
  11502. 714.68 s [vector] mut_ifoldl': OK
  11503. 714.68 s [vector] +++ OK, passed 100 tests.
  11504. 714.68 s [vector] mut_foldM: OK
  11505. 714.69 s [vector] +++ OK, passed 100 tests.
  11506. 714.69 s [vector] mut_foldM': OK
  11507. 714.69 s [vector] +++ OK, passed 100 tests.
  11508. 714.69 s [vector] mut_foldrM: OK
  11509. 714.69 s [vector] +++ OK, passed 100 tests.
  11510. 714.69 s [vector] mut_foldrM': OK
  11511. 714.69 s [vector] +++ OK, passed 100 tests.
  11512. 714.70 s [vector] mut_ifoldM: OK
  11513. 714.70 s [vector] +++ OK, passed 100 tests.
  11514. 714.70 s [vector] mut_ifoldM': OK
  11515. 714.70 s [vector] +++ OK, passed 100 tests.
  11516. 714.70 s [vector] mut_ifoldrM: OK
  11517. 714.70 s [vector] +++ OK, passed 100 tests.
  11518. 714.70 s [vector] mut_ifoldrM': OK
  11519. 714.70 s [vector] +++ OK, passed 100 tests.
  11520. 714.70 s [vector] compare: OK
  11521. 714.70 s [vector] +++ OK, passed 100 tests.
  11522. 714.70 s [vector] maximum: OK
  11523. 714.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11524. 714.70 s [vector] minimum: OK
  11525. 714.70 s [vector] +++ OK, passed 100 tests; 24 discarded.
  11526. 714.70 s [vector] minIndex: OK
  11527. 714.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11528. 714.70 s [vector] maxIndex: OK
  11529. 714.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11530. 714.70 s [vector] maximumBy: OK
  11531. 714.70 s [vector] +++ OK, passed 100 tests; 24 discarded.
  11532. 714.70 s [vector] minimumBy: OK
  11533. 714.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11534. 714.70 s [vector] maximumOn: OK
  11535. 714.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11536. 714.70 s [vector] minimumOn: OK
  11537. 714.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11538. 714.70 s [vector] maxIndexBy: OK
  11539. 714.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11540. 714.70 s [vector] minIndexBy: OK
  11541. 714.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11542. 714.70 s [vector] ListFirstMaxIndexWins: OK
  11543. 714.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11544. 714.71 s [vector] FalseListFirstMaxIndexWins: OK
  11545. 714.71 s [vector] +++ OK, failed as expected. (after 1 test):
  11546. 714.71 s [vector] Exception:
  11547. 714.71 s [vector] Prelude.foldr1: empty list
  11548. 714.71 s [vector] CallStack (from HasCallStack):
  11549. 714.71 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11550. 714.71 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11551. 714.71 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11552. 714.71 s [vector] []
  11553. 714.71 s [vector] zip: OK
  11554. 714.72 s [vector] +++ OK, passed 100 tests.
  11555. 714.72 s [vector] zip3: OK
  11556. 714.72 s [vector] +++ OK, passed 100 tests.
  11557. 714.72 s [vector] unzip: OK
  11558. 714.72 s [vector] +++ OK, passed 100 tests.
  11559. 714.72 s [vector] unzip3: OK
  11560. 714.72 s [vector] +++ OK, passed 100 tests.
  11561. 714.72 s [vector] indexed: OK
  11562. 714.72 s [vector] +++ OK, passed 100 tests.
  11563. 714.72 s [vector] update: OK
  11564. 714.72 s [vector] +++ OK, passed 100 tests.
  11565. 714.72 s [vector] concat: OK
  11566. 714.72 s [vector] +++ OK, passed 100 tests.
  11567. 714.72 s [vector] mempty: OK
  11568. 714.73 s [vector] +++ OK, passed 100 tests.
  11569. 714.73 s [vector] mappend: OK
  11570. 714.73 s [vector] +++ OK, passed 100 tests.
  11571. 714.73 s [vector] mconcat: OK
  11572. 714.73 s [vector] +++ OK, passed 100 tests.
  11573. 714.73 s [vector] fmap: OK
  11574. 714.73 s [vector] +++ OK, passed 100 tests.
  11575. 714.73 s [vector] return: OK
  11576. 714.73 s [vector] +++ OK, passed 100 tests.
  11577. 714.74 s [vector] bind: OK (0.01s)
  11578. 714.74 s [vector] +++ OK, passed 100 tests.
  11579. 714.74 s [vector] mzip: OK
  11580. 714.74 s [vector] +++ OK, passed 100 tests.
  11581. 714.74 s [vector] munzip: OK
  11582. 714.74 s [vector] +++ OK, passed 100 tests.
  11583. 714.74 s [vector] applicative_pure: OK
  11584. 714.74 s [vector] +++ OK, passed 100 tests.
  11585. 714.76 s [vector] applicative_appl: OK (0.02s)
  11586. 714.76 s [vector] +++ OK, passed 100 tests.
  11587. 714.76 s [vector] alternative_empty: OK
  11588. 714.76 s [vector] +++ OK, passed 100 tests.
  11589. 714.78 s [vector] alternative_or: OK
  11590. 714.78 s [vector] +++ OK, passed 100 tests.
  11591. 714.80 s [vector] sequence: OK (0.02s)
  11592. 714.80 s [vector] +++ OK, passed 100 tests.
  11593. 714.80 s [vector] sequence_: OK
  11594. 714.80 s [vector] +++ OK, passed 100 tests.
  11595. 714.80 s [vector] glength: OK
  11596. 714.80 s [vector] +++ OK, passed 100 tests.
  11597. 714.80 s [vector] sum: OK
  11598. 714.80 s [vector] +++ OK, passed 100 tests.
  11599. 714.80 s [vector] product: OK
  11600. 714.80 s [vector] +++ OK, passed 100 tests.
  11601. 714.80 s [vector] enumFromN: OK
  11602. 714.80 s [vector] +++ OK, passed 100 tests.
  11603. 714.80 s [vector] enumFromThenN: OK
  11604. 714.80 s [vector] +++ OK, passed 100 tests.
  11605. 714.80 s [vector] enumFromTo: OK
  11606. 714.80 s [vector] +++ OK, passed 100 tests.
  11607. 714.80 s [vector] enumFromThenTo: OK
  11608. 714.80 s [vector] +++ OK, passed 100 tests; 10 discarded.
  11609. 714.80 s [vector] unstream
  11610. 714.80 s [vector] unstream == vunstream (exact): OK
  11611. 714.80 s [vector] +++ OK, passed 100 tests.
  11612. 714.80 s [vector] unstream == vunstream (unknown): OK
  11613. 714.80 s [vector] +++ OK, passed 100 tests.
  11614. 714.81 s [vector] unstreamR ~= vunstream (exact): OK
  11615. 714.81 s [vector] +++ OK, passed 100 tests.
  11616. 714.81 s [vector] unstreamR ~= vunstream (unknown): OK
  11617. 714.81 s [vector] +++ OK, passed 100 tests.
  11618. 714.81 s [vector] Tests.Vector.Unboxed
  11619. 714.81 s [vector] ()
  11620. 714.81 s [vector] fromList.toList == id: OK
  11621. 714.81 s [vector] +++ OK, passed 100 tests.
  11622. 714.81 s [vector] toList.fromList == id: OK
  11623. 714.81 s [vector] +++ OK, passed 100 tests.
  11624. 714.81 s [vector] unstream.stream == id: OK
  11625. 714.81 s [vector] +++ OK, passed 100 tests.
  11626. 714.83 s [vector] stream.unstream == id: OK
  11627. 714.83 s [vector] +++ OK, passed 100 tests.
  11628. 714.83 s [vector] eq: OK
  11629. 714.83 s [vector] +++ OK, passed 100 tests.
  11630. 714.83 s [vector] length: OK
  11631. 714.83 s [vector] +++ OK, passed 100 tests.
  11632. 714.83 s [vector] null: OK
  11633. 714.83 s [vector] +++ OK, passed 100 tests.
  11634. 714.83 s [vector] index: OK
  11635. 714.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11636. 714.83 s [vector] safeIndex: OK
  11637. 714.83 s [vector] +++ OK, passed 100 tests.
  11638. 714.83 s [vector] head: OK
  11639. 714.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11640. 714.84 s [vector] last: OK
  11641. 714.84 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11642. 714.84 s [vector] unsafeIndex: OK
  11643. 714.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11644. 714.84 s [vector] unsafeHead: OK
  11645. 714.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11646. 714.85 s [vector] unsafeLast: OK
  11647. 714.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11648. 714.85 s [vector] slice: OK
  11649. 714.85 s [vector] +++ OK, passed 100 tests.
  11650. 714.85 s [vector] init: OK
  11651. 714.85 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11652. 714.85 s [vector] tail: OK
  11653. 714.85 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11654. 714.85 s [vector] take: OK
  11655. 714.85 s [vector] +++ OK, passed 100 tests.
  11656. 714.85 s [vector] drop: OK
  11657. 714.85 s [vector] +++ OK, passed 100 tests.
  11658. 714.85 s [vector] splitAt: OK
  11659. 714.85 s [vector] +++ OK, passed 100 tests.
  11660. 714.85 s [vector] empty: OK
  11661. 714.85 s [vector] +++ OK, passed 100 tests.
  11662. 714.85 s [vector] singleton: OK
  11663. 714.85 s [vector] +++ OK, passed 100 tests.
  11664. 714.85 s [vector] replicate: OK
  11665. 714.85 s [vector] +++ OK, passed 100 tests.
  11666. 714.85 s [vector] generate: OK
  11667. 714.85 s [vector] +++ OK, passed 100 tests.
  11668. 714.85 s [vector] iterateN: OK
  11669. 714.85 s [vector] +++ OK, passed 100 tests.
  11670. 714.85 s [vector] iterateNM: OK (0.03s)
  11671. 714.85 s [vector] +++ OK, passed 100 tests.
  11672. 714.85 s [vector] generateM: OK (0.01s)
  11673. 714.85 s [vector] +++ OK, passed 100 tests.
  11674. 714.86 s [vector] replicateM: OK
  11675. 714.86 s [vector] +++ OK, passed 100 tests.
  11676. 714.86 s [vector] create: OK
  11677. 714.86 s [vector] +++ OK, passed 100 tests.
  11678. 714.86 s [vector] createT: OK
  11679. 714.86 s [vector] +++ OK, passed 100 tests.
  11680. 714.86 s [vector] unfoldr: OK
  11681. 714.86 s [vector] +++ OK, passed 100 tests.
  11682. 714.86 s [vector] unfoldrN: OK
  11683. 714.86 s [vector] +++ OK, passed 100 tests.
  11684. 714.86 s [vector] unfoldrExactN: OK
  11685. 714.86 s [vector] +++ OK, passed 100 tests.
  11686. 714.87 s [vector] unfoldrM: OK
  11687. 714.87 s [vector] +++ OK, passed 100 tests.
  11688. 714.88 s [vector] unfoldrNM: OK
  11689. 714.88 s [vector] +++ OK, passed 100 tests.
  11690. 714.90 s [vector] unfoldrExactNM: OK (0.03s)
  11691. 714.90 s [vector] +++ OK, passed 100 tests.
  11692. 714.90 s [vector] constructN: OK
  11693. 714.90 s [vector] +++ OK, passed 100 tests.
  11694. 714.90 s [vector] constructrN: OK
  11695. 714.90 s [vector] +++ OK, passed 100 tests.
  11696. 714.90 s [vector] cons: OK
  11697. 714.90 s [vector] +++ OK, passed 100 tests.
  11698. 714.90 s [vector] snoc: OK
  11699. 714.90 s [vector] +++ OK, passed 100 tests.
  11700. 714.90 s [vector] append: OK
  11701. 714.90 s [vector] +++ OK, passed 100 tests.
  11702. 714.91 s [vector] concat: OK
  11703. 714.91 s [vector] +++ OK, passed 100 tests.
  11704. 714.91 s [vector] force: OK
  11705. 714.91 s [vector] +++ OK, passed 100 tests.
  11706. 714.91 s [vector] upd: OK
  11707. 714.91 s [vector] +++ OK, passed 100 tests.
  11708. 714.91 s [vector] accum: OK
  11709. 714.92 s [vector] +++ OK, passed 100 tests.
  11710. 714.92 s [vector] reverse: OK
  11711. 714.92 s [vector] +++ OK, passed 100 tests.
  11712. 714.92 s [vector] backpermute: OK
  11713. 714.92 s [vector] +++ OK, passed 100 tests.
  11714. 714.92 s [vector] map: OK
  11715. 714.92 s [vector] +++ OK, passed 100 tests.
  11716. 714.92 s [vector] imap: OK
  11717. 714.92 s [vector] +++ OK, passed 100 tests.
  11718. 714.92 s [vector] concatMap: OK
  11719. 714.92 s [vector] +++ OK, passed 100 tests.
  11720. 714.92 s [vector] mapM: OK
  11721. 714.92 s [vector] +++ OK, passed 100 tests.
  11722. 714.93 s [vector] mapM_: OK
  11723. 714.93 s [vector] +++ OK, passed 100 tests.
  11724. 714.93 s [vector] forM: OK
  11725. 714.93 s [vector] +++ OK, passed 100 tests.
  11726. 714.94 s [vector] forM_: OK
  11727. 714.94 s [vector] +++ OK, passed 100 tests.
  11728. 714.94 s [vector] imapM: OK
  11729. 714.94 s [vector] +++ OK, passed 100 tests.
  11730. 714.94 s [vector] imapM_: OK
  11731. 714.94 s [vector] +++ OK, passed 100 tests.
  11732. 714.94 s [vector] zipWith: OK
  11733. 714.94 s [vector] +++ OK, passed 100 tests.
  11734. 714.95 s [vector] zipWith3: OK
  11735. 714.95 s [vector] +++ OK, passed 100 tests.
  11736. 714.95 s [vector] izipWith: OK
  11737. 714.95 s [vector] +++ OK, passed 100 tests.
  11738. 714.95 s [vector] izipWith3: OK
  11739. 714.95 s [vector] +++ OK, passed 100 tests.
  11740. 714.95 s [vector] izipWithM: OK
  11741. 714.95 s [vector] +++ OK, passed 100 tests.
  11742. 714.96 s [vector] izipWithM_: OK
  11743. 714.96 s [vector] +++ OK, passed 100 tests.
  11744. 714.96 s [vector] zipWithM: OK
  11745. 714.96 s [vector] +++ OK, passed 100 tests.
  11746. 714.96 s [vector] zipWithM_: OK
  11747. 714.96 s [vector] +++ OK, passed 100 tests.
  11748. 714.96 s [vector] filter: OK
  11749. 714.96 s [vector] +++ OK, passed 100 tests.
  11750. 714.96 s [vector] ifilter: OK
  11751. 714.96 s [vector] +++ OK, passed 100 tests.
  11752. 714.97 s [vector] filterM: OK (0.01s)
  11753. 714.97 s [vector] +++ OK, passed 100 tests.
  11754. 714.97 s [vector] uniq: OK
  11755. 714.97 s [vector] +++ OK, passed 100 tests.
  11756. 714.98 s [vector] mapMaybe: OK
  11757. 714.98 s [vector] +++ OK, passed 100 tests.
  11758. 714.98 s [vector] imapMaybe: OK
  11759. 714.98 s [vector] +++ OK, passed 100 tests.
  11760. 714.98 s [vector] takeWhile: OK
  11761. 714.98 s [vector] +++ OK, passed 100 tests.
  11762. 714.98 s [vector] dropWhile: OK
  11763. 714.98 s [vector] +++ OK, passed 100 tests.
  11764. 714.98 s [vector] partition: OK
  11765. 714.98 s [vector] +++ OK, passed 100 tests.
  11766. 714.98 s [vector] partitionWith: OK
  11767. 714.98 s [vector] +++ OK, passed 100 tests.
  11768. 714.98 s [vector] span: OK
  11769. 714.98 s [vector] +++ OK, passed 100 tests.
  11770. 714.98 s [vector] break: OK
  11771. 714.98 s [vector] +++ OK, passed 100 tests.
  11772. 714.98 s [vector] spanR: OK
  11773. 714.98 s [vector] +++ OK, passed 100 tests.
  11774. 714.99 s [vector] breakR: OK
  11775. 714.99 s [vector] +++ OK, passed 100 tests.
  11776. 714.99 s [vector] groupBy: OK
  11777. 714.99 s [vector] +++ OK, passed 100 tests.
  11778. 714.99 s [vector] elem: OK
  11779. 714.99 s [vector] +++ OK, passed 100 tests.
  11780. 714.99 s [vector] notElem: OK
  11781. 714.99 s [vector] +++ OK, passed 100 tests.
  11782. 714.99 s [vector] find: OK
  11783. 714.99 s [vector] +++ OK, passed 100 tests.
  11784. 714.99 s [vector] findIndex: OK
  11785. 714.99 s [vector] +++ OK, passed 100 tests.
  11786. 715.00 s [vector] findIndexR: OK
  11787. 715.00 s [vector] +++ OK, passed 100 tests.
  11788. 715.00 s [vector] findIndices: OK
  11789. 715.00 s [vector] +++ OK, passed 100 tests.
  11790. 715.00 s [vector] elemIndex: OK
  11791. 715.00 s [vector] +++ OK, passed 100 tests.
  11792. 715.00 s [vector] elemIndices: OK
  11793. 715.00 s [vector] +++ OK, passed 100 tests.
  11794. 715.00 s [vector] foldl: OK
  11795. 715.00 s [vector] +++ OK, passed 100 tests.
  11796. 715.00 s [vector] foldl1: OK
  11797. 715.00 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11798. 715.00 s [vector] foldl': OK
  11799. 715.00 s [vector] +++ OK, passed 100 tests.
  11800. 715.00 s [vector] foldl1': OK
  11801. 715.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11802. 715.00 s [vector] foldr: OK
  11803. 715.00 s [vector] +++ OK, passed 100 tests.
  11804. 715.00 s [vector] foldr1: OK
  11805. 715.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11806. 715.00 s [vector] foldr': OK
  11807. 715.00 s [vector] +++ OK, passed 100 tests.
  11808. 715.00 s [vector] foldr1': OK
  11809. 715.00 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11810. 715.00 s [vector] ifoldl: OK
  11811. 715.00 s [vector] +++ OK, passed 100 tests.
  11812. 715.00 s [vector] ifoldl': OK
  11813. 715.00 s [vector] +++ OK, passed 100 tests.
  11814. 715.00 s [vector] ifoldr: OK
  11815. 715.00 s [vector] +++ OK, passed 100 tests.
  11816. 715.00 s [vector] ifoldr': OK
  11817. 715.00 s [vector] +++ OK, passed 100 tests.
  11818. 715.00 s [vector] ifoldM: OK
  11819. 715.00 s [vector] +++ OK, passed 100 tests.
  11820. 715.00 s [vector] ifoldM': OK
  11821. 715.00 s [vector] +++ OK, passed 100 tests.
  11822. 715.00 s [vector] ifoldM_: OK
  11823. 715.00 s [vector] +++ OK, passed 100 tests.
  11824. 715.01 s [vector] ifoldM'_: OK
  11825. 715.01 s [vector] +++ OK, passed 100 tests.
  11826. 715.01 s [vector] all: OK
  11827. 715.01 s [vector] +++ OK, passed 100 tests.
  11828. 715.01 s [vector] any: OK
  11829. 715.01 s [vector] +++ OK, passed 100 tests.
  11830. 715.01 s [vector] prescanl: OK
  11831. 715.01 s [vector] +++ OK, passed 100 tests.
  11832. 715.01 s [vector] prescanl': OK
  11833. 715.01 s [vector] +++ OK, passed 100 tests.
  11834. 715.01 s [vector] postscanl: OK
  11835. 715.01 s [vector] +++ OK, passed 100 tests.
  11836. 715.01 s [vector] postscanl': OK
  11837. 715.01 s [vector] +++ OK, passed 100 tests.
  11838. 715.01 s [vector] scanl: OK
  11839. 715.01 s [vector] +++ OK, passed 100 tests.
  11840. 715.02 s [vector] scanl': OK
  11841. 715.02 s [vector] +++ OK, passed 100 tests.
  11842. 715.02 s [vector] scanl1: OK
  11843. 715.02 s [vector] +++ OK, passed 100 tests.
  11844. 715.02 s [vector] scanl1': OK
  11845. 715.02 s [vector] +++ OK, passed 100 tests.
  11846. 715.02 s [vector] iscanl: OK
  11847. 715.02 s [vector] +++ OK, passed 100 tests.
  11848. 715.02 s [vector] iscanl': OK
  11849. 715.02 s [vector] +++ OK, passed 100 tests.
  11850. 715.02 s [vector] prescanr: OK
  11851. 715.02 s [vector] +++ OK, passed 100 tests.
  11852. 715.02 s [vector] prescanr': OK
  11853. 715.02 s [vector] +++ OK, passed 100 tests.
  11854. 715.02 s [vector] postscanr: OK
  11855. 715.02 s [vector] +++ OK, passed 100 tests.
  11856. 715.02 s [vector] postscanr': OK
  11857. 715.02 s [vector] +++ OK, passed 100 tests.
  11858. 715.02 s [vector] scanr: OK
  11859. 715.02 s [vector] +++ OK, passed 100 tests.
  11860. 715.02 s [vector] scanr': OK
  11861. 715.02 s [vector] +++ OK, passed 100 tests.
  11862. 715.34 s [vector] scanr1: OK
  11863. 715.34 s [vector] +++ OK, passed 100 tests.
  11864. 715.34 s [vector] scanr1': OK
  11865. 715.34 s [vector] +++ OK, passed 100 tests.
  11866. 715.34 s [vector] iscanr: OK
  11867. 715.34 s [vector] +++ OK, passed 100 tests.
  11868. 715.34 s [vector] iscanr': OK
  11869. 715.34 s [vector] +++ OK, passed 100 tests.
  11870. 715.34 s [vector] mut_read: OK
  11871. 715.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11872. 715.34 s [vector] mut_write: OK
  11873. 715.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11874. 715.34 s [vector] mut_modify: OK
  11875. 715.34 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11876. 715.34 s [vector] mut_generate: OK
  11877. 715.34 s [vector] +++ OK, passed 100 tests.
  11878. 715.34 s [vector] mut_generateM: OK
  11879. 715.34 s [vector] +++ OK, passed 100 tests.
  11880. 715.34 s [vector] mut_mapM_: OK
  11881. 715.34 s [vector] +++ OK, passed 100 tests.
  11882. 715.34 s [vector] mut_imapM_: OK
  11883. 715.34 s [vector] +++ OK, passed 100 tests.
  11884. 715.34 s [vector] mut_forM_: OK
  11885. 715.34 s [vector] +++ OK, passed 100 tests.
  11886. 715.34 s [vector] mut_iforM_: OK
  11887. 715.34 s [vector] +++ OK, passed 100 tests.
  11888. 715.34 s [vector] mut_foldr: OK
  11889. 715.34 s [vector] +++ OK, passed 100 tests.
  11890. 715.34 s [vector] mut_foldr': OK
  11891. 715.34 s [vector] +++ OK, passed 100 tests.
  11892. 715.34 s [vector] mut_foldl: OK
  11893. 715.34 s [vector] +++ OK, passed 100 tests.
  11894. 715.34 s [vector] mut_foldl': OK
  11895. 715.34 s [vector] +++ OK, passed 100 tests.
  11896. 715.34 s [vector] mut_ifoldr: OK
  11897. 715.34 s [vector] +++ OK, passed 100 tests.
  11898. 715.34 s [vector] mut_ifoldr': OK
  11899. 715.34 s [vector] +++ OK, passed 100 tests.
  11900. 715.34 s [vector] mut_ifoldl: OK
  11901. 715.34 s [vector] +++ OK, passed 100 tests.
  11902. 715.34 s [vector] mut_ifoldl': OK
  11903. 715.34 s [vector] +++ OK, passed 100 tests.
  11904. 715.34 s [vector] mut_foldM: OK
  11905. 715.34 s [vector] +++ OK, passed 100 tests.
  11906. 715.34 s [vector] mut_foldM': OK
  11907. 715.34 s [vector] +++ OK, passed 100 tests.
  11908. 715.34 s [vector] mut_foldrM: OK
  11909. 715.34 s [vector] +++ OK, passed 100 tests.
  11910. 715.34 s [vector] mut_foldrM': OK
  11911. 715.34 s [vector] +++ OK, passed 100 tests.
  11912. 715.34 s [vector] mut_ifoldM: OK
  11913. 715.34 s [vector] +++ OK, passed 100 tests.
  11914. 715.34 s [vector] mut_ifoldM': OK
  11915. 715.34 s [vector] +++ OK, passed 100 tests.
  11916. 715.34 s [vector] mut_ifoldrM: OK
  11917. 715.34 s [vector] +++ OK, passed 100 tests.
  11918. 715.34 s [vector] mut_ifoldrM': OK
  11919. 715.34 s [vector] +++ OK, passed 100 tests.
  11920. 715.34 s [vector] compare: OK
  11921. 715.34 s [vector] +++ OK, passed 100 tests.
  11922. 715.34 s [vector] maximum: OK
  11923. 715.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11924. 715.34 s [vector] minimum: OK
  11925. 715.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11926. 715.34 s [vector] minIndex: OK
  11927. 715.34 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11928. 715.34 s [vector] maxIndex: OK
  11929. 715.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11930. 715.34 s [vector] maximumBy: OK
  11931. 715.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11932. 715.34 s [vector] minimumBy: OK
  11933. 715.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11934. 715.34 s [vector] maximumOn: OK
  11935. 715.34 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11936. 715.34 s [vector] minimumOn: OK
  11937. 715.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11938. 715.34 s [vector] maxIndexBy: OK
  11939. 715.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11940. 715.34 s [vector] minIndexBy: OK
  11941. 715.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11942. 715.34 s [vector] ListFirstMaxIndexWins: OK
  11943. 715.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11944. 715.34 s [vector] FalseListFirstMaxIndexWins: OK
  11945. 715.34 s [vector] +++ OK, failed as expected. (after 1 test):
  11946. 715.34 s [vector] Exception:
  11947. 715.34 s [vector] Prelude.foldr1: empty list
  11948. 715.34 s [vector] CallStack (from HasCallStack):
  11949. 715.34 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11950. 715.34 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11951. 715.34 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11952. 715.34 s [vector] []
  11953. 715.34 s [vector] zip: OK
  11954. 715.34 s [vector] +++ OK, passed 100 tests.
  11955. 715.34 s [vector] zip3: OK
  11956. 715.34 s [vector] +++ OK, passed 100 tests.
  11957. 715.34 s [vector] unzip: OK
  11958. 715.34 s [vector] +++ OK, passed 100 tests.
  11959. 715.34 s [vector] unzip3: OK
  11960. 715.34 s [vector] +++ OK, passed 100 tests.
  11961. 715.34 s [vector] indexed: OK
  11962. 715.34 s [vector] +++ OK, passed 100 tests.
  11963. 715.34 s [vector] update: OK
  11964. 715.34 s [vector] +++ OK, passed 100 tests.
  11965. 715.34 s [vector] mempty: OK
  11966. 715.34 s [vector] +++ OK, passed 100 tests.
  11967. 715.34 s [vector] mappend: OK
  11968. 715.34 s [vector] +++ OK, passed 100 tests.
  11969. 715.34 s [vector] mconcat: OK
  11970. 715.34 s [vector] +++ OK, passed 100 tests.
  11971. 715.34 s [vector] glength: OK
  11972. 715.34 s [vector] +++ OK, passed 100 tests.
  11973. 715.34 s [vector] (Bool)
  11974. 715.34 s [vector] fromList.toList == id: OK
  11975. 715.34 s [vector] +++ OK, passed 100 tests.
  11976. 715.34 s [vector] toList.fromList == id: OK
  11977. 715.34 s [vector] +++ OK, passed 100 tests.
  11978. 715.34 s [vector] unstream.stream == id: OK
  11979. 715.34 s [vector] +++ OK, passed 100 tests.
  11980. 715.34 s [vector] stream.unstream == id: OK
  11981. 715.34 s [vector] +++ OK, passed 100 tests.
  11982. 715.34 s [vector] eq: OK
  11983. 715.34 s [vector] +++ OK, passed 100 tests.
  11984. 715.34 s [vector] length: OK
  11985. 715.34 s [vector] +++ OK, passed 100 tests.
  11986. 715.34 s [vector] null: OK
  11987. 715.34 s [vector] +++ OK, passed 100 tests.
  11988. 715.34 s [vector] index: OK
  11989. 715.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11990. 715.34 s [vector] safeIndex: OK
  11991. 715.34 s [vector] +++ OK, passed 100 tests.
  11992. 715.34 s [vector] head: OK
  11993. 715.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11994. 715.34 s [vector] last: OK
  11995. 715.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11996. 715.34 s [vector] unsafeIndex: OK
  11997. 715.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11998. 715.34 s [vector] unsafeHead: OK
  11999. 715.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12000. 715.34 s [vector] unsafeLast: OK
  12001. 715.34 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12002. 715.34 s [vector] slice: OK
  12003. 715.34 s [vector] +++ OK, passed 100 tests.
  12004. 715.34 s [vector] init: OK
  12005. 715.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12006. 715.34 s [vector] tail: OK
  12007. 715.34 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12008. 715.34 s [vector] take: OK
  12009. 715.34 s [vector] +++ OK, passed 100 tests.
  12010. 715.34 s [vector] drop: OK
  12011. 715.34 s [vector] +++ OK, passed 100 tests.
  12012. 715.34 s [vector] splitAt: OK
  12013. 715.34 s [vector] +++ OK, passed 100 tests.
  12014. 715.34 s [vector] empty: OK
  12015. 715.34 s [vector] +++ OK, passed 100 tests.
  12016. 715.34 s [vector] singleton: OK
  12017. 715.34 s [vector] +++ OK, passed 100 tests.
  12018. 715.34 s [vector] replicate: OK
  12019. 715.34 s [vector] +++ OK, passed 100 tests.
  12020. 715.34 s [vector] generate: OK
  12021. 715.34 s [vector] +++ OK, passed 100 tests.
  12022. 715.34 s [vector] iterateN: OK
  12023. 715.34 s [vector] +++ OK, passed 100 tests.
  12024. 715.34 s [vector] iterateNM: OK (0.02s)
  12025. 715.34 s [vector] +++ OK, passed 100 tests.
  12026. 715.34 s [vector] generateM: OK
  12027. 715.34 s [vector] +++ OK, passed 100 tests.
  12028. 715.34 s [vector] replicateM: OK (0.01s)
  12029. 715.34 s [vector] +++ OK, passed 100 tests.
  12030. 715.34 s [vector] create: OK
  12031. 715.34 s [vector] +++ OK, passed 100 tests.
  12032. 715.34 s [vector] createT: OK
  12033. 715.34 s [vector] +++ OK, passed 100 tests.
  12034. 715.34 s [vector] unfoldr: OK
  12035. 715.34 s [vector] +++ OK, passed 100 tests.
  12036. 715.35 s [vector] unfoldrN: OK
  12037. 715.35 s [vector] +++ OK, passed 100 tests.
  12038. 715.35 s [vector] unfoldrExactN: OK
  12039. 715.35 s [vector] +++ OK, passed 100 tests.
  12040. 715.35 s [vector] unfoldrM: OK
  12041. 715.35 s [vector] +++ OK, passed 100 tests.
  12042. 715.35 s [vector] unfoldrNM: OK
  12043. 715.35 s [vector] +++ OK, passed 100 tests.
  12044. 715.35 s [vector] unfoldrExactNM: OK (0.02s)
  12045. 715.35 s [vector] +++ OK, passed 100 tests.
  12046. 715.35 s [vector] constructN: OK
  12047. 715.35 s [vector] +++ OK, passed 100 tests.
  12048. 715.35 s [vector] constructrN: OK
  12049. 715.35 s [vector] +++ OK, passed 100 tests.
  12050. 715.35 s [vector] cons: OK
  12051. 715.35 s [vector] +++ OK, passed 100 tests.
  12052. 715.35 s [vector] snoc: OK
  12053. 715.35 s [vector] +++ OK, passed 100 tests.
  12054. 715.35 s [vector] append: OK
  12055. 715.35 s [vector] +++ OK, passed 100 tests.
  12056. 715.35 s [vector] concat: OK (0.01s)
  12057. 715.35 s [vector] +++ OK, passed 100 tests.
  12058. 715.35 s [vector] force: OK
  12059. 715.35 s [vector] +++ OK, passed 100 tests.
  12060. 715.35 s [vector] upd: OK
  12061. 715.35 s [vector] +++ OK, passed 100 tests.
  12062. 715.35 s [vector] accum: OK
  12063. 715.35 s [vector] +++ OK, passed 100 tests.
  12064. 715.35 s [vector] reverse: OK
  12065. 715.35 s [vector] +++ OK, passed 100 tests.
  12066. 715.35 s [vector] backpermute: OK
  12067. 715.35 s [vector] +++ OK, passed 100 tests.
  12068. 715.35 s [vector] map: OK
  12069. 715.35 s [vector] +++ OK, passed 100 tests.
  12070. 715.35 s [vector] imap: OK
  12071. 715.35 s [vector] +++ OK, passed 100 tests.
  12072. 715.35 s [vector] concatMap: OK
  12073. 715.35 s [vector] +++ OK, passed 100 tests.
  12074. 715.35 s [vector] mapM: OK
  12075. 715.35 s [vector] +++ OK, passed 100 tests.
  12076. 715.35 s [vector] mapM_: OK
  12077. 715.35 s [vector] +++ OK, passed 100 tests.
  12078. 715.35 s [vector] forM: OK
  12079. 715.35 s [vector] +++ OK, passed 100 tests.
  12080. 715.35 s [vector] forM_: OK
  12081. 715.35 s [vector] +++ OK, passed 100 tests.
  12082. 715.35 s [vector] imapM: OK
  12083. 715.35 s [vector] +++ OK, passed 100 tests.
  12084. 715.35 s [vector] imapM_: OK
  12085. 715.35 s [vector] +++ OK, passed 100 tests.
  12086. 715.35 s [vector] zipWith: OK
  12087. 715.35 s [vector] +++ OK, passed 100 tests.
  12088. 715.35 s [vector] zipWith3: OK
  12089. 715.35 s [vector] +++ OK, passed 100 tests.
  12090. 715.35 s [vector] izipWith: OK
  12091. 715.35 s [vector] +++ OK, passed 100 tests.
  12092. 715.35 s [vector] izipWith3: OK
  12093. 715.35 s [vector] +++ OK, passed 100 tests.
  12094. 715.35 s [vector] izipWithM: OK
  12095. 715.35 s [vector] +++ OK, passed 100 tests.
  12096. 715.35 s [vector] izipWithM_: OK
  12097. 715.35 s [vector] +++ OK, passed 100 tests.
  12098. 715.35 s [vector] zipWithM: OK
  12099. 715.35 s [vector] +++ OK, passed 100 tests.
  12100. 715.35 s [vector] zipWithM_: OK
  12101. 715.35 s [vector] +++ OK, passed 100 tests.
  12102. 715.35 s [vector] filter: OK
  12103. 715.35 s [vector] +++ OK, passed 100 tests.
  12104. 715.35 s [vector] ifilter: OK
  12105. 715.35 s [vector] +++ OK, passed 100 tests.
  12106. 715.35 s [vector] filterM: OK (0.03s)
  12107. 715.35 s [vector] +++ OK, passed 100 tests.
  12108. 715.35 s [vector] uniq: OK
  12109. 715.35 s [vector] +++ OK, passed 100 tests.
  12110. 715.35 s [vector] mapMaybe: OK
  12111. 715.35 s [vector] +++ OK, passed 100 tests.
  12112. 715.35 s [vector] imapMaybe: OK
  12113. 715.35 s [vector] +++ OK, passed 100 tests.
  12114. 715.35 s [vector] takeWhile: OK
  12115. 715.35 s [vector] +++ OK, passed 100 tests.
  12116. 715.35 s [vector] dropWhile: OK
  12117. 715.35 s [vector] +++ OK, passed 100 tests.
  12118. 715.35 s [vector] partition: OK
  12119. 715.35 s [vector] +++ OK, passed 100 tests.
  12120. 715.35 s [vector] partitionWith: OK
  12121. 715.35 s [vector] +++ OK, passed 100 tests.
  12122. 715.35 s [vector] span: OK
  12123. 715.35 s [vector] +++ OK, passed 100 tests.
  12124. 715.35 s [vector] break: OK
  12125. 715.35 s [vector] +++ OK, passed 100 tests.
  12126. 715.35 s [vector] spanR: OK
  12127. 715.35 s [vector] +++ OK, passed 100 tests.
  12128. 715.35 s [vector] breakR: OK
  12129. 715.35 s [vector] +++ OK, passed 100 tests.
  12130. 715.35 s [vector] groupBy: OK
  12131. 715.35 s [vector] +++ OK, passed 100 tests.
  12132. 715.35 s [vector] elem: OK
  12133. 715.35 s [vector] +++ OK, passed 100 tests.
  12134. 715.35 s [vector] notElem: OK
  12135. 715.35 s [vector] +++ OK, passed 100 tests.
  12136. 715.35 s [vector] find: OK
  12137. 715.35 s [vector] +++ OK, passed 100 tests.
  12138. 715.35 s [vector] findIndex: OK
  12139. 715.35 s [vector] +++ OK, passed 100 tests.
  12140. 715.35 s [vector] findIndexR: OK
  12141. 715.35 s [vector] +++ OK, passed 100 tests.
  12142. 715.35 s [vector] findIndices: OK
  12143. 715.35 s [vector] +++ OK, passed 100 tests.
  12144. 715.35 s [vector] elemIndex: OK
  12145. 715.35 s [vector] +++ OK, passed 100 tests.
  12146. 715.35 s [vector] elemIndices: OK
  12147. 715.35 s [vector] +++ OK, passed 100 tests.
  12148. 715.35 s [vector] foldl: OK
  12149. 715.35 s [vector] +++ OK, passed 100 tests.
  12150. 715.35 s [vector] foldl1: OK
  12151. 715.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12152. 715.35 s [vector] foldl': OK
  12153. 715.35 s [vector] +++ OK, passed 100 tests.
  12154. 715.35 s [vector] foldl1': OK
  12155. 715.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12156. 715.35 s [vector] foldr: OK
  12157. 715.35 s [vector] +++ OK, passed 100 tests.
  12158. 715.35 s [vector] foldr1: OK
  12159. 715.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12160. 715.36 s [vector] foldr': OK
  12161. 715.36 s [vector] +++ OK, passed 100 tests.
  12162. 715.37 s [vector] foldr1': OK
  12163. 715.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12164. 715.37 s [vector] ifoldl: OK
  12165. 715.37 s [vector] +++ OK, passed 100 tests.
  12166. 715.37 s [vector] ifoldl': OK
  12167. 715.37 s [vector] +++ OK, passed 100 tests.
  12168. 715.37 s [vector] ifoldr: OK
  12169. 715.37 s [vector] +++ OK, passed 100 tests.
  12170. 715.37 s [vector] ifoldr': OK
  12171. 715.37 s [vector] +++ OK, passed 100 tests.
  12172. 715.37 s [vector] ifoldM: OK
  12173. 715.37 s [vector] +++ OK, passed 100 tests.
  12174. 715.37 s [vector] ifoldM': OK
  12175. 715.37 s [vector] +++ OK, passed 100 tests.
  12176. 715.37 s [vector] ifoldM_: OK
  12177. 715.37 s [vector] +++ OK, passed 100 tests.
  12178. 715.37 s [vector] ifoldM'_: OK (0.01s)
  12179. 715.37 s [vector] +++ OK, passed 100 tests.
  12180. 715.37 s [vector] all: OK
  12181. 715.37 s [vector] +++ OK, passed 100 tests.
  12182. 715.37 s [vector] any: OK
  12183. 715.37 s [vector] +++ OK, passed 100 tests.
  12184. 715.37 s [vector] prescanl: OK
  12185. 715.37 s [vector] +++ OK, passed 100 tests.
  12186. 715.37 s [vector] prescanl': OK
  12187. 715.37 s [vector] +++ OK, passed 100 tests.
  12188. 715.37 s [vector] postscanl: OK
  12189. 715.37 s [vector] +++ OK, passed 100 tests.
  12190. 715.37 s [vector] postscanl': OK
  12191. 715.37 s [vector] +++ OK, passed 100 tests.
  12192. 715.37 s [vector] scanl: OK
  12193. 715.37 s [vector] +++ OK, passed 100 tests.
  12194. 715.38 s [vector] scanl': OK
  12195. 715.38 s [vector] +++ OK, passed 100 tests.
  12196. 715.38 s [vector] scanl1: OK
  12197. 715.38 s [vector] +++ OK, passed 100 tests.
  12198. 715.38 s [vector] scanl1': OK
  12199. 715.38 s [vector] +++ OK, passed 100 tests.
  12200. 715.38 s [vector] iscanl: OK
  12201. 715.38 s [vector] +++ OK, passed 100 tests.
  12202. 715.38 s [vector] iscanl': OK
  12203. 715.39 s [vector] +++ OK, passed 100 tests.
  12204. 715.39 s [vector] prescanr: OK
  12205. 715.39 s [vector] +++ OK, passed 100 tests.
  12206. 715.39 s [vector] prescanr': OK
  12207. 715.39 s [vector] +++ OK, passed 100 tests.
  12208. 715.39 s [vector] postscanr: OK
  12209. 715.39 s [vector] +++ OK, passed 100 tests.
  12210. 715.39 s [vector] postscanr': OK
  12211. 715.39 s [vector] +++ OK, passed 100 tests.
  12212. 715.39 s [vector] scanr: OK
  12213. 715.39 s [vector] +++ OK, passed 100 tests.
  12214. 715.39 s [vector] scanr': OK
  12215. 715.39 s [vector] +++ OK, passed 100 tests.
  12216. 715.39 s [vector] scanr1: OK
  12217. 715.39 s [vector] +++ OK, passed 100 tests.
  12218. 715.39 s [vector] scanr1': OK
  12219. 715.39 s [vector] +++ OK, passed 100 tests.
  12220. 715.40 s [vector] iscanr: OK
  12221. 715.40 s [vector] +++ OK, passed 100 tests.
  12222. 715.40 s [vector] iscanr': OK
  12223. 715.40 s [vector] +++ OK, passed 100 tests.
  12224. 715.40 s [vector] mut_read: OK
  12225. 715.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12226. 715.40 s [vector] mut_write: OK
  12227. 715.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12228. 715.40 s [vector] mut_modify: OK
  12229. 715.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12230. 715.40 s [vector] mut_generate: OK
  12231. 715.40 s [vector] +++ OK, passed 100 tests.
  12232. 715.41 s [vector] mut_generateM: OK
  12233. 715.41 s [vector] +++ OK, passed 100 tests.
  12234. 715.41 s [vector] mut_mapM_: OK
  12235. 715.41 s [vector] +++ OK, passed 100 tests.
  12236. 715.42 s [vector] mut_imapM_: OK
  12237. 715.42 s [vector] +++ OK, passed 100 tests.
  12238. 715.44 s [vector] mut_forM_: OK
  12239. 715.44 s [vector] +++ OK, passed 100 tests.
  12240. 715.44 s [vector] mut_iforM_: OK (0.01s)
  12241. 715.44 s [vector] +++ OK, passed 100 tests.
  12242. 715.44 s [vector] mut_foldr: OK
  12243. 715.44 s [vector] +++ OK, passed 100 tests.
  12244. 715.44 s [vector] mut_foldr': OK
  12245. 715.44 s [vector] +++ OK, passed 100 tests.
  12246. 715.45 s [vector] mut_foldl: OK
  12247. 715.45 s [vector] +++ OK, passed 100 tests.
  12248. 715.45 s [vector] mut_foldl': OK
  12249. 715.45 s [vector] +++ OK, passed 100 tests.
  12250. 715.45 s [vector] mut_ifoldr: OK
  12251. 715.45 s [vector] +++ OK, passed 100 tests.
  12252. 715.45 s [vector] mut_ifoldr': OK
  12253. 715.45 s [vector] +++ OK, passed 100 tests.
  12254. 715.45 s [vector] mut_ifoldl: OK
  12255. 715.46 s [vector] +++ OK, passed 100 tests.
  12256. 715.46 s [vector] mut_ifoldl': OK
  12257. 715.46 s [vector] +++ OK, passed 100 tests.
  12258. 715.46 s [vector] mut_foldM: OK
  12259. 715.46 s [vector] +++ OK, passed 100 tests.
  12260. 715.46 s [vector] mut_foldM': OK
  12261. 715.46 s [vector] +++ OK, passed 100 tests.
  12262. 715.46 s [vector] mut_foldrM: OK
  12263. 715.46 s [vector] +++ OK, passed 100 tests.
  12264. 715.46 s [vector] mut_foldrM': OK
  12265. 715.46 s [vector] +++ OK, passed 100 tests.
  12266. 715.46 s [vector] mut_ifoldM: OK
  12267. 715.46 s [vector] +++ OK, passed 100 tests.
  12268. 715.46 s [vector] mut_ifoldM': OK
  12269. 715.47 s [vector] +++ OK, passed 100 tests.
  12270. 715.47 s [vector] mut_ifoldrM: OK
  12271. 715.47 s [vector] +++ OK, passed 100 tests.
  12272. 715.47 s [vector] mut_ifoldrM': OK
  12273. 715.47 s [vector] +++ OK, passed 100 tests.
  12274. 715.47 s [vector] compare: OK
  12275. 715.47 s [vector] +++ OK, passed 100 tests.
  12276. 715.47 s [vector] maximum: OK
  12277. 715.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12278. 715.47 s [vector] minimum: OK
  12279. 715.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12280. 715.47 s [vector] minIndex: OK
  12281. 715.47 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12282. 715.47 s [vector] maxIndex: OK
  12283. 715.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12284. 715.47 s [vector] maximumBy: OK
  12285. 715.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12286. 715.47 s [vector] minimumBy: OK
  12287. 715.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12288. 715.47 s [vector] maximumOn: OK
  12289. 715.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12290. 715.47 s [vector] minimumOn: OK
  12291. 715.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12292. 715.47 s [vector] maxIndexBy: OK
  12293. 715.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12294. 715.47 s [vector] minIndexBy: OK
  12295. 715.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12296. 715.47 s [vector] ListFirstMaxIndexWins: OK
  12297. 715.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12298. 715.47 s [vector] FalseListFirstMaxIndexWins: OK
  12299. 715.48 s [vector] +++ OK, failed as expected. (after 1 test):
  12300. 715.48 s [vector] Exception:
  12301. 715.48 s [vector] Prelude.foldr1: empty list
  12302. 715.48 s [vector] CallStack (from HasCallStack):
  12303. 715.48 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12304. 715.48 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12305. 715.48 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12306. 715.48 s [vector] []
  12307. 715.48 s [vector] zip: OK
  12308. 715.48 s [vector] +++ OK, passed 100 tests.
  12309. 715.48 s [vector] zip3: OK
  12310. 715.48 s [vector] +++ OK, passed 100 tests.
  12311. 715.48 s [vector] unzip: OK
  12312. 715.48 s [vector] +++ OK, passed 100 tests.
  12313. 715.48 s [vector] unzip3: OK
  12314. 715.48 s [vector] +++ OK, passed 100 tests.
  12315. 715.48 s [vector] indexed: OK
  12316. 715.48 s [vector] +++ OK, passed 100 tests.
  12317. 715.48 s [vector] update: OK
  12318. 715.48 s [vector] +++ OK, passed 100 tests.
  12319. 715.48 s [vector] mempty: OK
  12320. 715.48 s [vector] +++ OK, passed 100 tests.
  12321. 715.48 s [vector] mappend: OK
  12322. 715.48 s [vector] +++ OK, passed 100 tests.
  12323. 715.50 s [vector] mconcat: OK (0.01s)
  12324. 715.50 s [vector] +++ OK, passed 100 tests.
  12325. 715.50 s [vector] glength: OK
  12326. 715.50 s [vector] +++ OK, passed 100 tests.
  12327. 715.50 s [vector] and: OK
  12328. 715.50 s [vector] +++ OK, passed 100 tests.
  12329. 715.50 s [vector] or: OK
  12330. 715.50 s [vector] +++ OK, passed 100 tests.
  12331. 715.50 s [vector] (Int)
  12332. 715.50 s [vector] fromList.toList == id: OK
  12333. 715.50 s [vector] +++ OK, passed 100 tests.
  12334. 715.50 s [vector] toList.fromList == id: OK
  12335. 715.50 s [vector] +++ OK, passed 100 tests.
  12336. 715.50 s [vector] unstream.stream == id: OK
  12337. 715.50 s [vector] +++ OK, passed 100 tests.
  12338. 715.50 s [vector] stream.unstream == id: OK
  12339. 715.50 s [vector] +++ OK, passed 100 tests.
  12340. 715.50 s [vector] eq: OK
  12341. 715.50 s [vector] +++ OK, passed 100 tests.
  12342. 715.50 s [vector] length: OK
  12343. 715.50 s [vector] +++ OK, passed 100 tests.
  12344. 715.50 s [vector] null: OK
  12345. 715.50 s [vector] +++ OK, passed 100 tests.
  12346. 715.50 s [vector] index: OK
  12347. 715.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12348. 715.51 s [vector] safeIndex: OK
  12349. 715.51 s [vector] +++ OK, passed 100 tests.
  12350. 715.51 s [vector] head: OK
  12351. 715.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12352. 715.51 s [vector] last: OK
  12353. 715.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12354. 715.51 s [vector] unsafeIndex: OK
  12355. 715.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12356. 715.51 s [vector] unsafeHead: OK
  12357. 715.51 s [vector] +++ OK, passed 100 tests; 10 discarded.
  12358. 715.51 s [vector] unsafeLast: OK
  12359. 715.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12360. 715.51 s [vector] slice: OK
  12361. 715.51 s [vector] +++ OK, passed 100 tests.
  12362. 715.51 s [vector] init: OK
  12363. 715.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12364. 715.51 s [vector] tail: OK
  12365. 715.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12366. 715.51 s [vector] take: OK
  12367. 715.51 s [vector] +++ OK, passed 100 tests.
  12368. 715.51 s [vector] drop: OK
  12369. 715.51 s [vector] +++ OK, passed 100 tests.
  12370. 715.51 s [vector] splitAt: OK
  12371. 715.51 s [vector] +++ OK, passed 100 tests.
  12372. 715.51 s [vector] empty: OK
  12373. 715.51 s [vector] +++ OK, passed 100 tests.
  12374. 715.51 s [vector] singleton: OK
  12375. 715.51 s [vector] +++ OK, passed 100 tests.
  12376. 715.51 s [vector] replicate: OK
  12377. 715.51 s [vector] +++ OK, passed 100 tests.
  12378. 715.51 s [vector] generate: OK
  12379. 715.51 s [vector] +++ OK, passed 100 tests.
  12380. 715.52 s [vector] iterateN: OK
  12381. 715.52 s [vector] +++ OK, passed 100 tests.
  12382. 715.52 s [vector] iterateNM: OK (0.01s)
  12383. 715.52 s [vector] +++ OK, passed 100 tests.
  12384. 715.54 s [vector] generateM: OK (0.02s)
  12385. 715.54 s [vector] +++ OK, passed 100 tests.
  12386. 715.56 s [vector] replicateM: OK (0.01s)
  12387. 715.56 s [vector] +++ OK, passed 100 tests.
  12388. 715.56 s [vector] create: OK
  12389. 715.56 s [vector] +++ OK, passed 100 tests.
  12390. 715.56 s [vector] createT: OK
  12391. 715.56 s [vector] +++ OK, passed 100 tests.
  12392. 715.56 s [vector] unfoldr: OK
  12393. 715.56 s [vector] +++ OK, passed 100 tests.
  12394. 715.56 s [vector] unfoldrN: OK
  12395. 715.56 s [vector] +++ OK, passed 100 tests.
  12396. 715.58 s [vector] unfoldrExactN: OK
  12397. 715.58 s [vector] +++ OK, passed 100 tests.
  12398. 715.58 s [vector] unfoldrM: OK
  12399. 715.58 s [vector] +++ OK, passed 100 tests.
  12400. 715.59 s [vector] unfoldrNM: OK
  12401. 715.59 s [vector] +++ OK, passed 100 tests.
  12402. 715.60 s [vector] unfoldrExactNM: OK (0.01s)
  12403. 715.60 s [vector] +++ OK, passed 100 tests.
  12404. 715.60 s [vector] constructN: OK
  12405. 715.60 s [vector] +++ OK, passed 100 tests.
  12406. 715.60 s [vector] constructrN: OK
  12407. 715.60 s [vector] +++ OK, passed 100 tests.
  12408. 715.60 s [vector] cons: OK
  12409. 715.60 s [vector] +++ OK, passed 100 tests.
  12410. 715.60 s [vector] snoc: OK
  12411. 715.61 s [vector] +++ OK, passed 100 tests.
  12412. 715.61 s [vector] append: OK
  12413. 715.61 s [vector] +++ OK, passed 100 tests.
  12414. 715.61 s [vector] concat: OK (0.01s)
  12415. 715.62 s [vector] +++ OK, passed 100 tests.
  12416. 715.62 s [vector] force: OK
  12417. 715.62 s [vector] +++ OK, passed 100 tests.
  12418. 715.62 s [vector] upd: OK
  12419. 715.62 s [vector] +++ OK, passed 100 tests.
  12420. 715.62 s [vector] accum: OK
  12421. 715.62 s [vector] +++ OK, passed 100 tests.
  12422. 715.62 s [vector] reverse: OK
  12423. 715.62 s [vector] +++ OK, passed 100 tests.
  12424. 715.62 s [vector] backpermute: OK
  12425. 715.62 s [vector] +++ OK, passed 100 tests.
  12426. 715.62 s [vector] map: OK
  12427. 715.62 s [vector] +++ OK, passed 100 tests.
  12428. 715.62 s [vector] imap: OK
  12429. 715.62 s [vector] +++ OK, passed 100 tests.
  12430. 715.62 s [vector] concatMap: OK
  12431. 715.62 s [vector] +++ OK, passed 100 tests.
  12432. 715.62 s [vector] mapM: OK
  12433. 715.62 s [vector] +++ OK, passed 100 tests.
  12434. 715.63 s [vector] mapM_: OK (0.02s)
  12435. 715.64 s [vector] +++ OK, passed 100 tests.
  12436. 715.64 s [vector] forM: OK
  12437. 715.64 s [vector] +++ OK, passed 100 tests.
  12438. 715.65 s [vector] forM_: OK (0.01s)
  12439. 715.66 s [vector] +++ OK, passed 100 tests.
  12440. 715.66 s [vector] imapM: OK
  12441. 715.66 s [vector] +++ OK, passed 100 tests.
  12442. 715.67 s [vector] imapM_: OK (0.01s)
  12443. 715.67 s [vector] +++ OK, passed 100 tests.
  12444. 715.67 s [vector] zipWith: OK
  12445. 715.67 s [vector] +++ OK, passed 100 tests.
  12446. 715.68 s [vector] zipWith3: OK
  12447. 715.68 s [vector] +++ OK, passed 100 tests.
  12448. 715.68 s [vector] izipWith: OK
  12449. 715.68 s [vector] +++ OK, passed 100 tests.
  12450. 715.68 s [vector] izipWith3: OK
  12451. 715.68 s [vector] +++ OK, passed 100 tests.
  12452. 715.68 s [vector] izipWithM: OK
  12453. 715.68 s [vector] +++ OK, passed 100 tests.
  12454. 715.69 s [vector] izipWithM_: OK (0.01s)
  12455. 715.70 s [vector] +++ OK, passed 100 tests.
  12456. 715.70 s [vector] zipWithM: OK
  12457. 715.70 s [vector] +++ OK, passed 100 tests.
  12458. 715.70 s [vector] zipWithM_: OK
  12459. 715.70 s [vector] +++ OK, passed 100 tests.
  12460. 715.70 s [vector] filter: OK
  12461. 715.70 s [vector] +++ OK, passed 100 tests.
  12462. 715.70 s [vector] ifilter: OK
  12463. 715.70 s [vector] +++ OK, passed 100 tests.
  12464. 715.74 s [vector] filterM: OK (0.03s)
  12465. 715.74 s [vector] +++ OK, passed 100 tests.
  12466. 715.74 s [vector] uniq: OK
  12467. 715.74 s [vector] +++ OK, passed 100 tests.
  12468. 715.74 s [vector] mapMaybe: OK
  12469. 715.75 s [vector] +++ OK, passed 100 tests.
  12470. 715.75 s [vector] imapMaybe: OK
  12471. 715.75 s [vector] +++ OK, passed 100 tests.
  12472. 715.75 s [vector] takeWhile: OK
  12473. 715.75 s [vector] +++ OK, passed 100 tests.
  12474. 715.75 s [vector] dropWhile: OK
  12475. 715.75 s [vector] +++ OK, passed 100 tests.
  12476. 715.75 s [vector] partition: OK
  12477. 715.75 s [vector] +++ OK, passed 100 tests.
  12478. 715.75 s [vector] partitionWith: OK
  12479. 715.75 s [vector] +++ OK, passed 100 tests.
  12480. 715.75 s [vector] span: OK
  12481. 715.75 s [vector] +++ OK, passed 100 tests.
  12482. 715.75 s [vector] break: OK
  12483. 715.75 s [vector] +++ OK, passed 100 tests.
  12484. 715.75 s [vector] spanR: OK
  12485. 715.75 s [vector] +++ OK, passed 100 tests.
  12486. 715.76 s [vector] breakR: OK
  12487. 715.76 s [vector] +++ OK, passed 100 tests.
  12488. 715.76 s [vector] groupBy: OK
  12489. 715.76 s [vector] +++ OK, passed 100 tests.
  12490. 715.76 s [vector] elem: OK
  12491. 715.76 s [vector] +++ OK, passed 100 tests.
  12492. 715.76 s [vector] notElem: OK
  12493. 715.76 s [vector] +++ OK, passed 100 tests.
  12494. 715.76 s [vector] find: OK
  12495. 715.76 s [vector] +++ OK, passed 100 tests.
  12496. 715.76 s [vector] findIndex: OK
  12497. 715.76 s [vector] +++ OK, passed 100 tests.
  12498. 715.76 s [vector] findIndexR: OK
  12499. 715.76 s [vector] +++ OK, passed 100 tests.
  12500. 715.76 s [vector] findIndices: OK
  12501. 715.76 s [vector] +++ OK, passed 100 tests.
  12502. 715.76 s [vector] elemIndex: OK
  12503. 715.76 s [vector] +++ OK, passed 100 tests.
  12504. 715.76 s [vector] elemIndices: OK
  12505. 715.76 s [vector] +++ OK, passed 100 tests.
  12506. 715.76 s [vector] foldl: OK
  12507. 715.77 s [vector] +++ OK, passed 100 tests.
  12508. 715.77 s [vector] foldl1: OK
  12509. 715.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12510. 715.77 s [vector] foldl': OK
  12511. 715.77 s [vector] +++ OK, passed 100 tests.
  12512. 715.77 s [vector] foldl1': OK
  12513. 715.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12514. 715.78 s [vector] foldr: OK
  12515. 715.78 s [vector] +++ OK, passed 100 tests.
  12516. 715.78 s [vector] foldr1: OK
  12517. 715.78 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12518. 715.78 s [vector] foldr': OK
  12519. 715.78 s [vector] +++ OK, passed 100 tests.
  12520. 715.79 s [vector] foldr1': OK
  12521. 715.79 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12522. 715.79 s [vector] ifoldl: OK
  12523. 715.79 s [vector] +++ OK, passed 100 tests.
  12524. 715.79 s [vector] ifoldl': OK
  12525. 715.79 s [vector] +++ OK, passed 100 tests.
  12526. 715.79 s [vector] ifoldr: OK
  12527. 715.79 s [vector] +++ OK, passed 100 tests.
  12528. 715.79 s [vector] ifoldr': OK
  12529. 715.80 s [vector] +++ OK, passed 100 tests.
  12530. 715.80 s [vector] ifoldM: OK
  12531. 715.80 s [vector] +++ OK, passed 100 tests.
  12532. 715.80 s [vector] ifoldM': OK
  12533. 715.80 s [vector] +++ OK, passed 100 tests.
  12534. 715.81 s [vector] ifoldM_: OK (0.02s)
  12535. 715.82 s [vector] +++ OK, passed 100 tests.
  12536. 715.83 s [vector] ifoldM'_: OK
  12537. 715.83 s [vector] +++ OK, passed 100 tests.
  12538. 715.83 s [vector] all: OK
  12539. 715.83 s [vector] +++ OK, passed 100 tests.
  12540. 715.83 s [vector] any: OK
  12541. 715.83 s [vector] +++ OK, passed 100 tests.
  12542. 715.84 s [vector] prescanl: OK
  12543. 715.84 s [vector] +++ OK, passed 100 tests.
  12544. 715.84 s [vector] prescanl': OK
  12545. 715.84 s [vector] +++ OK, passed 100 tests.
  12546. 715.84 s [vector] postscanl: OK
  12547. 715.84 s [vector] +++ OK, passed 100 tests.
  12548. 715.84 s [vector] postscanl': OK
  12549. 715.85 s [vector] +++ OK, passed 100 tests.
  12550. 715.85 s [vector] scanl: OK
  12551. 715.85 s [vector] +++ OK, passed 100 tests.
  12552. 715.85 s [vector] scanl': OK
  12553. 715.85 s [vector] +++ OK, passed 100 tests.
  12554. 715.85 s [vector] scanl1: OK
  12555. 715.85 s [vector] +++ OK, passed 100 tests.
  12556. 715.85 s [vector] scanl1': OK
  12557. 715.85 s [vector] +++ OK, passed 100 tests.
  12558. 715.86 s [vector] iscanl: OK
  12559. 715.86 s [vector] +++ OK, passed 100 tests.
  12560. 715.86 s [vector] iscanl': OK
  12561. 715.86 s [vector] +++ OK, passed 100 tests.
  12562. 715.86 s [vector] prescanr: OK
  12563. 715.86 s [vector] +++ OK, passed 100 tests.
  12564. 715.86 s [vector] prescanr': OK
  12565. 715.86 s [vector] +++ OK, passed 100 tests.
  12566. 715.87 s [vector] postscanr: OK
  12567. 715.87 s [vector] +++ OK, passed 100 tests.
  12568. 715.88 s [vector] postscanr': OK
  12569. 715.88 s [vector] +++ OK, passed 100 tests.
  12570. 715.88 s [vector] scanr: OK
  12571. 715.88 s [vector] +++ OK, passed 100 tests.
  12572. 715.88 s [vector] scanr': OK
  12573. 715.88 s [vector] +++ OK, passed 100 tests.
  12574. 715.88 s [vector] scanr1: OK
  12575. 715.88 s [vector] +++ OK, passed 100 tests.
  12576. 715.88 s [vector] scanr1': OK
  12577. 715.88 s [vector] +++ OK, passed 100 tests.
  12578. 715.88 s [vector] iscanr: OK
  12579. 715.89 s [vector] +++ OK, passed 100 tests.
  12580. 715.89 s [vector] iscanr': OK
  12581. 715.89 s [vector] +++ OK, passed 100 tests.
  12582. 715.89 s [vector] mut_read: OK
  12583. 715.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12584. 715.89 s [vector] mut_write: OK
  12585. 715.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12586. 715.89 s [vector] mut_modify: OK
  12587. 715.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12588. 715.89 s [vector] mut_generate: OK
  12589. 715.89 s [vector] +++ OK, passed 100 tests.
  12590. 715.90 s [vector] mut_generateM: OK
  12591. 715.90 s [vector] +++ OK, passed 100 tests.
  12592. 715.91 s [vector] mut_mapM_: OK (0.02s)
  12593. 715.91 s [vector] +++ OK, passed 100 tests.
  12594. 715.94 s [vector] mut_imapM_: OK
  12595. 715.94 s [vector] +++ OK, passed 100 tests.
  12596. 715.94 s [vector] mut_forM_: OK (0.01s)
  12597. 715.94 s [vector] +++ OK, passed 100 tests.
  12598. 715.96 s [vector] mut_iforM_: OK (0.02s)
  12599. 715.96 s [vector] +++ OK, passed 100 tests.
  12600. 715.96 s [vector] mut_foldr: OK
  12601. 715.96 s [vector] +++ OK, passed 100 tests.
  12602. 715.96 s [vector] mut_foldr': OK
  12603. 715.96 s [vector] +++ OK, passed 100 tests.
  12604. 715.96 s [vector] mut_foldl: OK
  12605. 715.96 s [vector] +++ OK, passed 100 tests.
  12606. 715.97 s [vector] mut_foldl': OK
  12607. 715.97 s [vector] +++ OK, passed 100 tests.
  12608. 715.97 s [vector] mut_ifoldr: OK
  12609. 715.97 s [vector] +++ OK, passed 100 tests.
  12610. 715.97 s [vector] mut_ifoldr': OK
  12611. 715.97 s [vector] +++ OK, passed 100 tests.
  12612. 715.98 s [vector] mut_ifoldl: OK
  12613. 715.98 s [vector] +++ OK, passed 100 tests.
  12614. 715.98 s [vector] mut_ifoldl': OK
  12615. 715.98 s [vector] +++ OK, passed 100 tests.
  12616. 715.98 s [vector] mut_foldM: OK
  12617. 715.98 s [vector] +++ OK, passed 100 tests.
  12618. 715.98 s [vector] mut_foldM': OK
  12619. 715.98 s [vector] +++ OK, passed 100 tests.
  12620. 715.98 s [vector] mut_foldrM: OK
  12621. 715.98 s [vector] +++ OK, passed 100 tests.
  12622. 715.99 s [vector] mut_foldrM': OK
  12623. 715.99 s [vector] +++ OK, passed 100 tests.
  12624. 715.99 s [vector] mut_ifoldM: OK
  12625. 715.99 s [vector] +++ OK, passed 100 tests.
  12626. 715.99 s [vector] mut_ifoldM': OK
  12627. 715.99 s [vector] +++ OK, passed 100 tests.
  12628. 715.99 s [vector] mut_ifoldrM: OK
  12629. 716.00 s [vector] +++ OK, passed 100 tests.
  12630. 716.00 s [vector] mut_ifoldrM': OK
  12631. 716.00 s [vector] +++ OK, passed 100 tests.
  12632. 716.00 s [vector] compare: OK
  12633. 716.00 s [vector] +++ OK, passed 100 tests.
  12634. 716.00 s [vector] maximum: OK
  12635. 716.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12636. 716.00 s [vector] minimum: OK
  12637. 716.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12638. 716.00 s [vector] minIndex: OK
  12639. 716.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12640. 716.00 s [vector] maxIndex: OK
  12641. 716.00 s [vector] +++ OK, passed 100 tests; 10 discarded.
  12642. 716.00 s [vector] maximumBy: OK
  12643. 716.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12644. 716.00 s [vector] minimumBy: OK
  12645. 716.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12646. 716.00 s [vector] maximumOn: OK
  12647. 716.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12648. 716.00 s [vector] minimumOn: OK
  12649. 716.00 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12650. 716.00 s [vector] maxIndexBy: OK
  12651. 716.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12652. 716.00 s [vector] minIndexBy: OK
  12653. 716.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12654. 716.00 s [vector] ListFirstMaxIndexWins: OK
  12655. 716.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12656. 716.00 s [vector] FalseListFirstMaxIndexWins: OK
  12657. 716.01 s [vector] +++ OK, failed as expected. (after 1 test):
  12658. 716.01 s [vector] Exception:
  12659. 716.01 s [vector] Prelude.foldr1: empty list
  12660. 716.01 s [vector] CallStack (from HasCallStack):
  12661. 716.01 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12662. 716.01 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12663. 716.01 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12664. 716.01 s [vector] []
  12665. 716.01 s [vector] zip: OK
  12666. 716.01 s [vector] +++ OK, passed 100 tests.
  12667. 716.01 s [vector] zip3: OK
  12668. 716.01 s [vector] +++ OK, passed 100 tests.
  12669. 716.01 s [vector] unzip: OK
  12670. 716.01 s [vector] +++ OK, passed 100 tests.
  12671. 716.01 s [vector] unzip3: OK
  12672. 716.01 s [vector] +++ OK, passed 100 tests.
  12673. 716.01 s [vector] indexed: OK
  12674. 716.01 s [vector] +++ OK, passed 100 tests.
  12675. 716.01 s [vector] update: OK
  12676. 716.01 s [vector] +++ OK, passed 100 tests.
  12677. 716.01 s [vector] mempty: OK
  12678. 716.01 s [vector] +++ OK, passed 100 tests.
  12679. 716.01 s [vector] mappend: OK
  12680. 716.02 s [vector] +++ OK, passed 100 tests.
  12681. 716.03 s [vector] mconcat: OK (0.01s)
  12682. 716.03 s [vector] +++ OK, passed 100 tests.
  12683. 716.03 s [vector] glength: OK
  12684. 716.03 s [vector] +++ OK, passed 100 tests.
  12685. 716.03 s [vector] sum: OK
  12686. 716.03 s [vector] +++ OK, passed 100 tests.
  12687. 716.03 s [vector] product: OK
  12688. 716.03 s [vector] +++ OK, passed 100 tests.
  12689. 716.03 s [vector] enumFromN: OK
  12690. 716.03 s [vector] +++ OK, passed 100 tests.
  12691. 716.03 s [vector] enumFromThenN: OK
  12692. 716.03 s [vector] +++ OK, passed 100 tests.
  12693. 716.03 s [vector] enumFromTo: OK
  12694. 716.03 s [vector] +++ OK, passed 100 tests.
  12695. 716.03 s [vector] enumFromThenTo: OK
  12696. 716.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12697. 716.03 s [vector] (Float)
  12698. 716.03 s [vector] fromList.toList == id: OK
  12699. 716.03 s [vector] +++ OK, passed 100 tests.
  12700. 716.04 s [vector] toList.fromList == id: OK
  12701. 716.04 s [vector] +++ OK, passed 100 tests.
  12702. 716.04 s [vector] unstream.stream == id: OK
  12703. 716.04 s [vector] +++ OK, passed 100 tests.
  12704. 716.04 s [vector] stream.unstream == id: OK
  12705. 716.04 s [vector] +++ OK, passed 100 tests.
  12706. 716.04 s [vector] eq: OK
  12707. 716.04 s [vector] +++ OK, passed 100 tests.
  12708. 716.04 s [vector] length: OK
  12709. 716.04 s [vector] +++ OK, passed 100 tests.
  12710. 716.04 s [vector] null: OK
  12711. 716.04 s [vector] +++ OK, passed 100 tests.
  12712. 716.04 s [vector] index: OK
  12713. 716.04 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12714. 716.04 s [vector] safeIndex: OK
  12715. 716.04 s [vector] +++ OK, passed 100 tests.
  12716. 716.04 s [vector] head: OK
  12717. 716.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12718. 716.04 s [vector] last: OK
  12719. 716.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12720. 716.04 s [vector] unsafeIndex: OK
  12721. 716.04 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12722. 716.04 s [vector] unsafeHead: OK
  12723. 716.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12724. 716.05 s [vector] unsafeLast: OK
  12725. 716.05 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12726. 716.05 s [vector] slice: OK
  12727. 716.05 s [vector] +++ OK, passed 100 tests.
  12728. 716.05 s [vector] init: OK
  12729. 716.05 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12730. 716.05 s [vector] tail: OK
  12731. 716.05 s [vector] +++ OK, passed 100 tests; 25 discarded.
  12732. 716.05 s [vector] take: OK
  12733. 716.05 s [vector] +++ OK, passed 100 tests.
  12734. 716.05 s [vector] drop: OK
  12735. 716.05 s [vector] +++ OK, passed 100 tests.
  12736. 716.05 s [vector] splitAt: OK
  12737. 716.05 s [vector] +++ OK, passed 100 tests.
  12738. 716.05 s [vector] empty: OK
  12739. 716.05 s [vector] +++ OK, passed 100 tests.
  12740. 716.05 s [vector] singleton: OK
  12741. 716.05 s [vector] +++ OK, passed 100 tests.
  12742. 716.05 s [vector] replicate: OK
  12743. 716.05 s [vector] +++ OK, passed 100 tests.
  12744. 716.05 s [vector] generate: OK
  12745. 716.06 s [vector] +++ OK, passed 100 tests.
  12746. 716.06 s [vector] iterateN: OK
  12747. 716.06 s [vector] +++ OK, passed 100 tests.
  12748. 716.08 s [vector] iterateNM: OK (0.02s)
  12749. 716.08 s [vector] +++ OK, passed 100 tests.
  12750. 716.10 s [vector] generateM: OK (0.02s)
  12751. 716.10 s [vector] +++ OK, passed 100 tests.
  12752. 716.11 s [vector] replicateM: OK
  12753. 716.11 s [vector] +++ OK, passed 100 tests.
  12754. 716.11 s [vector] create: OK
  12755. 716.11 s [vector] +++ OK, passed 100 tests.
  12756. 716.11 s [vector] createT: OK
  12757. 716.11 s [vector] +++ OK, passed 100 tests.
  12758. 716.11 s [vector] unfoldr: OK
  12759. 716.11 s [vector] +++ OK, passed 100 tests.
  12760. 716.11 s [vector] unfoldrN: OK
  12761. 716.11 s [vector] +++ OK, passed 100 tests.
  12762. 716.11 s [vector] unfoldrExactN: OK
  12763. 716.11 s [vector] +++ OK, passed 100 tests.
  12764. 716.12 s [vector] unfoldrM: OK
  12765. 716.12 s [vector] +++ OK, passed 100 tests.
  12766. 716.12 s [vector] unfoldrNM: OK
  12767. 716.12 s [vector] +++ OK, passed 100 tests.
  12768. 716.14 s [vector] unfoldrExactNM: OK (0.03s)
  12769. 716.14 s [vector] +++ OK, passed 100 tests.
  12770. 716.16 s [vector] constructN: OK
  12771. 716.16 s [vector] +++ OK, passed 100 tests.
  12772. 716.16 s [vector] constructrN: OK
  12773. 716.16 s [vector] +++ OK, passed 100 tests.
  12774. 716.16 s [vector] cons: OK
  12775. 716.16 s [vector] +++ OK, passed 100 tests.
  12776. 716.18 s [vector] snoc: OK
  12777. 716.18 s [vector] +++ OK, passed 100 tests.
  12778. 716.18 s [vector] append: OK
  12779. 716.18 s [vector] +++ OK, passed 100 tests.
  12780. 716.20 s [vector] concat: OK (0.02s)
  12781. 716.20 s [vector] +++ OK, passed 100 tests.
  12782. 716.20 s [vector] force: OK
  12783. 716.20 s [vector] +++ OK, passed 100 tests.
  12784. 716.21 s [vector] upd: OK
  12785. 716.21 s [vector] +++ OK, passed 100 tests.
  12786. 716.22 s [vector] accum: OK
  12787. 716.22 s [vector] +++ OK, passed 100 tests.
  12788. 716.23 s [vector] reverse: OK
  12789. 716.23 s [vector] +++ OK, passed 100 tests.
  12790. 716.23 s [vector] backpermute: OK
  12791. 716.23 s [vector] +++ OK, passed 100 tests.
  12792. 716.23 s [vector] map: OK
  12793. 716.23 s [vector] +++ OK, passed 100 tests.
  12794. 716.24 s [vector] imap: OK
  12795. 716.24 s [vector] +++ OK, passed 100 tests.
  12796. 716.24 s [vector] concatMap: OK
  12797. 716.24 s [vector] +++ OK, passed 100 tests.
  12798. 716.24 s [vector] mapM: OK
  12799. 716.24 s [vector] +++ OK, passed 100 tests.
  12800. 716.25 s [vector] mapM_: OK (0.03s)
  12801. 716.25 s [vector] +++ OK, passed 100 tests.
  12802. 716.25 s [vector] forM: OK
  12803. 716.25 s [vector] +++ OK, passed 100 tests.
  12804. 716.28 s [vector] forM_: OK (0.02s)
  12805. 716.28 s [vector] +++ OK, passed 100 tests.
  12806. 716.30 s [vector] imapM: OK
  12807. 716.30 s [vector] +++ OK, passed 100 tests.
  12808. 716.31 s [vector] imapM_: OK (0.03s)
  12809. 716.31 s [vector] +++ OK, passed 100 tests.
  12810. 716.32 s [vector] zipWith: OK
  12811. 716.32 s [vector] +++ OK, passed 100 tests.
  12812. 716.33 s [vector] zipWith3: OK
  12813. 716.33 s [vector] +++ OK, passed 100 tests.
  12814. 716.33 s [vector] izipWith: OK
  12815. 716.33 s [vector] +++ OK, passed 100 tests.
  12816. 716.34 s [vector] izipWith3: OK
  12817. 716.34 s [vector] +++ OK, passed 100 tests.
  12818. 716.35 s [vector] izipWithM: OK
  12819. 716.35 s [vector] +++ OK, passed 100 tests.
  12820. 716.37 s [vector] izipWithM_: OK
  12821. 716.37 s [vector] +++ OK, passed 100 tests.
  12822. 716.38 s [vector] zipWithM: OK
  12823. 716.38 s [vector] +++ OK, passed 100 tests.
  12824. 716.40 s [vector] zipWithM_: OK (0.02s)
  12825. 716.40 s [vector] +++ OK, passed 100 tests.
  12826. 716.40 s [vector] filter: OK
  12827. 716.41 s [vector] +++ OK, passed 100 tests.
  12828. 716.42 s [vector] ifilter: OK
  12829. 716.42 s [vector] +++ OK, passed 100 tests.
  12830. 716.45 s [vector] filterM: OK (0.04s)
  12831. 716.45 s [vector] +++ OK, passed 100 tests.
  12832. 716.45 s [vector] uniq: OK
  12833. 716.45 s [vector] +++ OK, passed 100 tests.
  12834. 716.45 s [vector] mapMaybe: OK
  12835. 716.45 s [vector] +++ OK, passed 100 tests.
  12836. 716.46 s [vector] imapMaybe: OK
  12837. 716.46 s [vector] +++ OK, passed 100 tests.
  12838. 716.46 s [vector] takeWhile: OK
  12839. 716.46 s [vector] +++ OK, passed 100 tests.
  12840. 716.46 s [vector] dropWhile: OK
  12841. 716.46 s [vector] +++ OK, passed 100 tests.
  12842. 716.47 s [vector] partition: OK
  12843. 716.47 s [vector] +++ OK, passed 100 tests.
  12844. 716.47 s [vector] partitionWith: OK
  12845. 716.47 s [vector] +++ OK, passed 100 tests.
  12846. 716.48 s [vector] span: OK
  12847. 716.48 s [vector] +++ OK, passed 100 tests.
  12848. 716.48 s [vector] break: OK
  12849. 716.48 s [vector] +++ OK, passed 100 tests.
  12850. 716.48 s [vector] spanR: OK
  12851. 716.48 s [vector] +++ OK, passed 100 tests.
  12852. 716.48 s [vector] breakR: OK
  12853. 716.49 s [vector] +++ OK, passed 100 tests.
  12854. 716.50 s [vector] groupBy: OK
  12855. 716.50 s [vector] +++ OK, passed 100 tests.
  12856. 716.51 s [vector] elem: OK
  12857. 716.51 s [vector] +++ OK, passed 100 tests.
  12858. 716.52 s [vector] notElem: OK
  12859. 716.52 s [vector] +++ OK, passed 100 tests.
  12860. 716.52 s [vector] find: OK
  12861. 716.52 s [vector] +++ OK, passed 100 tests.
  12862. 716.52 s [vector] findIndex: OK
  12863. 716.52 s [vector] +++ OK, passed 100 tests.
  12864. 716.52 s [vector] findIndexR: OK
  12865. 716.52 s [vector] +++ OK, passed 100 tests.
  12866. 716.52 s [vector] findIndices: OK
  12867. 716.52 s [vector] +++ OK, passed 100 tests.
  12868. 716.52 s [vector] elemIndex: OK
  12869. 716.52 s [vector] +++ OK, passed 100 tests.
  12870. 716.52 s [vector] elemIndices: OK
  12871. 716.52 s [vector] +++ OK, passed 100 tests.
  12872. 716.52 s [vector] foldl: OK
  12873. 716.52 s [vector] +++ OK, passed 100 tests.
  12874. 716.52 s [vector] foldl1: OK
  12875. 716.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12876. 716.52 s [vector] foldl': OK
  12877. 716.52 s [vector] +++ OK, passed 100 tests.
  12878. 716.53 s [vector] foldl1': OK
  12879. 716.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12880. 716.53 s [vector] foldr: OK
  12881. 716.53 s [vector] +++ OK, passed 100 tests.
  12882. 716.53 s [vector] foldr1: OK
  12883. 716.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12884. 716.53 s [vector] foldr': OK
  12885. 716.53 s [vector] +++ OK, passed 100 tests.
  12886. 716.54 s [vector] foldr1': OK
  12887. 716.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12888. 716.55 s [vector] ifoldl: OK
  12889. 716.55 s [vector] +++ OK, passed 100 tests.
  12890. 716.56 s [vector] ifoldl': OK
  12891. 716.56 s [vector] +++ OK, passed 100 tests.
  12892. 716.56 s [vector] ifoldr: OK
  12893. 716.57 s [vector] +++ OK, passed 100 tests.
  12894. 716.58 s [vector] ifoldr': OK
  12895. 716.58 s [vector] +++ OK, passed 100 tests.
  12896. 716.58 s [vector] ifoldM: OK
  12897. 716.58 s [vector] +++ OK, passed 100 tests.
  12898. 716.58 s [vector] ifoldM': OK
  12899. 716.58 s [vector] +++ OK, passed 100 tests.
  12900. 716.62 s [vector] ifoldM_: OK (0.03s)
  12901. 716.62 s [vector] +++ OK, passed 100 tests.
  12902. 716.65 s [vector] ifoldM'_: OK (0.03s)
  12903. 716.65 s [vector] +++ OK, passed 100 tests.
  12904. 716.65 s [vector] all: OK
  12905. 716.65 s [vector] +++ OK, passed 100 tests.
  12906. 716.65 s [vector] any: OK
  12907. 716.65 s [vector] +++ OK, passed 100 tests.
  12908. 716.66 s [vector] prescanl: OK
  12909. 716.66 s [vector] +++ OK, passed 100 tests.
  12910. 716.68 s [vector] prescanl': OK
  12911. 716.68 s [vector] +++ OK, passed 100 tests.
  12912. 716.68 s [vector] postscanl: OK
  12913. 716.68 s [vector] +++ OK, passed 100 tests.
  12914. 716.68 s [vector] postscanl': OK
  12915. 716.68 s [vector] +++ OK, passed 100 tests.
  12916. 716.70 s [vector] scanl: OK
  12917. 716.70 s [vector] +++ OK, passed 100 tests.
  12918. 716.70 s [vector] scanl': OK
  12919. 716.70 s [vector] +++ OK, passed 100 tests.
  12920. 716.71 s [vector] scanl1: OK
  12921. 716.71 s [vector] +++ OK, passed 100 tests.
  12922. 716.72 s [vector] scanl1': OK (0.01s)
  12923. 716.72 s [vector] +++ OK, passed 100 tests.
  12924. 716.73 s [vector] iscanl: OK
  12925. 716.73 s [vector] +++ OK, passed 100 tests.
  12926. 716.74 s [vector] iscanl': OK
  12927. 716.74 s [vector] +++ OK, passed 100 tests.
  12928. 716.75 s [vector] prescanr: OK
  12929. 716.75 s [vector] +++ OK, passed 100 tests.
  12930. 716.75 s [vector] prescanr': OK
  12931. 716.76 s [vector] +++ OK, passed 100 tests.
  12932. 716.76 s [vector] postscanr: OK
  12933. 716.76 s [vector] +++ OK, passed 100 tests.
  12934. 716.78 s [vector] postscanr': OK
  12935. 716.78 s [vector] +++ OK, passed 100 tests.
  12936. 716.79 s [vector] scanr: OK
  12937. 716.79 s [vector] +++ OK, passed 100 tests.
  12938. 716.79 s [vector] scanr': OK
  12939. 716.79 s [vector] +++ OK, passed 100 tests.
  12940. 716.79 s [vector] scanr1: OK
  12941. 716.79 s [vector] +++ OK, passed 100 tests.
  12942. 716.80 s [vector] scanr1': OK
  12943. 716.80 s [vector] +++ OK, passed 100 tests.
  12944. 716.81 s [vector] iscanr: OK
  12945. 716.81 s [vector] +++ OK, passed 100 tests.
  12946. 716.81 s [vector] iscanr': OK
  12947. 716.82 s [vector] +++ OK, passed 100 tests.
  12948. 716.82 s [vector] mut_read: OK
  12949. 716.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12950. 716.82 s [vector] mut_write: OK
  12951. 716.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12952. 716.82 s [vector] mut_modify: OK
  12953. 716.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12954. 716.82 s [vector] mut_generate: OK
  12955. 716.82 s [vector] +++ OK, passed 100 tests.
  12956. 716.84 s [vector] mut_generateM: OK (0.01s)
  12957. 716.84 s [vector] +++ OK, passed 100 tests.
  12958. 716.88 s [vector] mut_mapM_: OK (0.05s)
  12959. 716.88 s [vector] +++ OK, passed 100 tests.
  12960. 716.94 s [vector] mut_imapM_: OK (0.04s)
  12961. 716.94 s [vector] +++ OK, passed 100 tests.
  12962. 716.96 s [vector] mut_forM_: OK (0.03s)
  12963. 716.96 s [vector] +++ OK, passed 100 tests.
  12964. 716.99 s [vector] mut_iforM_: OK (0.03s)
  12965. 717.00 s [vector] +++ OK, passed 100 tests.
  12966. 717.00 s [vector] mut_foldr: OK
  12967. 717.01 s [vector] +++ OK, passed 100 tests.
  12968. 717.01 s [vector] mut_foldr': OK
  12969. 717.01 s [vector] +++ OK, passed 100 tests.
  12970. 717.02 s [vector] mut_foldl: OK
  12971. 717.02 s [vector] +++ OK, passed 100 tests.
  12972. 717.03 s [vector] mut_foldl': OK
  12973. 717.03 s [vector] +++ OK, passed 100 tests.
  12974. 717.04 s [vector] mut_ifoldr: OK
  12975. 717.04 s [vector] +++ OK, passed 100 tests.
  12976. 717.04 s [vector] mut_ifoldr': OK
  12977. 717.05 s [vector] +++ OK, passed 100 tests.
  12978. 717.05 s [vector] mut_ifoldl: OK
  12979. 717.05 s [vector] +++ OK, passed 100 tests.
  12980. 717.06 s [vector] mut_ifoldl': OK
  12981. 717.06 s [vector] +++ OK, passed 100 tests.
  12982. 717.07 s [vector] mut_foldM: OK
  12983. 717.07 s [vector] +++ OK, passed 100 tests.
  12984. 717.08 s [vector] mut_foldM': OK
  12985. 717.08 s [vector] +++ OK, passed 100 tests.
  12986. 717.09 s [vector] mut_foldrM: OK
  12987. 717.09 s [vector] +++ OK, passed 100 tests.
  12988. 717.10 s [vector] mut_foldrM': OK
  12989. 717.10 s [vector] +++ OK, passed 100 tests.
  12990. 717.10 s [vector] mut_ifoldM: OK
  12991. 717.10 s [vector] +++ OK, passed 100 tests.
  12992. 717.10 s [vector] mut_ifoldM': OK
  12993. 717.10 s [vector] +++ OK, passed 100 tests.
  12994. 717.10 s [vector] mut_ifoldrM: OK
  12995. 717.10 s [vector] +++ OK, passed 100 tests.
  12996. 717.10 s [vector] mut_ifoldrM': OK
  12997. 717.10 s [vector] +++ OK, passed 100 tests.
  12998. 717.10 s [vector] compare: OK
  12999. 717.10 s [vector] +++ OK, passed 100 tests.
  13000. 717.10 s [vector] maximum: OK
  13001. 717.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13002. 717.10 s [vector] minimum: OK
  13003. 717.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13004. 717.10 s [vector] minIndex: OK
  13005. 717.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13006. 717.10 s [vector] maxIndex: OK
  13007. 717.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13008. 717.10 s [vector] maximumBy: OK
  13009. 717.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13010. 717.10 s [vector] minimumBy: OK
  13011. 717.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13012. 717.10 s [vector] maximumOn: OK
  13013. 717.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13014. 717.10 s [vector] minimumOn: OK
  13015. 717.10 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13016. 717.11 s [vector] maxIndexBy: OK
  13017. 717.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13018. 717.11 s [vector] minIndexBy: OK
  13019. 717.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13020. 717.11 s [vector] ListFirstMaxIndexWins: OK
  13021. 717.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13022. 717.11 s [vector] FalseListFirstMaxIndexWins: OK
  13023. 717.11 s [vector] +++ OK, failed as expected. (after 1 test):
  13024. 717.11 s [vector] Exception:
  13025. 717.11 s [vector] Prelude.foldr1: empty list
  13026. 717.11 s [vector] CallStack (from HasCallStack):
  13027. 717.11 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13028. 717.11 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13029. 717.11 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13030. 717.11 s [vector] []
  13031. 717.11 s [vector] zip: OK
  13032. 717.11 s [vector] +++ OK, passed 100 tests.
  13033. 717.12 s [vector] zip3: OK
  13034. 717.12 s [vector] +++ OK, passed 100 tests.
  13035. 717.12 s [vector] unzip: OK
  13036. 717.12 s [vector] +++ OK, passed 100 tests.
  13037. 717.12 s [vector] unzip3: OK
  13038. 717.12 s [vector] +++ OK, passed 100 tests.
  13039. 717.13 s [vector] indexed: OK
  13040. 717.13 s [vector] +++ OK, passed 100 tests.
  13041. 717.13 s [vector] update: OK
  13042. 717.13 s [vector] +++ OK, passed 100 tests.
  13043. 717.13 s [vector] mempty: OK
  13044. 717.13 s [vector] +++ OK, passed 100 tests.
  13045. 717.13 s [vector] mappend: OK
  13046. 717.14 s [vector] +++ OK, passed 100 tests.
  13047. 717.19 s [vector] mconcat: OK (0.05s)
  13048. 717.19 s [vector] +++ OK, passed 100 tests.
  13049. 717.19 s [vector] glength: OK
  13050. 717.19 s [vector] +++ OK, passed 100 tests.
  13051. 717.19 s [vector] sum: OK
  13052. 717.19 s [vector] +++ OK, passed 100 tests.
  13053. 717.19 s [vector] product: OK
  13054. 717.19 s [vector] +++ OK, passed 100 tests.
  13055. 717.19 s [vector] enumFromN: OK
  13056. 717.19 s [vector] +++ OK, passed 100 tests.
  13057. 717.19 s [vector] enumFromThenN: OK
  13058. 717.19 s [vector] +++ OK, passed 100 tests.
  13059. 717.19 s [vector] enumFromTo: OK
  13060. 717.19 s [vector] +++ OK, passed 100 tests.
  13061. 717.19 s [vector] enumFromThenTo: OK
  13062. 717.19 s [vector] +++ OK, passed 100 tests; 4 discarded.
  13063. 717.19 s [vector] (Double)
  13064. 717.19 s [vector] fromList.toList == id: OK
  13065. 717.20 s [vector] +++ OK, passed 100 tests.
  13066. 717.20 s [vector] toList.fromList == id: OK
  13067. 717.20 s [vector] +++ OK, passed 100 tests.
  13068. 717.20 s [vector] unstream.stream == id: OK
  13069. 717.20 s [vector] +++ OK, passed 100 tests.
  13070. 717.20 s [vector] stream.unstream == id: OK
  13071. 717.20 s [vector] +++ OK, passed 100 tests.
  13072. 717.20 s [vector] eq: OK
  13073. 717.20 s [vector] +++ OK, passed 100 tests.
  13074. 717.20 s [vector] length: OK
  13075. 717.20 s [vector] +++ OK, passed 100 tests.
  13076. 717.20 s [vector] null: OK
  13077. 717.20 s [vector] +++ OK, passed 100 tests.
  13078. 717.20 s [vector] index: OK
  13079. 717.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13080. 717.21 s [vector] safeIndex: OK
  13081. 717.21 s [vector] +++ OK, passed 100 tests.
  13082. 717.21 s [vector] head: OK
  13083. 717.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13084. 717.21 s [vector] last: OK
  13085. 717.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13086. 717.21 s [vector] unsafeIndex: OK
  13087. 717.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13088. 717.21 s [vector] unsafeHead: OK
  13089. 717.21 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13090. 717.21 s [vector] unsafeLast: OK
  13091. 717.22 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13092. 717.22 s [vector] slice: OK
  13093. 717.22 s [vector] +++ OK, passed 100 tests.
  13094. 717.22 s [vector] init: OK
  13095. 717.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13096. 717.22 s [vector] tail: OK
  13097. 717.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13098. 717.22 s [vector] take: OK
  13099. 717.22 s [vector] +++ OK, passed 100 tests.
  13100. 717.22 s [vector] drop: OK
  13101. 717.22 s [vector] +++ OK, passed 100 tests.
  13102. 717.22 s [vector] splitAt: OK
  13103. 717.22 s [vector] +++ OK, passed 100 tests.
  13104. 717.22 s [vector] empty: OK
  13105. 717.22 s [vector] +++ OK, passed 100 tests.
  13106. 717.22 s [vector] singleton: OK
  13107. 717.22 s [vector] +++ OK, passed 100 tests.
  13108. 717.22 s [vector] replicate: OK
  13109. 717.22 s [vector] +++ OK, passed 100 tests.
  13110. 717.22 s [vector] generate: OK
  13111. 717.23 s [vector] +++ OK, passed 100 tests.
  13112. 717.24 s [vector] iterateN: OK
  13113. 717.24 s [vector] +++ OK, passed 100 tests.
  13114. 717.24 s [vector] iterateNM: OK (0.01s)
  13115. 717.24 s [vector] +++ OK, passed 100 tests.
  13116. 717.26 s [vector] generateM: OK (0.02s)
  13117. 717.26 s [vector] +++ OK, passed 100 tests.
  13118. 717.27 s [vector] replicateM: OK
  13119. 717.27 s [vector] +++ OK, passed 100 tests.
  13120. 717.27 s [vector] create: OK
  13121. 717.27 s [vector] +++ OK, passed 100 tests.
  13122. 717.28 s [vector] createT: OK
  13123. 717.28 s [vector] +++ OK, passed 100 tests.
  13124. 717.28 s [vector] unfoldr: OK
  13125. 717.28 s [vector] +++ OK, passed 100 tests.
  13126. 717.28 s [vector] unfoldrN: OK
  13127. 717.28 s [vector] +++ OK, passed 100 tests.
  13128. 717.28 s [vector] unfoldrExactN: OK
  13129. 717.28 s [vector] +++ OK, passed 100 tests.
  13130. 717.28 s [vector] unfoldrM: OK
  13131. 717.28 s [vector] +++ OK, passed 100 tests.
  13132. 717.28 s [vector] unfoldrNM: OK
  13133. 717.28 s [vector] +++ OK, passed 100 tests.
  13134. 717.32 s [vector] unfoldrExactNM: OK (0.03s)
  13135. 717.32 s [vector] +++ OK, passed 100 tests.
  13136. 717.34 s [vector] constructN: OK (0.02s)
  13137. 717.35 s [vector] +++ OK, passed 100 tests.
  13138. 717.35 s [vector] constructrN: OK (0.01s)
  13139. 717.35 s [vector] +++ OK, passed 100 tests.
  13140. 717.36 s [vector] cons: OK
  13141. 717.36 s [vector] +++ OK, passed 100 tests.
  13142. 717.36 s [vector] snoc: OK
  13143. 717.36 s [vector] +++ OK, passed 100 tests.
  13144. 717.36 s [vector] append: OK
  13145. 717.36 s [vector] +++ OK, passed 100 tests.
  13146. 717.37 s [vector] concat: OK (0.03s)
  13147. 717.37 s [vector] +++ OK, passed 100 tests.
  13148. 717.38 s [vector] force: OK
  13149. 717.38 s [vector] +++ OK, passed 100 tests.
  13150. 717.38 s [vector] upd: OK
  13151. 717.38 s [vector] +++ OK, passed 100 tests.
  13152. 717.39 s [vector] accum: OK (0.01s)
  13153. 717.39 s [vector] +++ OK, passed 100 tests.
  13154. 717.39 s [vector] reverse: OK
  13155. 717.39 s [vector] +++ OK, passed 100 tests.
  13156. 717.40 s [vector] backpermute: OK
  13157. 717.40 s [vector] +++ OK, passed 100 tests.
  13158. 717.41 s [vector] map: OK (0.01s)
  13159. 717.42 s [vector] +++ OK, passed 100 tests.
  13160. 717.42 s [vector] imap: OK
  13161. 717.42 s [vector] +++ OK, passed 100 tests.
  13162. 717.42 s [vector] concatMap: OK
  13163. 717.42 s [vector] +++ OK, passed 100 tests.
  13164. 717.44 s [vector] mapM: OK
  13165. 717.44 s [vector] +++ OK, passed 100 tests.
  13166. 717.46 s [vector] mapM_: OK (0.03s)
  13167. 717.46 s [vector] +++ OK, passed 100 tests.
  13168. 717.47 s [vector] forM: OK
  13169. 717.47 s [vector] +++ OK, passed 100 tests.
  13170. 717.51 s [vector] forM_: OK (0.04s)
  13171. 717.51 s [vector] +++ OK, passed 100 tests.
  13172. 717.52 s [vector] imapM: OK
  13173. 717.52 s [vector] +++ OK, passed 100 tests.
  13174. 717.54 s [vector] imapM_: OK (0.03s)
  13175. 717.54 s [vector] +++ OK, passed 100 tests.
  13176. 717.56 s [vector] zipWith: OK
  13177. 717.56 s [vector] +++ OK, passed 100 tests.
  13178. 717.58 s [vector] zipWith3: OK (0.01s)
  13179. 717.58 s [vector] +++ OK, passed 100 tests.
  13180. 717.58 s [vector] izipWith: OK (0.01s)
  13181. 717.58 s [vector] +++ OK, passed 100 tests.
  13182. 717.60 s [vector] izipWith3: OK (0.01s)
  13183. 717.60 s [vector] +++ OK, passed 100 tests.
  13184. 717.62 s [vector] izipWithM: OK (0.01s)
  13185. 717.62 s [vector] +++ OK, passed 100 tests.
  13186. 717.66 s [vector] izipWithM_: OK (0.04s)
  13187. 717.66 s [vector] +++ OK, passed 100 tests.
  13188. 717.66 s [vector] zipWithM: OK (0.02s)
  13189. 717.66 s [vector] +++ OK, passed 100 tests.
  13190. 717.70 s [vector] zipWithM_: OK (0.03s)
  13191. 717.70 s [vector] +++ OK, passed 100 tests.
  13192. 717.70 s [vector] filter: OK
  13193. 717.70 s [vector] +++ OK, passed 100 tests.
  13194. 717.72 s [vector] ifilter: OK (0.01s)
  13195. 717.72 s [vector] +++ OK, passed 100 tests.
  13196. 717.77 s [vector] filterM: OK (0.06s)
  13197. 717.78 s [vector] +++ OK, passed 100 tests.
  13198. 717.78 s [vector] uniq: OK
  13199. 717.78 s [vector] +++ OK, passed 100 tests.
  13200. 717.78 s [vector] mapMaybe: OK
  13201. 717.78 s [vector] +++ OK, passed 100 tests.
  13202. 717.78 s [vector] imapMaybe: OK
  13203. 717.78 s [vector] +++ OK, passed 100 tests.
  13204. 717.79 s [vector] takeWhile: OK
  13205. 717.79 s [vector] +++ OK, passed 100 tests.
  13206. 717.79 s [vector] dropWhile: OK
  13207. 717.79 s [vector] +++ OK, passed 100 tests.
  13208. 717.80 s [vector] partition: OK
  13209. 717.80 s [vector] +++ OK, passed 100 tests.
  13210. 717.81 s [vector] partitionWith: OK
  13211. 717.81 s [vector] +++ OK, passed 100 tests.
  13212. 717.81 s [vector] span: OK
  13213. 717.81 s [vector] +++ OK, passed 100 tests.
  13214. 717.81 s [vector] break: OK
  13215. 717.81 s [vector] +++ OK, passed 100 tests.
  13216. 717.82 s [vector] spanR: OK
  13217. 717.82 s [vector] +++ OK, passed 100 tests.
  13218. 717.82 s [vector] breakR: OK
  13219. 717.82 s [vector] +++ OK, passed 100 tests.
  13220. 717.82 s [vector] groupBy: OK
  13221. 717.82 s [vector] +++ OK, passed 100 tests.
  13222. 717.82 s [vector] elem: OK
  13223. 717.82 s [vector] +++ OK, passed 100 tests.
  13224. 717.82 s [vector] notElem: OK
  13225. 717.82 s [vector] +++ OK, passed 100 tests.
  13226. 717.82 s [vector] find: OK
  13227. 717.83 s [vector] +++ OK, passed 100 tests.
  13228. 717.83 s [vector] findIndex: OK
  13229. 717.83 s [vector] +++ OK, passed 100 tests.
  13230. 717.83 s [vector] findIndexR: OK
  13231. 717.83 s [vector] +++ OK, passed 100 tests.
  13232. 717.83 s [vector] findIndices: OK
  13233. 717.83 s [vector] +++ OK, passed 100 tests.
  13234. 717.84 s [vector] elemIndex: OK
  13235. 717.84 s [vector] +++ OK, passed 100 tests.
  13236. 717.84 s [vector] elemIndices: OK
  13237. 717.84 s [vector] +++ OK, passed 100 tests.
  13238. 717.86 s [vector] foldl: OK (0.01s)
  13239. 717.86 s [vector] +++ OK, passed 100 tests.
  13240. 717.88 s [vector] foldl1: OK (0.01s)
  13241. 717.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13242. 717.88 s [vector] foldl': OK (0.01s)
  13243. 717.88 s [vector] +++ OK, passed 100 tests.
  13244. 717.90 s [vector] foldl1': OK (0.01s)
  13245. 717.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13246. 717.91 s [vector] foldr: OK (0.01s)
  13247. 717.91 s [vector] +++ OK, passed 100 tests.
  13248. 717.92 s [vector] foldr1: OK (0.01s)
  13249. 717.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13250. 717.94 s [vector] foldr': OK (0.01s)
  13251. 717.94 s [vector] +++ OK, passed 100 tests.
  13252. 717.94 s [vector] foldr1': OK (0.01s)
  13253. 717.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13254. 717.96 s [vector] ifoldl: OK (0.01s)
  13255. 717.96 s [vector] +++ OK, passed 100 tests.
  13256. 717.98 s [vector] ifoldl': OK (0.01s)
  13257. 717.98 s [vector] +++ OK, passed 100 tests.
  13258. 717.98 s [vector] ifoldr: OK (0.01s)
  13259. 717.99 s [vector] +++ OK, passed 100 tests.
  13260. 718.00 s [vector] ifoldr': OK (0.02s)
  13261. 718.00 s [vector] +++ OK, passed 100 tests.
  13262. 718.02 s [vector] ifoldM: OK (0.02s)
  13263. 718.02 s [vector] +++ OK, passed 100 tests.
  13264. 718.04 s [vector] ifoldM': OK (0.02s)
  13265. 718.04 s [vector] +++ OK, passed 100 tests.
  13266. 718.08 s [vector] ifoldM_: OK (0.02s)
  13267. 718.08 s [vector] +++ OK, passed 100 tests.
  13268. 718.10 s [vector] ifoldM'_: OK (0.03s)
  13269. 718.10 s [vector] +++ OK, passed 100 tests.
  13270. 718.10 s [vector] all: OK
  13271. 718.10 s [vector] +++ OK, passed 100 tests.
  13272. 718.10 s [vector] any: OK
  13273. 718.10 s [vector] +++ OK, passed 100 tests.
  13274. 718.12 s [vector] prescanl: OK (0.01s)
  13275. 718.12 s [vector] +++ OK, passed 100 tests.
  13276. 718.14 s [vector] prescanl': OK (0.01s)
  13277. 718.14 s [vector] +++ OK, passed 100 tests.
  13278. 718.14 s [vector] postscanl: OK (0.01s)
  13279. 718.14 s [vector] +++ OK, passed 100 tests.
  13280. 718.16 s [vector] postscanl': OK (0.02s)
  13281. 718.16 s [vector] +++ OK, passed 100 tests.
  13282. 718.18 s [vector] scanl: OK (0.02s)
  13283. 718.18 s [vector] +++ OK, passed 100 tests.
  13284. 718.20 s [vector] scanl': OK (0.02s)
  13285. 718.20 s [vector] +++ OK, passed 100 tests.
  13286. 718.22 s [vector] scanl1: OK (0.02s)
  13287. 718.22 s [vector] +++ OK, passed 100 tests.
  13288. 718.24 s [vector] scanl1': OK (0.02s)
  13289. 718.24 s [vector] +++ OK, passed 100 tests.
  13290. 718.26 s [vector] iscanl: OK (0.01s)
  13291. 718.26 s [vector] +++ OK, passed 100 tests.
  13292. 718.26 s [vector] iscanl': OK (0.01s)
  13293. 718.26 s [vector] +++ OK, passed 100 tests.
  13294. 718.28 s [vector] prescanr: OK (0.01s)
  13295. 718.28 s [vector] +++ OK, passed 100 tests.
  13296. 718.30 s [vector] prescanr': OK (0.01s)
  13297. 718.30 s [vector] +++ OK, passed 100 tests.
  13298. 718.30 s [vector] postscanr: OK (0.01s)
  13299. 718.30 s [vector] +++ OK, passed 100 tests.
  13300. 718.32 s [vector] postscanr': OK (0.02s)
  13301. 718.32 s [vector] +++ OK, passed 100 tests.
  13302. 718.36 s [vector] scanr: OK (0.02s)
  13303. 718.36 s [vector] +++ OK, passed 100 tests.
  13304. 718.38 s [vector] scanr': OK (0.02s)
  13305. 718.38 s [vector] +++ OK, passed 100 tests.
  13306. 718.40 s [vector] scanr1: OK (0.03s)
  13307. 718.40 s [vector] +++ OK, passed 100 tests.
  13308. 718.42 s [vector] scanr1': OK (0.03s)
  13309. 718.42 s [vector] +++ OK, passed 100 tests.
  13310. 718.46 s [vector] iscanr: OK (0.03s)
  13311. 718.46 s [vector] +++ OK, passed 100 tests.
  13312. 718.48 s [vector] iscanr': OK (0.03s)
  13313. 718.48 s [vector] +++ OK, passed 100 tests.
  13314. 718.48 s [vector] mut_read: OK
  13315. 718.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13316. 718.48 s [vector] mut_write: OK
  13317. 718.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13318. 718.49 s [vector] mut_modify: OK
  13319. 718.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13320. 718.49 s [vector] mut_generate: OK
  13321. 718.49 s [vector] +++ OK, passed 100 tests.
  13322. 718.51 s [vector] mut_generateM: OK
  13323. 718.51 s [vector] +++ OK, passed 100 tests.
  13324. 718.54 s [vector] mut_mapM_: OK (0.03s)
  13325. 718.54 s [vector] +++ OK, passed 100 tests.
  13326. 718.58 s [vector] mut_imapM_: OK (0.03s)
  13327. 718.58 s [vector] +++ OK, passed 100 tests.
  13328. 718.60 s [vector] mut_forM_: OK (0.03s)
  13329. 718.60 s [vector] +++ OK, passed 100 tests.
  13330. 718.64 s [vector] mut_iforM_: OK (0.03s)
  13331. 718.64 s [vector] +++ OK, passed 100 tests.
  13332. 718.67 s [vector] mut_foldr: OK (0.01s)
  13333. 718.67 s [vector] +++ OK, passed 100 tests.
  13334. 718.68 s [vector] mut_foldr': OK (0.03s)
  13335. 718.68 s [vector] +++ OK, passed 100 tests.
  13336. 718.70 s [vector] mut_foldl: OK (0.03s)
  13337. 718.70 s [vector] +++ OK, passed 100 tests.
  13338. 718.72 s [vector] mut_foldl': OK (0.02s)
  13339. 718.72 s [vector] +++ OK, passed 100 tests.
  13340. 718.74 s [vector] mut_ifoldr: OK (0.02s)
  13341. 718.74 s [vector] +++ OK, passed 100 tests.
  13342. 718.78 s [vector] mut_ifoldr': OK (0.02s)
  13343. 718.78 s [vector] +++ OK, passed 100 tests.
  13344. 718.80 s [vector] mut_ifoldl: OK (0.02s)
  13345. 718.80 s [vector] +++ OK, passed 100 tests.
  13346. 718.80 s [vector] mut_ifoldl': OK (0.01s)
  13347. 718.80 s [vector] +++ OK, passed 100 tests.
  13348. 718.82 s [vector] mut_foldM: OK (0.02s)
  13349. 718.82 s [vector] +++ OK, passed 100 tests.
  13350. 718.84 s [vector] mut_foldM': OK (0.01s)
  13351. 718.84 s [vector] +++ OK, passed 100 tests.
  13352. 718.86 s [vector] mut_foldrM: OK (0.01s)
  13353. 718.86 s [vector] +++ OK, passed 100 tests.
  13354. 718.86 s [vector] mut_foldrM': OK (0.01s)
  13355. 718.86 s [vector] +++ OK, passed 100 tests.
  13356. 718.88 s [vector] mut_ifoldM: OK (0.01s)
  13357. 718.88 s [vector] +++ OK, passed 100 tests.
  13358. 718.89 s [vector] mut_ifoldM': OK (0.01s)
  13359. 718.89 s [vector] +++ OK, passed 100 tests.
  13360. 718.90 s [vector] mut_ifoldrM: OK (0.01s)
  13361. 718.90 s [vector] +++ OK, passed 100 tests.
  13362. 718.91 s [vector] mut_ifoldrM': OK (0.01s)
  13363. 718.91 s [vector] +++ OK, passed 100 tests.
  13364. 718.91 s [vector] compare: OK
  13365. 718.91 s [vector] +++ OK, passed 100 tests.
  13366. 718.91 s [vector] maximum: OK
  13367. 718.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13368. 718.91 s [vector] minimum: OK
  13369. 718.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13370. 718.91 s [vector] minIndex: OK
  13371. 718.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13372. 718.91 s [vector] maxIndex: OK
  13373. 718.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13374. 718.91 s [vector] maximumBy: OK
  13375. 718.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13376. 718.91 s [vector] minimumBy: OK
  13377. 718.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13378. 718.91 s [vector] maximumOn: OK
  13379. 718.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13380. 718.91 s [vector] minimumOn: OK
  13381. 718.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13382. 718.92 s [vector] maxIndexBy: OK
  13383. 718.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13384. 718.92 s [vector] minIndexBy: OK
  13385. 718.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13386. 718.92 s [vector] ListFirstMaxIndexWins: OK
  13387. 718.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13388. 718.92 s [vector] FalseListFirstMaxIndexWins: OK
  13389. 718.92 s [vector] +++ OK, failed as expected. (after 1 test):
  13390. 718.92 s [vector] Exception:
  13391. 718.92 s [vector] Prelude.foldr1: empty list
  13392. 718.92 s [vector] CallStack (from HasCallStack):
  13393. 718.92 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13394. 718.92 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13395. 718.92 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13396. 718.92 s [vector] []
  13397. 718.92 s [vector] zip: OK
  13398. 718.92 s [vector] +++ OK, passed 100 tests.
  13399. 718.92 s [vector] zip3: OK
  13400. 718.92 s [vector] +++ OK, passed 100 tests.
  13401. 718.92 s [vector] unzip: OK
  13402. 718.92 s [vector] +++ OK, passed 100 tests.
  13403. 718.93 s [vector] unzip3: OK
  13404. 718.93 s [vector] +++ OK, passed 100 tests.
  13405. 718.93 s [vector] indexed: OK
  13406. 718.93 s [vector] +++ OK, passed 100 tests.
  13407. 718.93 s [vector] update: OK
  13408. 718.93 s [vector] +++ OK, passed 100 tests.
  13409. 718.93 s [vector] mempty: OK
  13410. 718.93 s [vector] +++ OK, passed 100 tests.
  13411. 718.93 s [vector] mappend: OK
  13412. 718.94 s [vector] +++ OK, passed 100 tests.
  13413. 718.96 s [vector] mconcat: OK (0.02s)
  13414. 718.96 s [vector] +++ OK, passed 100 tests.
  13415. 718.96 s [vector] glength: OK
  13416. 718.96 s [vector] +++ OK, passed 100 tests.
  13417. 718.96 s [vector] sum: OK
  13418. 718.96 s [vector] +++ OK, passed 100 tests.
  13419. 718.96 s [vector] product: OK
  13420. 718.96 s [vector] +++ OK, passed 100 tests.
  13421. 718.96 s [vector] enumFromN: OK
  13422. 718.96 s [vector] +++ OK, passed 100 tests.
  13423. 718.96 s [vector] enumFromThenN: OK
  13424. 718.96 s [vector] +++ OK, passed 100 tests.
  13425. 718.96 s [vector] enumFromTo: OK
  13426. 718.96 s [vector] +++ OK, passed 100 tests.
  13427. 718.96 s [vector] enumFromThenTo: OK
  13428. 718.96 s [vector] +++ OK, passed 100 tests; 1 discarded.
  13429. 718.96 s [vector] (Int,Bool)
  13430. 718.96 s [vector] fromList.toList == id: OK
  13431. 718.96 s [vector] +++ OK, passed 100 tests.
  13432. 718.96 s [vector] toList.fromList == id: OK
  13433. 718.96 s [vector] +++ OK, passed 100 tests.
  13434. 718.96 s [vector] unstream.stream == id: OK
  13435. 718.96 s [vector] +++ OK, passed 100 tests.
  13436. 718.96 s [vector] stream.unstream == id: OK
  13437. 718.96 s [vector] +++ OK, passed 100 tests.
  13438. 718.96 s [vector] eq: OK
  13439. 718.96 s [vector] +++ OK, passed 100 tests.
  13440. 718.96 s [vector] length: OK
  13441. 718.96 s [vector] +++ OK, passed 100 tests.
  13442. 718.96 s [vector] null: OK
  13443. 718.97 s [vector] +++ OK, passed 100 tests.
  13444. 718.97 s [vector] index: OK
  13445. 718.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13446. 718.97 s [vector] safeIndex: OK
  13447. 718.97 s [vector] +++ OK, passed 100 tests.
  13448. 718.97 s [vector] head: OK
  13449. 718.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13450. 718.97 s [vector] last: OK
  13451. 718.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13452. 718.98 s [vector] unsafeIndex: OK
  13453. 718.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13454. 718.98 s [vector] unsafeHead: OK
  13455. 718.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13456. 718.98 s [vector] unsafeLast: OK
  13457. 718.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13458. 718.98 s [vector] slice: OK
  13459. 718.98 s [vector] +++ OK, passed 100 tests.
  13460. 718.98 s [vector] init: OK
  13461. 718.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13462. 718.99 s [vector] tail: OK
  13463. 718.99 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13464. 718.99 s [vector] take: OK
  13465. 718.99 s [vector] +++ OK, passed 100 tests.
  13466. 718.99 s [vector] drop: OK
  13467. 718.99 s [vector] +++ OK, passed 100 tests.
  13468. 718.99 s [vector] splitAt: OK
  13469. 718.99 s [vector] +++ OK, passed 100 tests.
  13470. 718.99 s [vector] empty: OK
  13471. 718.99 s [vector] +++ OK, passed 100 tests.
  13472. 719.00 s [vector] singleton: OK
  13473. 719.00 s [vector] +++ OK, passed 100 tests.
  13474. 719.00 s [vector] replicate: OK
  13475. 719.00 s [vector] +++ OK, passed 100 tests.
  13476. 719.00 s [vector] generate: OK
  13477. 719.00 s [vector] +++ OK, passed 100 tests.
  13478. 719.01 s [vector] iterateN: OK
  13479. 719.01 s [vector] +++ OK, passed 100 tests.
  13480. 719.01 s [vector] iterateNM: OK (0.02s)
  13481. 719.01 s [vector] +++ OK, passed 100 tests.
  13482. 719.02 s [vector] generateM: OK (0.02s)
  13483. 719.02 s [vector] +++ OK, passed 100 tests.
  13484. 719.04 s [vector] replicateM: OK (0.02s)
  13485. 719.04 s [vector] +++ OK, passed 100 tests.
  13486. 719.04 s [vector] create: OK
  13487. 719.04 s [vector] +++ OK, passed 100 tests.
  13488. 719.05 s [vector] createT: OK
  13489. 719.05 s [vector] +++ OK, passed 100 tests.
  13490. 719.05 s [vector] unfoldr: OK
  13491. 719.05 s [vector] +++ OK, passed 100 tests.
  13492. 719.05 s [vector] unfoldrN: OK
  13493. 719.05 s [vector] +++ OK, passed 100 tests.
  13494. 719.05 s [vector] unfoldrExactN: OK
  13495. 719.05 s [vector] +++ OK, passed 100 tests.
  13496. 719.05 s [vector] unfoldrM: OK
  13497. 719.06 s [vector] +++ OK, passed 100 tests.
  13498. 719.06 s [vector] unfoldrNM: OK
  13499. 719.06 s [vector] +++ OK, passed 100 tests.
  13500. 719.07 s [vector] unfoldrExactNM: OK (0.01s)
  13501. 719.07 s [vector] +++ OK, passed 100 tests.
  13502. 719.07 s [vector] constructN: OK
  13503. 719.08 s [vector] +++ OK, passed 100 tests.
  13504. 719.08 s [vector] constructrN: OK
  13505. 719.08 s [vector] +++ OK, passed 100 tests.
  13506. 719.08 s [vector] cons: OK
  13507. 719.08 s [vector] +++ OK, passed 100 tests.
  13508. 719.08 s [vector] snoc: OK
  13509. 719.08 s [vector] +++ OK, passed 100 tests.
  13510. 719.08 s [vector] append: OK
  13511. 719.08 s [vector] +++ OK, passed 100 tests.
  13512. 719.12 s [vector] concat: OK (0.03s)
  13513. 719.12 s [vector] +++ OK, passed 100 tests.
  13514. 719.12 s [vector] force: OK
  13515. 719.12 s [vector] +++ OK, passed 100 tests.
  13516. 719.12 s [vector] upd: OK
  13517. 719.12 s [vector] +++ OK, passed 100 tests.
  13518. 719.13 s [vector] accum: OK
  13519. 719.13 s [vector] +++ OK, passed 100 tests.
  13520. 719.13 s [vector] reverse: OK
  13521. 719.13 s [vector] +++ OK, passed 100 tests.
  13522. 719.13 s [vector] backpermute: OK
  13523. 719.13 s [vector] +++ OK, passed 100 tests.
  13524. 719.14 s [vector] map: OK
  13525. 719.14 s [vector] +++ OK, passed 100 tests.
  13526. 719.14 s [vector] imap: OK
  13527. 719.14 s [vector] +++ OK, passed 100 tests.
  13528. 719.14 s [vector] concatMap: OK
  13529. 719.14 s [vector] +++ OK, passed 100 tests.
  13530. 719.15 s [vector] mapM: OK
  13531. 719.15 s [vector] +++ OK, passed 100 tests.
  13532. 719.17 s [vector] mapM_: OK (0.02s)
  13533. 719.17 s [vector] +++ OK, passed 100 tests.
  13534. 719.18 s [vector] forM: OK
  13535. 719.18 s [vector] +++ OK, passed 100 tests.
  13536. 719.20 s [vector] forM_: OK (0.02s)
  13537. 719.20 s [vector] +++ OK, passed 100 tests.
  13538. 719.20 s [vector] imapM: OK
  13539. 719.20 s [vector] +++ OK, passed 100 tests.
  13540. 719.23 s [vector] imapM_: OK (0.03s)
  13541. 719.23 s [vector] +++ OK, passed 100 tests.
  13542. 719.24 s [vector] zipWith: OK
  13543. 719.24 s [vector] +++ OK, passed 100 tests.
  13544. 719.24 s [vector] zipWith3: OK
  13545. 719.24 s [vector] +++ OK, passed 100 tests.
  13546. 719.24 s [vector] izipWith: OK
  13547. 719.24 s [vector] +++ OK, passed 100 tests.
  13548. 719.24 s [vector] izipWith3: OK
  13549. 719.24 s [vector] +++ OK, passed 100 tests.
  13550. 719.25 s [vector] izipWithM: OK
  13551. 719.25 s [vector] +++ OK, passed 100 tests.
  13552. 719.28 s [vector] izipWithM_: OK (0.02s)
  13553. 719.28 s [vector] +++ OK, passed 100 tests.
  13554. 719.28 s [vector] zipWithM: OK
  13555. 719.28 s [vector] +++ OK, passed 100 tests.
  13556. 719.29 s [vector] zipWithM_: OK (0.02s)
  13557. 719.30 s [vector] +++ OK, passed 100 tests.
  13558. 719.30 s [vector] filter: OK
  13559. 719.30 s [vector] +++ OK, passed 100 tests.
  13560. 719.30 s [vector] ifilter: OK
  13561. 719.31 s [vector] +++ OK, passed 100 tests.
  13562. 719.34 s [vector] filterM: OK (0.04s)
  13563. 719.34 s [vector] +++ OK, passed 100 tests.
  13564. 719.34 s [vector] uniq: OK
  13565. 719.34 s [vector] +++ OK, passed 100 tests.
  13566. 719.35 s [vector] mapMaybe: OK
  13567. 719.35 s [vector] +++ OK, passed 100 tests.
  13568. 719.35 s [vector] imapMaybe: OK
  13569. 719.35 s [vector] +++ OK, passed 100 tests.
  13570. 719.35 s [vector] takeWhile: OK
  13571. 719.35 s [vector] +++ OK, passed 100 tests.
  13572. 719.35 s [vector] dropWhile: OK
  13573. 719.35 s [vector] +++ OK, passed 100 tests.
  13574. 719.36 s [vector] partition: OK
  13575. 719.36 s [vector] +++ OK, passed 100 tests.
  13576. 719.36 s [vector] partitionWith: OK
  13577. 719.36 s [vector] +++ OK, passed 100 tests.
  13578. 719.36 s [vector] span: OK
  13579. 719.36 s [vector] +++ OK, passed 100 tests.
  13580. 719.37 s [vector] break: OK
  13581. 719.37 s [vector] +++ OK, passed 100 tests.
  13582. 719.37 s [vector] spanR: OK
  13583. 719.37 s [vector] +++ OK, passed 100 tests.
  13584. 719.37 s [vector] breakR: OK
  13585. 719.38 s [vector] +++ OK, passed 100 tests.
  13586. 719.38 s [vector] groupBy: OK
  13587. 719.38 s [vector] +++ OK, passed 100 tests.
  13588. 719.38 s [vector] elem: OK
  13589. 719.38 s [vector] +++ OK, passed 100 tests.
  13590. 719.38 s [vector] notElem: OK
  13591. 719.38 s [vector] +++ OK, passed 100 tests.
  13592. 719.38 s [vector] find: OK
  13593. 719.38 s [vector] +++ OK, passed 100 tests.
  13594. 719.38 s [vector] findIndex: OK
  13595. 719.38 s [vector] +++ OK, passed 100 tests.
  13596. 719.39 s [vector] findIndexR: OK
  13597. 719.39 s [vector] +++ OK, passed 100 tests.
  13598. 719.39 s [vector] findIndices: OK
  13599. 719.39 s [vector] +++ OK, passed 100 tests.
  13600. 719.39 s [vector] elemIndex: OK
  13601. 719.40 s [vector] +++ OK, passed 100 tests.
  13602. 719.40 s [vector] elemIndices: OK
  13603. 719.40 s [vector] +++ OK, passed 100 tests.
  13604. 719.40 s [vector] foldl: OK
  13605. 719.40 s [vector] +++ OK, passed 100 tests.
  13606. 719.40 s [vector] foldl1: OK
  13607. 719.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13608. 719.41 s [vector] foldl': OK
  13609. 719.41 s [vector] +++ OK, passed 100 tests.
  13610. 719.41 s [vector] foldl1': OK
  13611. 719.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13612. 719.42 s [vector] foldr: OK
  13613. 719.42 s [vector] +++ OK, passed 100 tests.
  13614. 719.42 s [vector] foldr1: OK
  13615. 719.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13616. 719.42 s [vector] foldr': OK
  13617. 719.42 s [vector] +++ OK, passed 100 tests.
  13618. 719.43 s [vector] foldr1': OK
  13619. 719.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13620. 719.44 s [vector] ifoldl: OK
  13621. 719.44 s [vector] +++ OK, passed 100 tests.
  13622. 719.44 s [vector] ifoldl': OK
  13623. 719.44 s [vector] +++ OK, passed 100 tests.
  13624. 719.45 s [vector] ifoldr: OK
  13625. 719.45 s [vector] +++ OK, passed 100 tests.
  13626. 719.46 s [vector] ifoldr': OK
  13627. 719.46 s [vector] +++ OK, passed 100 tests.
  13628. 719.46 s [vector] ifoldM: OK
  13629. 719.46 s [vector] +++ OK, passed 100 tests.
  13630. 719.47 s [vector] ifoldM': OK
  13631. 719.47 s [vector] +++ OK, passed 100 tests.
  13632. 719.48 s [vector] ifoldM_: OK (0.02s)
  13633. 719.48 s [vector] +++ OK, passed 100 tests.
  13634. 719.51 s [vector] ifoldM'_: OK (0.03s)
  13635. 719.51 s [vector] +++ OK, passed 100 tests.
  13636. 719.51 s [vector] all: OK
  13637. 719.51 s [vector] +++ OK, passed 100 tests.
  13638. 719.51 s [vector] any: OK
  13639. 719.52 s [vector] +++ OK, passed 100 tests.
  13640. 719.52 s [vector] prescanl: OK
  13641. 719.52 s [vector] +++ OK, passed 100 tests.
  13642. 719.53 s [vector] prescanl': OK
  13643. 719.53 s [vector] +++ OK, passed 100 tests.
  13644. 719.54 s [vector] postscanl: OK
  13645. 719.54 s [vector] +++ OK, passed 100 tests.
  13646. 719.54 s [vector] postscanl': OK
  13647. 719.55 s [vector] +++ OK, passed 100 tests.
  13648. 719.55 s [vector] scanl: OK
  13649. 719.55 s [vector] +++ OK, passed 100 tests.
  13650. 719.55 s [vector] scanl': OK
  13651. 719.55 s [vector] +++ OK, passed 100 tests.
  13652. 719.55 s [vector] scanl1: OK
  13653. 719.55 s [vector] +++ OK, passed 100 tests.
  13654. 719.55 s [vector] scanl1': OK
  13655. 719.55 s [vector] +++ OK, passed 100 tests.
  13656. 719.56 s [vector] iscanl: OK
  13657. 719.56 s [vector] +++ OK, passed 100 tests.
  13658. 719.56 s [vector] iscanl': OK
  13659. 719.56 s [vector] +++ OK, passed 100 tests.
  13660. 719.56 s [vector] prescanr: OK
  13661. 719.56 s [vector] +++ OK, passed 100 tests.
  13662. 719.57 s [vector] prescanr': OK
  13663. 719.57 s [vector] +++ OK, passed 100 tests.
  13664. 719.58 s [vector] postscanr: OK
  13665. 719.58 s [vector] +++ OK, passed 100 tests.
  13666. 719.58 s [vector] postscanr': OK
  13667. 719.58 s [vector] +++ OK, passed 100 tests.
  13668. 719.59 s [vector] scanr: OK
  13669. 719.59 s [vector] +++ OK, passed 100 tests.
  13670. 719.60 s [vector] scanr': OK
  13671. 719.60 s [vector] +++ OK, passed 100 tests.
  13672. 719.60 s [vector] scanr1: OK
  13673. 719.60 s [vector] +++ OK, passed 100 tests.
  13674. 719.62 s [vector] scanr1': OK
  13675. 719.62 s [vector] +++ OK, passed 100 tests.
  13676. 719.62 s [vector] iscanr: OK
  13677. 719.62 s [vector] +++ OK, passed 100 tests.
  13678. 719.62 s [vector] iscanr': OK
  13679. 719.62 s [vector] +++ OK, passed 100 tests.
  13680. 719.62 s [vector] mut_read: OK
  13681. 719.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13682. 719.62 s [vector] mut_write: OK
  13683. 719.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13684. 719.63 s [vector] mut_modify: OK
  13685. 719.63 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13686. 719.63 s [vector] mut_generate: OK
  13687. 719.63 s [vector] +++ OK, passed 100 tests.
  13688. 719.63 s [vector] mut_generateM: OK (0.01s)
  13689. 719.63 s [vector] +++ OK, passed 100 tests.
  13690. 719.64 s [vector] mut_mapM_: OK (0.02s)
  13691. 719.64 s [vector] +++ OK, passed 100 tests.
  13692. 719.68 s [vector] mut_imapM_: OK (0.02s)
  13693. 719.68 s [vector] +++ OK, passed 100 tests.
  13694. 719.70 s [vector] mut_forM_: OK (0.02s)
  13695. 719.70 s [vector] +++ OK, passed 100 tests.
  13696. 719.71 s [vector] mut_iforM_: OK (0.02s)
  13697. 719.71 s [vector] +++ OK, passed 100 tests.
  13698. 719.71 s [vector] mut_foldr: OK
  13699. 719.71 s [vector] +++ OK, passed 100 tests.
  13700. 719.72 s [vector] mut_foldr': OK
  13701. 719.72 s [vector] +++ OK, passed 100 tests.
  13702. 719.72 s [vector] mut_foldl: OK
  13703. 719.72 s [vector] +++ OK, passed 100 tests.
  13704. 719.73 s [vector] mut_foldl': OK
  13705. 719.73 s [vector] +++ OK, passed 100 tests.
  13706. 719.73 s [vector] mut_ifoldr: OK
  13707. 719.74 s [vector] +++ OK, passed 100 tests.
  13708. 719.74 s [vector] mut_ifoldr': OK
  13709. 719.74 s [vector] +++ OK, passed 100 tests.
  13710. 719.74 s [vector] mut_ifoldl: OK
  13711. 719.74 s [vector] +++ OK, passed 100 tests.
  13712. 719.75 s [vector] mut_ifoldl': OK
  13713. 719.75 s [vector] +++ OK, passed 100 tests.
  13714. 719.75 s [vector] mut_foldM: OK
  13715. 719.76 s [vector] +++ OK, passed 100 tests.
  13716. 719.76 s [vector] mut_foldM': OK
  13717. 719.76 s [vector] +++ OK, passed 100 tests.
  13718. 719.76 s [vector] mut_foldrM: OK
  13719. 719.76 s [vector] +++ OK, passed 100 tests.
  13720. 719.76 s [vector] mut_foldrM': OK
  13721. 719.76 s [vector] +++ OK, passed 100 tests.
  13722. 719.76 s [vector] mut_ifoldM: OK
  13723. 719.76 s [vector] +++ OK, passed 100 tests.
  13724. 719.78 s [vector] mut_ifoldM': OK (0.01s)
  13725. 719.78 s [vector] +++ OK, passed 100 tests.
  13726. 719.79 s [vector] mut_ifoldrM: OK
  13727. 719.79 s [vector] +++ OK, passed 100 tests.
  13728. 719.79 s [vector] mut_ifoldrM': OK
  13729. 719.79 s [vector] +++ OK, passed 100 tests.
  13730. 719.79 s [vector] compare: OK
  13731. 719.79 s [vector] +++ OK, passed 100 tests.
  13732. 719.79 s [vector] maximum: OK
  13733. 719.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13734. 719.79 s [vector] minimum: OK
  13735. 719.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13736. 719.79 s [vector] minIndex: OK
  13737. 719.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13738. 719.79 s [vector] maxIndex: OK
  13739. 719.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13740. 719.80 s [vector] maximumBy: OK
  13741. 719.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13742. 719.80 s [vector] minimumBy: OK
  13743. 719.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13744. 719.80 s [vector] maximumOn: OK
  13745. 719.80 s [vector] +++ OK, passed 100 tests; 23 discarded.
  13746. 719.80 s [vector] minimumOn: OK
  13747. 719.80 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13748. 719.80 s [vector] maxIndexBy: OK
  13749. 719.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13750. 719.80 s [vector] minIndexBy: OK
  13751. 719.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13752. 719.80 s [vector] ListFirstMaxIndexWins: OK
  13753. 719.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13754. 719.80 s [vector] FalseListFirstMaxIndexWins: OK
  13755. 719.80 s [vector] +++ OK, failed as expected. (after 1 test):
  13756. 719.80 s [vector] Exception:
  13757. 719.80 s [vector] Prelude.foldr1: empty list
  13758. 719.80 s [vector] CallStack (from HasCallStack):
  13759. 719.80 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13760. 719.80 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13761. 719.80 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13762. 719.80 s [vector] []
  13763. 719.80 s [vector] zip: OK
  13764. 719.81 s [vector] +++ OK, passed 100 tests.
  13765. 719.81 s [vector] zip3: OK
  13766. 719.81 s [vector] +++ OK, passed 100 tests.
  13767. 719.81 s [vector] unzip: OK
  13768. 719.81 s [vector] +++ OK, passed 100 tests.
  13769. 719.81 s [vector] unzip3: OK
  13770. 719.81 s [vector] +++ OK, passed 100 tests.
  13771. 719.81 s [vector] indexed: OK
  13772. 719.81 s [vector] +++ OK, passed 100 tests.
  13773. 719.81 s [vector] update: OK
  13774. 719.81 s [vector] +++ OK, passed 100 tests.
  13775. 719.81 s [vector] mempty: OK
  13776. 719.82 s [vector] +++ OK, passed 100 tests.
  13777. 719.82 s [vector] mappend: OK
  13778. 719.82 s [vector] +++ OK, passed 100 tests.
  13779. 719.86 s [vector] mconcat: OK (0.04s)
  13780. 719.86 s [vector] +++ OK, passed 100 tests.
  13781. 719.86 s [vector] glength: OK
  13782. 719.86 s [vector] +++ OK, passed 100 tests.
  13783. 719.86 s [vector] (Int,Bool,Int)
  13784. 719.86 s [vector] fromList.toList == id: OK
  13785. 719.86 s [vector] +++ OK, passed 100 tests.
  13786. 719.86 s [vector] toList.fromList == id: OK
  13787. 719.86 s [vector] +++ OK, passed 100 tests.
  13788. 719.86 s [vector] unstream.stream == id: OK
  13789. 719.86 s [vector] +++ OK, passed 100 tests.
  13790. 719.86 s [vector] stream.unstream == id: OK
  13791. 719.86 s [vector] +++ OK, passed 100 tests.
  13792. 719.86 s [vector] eq: OK
  13793. 719.86 s [vector] +++ OK, passed 100 tests.
  13794. 719.86 s [vector] length: OK
  13795. 719.86 s [vector] +++ OK, passed 100 tests.
  13796. 719.87 s [vector] null: OK
  13797. 719.87 s [vector] +++ OK, passed 100 tests.
  13798. 719.87 s [vector] index: OK
  13799. 719.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13800. 719.87 s [vector] safeIndex: OK
  13801. 719.87 s [vector] +++ OK, passed 100 tests.
  13802. 719.87 s [vector] head: OK
  13803. 719.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13804. 719.87 s [vector] last: OK
  13805. 719.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13806. 719.87 s [vector] unsafeIndex: OK
  13807. 719.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13808. 719.87 s [vector] unsafeHead: OK
  13809. 719.87 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13810. 719.87 s [vector] unsafeLast: OK
  13811. 719.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13812. 719.87 s [vector] slice: OK
  13813. 719.87 s [vector] +++ OK, passed 100 tests.
  13814. 719.88 s [vector] init: OK
  13815. 719.88 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13816. 719.88 s [vector] tail: OK
  13817. 719.88 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13818. 719.88 s [vector] take: OK
  13819. 719.89 s [vector] +++ OK, passed 100 tests.
  13820. 719.89 s [vector] drop: OK
  13821. 719.89 s [vector] +++ OK, passed 100 tests.
  13822. 719.89 s [vector] splitAt: OK
  13823. 719.89 s [vector] +++ OK, passed 100 tests.
  13824. 719.89 s [vector] empty: OK
  13825. 719.89 s [vector] +++ OK, passed 100 tests.
  13826. 719.90 s [vector] singleton: OK
  13827. 719.90 s [vector] +++ OK, passed 100 tests.
  13828. 719.90 s [vector] replicate: OK
  13829. 719.90 s [vector] +++ OK, passed 100 tests.
  13830. 719.90 s [vector] generate: OK
  13831. 719.90 s [vector] +++ OK, passed 100 tests.
  13832. 719.90 s [vector] iterateN: OK
  13833. 719.90 s [vector] +++ OK, passed 100 tests.
  13834. 719.92 s [vector] iterateNM: OK (0.02s)
  13835. 719.92 s [vector] +++ OK, passed 100 tests.
  13836. 719.96 s [vector] generateM: OK (0.03s)
  13837. 719.96 s [vector] +++ OK, passed 100 tests.
  13838. 719.96 s [vector] replicateM: OK (0.01s)
  13839. 719.97 s [vector] +++ OK, passed 100 tests.
  13840. 719.97 s [vector] create: OK
  13841. 719.97 s [vector] +++ OK, passed 100 tests.
  13842. 719.97 s [vector] createT: OK
  13843. 719.97 s [vector] +++ OK, passed 100 tests.
  13844. 719.97 s [vector] unfoldr: OK
  13845. 719.97 s [vector] +++ OK, passed 100 tests.
  13846. 719.97 s [vector] unfoldrN: OK
  13847. 719.97 s [vector] +++ OK, passed 100 tests.
  13848. 719.97 s [vector] unfoldrExactN: OK
  13849. 719.97 s [vector] +++ OK, passed 100 tests.
  13850. 719.97 s [vector] unfoldrM: OK
  13851. 719.98 s [vector] +++ OK, passed 100 tests.
  13852. 719.98 s [vector] unfoldrNM: OK
  13853. 719.98 s [vector] +++ OK, passed 100 tests.
  13854. 720.00 s [vector] unfoldrExactNM: OK (0.02s)
  13855. 720.00 s [vector] +++ OK, passed 100 tests.
  13856. 720.01 s [vector] constructN: OK (0.01s)
  13857. 720.02 s [vector] +++ OK, passed 100 tests.
  13858. 720.02 s [vector] constructrN: OK
  13859. 720.02 s [vector] +++ OK, passed 100 tests.
  13860. 720.04 s [vector] cons: OK
  13861. 720.32 s [vector] +++ OK, passed 100 tests.
  13862. 720.32 s [vector] snoc: OK
  13863. 720.32 s [vector] +++ OK, passed 100 tests.
  13864. 720.32 s [vector] append: OK
  13865. 720.32 s [vector] +++ OK, passed 100 tests.
  13866. 720.32 s [vector] concat: OK (0.05s)
  13867. 720.32 s [vector] +++ OK, passed 100 tests.
  13868. 720.32 s [vector] force: OK
  13869. 720.32 s [vector] +++ OK, passed 100 tests.
  13870. 720.32 s [vector] upd: OK
  13871. 720.32 s [vector] +++ OK, passed 100 tests.
  13872. 720.32 s [vector] accum: OK
  13873. 720.32 s [vector] +++ OK, passed 100 tests.
  13874. 720.32 s [vector] reverse: OK
  13875. 720.32 s [vector] +++ OK, passed 100 tests.
  13876. 720.32 s [vector] backpermute: OK
  13877. 720.32 s [vector] +++ OK, passed 100 tests.
  13878. 720.32 s [vector] map: OK
  13879. 720.32 s [vector] +++ OK, passed 100 tests.
  13880. 720.32 s [vector] imap: OK
  13881. 720.32 s [vector] +++ OK, passed 100 tests.
  13882. 720.32 s [vector] concatMap: OK
  13883. 720.32 s [vector] +++ OK, passed 100 tests.
  13884. 720.32 s [vector] mapM: OK
  13885. 720.32 s [vector] +++ OK, passed 100 tests.
  13886. 720.32 s [vector] mapM_: OK (0.03s)
  13887. 720.32 s [vector] +++ OK, passed 100 tests.
  13888. 720.32 s [vector] forM: OK
  13889. 720.32 s [vector] +++ OK, passed 100 tests.
  13890. 720.32 s [vector] forM_: OK (0.04s)
  13891. 720.32 s [vector] +++ OK, passed 100 tests.
  13892. 720.32 s [vector] imapM: OK
  13893. 720.32 s [vector] +++ OK, passed 100 tests.
  13894. 720.32 s [vector] imapM_: OK (0.04s)
  13895. 720.32 s [vector] +++ OK, passed 100 tests.
  13896. 720.32 s [vector] zipWith: OK
  13897. 720.32 s [vector] +++ OK, passed 100 tests.
  13898. 720.32 s [vector] zipWith3: OK
  13899. 720.32 s [vector] +++ OK, passed 100 tests.
  13900. 720.32 s [vector] izipWith: OK
  13901. 720.32 s [vector] +++ OK, passed 100 tests.
  13902. 720.32 s [vector] izipWith3: OK
  13903. 720.32 s [vector] +++ OK, passed 100 tests.
  13904. 720.32 s [vector] izipWithM: OK
  13905. 720.32 s [vector] +++ OK, passed 100 tests.
  13906. 720.32 s [vector] izipWithM_: OK (0.02s)
  13907. 720.32 s [vector] +++ OK, passed 100 tests.
  13908. 720.32 s [vector] zipWithM: OK
  13909. 720.32 s [vector] +++ OK, passed 100 tests.
  13910. 720.34 s [vector] zipWithM_: OK (0.02s)
  13911. 720.34 s [vector] +++ OK, passed 100 tests.
  13912. 720.34 s [vector] filter: OK
  13913. 720.34 s [vector] +++ OK, passed 100 tests.
  13914. 720.34 s [vector] ifilter: OK
  13915. 720.34 s [vector] +++ OK, passed 100 tests.
  13916. 720.40 s [vector] filterM: OK (0.06s)
  13917. 720.40 s [vector] +++ OK, passed 100 tests.
  13918. 720.40 s [vector] uniq: OK
  13919. 720.41 s [vector] +++ OK, passed 100 tests.
  13920. 720.41 s [vector] mapMaybe: OK
  13921. 720.41 s [vector] +++ OK, passed 100 tests.
  13922. 720.41 s [vector] imapMaybe: OK
  13923. 720.42 s [vector] +++ OK, passed 100 tests.
  13924. 720.42 s [vector] takeWhile: OK
  13925. 720.42 s [vector] +++ OK, passed 100 tests.
  13926. 720.42 s [vector] dropWhile: OK
  13927. 720.42 s [vector] +++ OK, passed 100 tests.
  13928. 720.42 s [vector] partition: OK
  13929. 720.42 s [vector] +++ OK, passed 100 tests.
  13930. 720.43 s [vector] partitionWith: OK
  13931. 720.43 s [vector] +++ OK, passed 100 tests.
  13932. 720.43 s [vector] span: OK
  13933. 720.43 s [vector] +++ OK, passed 100 tests.
  13934. 720.43 s [vector] break: OK
  13935. 720.43 s [vector] +++ OK, passed 100 tests.
  13936. 720.43 s [vector] spanR: OK
  13937. 720.43 s [vector] +++ OK, passed 100 tests.
  13938. 720.44 s [vector] breakR: OK
  13939. 720.44 s [vector] +++ OK, passed 100 tests.
  13940. 720.44 s [vector] groupBy: OK
  13941. 720.44 s [vector] +++ OK, passed 100 tests.
  13942. 720.45 s [vector] elem: OK
  13943. 720.45 s [vector] +++ OK, passed 100 tests.
  13944. 720.45 s [vector] notElem: OK
  13945. 720.45 s [vector] +++ OK, passed 100 tests.
  13946. 720.45 s [vector] find: OK
  13947. 720.45 s [vector] +++ OK, passed 100 tests.
  13948. 720.45 s [vector] findIndex: OK
  13949. 720.45 s [vector] +++ OK, passed 100 tests.
  13950. 720.45 s [vector] findIndexR: OK
  13951. 720.45 s [vector] +++ OK, passed 100 tests.
  13952. 720.45 s [vector] findIndices: OK
  13953. 720.45 s [vector] +++ OK, passed 100 tests.
  13954. 720.45 s [vector] elemIndex: OK
  13955. 720.45 s [vector] +++ OK, passed 100 tests.
  13956. 720.46 s [vector] elemIndices: OK
  13957. 720.46 s [vector] +++ OK, passed 100 tests.
  13958. 720.46 s [vector] foldl: OK
  13959. 720.46 s [vector] +++ OK, passed 100 tests.
  13960. 720.47 s [vector] foldl1: OK
  13961. 720.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13962. 720.47 s [vector] foldl': OK
  13963. 720.47 s [vector] +++ OK, passed 100 tests.
  13964. 720.48 s [vector] foldl1': OK
  13965. 720.48 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13966. 720.48 s [vector] foldr: OK
  13967. 720.48 s [vector] +++ OK, passed 100 tests.
  13968. 720.49 s [vector] foldr1: OK
  13969. 720.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13970. 720.50 s [vector] foldr': OK
  13971. 720.50 s [vector] +++ OK, passed 100 tests.
  13972. 720.50 s [vector] foldr1': OK
  13973. 720.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13974. 720.50 s [vector] ifoldl: OK
  13975. 720.50 s [vector] +++ OK, passed 100 tests.
  13976. 720.51 s [vector] ifoldl': OK
  13977. 720.51 s [vector] +++ OK, passed 100 tests.
  13978. 720.52 s [vector] ifoldr: OK
  13979. 720.52 s [vector] +++ OK, passed 100 tests.
  13980. 720.52 s [vector] ifoldr': OK
  13981. 720.52 s [vector] +++ OK, passed 100 tests.
  13982. 720.53 s [vector] ifoldM: OK
  13983. 720.53 s [vector] +++ OK, passed 100 tests.
  13984. 720.54 s [vector] ifoldM': OK
  13985. 720.54 s [vector] +++ OK, passed 100 tests.
  13986. 720.58 s [vector] ifoldM_: OK (0.04s)
  13987. 720.58 s [vector] +++ OK, passed 100 tests.
  13988. 720.61 s [vector] ifoldM'_: OK (0.04s)
  13989. 720.61 s [vector] +++ OK, passed 100 tests.
  13990. 720.61 s [vector] all: OK
  13991. 720.61 s [vector] +++ OK, passed 100 tests.
  13992. 720.61 s [vector] any: OK
  13993. 720.62 s [vector] +++ OK, passed 100 tests.
  13994. 720.62 s [vector] prescanl: OK
  13995. 720.62 s [vector] +++ OK, passed 100 tests.
  13996. 720.63 s [vector] prescanl': OK
  13997. 720.63 s [vector] +++ OK, passed 100 tests.
  13998. 720.63 s [vector] postscanl: OK
  13999. 720.63 s [vector] +++ OK, passed 100 tests.
  14000. 720.64 s [vector] postscanl': OK
  14001. 720.64 s [vector] +++ OK, passed 100 tests.
  14002. 720.65 s [vector] scanl: OK
  14003. 720.65 s [vector] +++ OK, passed 100 tests.
  14004. 720.65 s [vector] scanl': OK
  14005. 720.65 s [vector] +++ OK, passed 100 tests.
  14006. 720.66 s [vector] scanl1: OK
  14007. 720.66 s [vector] +++ OK, passed 100 tests.
  14008. 720.67 s [vector] scanl1': OK
  14009. 720.67 s [vector] +++ OK, passed 100 tests.
  14010. 720.67 s [vector] iscanl: OK
  14011. 720.67 s [vector] +++ OK, passed 100 tests.
  14012. 720.68 s [vector] iscanl': OK
  14013. 720.68 s [vector] +++ OK, passed 100 tests.
  14014. 720.69 s [vector] prescanr: OK
  14015. 720.69 s [vector] +++ OK, passed 100 tests.
  14016. 720.69 s [vector] prescanr': OK
  14017. 720.69 s [vector] +++ OK, passed 100 tests.
  14018. 720.70 s [vector] postscanr: OK
  14019. 720.70 s [vector] +++ OK, passed 100 tests.
  14020. 720.71 s [vector] postscanr': OK
  14021. 720.71 s [vector] +++ OK, passed 100 tests.
  14022. 720.71 s [vector] scanr: OK
  14023. 720.72 s [vector] +++ OK, passed 100 tests.
  14024. 720.72 s [vector] scanr': OK
  14025. 720.72 s [vector] +++ OK, passed 100 tests.
  14026. 720.73 s [vector] scanr1: OK
  14027. 720.74 s [vector] +++ OK, passed 100 tests.
  14028. 720.74 s [vector] scanr1': OK
  14029. 720.74 s [vector] +++ OK, passed 100 tests.
  14030. 720.75 s [vector] iscanr: OK
  14031. 720.75 s [vector] +++ OK, passed 100 tests.
  14032. 720.75 s [vector] iscanr': OK
  14033. 720.75 s [vector] +++ OK, passed 100 tests.
  14034. 720.75 s [vector] mut_read: OK
  14035. 720.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14036. 720.75 s [vector] mut_write: OK
  14037. 720.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14038. 720.75 s [vector] mut_modify: OK
  14039. 720.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14040. 720.75 s [vector] mut_generate: OK
  14041. 720.75 s [vector] +++ OK, passed 100 tests.
  14042. 720.78 s [vector] mut_generateM: OK (0.02s)
  14043. 720.78 s [vector] +++ OK, passed 100 tests.
  14044. 720.80 s [vector] mut_mapM_: OK (0.04s)
  14045. 720.80 s [vector] +++ OK, passed 100 tests.
  14046. 720.86 s [vector] mut_imapM_: OK (0.03s)
  14047. 720.86 s [vector] +++ OK, passed 100 tests.
  14048. 720.92 s [vector] mut_forM_: OK (0.06s)
  14049. 720.92 s [vector] +++ OK, passed 100 tests.
  14050. 720.95 s [vector] mut_iforM_: OK (0.04s)
  14051. 720.95 s [vector] +++ OK, passed 100 tests.
  14052. 720.96 s [vector] mut_foldr: OK
  14053. 720.96 s [vector] +++ OK, passed 100 tests.
  14054. 720.97 s [vector] mut_foldr': OK
  14055. 720.97 s [vector] +++ OK, passed 100 tests.
  14056. 720.97 s [vector] mut_foldl: OK
  14057. 720.97 s [vector] +++ OK, passed 100 tests.
  14058. 720.98 s [vector] mut_foldl': OK
  14059. 720.98 s [vector] +++ OK, passed 100 tests.
  14060. 720.99 s [vector] mut_ifoldr: OK
  14061. 720.99 s [vector] +++ OK, passed 100 tests.
  14062. 720.99 s [vector] mut_ifoldr': OK
  14063. 720.99 s [vector] +++ OK, passed 100 tests.
  14064. 721.00 s [vector] mut_ifoldl: OK
  14065. 721.00 s [vector] +++ OK, passed 100 tests.
  14066. 721.01 s [vector] mut_ifoldl': OK
  14067. 721.01 s [vector] +++ OK, passed 100 tests.
  14068. 721.01 s [vector] mut_foldM: OK
  14069. 721.02 s [vector] +++ OK, passed 100 tests.
  14070. 721.02 s [vector] mut_foldM': OK
  14071. 721.02 s [vector] +++ OK, passed 100 tests.
  14072. 721.03 s [vector] mut_foldrM: OK
  14073. 721.03 s [vector] +++ OK, passed 100 tests.
  14074. 721.04 s [vector] mut_foldrM': OK
  14075. 721.04 s [vector] +++ OK, passed 100 tests.
  14076. 721.04 s [vector] mut_ifoldM: OK
  14077. 721.04 s [vector] +++ OK, passed 100 tests.
  14078. 721.05 s [vector] mut_ifoldM': OK
  14079. 721.05 s [vector] +++ OK, passed 100 tests.
  14080. 721.05 s [vector] mut_ifoldrM: OK
  14081. 721.05 s [vector] +++ OK, passed 100 tests.
  14082. 721.05 s [vector] mut_ifoldrM': OK
  14083. 721.06 s [vector] +++ OK, passed 100 tests.
  14084. 721.06 s [vector] compare: OK
  14085. 721.06 s [vector] +++ OK, passed 100 tests.
  14086. 721.06 s [vector] maximum: OK
  14087. 721.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14088. 721.06 s [vector] minimum: OK
  14089. 721.06 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14090. 721.06 s [vector] minIndex: OK
  14091. 721.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14092. 721.06 s [vector] maxIndex: OK
  14093. 721.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14094. 721.06 s [vector] maximumBy: OK
  14095. 721.06 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14096. 721.07 s [vector] minimumBy: OK
  14097. 721.07 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14098. 721.07 s [vector] maximumOn: OK
  14099. 721.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14100. 721.07 s [vector] minimumOn: OK
  14101. 721.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14102. 721.07 s [vector] maxIndexBy: OK
  14103. 721.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14104. 721.07 s [vector] minIndexBy: OK
  14105. 721.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14106. 721.07 s [vector] ListFirstMaxIndexWins: OK
  14107. 721.07 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14108. 721.07 s [vector] FalseListFirstMaxIndexWins: OK
  14109. 721.07 s [vector] +++ OK, failed as expected. (after 1 test):
  14110. 721.07 s [vector] Exception:
  14111. 721.07 s [vector] Prelude.foldr1: empty list
  14112. 721.07 s [vector] CallStack (from HasCallStack):
  14113. 721.07 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  14114. 721.07 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  14115. 721.07 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  14116. 721.07 s [vector] []
  14117. 721.08 s [vector] zip: OK
  14118. 721.08 s [vector] +++ OK, passed 100 tests.
  14119. 721.08 s [vector] zip3: OK
  14120. 721.08 s [vector] +++ OK, passed 100 tests.
  14121. 721.08 s [vector] unzip: OK
  14122. 721.08 s [vector] +++ OK, passed 100 tests.
  14123. 721.09 s [vector] unzip3: OK
  14124. 721.09 s [vector] +++ OK, passed 100 tests.
  14125. 721.09 s [vector] indexed: OK
  14126. 721.09 s [vector] +++ OK, passed 100 tests.
  14127. 721.09 s [vector] update: OK
  14128. 721.09 s [vector] +++ OK, passed 100 tests.
  14129. 721.09 s [vector] mempty: OK
  14130. 721.10 s [vector] +++ OK, passed 100 tests.
  14131. 721.10 s [vector] mappend: OK
  14132. 721.10 s [vector] +++ OK, passed 100 tests.
  14133. 721.17 s [vector] mconcat: OK (0.06s)
  14134. 721.17 s [vector] +++ OK, passed 100 tests.
  14135. 721.17 s [vector] glength: OK
  14136. 721.17 s [vector] +++ OK, passed 100 tests.
  14137. 721.17 s [vector] unstream
  14138. 721.17 s [vector] unstream == vunstream (exact): OK
  14139. 721.17 s [vector] +++ OK, passed 100 tests.
  14140. 721.17 s [vector] unstream == vunstream (unknown): OK
  14141. 721.17 s [vector] +++ OK, passed 100 tests.
  14142. 721.17 s [vector] unstreamR ~= vunstream (exact): OK
  14143. 721.17 s [vector] +++ OK, passed 100 tests.
  14144. 721.17 s [vector] unstreamR ~= vunstream (unknown): OK
  14145. 721.17 s [vector] +++ OK, passed 100 tests.
  14146. 721.17 s [vector] Data.Vector.Storable.Vector Alignment
  14147. 721.17 s [vector] Aligned Double: OK
  14148. 721.17 s [vector] Aligned Int: OK
  14149. 721.17 s [vector] Regression tests
  14150. 721.17 s [vector] enumFromTo crash #188
  14151. 721.17 s [vector] Word8: OK
  14152. 721.17 s [vector] Word16: OK
  14153. 721.17 s [vector] Word32: OK
  14154. 721.17 s [vector] Word64: OK
  14155. 721.17 s [vector] Word: OK
  14156. 721.17 s [vector] Int8: OK
  14157. 721.17 s [vector] Int16: OK
  14158. 721.17 s [vector] Int32: OK
  14159. 721.17 s [vector] Int64: OK
  14160. 721.17 s [vector] Int: OK
  14161. 721.17 s [vector] Char: OK
  14162. 721.17 s [vector] Negative tests
  14163. 721.17 s [vector] slice out of bounds #257
  14164. 721.17 s [vector] Boxed
  14165. 721.17 s [vector] Negative ix: OK
  14166. 721.17 s [vector] Negative size: OK
  14167. 721.17 s [vector] Negative ix and size: OK
  14168. 721.17 s [vector] Too large ix: OK
  14169. 721.17 s [vector] Too large size: OK
  14170. 721.17 s [vector] Too large ix and size: OK
  14171. 721.17 s [vector] Overflow: OK
  14172. 721.17 s [vector] OutOfMemory: OK
  14173. 721.17 s [vector] Primitive
  14174. 721.17 s [vector] Negative ix: OK
  14175. 721.17 s [vector] Negative size: OK
  14176. 721.17 s [vector] Negative ix and size: OK
  14177. 721.17 s [vector] Too large ix: OK
  14178. 721.17 s [vector] Too large size: OK
  14179. 721.17 s [vector] Too large ix and size: OK
  14180. 721.17 s [vector] Overflow: OK
  14181. 721.17 s [vector] OutOfMemory: OK
  14182. 721.17 s [vector] Storable
  14183. 721.17 s [vector] Negative ix: OK
  14184. 721.17 s [vector] Negative size: OK
  14185. 721.17 s [vector] Negative ix and size: OK
  14186. 721.17 s [vector] Too large ix: OK
  14187. 721.17 s [vector] Too large size: OK
  14188. 721.17 s [vector] Too large ix and size: OK
  14189. 721.17 s [vector] Overflow: OK
  14190. 721.17 s [vector] OutOfMemory: OK
  14191. 721.17 s [vector] Unboxed
  14192. 721.17 s [vector] Negative ix: OK
  14193. 721.17 s [vector] Negative size: OK
  14194. 721.17 s [vector] Negative ix and size: OK
  14195. 721.17 s [vector] Too large ix: OK
  14196. 721.17 s [vector] Too large size: OK
  14197. 721.17 s [vector] Too large ix and size: OK
  14198. 721.17 s [vector] Overflow: OK
  14199. 721.17 s [vector] OutOfMemory: OK
  14200. 721.17 s [vector] take #282
  14201. 721.17 s [vector] Boxed: OK
  14202. 721.17 s [vector] Primitive: OK
  14203. 721.17 s [vector] Storable: OK
  14204. 721.17 s [vector] Unboxed: OK
  14205. 721.17 s [vector] Data.Vector
  14206. 721.17 s [vector] MonadFix: OK
  14207. 721.17 s [vector] toFromArray: OK
  14208. 721.17 s [vector] toFromArraySlice: OK
  14209. 721.17 s [vector] toFromArraySliceUnsafe: OK
  14210. 721.17 s [vector] toFromMutableArray: OK
  14211. 721.17 s [vector] Data.Vector.Mutable (Move): OK
  14212. 721.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14213. 721.17 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  14214. 721.17 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14215. 721.17 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  14216. 721.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14217. 721.18 s [vector] Data.Vector.Storable.Mutable (Move): OK
  14218. 721.18 s [vector] +++ OK, passed 100 tests; 25 discarded.
  14219. 721.18 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  14220. 721.18 s [vector] +++ OK, passed 100 tests.
  14221. 721.19 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  14222. 721.19 s [vector] +++ OK, passed 100 tests.
  14223. 721.19 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  14224. 721.19 s [vector] +++ OK, passed 100 tests.
  14225. 721.19 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  14226. 721.19 s [vector] +++ OK, passed 100 tests.
  14227. 721.19 s [vector]
  14228. 721.19 s [vector] All 2808 tests passed (12.01s)
  14229. 721.20 s [vector] Test suite vector-tests-O2: PASS
  14230. 721.20 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  14231. 721.20 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  14232. 721.20 s [vector] Phase: haddockPhase
  14233. 721.21 s [vector] Phase: installPhase
  14234. 721.32 s [vector] Installing library in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  14235. 722.20 s [vector] Installing internal library benchmarks-O2 in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
  14236. 722.64 s [vector] Phase: fixupPhase
  14237. 722.66 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
  14238. 722.67 s [vector] shrinking /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSvector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg-ghc9.10.3.so
  14239. 722.70 s [vector] shrinking /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSvector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2-ghc9.10.3.so
  14240. 722.72 s [vector] checking for references to /build/ in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0...
  14241. 722.78 s [vector] patching script interpreter paths in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
  14242. 722.80 s [vector] stripping (with command strip and flags -S -p) in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib
  14243. 723.80 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
  14244. 724.29 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  14245. 724.31 s [post-build-hook] Uploading to the NixCI cache: /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
  14246. 724.36 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14247. 724.37 s [post-build-hook] copying 1 paths...
  14248. 724.37 s [post-build-hook] copying path '/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  14249. 747.88 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14250. 748.11 s [post-build-hook] copying 0 paths...
  14251. 748.21 s Progress: 9 of 19 built, 193 of 193 downloaded from cache
  14252. 748.31 s Building nothunks
  14253. 748.50 s [nothunks] Phase: setupCompilerEnvironmentPhase
  14254. 748.51 s [nothunks] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  14255. 749.20 s [nothunks] Phase: unpackPhase
  14256. 749.21 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  14257. 749.22 s [nothunks] source root is nothunks-0.3.1
  14258. 749.24 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  14259. 749.25 s [nothunks] Phase: patchPhase
  14260. 749.26 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  14261. 749.28 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  14262. 749.31 s [nothunks] Phase: compileBuildDriverPhase
  14263. 749.32 s [nothunks] setupCompileFlags: -package-db=/build/tmp.oDyaFIHlax/setup-package.conf.d -threaded
  14264. 749.50 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.oDyaFIHlax/Main.o )
  14265. 749.65 s [nothunks] [2 of 2] Linking Setup
  14266. 753.07 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  14267. 753.10 s [nothunks] Phase: configurePhase
  14268. 753.12 s [nothunks] configureFlags: --verbose --prefix=/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.oDyaFIHlax/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  14269. 753.16 s [nothunks] Using Parsec parser
  14270. 753.16 s [nothunks] Configuring nothunks-0.3.1...
  14271. 754.05 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  14272. 754.74 s [nothunks] Dependency base: using base-4.20.2.0
  14273. 754.74 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
  14274. 754.74 s [nothunks] Dependency containers: using containers-0.7
  14275. 754.74 s [nothunks] Dependency ghc-heap: using ghc-heap-9.10.3
  14276. 754.74 s [nothunks] Dependency stm: using stm-2.5.3.1
  14277. 754.74 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.3
  14278. 754.74 s [nothunks] Dependency time: using time-1.12.2
  14279. 754.74 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  14280. 754.74 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  14281. 754.74 s [nothunks] Dependency base: using base-4.20.2.0
  14282. 754.74 s [nothunks] Dependency containers: using containers-0.7
  14283. 754.74 s [nothunks] Dependency ghc-prim: using ghc-prim-0.12.0
  14284. 754.74 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  14285. 754.74 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  14286. 754.74 s [nothunks] Dependency random: using random-1.2.1.3
  14287. 754.74 s [nothunks] Dependency stm: using stm-2.5.3.1
  14288. 754.74 s [nothunks] Dependency tasty: using tasty-1.5.3
  14289. 754.74 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  14290. 754.74 s [nothunks] Source component graph:
  14291. 754.74 s [nothunks] component lib
  14292. 754.74 s [nothunks] component test:nothunks-test dependency lib
  14293. 754.74 s [nothunks] Configured component graph:
  14294. 754.74 s [nothunks] component nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14295. 754.74 s [nothunks] include base-4.20.2.0-acb8
  14296. 754.74 s [nothunks] include bytestring-0.12.2.0-04d5
  14297. 754.74 s [nothunks] include containers-0.7-a3f6
  14298. 754.74 s [nothunks] include ghc-heap-9.10.3-30e2
  14299. 754.74 s [nothunks] include stm-2.5.3.1-62de
  14300. 754.74 s [nothunks] include text-2.1.3-e138
  14301. 754.74 s [nothunks] include time-1.12.2-befd
  14302. 754.74 s [nothunks] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  14303. 754.74 s [nothunks] include wherefrom-compat-0.1.1.1-76NaIyY2BhzAJrXOXpAjzp
  14304. 754.74 s [nothunks] component nothunks-0.3.1-7bNIEWEBdl4BRnTdh3zIDH-nothunks-test
  14305. 754.74 s [nothunks] include base-4.20.2.0-acb8
  14306. 754.74 s [nothunks] include containers-0.7-a3f6
  14307. 754.74 s [nothunks] include ghc-prim-0.12.0-f1e7
  14308. 754.74 s [nothunks] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  14309. 754.74 s [nothunks] include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14310. 754.74 s [nothunks] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14311. 754.74 s [nothunks] include stm-2.5.3.1-62de
  14312. 754.74 s [nothunks] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14313. 754.74 s [nothunks] include tasty-hedgehog-1.4.0.2-BmGQwjkJFIgK336SkPT5li
  14314. 754.74 s [nothunks] Linked component graph:
  14315. 754.74 s [nothunks] unit nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14316. 754.74 s [nothunks] include base-4.20.2.0-acb8
  14317. 754.74 s [nothunks] include bytestring-0.12.2.0-04d5
  14318. 754.74 s [nothunks] include containers-0.7-a3f6
  14319. 754.74 s [nothunks] include ghc-heap-9.10.3-30e2
  14320. 754.74 s [nothunks] include stm-2.5.3.1-62de
  14321. 754.74 s [nothunks] include text-2.1.3-e138
  14322. 754.74 s [nothunks] include time-1.12.2-befd
  14323. 754.74 s [nothunks] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  14324. 754.74 s [nothunks] include wherefrom-compat-0.1.1.1-76NaIyY2BhzAJrXOXpAjzp
  14325. 754.74 s [nothunks] NoThunks.Class=nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw:NoThunks.Class
  14326. 754.74 s [nothunks] unit nothunks-0.3.1-7bNIEWEBdl4BRnTdh3zIDH-nothunks-test
  14327. 754.74 s [nothunks] include base-4.20.2.0-acb8
  14328. 754.74 s [nothunks] include containers-0.7-a3f6
  14329. 754.74 s [nothunks] include ghc-prim-0.12.0-f1e7
  14330. 754.74 s [nothunks] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  14331. 754.74 s [nothunks] include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14332. 754.74 s [nothunks] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14333. 754.74 s [nothunks] include stm-2.5.3.1-62de
  14334. 754.74 s [nothunks] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14335. 754.74 s [nothunks] include tasty-hedgehog-1.4.0.2-BmGQwjkJFIgK336SkPT5li
  14336. 754.74 s [nothunks] Ready component graph:
  14337. 754.74 s [nothunks] definite nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14338. 754.74 s [nothunks] depends base-4.20.2.0-acb8
  14339. 754.74 s [nothunks] depends bytestring-0.12.2.0-04d5
  14340. 754.74 s [nothunks] depends containers-0.7-a3f6
  14341. 754.74 s [nothunks] depends ghc-heap-9.10.3-30e2
  14342. 754.74 s [nothunks] depends stm-2.5.3.1-62de
  14343. 754.74 s [nothunks] depends text-2.1.3-e138
  14344. 754.74 s [nothunks] depends time-1.12.2-befd
  14345. 754.74 s [nothunks] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  14346. 754.74 s [nothunks] depends wherefrom-compat-0.1.1.1-76NaIyY2BhzAJrXOXpAjzp
  14347. 754.74 s [nothunks] definite nothunks-0.3.1-7bNIEWEBdl4BRnTdh3zIDH-nothunks-test
  14348. 754.74 s [nothunks] depends base-4.20.2.0-acb8
  14349. 754.74 s [nothunks] depends containers-0.7-a3f6
  14350. 754.74 s [nothunks] depends ghc-prim-0.12.0-f1e7
  14351. 754.74 s [nothunks] depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  14352. 754.74 s [nothunks] depends nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14353. 754.74 s [nothunks] depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14354. 754.74 s [nothunks] depends stm-2.5.3.1-62de
  14355. 754.74 s [nothunks] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14356. 754.74 s [nothunks] depends tasty-hedgehog-1.4.0.2-BmGQwjkJFIgK336SkPT5li
  14357. 754.74 s [nothunks] Using Cabal-3.12.1.0 compiled by ghc-9.10
  14358. 754.74 s [nothunks] Using compiler: ghc-9.10.3
  14359. 754.74 s [nothunks] Using install prefix:
  14360. 754.74 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1
  14361. 754.74 s [nothunks] Executables installed in:
  14362. 754.74 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/bin
  14363. 754.74 s [nothunks] Libraries installed in:
  14364. 754.74 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14365. 754.74 s [nothunks] Dynamic Libraries installed in:
  14366. 754.74 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  14367. 754.74 s [nothunks] Private executables installed in:
  14368. 754.74 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1
  14369. 754.74 s [nothunks] Data files installed in:
  14370. 754.74 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/share/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1
  14371. 754.74 s [nothunks] Documentation installed in:
  14372. 754.74 s [nothunks] /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  14373. 754.74 s [nothunks] Configuration files installed in:
  14374. 754.74 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/etc
  14375. 754.74 s [nothunks] No alex found
  14376. 754.74 s [nothunks] Using ar found on system at:
  14377. 754.74 s [nothunks] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  14378. 754.74 s [nothunks] No c2hs found
  14379. 754.74 s [nothunks] No cpphs found
  14380. 754.74 s [nothunks] No doctest found
  14381. 754.74 s [nothunks] Using gcc version 14.3.0 given by user at:
  14382. 754.74 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  14383. 754.74 s [nothunks] Using ghc version 9.10.3 found on system at:
  14384. 754.74 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  14385. 754.74 s [nothunks] Using ghc-pkg version 9.10.3 found on system at:
  14386. 754.74 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  14387. 754.74 s [nothunks] No ghcjs found
  14388. 754.74 s [nothunks] No ghcjs-pkg found
  14389. 754.74 s [nothunks] No greencard found
  14390. 754.74 s [nothunks] Using haddock version 2.31.1 found on system at:
  14391. 754.74 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  14392. 754.74 s [nothunks] No happy found
  14393. 754.74 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  14394. 754.74 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14395. 754.74 s [nothunks] No hmake found
  14396. 754.74 s [nothunks] Using hpc version 0.69 found on system at:
  14397. 754.74 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  14398. 754.74 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  14399. 754.74 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  14400. 754.74 s [nothunks] Using hscolour version 1.25 found on system at:
  14401. 754.74 s [nothunks] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  14402. 754.74 s [nothunks] No jhc found
  14403. 754.74 s [nothunks] Using ld found on system at:
  14404. 754.74 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  14405. 754.74 s [nothunks] No pkg-config found
  14406. 754.74 s [nothunks] Using runghc version 9.10.3 found on system at:
  14407. 754.74 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  14408. 754.74 s [nothunks] Using strip version 2.44 found on system at:
  14409. 754.74 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  14410. 754.74 s [nothunks] Using tar found on system at:
  14411. 754.75 s [nothunks] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  14412. 754.75 s [nothunks] No uhc found
  14413. 755.00 s [nothunks] Phase: buildPhase
  14414. 755.20 s [nothunks] Preprocessing library for nothunks-0.3.1...
  14415. 755.20 s [nothunks] Building library for nothunks-0.3.1...
  14416. 755.45 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  14417. 760.23 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  14418. 765.92 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  14419. 765.92 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1...
  14420. 766.10 s [nothunks] [1 of 2] Compiling Test.NoThunks.Class ( test/Test/NoThunks/Class.hs, dist/build/nothunks-test/nothunks-test-tmp/Test/NoThunks/Class.o )
  14421. 771.50 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  14422. 772.30 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  14423. 774.59 s [nothunks] Phase: checkPhase
  14424. 775.63 s [nothunks] Running 1 test suites...
  14425. 775.63 s [nothunks] Test suite nothunks-test: RUNNING...
  14426. 775.65 s [nothunks] Tests
  14427. 775.65 s [nothunks] NoThunks.Class
  14428. 775.65 s [nothunks] Sanity
  14429. 775.65 s [nothunks] IntNotNF: OK
  14430. 775.65 s [nothunks] ✓ <interactive> passed 1 test.
  14431. 775.65 s [nothunks] IntIsNF: OK
  14432. 775.65 s [nothunks] ✓ <interactive> passed 1 test.
  14433. 775.65 s [nothunks] Pair: OK
  14434. 775.65 s [nothunks] ✓ <interactive> passed 1 test.
  14435. 775.65 s [nothunks] Sum: OK
  14436. 775.65 s [nothunks] ✓ <interactive> passed 1 test.
  14437. 775.65 s [nothunks] Fn: OK
  14438. 775.65 s [nothunks] ✓ <interactive> passed 1 test.
  14439. 775.65 s [nothunks] IO: OK
  14440. 775.65 s [nothunks] ✓ <interactive> passed 1 test.
  14441. 775.65 s [nothunks] InspectHeap
  14442. 775.69 s [nothunks] Int: OK (0.04s)
  14443. 775.69 s [nothunks] ✓ <interactive> passed 1000 tests.
  14444. 775.69 s [nothunks] Just ["Int"] 50% ██████████··········
  14445. 775.69 s [nothunks] Nothing 50% █████████▉··········
  14446. 775.75 s [nothunks] IntInt: OK (0.04s)
  14447. 775.75 s [nothunks] ✓ <interactive> passed 1000 tests.
  14448. 775.75 s [nothunks] Just ["Int","Tuple2"] 39% ███████▊············
  14449. 775.75 s [nothunks] Just ["Tuple2"] 50% ██████████··········
  14450. 775.75 s [nothunks] Nothing 10% ██··················
  14451. 775.77 s [nothunks] SumInt: OK (0.03s)
  14452. 775.77 s [nothunks] ✓ <interactive> passed 1000 tests.
  14453. 775.77 s [nothunks] Just ["Either"] 32% ██████▍·············
  14454. 775.77 s [nothunks] Just ["Int","Either"] 34% ██████▊·············
  14455. 775.77 s [nothunks] Nothing 34% ██████▋·············
  14456. 775.81 s [nothunks] ListInt: OK (0.03s)
  14457. 775.81 s [nothunks] ✓ <interactive> passed 1000 tests.
  14458. 775.81 s [nothunks] Just ["Int","List"] 23% ████▌···············
  14459. 775.81 s [nothunks] Just ["List"] 43% ████████▋···········
  14460. 775.81 s [nothunks] Nothing 34% ██████▊·············
  14461. 775.84 s [nothunks] IntListInt: OK (0.04s)
  14462. 775.84 s [nothunks] ✓ <interactive> passed 1000 tests.
  14463. 775.84 s [nothunks] Just ["Int","List","Tuple2"] 6% █···················
  14464. 775.84 s [nothunks] Just ["Int","Tuple2"] 25% █████···············
  14465. 775.84 s [nothunks] Just ["List","Tuple2"] 11% ██▏·················
  14466. 775.84 s [nothunks] Just ["Tuple2"] 51% ██████████▏·········
  14467. 775.84 s [nothunks] Nothing 7% █▍··················
  14468. 775.92 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  14469. 775.92 s [nothunks] after 10 tests and 2 shrinks.
  14470. 775.92 s [nothunks] shrink path: 10:cA
  14471. 775.92 s [nothunks] Just ["Int","Seq"] 20% ████················
  14472. 775.92 s [nothunks] Nothing 70% ██████████████······
  14473. 775.92 s [nothunks]
  14474. 775.92 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  14475. 775.92 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  14476. 775.92 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  14477. 775.92 s [nothunks] 168 ┃ -> Proxy a
  14478. 775.92 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  14479. 775.92 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  14480. 775.92 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  14481. 775.92 s [nothunks] 172 ┃ -> Property
  14482. 775.92 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  14483. 775.92 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  14484. 775.92 s [nothunks] ┃ │ Wrap
  14485. 775.92 s [nothunks] ┃ │ { unwrap =
  14486. 775.92 s [nothunks] ┃ │ SeqEnqueue
  14487. 775.92 s [nothunks] ┃ │ (IntValue 0)
  14488. 775.92 s [nothunks] ┃ │ (SeqEnqueue
  14489. 775.92 s [nothunks] ┃ │ (IntValue 0)
  14490. 775.92 s [nothunks] ┃ │ (SeqEnqueue
  14491. 775.92 s [nothunks] ┃ │ (IntValue 0)
  14492. 775.92 s [nothunks] ┃ │ (SeqEnqueue
  14493. 775.92 s [nothunks] ┃ │ (IntValue 0)
  14494. 775.92 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  14495. 775.92 s [nothunks] ┃ │ }
  14496. 775.92 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  14497. 775.92 s [nothunks] 176 ┃ fromModel m $ \a -> do
  14498. 775.92 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  14499. 775.92 s [nothunks] ┃ │ IsNF
  14500. 775.92 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  14501. 775.92 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  14502. 775.92 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14503. 775.92 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  14504. 775.92 s [nothunks] ┃ │ - Just
  14505. 775.92 s [nothunks] ┃ │ - ThunkInfo
  14506. 775.92 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  14507. 775.92 s [nothunks] ┃ │ + Nothing
  14508. 775.92 s [nothunks]
  14509. 775.92 s [nothunks] This failure can be reproduced by running:
  14510. 775.92 s [nothunks] > recheckAt (Seed 13621856459592471057 8508144162220375703) "10:cA" EXPECTED FAILURE
  14511. 775.92 s [nothunks]
  14512. 775.93 s [nothunks] OK (0.07s)
  14513. 775.93 s [nothunks] ✓ <interactive> passed 1 test.
  14514. 775.93 s [nothunks] Model
  14515. 775.95 s [nothunks] Int: OK (0.02s)
  14516. 775.95 s [nothunks] ✓ <interactive> passed 1000 tests.
  14517. 775.95 s [nothunks] Just ["Int"] 48% █████████▋··········
  14518. 775.95 s [nothunks] Nothing 52% ██████████▎·········
  14519. 775.97 s [nothunks] IntInt: OK (0.02s)
  14520. 775.97 s [nothunks] ✓ <interactive> passed 1000 tests.
  14521. 775.97 s [nothunks] Just ["Int","Tuple2"] 38% ███████▌············
  14522. 775.97 s [nothunks] Just ["Tuple2"] 50% ██████████··········
  14523. 775.97 s [nothunks] Nothing 12% ██▍·················
  14524. 775.98 s [nothunks] SumInt: OK (0.02s)
  14525. 775.98 s [nothunks] ✓ <interactive> passed 1000 tests.
  14526. 775.98 s [nothunks] Just ["Either"] 34% ██████▊·············
  14527. 775.98 s [nothunks] Just ["Int","Either"] 33% ██████▌·············
  14528. 775.98 s [nothunks] Nothing 33% ██████▌·············
  14529. 776.03 s [nothunks] ListInt: OK (0.03s)
  14530. 776.03 s [nothunks] ✓ <interactive> passed 1000 tests.
  14531. 776.03 s [nothunks] Just ["Int","List"] 22% ████▍···············
  14532. 776.03 s [nothunks] Just ["List"] 45% ████████▉···········
  14533. 776.03 s [nothunks] Nothing 33% ██████▋·············
  14534. 776.09 s [nothunks] IntListInt: OK (0.07s)
  14535. 776.09 s [nothunks] ✓ <interactive> passed 1000 tests.
  14536. 776.09 s [nothunks] Just ["Int","List","Tuple2"] 6% █···················
  14537. 776.09 s [nothunks] Just ["Int","Tuple2"] 24% ████▊···············
  14538. 776.09 s [nothunks] Just ["List","Tuple2"] 11% ██▎·················
  14539. 776.09 s [nothunks] Just ["Tuple2"] 50% █████████▉··········
  14540. 776.09 s [nothunks] Nothing 9% █▊··················
  14541. 776.21 s [nothunks] SeqInt: OK (0.12s)
  14542. 776.21 s [nothunks] ✓ <interactive> passed 1000 tests.
  14543. 776.21 s [nothunks] Just ["Int","Seq"] 47% █████████▍··········
  14544. 776.21 s [nothunks] Nothing 53% ██████████▌·········
  14545. 776.27 s [nothunks] AllowThunksIn: OK (0.05s)
  14546. 776.27 s [nothunks] ✓ <interactive> passed 1000 tests.
  14547. 776.27 s [nothunks] Just ["Int","field2","Record"] 25% █████···············
  14548. 776.27 s [nothunks] Just ["Record"] 48% █████████▋··········
  14549. 776.27 s [nothunks] Nothing 26% █████▎··············
  14550. 776.27 s [nothunks] Fn: OK (0.02s)
  14551. 776.27 s [nothunks] ✓ <interactive> passed 1000 tests.
  14552. 776.27 s [nothunks] Just ["->"] 26% █████▎··············
  14553. 776.27 s [nothunks] Nothing 74% ██████████████▋·····
  14554. 776.31 s [nothunks] IO: OK (0.04s)
  14555. 776.31 s [nothunks] ✓ <interactive> passed 1000 tests.
  14556. 776.31 s [nothunks] Just ["IO"] 25% ████▉···············
  14557. 776.31 s [nothunks] Nothing 75% ███████████████·····
  14558. 776.38 s [nothunks] ThunkFreeFn: OK (0.05s)
  14559. 776.38 s [nothunks] ✓ <interactive> passed 1000 tests.
  14560. 776.38 s [nothunks] Just ["->"] 27% █████▍··············
  14561. 776.38 s [nothunks] Just ["...","->"] 35% ██████▉·············
  14562. 776.38 s [nothunks] Nothing 38% ███████▌············
  14563. 776.42 s [nothunks] ThunkFreeIO: OK (0.05s)
  14564. 776.42 s [nothunks] ✓ <interactive> passed 1000 tests.
  14565. 776.42 s [nothunks] Just ["...","IO"] 40% ███████▉············
  14566. 776.42 s [nothunks] Just ["IO"] 24% ████▊···············
  14567. 776.42 s [nothunks] Nothing 36% ███████▏············
  14568. 776.42 s [nothunks] MutableVars
  14569. 776.42 s [nothunks] IORef
  14570. 776.42 s [nothunks] NotNF: OK
  14571. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14572. 776.42 s [nothunks] NF: OK
  14573. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14574. 776.42 s [nothunks] NotNFPure: OK
  14575. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14576. 776.42 s [nothunks] NFPure: OK
  14577. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14578. 776.42 s [nothunks] NotNFAtomically: OK
  14579. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14580. 776.42 s [nothunks] NFAtomically: OK
  14581. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14582. 776.42 s [nothunks] MVar
  14583. 776.42 s [nothunks] NotNF: OK
  14584. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14585. 776.42 s [nothunks] NF: OK
  14586. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14587. 776.42 s [nothunks] NotNFPure: OK
  14588. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14589. 776.42 s [nothunks] NFPure: OK
  14590. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14591. 776.42 s [nothunks] NotNFAtomically: OK
  14592. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14593. 776.42 s [nothunks] NFAtomically: OK
  14594. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14595. 776.42 s [nothunks] TVar
  14596. 776.42 s [nothunks] NotNF: OK
  14597. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14598. 776.42 s [nothunks] NF: OK
  14599. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14600. 776.42 s [nothunks] NotNFPure: OK
  14601. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14602. 776.42 s [nothunks] NFPure: OK
  14603. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14604. 776.42 s [nothunks] NotNFAtomically: OK
  14605. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14606. 776.42 s [nothunks] NFAtomically: OK
  14607. 776.42 s [nothunks] ✓ <interactive> passed 1 test.
  14608. 776.42 s [nothunks]
  14609. 776.42 s [nothunks] All 41 tests passed (0.77s)
  14610. 776.42 s [nothunks] Test suite nothunks-test: PASS
  14611. 776.42 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  14612. 776.42 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  14613. 776.45 s [nothunks] Phase: haddockPhase
  14614. 776.97 s [nothunks] Preprocessing library for nothunks-0.3.1...
  14615. 776.97 s [nothunks] Running Haddock on library for nothunks-0.3.1...
  14616. 776.98 s [nothunks] Warning: The documentation for the following packages are not installed. No
  14617. 776.98 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  14618. 777.62 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  14619. 779.44 s [nothunks] Haddock coverage:
  14620. 779.45 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  14621. 779.45 s [nothunks] * at src/NoThunks/Class.hs:334:48
  14622. 779.45 s [nothunks] * at src/NoThunks/Class.hs:334:1
  14623. 779.45 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14624. 779.45 s [nothunks] by specifying the type/value namespace explicitly.
  14625. 779.45 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  14626. 779.45 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  14627. 779.45 s [nothunks] * at src/NoThunks/Class.hs:353:25
  14628. 779.45 s [nothunks] * at src/NoThunks/Class.hs:353:1
  14629. 779.45 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14630. 779.45 s [nothunks] by specifying the type/value namespace explicitly.
  14631. 779.45 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  14632. 779.46 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  14633. 779.46 s [nothunks] * at src/NoThunks/Class.hs:358:47
  14634. 779.46 s [nothunks] * at src/NoThunks/Class.hs:358:1
  14635. 779.46 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14636. 779.46 s [nothunks] by specifying the type/value namespace explicitly.
  14637. 779.46 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  14638. 779.46 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  14639. 779.46 s [nothunks] * at src/NoThunks/Class.hs:308:27
  14640. 779.46 s [nothunks] * at src/NoThunks/Class.hs:308:1
  14641. 779.46 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14642. 779.46 s [nothunks] by specifying the type/value namespace explicitly.
  14643. 779.46 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  14644. 779.48 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  14645. 779.48 s [nothunks] * at src/NoThunks/Class.hs:230:18
  14646. 779.48 s [nothunks] * at src/NoThunks/Class.hs:230:1
  14647. 779.48 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14648. 779.48 s [nothunks] by specifying the type/value namespace explicitly.
  14649. 779.48 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  14650. 779.49 s [nothunks] Warning: 'GHC' is out of scope.
  14651. 779.49 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  14652. 779.49 s [nothunks] Warning: 'a' is out of scope.
  14653. 779.49 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  14654. 779.52 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  14655. 779.52 s [nothunks] Missing documentation for:
  14656. 779.52 s [nothunks] Module header
  14657. 780.97 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  14658. 780.97 s [nothunks] - Data.Vector.Vector
  14659. 780.97 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  14660. 780.97 s [nothunks] - NoThunks.Class.HasFields
  14661. 780.97 s [nothunks] - NoThunks.Class.Elem
  14662. 780.97 s [nothunks] - NoThunks.Class.GShowTypeOf
  14663. 780.97 s [nothunks] - NoThunks.Class.GWRecordField
  14664. 780.97 s [nothunks] - NoThunks.Class.checkContainsThunks
  14665. 793.19 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  14666. 793.20 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  14667. 793.36 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  14668. 793.40 s [nothunks] Phase: installPhase
  14669. 793.61 s [nothunks] Installing library in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14670. 794.42 s [nothunks] Phase: fixupPhase
  14671. 794.50 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1
  14672. 794.51 s [nothunks] shrinking /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSnothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw-ghc9.10.3.so
  14673. 794.53 s [nothunks] checking for references to /build/ in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1...
  14674. 794.58 s [nothunks] patching script interpreter paths in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1
  14675. 794.59 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib
  14676. 794.80 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc
  14677. 794.81 s [nothunks] checking for references to /build/ in /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc...
  14678. 794.85 s [nothunks] patching script interpreter paths in /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc
  14679. 795.20 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1 /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc
  14680. 796.67 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  14681. 796.89 s [post-build-hook] Uploading to the NixCI cache: /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1 /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc
  14682. 797.37 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14683. 797.57 s [post-build-hook] copying 1 paths...
  14684. 797.57 s [post-build-hook] copying path '/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  14685. 798.93 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14686. 799.18 s [post-build-hook] copying 0 paths...
  14687. 799.32 s Progress: 10 of 19 built, 193 of 193 downloaded from cache
  14688. 799.43 s Building unordered-containers
  14689. 799.65 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  14690. 799.65 s [unordered-containers] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  14691. 800.38 s [unordered-containers] Phase: unpackPhase
  14692. 800.40 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  14693. 800.42 s [unordered-containers] source root is unordered-containers-0.2.20.1
  14694. 800.44 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  14695. 800.45 s [unordered-containers] Phase: patchPhase
  14696. 800.48 s [unordered-containers] Phase: compileBuildDriverPhase
  14697. 800.49 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.sdS8mtmeoG/setup-package.conf.d -threaded
  14698. 800.72 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.sdS8mtmeoG/Main.o )
  14699. 800.89 s [unordered-containers] [2 of 2] Linking Setup
  14700. 804.28 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  14701. 804.31 s [unordered-containers] Phase: configurePhase
  14702. 804.33 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.sdS8mtmeoG/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  14703. 804.37 s [unordered-containers] Using Parsec parser
  14704. 804.37 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  14705. 805.33 s [unordered-containers] Flags chosen: debug=False
  14706. 806.04 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.20.2.0
  14707. 806.04 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.0.0
  14708. 806.04 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  14709. 806.04 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.22.0.0
  14710. 806.04 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  14711. 806.04 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  14712. 806.04 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  14713. 806.04 s [unordered-containers] Dependency base: using base-4.20.2.0
  14714. 806.04 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  14715. 806.04 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  14716. 806.04 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  14717. 806.04 s [unordered-containers] Dependency random: using random-1.2.1.3
  14718. 806.04 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  14719. 806.04 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  14720. 806.04 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  14721. 806.04 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  14722. 806.04 s [unordered-containers] Source component graph:
  14723. 806.04 s [unordered-containers] component lib
  14724. 806.04 s [unordered-containers] component test:unordered-containers-tests dependency lib
  14725. 806.04 s [unordered-containers] Configured component graph:
  14726. 806.04 s [unordered-containers] component unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14727. 806.04 s [unordered-containers] include base-4.20.2.0-acb8
  14728. 806.04 s [unordered-containers] include deepseq-1.5.0.0-7e72
  14729. 806.04 s [unordered-containers] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14730. 806.04 s [unordered-containers] include template-haskell-2.22.0.0-af3f
  14731. 806.04 s [unordered-containers] component unordered-containers-0.2.20.1-JZdOX0D8V0nEwlQSGrk4Ru-unordered-containers-tests
  14732. 806.04 s [unordered-containers] include ChasingBottoms-1.3.1.17-9Ou18h7tNTBCFMwCxYVCQZ
  14733. 806.04 s [unordered-containers] include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  14734. 806.04 s [unordered-containers] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  14735. 806.04 s [unordered-containers] include base-4.20.2.0-acb8
  14736. 806.04 s [unordered-containers] include containers-0.7-a3f6
  14737. 806.04 s [unordered-containers] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14738. 806.04 s [unordered-containers] include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14739. 806.04 s [unordered-containers] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14740. 806.04 s [unordered-containers] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14741. 806.04 s [unordered-containers] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  14742. 806.04 s [unordered-containers] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  14743. 806.04 s [unordered-containers] include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14744. 806.04 s [unordered-containers] Linked component graph:
  14745. 806.04 s [unordered-containers] unit unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14746. 806.04 s [unordered-containers] include base-4.20.2.0-acb8
  14747. 806.05 s [unordered-containers] include deepseq-1.5.0.0-7e72
  14748. 806.05 s [unordered-containers] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14749. 806.05 s [unordered-containers] include template-haskell-2.22.0.0-af3f
  14750. 806.05 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashSet.Internal
  14751. 806.05 s [unordered-containers] unit unordered-containers-0.2.20.1-JZdOX0D8V0nEwlQSGrk4Ru-unordered-containers-tests
  14752. 806.05 s [unordered-containers] include ChasingBottoms-1.3.1.17-9Ou18h7tNTBCFMwCxYVCQZ
  14753. 806.05 s [unordered-containers] include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  14754. 806.05 s [unordered-containers] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  14755. 806.05 s [unordered-containers] include base-4.20.2.0-acb8
  14756. 806.05 s [unordered-containers] include containers-0.7-a3f6
  14757. 806.05 s [unordered-containers] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14758. 806.05 s [unordered-containers] include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14759. 806.05 s [unordered-containers] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14760. 806.05 s [unordered-containers] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14761. 806.05 s [unordered-containers] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  14762. 806.05 s [unordered-containers] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  14763. 806.05 s [unordered-containers] include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14764. 806.05 s [unordered-containers] Ready component graph:
  14765. 806.05 s [unordered-containers] definite unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14766. 806.05 s [unordered-containers] depends base-4.20.2.0-acb8
  14767. 806.05 s [unordered-containers] depends deepseq-1.5.0.0-7e72
  14768. 806.05 s [unordered-containers] depends hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14769. 806.05 s [unordered-containers] depends template-haskell-2.22.0.0-af3f
  14770. 806.05 s [unordered-containers] definite unordered-containers-0.2.20.1-JZdOX0D8V0nEwlQSGrk4Ru-unordered-containers-tests
  14771. 806.05 s [unordered-containers] depends ChasingBottoms-1.3.1.17-9Ou18h7tNTBCFMwCxYVCQZ
  14772. 806.05 s [unordered-containers] depends HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  14773. 806.05 s [unordered-containers] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  14774. 806.05 s [unordered-containers] depends base-4.20.2.0-acb8
  14775. 806.05 s [unordered-containers] depends containers-0.7-a3f6
  14776. 806.05 s [unordered-containers] depends hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14777. 806.05 s [unordered-containers] depends nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14778. 806.05 s [unordered-containers] depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14779. 806.05 s [unordered-containers] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14780. 806.05 s [unordered-containers] depends tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  14781. 806.05 s [unordered-containers] depends tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  14782. 806.05 s [unordered-containers] depends unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14783. 806.05 s [unordered-containers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  14784. 806.05 s [unordered-containers] Using compiler: ghc-9.10.3
  14785. 806.05 s [unordered-containers] Using install prefix:
  14786. 806.05 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
  14787. 806.05 s [unordered-containers] Executables installed in:
  14788. 806.05 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/bin
  14789. 806.05 s [unordered-containers] Libraries installed in:
  14790. 806.05 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14791. 806.05 s [unordered-containers] Dynamic Libraries installed in:
  14792. 806.05 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  14793. 806.05 s [unordered-containers] Private executables installed in:
  14794. 806.05 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1
  14795. 806.05 s [unordered-containers] Data files installed in:
  14796. 806.05 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1
  14797. 806.05 s [unordered-containers] Documentation installed in:
  14798. 806.05 s [unordered-containers] /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  14799. 806.05 s [unordered-containers] Configuration files installed in:
  14800. 806.05 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/etc
  14801. 806.05 s [unordered-containers] No alex found
  14802. 806.05 s [unordered-containers] Using ar found on system at:
  14803. 806.05 s [unordered-containers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  14804. 806.05 s [unordered-containers] No c2hs found
  14805. 806.05 s [unordered-containers] No cpphs found
  14806. 806.05 s [unordered-containers] No doctest found
  14807. 806.05 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  14808. 806.05 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  14809. 806.05 s [unordered-containers] Using ghc version 9.10.3 found on system at:
  14810. 806.05 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  14811. 806.05 s [unordered-containers] Using ghc-pkg version 9.10.3 found on system at:
  14812. 806.05 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  14813. 806.05 s [unordered-containers] No ghcjs found
  14814. 806.05 s [unordered-containers] No ghcjs-pkg found
  14815. 806.05 s [unordered-containers] No greencard found
  14816. 806.05 s [unordered-containers] Using haddock version 2.31.1 found on system at:
  14817. 806.05 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  14818. 806.05 s [unordered-containers] No happy found
  14819. 806.05 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  14820. 806.05 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14821. 806.05 s [unordered-containers] No hmake found
  14822. 806.05 s [unordered-containers] Using hpc version 0.69 found on system at:
  14823. 806.05 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  14824. 806.05 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  14825. 806.05 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  14826. 806.05 s [unordered-containers] Using hscolour version 1.25 found on system at:
  14827. 806.05 s [unordered-containers] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  14828. 806.05 s [unordered-containers] No jhc found
  14829. 806.05 s [unordered-containers] Using ld found on system at:
  14830. 806.05 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  14831. 806.05 s [unordered-containers] No pkg-config found
  14832. 806.05 s [unordered-containers] Using runghc version 9.10.3 found on system at:
  14833. 806.05 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  14834. 806.05 s [unordered-containers] Using strip version 2.44 found on system at:
  14835. 806.05 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  14836. 806.05 s [unordered-containers] Using tar found on system at:
  14837. 806.05 s [unordered-containers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  14838. 806.05 s [unordered-containers] No uhc found
  14839. 806.36 s [unordered-containers] Phase: buildPhase
  14840. 806.57 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  14841. 806.60 s [unordered-containers] Building library for unordered-containers-0.2.20.1...
  14842. 806.76 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14843. 806.76 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14844. 806.76 s [unordered-containers] |
  14845. 806.76 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14846. 806.76 s [unordered-containers] | ^^^^^^^^^^
  14847. 806.76 s [unordered-containers]
  14848. 807.32 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.o, dist/build/Data/HashMap/Internal/Array.dyn_o )
  14849. 807.83 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14850. 807.83 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14851. 807.83 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14852. 807.83 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14853. 807.83 s [unordered-containers] |
  14854. 807.83 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14855. 807.83 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14856. 807.83 s [unordered-containers]
  14857. 809.35 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.o, dist/build/Data/HashMap/Internal/List.dyn_o )
  14858. 809.44 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.o, dist/build/Data/HashMap/Internal.dyn_o )
  14859. 830.24 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.o, dist/build/Data/HashMap/Internal/Debug.dyn_o )
  14860. 831.80 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.o, dist/build/Data/HashMap/Internal/Strict.dyn_o )
  14861. 838.15 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.o, dist/build/Data/HashSet/Internal.dyn_o )
  14862. 838.19 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  14863. 838.19 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.o, dist/build/Data/HashMap/Strict.dyn_o )
  14864. 838.21 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o, dist/build/Data/HashMap/Lazy.dyn_o )
  14865. 839.05 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14866. 839.05 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14867. 839.05 s [unordered-containers] |
  14868. 839.05 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14869. 839.05 s [unordered-containers] | ^^^^^^^^^^
  14870. 839.05 s [unordered-containers]
  14871. 840.12 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  14872. 840.83 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14873. 840.83 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14874. 840.83 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14875. 840.83 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14876. 840.83 s [unordered-containers] |
  14877. 840.83 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14878. 840.83 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14879. 840.83 s [unordered-containers]
  14880. 842.60 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  14881. 842.61 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  14882. 868.12 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  14883. 870.09 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  14884. 875.35 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  14885. 875.35 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  14886. 875.39 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  14887. 875.56 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  14888. 878.72 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  14889. 878.72 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  14890. 879.12 s [unordered-containers] [1 of 9] Compiling Properties.List ( tests/Properties/List.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/List.o )
  14891. 880.23 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  14892. 880.23 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  14893. 880.23 s [unordered-containers] In the use of ‘head’
  14894. 880.23 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  14895. 880.23 s [unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  14896. 880.23 s [unordered-containers] |
  14897. 880.23 s [unordered-containers] 93 | k = head keys
  14898. 880.23 s [unordered-containers] | ^^^^
  14899. 880.23 s [unordered-containers]
  14900. 887.18 s [unordered-containers] [3 of 9] Compiling Util.Key ( tests/Util/Key.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Util/Key.o )
  14901. 887.22 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  14902. 887.22 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  14903. 887.22 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  14904. 887.22 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  14905. 887.22 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  14906. 887.22 s [unordered-containers] |
  14907. 887.22 s [unordered-containers] 7 | import Data.Foldable (foldl')
  14908. 887.22 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14909. 887.22 s [unordered-containers]
  14910. 887.22 s [unordered-containers] [5 of 9] Compiling Properties.HashSet ( tests/Properties/HashSet.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashSet.o )
  14911. 887.22 s [unordered-containers] [6 of 9] Compiling Properties.HashMapStrict ( tests/Properties/HashMapStrict.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapStrict.o )
  14912. 899.11 s [unordered-containers] [7 of 9] Compiling Properties.HashMapLazy ( tests/Properties/HashMapLazy.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapLazy.o )
  14913. 899.14 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  14914. 899.15 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  14915. 900.42 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  14916. 902.72 s [unordered-containers] buildPhase completed in 1 minutes 37 seconds
  14917. 902.72 s [unordered-containers] Phase: checkPhase
  14918. 903.31 s [unordered-containers] Running 1 test suites...
  14919. 903.31 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  14920. 903.35 s [unordered-containers] All
  14921. 903.35 s [unordered-containers] Properties
  14922. 903.35 s [unordered-containers] Data.HashMap.Lazy
  14923. 903.35 s [unordered-containers] instances
  14924. 903.35 s [unordered-containers] Eq
  14925. 903.55 s [unordered-containers] ==: OK (0.16s)
  14926. 903.55 s [unordered-containers] +++ OK, passed 100 tests.
  14927. 903.55 s [unordered-containers] /=: OK (0.04s)
  14928. 903.55 s [unordered-containers] +++ OK, passed 100 tests.
  14929. 903.55 s [unordered-containers] Ord
  14930. 903.55 s [unordered-containers] compare reflexive: OK (0.15s)
  14931. 903.55 s [unordered-containers] +++ OK, passed 100 tests.
  14932. 903.55 s [unordered-containers] compare transitive: OK (0.12s)
  14933. 903.55 s [unordered-containers] +++ OK, passed 100 tests.
  14934. 903.55 s [unordered-containers] compare antisymmetric: OK (0.11s)
  14935. 903.55 s [unordered-containers] +++ OK, passed 100 tests.
  14936. 903.55 s [unordered-containers] Ord => Eq: OK (0.11s)
  14937. 903.55 s [unordered-containers] +++ OK, passed 100 tests.
  14938. 904.02 s [unordered-containers] Read/Show: OK (0.62s)
  14939. 904.02 s [unordered-containers] +++ OK, passed 100 tests.
  14940. 904.02 s [unordered-containers] Functor: OK (0.29s)
  14941. 904.02 s [unordered-containers] +++ OK, passed 100 tests.
  14942. 904.02 s [unordered-containers] Foldable: OK (0.07s)
  14943. 904.02 s [unordered-containers] +++ OK, passed 100 tests.
  14944. 904.02 s [unordered-containers] Bifoldable
  14945. 904.02 s [unordered-containers] bifoldMap: OK (0.07s)
  14946. 904.02 s [unordered-containers] +++ OK, passed 100 tests.
  14947. 904.02 s [unordered-containers] bifoldr: OK (0.07s)
  14948. 904.02 s [unordered-containers] +++ OK, passed 100 tests.
  14949. 904.02 s [unordered-containers] bifoldl: OK (0.12s)
  14950. 904.02 s [unordered-containers] +++ OK, passed 100 tests.
  14951. 904.02 s [unordered-containers] Hashable: OK (0.11s)
  14952. 904.02 s [unordered-containers] +++ OK, passed 100 tests.
  14953. 904.02 s [unordered-containers] empty
  14954. 904.02 s [unordered-containers] valid: OK
  14955. 904.02 s [unordered-containers] +++ OK, passed 1 test.
  14956. 904.02 s [unordered-containers] singleton
  14957. 904.02 s [unordered-containers] valid: OK (0.01s)
  14958. 904.02 s [unordered-containers] +++ OK, passed 100 tests.
  14959. 904.02 s [unordered-containers] size: OK (0.01s)
  14960. 904.03 s [unordered-containers] +++ OK, passed 100 tests.
  14961. 904.13 s [unordered-containers] member: OK (0.01s)
  14962. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14963. 904.17 s [unordered-containers] lookup: OK (0.19s)
  14964. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14965. 904.17 s [unordered-containers] !?: OK
  14966. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14967. 904.17 s [unordered-containers] insert
  14968. 904.17 s [unordered-containers] model: OK (0.06s)
  14969. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14970. 904.17 s [unordered-containers] valid: OK (0.03s)
  14971. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14972. 904.17 s [unordered-containers] insertWith
  14973. 904.17 s [unordered-containers] insertWith: OK (0.04s)
  14974. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14975. 904.17 s [unordered-containers] valid: OK (0.02s)
  14976. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14977. 904.17 s [unordered-containers] delete
  14978. 904.17 s [unordered-containers] model: OK (0.08s)
  14979. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14980. 904.17 s [unordered-containers] valid: OK
  14981. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14982. 904.17 s [unordered-containers] adjust
  14983. 904.17 s [unordered-containers] model: OK (0.01s)
  14984. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14985. 904.17 s [unordered-containers] valid: OK (0.04s)
  14986. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14987. 904.17 s [unordered-containers] update
  14988. 904.17 s [unordered-containers] model: OK (0.13s)
  14989. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14990. 904.17 s [unordered-containers] valid: OK (0.02s)
  14991. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14992. 904.17 s [unordered-containers] alter
  14993. 904.17 s [unordered-containers] model: OK (0.02s)
  14994. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14995. 904.17 s [unordered-containers] valid: OK (0.08s)
  14996. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  14997. 904.17 s [unordered-containers] alterF
  14998. 904.17 s [unordered-containers] model
  14999. 904.17 s [unordered-containers] []: OK (0.24s)
  15000. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15001. 904.17 s [unordered-containers] adjust: OK (0.04s)
  15002. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15003. 904.17 s [unordered-containers] insert: OK (0.12s)
  15004. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15005. 904.17 s [unordered-containers] insertWith: OK (0.12s)
  15006. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15007. 904.17 s [unordered-containers] delete: OK (0.04s)
  15008. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15009. 904.17 s [unordered-containers] lookup: OK (0.10s)
  15010. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15011. 904.17 s [unordered-containers] valid: OK (0.09s)
  15012. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15013. 904.17 s [unordered-containers] isSubmapOf
  15014. 904.17 s [unordered-containers] model: OK (0.10s)
  15015. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15016. 904.17 s [unordered-containers] m ⊆ m: OK (0.02s)
  15017. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15018. 904.17 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.08s)
  15019. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15020. 904.17 s [unordered-containers] m1\m2 ⊆ m1: OK (0.11s)
  15021. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15022. 904.17 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.07s)
  15023. 904.17 s [unordered-containers] +++ OK, passed 100 tests; 196 discarded.
  15024. 904.17 s [unordered-containers] delete k m ⊆ m: OK (0.05s)
  15025. 904.17 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  15026. 904.17 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  15027. 904.17 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  15028. 904.17 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.06s)
  15029. 904.17 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  15030. 904.17 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.05s)
  15031. 904.17 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  15032. 904.17 s [unordered-containers] union
  15033. 904.17 s [unordered-containers] model: OK (0.04s)
  15034. 904.17 s [unordered-containers] +++ OK, passed 100 tests.
  15035. 904.17 s [unordered-containers] valid: OK (0.02s)
  15036. 904.18 s [unordered-containers] +++ OK, passed 100 tests.
  15037. 904.18 s [unordered-containers] unionWith
  15038. 904.18 s [unordered-containers] model: OK (0.17s)
  15039. 904.18 s [unordered-containers] +++ OK, passed 100 tests.
  15040. 904.18 s [unordered-containers] valid: OK (0.08s)
  15041. 904.18 s [unordered-containers] +++ OK, passed 100 tests.
  15042. 904.18 s [unordered-containers] unionWithKey
  15043. 904.18 s [unordered-containers] model: OK (0.24s)
  15044. 904.18 s [unordered-containers] +++ OK, passed 100 tests.
  15045. 904.18 s [unordered-containers] valid: OK
  15046. 904.18 s [unordered-containers] +++ OK, passed 100 tests.
  15047. 904.18 s [unordered-containers] unions
  15048. 906.02 s [unordered-containers] model: OK (2.43s)
  15049. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15050. 906.02 s [unordered-containers] valid: OK (1.30s)
  15051. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15052. 906.02 s [unordered-containers] difference
  15053. 906.02 s [unordered-containers] model: OK (0.05s)
  15054. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15055. 906.02 s [unordered-containers] valid: OK (0.22s)
  15056. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15057. 906.02 s [unordered-containers] differenceWith
  15058. 906.02 s [unordered-containers] model: OK (0.13s)
  15059. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15060. 906.02 s [unordered-containers] valid: OK (0.08s)
  15061. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15062. 906.02 s [unordered-containers] intersection
  15063. 906.02 s [unordered-containers] model: OK (0.07s)
  15064. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15065. 906.02 s [unordered-containers] valid: OK (0.07s)
  15066. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15067. 906.02 s [unordered-containers] intersectionWith
  15068. 906.02 s [unordered-containers] model: OK (0.19s)
  15069. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15070. 906.02 s [unordered-containers] valid: OK (0.04s)
  15071. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15072. 906.02 s [unordered-containers] intersectionWithKey
  15073. 906.02 s [unordered-containers] model: OK (0.22s)
  15074. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15075. 906.02 s [unordered-containers] valid: OK
  15076. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15077. 906.02 s [unordered-containers] compose
  15078. 906.02 s [unordered-containers] valid: OK (0.03s)
  15079. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15080. 906.02 s [unordered-containers] map
  15081. 906.02 s [unordered-containers] model: OK (0.31s)
  15082. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15083. 906.02 s [unordered-containers] valid: OK
  15084. 906.02 s [unordered-containers] +++ OK, passed 100 tests.
  15085. 906.02 s [unordered-containers] traverseWithKey
  15086. 906.11 s [unordered-containers] model: OK (0.30s)
  15087. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15088. 906.11 s [unordered-containers] valid: OK (0.13s)
  15089. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15090. 906.11 s [unordered-containers] mapKeys
  15091. 906.11 s [unordered-containers] model: OK (0.13s)
  15092. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15093. 906.11 s [unordered-containers] valid: OK (1.44s)
  15094. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15095. 906.11 s [unordered-containers] foldr: OK (0.12s)
  15096. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15097. 906.11 s [unordered-containers] foldl: OK (0.04s)
  15098. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15099. 906.11 s [unordered-containers] foldrWithKey: OK (0.07s)
  15100. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15101. 906.11 s [unordered-containers] foldlWithKey: OK (0.11s)
  15102. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15103. 906.11 s [unordered-containers] foldrWithKey': OK (0.08s)
  15104. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15105. 906.11 s [unordered-containers] foldlWithKey': OK (0.11s)
  15106. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15107. 906.11 s [unordered-containers] foldl': OK
  15108. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15109. 906.11 s [unordered-containers] foldr': OK (0.17s)
  15110. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15111. 906.11 s [unordered-containers] foldMapWithKey: OK (0.08s)
  15112. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15113. 906.11 s [unordered-containers] filter
  15114. 906.11 s [unordered-containers] model: OK (0.16s)
  15115. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15116. 906.11 s [unordered-containers] valid: OK (0.22s)
  15117. 906.11 s [unordered-containers] +++ OK, passed 100 tests.
  15118. 906.11 s [unordered-containers] filterWithKey
  15119. 909.04 s [unordered-containers] model: OK (5.24s)
  15120. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15121. 909.04 s [unordered-containers] valid: OK (3.62s)
  15122. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15123. 909.04 s [unordered-containers] mapMaybe
  15124. 909.04 s [unordered-containers] model: OK (0.31s)
  15125. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15126. 909.04 s [unordered-containers] valid: OK (0.16s)
  15127. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15128. 909.04 s [unordered-containers] mapMaybeWithKey
  15129. 909.04 s [unordered-containers] model: OK (5.13s)
  15130. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15131. 909.04 s [unordered-containers] valid: OK (3.26s)
  15132. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15133. 909.04 s [unordered-containers] elems: OK (0.06s)
  15134. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15135. 909.04 s [unordered-containers] keys: OK (0.02s)
  15136. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15137. 909.04 s [unordered-containers] fromList
  15138. 909.04 s [unordered-containers] model: OK (0.06s)
  15139. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15140. 909.04 s [unordered-containers] valid: OK
  15141. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15142. 909.04 s [unordered-containers] fromListWith
  15143. 909.04 s [unordered-containers] model: OK (0.06s)
  15144. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15145. 909.04 s [unordered-containers] valid: OK
  15146. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15147. 909.04 s [unordered-containers] fromListWithKey
  15148. 909.04 s [unordered-containers] model: OK (0.05s)
  15149. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15150. 909.04 s [unordered-containers] valid: OK
  15151. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15152. 909.04 s [unordered-containers] toList: OK (0.04s)
  15153. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15154. 909.04 s [unordered-containers] Data.HashMap.Strict
  15155. 909.04 s [unordered-containers] instances
  15156. 909.04 s [unordered-containers] Eq
  15157. 909.04 s [unordered-containers] ==: OK (0.08s)
  15158. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15159. 909.04 s [unordered-containers] /=: OK (0.07s)
  15160. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15161. 909.04 s [unordered-containers] Ord
  15162. 909.04 s [unordered-containers] compare reflexive: OK (0.04s)
  15163. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15164. 909.04 s [unordered-containers] compare transitive: OK (0.06s)
  15165. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15166. 909.04 s [unordered-containers] compare antisymmetric: OK (0.04s)
  15167. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15168. 909.04 s [unordered-containers] Ord => Eq: OK (0.05s)
  15169. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15170. 909.04 s [unordered-containers] Read/Show: OK (1.11s)
  15171. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15172. 909.04 s [unordered-containers] Functor: OK (0.27s)
  15173. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15174. 909.04 s [unordered-containers] Foldable: OK (0.05s)
  15175. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15176. 909.04 s [unordered-containers] Bifoldable
  15177. 909.04 s [unordered-containers] bifoldMap: OK (0.07s)
  15178. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15179. 909.04 s [unordered-containers] bifoldr: OK (0.04s)
  15180. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15181. 909.04 s [unordered-containers] bifoldl: OK (0.06s)
  15182. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15183. 909.04 s [unordered-containers] Hashable: OK (0.10s)
  15184. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15185. 909.04 s [unordered-containers] empty
  15186. 909.04 s [unordered-containers] valid: OK
  15187. 909.04 s [unordered-containers] +++ OK, passed 1 test.
  15188. 909.04 s [unordered-containers] singleton
  15189. 909.04 s [unordered-containers] valid: OK
  15190. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15191. 909.04 s [unordered-containers] size: OK (0.05s)
  15192. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15193. 909.04 s [unordered-containers] member: OK (0.01s)
  15194. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15195. 909.04 s [unordered-containers] lookup: OK (0.05s)
  15196. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15197. 909.04 s [unordered-containers] !?: OK (0.04s)
  15198. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15199. 909.04 s [unordered-containers] insert
  15200. 909.04 s [unordered-containers] model: OK (0.05s)
  15201. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15202. 909.04 s [unordered-containers] valid: OK (0.02s)
  15203. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15204. 909.04 s [unordered-containers] insertWith
  15205. 909.04 s [unordered-containers] insertWith: OK (0.03s)
  15206. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15207. 909.04 s [unordered-containers] valid: OK (0.09s)
  15208. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15209. 909.04 s [unordered-containers] delete
  15210. 909.04 s [unordered-containers] model: OK (0.05s)
  15211. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15212. 909.04 s [unordered-containers] valid: OK (0.05s)
  15213. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15214. 909.04 s [unordered-containers] adjust
  15215. 909.04 s [unordered-containers] model: OK (0.10s)
  15216. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15217. 909.04 s [unordered-containers] valid: OK (0.07s)
  15218. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15219. 909.04 s [unordered-containers] update
  15220. 909.04 s [unordered-containers] model: OK (0.04s)
  15221. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15222. 909.04 s [unordered-containers] valid: OK (0.05s)
  15223. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15224. 909.04 s [unordered-containers] alter
  15225. 909.04 s [unordered-containers] model: OK (0.05s)
  15226. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15227. 909.04 s [unordered-containers] valid: OK (0.08s)
  15228. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15229. 909.04 s [unordered-containers] alterF
  15230. 909.04 s [unordered-containers] model
  15231. 909.04 s [unordered-containers] []: OK (0.60s)
  15232. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15233. 909.04 s [unordered-containers] adjust: OK (0.05s)
  15234. 909.04 s [unordered-containers] +++ OK, passed 100 tests.
  15235. 909.06 s [unordered-containers] insert: OK (0.09s)
  15236. 909.06 s [unordered-containers] +++ OK, passed 100 tests.
  15237. 909.06 s [unordered-containers] insertWith: OK (0.08s)
  15238. 909.06 s [unordered-containers] +++ OK, passed 100 tests.
  15239. 909.07 s [unordered-containers] delete: OK (0.07s)
  15240. 909.07 s [unordered-containers] +++ OK, passed 100 tests.
  15241. 909.07 s [unordered-containers] lookup: OK (0.09s)
  15242. 909.07 s [unordered-containers] +++ OK, passed 100 tests.
  15243. 909.07 s [unordered-containers] valid: OK (0.16s)
  15244. 909.07 s [unordered-containers] +++ OK, passed 100 tests.
  15245. 909.07 s [unordered-containers] isSubmapOf
  15246. 909.07 s [unordered-containers] model: OK (0.03s)
  15247. 909.07 s [unordered-containers] +++ OK, passed 100 tests.
  15248. 909.07 s [unordered-containers] m ⊆ m: OK
  15249. 909.07 s [unordered-containers] +++ OK, passed 100 tests.
  15250. 909.07 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.15s)
  15251. 909.07 s [unordered-containers] +++ OK, passed 100 tests.
  15252. 909.07 s [unordered-containers] m1\m2 ⊆ m1: OK (0.01s)
  15253. 909.07 s [unordered-containers] +++ OK, passed 100 tests.
  15254. 909.07 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.14s)
  15255. 909.07 s [unordered-containers] +++ OK, passed 100 tests; 128 discarded.
  15256. 909.07 s [unordered-containers] delete k m ⊆ m: OK (0.02s)
  15257. 909.07 s [unordered-containers] +++ OK, passed 100 tests; 19 discarded.
  15258. 909.07 s [unordered-containers] m ⊈ delete k m : OK
  15259. 909.07 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  15260. 909.08 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
  15261. 909.08 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  15262. 909.08 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.18s)
  15263. 909.08 s [unordered-containers] +++ OK, passed 100 tests; 6 discarded.
  15264. 909.08 s [unordered-containers] union
  15265. 909.08 s [unordered-containers] model: OK (0.13s)
  15266. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15267. 909.08 s [unordered-containers] valid: OK (0.12s)
  15268. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15269. 909.08 s [unordered-containers] unionWith
  15270. 909.08 s [unordered-containers] model: OK (0.23s)
  15271. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15272. 909.08 s [unordered-containers] valid: OK (0.29s)
  15273. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15274. 909.08 s [unordered-containers] unionWithKey
  15275. 909.08 s [unordered-containers] model: OK (0.39s)
  15276. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15277. 909.08 s [unordered-containers] valid: OK (0.19s)
  15278. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15279. 909.08 s [unordered-containers] unions
  15280. 909.08 s [unordered-containers] model: OK (3.74s)
  15281. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15282. 909.08 s [unordered-containers] valid: OK (2.17s)
  15283. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15284. 909.08 s [unordered-containers] difference
  15285. 909.08 s [unordered-containers] model: OK (0.09s)
  15286. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15287. 909.08 s [unordered-containers] valid: OK (0.04s)
  15288. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15289. 909.08 s [unordered-containers] differenceWith
  15290. 909.08 s [unordered-containers] model: OK (0.25s)
  15291. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15292. 909.08 s [unordered-containers] valid: OK (0.18s)
  15293. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15294. 909.08 s [unordered-containers] intersection
  15295. 909.08 s [unordered-containers] model: OK (0.10s)
  15296. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15297. 909.08 s [unordered-containers] valid: OK (0.13s)
  15298. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15299. 909.08 s [unordered-containers] intersectionWith
  15300. 909.08 s [unordered-containers] model: OK (0.30s)
  15301. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15302. 909.08 s [unordered-containers] valid: OK (0.23s)
  15303. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15304. 909.08 s [unordered-containers] intersectionWithKey
  15305. 909.08 s [unordered-containers] model: OK (0.46s)
  15306. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15307. 909.08 s [unordered-containers] valid: OK (0.30s)
  15308. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15309. 909.08 s [unordered-containers] compose
  15310. 909.08 s [unordered-containers] valid: OK (0.10s)
  15311. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15312. 909.08 s [unordered-containers] map
  15313. 909.08 s [unordered-containers] model: OK (0.38s)
  15314. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15315. 909.08 s [unordered-containers] valid: OK (0.25s)
  15316. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15317. 909.08 s [unordered-containers] traverseWithKey
  15318. 909.08 s [unordered-containers] model: OK (0.77s)
  15319. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15320. 909.08 s [unordered-containers] valid: OK (0.18s)
  15321. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15322. 909.08 s [unordered-containers] mapKeys
  15323. 909.08 s [unordered-containers] model: OK (0.12s)
  15324. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15325. 909.08 s [unordered-containers] valid: OK (2.10s)
  15326. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15327. 909.08 s [unordered-containers] foldr: OK (0.11s)
  15328. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15329. 909.08 s [unordered-containers] foldl: OK (0.07s)
  15330. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15331. 909.08 s [unordered-containers] foldrWithKey: OK (0.05s)
  15332. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15333. 909.08 s [unordered-containers] foldlWithKey: OK (0.06s)
  15334. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15335. 909.08 s [unordered-containers] foldrWithKey': OK (0.02s)
  15336. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15337. 909.08 s [unordered-containers] foldlWithKey': OK (0.06s)
  15338. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15339. 909.08 s [unordered-containers] foldl': OK (0.14s)
  15340. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15341. 909.08 s [unordered-containers] foldr': OK (0.08s)
  15342. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15343. 909.08 s [unordered-containers] foldMapWithKey: OK (0.08s)
  15344. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15345. 909.08 s [unordered-containers] filter
  15346. 909.08 s [unordered-containers] model: OK (0.37s)
  15347. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15348. 909.08 s [unordered-containers] valid: OK (0.35s)
  15349. 909.08 s [unordered-containers] +++ OK, passed 100 tests.
  15350. 909.08 s [unordered-containers] filterWithKey
  15351. 909.41 s [unordered-containers] model: OK (4.15s)
  15352. 909.41 s [unordered-containers] +++ OK, passed 100 tests.
  15353. 909.53 s [unordered-containers] valid: OK (3.23s)
  15354. 909.53 s [unordered-containers] +++ OK, passed 100 tests.
  15355. 909.53 s [unordered-containers] mapMaybe
  15356. 909.53 s [unordered-containers] model: OK (0.43s)
  15357. 909.53 s [unordered-containers] +++ OK, passed 100 tests.
  15358. 909.53 s [unordered-containers] valid: OK (0.26s)
  15359. 909.53 s [unordered-containers] +++ OK, passed 100 tests.
  15360. 909.53 s [unordered-containers] mapMaybeWithKey
  15361. 909.80 s [unordered-containers] model: OK (4.46s)
  15362. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15363. 909.80 s [unordered-containers] valid: OK (3.27s)
  15364. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15365. 909.80 s [unordered-containers] elems: OK (0.14s)
  15366. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15367. 909.80 s [unordered-containers] keys: OK (0.07s)
  15368. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15369. 909.80 s [unordered-containers] fromList
  15370. 909.80 s [unordered-containers] model: OK (0.10s)
  15371. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15372. 909.80 s [unordered-containers] valid: OK (0.02s)
  15373. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15374. 909.80 s [unordered-containers] fromListWith
  15375. 909.80 s [unordered-containers] model: OK (0.06s)
  15376. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15377. 909.80 s [unordered-containers] valid: OK (0.11s)
  15378. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15379. 909.80 s [unordered-containers] fromListWithKey
  15380. 909.80 s [unordered-containers] model: OK (0.11s)
  15381. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15382. 909.80 s [unordered-containers] valid: OK (0.20s)
  15383. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15384. 909.80 s [unordered-containers] toList: OK (0.06s)
  15385. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15386. 909.80 s [unordered-containers] Data.HashSet
  15387. 909.80 s [unordered-containers] instances
  15388. 909.80 s [unordered-containers] Eq
  15389. 909.80 s [unordered-containers] ==: OK (0.06s)
  15390. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15391. 909.80 s [unordered-containers] == permutations: OK (0.12s)
  15392. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15393. 909.80 s [unordered-containers] /=: OK (0.10s)
  15394. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15395. 909.80 s [unordered-containers] Ord
  15396. 909.80 s [unordered-containers] compare reflexive: OK (0.07s)
  15397. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15398. 909.80 s [unordered-containers] compare transitive: OK (0.16s)
  15399. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15400. 909.80 s [unordered-containers] compare antisymmetric: OK (0.03s)
  15401. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15402. 909.80 s [unordered-containers] Ord => Eq: OK (0.07s)
  15403. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15404. 909.80 s [unordered-containers] Read/Show: OK (1.33s)
  15405. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15406. 909.80 s [unordered-containers] Foldable: OK (0.11s)
  15407. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15408. 909.80 s [unordered-containers] Hashable: OK (0.15s)
  15409. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15410. 909.80 s [unordered-containers] size: OK (0.07s)
  15411. 909.80 s [unordered-containers] +++ OK, passed 100 tests.
  15412. 909.80 s [unordered-containers] member: OK (0.05s)
  15413. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15414. 909.81 s [unordered-containers] insert: OK (0.12s)
  15415. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15416. 909.81 s [unordered-containers] delete: OK (0.20s)
  15417. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15418. 909.81 s [unordered-containers] union: OK (0.12s)
  15419. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15420. 909.81 s [unordered-containers] map: OK (3.18s)
  15421. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15422. 909.81 s [unordered-containers] foldr: OK (0.05s)
  15423. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15424. 909.81 s [unordered-containers] foldl': OK (0.09s)
  15425. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15426. 909.81 s [unordered-containers] filter: OK (3.05s)
  15427. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15428. 909.81 s [unordered-containers] toList: OK (0.27s)
  15429. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15430. 909.81 s [unordered-containers] Data.HashMap.Internal.List
  15431. 909.81 s [unordered-containers] isPermutationBy: OK (0.20s)
  15432. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15433. 909.81 s [unordered-containers] isPermutationBy of different length: OK (0.05s)
  15434. 909.81 s [unordered-containers] +++ OK, passed 100 tests; 19 discarded.
  15435. 909.81 s [unordered-containers] pUnorderedCompare: OK (0.25s)
  15436. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15437. 909.81 s [unordered-containers] modelUnorderedCompare
  15438. 909.81 s [unordered-containers] reflexive: OK (0.01s)
  15439. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15440. 909.81 s [unordered-containers] anti-symmetric: OK (0.06s)
  15441. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15442. 909.81 s [unordered-containers] transitive: OK (0.10s)
  15443. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15444. 909.81 s [unordered-containers] Regression tests
  15445. 909.81 s [unordered-containers] issue32: OK
  15446. 909.81 s [unordered-containers] issue39a: OK
  15447. 909.81 s [unordered-containers] issue39b: OK (0.08s)
  15448. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15449. 909.81 s [unordered-containers] issue254 lazy: OK (0.14s)
  15450. 909.81 s [unordered-containers] issue254 strict: OK (0.03s)
  15451. 909.81 s [unordered-containers] issue379
  15452. 909.81 s [unordered-containers] Lazy.unionWith: OK (0.02s)
  15453. 909.81 s [unordered-containers] union: OK
  15454. 909.81 s [unordered-containers] Strict.unionWith: OK
  15455. 909.81 s [unordered-containers] Strict.unionWithKey: OK
  15456. 909.81 s [unordered-containers] issue381
  15457. 909.81 s [unordered-containers] mapMaybe: OK
  15458. 909.81 s [unordered-containers] mapMaybeWithKey: OK
  15459. 909.81 s [unordered-containers] issue382: OK (0.02s)
  15460. 909.81 s [unordered-containers] issue383: OK
  15461. 909.81 s [unordered-containers] issue420: OK
  15462. 909.81 s [unordered-containers] issue491
  15463. 909.81 s [unordered-containers] 1: OK
  15464. 909.81 s [unordered-containers] 2: OK
  15465. 909.81 s [unordered-containers] 3: OK
  15466. 909.81 s [unordered-containers] Strictness
  15467. 909.81 s [unordered-containers] HashMap.Strict
  15468. 909.81 s [unordered-containers] singleton is key-strict: OK (0.01s)
  15469. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15470. 909.81 s [unordered-containers] singleton is value-strict: OK (0.02s)
  15471. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15472. 909.81 s [unordered-containers] member is key-strict: OK
  15473. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15474. 909.81 s [unordered-containers] lookup is key-strict: OK
  15475. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15476. 909.81 s [unordered-containers] lookupDefault is key-strict: OK
  15477. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15478. 909.81 s [unordered-containers] findWithDefault is key-strict: OK
  15479. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15480. 909.81 s [unordered-containers] ! is key-strict: OK
  15481. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15482. 909.81 s [unordered-containers] delete is key-strict: OK
  15483. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15484. 909.81 s [unordered-containers] adjust is key-strict: OK (0.02s)
  15485. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15486. 909.81 s [unordered-containers] adjust is value-strict: OK (0.09s)
  15487. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15488. 909.81 s [unordered-containers] insert is key-strict: OK (0.03s)
  15489. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15490. 909.81 s [unordered-containers] insert is value-strict: OK (0.03s)
  15491. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15492. 909.81 s [unordered-containers] insertWith is key-strict: OK (0.04s)
  15493. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15494. 909.81 s [unordered-containers] insertWith is value-strict: OK (0.12s)
  15495. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15496. 909.81 s [unordered-containers] fromList is key-strict: OK (0.04s)
  15497. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15498. 909.81 s [unordered-containers] fromList is value-strict: OK
  15499. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15500. 909.81 s [unordered-containers] fromListWith is key-strict: OK
  15501. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15502. 909.81 s [unordered-containers] fromListWith is value-strict: OK (0.08s)
  15503. 909.81 s [unordered-containers] +++ OK, passed 100 tests.
  15504. 909.81 s [unordered-containers]
  15505. 909.81 s [unordered-containers] All 257 tests passed (6.46s)
  15506. 909.83 s [unordered-containers] Test suite unordered-containers-tests: PASS
  15507. 909.83 s [unordered-containers] Test suite logged to:
  15508. 909.83 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  15509. 909.83 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  15510. 909.85 s [unordered-containers] Phase: haddockPhase
  15511. 910.27 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  15512. 910.27 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1...
  15513. 910.75 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  15514. 910.76 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  15515. 910.76 s [unordered-containers] |
  15516. 910.76 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  15517. 910.76 s [unordered-containers] | ^^^^^^^^^^
  15518. 910.76 s [unordered-containers]
  15519. 912.09 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  15520. 912.87 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  15521. 912.87 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  15522. 912.87 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  15523. 912.88 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  15524. 912.88 s [unordered-containers] |
  15525. 912.88 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  15526. 912.88 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  15527. 912.88 s [unordered-containers]
  15528. 912.90 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  15529. 912.95 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  15530. 915.45 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  15531. 915.56 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  15532. 916.08 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  15533. 916.36 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  15534. 916.38 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  15535. 916.38 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  15536. 916.39 s [unordered-containers] Haddock coverage:
  15537. 916.40 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  15538. 916.40 s [unordered-containers] Missing documentation for:
  15539. 916.40 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  15540. 916.40 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  15541. 916.40 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  15542. 916.40 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  15543. 916.40 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  15544. 916.40 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  15545. 916.40 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  15546. 916.40 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  15547. 916.40 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  15548. 916.40 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  15549. 916.40 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  15550. 916.40 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  15551. 916.40 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  15552. 916.40 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  15553. 916.40 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  15554. 916.40 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  15555. 916.40 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  15556. 916.40 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  15557. 916.40 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  15558. 916.40 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  15559. 916.40 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  15560. 916.40 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  15561. 916.40 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  15562. 916.40 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  15563. 916.40 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  15564. 916.40 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  15565. 916.40 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  15566. 916.40 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  15567. 916.40 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  15568. 916.40 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  15569. 916.40 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  15570. 916.40 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  15571. 916.40 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  15572. 916.40 s [unordered-containers] Missing documentation for:
  15573. 916.40 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  15574. 916.40 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  15575. 916.40 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  15576. 916.41 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  15577. 916.41 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  15578. 916.41 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  15579. 916.41 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  15580. 916.41 s [unordered-containers] by specifying the type/value namespace explicitly.
  15581. 916.41 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  15582. 916.41 s [unordered-containers] Warning: 'at' is out of scope.
  15583. 916.41 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  15584. 916.42 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  15585. 916.42 s [unordered-containers] Missing documentation for:
  15586. 916.43 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  15587. 916.43 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  15588. 916.43 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  15589. 916.43 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  15590. 916.43 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  15591. 916.43 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  15592. 916.43 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  15593. 916.43 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  15594. 916.43 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  15595. 916.43 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  15596. 916.43 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  15597. 916.43 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  15598. 916.43 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  15599. 916.43 s [unordered-containers] Missing documentation for:
  15600. 916.43 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  15601. 916.43 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  15602. 916.43 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  15603. 916.43 s [unordered-containers] Warning: 'lookup' is out of scope.
  15604. 916.43 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  15605. 916.43 s [unordered-containers] Warning: 'at' is out of scope.
  15606. 916.43 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  15607. 916.43 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  15608. 916.43 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  15609. 916.43 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  15610. 916.43 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  15611. 916.43 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  15612. 916.43 s [unordered-containers] by specifying the type/value namespace explicitly.
  15613. 916.43 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  15614. 916.44 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  15615. 916.44 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  15616. 916.44 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  15617. 916.44 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  15618. 916.44 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  15619. 916.44 s [unordered-containers] by specifying the type/value namespace explicitly.
  15620. 916.44 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  15621. 916.44 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  15622. 916.44 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  15623. 916.44 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  15624. 929.32 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  15625. 929.32 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  15626. 929.47 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  15627. 929.48 s [unordered-containers] Phase: installPhase
  15628. 929.65 s [unordered-containers] Installing library in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  15629. 930.28 s [unordered-containers] Phase: fixupPhase
  15630. 930.31 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
  15631. 930.32 s [unordered-containers] shrinking /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSunordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf-ghc9.10.3.so
  15632. 930.33 s [unordered-containers] checking for references to /build/ in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1...
  15633. 930.36 s [unordered-containers] patching script interpreter paths in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
  15634. 930.37 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib
  15635. 930.63 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc
  15636. 930.65 s [unordered-containers] checking for references to /build/ in /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc...
  15637. 930.68 s [unordered-containers] patching script interpreter paths in /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc
  15638. 930.88 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
  15639. 940.37 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  15640. 940.40 s [post-build-hook] Uploading to the NixCI cache: /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
  15641. 940.47 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15642. 940.66 s [post-build-hook] copying 1 paths...
  15643. 940.66 s [post-build-hook] copying path '/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  15644. 944.63 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15645. 944.77 s [post-build-hook] copying 0 paths...
  15646. 944.82 s Progress: 11 of 19 built, 193 of 193 downloaded from cache
  15647. 944.92 s Building quickcheck-instances
  15648. 945.06 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  15649. 945.07 s [quickcheck-instances] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  15650. 945.35 s [quickcheck-instances] Phase: unpackPhase
  15651. 945.35 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  15652. 945.36 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  15653. 945.37 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  15654. 945.38 s [quickcheck-instances] Phase: patchPhase
  15655. 945.38 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  15656. 945.39 s [quickcheck-instances] Phase: compileBuildDriverPhase
  15657. 945.39 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.Stu7nxCuAS/setup-package.conf.d -threaded
  15658. 945.49 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.Stu7nxCuAS/Main.o )
  15659. 945.59 s [quickcheck-instances] [2 of 2] Linking Setup
  15660. 947.15 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  15661. 947.16 s [quickcheck-instances] Phase: configurePhase
  15662. 947.16 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.Stu7nxCuAS/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  15663. 947.18 s [quickcheck-instances] Using Parsec parser
  15664. 947.18 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  15665. 947.96 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  15666. 947.96 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  15667. 947.96 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  15668. 947.96 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.20.2.0
  15669. 947.96 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
  15670. 947.96 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  15671. 947.96 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  15672. 947.96 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  15673. 947.96 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  15674. 947.96 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  15675. 947.96 s [quickcheck-instances] integer-logarithms-1.0.4
  15676. 947.96 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  15677. 947.96 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  15678. 947.96 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  15679. 947.96 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  15680. 947.96 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  15681. 947.96 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  15682. 947.96 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.3
  15683. 947.96 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  15684. 947.96 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  15685. 947.96 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  15686. 947.96 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.1
  15687. 947.96 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  15688. 947.96 s [quickcheck-instances] unordered-containers-0.2.20.1
  15689. 947.96 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  15690. 947.96 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  15691. 947.96 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  15692. 947.96 s [quickcheck-instances] Dependency base: using base-4.20.2.0
  15693. 947.96 s [quickcheck-instances] Dependency containers: using containers-0.7
  15694. 947.96 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  15695. 947.96 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  15696. 947.96 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  15697. 947.96 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  15698. 947.96 s [quickcheck-instances] Source component graph:
  15699. 947.96 s [quickcheck-instances] component lib
  15700. 947.96 s [quickcheck-instances] component test:self-test dependency lib
  15701. 947.96 s [quickcheck-instances] Configured component graph:
  15702. 947.96 s [quickcheck-instances] component quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15703. 947.96 s [quickcheck-instances] include OneTuple-0.4.2-FyDXXJxd68Y9jTC7VxsRZq
  15704. 947.96 s [quickcheck-instances] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15705. 947.96 s [quickcheck-instances] include array-0.5.8.0-78a1
  15706. 947.96 s [quickcheck-instances] include base-4.20.2.0-acb8
  15707. 947.96 s [quickcheck-instances] include bytestring-0.12.2.0-04d5
  15708. 947.96 s [quickcheck-instances] include case-insensitive-1.2.1.0-Ctc9JutduFF2D0dK2Xysr7
  15709. 947.96 s [quickcheck-instances] include containers-0.7-a3f6
  15710. 947.96 s [quickcheck-instances] include data-fix-0.3.4-9yERijClVHm7aLi2wKvMUx
  15711. 947.96 s [quickcheck-instances] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  15712. 947.96 s [quickcheck-instances] include integer-logarithms-1.0.4-JAvo9izUTxA8wBq9muGdU8
  15713. 947.96 s [quickcheck-instances] include old-time-1.1.0.4-KdoNf3UNdMG7Q2AiOvfcA8
  15714. 947.96 s [quickcheck-instances] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15715. 947.96 s [quickcheck-instances] include scientific-0.3.8.0-IpVOxD0V8927oVTYb6GgE
  15716. 947.96 s [quickcheck-instances] include splitmix-0.1.3.1-1NkY18pzkc6CKWzhmiYn4u
  15717. 947.96 s [quickcheck-instances] include strict-0.5.1-JyokuSJrXwYGeFesEkaEwG
  15718. 947.96 s [quickcheck-instances] include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15719. 947.96 s [quickcheck-instances] include text-2.1.3-e138
  15720. 947.96 s [quickcheck-instances] include text-short-0.1.6-r1vhOAgHHr3TnFZaYcqZr
  15721. 947.96 s [quickcheck-instances] include these-1.2.1-J38nvrZc9Pg6DEkxcKUfl5
  15722. 947.96 s [quickcheck-instances] include time-compat-1.9.8-7kyDhbeIppD4AgHq2X4xCx
  15723. 947.96 s [quickcheck-instances] include transformers-0.6.1.1-74e0
  15724. 947.96 s [quickcheck-instances] include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  15725. 947.96 s [quickcheck-instances] include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15726. 947.96 s [quickcheck-instances] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  15727. 947.96 s [quickcheck-instances] component quickcheck-instances-0.3.33-CWXsN6DMjs1E6LMHqJuRhG-self-test
  15728. 947.96 s [quickcheck-instances] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15729. 947.96 s [quickcheck-instances] include base-4.20.2.0-acb8
  15730. 947.96 s [quickcheck-instances] include containers-0.7-a3f6
  15731. 947.96 s [quickcheck-instances] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15732. 947.96 s [quickcheck-instances] include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15733. 947.96 s [quickcheck-instances] include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15734. 947.96 s [quickcheck-instances] include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15735. 947.96 s [quickcheck-instances] Linked component graph:
  15736. 947.96 s [quickcheck-instances] unit quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15737. 947.96 s [quickcheck-instances] include OneTuple-0.4.2-FyDXXJxd68Y9jTC7VxsRZq
  15738. 947.96 s [quickcheck-instances] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15739. 947.96 s [quickcheck-instances] include array-0.5.8.0-78a1
  15740. 947.96 s [quickcheck-instances] include base-4.20.2.0-acb8
  15741. 947.96 s [quickcheck-instances] include bytestring-0.12.2.0-04d5
  15742. 947.96 s [quickcheck-instances] include case-insensitive-1.2.1.0-Ctc9JutduFF2D0dK2Xysr7
  15743. 947.96 s [quickcheck-instances] include containers-0.7-a3f6
  15744. 947.96 s [quickcheck-instances] include data-fix-0.3.4-9yERijClVHm7aLi2wKvMUx
  15745. 947.96 s [quickcheck-instances] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  15746. 947.96 s [quickcheck-instances] include integer-logarithms-1.0.4-JAvo9izUTxA8wBq9muGdU8
  15747. 947.96 s [quickcheck-instances] include old-time-1.1.0.4-KdoNf3UNdMG7Q2AiOvfcA8
  15748. 947.96 s [quickcheck-instances] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15749. 947.96 s [quickcheck-instances] include scientific-0.3.8.0-IpVOxD0V8927oVTYb6GgE
  15750. 947.96 s [quickcheck-instances] include splitmix-0.1.3.1-1NkY18pzkc6CKWzhmiYn4u
  15751. 947.96 s [quickcheck-instances] include strict-0.5.1-JyokuSJrXwYGeFesEkaEwG
  15752. 947.96 s [quickcheck-instances] include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15753. 947.96 s [quickcheck-instances] include text-2.1.3-e138
  15754. 947.96 s [quickcheck-instances] include text-short-0.1.6-r1vhOAgHHr3TnFZaYcqZr
  15755. 947.96 s [quickcheck-instances] include these-1.2.1-J38nvrZc9Pg6DEkxcKUfl5
  15756. 947.96 s [quickcheck-instances] include time-compat-1.9.8-7kyDhbeIppD4AgHq2X4xCx
  15757. 947.96 s [quickcheck-instances] include transformers-0.6.1.1-74e0
  15758. 947.96 s [quickcheck-instances] include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  15759. 947.96 s [quickcheck-instances] include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15760. 947.96 s [quickcheck-instances] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  15761. 947.96 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Void
  15762. 947.96 s [quickcheck-instances] unit quickcheck-instances-0.3.33-CWXsN6DMjs1E6LMHqJuRhG-self-test
  15763. 947.96 s [quickcheck-instances] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15764. 947.98 s [quickcheck-instances] include base-4.20.2.0-acb8
  15765. 947.98 s [quickcheck-instances] include containers-0.7-a3f6
  15766. 947.98 s [quickcheck-instances] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15767. 947.98 s [quickcheck-instances] include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15768. 947.98 s [quickcheck-instances] include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15769. 947.98 s [quickcheck-instances] include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15770. 947.98 s [quickcheck-instances] Ready component graph:
  15771. 947.98 s [quickcheck-instances] definite quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15772. 947.98 s [quickcheck-instances] depends OneTuple-0.4.2-FyDXXJxd68Y9jTC7VxsRZq
  15773. 947.98 s [quickcheck-instances] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15774. 947.98 s [quickcheck-instances] depends array-0.5.8.0-78a1
  15775. 947.98 s [quickcheck-instances] depends base-4.20.2.0-acb8
  15776. 947.98 s [quickcheck-instances] depends bytestring-0.12.2.0-04d5
  15777. 947.98 s [quickcheck-instances] depends case-insensitive-1.2.1.0-Ctc9JutduFF2D0dK2Xysr7
  15778. 947.98 s [quickcheck-instances] depends containers-0.7-a3f6
  15779. 947.98 s [quickcheck-instances] depends data-fix-0.3.4-9yERijClVHm7aLi2wKvMUx
  15780. 947.98 s [quickcheck-instances] depends hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  15781. 947.98 s [quickcheck-instances] depends integer-logarithms-1.0.4-JAvo9izUTxA8wBq9muGdU8
  15782. 947.98 s [quickcheck-instances] depends old-time-1.1.0.4-KdoNf3UNdMG7Q2AiOvfcA8
  15783. 947.98 s [quickcheck-instances] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15784. 947.98 s [quickcheck-instances] depends scientific-0.3.8.0-IpVOxD0V8927oVTYb6GgE
  15785. 947.98 s [quickcheck-instances] depends splitmix-0.1.3.1-1NkY18pzkc6CKWzhmiYn4u
  15786. 947.98 s [quickcheck-instances] depends strict-0.5.1-JyokuSJrXwYGeFesEkaEwG
  15787. 947.98 s [quickcheck-instances] depends tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15788. 947.98 s [quickcheck-instances] depends text-2.1.3-e138
  15789. 947.98 s [quickcheck-instances] depends text-short-0.1.6-r1vhOAgHHr3TnFZaYcqZr
  15790. 947.98 s [quickcheck-instances] depends these-1.2.1-J38nvrZc9Pg6DEkxcKUfl5
  15791. 947.98 s [quickcheck-instances] depends time-compat-1.9.8-7kyDhbeIppD4AgHq2X4xCx
  15792. 947.98 s [quickcheck-instances] depends transformers-0.6.1.1-74e0
  15793. 947.98 s [quickcheck-instances] depends unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  15794. 947.98 s [quickcheck-instances] depends uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15795. 947.98 s [quickcheck-instances] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  15796. 947.98 s [quickcheck-instances] definite quickcheck-instances-0.3.33-CWXsN6DMjs1E6LMHqJuRhG-self-test
  15797. 947.98 s [quickcheck-instances] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15798. 947.98 s [quickcheck-instances] depends base-4.20.2.0-acb8
  15799. 947.98 s [quickcheck-instances] depends containers-0.7-a3f6
  15800. 947.98 s [quickcheck-instances] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15801. 947.98 s [quickcheck-instances] depends quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15802. 947.98 s [quickcheck-instances] depends tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15803. 947.98 s [quickcheck-instances] depends uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15804. 947.98 s [quickcheck-instances] Using Cabal-3.12.1.0 compiled by ghc-9.10
  15805. 947.98 s [quickcheck-instances] Using compiler: ghc-9.10.3
  15806. 947.98 s [quickcheck-instances] Using install prefix:
  15807. 947.98 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33
  15808. 947.98 s [quickcheck-instances] Executables installed in:
  15809. 947.98 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/bin
  15810. 947.98 s [quickcheck-instances] Libraries installed in:
  15811. 947.98 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15812. 947.98 s [quickcheck-instances] Dynamic Libraries installed in:
  15813. 947.98 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  15814. 947.98 s [quickcheck-instances] Private executables installed in:
  15815. 947.98 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33
  15816. 947.98 s [quickcheck-instances] Data files installed in:
  15817. 947.98 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33
  15818. 947.98 s [quickcheck-instances] Documentation installed in:
  15819. 947.98 s [quickcheck-instances] /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  15820. 947.98 s [quickcheck-instances] Configuration files installed in:
  15821. 947.98 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/etc
  15822. 947.98 s [quickcheck-instances] No alex found
  15823. 947.98 s [quickcheck-instances] Using ar found on system at:
  15824. 947.98 s [quickcheck-instances] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  15825. 947.98 s [quickcheck-instances] No c2hs found
  15826. 947.98 s [quickcheck-instances] No cpphs found
  15827. 947.98 s [quickcheck-instances] No doctest found
  15828. 947.98 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  15829. 947.98 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  15830. 947.98 s [quickcheck-instances] Using ghc version 9.10.3 found on system at:
  15831. 947.98 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  15832. 947.98 s [quickcheck-instances] Using ghc-pkg version 9.10.3 found on system at:
  15833. 947.98 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  15834. 947.98 s [quickcheck-instances] No ghcjs found
  15835. 947.98 s [quickcheck-instances] No ghcjs-pkg found
  15836. 947.98 s [quickcheck-instances] No greencard found
  15837. 947.98 s [quickcheck-instances] Using haddock version 2.31.1 found on system at:
  15838. 947.98 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  15839. 947.98 s [quickcheck-instances] No happy found
  15840. 947.98 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  15841. 947.98 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15842. 947.98 s [quickcheck-instances] No hmake found
  15843. 947.98 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  15844. 947.98 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  15845. 947.98 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  15846. 947.98 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  15847. 947.98 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  15848. 947.98 s [quickcheck-instances] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  15849. 947.98 s [quickcheck-instances] No jhc found
  15850. 947.98 s [quickcheck-instances] Using ld found on system at:
  15851. 947.98 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  15852. 947.98 s [quickcheck-instances] No pkg-config found
  15853. 947.98 s [quickcheck-instances] Using runghc version 9.10.3 found on system at:
  15854. 947.98 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  15855. 947.98 s [quickcheck-instances] Using strip version 2.44 found on system at:
  15856. 947.98 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  15857. 947.98 s [quickcheck-instances] Using tar found on system at:
  15858. 947.98 s [quickcheck-instances] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  15859. 947.98 s [quickcheck-instances] No uhc found
  15860. 948.13 s [quickcheck-instances] Phase: buildPhase
  15861. 948.21 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  15862. 948.22 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33...
  15863. 948.36 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.o, dist/build/Test/QuickCheck/Instances/Containers.dyn_o )
  15864. 948.41 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.o, dist/build/Test/QuickCheck/Instances/CustomPrelude.dyn_o )
  15865. 948.42 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.o, dist/build/Test/QuickCheck/Instances/CaseInsensitive.dyn_o )
  15866. 948.71 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.o, dist/build/Test/QuickCheck/Instances/ByteString.dyn_o )
  15867. 948.71 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.o, dist/build/Test/QuickCheck/Instances/Array.dyn_o )
  15868. 949.07 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.o, dist/build/Test/QuickCheck/Instances/DataFix.dyn_o )
  15869. 949.07 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.o, dist/build/Test/QuickCheck/Instances/Hashable.dyn_o )
  15870. 949.07 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.o, dist/build/Test/QuickCheck/Instances/Natural.dyn_o )
  15871. 949.07 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.o, dist/build/Test/QuickCheck/Instances/OldTime.dyn_o )
  15872. 949.28 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.o, dist/build/Test/QuickCheck/Instances/Primitive.dyn_o )
  15873. 949.28 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.o, dist/build/Test/QuickCheck/Instances/Array/Byte.dyn_o )
  15874. 949.28 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.o, dist/build/Test/QuickCheck/Instances/Scientific.dyn_o )
  15875. 949.28 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.o, dist/build/Test/QuickCheck/Instances/Semigroup.dyn_o )
  15876. 949.28 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.o, dist/build/Test/QuickCheck/Instances/Solo.dyn_o )
  15877. 949.28 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.o, dist/build/Test/QuickCheck/Instances/Strict.dyn_o )
  15878. 949.28 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.o, dist/build/Test/QuickCheck/Instances/Tagged.dyn_o )
  15879. 949.28 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.o, dist/build/Test/QuickCheck/Instances/Text.dyn_o )
  15880. 949.28 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.o, dist/build/Test/QuickCheck/Instances/Text/Short.dyn_o )
  15881. 949.28 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.o, dist/build/Test/QuickCheck/Instances/These.dyn_o )
  15882. 949.28 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.o, dist/build/Test/QuickCheck/Instances/Time.dyn_o )
  15883. 949.81 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.o, dist/build/Test/QuickCheck/Instances/Transformer.dyn_o )
  15884. 949.81 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.o, dist/build/Test/QuickCheck/Instances/UUID.dyn_o )
  15885. 949.81 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.o, dist/build/Test/QuickCheck/Instances/UnorderedContainers.dyn_o )
  15886. 949.81 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.o, dist/build/Test/QuickCheck/Instances/Vector.dyn_o )
  15887. 949.81 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.o, dist/build/Test/QuickCheck/Instances/Void.dyn_o )
  15888. 949.81 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.o, dist/build/Test/QuickCheck/Instances.dyn_o )
  15889. 950.14 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.p_o )
  15890. 950.34 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.p_o )
  15891. 950.67 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.p_o )
  15892. 951.02 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.p_o )
  15893. 951.22 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.p_o )
  15894. 951.22 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.p_o )
  15895. 951.22 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.p_o )
  15896. 951.22 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.p_o )
  15897. 951.22 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.p_o )
  15898. 951.22 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.p_o )
  15899. 951.22 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.p_o )
  15900. 951.22 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.p_o )
  15901. 951.22 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.p_o )
  15902. 951.22 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.p_o )
  15903. 951.22 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.p_o )
  15904. 951.43 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.p_o )
  15905. 951.43 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.p_o )
  15906. 951.43 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.p_o )
  15907. 951.43 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.p_o )
  15908. 951.43 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.p_o )
  15909. 951.78 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.p_o )
  15910. 951.78 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.p_o )
  15911. 951.78 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.p_o )
  15912. 951.78 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.p_o )
  15913. 951.78 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.p_o )
  15914. 951.78 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  15915. 954.00 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  15916. 954.00 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33...
  15917. 954.10 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  15918. 954.41 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  15919. 955.19 s [quickcheck-instances] Phase: checkPhase
  15920. 955.57 s [quickcheck-instances] Running 1 test suites...
  15921. 955.57 s [quickcheck-instances] Test suite self-test: RUNNING...
  15922. 955.58 s [quickcheck-instances] +++ OK, passed 100 tests.
  15923. 955.58 s [quickcheck-instances] +++ OK, passed 100 tests.
  15924. 955.58 s [quickcheck-instances] +++ OK, passed 100 tests.
  15925. 955.58 s [quickcheck-instances] +++ OK, passed 100 tests.
  15926. 955.59 s [quickcheck-instances] +++ OK, passed 100 tests.
  15927. 955.59 s [quickcheck-instances] Test suite self-test: PASS
  15928. 955.59 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  15929. 955.59 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  15930. 955.60 s [quickcheck-instances] Phase: haddockPhase
  15931. 955.80 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  15932. 955.81 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33...
  15933. 955.85 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  15934. 955.85 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  15935. 956.09 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  15936. 956.11 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  15937. 956.13 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  15938. 956.27 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  15939. 956.31 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  15940. 956.34 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  15941. 956.36 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  15942. 956.37 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  15943. 956.38 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  15944. 956.41 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  15945. 956.55 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  15946. 956.55 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  15947. 956.56 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  15948. 956.59 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  15949. 956.59 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  15950. 956.65 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  15951. 956.70 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  15952. 956.71 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  15953. 956.72 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  15954. 956.75 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  15955. 956.87 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  15956. 956.91 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  15957. 956.92 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  15958. 956.94 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  15959. 957.14 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  15960. 957.14 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  15961. 957.15 s [quickcheck-instances] Haddock coverage:
  15962. 957.15 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  15963. 957.15 s [quickcheck-instances] Missing documentation for:
  15964. 957.15 s [quickcheck-instances] Module header
  15965. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  15966. 957.16 s [quickcheck-instances] Missing documentation for:
  15967. 957.16 s [quickcheck-instances] Module header
  15968. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  15969. 957.16 s [quickcheck-instances] Missing documentation for:
  15970. 957.16 s [quickcheck-instances] Module header
  15971. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  15972. 957.16 s [quickcheck-instances] Missing documentation for:
  15973. 957.16 s [quickcheck-instances] Module header
  15974. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  15975. 957.16 s [quickcheck-instances] Missing documentation for:
  15976. 957.16 s [quickcheck-instances] Module header
  15977. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  15978. 957.16 s [quickcheck-instances] Missing documentation for:
  15979. 957.16 s [quickcheck-instances] Module header
  15980. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  15981. 957.16 s [quickcheck-instances] Missing documentation for:
  15982. 957.16 s [quickcheck-instances] Module header
  15983. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  15984. 957.16 s [quickcheck-instances] Missing documentation for:
  15985. 957.16 s [quickcheck-instances] Module header
  15986. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  15987. 957.16 s [quickcheck-instances] Missing documentation for:
  15988. 957.16 s [quickcheck-instances] Module header
  15989. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  15990. 957.16 s [quickcheck-instances] Missing documentation for:
  15991. 957.16 s [quickcheck-instances] Module header
  15992. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  15993. 957.16 s [quickcheck-instances] Missing documentation for:
  15994. 957.16 s [quickcheck-instances] Module header
  15995. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  15996. 957.16 s [quickcheck-instances] Missing documentation for:
  15997. 957.16 s [quickcheck-instances] Module header
  15998. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  15999. 957.16 s [quickcheck-instances] Missing documentation for:
  16000. 957.16 s [quickcheck-instances] Module header
  16001. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  16002. 957.16 s [quickcheck-instances] Missing documentation for:
  16003. 957.16 s [quickcheck-instances] Module header
  16004. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  16005. 957.16 s [quickcheck-instances] Missing documentation for:
  16006. 957.16 s [quickcheck-instances] Module header
  16007. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  16008. 957.16 s [quickcheck-instances] Missing documentation for:
  16009. 957.16 s [quickcheck-instances] Module header
  16010. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  16011. 957.16 s [quickcheck-instances] Missing documentation for:
  16012. 957.16 s [quickcheck-instances] Module header
  16013. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  16014. 957.16 s [quickcheck-instances] Missing documentation for:
  16015. 957.16 s [quickcheck-instances] Module header
  16016. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  16017. 957.16 s [quickcheck-instances] Missing documentation for:
  16018. 957.16 s [quickcheck-instances] Module header
  16019. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  16020. 957.16 s [quickcheck-instances] Missing documentation for:
  16021. 957.16 s [quickcheck-instances] Module header
  16022. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  16023. 957.16 s [quickcheck-instances] Missing documentation for:
  16024. 957.16 s [quickcheck-instances] Module header
  16025. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  16026. 957.16 s [quickcheck-instances] Missing documentation for:
  16027. 957.16 s [quickcheck-instances] Module header
  16028. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  16029. 957.16 s [quickcheck-instances] Missing documentation for:
  16030. 957.16 s [quickcheck-instances] Module header
  16031. 957.16 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  16032. 957.16 s [quickcheck-instances] Missing documentation for:
  16033. 957.16 s [quickcheck-instances] Module header
  16034. 957.16 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  16035. 957.94 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  16036. 957.94 s [quickcheck-instances] - Data.Vector.Vector
  16037. 957.94 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  16038. 957.94 s [quickcheck-instances] - Data.Vector.Storable.Vector
  16039. 957.94 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  16040. 957.94 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  16041. 957.94 s [quickcheck-instances] - Data.Vector.Strict.Vector
  16042. 964.40 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  16043. 964.40 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  16044. 964.52 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  16045. 964.52 s [quickcheck-instances] Phase: installPhase
  16046. 964.62 s [quickcheck-instances] Installing library in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  16047. 965.26 s [quickcheck-instances] Phase: fixupPhase
  16048. 965.28 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33
  16049. 965.29 s [quickcheck-instances] shrinking /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSquickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH-ghc9.10.3.so
  16050. 965.32 s [quickcheck-instances] checking for references to /build/ in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33...
  16051. 965.35 s [quickcheck-instances] patching script interpreter paths in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33
  16052. 965.36 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib
  16053. 965.53 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc
  16054. 965.54 s [quickcheck-instances] checking for references to /build/ in /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc...
  16055. 965.57 s [quickcheck-instances] patching script interpreter paths in /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc
  16056. 965.72 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33 /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc
  16057. 966.24 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  16058. 966.26 s [post-build-hook] Uploading to the NixCI cache: /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33 /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc
  16059. 966.35 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16060. 966.46 s [post-build-hook] copying 1 paths...
  16061. 966.46 s [post-build-hook] copying path '/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  16062. 968.21 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16063. 968.39 s [post-build-hook] copying 0 paths...
  16064. 968.41 s Progress: 12 of 19 built, 193 of 193 downloaded from cache
  16065. 968.46 s Building extra
  16066. 968.60 s [extra] Phase: setupCompilerEnvironmentPhase
  16067. 968.61 s [extra] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  16068. 968.88 s [extra] Phase: unpackPhase
  16069. 968.88 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  16070. 968.89 s [extra] source root is extra-1.8.1
  16071. 968.91 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  16072. 968.91 s [extra] Phase: patchPhase
  16073. 968.93 s [extra] Phase: compileBuildDriverPhase
  16074. 968.93 s [extra] setupCompileFlags: -package-db=/build/tmp.w0rxG4a3Pr/setup-package.conf.d -threaded
  16075. 969.02 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.w0rxG4a3Pr/Main.o )
  16076. 969.09 s [extra] [2 of 2] Linking Setup
  16077. 970.80 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  16078. 970.84 s [extra] Phase: configurePhase
  16079. 970.84 s [extra] configureFlags: --verbose --prefix=/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.w0rxG4a3Pr/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  16080. 970.84 s [extra] Using Parsec parser
  16081. 970.84 s [extra] Configuring extra-1.8.1...
  16082. 971.85 s [extra] Dependency base >=4.9 && <5: using base-4.20.2.0
  16083. 971.85 s [extra] Dependency clock >=0.7: using clock-0.8.4
  16084. 971.85 s [extra] Dependency directory: using directory-1.3.8.5
  16085. 971.85 s [extra] Dependency filepath: using filepath-1.5.4.0
  16086. 971.85 s [extra] Dependency process: using process-1.6.26.1
  16087. 971.85 s [extra] Dependency time: using time-1.12.2
  16088. 971.85 s [extra] Dependency unix: using unix-2.8.7.0
  16089. 971.85 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  16090. 971.85 s [extra] Dependency base >=4 && <5: using base-4.20.2.0
  16091. 971.85 s [extra] Dependency directory: using directory-1.3.8.5
  16092. 971.85 s [extra] Dependency extra: using extra-1.8.1
  16093. 971.85 s [extra] Dependency filepath: using filepath-1.5.4.0
  16094. 971.85 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  16095. 971.85 s [extra] Dependency unix: using unix-2.8.7.0
  16096. 971.85 s [extra] Source component graph:
  16097. 971.85 s [extra] component lib
  16098. 971.85 s [extra] component test:extra-test dependency lib
  16099. 971.85 s [extra] Configured component graph:
  16100. 971.85 s [extra] component extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16101. 971.85 s [extra] include base-4.20.2.0-acb8
  16102. 971.85 s [extra] include clock-0.8.4-2xr44ThigeC8PNOcnMLGAS
  16103. 971.85 s [extra] include directory-1.3.8.5-e377
  16104. 971.85 s [extra] include filepath-1.5.4.0-c4eb
  16105. 971.85 s [extra] include process-1.6.26.1-c5d9
  16106. 971.85 s [extra] include time-1.12.2-befd
  16107. 971.85 s [extra] include unix-2.8.7.0-61f9
  16108. 971.85 s [extra] component extra-1.8.1-LEgS7m2yLxk9dspNzVXQGb-extra-test
  16109. 971.85 s [extra] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  16110. 971.85 s [extra] include base-4.20.2.0-acb8
  16111. 971.85 s [extra] include directory-1.3.8.5-e377
  16112. 971.85 s [extra] include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16113. 971.85 s [extra] include filepath-1.5.4.0-c4eb
  16114. 971.85 s [extra] include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  16115. 971.85 s [extra] include unix-2.8.7.0-61f9
  16116. 971.85 s [extra] Linked component graph:
  16117. 971.85 s [extra] unit extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16118. 971.85 s [extra] include base-4.20.2.0-acb8
  16119. 971.85 s [extra] include clock-0.8.4-2xr44ThigeC8PNOcnMLGAS
  16120. 971.85 s [extra] include directory-1.3.8.5-e377
  16121. 971.85 s [extra] include filepath-1.5.4.0-c4eb
  16122. 971.85 s [extra] include process-1.6.26.1-c5d9
  16123. 971.85 s [extra] include time-1.12.2-befd
  16124. 971.85 s [extra] include unix-2.8.7.0-61f9
  16125. 971.85 s [extra] Control.Concurrent.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Version.Extra,Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Extra,Numeric.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Numeric.Extra,System.Directory.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Environment.Extra,System.IO.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.IO.Extra,System.Info.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Info.Extra,System.Process.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Process.Extra,System.Time.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Time.Extra,Text.Read.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Text.Read.Extra
  16126. 971.85 s [extra] unit extra-1.8.1-LEgS7m2yLxk9dspNzVXQGb-extra-test
  16127. 971.85 s [extra] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  16128. 971.85 s [extra] include base-4.20.2.0-acb8
  16129. 971.85 s [extra] include directory-1.3.8.5-e377
  16130. 971.85 s [extra] include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16131. 971.85 s [extra] include filepath-1.5.4.0-c4eb
  16132. 971.85 s [extra] include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  16133. 971.85 s [extra] include unix-2.8.7.0-61f9
  16134. 971.85 s [extra] Ready component graph:
  16135. 971.85 s [extra] definite extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16136. 971.85 s [extra] depends base-4.20.2.0-acb8
  16137. 971.85 s [extra] depends clock-0.8.4-2xr44ThigeC8PNOcnMLGAS
  16138. 971.85 s [extra] depends directory-1.3.8.5-e377
  16139. 971.85 s [extra] depends filepath-1.5.4.0-c4eb
  16140. 971.85 s [extra] depends process-1.6.26.1-c5d9
  16141. 971.85 s [extra] depends time-1.12.2-befd
  16142. 971.85 s [extra] depends unix-2.8.7.0-61f9
  16143. 971.85 s [extra] definite extra-1.8.1-LEgS7m2yLxk9dspNzVXQGb-extra-test
  16144. 971.85 s [extra] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  16145. 971.85 s [extra] depends base-4.20.2.0-acb8
  16146. 971.85 s [extra] depends directory-1.3.8.5-e377
  16147. 971.85 s [extra] depends extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16148. 971.85 s [extra] depends filepath-1.5.4.0-c4eb
  16149. 971.85 s [extra] depends quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  16150. 971.85 s [extra] depends unix-2.8.7.0-61f9
  16151. 971.85 s [extra] Using Cabal-3.12.1.0 compiled by ghc-9.10
  16152. 971.85 s [extra] Using compiler: ghc-9.10.3
  16153. 971.85 s [extra] Using install prefix: /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1
  16154. 971.85 s [extra] Executables installed in:
  16155. 971.85 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/bin
  16156. 971.85 s [extra] Libraries installed in:
  16157. 971.85 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16158. 971.85 s [extra] Dynamic Libraries installed in:
  16159. 971.85 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  16160. 971.85 s [extra] Private executables installed in:
  16161. 971.85 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/libexec/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1
  16162. 971.85 s [extra] Data files installed in:
  16163. 971.85 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/share/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1
  16164. 971.85 s [extra] Documentation installed in:
  16165. 971.85 s [extra] /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc/share/doc/extra-1.8.1
  16166. 971.85 s [extra] Configuration files installed in:
  16167. 971.85 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/etc
  16168. 971.85 s [extra] No alex found
  16169. 971.85 s [extra] Using ar found on system at:
  16170. 971.85 s [extra] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  16171. 971.85 s [extra] No c2hs found
  16172. 971.85 s [extra] No cpphs found
  16173. 971.85 s [extra] No doctest found
  16174. 971.85 s [extra] Using gcc version 14.3.0 given by user at:
  16175. 971.85 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  16176. 971.85 s [extra] Using ghc version 9.10.3 found on system at:
  16177. 971.85 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  16178. 971.85 s [extra] Using ghc-pkg version 9.10.3 found on system at:
  16179. 971.85 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  16180. 971.85 s [extra] No ghcjs found
  16181. 971.85 s [extra] No ghcjs-pkg found
  16182. 971.85 s [extra] No greencard found
  16183. 971.85 s [extra] Using haddock version 2.31.1 found on system at:
  16184. 971.85 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  16185. 971.85 s [extra] No happy found
  16186. 971.85 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  16187. 971.85 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16188. 971.85 s [extra] No hmake found
  16189. 971.85 s [extra] Using hpc version 0.69 found on system at:
  16190. 971.85 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  16191. 971.85 s [extra] Using hsc2hs version 0.68.10 found on system at:
  16192. 971.85 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  16193. 971.85 s [extra] Using hscolour version 1.25 found on system at:
  16194. 971.85 s [extra] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  16195. 971.85 s [extra] No jhc found
  16196. 971.85 s [extra] Using ld found on system at:
  16197. 971.85 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  16198. 971.85 s [extra] No pkg-config found
  16199. 971.85 s [extra] Using runghc version 9.10.3 found on system at:
  16200. 971.85 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  16201. 971.85 s [extra] Using strip version 2.44 found on system at:
  16202. 971.85 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  16203. 971.85 s [extra] Using tar found on system at:
  16204. 971.85 s [extra] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  16205. 971.85 s [extra] No uhc found
  16206. 972.04 s [extra] Phase: buildPhase
  16207. 972.17 s [extra] Preprocessing library for extra-1.8.1...
  16208. 972.18 s [extra] Building library for extra-1.8.1...
  16209. 972.57 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.o, dist/build/Data/IORef/Extra.dyn_o )
  16210. 972.81 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.o, dist/build/Data/Monoid/Extra.dyn_o )
  16211. 972.81 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.o, dist/build/Data/Tuple/Extra.dyn_o )
  16212. 972.85 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.o, dist/build/Data/Typeable/Extra.dyn_o )
  16213. 972.85 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  16214. 972.85 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  16215. 972.85 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.o, dist/build/Data/List/Extra.dyn_o )
  16216. 974.14 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.o, dist/build/Data/Version/Extra.dyn_o )
  16217. 974.26 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.o, dist/build/Data/List/NonEmpty/Extra.dyn_o )
  16218. 974.34 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.o, dist/build/Data/Either/Extra.dyn_o )
  16219. 974.34 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.o, dist/build/Control/Exception/Extra.dyn_o )
  16220. 974.34 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.o, dist/build/Control/Monad/Extra.dyn_o )
  16221. 974.60 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.o, dist/build/Data/Foldable/Extra.dyn_o )
  16222. 974.69 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.o, dist/build/Control/Concurrent/Extra.dyn_o )
  16223. 974.93 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.o, dist/build/System/Directory/Extra.dyn_o )
  16224. 974.93 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.o, dist/build/System/Environment/Extra.dyn_o )
  16225. 974.93 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.o, dist/build/System/IO/Extra.dyn_o )
  16226. 975.20 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.o, dist/build/System/Info/Extra.dyn_o )
  16227. 975.20 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.o, dist/build/System/Process/Extra.dyn_o )
  16228. 975.28 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.o, dist/build/System/Time/Extra.dyn_o )
  16229. 975.28 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  16230. 975.36 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.o, dist/build/Text/Read/Extra.dyn_o )
  16231. 975.91 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  16232. 976.30 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  16233. 976.38 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  16234. 976.38 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  16235. 976.38 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  16236. 976.38 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  16237. 976.38 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  16238. 977.67 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  16239. 977.84 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  16240. 977.95 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  16241. 977.95 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  16242. 977.95 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  16243. 978.41 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  16244. 978.65 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  16245. 978.80 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  16246. 978.80 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  16247. 978.80 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  16248. 979.12 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  16249. 979.12 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  16250. 979.27 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  16251. 979.27 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  16252. 979.46 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  16253. 980.86 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  16254. 980.86 s [extra] Building test suite 'extra-test' for extra-1.8.1...
  16255. 980.93 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  16256. 981.31 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  16257. 983.30 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  16258. 983.34 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  16259. 983.63 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  16260. 984.39 s [extra] Phase: checkPhase
  16261. 984.66 s [extra] Running 1 test suites...
  16262. 984.66 s [extra] Test suite extra-test: RUNNING...
  16263. 984.67 s [extra] withTempFile
  16264. 984.67 s [extra] +++ OK, passed 100 tests.
  16265. 984.67 s [extra] captureOutput
  16266. 984.67 s [extra] +++ OK, passed 100 tests.
  16267. 984.67 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  16268. 984.70 s [extra] +++ OK, passed 100 tests.
  16269. 984.70 s [extra] \(x :: IO Int) -> join (once x) == x
  16270. 984.74 s [extra] +++ OK, passed 100 tests.
  16271. 984.74 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  16272. 984.79 s [extra] +++ OK, passed 100 tests.
  16273. 984.79 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  16274. 984.83 s [extra] +++ OK, passed 100 tests.
  16275. 984.83 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  16276. 984.87 s [extra] +++ OK, passed 100 tests.
  16277. 984.87 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  16278. 984.91 s [extra] +++ OK, passed 100 tests.
  16279. 984.91 s [extra] stringException "test" == pure "test"
  16280. 984.91 s [extra] +++ OK, passed 100 tests.
  16281. 984.91 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  16282. 984.91 s [extra] +++ OK, passed 100 tests.
  16283. 984.91 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  16284. 984.91 s [extra] +++ OK, passed 100 tests.
  16285. 984.91 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  16286. 984.91 s [extra] +++ OK, passed 100 tests.
  16287. 984.91 s [extra] ignore (print 1) == print 1
  16288. 984.91 s [extra] +++ OK, passed 100 tests.
  16289. 984.91 s [extra] ignore (fail "die") == pure ()
  16290. 984.91 s [extra] +++ OK, passed 100 tests.
  16291. 984.91 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  16292. 984.91 s [extra] +++ OK, passed 100 tests.
  16293. 984.91 s [extra] seq (errorIO "foo") (print 1) == print 1
  16294. 984.91 s [extra] +++ OK, passed 100 tests.
  16295. 984.91 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  16296. 984.91 s [extra] +++ OK, passed 100 tests.
  16297. 984.91 s [extra] seq (assertIO False) (print 1) == print 1
  16298. 984.91 s [extra] +++ OK, passed 100 tests.
  16299. 984.91 s [extra] retry 1 (print "x") == print "x"
  16300. 984.91 s [extra] +++ OK, passed 100 tests.
  16301. 984.91 s [extra] retry 3 (fail "die") == fail "die"
  16302. 984.91 s [extra] +++ OK, passed 100 tests.
  16303. 984.91 s [extra] whenJust Nothing print == pure ()
  16304. 984.91 s [extra] +++ OK, passed 100 tests.
  16305. 984.91 s [extra] whenJust (Just 1) print == print 1
  16306. 984.91 s [extra] +++ OK, passed 100 tests.
  16307. 984.91 s [extra] pureIf @Maybe True 5 == Just 5
  16308. 984.91 s [extra] +++ OK, passed 100 tests.
  16309. 984.91 s [extra] pureIf @Maybe False 5 == Nothing
  16310. 984.91 s [extra] +++ OK, passed 100 tests.
  16311. 984.91 s [extra] pureIf @[] True 5 == [5]
  16312. 984.91 s [extra] +++ OK, passed 100 tests.
  16313. 984.91 s [extra] pureIf @[] False 5 == []
  16314. 984.91 s [extra] +++ OK, passed 100 tests.
  16315. 984.91 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  16316. 984.91 s [extra] +++ OK, passed 100 tests.
  16317. 984.91 s [extra] whenMaybe False (print 1) == pure Nothing
  16318. 984.91 s [extra] +++ OK, passed 100 tests.
  16319. 984.91 s [extra] \(x :: Maybe ()) -> unit x == x
  16320. 984.91 s [extra] +++ OK, passed 100 tests.
  16321. 984.91 s [extra] guarded even 2 == [2]
  16322. 984.91 s [extra] +++ OK, passed 100 tests.
  16323. 984.91 s [extra] guarded odd 2 == Nothing
  16324. 984.91 s [extra] +++ OK, passed 100 tests.
  16325. 984.91 s [extra] guarded (not.null) "My Name" == Just "My Name"
  16326. 984.91 s [extra] +++ OK, passed 100 tests.
  16327. 984.91 s [extra] guardedA (return . even) 42 == Just [42]
  16328. 984.91 s [extra] +++ OK, passed 100 tests.
  16329. 984.91 s [extra] guardedA (return . odd) 42 == Just []
  16330. 984.91 s [extra] +++ OK, passed 100 tests.
  16331. 984.91 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  16332. 984.91 s [extra] +++ OK, passed 100 tests.
  16333. 984.91 s [extra] fold1M (\x y -> Just x) [] == undefined
  16334. 984.91 s [extra] +++ OK, passed 100 tests.
  16335. 984.91 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  16336. 984.91 s [extra] +++ OK, passed 100 tests.
  16337. 984.91 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  16338. 984.91 s [extra] +++ OK, passed 100 tests.
  16339. 984.91 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  16340. 984.91 s [extra] +++ OK, passed 100 tests.
  16341. 984.91 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  16342. 984.91 s [extra] +++ OK, passed 100 tests.
  16343. 984.91 s [extra] Just True ||^ undefined == Just True
  16344. 984.91 s [extra] +++ OK, passed 100 tests.
  16345. 984.91 s [extra] Just False ||^ Just True == Just True
  16346. 984.91 s [extra] +++ OK, passed 100 tests.
  16347. 984.91 s [extra] Just False ||^ Just False == Just False
  16348. 984.91 s [extra] +++ OK, passed 100 tests.
  16349. 984.91 s [extra] Just False &&^ undefined == Just False
  16350. 984.91 s [extra] +++ OK, passed 100 tests.
  16351. 984.91 s [extra] Just True &&^ Just True == Just True
  16352. 984.91 s [extra] +++ OK, passed 100 tests.
  16353. 984.91 s [extra] Just True &&^ Just False == Just False
  16354. 984.91 s [extra] +++ OK, passed 100 tests.
  16355. 984.91 s [extra] anyM Just [False,True ,undefined] == Just True
  16356. 984.91 s [extra] +++ OK, passed 100 tests.
  16357. 984.91 s [extra] anyM Just [False,False,undefined] == undefined
  16358. 984.91 s [extra] +++ OK, passed 100 tests.
  16359. 984.91 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  16360. 984.92 s [extra] +++ OK, passed 100 tests.
  16361. 984.92 s [extra] allM Just [True,False,undefined] == Just False
  16362. 984.92 s [extra] +++ OK, passed 100 tests.
  16363. 984.92 s [extra] allM Just [True,True ,undefined] == undefined
  16364. 984.92 s [extra] +++ OK, passed 100 tests.
  16365. 984.92 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  16366. 984.92 s [extra] +++ OK, passed 100 tests.
  16367. 984.92 s [extra] orM [Just False,Just True ,undefined] == Just True
  16368. 984.92 s [extra] +++ OK, passed 100 tests.
  16369. 984.92 s [extra] orM [Just False,Just False,undefined] == undefined
  16370. 984.92 s [extra] +++ OK, passed 100 tests.
  16371. 984.92 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  16372. 984.92 s [extra] +++ OK, passed 100 tests.
  16373. 984.92 s [extra] andM [Just True,Just False,undefined] == Just False
  16374. 984.92 s [extra] +++ OK, passed 100 tests.
  16375. 984.92 s [extra] andM [Just True,Just True ,undefined] == undefined
  16376. 984.92 s [extra] +++ OK, passed 100 tests.
  16377. 984.92 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  16378. 984.92 s [extra] +++ OK, passed 100 tests.
  16379. 984.92 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  16380. 984.92 s [extra] +++ OK, passed 100 tests.
  16381. 984.92 s [extra] findM (Just . isUpper) "test" == Just Nothing
  16382. 984.92 s [extra] +++ OK, passed 100 tests.
  16383. 984.92 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  16384. 984.92 s [extra] +++ OK, passed 100 tests.
  16385. 984.92 s [extra] fromLeft 1 (Left 3) == 3
  16386. 984.92 s [extra] +++ OK, passed 100 tests.
  16387. 984.92 s [extra] fromLeft 1 (Right "foo") == 1
  16388. 984.92 s [extra] +++ OK, passed 100 tests.
  16389. 984.92 s [extra] fromRight 1 (Right 3) == 3
  16390. 984.92 s [extra] +++ OK, passed 100 tests.
  16391. 984.92 s [extra] fromRight 1 (Left "foo") == 1
  16392. 984.92 s [extra] +++ OK, passed 100 tests.
  16393. 984.92 s [extra] \x -> fromLeft' (Left x) == x
  16394. 984.92 s [extra] +++ OK, passed 100 tests.
  16395. 984.93 s [extra] \x -> fromLeft' (Right x) == undefined
  16396. 984.93 s [extra] +++ OK, passed 100 tests.
  16397. 984.93 s [extra] \x -> fromRight' (Right x) == x
  16398. 984.93 s [extra] +++ OK, passed 100 tests.
  16399. 984.93 s [extra] \x -> fromRight' (Left x) == undefined
  16400. 984.93 s [extra] +++ OK, passed 100 tests.
  16401. 984.93 s [extra] \x -> fromEither (Left x ) == x
  16402. 984.93 s [extra] +++ OK, passed 100 tests.
  16403. 984.93 s [extra] \x -> fromEither (Right x) == x
  16404. 984.93 s [extra] +++ OK, passed 100 tests.
  16405. 984.93 s [extra] \a b -> maybeToEither a (Just b) == Right b
  16406. 984.93 s [extra] +++ OK, passed 100 tests.
  16407. 984.93 s [extra] \a -> maybeToEither a Nothing == Left a
  16408. 984.93 s [extra] +++ OK, passed 100 tests.
  16409. 984.93 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  16410. 984.93 s [extra] +++ OK, passed 100 tests.
  16411. 984.93 s [extra] \x -> eitherToMaybe (Right x) == Just x
  16412. 984.93 s [extra] +++ OK, passed 100 tests.
  16413. 984.93 s [extra] mapLeft show (Left 1) == Left "1"
  16414. 984.93 s [extra] +++ OK, passed 100 tests.
  16415. 984.93 s [extra] mapLeft show (Right True) == Right True
  16416. 984.93 s [extra] +++ OK, passed 100 tests.
  16417. 984.93 s [extra] mapRight show (Left 1) == Left 1
  16418. 984.93 s [extra] +++ OK, passed 100 tests.
  16419. 984.93 s [extra] mapRight show (Right True) == Right "True"
  16420. 984.93 s [extra] +++ OK, passed 100 tests.
  16421. 984.93 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  16422. 984.93 s [extra] +++ OK, passed 100 tests.
  16423. 984.93 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  16424. 984.93 s [extra] +++ OK, passed 100 tests.
  16425. 984.93 s [extra] \xs -> repeatedly line1 xs == lines xs
  16426. 984.93 s [extra] +++ OK, passed 100 tests.
  16427. 984.93 s [extra] disjoint [1,2,3] [4,5] == True
  16428. 984.93 s [extra] +++ OK, passed 100 tests.
  16429. 984.93 s [extra] disjoint [1,2,3] [4,1] == False
  16430. 984.93 s [extra] +++ OK, passed 100 tests.
  16431. 984.93 s [extra] disjointOrd [1,2,3] [4,5] == True
  16432. 984.93 s [extra] +++ OK, passed 100 tests.
  16433. 984.93 s [extra] disjointOrd [1,2,3] [4,1] == False
  16434. 984.93 s [extra] +++ OK, passed 100 tests.
  16435. 984.93 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  16436. 984.93 s [extra] +++ OK, passed 100 tests.
  16437. 984.93 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  16438. 984.93 s [extra] +++ OK, passed 100 tests.
  16439. 984.93 s [extra] anySame [1,1,2] == True
  16440. 984.93 s [extra] +++ OK, passed 100 tests.
  16441. 984.93 s [extra] anySame [1,2,3] == False
  16442. 984.93 s [extra] +++ OK, passed 100 tests.
  16443. 984.93 s [extra] anySame (1:2:1:undefined) == True
  16444. 984.93 s [extra] +++ OK, passed 100 tests.
  16445. 984.93 s [extra] anySame [] == False
  16446. 984.93 s [extra] +++ OK, passed 100 tests.
  16447. 984.93 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  16448. 984.94 s [extra] +++ OK, passed 100 tests.
  16449. 984.94 s [extra] allSame [1,1,2] == False
  16450. 984.94 s [extra] +++ OK, passed 100 tests.
  16451. 984.94 s [extra] allSame [1,1,1] == True
  16452. 984.94 s [extra] +++ OK, passed 100 tests.
  16453. 984.94 s [extra] allSame [1] == True
  16454. 984.94 s [extra] +++ OK, passed 100 tests.
  16455. 984.94 s [extra] allSame [] == True
  16456. 984.94 s [extra] +++ OK, passed 100 tests.
  16457. 984.94 s [extra] allSame (1:1:2:undefined) == False
  16458. 984.94 s [extra] +++ OK, passed 100 tests.
  16459. 984.94 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  16460. 984.94 s [extra] +++ OK, passed 100 tests.
  16461. 984.94 s [extra] headDef 1 [] == 1
  16462. 984.94 s [extra] +++ OK, passed 100 tests.
  16463. 984.94 s [extra] headDef 1 [2,3,4] == 2
  16464. 984.94 s [extra] +++ OK, passed 100 tests.
  16465. 984.94 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  16466. 984.94 s [extra] +++ OK, passed 100 tests.
  16467. 984.94 s [extra] lastDef 1 [] == 1
  16468. 984.94 s [extra] +++ OK, passed 100 tests.
  16469. 984.94 s [extra] lastDef 1 [2,3,4] == 4
  16470. 984.94 s [extra] +++ OK, passed 100 tests.
  16471. 984.94 s [extra] \x xs -> lastDef x xs == last (x:xs)
  16472. 984.94 s [extra] +++ OK, passed 100 tests.
  16473. 984.94 s [extra] [2,3,4] !? 1 == Just 3
  16474. 984.94 s [extra] +++ OK, passed 100 tests.
  16475. 984.94 s [extra] [2,3,4] !? (-1) == Nothing
  16476. 984.94 s [extra] +++ OK, passed 100 tests.
  16477. 984.94 s [extra] [] !? 0 == Nothing
  16478. 984.94 s [extra] +++ OK, passed 100 tests.
  16479. 984.94 s [extra] notNull [] == False
  16480. 984.94 s [extra] +++ OK, passed 100 tests.
  16481. 984.94 s [extra] notNull [1] == True
  16482. 984.94 s [extra] +++ OK, passed 100 tests.
  16483. 984.94 s [extra] \xs -> notNull xs == not (null xs)
  16484. 984.94 s [extra] +++ OK, passed 100 tests.
  16485. 984.94 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  16486. 984.94 s [extra] +++ OK, passed 100 tests.
  16487. 984.94 s [extra] list 1 (\v _ -> v - 2) [] == 1
  16488. 984.94 s [extra] +++ OK, passed 100 tests.
  16489. 984.94 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  16490. 984.94 s [extra] +++ OK, passed 100 tests.
  16491. 984.94 s [extra] unsnoc "test" == Just ("tes",'t')
  16492. 984.94 s [extra] +++ OK, passed 100 tests.
  16493. 984.94 s [extra] unsnoc "" == Nothing
  16494. 984.94 s [extra] +++ OK, passed 100 tests.
  16495. 984.94 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  16496. 984.94 s [extra] +++ OK, passed 100 tests.
  16497. 984.94 s [extra] cons 't' "est" == "test"
  16498. 984.94 s [extra] +++ OK, passed 100 tests.
  16499. 984.94 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  16500. 984.94 s [extra] +++ OK, passed 100 tests.
  16501. 984.94 s [extra] snoc "tes" 't' == "test"
  16502. 984.94 s [extra] +++ OK, passed 100 tests.
  16503. 984.94 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  16504. 984.94 s [extra] +++ OK, passed 100 tests.
  16505. 984.94 s [extra] enumerate == [False, True]
  16506. 984.94 s [extra] +++ OK, passed 100 tests.
  16507. 984.94 s [extra] takeEnd 3 "hello" == "llo"
  16508. 984.94 s [extra] +++ OK, passed 100 tests.
  16509. 984.94 s [extra] takeEnd 5 "bye" == "bye"
  16510. 984.94 s [extra] +++ OK, passed 100 tests.
  16511. 984.94 s [extra] takeEnd (-1) "bye" == ""
  16512. 984.94 s [extra] +++ OK, passed 100 tests.
  16513. 984.94 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  16514. 984.94 s [extra] +++ OK, passed 100 tests.
  16515. 984.94 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  16516. 984.94 s [extra] +++ OK, passed 100 tests.
  16517. 984.94 s [extra] dropEnd 3 "hello" == "he"
  16518. 984.94 s [extra] +++ OK, passed 100 tests.
  16519. 984.94 s [extra] dropEnd 5 "bye" == ""
  16520. 984.94 s [extra] +++ OK, passed 100 tests.
  16521. 984.94 s [extra] dropEnd (-1) "bye" == "bye"
  16522. 984.94 s [extra] +++ OK, passed 100 tests.
  16523. 984.94 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  16524. 984.94 s [extra] +++ OK, passed 100 tests.
  16525. 984.94 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  16526. 984.94 s [extra] +++ OK, passed 100 tests.
  16527. 984.94 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  16528. 984.94 s [extra] +++ OK, passed 100 tests.
  16529. 984.94 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  16530. 984.94 s [extra] +++ OK, passed 100 tests.
  16531. 984.94 s [extra] splitAtEnd 3 "he" == ("", "he")
  16532. 984.94 s [extra] +++ OK, passed 100 tests.
  16533. 984.94 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  16534. 984.94 s [extra] +++ OK, passed 100 tests.
  16535. 984.94 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  16536. 984.95 s [extra] +++ OK, passed 100 tests.
  16537. 984.95 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  16538. 984.95 s [extra] +++ OK, passed 100 tests.
  16539. 984.95 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  16540. 984.95 s [extra] +++ OK, passed 100 tests.
  16541. 984.95 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  16542. 984.95 s [extra] +++ OK, passed 100 tests.
  16543. 984.95 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  16544. 984.95 s [extra] +++ OK, passed 100 tests.
  16545. 984.95 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  16546. 984.95 s [extra] +++ OK, passed 100 tests.
  16547. 984.95 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  16548. 984.95 s [extra] +++ OK, passed 100 tests.
  16549. 984.95 s [extra] trim " hello " == "hello"
  16550. 984.95 s [extra] +++ OK, passed 100 tests.
  16551. 984.95 s [extra] trimStart " hello " == "hello "
  16552. 984.95 s [extra] +++ OK, passed 100 tests.
  16553. 984.95 s [extra] trimEnd " hello " == " hello"
  16554. 984.95 s [extra] +++ OK, passed 100 tests.
  16555. 984.95 s [extra] \s -> trim s == trimEnd (trimStart s)
  16556. 984.95 s [extra] +++ OK, passed 100 tests.
  16557. 984.95 s [extra] lower "This is A TEST" == "this is a test"
  16558. 984.95 s [extra] +++ OK, passed 100 tests.
  16559. 984.95 s [extra] lower "" == ""
  16560. 984.95 s [extra] +++ OK, passed 100 tests.
  16561. 984.95 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  16562. 984.95 s [extra] +++ OK, passed 100 tests.
  16563. 984.95 s [extra] upper "" == ""
  16564. 984.95 s [extra] +++ OK, passed 100 tests.
  16565. 984.95 s [extra] word1 "" == ("", "")
  16566. 984.95 s [extra] +++ OK, passed 100 tests.
  16567. 984.95 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  16568. 984.95 s [extra] +++ OK, passed 100 tests.
  16569. 984.95 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  16570. 984.95 s [extra] +++ OK, passed 100 tests.
  16571. 984.95 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  16572. 984.95 s [extra] +++ OK, passed 100 tests.
  16573. 984.95 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  16574. 984.95 s [extra] +++ OK, passed 100 tests.
  16575. 984.95 s [extra] line1 "" == ("", "")
  16576. 984.95 s [extra] +++ OK, passed 100 tests.
  16577. 984.95 s [extra] line1 "test" == ("test","")
  16578. 984.95 s [extra] +++ OK, passed 100 tests.
  16579. 984.95 s [extra] line1 "test\n" == ("test","")
  16580. 984.95 s [extra] +++ OK, passed 100 tests.
  16581. 984.95 s [extra] line1 "test\nrest" == ("test","rest")
  16582. 984.95 s [extra] +++ OK, passed 100 tests.
  16583. 984.95 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  16584. 984.95 s [extra] +++ OK, passed 100 tests.
  16585. 984.95 s [extra] escapeHTML "this is a test" == "this is a test"
  16586. 984.95 s [extra] +++ OK, passed 100 tests.
  16587. 984.95 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  16588. 984.95 s [extra] +++ OK, passed 100 tests.
  16589. 984.95 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  16590. 984.95 s [extra] +++ OK, passed 100 tests.
  16591. 984.95 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  16592. 984.95 s [extra] +++ OK, passed 100 tests.
  16593. 984.95 s [extra] escapeJSON "this is a test" == "this is a test"
  16594. 984.95 s [extra] +++ OK, passed 100 tests.
  16595. 984.95 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  16596. 984.95 s [extra] +++ OK, passed 100 tests.
  16597. 984.95 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  16598. 984.95 s [extra] +++ OK, passed 100 tests.
  16599. 984.95 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  16600. 984.95 s [extra] +++ OK, passed 100 tests.
  16601. 984.95 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  16602. 984.95 s [extra] +++ OK, passed 100 tests.
  16603. 984.95 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  16604. 984.95 s [extra] +++ OK, passed 100 tests.
  16605. 984.95 s [extra] maximumOn id [] == undefined
  16606. 984.95 s [extra] +++ OK, passed 100 tests.
  16607. 984.95 s [extra] maximumOn length ["test","extra","a"] == "extra"
  16608. 984.95 s [extra] +++ OK, passed 100 tests.
  16609. 984.95 s [extra] minimumOn id [] == undefined
  16610. 984.95 s [extra] +++ OK, passed 100 tests.
  16611. 984.95 s [extra] minimumOn length ["test","extra","a"] == "a"
  16612. 984.95 s [extra] +++ OK, passed 100 tests.
  16613. 984.95 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  16614. 984.95 s [extra] +++ OK, passed 100 tests.
  16615. 984.95 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  16616. 984.95 s [extra] +++ OK, passed 100 tests.
  16617. 984.96 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  16618. 984.96 s [extra] +++ OK, passed 100 tests.
  16619. 984.96 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  16620. 984.96 s [extra] +++ OK, passed 100 tests.
  16621. 984.96 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  16622. 984.96 s [extra] +++ OK, passed 100 tests.
  16623. 984.96 s [extra] sum' [1, 2, 3] == 6
  16624. 984.96 s [extra] +++ OK, passed 100 tests.
  16625. 984.96 s [extra] sumOn' read ["1", "2", "3"] == 6
  16626. 984.96 s [extra] +++ OK, passed 100 tests.
  16627. 984.96 s [extra] product' [1, 2, 4] == 8
  16628. 984.96 s [extra] +++ OK, passed 100 tests.
  16629. 984.96 s [extra] productOn' read ["1", "2", "4"] == 8
  16630. 984.96 s [extra] +++ OK, passed 100 tests.
  16631. 984.96 s [extra] merge "ace" "bd" == "abcde"
  16632. 984.96 s [extra] +++ OK, passed 100 tests.
  16633. 984.96 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  16634. 984.96 s [extra] +++ OK, passed 100 tests.
  16635. 984.96 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  16636. 984.96 s [extra] +++ OK, passed 100 tests.
  16637. 984.96 s [extra] replace "el" "e" "Hello" == "Helo"
  16638. 984.96 s [extra] +++ OK, passed 100 tests.
  16639. 984.96 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  16640. 984.96 s [extra] +++ OK, passed 100 tests.
  16641. 984.96 s [extra] replace "" "x" "" == "x"
  16642. 984.96 s [extra] +++ OK, passed 100 tests.
  16643. 984.96 s [extra] \xs ys -> replace xs xs ys == ys
  16644. 984.96 s [extra] +++ OK, passed 100 tests.
  16645. 984.96 s [extra] breakEnd isLower "youRE" == ("you","RE")
  16646. 984.96 s [extra] +++ OK, passed 100 tests.
  16647. 984.96 s [extra] breakEnd isLower "youre" == ("youre","")
  16648. 984.96 s [extra] +++ OK, passed 100 tests.
  16649. 984.96 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  16650. 984.96 s [extra] +++ OK, passed 100 tests.
  16651. 984.96 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  16652. 984.96 s [extra] +++ OK, passed 100 tests.
  16653. 984.96 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  16654. 984.96 s [extra] +++ OK, passed 100 tests.
  16655. 984.96 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  16656. 984.96 s [extra] +++ OK, passed 100 tests.
  16657. 984.96 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  16658. 984.96 s [extra] +++ OK, passed 100 tests.
  16659. 984.96 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  16660. 984.96 s [extra] +++ OK, passed 100 tests.
  16661. 984.96 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  16662. 984.96 s [extra] +++ OK, passed 100 tests.
  16663. 984.96 s [extra] \s -> wordsBy isSpace s == words s
  16664. 984.96 s [extra] +++ OK, passed 100 tests.
  16665. 984.96 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  16666. 984.96 s [extra] +++ OK, passed 100 tests.
  16667. 984.96 s [extra] \s -> linesBy (== '\n') s == lines s
  16668. 984.97 s [extra] +++ OK, passed 100 tests.
  16669. 984.97 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  16670. 984.97 s [extra] +++ OK, passed 100 tests.
  16671. 984.97 s [extra] firstJust id [Nothing,Just 3] == Just 3
  16672. 984.97 s [extra] +++ OK, passed 100 tests.
  16673. 984.97 s [extra] firstJust id [Nothing,Nothing] == Nothing
  16674. 984.97 s [extra] +++ OK, passed 100 tests.
  16675. 984.97 s [extra] drop1 "" == ""
  16676. 984.97 s [extra] +++ OK, passed 100 tests.
  16677. 984.97 s [extra] drop1 "test" == "est"
  16678. 984.97 s [extra] +++ OK, passed 100 tests.
  16679. 984.97 s [extra] \xs -> drop 1 xs == drop1 xs
  16680. 984.97 s [extra] +++ OK, passed 100 tests.
  16681. 984.97 s [extra] dropEnd1 "" == ""
  16682. 984.97 s [extra] +++ OK, passed 100 tests.
  16683. 984.97 s [extra] dropEnd1 "test" == "tes"
  16684. 984.97 s [extra] +++ OK, passed 100 tests.
  16685. 984.97 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  16686. 984.97 s [extra] +++ OK, passed 100 tests.
  16687. 984.97 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  16688. 984.97 s [extra] +++ OK, passed 100 tests.
  16689. 984.97 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  16690. 984.98 s [extra] +++ OK, passed 100 tests.
  16691. 984.98 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  16692. 984.98 s [extra] +++ OK, passed 100 tests.
  16693. 984.98 s [extra] breakOn "/" "foobar" == ("foobar", "")
  16694. 984.98 s [extra] +++ OK, passed 100 tests.
  16695. 984.98 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  16696. 984.98 s [extra] +++ OK, passed 100 tests.
  16697. 984.98 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  16698. 984.98 s [extra] +++ OK, passed 100 tests.
  16699. 984.98 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  16700. 984.98 s [extra] +++ OK, passed 100 tests.
  16701. 984.98 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  16702. 984.98 s [extra] +++ OK, passed 100 tests.
  16703. 984.98 s [extra] splitOn "x" "x" == ["",""]
  16704. 984.98 s [extra] +++ OK, passed 100 tests.
  16705. 984.98 s [extra] splitOn "x" "" == [""]
  16706. 984.98 s [extra] +++ OK, passed 100 tests.
  16707. 984.98 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  16708. 984.98 s [extra] +++ OK, passed 100 tests; 13 discarded.
  16709. 984.98 s [extra] \c x -> splitOn [c] x == split (==c) x
  16710. 984.99 s [extra] +++ OK, passed 100 tests.
  16711. 984.99 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  16712. 984.99 s [extra] +++ OK, passed 100 tests.
  16713. 984.99 s [extra] split (== 'a') "" == [""]
  16714. 984.99 s [extra] +++ OK, passed 100 tests.
  16715. 984.99 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  16716. 984.99 s [extra] +++ OK, passed 100 tests.
  16717. 984.99 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  16718. 984.99 s [extra] +++ OK, passed 100 tests.
  16719. 984.99 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  16720. 984.99 s [extra] +++ OK, passed 100 tests.
  16721. 984.99 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  16722. 984.99 s [extra] +++ OK, passed 100 tests.
  16723. 984.99 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  16724. 984.99 s [extra] +++ OK, passed 100 tests.
  16725. 984.99 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  16726. 984.99 s [extra] +++ OK, passed 100 tests.
  16727. 984.99 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  16728. 984.99 s [extra] +++ OK, passed 100 tests.
  16729. 984.99 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  16730. 984.99 s [extra] +++ OK, passed 100 tests.
  16731. 984.99 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  16732. 984.99 s [extra] +++ OK, passed 100 tests.
  16733. 984.99 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  16734. 984.99 s [extra] +++ OK, passed 100 tests.
  16735. 984.99 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  16736. 984.99 s [extra] +++ OK, passed 100 tests.
  16737. 984.99 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  16738. 984.99 s [extra] +++ OK, passed 100 tests.
  16739. 984.99 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  16740. 984.99 s [extra] +++ OK, passed 100 tests.
  16741. 984.99 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  16742. 984.99 s [extra] +++ OK, passed 100 tests.
  16743. 984.99 s [extra] stripSuffix "" "baz" == Just "baz"
  16744. 984.99 s [extra] +++ OK, passed 100 tests.
  16745. 984.99 s [extra] stripSuffix "foo" "quux" == Nothing
  16746. 984.99 s [extra] +++ OK, passed 100 tests.
  16747. 984.99 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  16748. 984.99 s [extra] +++ OK, passed 100 tests.
  16749. 984.99 s [extra] stripInfix "/" "foobar" == Nothing
  16750. 984.99 s [extra] +++ OK, passed 100 tests.
  16751. 984.99 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  16752. 984.99 s [extra] +++ OK, passed 100 tests.
  16753. 984.99 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  16754. 984.99 s [extra] +++ OK, passed 100 tests.
  16755. 984.99 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  16756. 984.99 s [extra] +++ OK, passed 100 tests.
  16757. 984.99 s [extra] chunksOf 8 "" == []
  16758. 984.99 s [extra] +++ OK, passed 100 tests.
  16759. 984.99 s [extra] chunksOf 0 "test" == undefined
  16760. 984.99 s [extra] +++ OK, passed 100 tests.
  16761. 984.99 s [extra] nubSort "this is a test" == " aehist"
  16762. 984.99 s [extra] +++ OK, passed 100 tests.
  16763. 984.99 s [extra] \xs -> nubSort xs == nub (sort xs)
  16764. 984.99 s [extra] +++ OK, passed 100 tests.
  16765. 984.99 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  16766. 984.99 s [extra] +++ OK, passed 100 tests.
  16767. 984.99 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  16768. 984.99 s [extra] +++ OK, passed 100 tests.
  16769. 984.99 s [extra] nubOrd "this is a test" == "this ae"
  16770. 984.99 s [extra] +++ OK, passed 100 tests.
  16771. 984.99 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  16772. 984.99 s [extra] +++ OK, passed 100 tests.
  16773. 984.99 s [extra] \xs -> nubOrd xs == nub xs
  16774. 984.99 s [extra] +++ OK, passed 100 tests.
  16775. 984.99 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  16776. 984.99 s [extra] +++ OK, passed 100 tests.
  16777. 984.99 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  16778. 984.99 s [extra] +++ OK, passed 100 tests.
  16779. 984.99 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  16780. 984.99 s [extra] +++ OK, passed 100 tests.
  16781. 984.99 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  16782. 984.99 s [extra] +++ OK, passed 100 tests.
  16783. 984.99 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  16784. 984.99 s [extra] +++ OK, passed 100 tests.
  16785. 984.99 s [extra] comparingLength [1,2,3] [False] == GT
  16786. 984.99 s [extra] +++ OK, passed 100 tests.
  16787. 984.99 s [extra] comparingLength [1,2] "ab" == EQ
  16788. 984.99 s [extra] +++ OK, passed 100 tests.
  16789. 984.99 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  16790. 985.00 s [extra] +++ OK, passed 100 tests.
  16791. 985.00 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  16792. 985.00 s [extra] +++ OK, passed 100 tests.
  16793. 985.00 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  16794. 985.00 s [extra] +++ OK, passed 100 tests.
  16795. 985.00 s [extra] mwhen True "test" == "test"
  16796. 985.00 s [extra] +++ OK, passed 100 tests.
  16797. 985.00 s [extra] mwhen False "test" == ""
  16798. 985.00 s [extra] +++ OK, passed 100 tests.
  16799. 985.00 s [extra] first succ (1,"test") == (2,"test")
  16800. 985.00 s [extra] +++ OK, passed 100 tests.
  16801. 985.00 s [extra] second reverse (1,"test") == (1,"tset")
  16802. 985.00 s [extra] +++ OK, passed 100 tests.
  16803. 985.00 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  16804. 985.00 s [extra] +++ OK, passed 100 tests.
  16805. 985.00 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  16806. 985.00 s [extra] +++ OK, passed 100 tests.
  16807. 985.00 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  16808. 985.00 s [extra] +++ OK, passed 100 tests.
  16809. 985.00 s [extra] (succ &&& pred) 1 == (2,0)
  16810. 985.00 s [extra] +++ OK, passed 100 tests.
  16811. 985.00 s [extra] dupe 12 == (12, 12)
  16812. 985.00 s [extra] +++ OK, passed 100 tests.
  16813. 985.00 s [extra] both succ (1,2) == (2,3)
  16814. 985.00 s [extra] +++ OK, passed 100 tests.
  16815. 985.00 s [extra] first3 succ (1,1,1) == (2,1,1)
  16816. 985.00 s [extra] +++ OK, passed 100 tests.
  16817. 985.00 s [extra] second3 succ (1,1,1) == (1,2,1)
  16818. 985.00 s [extra] +++ OK, passed 100 tests.
  16819. 985.00 s [extra] third3 succ (1,1,1) == (1,1,2)
  16820. 985.00 s [extra] +++ OK, passed 100 tests.
  16821. 985.00 s [extra] \x -> readVersion (showVersion x) == x
  16822. 985.00 s [extra] +++ OK, passed 100 tests.
  16823. 985.00 s [extra] readVersion "hello" == undefined
  16824. 985.00 s [extra] +++ OK, passed 100 tests.
  16825. 985.00 s [extra] showDP 4 pi == "3.1416"
  16826. 985.00 s [extra] +++ OK, passed 100 tests.
  16827. 985.00 s [extra] showDP 0 pi == "3"
  16828. 985.00 s [extra] +++ OK, passed 100 tests.
  16829. 985.00 s [extra] showDP 2 3 == "3.00"
  16830. 985.00 s [extra] +++ OK, passed 100 tests.
  16831. 985.00 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  16832. 985.00 s [extra] +++ OK, passed 100 tests.
  16833. 985.00 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  16834. 985.00 s [extra] +++ OK, passed 100 tests.
  16835. 985.00 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  16836. 985.00 s [extra] +++ OK, passed 100 tests.
  16837. 985.00 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  16838. 985.00 s [extra] +++ OK, passed 100 tests.
  16839. 985.00 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  16840. 985.00 s [extra] +++ OK, passed 100 tests.
  16841. 985.00 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16842. 985.00 s [extra] +++ OK, passed 100 tests.
  16843. 985.01 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16844. 985.01 s [extra] +++ OK, passed 100 tests.
  16845. 985.01 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  16846. 985.01 s [extra] +++ OK, passed 100 tests.
  16847. 985.01 s [extra] isWindows == (os == "mingw32")
  16848. 985.01 s [extra] +++ OK, passed 100 tests.
  16849. 985.01 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  16850. 985.03 s [extra] +++ OK, passed 100 tests.
  16851. 985.03 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  16852. 985.05 s [extra] +++ OK, passed 100 tests.
  16853. 985.05 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  16854. 985.07 s [extra] +++ OK, passed 100 tests.
  16855. 985.07 s [extra] captureOutput (print 1) == pure ("1\n",())
  16856. 985.07 s [extra] +++ OK, passed 100 tests.
  16857. 985.07 s [extra] withTempFile doesFileExist == pure True
  16858. 985.07 s [extra] +++ OK, passed 100 tests.
  16859. 985.07 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  16860. 985.07 s [extra] +++ OK, passed 100 tests.
  16861. 985.07 s [extra] withTempFile readFile' == pure ""
  16862. 985.07 s [extra] +++ OK, passed 100 tests.
  16863. 985.07 s [extra] withTempDir doesDirectoryExist == pure True
  16864. 985.07 s [extra] +++ OK, passed 100 tests.
  16865. 985.07 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  16866. 985.07 s [extra] +++ OK, passed 100 tests.
  16867. 985.07 s [extra] withTempDir listFiles == pure []
  16868. 985.07 s [extra] +++ OK, passed 100 tests.
  16869. 985.07 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  16870. 985.07 s [extra] +++ OK, passed 100 tests.
  16871. 985.07 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  16872. 985.07 s [extra] +++ OK, passed 100 tests.
  16873. 985.07 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  16874. 985.07 s [extra] +++ OK, passed 100 tests.
  16875. 985.07 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  16876. 985.07 s [extra] +++ OK, passed 100 tests.
  16877. 985.07 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  16878. 985.08 s [extra] +++ OK, passed 100 tests.
  16879. 985.08 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  16880. 985.08 s [extra] +++ OK, passed 100 tests.
  16881. 985.08 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  16882. 986.08 s [extra] +++ OK, passed 100 tests.
  16883. 986.08 s [extra] timeout (-3) (print 1) == pure Nothing
  16884. 986.08 s [extra] +++ OK, passed 100 tests.
  16885. 986.08 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  16886. 986.08 s [extra] +++ OK, passed 100 tests.
  16887. 986.08 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  16888. 986.18 s [extra] 0.102222407
  16889. 986.18 s [extra] +++ OK, passed 100 tests.
  16890. 986.18 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  16891. 986.28 s [extra] +++ OK, passed 100 tests.
  16892. 986.29 s [extra] showDuration 3.435 == "3.44s"
  16893. 986.29 s [extra] +++ OK, passed 100 tests.
  16894. 986.29 s [extra] showDuration 623.8 == "10m24s"
  16895. 986.29 s [extra] +++ OK, passed 100 tests.
  16896. 986.29 s [extra] showDuration 62003.8 == "17h13m"
  16897. 986.29 s [extra] +++ OK, passed 100 tests.
  16898. 986.29 s [extra] showDuration 1e8 == "27777h47m"
  16899. 986.29 s [extra] +++ OK, passed 100 tests.
  16900. 986.29 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  16901. 986.29 s [extra] +++ OK, passed 100 tests.
  16902. 986.29 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  16903. 987.29 s [extra] +++ OK, passed 100 tests.
  16904. 987.29 s [extra] Extra export
  16905. 987.29 s [extra] +++ OK, passed 100 tests.
  16906. 987.29 s [extra] withTempFile
  16907. 987.30 s [extra] ....done
  16908. 987.30 s [extra] withTempDir
  16909. 987.32 s [extra] ....done
  16910. 987.32 s [extra] retry
  16911. 987.33 s [extra] +++ OK, passed 100 tests.
  16912. 987.33 s [extra] barrier
  16913. 987.33 s [extra] Success (325 tests)
  16914. 987.35 s [extra] Test suite extra-test: PASS
  16915. 987.35 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  16916. 987.35 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  16917. 987.36 s [extra] Phase: haddockPhase
  16918. 987.63 s [extra] Preprocessing library for extra-1.8.1...
  16919. 987.63 s [extra] Running Haddock on library for extra-1.8.1...
  16920. 988.36 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  16921. 988.41 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  16922. 988.53 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  16923. 988.53 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  16924. 988.53 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  16925. 988.65 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  16926. 988.65 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  16927. 988.92 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  16928. 988.93 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  16929. 989.06 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  16930. 989.08 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  16931. 989.13 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  16932. 989.26 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  16933. 989.28 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  16934. 989.37 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  16935. 989.42 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  16936. 989.42 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  16937. 989.65 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  16938. 989.66 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  16939. 989.67 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  16940. 989.71 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  16941. 989.80 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  16942. 989.80 s [extra] Haddock coverage:
  16943. 989.81 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  16944. 989.81 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  16945. 989.81 s [extra] Warning: 'Arrow' is out of scope.
  16946. 989.81 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16947. 989.81 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  16948. 989.81 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  16949. 989.82 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  16950. 989.82 s [extra] Warning: '(:)' is out of scope.
  16951. 989.82 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16952. 989.82 s [extra] Warning: 'unzip' is ambiguous. It is defined
  16953. 989.82 s [extra] * in ‘GHC.Internal.Data.Functor’
  16954. 989.82 s [extra] * in ‘GHC.Internal.List’
  16955. 989.82 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16956. 989.82 s [extra] by specifying the type/value namespace explicitly.
  16957. 989.82 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  16958. 989.82 s [extra] Warning: 'firstJustM' is out of scope.
  16959. 989.82 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16960. 989.83 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  16961. 989.83 s [extra] Warning: 'Version' is ambiguous. It is defined
  16962. 989.83 s [extra] * in ‘GHC.Internal.Data.Version’
  16963. 989.83 s [extra] * in ‘GHC.Internal.Data.Version’
  16964. 989.83 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16965. 989.83 s [extra] by specifying the type/value namespace explicitly.
  16966. 989.83 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  16967. 989.83 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  16968. 989.84 s [extra] Warning: 'length' is ambiguous. It is defined
  16969. 989.84 s [extra] * in ‘Data.List.NonEmpty’
  16970. 989.84 s [extra] * in ‘GHC.Internal.Data.Foldable’
  16971. 989.84 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16972. 989.84 s [extra] by specifying the type/value namespace explicitly.
  16973. 989.84 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Foldable’
  16974. 989.84 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  16975. 989.84 s [extra] Warning: 'fromJust' is out of scope.
  16976. 989.84 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16977. 989.84 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  16978. 989.84 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  16979. 989.84 s [extra] * in ‘GHC.Internal.Exception’
  16980. 989.84 s [extra] * in ‘GHC.Internal.Exception’
  16981. 989.84 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16982. 989.84 s [extra] by specifying the type/value namespace explicitly.
  16983. 989.84 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  16984. 989.84 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  16985. 989.84 s [extra] * in ‘GHC.Internal.IO.Exception’
  16986. 989.85 s [extra] * in ‘GHC.Internal.IO.Exception’
  16987. 989.85 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16988. 989.85 s [extra] by specifying the type/value namespace explicitly.
  16989. 989.85 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  16990. 989.85 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  16991. 989.85 s [extra] * in ‘GHC.Internal.Exception.Type’
  16992. 989.85 s [extra] * in ‘GHC.Internal.Exception.Type’
  16993. 989.85 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16994. 989.85 s [extra] by specifying the type/value namespace explicitly.
  16995. 989.85 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  16996. 989.85 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  16997. 989.85 s [extra] Warning: 'partition' is out of scope.
  16998. 989.85 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16999. 989.85 s [extra] Warning: 'mconcatMap' is out of scope.
  17000. 989.85 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  17001. 989.85 s [extra] Warning: 'find' is out of scope.
  17002. 989.85 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  17003. 989.85 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  17004. 989.86 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  17005. 989.86 s [extra] Missing documentation for:
  17006. 989.86 s [extra] Module header
  17007. 989.86 s [extra] Warning: 'Lock' is ambiguous. It is defined
  17008. 989.86 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  17009. 989.86 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  17010. 989.86 s [extra] You may be able to disambiguate the identifier by qualifying it or
  17011. 989.86 s [extra] by specifying the type/value namespace explicitly.
  17012. 989.86 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  17013. 989.86 s [extra] Warning: 'Var' is ambiguous. It is defined
  17014. 989.86 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  17015. 989.86 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  17016. 989.86 s [extra] You may be able to disambiguate the identifier by qualifying it or
  17017. 989.86 s [extra] by specifying the type/value namespace explicitly.
  17018. 989.86 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  17019. 989.86 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  17020. 989.86 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  17021. 989.86 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  17022. 989.86 s [extra] You may be able to disambiguate the identifier by qualifying it or
  17023. 989.86 s [extra] by specifying the type/value namespace explicitly.
  17024. 989.86 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  17025. 989.87 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  17026. 989.87 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  17027. 989.87 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  17028. 989.87 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  17029. 989.88 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  17030. 989.88 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  17031. 989.88 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  17032. 989.89 s [extra] 100% (270 /270) in 'Extra'
  17033. 989.89 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  17034. 997.79 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  17035. 997.89 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  17036. 997.93 s [extra] Phase: installPhase
  17037. 998.09 s [extra] Installing library in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  17038. 998.85 s [extra] Phase: fixupPhase
  17039. 998.89 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1
  17040. 998.91 s [extra] shrinking /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSextra-1.8.1-6dBP7svJ0dU8qAqNvDulTp-ghc9.10.3.so
  17041. 998.92 s [extra] checking for references to /build/ in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1...
  17042. 998.97 s [extra] patching script interpreter paths in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1
  17043. 998.98 s [extra] stripping (with command strip and flags -S -p) in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib
  17044. 999.18 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc
  17045. 999.21 s [extra] checking for references to /build/ in /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc...
  17046. 999.25 s [extra] patching script interpreter paths in /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc
  17047. 999.49 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1 /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc
  17048. 1000.03 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  17049. 1000.07 s [post-build-hook] Uploading to the NixCI cache: /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1 /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc
  17050. 1000.15 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17051. 1000.26 s [post-build-hook] copying 1 paths...
  17052. 1000.26 s [post-build-hook] copying path '/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1' to 'https://cache.nix-ci.com'...
  17053. 1002.53 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17054. 1002.71 s [post-build-hook] copying 0 paths...
  17055. 1002.75 s Progress: 13 of 19 built, 193 of 193 downloaded from cache
  17056. 1002.85 s Building algebraic-graphs
  17057. 1002.99 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  17058. 1002.99 s [algebraic-graphs] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  17059. 1003.35 s [algebraic-graphs] Phase: unpackPhase
  17060. 1003.36 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  17061. 1003.37 s [algebraic-graphs] source root is algebraic-graphs-0.7
  17062. 1003.38 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  17063. 1003.39 s [algebraic-graphs] Phase: patchPhase
  17064. 1003.40 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  17065. 1003.41 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  17066. 1003.42 s [algebraic-graphs] patching file algebraic-graphs.cabal
  17067. 1003.42 s [algebraic-graphs] Phase: compileBuildDriverPhase
  17068. 1003.43 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.Vq4dS5nPZ3/setup-package.conf.d -threaded
  17069. 1003.59 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.Vq4dS5nPZ3/Main.o )
  17070. 1003.71 s [algebraic-graphs] [2 of 2] Linking Setup
  17071. 1006.13 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  17072. 1006.15 s [algebraic-graphs] Phase: configurePhase
  17073. 1006.16 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.Vq4dS5nPZ3/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  17074. 1006.17 s [algebraic-graphs] Using Parsec parser
  17075. 1006.17 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  17076. 1007.26 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  17077. 1007.26 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.2.0
  17078. 1007.26 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  17079. 1007.26 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  17080. 1007.26 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  17081. 1007.26 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  17082. 1007.26 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  17083. 1007.26 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  17084. 1007.26 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.2.0
  17085. 1007.26 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  17086. 1007.26 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  17087. 1007.26 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  17088. 1007.26 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  17089. 1007.26 s [algebraic-graphs] inspection-testing-0.6.2
  17090. 1007.26 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  17091. 1007.26 s [algebraic-graphs] Source component graph:
  17092. 1007.26 s [algebraic-graphs] component lib
  17093. 1007.26 s [algebraic-graphs] component test:main dependency lib
  17094. 1007.26 s [algebraic-graphs] Configured component graph:
  17095. 1007.26 s [algebraic-graphs] component algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17096. 1007.26 s [algebraic-graphs] include array-0.5.8.0-78a1
  17097. 1007.26 s [algebraic-graphs] include base-4.20.2.0-acb8
  17098. 1007.26 s [algebraic-graphs] include containers-0.7-a3f6
  17099. 1007.26 s [algebraic-graphs] include deepseq-1.5.0.0-7e72
  17100. 1007.26 s [algebraic-graphs] include transformers-0.6.1.1-74e0
  17101. 1007.26 s [algebraic-graphs] component algebraic-graphs-0.7-HpZp3e1XogHtfWLbBhV75-main
  17102. 1007.26 s [algebraic-graphs] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  17103. 1007.26 s [algebraic-graphs] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17104. 1007.26 s [algebraic-graphs] include array-0.5.8.0-78a1
  17105. 1007.26 s [algebraic-graphs] include base-4.20.2.0-acb8
  17106. 1007.26 s [algebraic-graphs] include containers-0.7-a3f6
  17107. 1007.26 s [algebraic-graphs] include deepseq-1.5.0.0-7e72
  17108. 1007.26 s [algebraic-graphs] include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  17109. 1007.26 s [algebraic-graphs] include inspection-testing-0.6.2-3gcuTx3N9ZQ9Hfgft9cZtB
  17110. 1007.26 s [algebraic-graphs] include transformers-0.6.1.1-74e0
  17111. 1007.26 s [algebraic-graphs] Linked component graph:
  17112. 1007.26 s [algebraic-graphs] unit algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17113. 1007.26 s [algebraic-graphs] include array-0.5.8.0-78a1
  17114. 1007.26 s [algebraic-graphs] include base-4.20.2.0-acb8
  17115. 1007.26 s [algebraic-graphs] include containers-0.7-a3f6
  17116. 1007.26 s [algebraic-graphs] include deepseq-1.5.0.0-7e72
  17117. 1007.26 s [algebraic-graphs] include transformers-0.6.1.1-74e0
  17118. 1007.26 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Data.Graph.Typed
  17119. 1007.26 s [algebraic-graphs] unit algebraic-graphs-0.7-HpZp3e1XogHtfWLbBhV75-main
  17120. 1007.26 s [algebraic-graphs] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  17121. 1007.26 s [algebraic-graphs] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17122. 1007.26 s [algebraic-graphs] include array-0.5.8.0-78a1
  17123. 1007.26 s [algebraic-graphs] include base-4.20.2.0-acb8
  17124. 1007.26 s [algebraic-graphs] include containers-0.7-a3f6
  17125. 1007.26 s [algebraic-graphs] include deepseq-1.5.0.0-7e72
  17126. 1007.26 s [algebraic-graphs] include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  17127. 1007.26 s [algebraic-graphs] include inspection-testing-0.6.2-3gcuTx3N9ZQ9Hfgft9cZtB
  17128. 1007.26 s [algebraic-graphs] include transformers-0.6.1.1-74e0
  17129. 1007.26 s [algebraic-graphs] Ready component graph:
  17130. 1007.26 s [algebraic-graphs] definite algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17131. 1007.26 s [algebraic-graphs] depends array-0.5.8.0-78a1
  17132. 1007.26 s [algebraic-graphs] depends base-4.20.2.0-acb8
  17133. 1007.26 s [algebraic-graphs] depends containers-0.7-a3f6
  17134. 1007.26 s [algebraic-graphs] depends deepseq-1.5.0.0-7e72
  17135. 1007.26 s [algebraic-graphs] depends transformers-0.6.1.1-74e0
  17136. 1007.26 s [algebraic-graphs] definite algebraic-graphs-0.7-HpZp3e1XogHtfWLbBhV75-main
  17137. 1007.26 s [algebraic-graphs] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  17138. 1007.26 s [algebraic-graphs] depends algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17139. 1007.26 s [algebraic-graphs] depends array-0.5.8.0-78a1
  17140. 1007.26 s [algebraic-graphs] depends base-4.20.2.0-acb8
  17141. 1007.26 s [algebraic-graphs] depends containers-0.7-a3f6
  17142. 1007.26 s [algebraic-graphs] depends deepseq-1.5.0.0-7e72
  17143. 1007.26 s [algebraic-graphs] depends extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  17144. 1007.26 s [algebraic-graphs] depends inspection-testing-0.6.2-3gcuTx3N9ZQ9Hfgft9cZtB
  17145. 1007.26 s [algebraic-graphs] depends transformers-0.6.1.1-74e0
  17146. 1007.26 s [algebraic-graphs] Using Cabal-3.12.1.0 compiled by ghc-9.10
  17147. 1007.26 s [algebraic-graphs] Using compiler: ghc-9.10.3
  17148. 1007.26 s [algebraic-graphs] Using install prefix:
  17149. 1007.26 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7
  17150. 1007.26 s [algebraic-graphs] Executables installed in:
  17151. 1007.26 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/bin
  17152. 1007.26 s [algebraic-graphs] Libraries installed in:
  17153. 1007.26 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17154. 1007.26 s [algebraic-graphs] Dynamic Libraries installed in:
  17155. 1007.26 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  17156. 1007.26 s [algebraic-graphs] Private executables installed in:
  17157. 1007.26 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7
  17158. 1007.26 s [algebraic-graphs] Data files installed in:
  17159. 1007.26 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7
  17160. 1007.26 s [algebraic-graphs] Documentation installed in:
  17161. 1007.26 s [algebraic-graphs] /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  17162. 1007.26 s [algebraic-graphs] Configuration files installed in:
  17163. 1007.26 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/etc
  17164. 1007.26 s [algebraic-graphs] No alex found
  17165. 1007.26 s [algebraic-graphs] Using ar found on system at:
  17166. 1007.26 s [algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  17167. 1007.26 s [algebraic-graphs] No c2hs found
  17168. 1007.26 s [algebraic-graphs] No cpphs found
  17169. 1007.26 s [algebraic-graphs] No doctest found
  17170. 1007.26 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  17171. 1007.26 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  17172. 1007.27 s [algebraic-graphs] Using ghc version 9.10.3 found on system at:
  17173. 1007.27 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  17174. 1007.27 s [algebraic-graphs] Using ghc-pkg version 9.10.3 found on system at:
  17175. 1007.27 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  17176. 1007.27 s [algebraic-graphs] No ghcjs found
  17177. 1007.27 s [algebraic-graphs] No ghcjs-pkg found
  17178. 1007.27 s [algebraic-graphs] No greencard found
  17179. 1007.27 s [algebraic-graphs] Using haddock version 2.31.1 found on system at:
  17180. 1007.27 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  17181. 1007.27 s [algebraic-graphs] No happy found
  17182. 1007.27 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  17183. 1007.27 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17184. 1007.27 s [algebraic-graphs] No hmake found
  17185. 1007.27 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  17186. 1007.28 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  17187. 1007.28 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  17188. 1007.28 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  17189. 1007.28 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  17190. 1007.28 s [algebraic-graphs] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  17191. 1007.28 s [algebraic-graphs] No jhc found
  17192. 1007.28 s [algebraic-graphs] Using ld found on system at:
  17193. 1007.28 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  17194. 1007.28 s [algebraic-graphs] No pkg-config found
  17195. 1007.28 s [algebraic-graphs] Using runghc version 9.10.3 found on system at:
  17196. 1007.28 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  17197. 1007.28 s [algebraic-graphs] Using strip version 2.44 found on system at:
  17198. 1007.28 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  17199. 1007.28 s [algebraic-graphs] Using tar found on system at:
  17200. 1007.28 s [algebraic-graphs] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  17201. 1007.28 s [algebraic-graphs] No uhc found
  17202. 1007.46 s [algebraic-graphs] Phase: buildPhase
  17203. 1007.55 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  17204. 1007.56 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  17205. 1007.72 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.o, dist/build/Algebra/Graph/AdjacencyMap.dyn_o )
  17206. 1009.00 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.o, dist/build/Algebra/Graph/AdjacencyIntMap.dyn_o )
  17207. 1009.88 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o )
  17208. 1010.37 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.o, dist/build/Algebra/Graph/Internal.dyn_o )
  17209. 1010.37 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  17210. 1012.16 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.o, dist/build/Algebra/Graph/HigherKinded/Class.dyn_o )
  17211. 1012.66 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o )
  17212. 1013.45 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o )
  17213. 1014.74 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.o, dist/build/Algebra/Graph/Label.dyn_o )
  17214. 1014.78 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o )
  17215. 1014.78 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o )
  17216. 1014.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  17217. 1014.78 s [algebraic-graphs] In the use of ‘head’
  17218. 1014.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17219. 1014.78 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17220. 1014.78 s [algebraic-graphs] |
  17221. 1014.78 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  17222. 1014.78 s [algebraic-graphs] | ^^^^
  17223. 1014.78 s [algebraic-graphs]
  17224. 1014.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  17225. 1014.78 s [algebraic-graphs] In the use of ‘tail’
  17226. 1014.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17227. 1014.78 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17228. 1014.78 s [algebraic-graphs] |
  17229. 1014.78 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  17230. 1014.78 s [algebraic-graphs] | ^^^^
  17231. 1014.78 s [algebraic-graphs]
  17232. 1014.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  17233. 1014.78 s [algebraic-graphs] In the use of ‘head’
  17234. 1014.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17235. 1014.78 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17236. 1014.78 s [algebraic-graphs] |
  17237. 1014.78 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  17238. 1014.78 s [algebraic-graphs] | ^^^^
  17239. 1014.78 s [algebraic-graphs]
  17240. 1014.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  17241. 1014.78 s [algebraic-graphs] In the use of ‘tail’
  17242. 1014.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17243. 1014.78 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17244. 1014.78 s [algebraic-graphs] |
  17245. 1014.78 s [algebraic-graphs] 397 | bnd' = tail bnd
  17246. 1014.78 s [algebraic-graphs] | ^^^^
  17247. 1014.78 s [algebraic-graphs]
  17248. 1014.78 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.o, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o )
  17249. 1014.78 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.o, dist/build/Algebra/Graph/ToGraph.dyn_o )
  17250. 1014.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17251. 1014.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17252. 1014.78 s [algebraic-graphs] will become an error in a future GHC release.
  17253. 1014.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17254. 1014.78 s [algebraic-graphs] |
  17255. 1014.78 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  17256. 1014.78 s [algebraic-graphs] | ^
  17257. 1014.78 s [algebraic-graphs]
  17258. 1014.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17259. 1014.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17260. 1014.78 s [algebraic-graphs] will become an error in a future GHC release.
  17261. 1014.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17262. 1014.78 s [algebraic-graphs] |
  17263. 1014.78 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  17264. 1014.78 s [algebraic-graphs] | ^
  17265. 1014.78 s [algebraic-graphs]
  17266. 1014.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17267. 1014.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17268. 1014.78 s [algebraic-graphs] will become an error in a future GHC release.
  17269. 1014.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17270. 1014.78 s [algebraic-graphs] |
  17271. 1014.78 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  17272. 1014.78 s [algebraic-graphs] | ^
  17273. 1014.78 s [algebraic-graphs]
  17274. 1014.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17275. 1014.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17276. 1014.78 s [algebraic-graphs] will become an error in a future GHC release.
  17277. 1014.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17278. 1014.78 s [algebraic-graphs] |
  17279. 1014.78 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  17280. 1014.78 s [algebraic-graphs] | ^
  17281. 1014.78 s [algebraic-graphs]
  17282. 1014.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17283. 1014.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17284. 1014.78 s [algebraic-graphs] will become an error in a future GHC release.
  17285. 1014.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17286. 1014.78 s [algebraic-graphs] |
  17287. 1014.78 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  17288. 1014.78 s [algebraic-graphs] | ^
  17289. 1014.78 s [algebraic-graphs]
  17290. 1014.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17291. 1014.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17292. 1014.78 s [algebraic-graphs] will become an error in a future GHC release.
  17293. 1014.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17294. 1014.78 s [algebraic-graphs] |
  17295. 1014.78 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  17296. 1014.78 s [algebraic-graphs] | ^
  17297. 1014.78 s [algebraic-graphs]
  17298. 1014.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17299. 1014.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17300. 1014.78 s [algebraic-graphs] will become an error in a future GHC release.
  17301. 1014.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17302. 1014.78 s [algebraic-graphs] |
  17303. 1014.78 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  17304. 1014.78 s [algebraic-graphs] | ^
  17305. 1014.78 s [algebraic-graphs]
  17306. 1014.78 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.o, dist/build/Algebra/Graph/Relation.dyn_o )
  17307. 1015.08 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.o, dist/build/Algebra/Graph/Relation/Symmetric.dyn_o )
  17308. 1015.79 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.o, dist/build/Algebra/Graph/NonEmpty.dyn_o )
  17309. 1015.79 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.o, dist/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o )
  17310. 1015.79 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.o, dist/build/Algebra/Graph/Labelled.dyn_o )
  17311. 1016.59 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.o, dist/build/Algebra/Graph/Labelled/Example/Network.dyn_o )
  17312. 1016.88 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
  17313. 1017.27 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.o, dist/build/Algebra/Graph/Export.dyn_o )
  17314. 1017.27 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17315. 1017.27 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17316. 1017.27 s [algebraic-graphs] will become an error in a future GHC release.
  17317. 1017.27 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17318. 1017.27 s [algebraic-graphs] |
  17319. 1017.27 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  17320. 1017.27 s [algebraic-graphs] | ^
  17321. 1017.27 s [algebraic-graphs]
  17322. 1017.27 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.o, dist/build/Algebra/Graph/Export/Dot.dyn_o )
  17323. 1017.27 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17324. 1017.27 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17325. 1017.27 s [algebraic-graphs] will become an error in a future GHC release.
  17326. 1017.27 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17327. 1017.27 s [algebraic-graphs] |
  17328. 1017.27 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  17329. 1017.27 s [algebraic-graphs] | ^
  17330. 1017.27 s [algebraic-graphs]
  17331. 1017.27 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17332. 1017.27 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17333. 1017.27 s [algebraic-graphs] will become an error in a future GHC release.
  17334. 1017.27 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17335. 1017.27 s [algebraic-graphs] |
  17336. 1017.27 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  17337. 1017.27 s [algebraic-graphs] | ^
  17338. 1017.27 s [algebraic-graphs]
  17339. 1017.27 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.o, dist/build/Algebra/Graph/Undirected.dyn_o )
  17340. 1017.27 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.o, dist/build/Algebra/Graph/Class.dyn_o )
  17341. 1017.27 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.o, dist/build/Algebra/Graph/Relation/Transitive.dyn_o )
  17342. 1017.27 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.o, dist/build/Algebra/Graph/Relation/Reflexive.dyn_o )
  17343. 1017.27 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.o, dist/build/Algebra/Graph/Relation/Preorder.dyn_o )
  17344. 1017.27 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.o, dist/build/Algebra/Graph/Example/Todo.dyn_o )
  17345. 1017.33 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o )
  17346. 1017.87 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  17347. 1020.25 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  17348. 1021.74 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.p_o )
  17349. 1022.50 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  17350. 1022.50 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  17351. 1025.12 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.p_o )
  17352. 1025.77 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
  17353. 1026.72 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.p_o )
  17354. 1028.42 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  17355. 1028.42 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
  17356. 1028.42 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.p_o )
  17357. 1028.42 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  17358. 1028.42 s [algebraic-graphs] In the use of ‘head’
  17359. 1028.42 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17360. 1028.42 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17361. 1028.42 s [algebraic-graphs] |
  17362. 1028.42 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  17363. 1028.42 s [algebraic-graphs] | ^^^^
  17364. 1028.42 s [algebraic-graphs]
  17365. 1028.42 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  17366. 1028.42 s [algebraic-graphs] In the use of ‘tail’
  17367. 1028.42 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17368. 1028.42 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17369. 1028.42 s [algebraic-graphs] |
  17370. 1028.42 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  17371. 1028.42 s [algebraic-graphs] | ^^^^
  17372. 1028.42 s [algebraic-graphs]
  17373. 1028.42 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  17374. 1028.42 s [algebraic-graphs] In the use of ‘head’
  17375. 1028.42 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17376. 1028.42 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17377. 1028.42 s [algebraic-graphs] |
  17378. 1028.42 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  17379. 1028.42 s [algebraic-graphs] | ^^^^
  17380. 1028.42 s [algebraic-graphs]
  17381. 1028.42 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  17382. 1028.42 s [algebraic-graphs] In the use of ‘tail’
  17383. 1028.42 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17384. 1028.42 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17385. 1028.42 s [algebraic-graphs] |
  17386. 1028.42 s [algebraic-graphs] 397 | bnd' = tail bnd
  17387. 1028.42 s [algebraic-graphs] | ^^^^
  17388. 1028.42 s [algebraic-graphs]
  17389. 1028.42 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.p_o )
  17390. 1028.42 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  17391. 1028.42 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17392. 1028.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17393. 1028.42 s [algebraic-graphs] will become an error in a future GHC release.
  17394. 1028.42 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17395. 1028.42 s [algebraic-graphs] |
  17396. 1028.42 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  17397. 1028.42 s [algebraic-graphs] | ^
  17398. 1028.42 s [algebraic-graphs]
  17399. 1028.42 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17400. 1028.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17401. 1028.42 s [algebraic-graphs] will become an error in a future GHC release.
  17402. 1028.42 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17403. 1028.42 s [algebraic-graphs] |
  17404. 1028.42 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  17405. 1028.42 s [algebraic-graphs] | ^
  17406. 1028.42 s [algebraic-graphs]
  17407. 1028.42 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17408. 1028.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17409. 1028.42 s [algebraic-graphs] will become an error in a future GHC release.
  17410. 1028.42 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17411. 1028.42 s [algebraic-graphs] |
  17412. 1028.42 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  17413. 1028.42 s [algebraic-graphs] | ^
  17414. 1028.42 s [algebraic-graphs]
  17415. 1028.42 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17416. 1028.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17417. 1028.42 s [algebraic-graphs] will become an error in a future GHC release.
  17418. 1028.42 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17419. 1028.42 s [algebraic-graphs] |
  17420. 1028.42 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  17421. 1028.42 s [algebraic-graphs] | ^
  17422. 1028.42 s [algebraic-graphs]
  17423. 1028.42 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17424. 1028.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17425. 1028.42 s [algebraic-graphs] will become an error in a future GHC release.
  17426. 1028.42 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17427. 1028.42 s [algebraic-graphs] |
  17428. 1028.42 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  17429. 1028.42 s [algebraic-graphs] | ^
  17430. 1028.42 s [algebraic-graphs]
  17431. 1028.42 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17432. 1028.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17433. 1028.42 s [algebraic-graphs] will become an error in a future GHC release.
  17434. 1028.42 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17435. 1028.42 s [algebraic-graphs] |
  17436. 1028.42 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  17437. 1028.42 s [algebraic-graphs] | ^
  17438. 1028.42 s [algebraic-graphs]
  17439. 1028.43 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17440. 1028.43 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17441. 1028.43 s [algebraic-graphs] will become an error in a future GHC release.
  17442. 1028.43 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17443. 1028.43 s [algebraic-graphs] |
  17444. 1028.43 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  17445. 1028.43 s [algebraic-graphs] | ^
  17446. 1028.43 s [algebraic-graphs]
  17447. 1028.43 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  17448. 1028.95 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
  17449. 1030.02 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  17450. 1030.02 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.p_o )
  17451. 1030.02 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  17452. 1031.38 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.p_o )
  17453. 1032.04 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.p_o )
  17454. 1032.37 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  17455. 1032.37 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17456. 1032.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17457. 1032.37 s [algebraic-graphs] will become an error in a future GHC release.
  17458. 1032.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17459. 1032.37 s [algebraic-graphs] |
  17460. 1032.37 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  17461. 1032.37 s [algebraic-graphs] | ^
  17462. 1032.37 s [algebraic-graphs]
  17463. 1032.37 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.p_o )
  17464. 1032.37 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17465. 1032.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17466. 1032.37 s [algebraic-graphs] will become an error in a future GHC release.
  17467. 1032.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17468. 1032.37 s [algebraic-graphs] |
  17469. 1032.37 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  17470. 1032.37 s [algebraic-graphs] | ^
  17471. 1032.37 s [algebraic-graphs]
  17472. 1032.37 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17473. 1032.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17474. 1032.37 s [algebraic-graphs] will become an error in a future GHC release.
  17475. 1032.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17476. 1032.37 s [algebraic-graphs] |
  17477. 1032.37 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  17478. 1032.37 s [algebraic-graphs] | ^
  17479. 1032.37 s [algebraic-graphs]
  17480. 1032.37 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  17481. 1032.37 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  17482. 1032.37 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.p_o )
  17483. 1032.44 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
  17484. 1032.48 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.p_o )
  17485. 1032.48 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.p_o )
  17486. 1032.58 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  17487. 1035.85 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  17488. 1035.86 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  17489. 1036.10 s [algebraic-graphs] [ 1 of 23] Compiling Algebra.Graph.Test.Arbitrary ( test/Algebra/Graph/Test/Arbitrary.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.o, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.dyn_o )
  17490. 1038.60 s [algebraic-graphs] [ 2 of 23] Compiling Algebra.Graph.Test.API ( test/Algebra/Graph/Test/API.hs, dist/build/main/main-tmp/Algebra/Graph/Test/API.o, dist/build/main/main-tmp/Algebra/Graph/Test/API.dyn_o )
  17491. 1048.09 s [algebraic-graphs] [ 3 of 23] Compiling Algebra.Graph.Test ( test/Algebra/Graph/Test.hs, dist/build/main/main-tmp/Algebra/Graph/Test.o, dist/build/main/main-tmp/Algebra/Graph/Test.dyn_o )
  17492. 1048.13 s [algebraic-graphs] [ 4 of 23] Compiling Algebra.Graph.Test.Acyclic.AdjacencyMap ( test/Algebra/Graph/Test/Acyclic/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.dyn_o )
  17493. 1050.12 s [algebraic-graphs] [ 5 of 23] Compiling Algebra.Graph.Test.Bipartite.AdjacencyMap ( test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.dyn_o )
  17494. 1055.08 s [algebraic-graphs] [ 6 of 23] Compiling Algebra.Graph.Test.Example.Todo ( test/Algebra/Graph/Test/Example/Todo.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.o, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.dyn_o )
  17495. 1055.12 s [algebraic-graphs] [ 7 of 23] Compiling Algebra.Graph.Test.Export ( test/Algebra/Graph/Test/Export.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Export.o, dist/build/main/main-tmp/Algebra/Graph/Test/Export.dyn_o )
  17496. 1055.12 s [algebraic-graphs] [ 8 of 23] Compiling Algebra.Graph.Test.Generic ( test/Algebra/Graph/Test/Generic.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.o, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.dyn_o )
  17497. 1065.12 s [algebraic-graphs] [ 9 of 23] Compiling Algebra.Graph.Test.AdjacencyMap ( test/Algebra/Graph/Test/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.dyn_o )
  17498. 1065.44 s [algebraic-graphs] [10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
  17499. 1065.44 s [algebraic-graphs] [11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o )
  17500. 1066.84 s [algebraic-graphs] [12 of 23] Compiling Algebra.Graph.Test.Internal ( test/Algebra/Graph/Test/Internal.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.o, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.dyn_o )
  17501. 1066.84 s [algebraic-graphs] [13 of 23] Compiling Algebra.Graph.Test.Label ( test/Algebra/Graph/Test/Label.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Label.o, dist/build/main/main-tmp/Algebra/Graph/Test/Label.dyn_o )
  17502. 1066.84 s [algebraic-graphs] [14 of 23] Compiling Algebra.Graph.Test.Labelled.AdjacencyMap ( test/Algebra/Graph/Test/Labelled/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.dyn_o )
  17503. 1069.24 s [algebraic-graphs] [15 of 23] Compiling Algebra.Graph.Test.Labelled.Graph ( test/Algebra/Graph/Test/Labelled/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.dyn_o )
  17504. 1069.24 s [algebraic-graphs] [16 of 23] Compiling Algebra.Graph.Test.NonEmpty.AdjacencyMap ( test/Algebra/Graph/Test/NonEmpty/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.dyn_o )
  17505. 1069.24 s [algebraic-graphs] [17 of 23] Compiling Algebra.Graph.Test.NonEmpty.Graph ( test/Algebra/Graph/Test/NonEmpty/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.dyn_o )
  17506. 1069.24 s [algebraic-graphs] [18 of 23] Compiling Algebra.Graph.Test.Relation ( test/Algebra/Graph/Test/Relation.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.dyn_o )
  17507. 1069.24 s [algebraic-graphs] [19 of 23] Compiling Algebra.Graph.Test.Relation.Symmetric ( test/Algebra/Graph/Test/Relation/Symmetric.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.dyn_o )
  17508. 1069.24 s [algebraic-graphs] [20 of 23] Compiling Algebra.Graph.Test.RewriteRules ( test/Algebra/Graph/Test/RewriteRules.hs, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.o, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.dyn_o )
  17509. 1069.24 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  17510. 1069.24 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  17511. 1069.24 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  17512. 1069.24 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  17513. 1069.24 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  17514. 1069.24 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  17515. 1069.25 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  17516. 1069.25 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  17517. 1069.25 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  17518. 1069.25 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  17519. 1069.25 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  17520. 1069.26 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  17521. 1069.26 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  17522. 1069.26 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  17523. 1069.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  17524. 1069.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  17525. 1069.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  17526. 1069.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  17527. 1069.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  17528. 1069.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  17529. 1069.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  17530. 1069.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  17531. 1069.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  17532. 1069.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17533. 1069.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  17534. 1069.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17535. 1069.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  17536. 1069.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  17537. 1069.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  17538. 1069.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  17539. 1069.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  17540. 1069.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  17541. 1069.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  17542. 1069.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  17543. 1069.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  17544. 1069.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  17545. 1069.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  17546. 1069.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17547. 1069.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  17548. 1069.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  17549. 1069.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17550. 1069.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  17551. 1069.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  17552. 1069.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  17553. 1069.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  17554. 1069.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  17555. 1069.31 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  17556. 1069.31 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  17557. 1069.31 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  17558. 1069.31 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  17559. 1069.31 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  17560. 1069.31 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  17561. 1069.31 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  17562. 1069.31 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  17563. 1069.31 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  17564. 1069.32 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  17565. 1069.32 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  17566. 1069.32 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  17567. 1069.32 s [algebraic-graphs] inspection testing successful
  17568. 1069.32 s [algebraic-graphs] expected successes: 58
  17569. 1069.32 s [algebraic-graphs] [21 of 23] Compiling Algebra.Graph.Test.Undirected ( test/Algebra/Graph/Test/Undirected.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.o, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.dyn_o )
  17570. 1069.32 s [algebraic-graphs] [22 of 23] Compiling Data.Graph.Test.Typed ( test/Data/Graph/Test/Typed.hs, dist/build/main/main-tmp/Data/Graph/Test/Typed.o, dist/build/main/main-tmp/Data/Graph/Test/Typed.dyn_o )
  17571. 1069.32 s [algebraic-graphs] [23 of 23] Compiling Main ( test/Main.hs, dist/build/main/main-tmp/Main.o, dist/build/main/main-tmp/Main.dyn_o )
  17572. 1070.96 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  17573. 1073.00 s [algebraic-graphs] buildPhase completed in 1 minutes 6 seconds
  17574. 1073.00 s [algebraic-graphs] Phase: checkPhase
  17575. 1073.59 s [algebraic-graphs] Running 1 test suites...
  17576. 1073.59 s [algebraic-graphs] Test suite main: RUNNING...
  17577. 1093.04 s [algebraic-graphs]
  17578. 1093.04 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  17579. 1093.08 s [algebraic-graphs] OK: show empty == "empty"
  17580. 1093.08 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  17581. 1093.08 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  17582. 1093.08 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  17583. 1093.08 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  17584. 1093.08 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  17585. 1093.08 s [algebraic-graphs]
  17586. 1093.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  17587. 1093.08 s [algebraic-graphs] OK: fromAcyclic empty == empty
  17588. 1093.08 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  17589. 1093.08 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  17590. 1093.08 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  17591. 1093.08 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  17592. 1093.08 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  17593. 1093.08 s [algebraic-graphs]
  17594. 1093.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  17595. 1093.08 s [algebraic-graphs] OK: isEmpty empty == True
  17596. 1093.08 s [algebraic-graphs] OK: hasVertex x empty == False
  17597. 1093.08 s [algebraic-graphs] OK: vertexCount empty == 0
  17598. 1093.08 s [algebraic-graphs] OK: edgeCount empty == 0
  17599. 1093.08 s [algebraic-graphs]
  17600. 1093.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  17601. 1093.08 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17602. 1093.08 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17603. 1093.08 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17604. 1093.08 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17605. 1093.08 s [algebraic-graphs]
  17606. 1093.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  17607. 1093.08 s [algebraic-graphs] OK: vertices [] == empty
  17608. 1093.08 s [algebraic-graphs] OK: vertices [x] == vertex x
  17609. 1093.08 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17610. 1093.08 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17611. 1093.08 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17612. 1093.08 s [algebraic-graphs]
  17613. 1093.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  17614. 1093.08 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  17615. 1093.08 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  17616. 1093.08 s [algebraic-graphs]
  17617. 1093.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  17618. 1093.08 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  17619. 1093.08 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  17620. 1093.08 s [algebraic-graphs]
  17621. 1093.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  17622. 1093.08 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17623. 1093.08 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17624. 1093.08 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17625. 1093.08 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  17626. 1093.08 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17627. 1093.08 s [algebraic-graphs]
  17628. 1093.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  17629. 1093.08 s [algebraic-graphs] OK: isEmpty empty == True
  17630. 1093.08 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17631. 1093.08 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17632. 1093.08 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  17633. 1093.08 s [algebraic-graphs]
  17634. 1093.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  17635. 1093.08 s [algebraic-graphs] OK: hasVertex x empty == False
  17636. 1093.08 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17637. 1093.08 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17638. 1093.09 s [algebraic-graphs]
  17639. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  17640. 1093.09 s [algebraic-graphs] OK: hasEdge x y empty == False
  17641. 1093.09 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17642. 1093.09 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  17643. 1093.09 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17644. 1093.09 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17645. 1093.09 s [algebraic-graphs]
  17646. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  17647. 1093.09 s [algebraic-graphs] OK: vertexCount empty == 0
  17648. 1093.09 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17649. 1093.09 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17650. 1093.09 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17651. 1093.09 s [algebraic-graphs]
  17652. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  17653. 1093.09 s [algebraic-graphs] OK: edgeCount empty == 0
  17654. 1093.09 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17655. 1093.09 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  17656. 1093.09 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17657. 1093.09 s [algebraic-graphs]
  17658. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  17659. 1093.09 s [algebraic-graphs] OK: vertexList empty == []
  17660. 1093.09 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17661. 1093.09 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17662. 1093.09 s [algebraic-graphs]
  17663. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  17664. 1093.09 s [algebraic-graphs] OK: edgeList empty == []
  17665. 1093.09 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17666. 1093.09 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  17667. 1093.09 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17668. 1093.09 s [algebraic-graphs]
  17669. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  17670. 1093.09 s [algebraic-graphs] OK: adjacencyList empty == []
  17671. 1093.09 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17672. 1093.09 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  17673. 1093.09 s [algebraic-graphs]
  17674. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  17675. 1093.09 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17676. 1093.09 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17677. 1093.09 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17678. 1093.09 s [algebraic-graphs]
  17679. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  17680. 1093.09 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17681. 1093.09 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17682. 1093.09 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  17683. 1093.09 s [algebraic-graphs]
  17684. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  17685. 1093.09 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17686. 1093.09 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17687. 1093.09 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  17688. 1093.09 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  17689. 1093.09 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  17690. 1093.09 s [algebraic-graphs]
  17691. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  17692. 1093.09 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17693. 1093.09 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17694. 1093.09 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  17695. 1093.09 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  17696. 1093.09 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  17697. 1093.09 s [algebraic-graphs]
  17698. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  17699. 1093.09 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17700. 1093.09 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17701. 1093.09 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  17702. 1093.09 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17703. 1093.09 s [algebraic-graphs]
  17704. 1093.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  17705. 1093.10 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  17706. 1093.10 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17707. 1093.10 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17708. 1093.10 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  17709. 1093.10 s [algebraic-graphs]
  17710. 1093.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  17711. 1093.10 s [algebraic-graphs] OK: transpose empty == empty
  17712. 1093.10 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17713. 1093.10 s [algebraic-graphs] OK: transpose . transpose == id
  17714. 1093.10 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17715. 1093.10 s [algebraic-graphs]
  17716. 1093.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  17717. 1093.10 s [algebraic-graphs] OK: induce (const True ) x == x
  17718. 1093.10 s [algebraic-graphs] OK: induce (const False) x == empty
  17719. 1093.10 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17720. 1093.10 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17721. 1093.10 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17722. 1093.10 s [algebraic-graphs]
  17723. 1093.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  17724. 1093.10 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17725. 1093.10 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  17726. 1093.10 s [algebraic-graphs]
  17727. 1093.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  17728. 1093.10 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  17729. 1093.10 s [algebraic-graphs]
  17730. 1093.10 s [algebraic-graphs] OK: box x y ~~ box y x
  17731. 1093.10 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  17732. 1093.10 s [algebraic-graphs] OK: box x empty ~~ empty
  17733. 1093.10 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  17734. 1093.10 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  17735. 1093.10 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  17736. 1093.10 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  17737. 1093.10 s [algebraic-graphs]
  17738. 1093.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  17739. 1093.10 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17740. 1093.10 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17741. 1093.10 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  17742. 1093.10 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17743. 1093.10 s [algebraic-graphs]
  17744. 1093.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  17745. 1093.10 s [algebraic-graphs] OK: topSort empty == []
  17746. 1093.10 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  17747. 1093.10 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  17748. 1093.10 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  17749. 1093.10 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  17750. 1093.10 s [algebraic-graphs]
  17751. 1093.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  17752. 1093.10 s [algebraic-graphs] OK: scc empty == empty
  17753. 1093.10 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  17754. 1093.10 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  17755. 1093.10 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  17756. 1093.10 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  17757. 1093.10 s [algebraic-graphs]
  17758. 1093.11 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  17759. 1093.11 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  17760. 1093.11 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  17761. 1093.11 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  17762. 1093.11 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  17763. 1093.11 s [algebraic-graphs]
  17764. 1093.11 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  17765. 1093.11 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  17766. 1093.11 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  17767. 1093.11 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  17768. 1093.11 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  17769. 1093.11 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  17770. 1093.11 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  17771. 1101.97 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  17772. 1101.97 s [algebraic-graphs]
  17773. 1101.97 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  17774. 1102.00 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  17775. 1102.00 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  17776. 1102.00 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  17777. 1102.00 s [algebraic-graphs]
  17778. 1102.00 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  17779. 1102.00 s [algebraic-graphs] OK: Arbitrary
  17780. 1102.00 s [algebraic-graphs] OK: empty
  17781. 1102.00 s [algebraic-graphs] OK: vertex
  17782. 1102.00 s [algebraic-graphs] OK: vertices
  17783. 1102.00 s [algebraic-graphs] OK: union
  17784. 1102.00 s [algebraic-graphs] OK: join
  17785. 1102.01 s [algebraic-graphs] OK: transpose
  17786. 1102.01 s [algebraic-graphs] OK: box
  17787. 1102.01 s [algebraic-graphs] OK: transitiveClosure
  17788. 1102.01 s [algebraic-graphs] OK: scc
  17789. 1102.01 s [algebraic-graphs] OK: toAcyclic
  17790. 1102.01 s [algebraic-graphs] OK: toAcyclicOrd
  17791. 1102.01 s [algebraic-graphs]
  17792. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap ============
  17793. 1102.01 s [algebraic-graphs] OK: Axioms of graphs
  17794. 1102.01 s [algebraic-graphs]
  17795. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  17796. 1102.01 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  17797. 1102.01 s [algebraic-graphs]
  17798. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  17799. 1102.01 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17800. 1102.01 s [algebraic-graphs]
  17801. 1102.01 s [algebraic-graphs] OK: consistent empty == True
  17802. 1102.01 s [algebraic-graphs] OK: consistent (vertex x) == True
  17803. 1102.01 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17804. 1102.01 s [algebraic-graphs] OK: consistent (connect x y) == True
  17805. 1102.01 s [algebraic-graphs] OK: consistent (edge x y) == True
  17806. 1102.01 s [algebraic-graphs] OK: consistent (edges xs) == True
  17807. 1102.01 s [algebraic-graphs] OK: consistent (stars xs) == True
  17808. 1102.01 s [algebraic-graphs]
  17809. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  17810. 1102.01 s [algebraic-graphs] OK: show (empty ) == "empty"
  17811. 1102.01 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17812. 1102.01 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17813. 1102.01 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17814. 1102.01 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17815. 1102.01 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17816. 1102.01 s [algebraic-graphs]
  17817. 1102.01 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17818. 1102.01 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17819. 1102.01 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17820. 1102.01 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17821. 1102.01 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17822. 1102.01 s [algebraic-graphs]
  17823. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  17824. 1102.01 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17825. 1102.01 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17826. 1102.01 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17827. 1102.01 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17828. 1102.01 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17829. 1102.01 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17830. 1102.01 s [algebraic-graphs] OK: x <= x + y
  17831. 1102.01 s [algebraic-graphs] OK: x + y <= x * y
  17832. 1102.01 s [algebraic-graphs]
  17833. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  17834. 1102.01 s [algebraic-graphs] OK: isEmpty empty == True
  17835. 1102.01 s [algebraic-graphs] OK: hasVertex x empty == False
  17836. 1102.01 s [algebraic-graphs] OK: vertexCount empty == 0
  17837. 1102.01 s [algebraic-graphs] OK: edgeCount empty == 0
  17838. 1102.01 s [algebraic-graphs]
  17839. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  17840. 1102.01 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17841. 1102.01 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17842. 1102.01 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17843. 1102.01 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17844. 1102.01 s [algebraic-graphs]
  17845. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  17846. 1102.01 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17847. 1102.01 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17848. 1102.01 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17849. 1102.01 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17850. 1102.01 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17851. 1102.01 s [algebraic-graphs]
  17852. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  17853. 1102.01 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17854. 1102.01 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17855. 1102.01 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17856. 1102.01 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17857. 1102.01 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17858. 1102.01 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17859. 1102.01 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17860. 1102.01 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17861. 1102.01 s [algebraic-graphs]
  17862. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  17863. 1102.01 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17864. 1102.01 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17865. 1102.01 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17866. 1102.01 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17867. 1102.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17868. 1102.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17869. 1102.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17870. 1102.01 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17871. 1102.01 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17872. 1102.01 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17873. 1102.01 s [algebraic-graphs]
  17874. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  17875. 1102.01 s [algebraic-graphs] OK: vertices [] == empty
  17876. 1102.01 s [algebraic-graphs] OK: vertices [x] == vertex x
  17877. 1102.01 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17878. 1102.01 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17879. 1102.01 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17880. 1102.01 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17881. 1102.01 s [algebraic-graphs]
  17882. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  17883. 1102.01 s [algebraic-graphs] OK: edges [] == empty
  17884. 1102.01 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17885. 1102.01 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17886. 1102.01 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17887. 1102.01 s [algebraic-graphs]
  17888. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  17889. 1102.01 s [algebraic-graphs] OK: overlays [] == empty
  17890. 1102.01 s [algebraic-graphs] OK: overlays [x] == x
  17891. 1102.01 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17892. 1102.01 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17893. 1102.01 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17894. 1102.01 s [algebraic-graphs]
  17895. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  17896. 1102.01 s [algebraic-graphs] OK: connects [] == empty
  17897. 1102.01 s [algebraic-graphs] OK: connects [x] == x
  17898. 1102.01 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17899. 1102.01 s [algebraic-graphs] OK: connects == foldr connect empty
  17900. 1102.01 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17901. 1102.01 s [algebraic-graphs]
  17902. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  17903. 1102.01 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  17904. 1102.01 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  17905. 1102.01 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  17906. 1102.01 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  17907. 1102.01 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  17908. 1102.01 s [algebraic-graphs]
  17909. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  17910. 1102.01 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17911. 1102.01 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17912. 1102.01 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17913. 1102.01 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17914. 1102.01 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17915. 1102.01 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17916. 1102.01 s [algebraic-graphs]
  17917. 1102.01 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  17918. 1102.01 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17919. 1102.01 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17920. 1102.01 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17921. 1102.01 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17922. 1102.01 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17923. 1102.01 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17924. 1102.01 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17925. 1102.01 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17926. 1102.01 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17927. 1102.01 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17928. 1102.01 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17929. 1102.01 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17930. 1102.01 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17931. 1102.01 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17932. 1102.01 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17933. 1102.01 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17934. 1102.01 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17935. 1102.01 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17936. 1102.01 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17937. 1102.01 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17938. 1102.02 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17939. 1102.02 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17940. 1102.02 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17941. 1102.02 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17942. 1102.02 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17943. 1102.02 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17944. 1102.02 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17945. 1102.02 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17946. 1102.02 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17947. 1102.02 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17948. 1102.02 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17949. 1102.02 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17950. 1102.02 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17951. 1102.02 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17952. 1103.27 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17953. 1103.27 s [algebraic-graphs]
  17954. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  17955. 1103.27 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17956. 1103.27 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17957. 1103.27 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17958. 1103.27 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17959. 1103.27 s [algebraic-graphs]
  17960. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  17961. 1103.27 s [algebraic-graphs] OK: isEmpty empty == True
  17962. 1103.27 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17963. 1103.27 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17964. 1103.27 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17965. 1103.27 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17966. 1103.27 s [algebraic-graphs]
  17967. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  17968. 1103.27 s [algebraic-graphs] OK: hasVertex x empty == False
  17969. 1103.27 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17970. 1103.27 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17971. 1103.27 s [algebraic-graphs]
  17972. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  17973. 1103.27 s [algebraic-graphs] OK: hasEdge x y empty == False
  17974. 1103.27 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17975. 1103.27 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17976. 1103.27 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17977. 1103.27 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17978. 1103.27 s [algebraic-graphs]
  17979. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  17980. 1103.27 s [algebraic-graphs] OK: vertexCount empty == 0
  17981. 1103.27 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17982. 1103.27 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17983. 1103.27 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17984. 1103.27 s [algebraic-graphs]
  17985. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  17986. 1103.27 s [algebraic-graphs] OK: edgeCount empty == 0
  17987. 1103.27 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17988. 1103.27 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17989. 1103.27 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17990. 1103.27 s [algebraic-graphs]
  17991. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  17992. 1103.27 s [algebraic-graphs] OK: vertexList empty == []
  17993. 1103.27 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17994. 1103.27 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17995. 1103.27 s [algebraic-graphs]
  17996. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  17997. 1103.27 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17998. 1103.27 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17999. 1103.27 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18000. 1103.27 s [algebraic-graphs]
  18001. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  18002. 1103.27 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  18003. 1103.27 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18004. 1103.27 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18005. 1103.27 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18006. 1103.27 s [algebraic-graphs]
  18007. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  18008. 1103.27 s [algebraic-graphs] OK: edgeList empty == []
  18009. 1103.27 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18010. 1103.27 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18011. 1103.27 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18012. 1103.27 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18013. 1103.27 s [algebraic-graphs]
  18014. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  18015. 1103.27 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18016. 1103.27 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18017. 1103.27 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18018. 1103.27 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18019. 1103.27 s [algebraic-graphs]
  18020. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  18021. 1103.27 s [algebraic-graphs] OK: adjacencyList empty == []
  18022. 1103.27 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  18023. 1103.27 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  18024. 1103.27 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  18025. 1103.27 s [algebraic-graphs]
  18026. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  18027. 1103.27 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18028. 1103.27 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18029. 1103.27 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18030. 1103.27 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18031. 1103.27 s [algebraic-graphs]
  18032. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  18033. 1103.27 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18034. 1103.27 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18035. 1103.27 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18036. 1103.27 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18037. 1103.27 s [algebraic-graphs]
  18038. 1103.27 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  18039. 1103.27 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18040. 1103.27 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18041. 1103.27 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18042. 1103.28 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18043. 1103.28 s [algebraic-graphs]
  18044. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  18045. 1103.28 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18046. 1103.28 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18047. 1103.28 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18048. 1103.28 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18049. 1103.28 s [algebraic-graphs]
  18050. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  18051. 1103.28 s [algebraic-graphs] OK: path [] == empty
  18052. 1103.28 s [algebraic-graphs] OK: path [x] == vertex x
  18053. 1103.28 s [algebraic-graphs] OK: path [x,y] == edge x y
  18054. 1103.28 s [algebraic-graphs]
  18055. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  18056. 1103.28 s [algebraic-graphs] OK: circuit [] == empty
  18057. 1103.28 s [algebraic-graphs] OK: circuit [x] == edge x x
  18058. 1103.28 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18059. 1103.28 s [algebraic-graphs]
  18060. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  18061. 1103.28 s [algebraic-graphs] OK: clique [] == empty
  18062. 1103.28 s [algebraic-graphs] OK: clique [x] == vertex x
  18063. 1103.28 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18064. 1103.28 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18065. 1103.28 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18066. 1103.28 s [algebraic-graphs]
  18067. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  18068. 1103.28 s [algebraic-graphs] OK: biclique [] [] == empty
  18069. 1103.28 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18070. 1103.28 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18071. 1103.28 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18072. 1103.28 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18073. 1103.28 s [algebraic-graphs]
  18074. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  18075. 1103.28 s [algebraic-graphs] OK: star x [] == vertex x
  18076. 1103.28 s [algebraic-graphs] OK: star x [y] == edge x y
  18077. 1103.28 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18078. 1103.28 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  18079. 1103.28 s [algebraic-graphs]
  18080. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  18081. 1103.28 s [algebraic-graphs] OK: stars [] == empty
  18082. 1103.28 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  18083. 1103.28 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18084. 1103.28 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18085. 1103.28 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18086. 1103.28 s [algebraic-graphs] OK: stars . adjacencyList == id
  18087. 1103.28 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18088. 1103.28 s [algebraic-graphs]
  18089. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  18090. 1103.28 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18091. 1103.28 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  18092. 1103.28 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18093. 1103.28 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  18094. 1103.28 s [algebraic-graphs]
  18095. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  18096. 1103.28 s [algebraic-graphs] OK: forest [] == empty
  18097. 1103.28 s [algebraic-graphs] OK: forest [x] == tree x
  18098. 1103.28 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  18099. 1103.28 s [algebraic-graphs] OK: forest == overlays . map tree
  18100. 1103.28 s [algebraic-graphs]
  18101. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  18102. 1103.28 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18103. 1103.28 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18104. 1103.28 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  18105. 1103.28 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  18106. 1103.28 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18107. 1103.28 s [algebraic-graphs]
  18108. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  18109. 1103.28 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  18110. 1103.28 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18111. 1103.28 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18112. 1103.28 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18113. 1103.28 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18114. 1103.28 s [algebraic-graphs]
  18115. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  18116. 1103.28 s [algebraic-graphs] OK: replaceVertex x x == id
  18117. 1103.28 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18118. 1103.28 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18119. 1103.28 s [algebraic-graphs]
  18120. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  18121. 1103.28 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18122. 1103.28 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18123. 1103.28 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18124. 1103.28 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18125. 1103.28 s [algebraic-graphs]
  18126. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  18127. 1103.28 s [algebraic-graphs] OK: transpose empty == empty
  18128. 1103.28 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18129. 1103.28 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18130. 1103.28 s [algebraic-graphs] OK: transpose . transpose == id
  18131. 1103.28 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18132. 1103.28 s [algebraic-graphs]
  18133. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  18134. 1103.28 s [algebraic-graphs] OK: gmap f empty == empty
  18135. 1103.28 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18136. 1103.28 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18137. 1103.28 s [algebraic-graphs] OK: gmap id == id
  18138. 1103.28 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18139. 1103.28 s [algebraic-graphs]
  18140. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  18141. 1103.28 s [algebraic-graphs] OK: induce (const True ) x == x
  18142. 1103.28 s [algebraic-graphs] OK: induce (const False) x == empty
  18143. 1103.28 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18144. 1103.28 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18145. 1103.28 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18146. 1103.28 s [algebraic-graphs]
  18147. 1103.28 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  18148. 1103.28 s [algebraic-graphs] OK: compose empty x == empty
  18149. 1103.28 s [algebraic-graphs] OK: compose x empty == empty
  18150. 1103.28 s [algebraic-graphs] OK: compose (vertex x) y == empty
  18151. 1103.28 s [algebraic-graphs] OK: compose x (vertex y) == empty
  18152. 1103.28 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  18153. 1103.28 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  18154. 1103.65 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  18155. 1103.65 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  18156. 1103.65 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  18157. 1103.65 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  18158. 1103.65 s [algebraic-graphs]
  18159. 1103.65 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  18160. 1103.65 s [algebraic-graphs] OK: closure empty == empty
  18161. 1103.65 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  18162. 1103.65 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  18163. 1103.65 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18164. 1103.65 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  18165. 1103.65 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18166. 1103.65 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18167. 1103.65 s [algebraic-graphs] OK: closure . closure == closure
  18168. 1103.65 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18169. 1103.65 s [algebraic-graphs]
  18170. 1103.65 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  18171. 1103.65 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  18172. 1103.65 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  18173. 1103.65 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  18174. 1103.65 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18175. 1103.65 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18176. 1103.65 s [algebraic-graphs]
  18177. 1103.65 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  18178. 1103.65 s [algebraic-graphs] OK: symmetricClosure empty == empty
  18179. 1103.65 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18180. 1103.65 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  18181. 1103.65 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18182. 1103.65 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18183. 1103.65 s [algebraic-graphs]
  18184. 1103.65 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  18185. 1103.65 s [algebraic-graphs] OK: transitiveClosure empty == empty
  18186. 1103.65 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18187. 1103.65 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  18188. 1103.65 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  18189. 1103.65 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18190. 1103.65 s [algebraic-graphs]
  18191. 1103.65 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  18192. 1103.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  18193. 1103.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  18194. 1103.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  18195. 1103.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  18196. 1103.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  18197. 1103.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  18198. 1103.65 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  18199. 1103.65 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  18200. 1103.65 s [algebraic-graphs] OK: bfsForest x [] == []
  18201. 1103.65 s [algebraic-graphs] OK: bfsForest empty vs == []
  18202. 1103.65 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18203. 1103.65 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  18204. 1103.65 s [algebraic-graphs]
  18205. 1103.65 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  18206. 1103.65 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  18207. 1103.65 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  18208. 1103.65 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  18209. 1103.65 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  18210. 1103.65 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  18211. 1103.65 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  18212. 1103.65 s [algebraic-graphs] OK: bfs empty vs == []
  18213. 1103.65 s [algebraic-graphs] OK: bfs x [] == []
  18214. 1103.65 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  18215. 1103.65 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  18216. 1103.65 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  18217. 1103.65 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  18218. 1103.65 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  18219. 1103.65 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  18220. 1103.65 s [algebraic-graphs]
  18221. 1103.65 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  18222. 1103.65 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  18223. 1103.65 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  18224. 1103.65 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  18225. 1103.65 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  18226. 1103.65 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  18227. 1103.65 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  18228. 1103.65 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  18229. 1103.65 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  18230. 1103.65 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  18231. 1103.65 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  18232. 1103.65 s [algebraic-graphs]
  18233. 1103.65 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  18234. 1103.65 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  18235. 1103.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  18236. 1103.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  18237. 1103.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  18238. 1103.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  18239. 1103.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  18240. 1103.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  18241. 1103.65 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  18242. 1103.66 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  18243. 1103.66 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  18244. 1103.66 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  18245. 1103.66 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18246. 1103.66 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  18247. 1103.66 s [algebraic-graphs]
  18248. 1103.66 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  18249. 1103.66 s [algebraic-graphs] OK: dfs empty vs == []
  18250. 1103.66 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  18251. 1103.66 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  18252. 1103.66 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  18253. 1103.66 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  18254. 1103.66 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  18255. 1103.66 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  18256. 1103.66 s [algebraic-graphs] OK: dfs x [] == []
  18257. 1103.66 s [algebraic-graphs]
  18258. 1103.66 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  18259. 1103.66 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  18260. 1103.66 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  18261. 1103.66 s [algebraic-graphs]
  18262. 1103.66 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  18263. 1103.66 s [algebraic-graphs] OK: reachable empty x == []
  18264. 1103.66 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  18265. 1103.66 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  18266. 1103.66 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  18267. 1103.66 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  18268. 1103.66 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  18269. 1103.66 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  18270. 1103.66 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  18271. 1103.66 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  18272. 1103.66 s [algebraic-graphs]
  18273. 1103.66 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  18274. 1103.66 s [algebraic-graphs]
  18275. 1103.66 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  18276. 1103.66 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  18277. 1103.66 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  18278. 1103.66 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  18279. 1103.66 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  18280. 1103.66 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  18281. 1103.66 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  18282. 1103.66 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  18283. 1103.66 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  18284. 1103.66 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  18285. 1103.66 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  18286. 1103.66 s [algebraic-graphs]
  18287. 1103.66 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  18288. 1103.66 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  18289. 1103.66 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  18290. 1103.66 s [algebraic-graphs] OK: isAcyclic . circuit == null
  18291. 1103.66 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  18292. 1103.66 s [algebraic-graphs]
  18293. 1103.66 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  18294. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  18295. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  18296. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  18297. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  18298. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  18299. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  18300. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  18301. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  18302. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  18303. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  18304. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  18305. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  18306. 1103.66 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  18307. 1119.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  18308. 1119.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  18309. 1119.93 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  18310. 1119.93 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  18311. 1119.93 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  18312. 1119.94 s [algebraic-graphs]
  18313. 1119.94 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  18314. 1119.94 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  18315. 1119.94 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  18316. 1119.94 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  18317. 1119.94 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  18318. 1119.94 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  18319. 1119.94 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  18320. 1119.94 s [algebraic-graphs]
  18321. 1119.94 s [algebraic-graphs] ============ AdjacencyMap ============
  18322. 1119.94 s [algebraic-graphs] OK: Axioms of graphs
  18323. 1119.94 s [algebraic-graphs]
  18324. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  18325. 1119.94 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  18326. 1119.94 s [algebraic-graphs]
  18327. 1119.94 s [algebraic-graphs] OK: consistent empty == True
  18328. 1119.94 s [algebraic-graphs] OK: consistent (vertex x) == True
  18329. 1119.94 s [algebraic-graphs] OK: consistent (overlay x y) == True
  18330. 1119.94 s [algebraic-graphs] OK: consistent (connect x y) == True
  18331. 1119.94 s [algebraic-graphs] OK: consistent (edge x y) == True
  18332. 1119.94 s [algebraic-graphs] OK: consistent (edges xs) == True
  18333. 1119.94 s [algebraic-graphs] OK: consistent (stars xs) == True
  18334. 1119.94 s [algebraic-graphs]
  18335. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  18336. 1119.94 s [algebraic-graphs] OK: show (empty ) == "empty"
  18337. 1119.94 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  18338. 1119.94 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  18339. 1119.94 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  18340. 1119.94 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  18341. 1119.94 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  18342. 1119.94 s [algebraic-graphs]
  18343. 1119.94 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  18344. 1119.94 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  18345. 1119.94 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  18346. 1119.94 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  18347. 1119.94 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  18348. 1119.94 s [algebraic-graphs]
  18349. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  18350. 1119.94 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18351. 1119.94 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18352. 1119.94 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18353. 1119.94 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18354. 1119.94 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18355. 1119.94 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18356. 1119.94 s [algebraic-graphs] OK: x <= x + y
  18357. 1119.94 s [algebraic-graphs] OK: x + y <= x * y
  18358. 1119.94 s [algebraic-graphs]
  18359. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  18360. 1119.94 s [algebraic-graphs] OK: isEmpty empty == True
  18361. 1119.94 s [algebraic-graphs] OK: hasVertex x empty == False
  18362. 1119.94 s [algebraic-graphs] OK: vertexCount empty == 0
  18363. 1119.94 s [algebraic-graphs] OK: edgeCount empty == 0
  18364. 1119.94 s [algebraic-graphs]
  18365. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  18366. 1119.94 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18367. 1119.94 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18368. 1119.94 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18369. 1119.94 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18370. 1119.94 s [algebraic-graphs]
  18371. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  18372. 1119.94 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18373. 1119.94 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18374. 1119.94 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18375. 1119.94 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18376. 1119.94 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18377. 1119.94 s [algebraic-graphs]
  18378. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  18379. 1119.94 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18380. 1119.94 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18381. 1119.94 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18382. 1119.94 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18383. 1119.94 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18384. 1119.94 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18385. 1119.94 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18386. 1119.94 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18387. 1119.94 s [algebraic-graphs]
  18388. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  18389. 1119.94 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18390. 1119.94 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18391. 1119.94 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18392. 1119.94 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18393. 1119.94 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18394. 1119.94 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18395. 1119.94 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18396. 1119.94 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18397. 1119.94 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18398. 1119.94 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18399. 1119.94 s [algebraic-graphs]
  18400. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  18401. 1119.94 s [algebraic-graphs] OK: vertices [] == empty
  18402. 1119.94 s [algebraic-graphs] OK: vertices [x] == vertex x
  18403. 1119.94 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18404. 1119.94 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18405. 1119.94 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18406. 1119.94 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18407. 1119.94 s [algebraic-graphs]
  18408. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  18409. 1119.94 s [algebraic-graphs] OK: edges [] == empty
  18410. 1119.94 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18411. 1119.94 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18412. 1119.94 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18413. 1119.94 s [algebraic-graphs]
  18414. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  18415. 1119.94 s [algebraic-graphs] OK: overlays [] == empty
  18416. 1119.94 s [algebraic-graphs] OK: overlays [x] == x
  18417. 1119.94 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18418. 1119.94 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18419. 1119.94 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18420. 1119.94 s [algebraic-graphs]
  18421. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  18422. 1119.94 s [algebraic-graphs] OK: connects [] == empty
  18423. 1119.94 s [algebraic-graphs] OK: connects [x] == x
  18424. 1119.94 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18425. 1119.94 s [algebraic-graphs] OK: connects == foldr connect empty
  18426. 1119.94 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18427. 1119.94 s [algebraic-graphs]
  18428. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  18429. 1119.94 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  18430. 1119.94 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  18431. 1119.94 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  18432. 1119.94 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  18433. 1119.94 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  18434. 1119.94 s [algebraic-graphs]
  18435. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  18436. 1119.94 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18437. 1119.94 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18438. 1119.94 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18439. 1119.94 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18440. 1119.94 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  18441. 1119.94 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18442. 1119.94 s [algebraic-graphs]
  18443. 1119.94 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  18444. 1119.94 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  18445. 1119.94 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  18446. 1119.94 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  18447. 1119.94 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  18448. 1119.94 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  18449. 1119.94 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  18450. 1119.95 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  18451. 1119.95 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  18452. 1119.95 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  18453. 1119.95 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  18454. 1119.95 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  18455. 1119.95 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  18456. 1119.95 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  18457. 1119.95 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  18458. 1119.95 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  18459. 1119.95 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  18460. 1119.95 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  18461. 1119.95 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  18462. 1119.95 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  18463. 1119.95 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  18464. 1119.95 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  18465. 1119.95 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  18466. 1119.95 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  18467. 1119.95 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  18468. 1119.95 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  18469. 1119.95 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  18470. 1119.95 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  18471. 1119.95 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  18472. 1119.95 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18473. 1119.95 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  18474. 1119.95 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  18475. 1119.95 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  18476. 1119.95 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  18477. 1124.33 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  18478. 1124.33 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18479. 1124.33 s [algebraic-graphs]
  18480. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  18481. 1124.33 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  18482. 1124.33 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  18483. 1124.33 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  18484. 1124.33 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  18485. 1124.33 s [algebraic-graphs]
  18486. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  18487. 1124.33 s [algebraic-graphs] OK: isEmpty empty == True
  18488. 1124.33 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18489. 1124.33 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18490. 1124.33 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18491. 1124.33 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  18492. 1124.33 s [algebraic-graphs]
  18493. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  18494. 1124.33 s [algebraic-graphs] OK: hasVertex x empty == False
  18495. 1124.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18496. 1124.33 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18497. 1124.33 s [algebraic-graphs]
  18498. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  18499. 1124.33 s [algebraic-graphs] OK: hasEdge x y empty == False
  18500. 1124.33 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18501. 1124.33 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18502. 1124.33 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18503. 1124.33 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18504. 1124.33 s [algebraic-graphs]
  18505. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  18506. 1124.33 s [algebraic-graphs] OK: vertexCount empty == 0
  18507. 1124.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18508. 1124.33 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18509. 1124.33 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18510. 1124.33 s [algebraic-graphs]
  18511. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  18512. 1124.33 s [algebraic-graphs] OK: edgeCount empty == 0
  18513. 1124.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18514. 1124.33 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18515. 1124.33 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18516. 1124.33 s [algebraic-graphs]
  18517. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  18518. 1124.33 s [algebraic-graphs] OK: vertexList empty == []
  18519. 1124.33 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18520. 1124.33 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18521. 1124.33 s [algebraic-graphs]
  18522. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  18523. 1124.33 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18524. 1124.33 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18525. 1124.33 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18526. 1124.33 s [algebraic-graphs]
  18527. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  18528. 1124.33 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  18529. 1124.33 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18530. 1124.33 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18531. 1124.33 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18532. 1124.33 s [algebraic-graphs]
  18533. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  18534. 1124.33 s [algebraic-graphs] OK: edgeList empty == []
  18535. 1124.33 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18536. 1124.33 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18537. 1124.33 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18538. 1124.33 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18539. 1124.33 s [algebraic-graphs]
  18540. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  18541. 1124.33 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18542. 1124.33 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18543. 1124.33 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18544. 1124.33 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18545. 1124.33 s [algebraic-graphs]
  18546. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  18547. 1124.33 s [algebraic-graphs] OK: adjacencyList empty == []
  18548. 1124.33 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  18549. 1124.33 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  18550. 1124.33 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  18551. 1124.33 s [algebraic-graphs]
  18552. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  18553. 1124.33 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18554. 1124.33 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18555. 1124.33 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18556. 1124.33 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18557. 1124.33 s [algebraic-graphs]
  18558. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  18559. 1124.33 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18560. 1124.33 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18561. 1124.33 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18562. 1124.33 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18563. 1124.33 s [algebraic-graphs]
  18564. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  18565. 1124.33 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18566. 1124.33 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18567. 1124.33 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18568. 1124.33 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18569. 1124.33 s [algebraic-graphs]
  18570. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  18571. 1124.33 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18572. 1124.33 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18573. 1124.33 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18574. 1124.33 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18575. 1124.33 s [algebraic-graphs]
  18576. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.path ============
  18577. 1124.33 s [algebraic-graphs] OK: path [] == empty
  18578. 1124.33 s [algebraic-graphs] OK: path [x] == vertex x
  18579. 1124.33 s [algebraic-graphs] OK: path [x,y] == edge x y
  18580. 1124.33 s [algebraic-graphs]
  18581. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  18582. 1124.33 s [algebraic-graphs] OK: circuit [] == empty
  18583. 1124.33 s [algebraic-graphs] OK: circuit [x] == edge x x
  18584. 1124.33 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18585. 1124.33 s [algebraic-graphs]
  18586. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  18587. 1124.33 s [algebraic-graphs] OK: clique [] == empty
  18588. 1124.33 s [algebraic-graphs] OK: clique [x] == vertex x
  18589. 1124.33 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18590. 1124.33 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18591. 1124.33 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18592. 1124.33 s [algebraic-graphs]
  18593. 1124.33 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  18594. 1124.33 s [algebraic-graphs] OK: biclique [] [] == empty
  18595. 1124.33 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18596. 1124.33 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18597. 1124.33 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18598. 1124.33 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18599. 1124.34 s [algebraic-graphs]
  18600. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.star ============
  18601. 1124.34 s [algebraic-graphs] OK: star x [] == vertex x
  18602. 1124.34 s [algebraic-graphs] OK: star x [y] == edge x y
  18603. 1124.34 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18604. 1124.34 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  18605. 1124.34 s [algebraic-graphs]
  18606. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  18607. 1124.34 s [algebraic-graphs] OK: stars [] == empty
  18608. 1124.34 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  18609. 1124.34 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18610. 1124.34 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18611. 1124.34 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18612. 1124.34 s [algebraic-graphs] OK: stars . adjacencyList == id
  18613. 1124.34 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18614. 1124.34 s [algebraic-graphs]
  18615. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  18616. 1124.34 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18617. 1124.34 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  18618. 1124.34 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18619. 1124.34 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  18620. 1124.34 s [algebraic-graphs]
  18621. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  18622. 1124.34 s [algebraic-graphs] OK: forest [] == empty
  18623. 1124.34 s [algebraic-graphs] OK: forest [x] == tree x
  18624. 1124.34 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  18625. 1124.34 s [algebraic-graphs] OK: forest == overlays . map tree
  18626. 1124.34 s [algebraic-graphs]
  18627. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  18628. 1124.34 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18629. 1124.34 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18630. 1124.34 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  18631. 1124.34 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  18632. 1124.34 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18633. 1124.34 s [algebraic-graphs]
  18634. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  18635. 1124.34 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  18636. 1124.34 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18637. 1124.34 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18638. 1124.34 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18639. 1124.34 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18640. 1124.34 s [algebraic-graphs]
  18641. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  18642. 1124.34 s [algebraic-graphs] OK: replaceVertex x x == id
  18643. 1124.34 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18644. 1124.34 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18645. 1124.34 s [algebraic-graphs]
  18646. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  18647. 1124.34 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18648. 1124.34 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18649. 1124.34 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18650. 1124.34 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18651. 1124.34 s [algebraic-graphs]
  18652. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  18653. 1124.34 s [algebraic-graphs] OK: transpose empty == empty
  18654. 1124.34 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18655. 1124.34 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18656. 1124.34 s [algebraic-graphs] OK: transpose . transpose == id
  18657. 1124.34 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18658. 1124.34 s [algebraic-graphs]
  18659. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  18660. 1124.34 s [algebraic-graphs] OK: gmap f empty == empty
  18661. 1124.34 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18662. 1124.34 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18663. 1124.34 s [algebraic-graphs] OK: gmap id == id
  18664. 1124.34 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18665. 1124.34 s [algebraic-graphs]
  18666. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  18667. 1124.34 s [algebraic-graphs] OK: induce (const True ) x == x
  18668. 1124.34 s [algebraic-graphs] OK: induce (const False) x == empty
  18669. 1124.34 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18670. 1124.34 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18671. 1124.34 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18672. 1124.34 s [algebraic-graphs]
  18673. 1124.34 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  18674. 1124.34 s [algebraic-graphs] OK: compose empty x == empty
  18675. 1124.34 s [algebraic-graphs] OK: compose x empty == empty
  18676. 1124.34 s [algebraic-graphs] OK: compose (vertex x) y == empty
  18677. 1124.34 s [algebraic-graphs] OK: compose x (vertex y) == empty
  18678. 1124.34 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  18679. 1124.34 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  18680. 1132.08 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  18681. 1132.08 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  18682. 1132.12 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  18683. 1132.12 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  18684. 1132.12 s [algebraic-graphs]
  18685. 1132.12 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  18686. 1132.12 s [algebraic-graphs] OK: closure empty == empty
  18687. 1132.12 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  18688. 1132.12 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  18689. 1132.12 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18690. 1132.12 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  18691. 1132.12 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18692. 1132.12 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18693. 1132.12 s [algebraic-graphs] OK: closure . closure == closure
  18694. 1132.12 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18695. 1132.12 s [algebraic-graphs]
  18696. 1132.12 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  18697. 1132.12 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  18698. 1132.12 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  18699. 1132.12 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  18700. 1132.12 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18701. 1132.12 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18702. 1132.12 s [algebraic-graphs]
  18703. 1132.12 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  18704. 1132.12 s [algebraic-graphs] OK: symmetricClosure empty == empty
  18705. 1132.12 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18706. 1132.12 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  18707. 1132.12 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18708. 1132.12 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18709. 1132.12 s [algebraic-graphs]
  18710. 1132.12 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  18711. 1132.12 s [algebraic-graphs] OK: transitiveClosure empty == empty
  18712. 1132.12 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18713. 1132.12 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  18714. 1132.12 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  18715. 1132.12 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18716. 1132.12 s [algebraic-graphs]
  18717. 1132.12 s [algebraic-graphs] ============ AdjacencyMap.box ============
  18718. 1132.12 s [algebraic-graphs] OK: box x y ~~ box y x
  18719. 1132.12 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  18720. 1132.12 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  18721. 1132.12 s [algebraic-graphs] OK: box x empty ~~ empty
  18722. 1132.12 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18723. 1132.12 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18724. 1132.12 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  18725. 1132.12 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18726. 1132.12 s [algebraic-graphs]
  18727. 1132.12 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  18728. 1132.12 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  18729. 1132.12 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  18730. 1132.12 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  18731. 1132.12 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  18732. 1132.12 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  18733. 1132.12 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  18734. 1132.12 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  18735. 1132.12 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  18736. 1132.12 s [algebraic-graphs] OK: bfsForest x [] == []
  18737. 1132.12 s [algebraic-graphs] OK: bfsForest empty vs == []
  18738. 1132.12 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18739. 1132.12 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  18740. 1132.12 s [algebraic-graphs]
  18741. 1132.12 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  18742. 1132.12 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  18743. 1132.12 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  18744. 1132.12 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  18745. 1132.12 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  18746. 1132.12 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  18747. 1132.12 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  18748. 1132.12 s [algebraic-graphs] OK: bfs empty vs == []
  18749. 1132.12 s [algebraic-graphs] OK: bfs x [] == []
  18750. 1132.12 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  18751. 1132.12 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  18752. 1132.12 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  18753. 1132.12 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  18754. 1132.12 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  18755. 1132.12 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  18756. 1132.12 s [algebraic-graphs]
  18757. 1132.12 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  18758. 1132.12 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  18759. 1132.12 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  18760. 1132.12 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  18761. 1132.12 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  18762. 1132.12 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  18763. 1132.13 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  18764. 1132.13 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  18765. 1132.13 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  18766. 1132.13 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  18767. 1132.13 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  18768. 1132.13 s [algebraic-graphs]
  18769. 1132.13 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  18770. 1132.13 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  18771. 1132.13 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  18772. 1132.13 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  18773. 1132.13 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  18774. 1132.13 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  18775. 1132.13 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  18776. 1132.13 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  18777. 1132.13 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  18778. 1132.13 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  18779. 1132.13 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  18780. 1132.13 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  18781. 1132.13 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18782. 1132.13 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  18783. 1132.13 s [algebraic-graphs]
  18784. 1132.13 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18785. 1132.13 s [algebraic-graphs] OK: dfs empty vs == []
  18786. 1132.13 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  18787. 1132.13 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  18788. 1132.13 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  18789. 1132.13 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  18790. 1132.13 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  18791. 1132.13 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  18792. 1132.13 s [algebraic-graphs] OK: dfs x [] == []
  18793. 1132.13 s [algebraic-graphs]
  18794. 1132.13 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  18795. 1132.13 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  18796. 1132.13 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  18797. 1132.13 s [algebraic-graphs]
  18798. 1132.13 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18799. 1132.13 s [algebraic-graphs] OK: reachable empty x == []
  18800. 1132.13 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  18801. 1132.13 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  18802. 1132.13 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  18803. 1132.13 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  18804. 1132.13 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  18805. 1132.13 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  18806. 1132.13 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  18807. 1132.13 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  18808. 1132.13 s [algebraic-graphs]
  18809. 1132.13 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  18810. 1132.13 s [algebraic-graphs]
  18811. 1132.13 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  18812. 1132.13 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  18813. 1132.13 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  18814. 1132.13 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  18815. 1132.13 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  18816. 1132.13 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  18817. 1132.13 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  18818. 1132.13 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  18819. 1132.13 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  18820. 1132.13 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  18821. 1132.13 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  18822. 1132.13 s [algebraic-graphs]
  18823. 1132.13 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  18824. 1132.13 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  18825. 1132.13 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  18826. 1132.13 s [algebraic-graphs] OK: isAcyclic . circuit == null
  18827. 1132.13 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  18828. 1132.13 s [algebraic-graphs]
  18829. 1132.13 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  18830. 1132.13 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  18831. 1132.13 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  18832. 1132.13 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  18833. 1132.13 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  18834. 1132.13 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  18835. 1132.13 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  18836. 1132.13 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  18837. 1148.56 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  18838. 1148.56 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  18839. 1148.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  18840. 1148.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  18841. 1148.60 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  18842. 1148.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  18843. 1148.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  18844. 1148.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  18845. 1148.60 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  18846. 1148.60 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  18847. 1148.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  18848. 1148.60 s [algebraic-graphs]
  18849. 1148.60 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  18850. 1148.60 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  18851. 1148.60 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  18852. 1148.60 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  18853. 1148.60 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  18854. 1148.60 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  18855. 1148.60 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  18856. 1148.60 s [algebraic-graphs]
  18857. 1148.60 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  18858. 1148.60 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18859. 1148.60 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18860. 1148.60 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18861. 1148.60 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18862. 1148.60 s [algebraic-graphs]
  18863. 1148.60 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  18864. 1148.60 s [algebraic-graphs] OK: scc empty == empty
  18865. 1148.60 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  18866. 1148.60 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  18867. 1148.60 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  18868. 1148.60 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  18869. 1148.60 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  18870. 1148.60 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  18871. 1148.60 s [algebraic-graphs] OK: isAcyclic . scc == const True
  18872. 1148.60 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  18873. 1148.60 s [algebraic-graphs] OK: scc g == KL.scc g
  18874. 1148.60 s [algebraic-graphs]
  18875. 1148.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  18876. 1148.60 s [algebraic-graphs] OK: 0 == rightVertex 0
  18877. 1148.60 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  18878. 1148.60 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  18879. 1148.60 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  18880. 1148.60 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  18881. 1148.60 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  18882. 1148.60 s [algebraic-graphs]
  18883. 1148.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  18884. 1148.60 s [algebraic-graphs] OK: show empty == "empty"
  18885. 1148.60 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  18886. 1148.60 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  18887. 1148.60 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  18888. 1148.60 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  18889. 1148.60 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  18890. 1148.60 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  18891. 1148.60 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  18892. 1148.60 s [algebraic-graphs]
  18893. 1148.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  18894. 1148.60 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  18895. 1148.60 s [algebraic-graphs]
  18896. 1148.60 s [algebraic-graphs] OK: x + y == y + x
  18897. 1148.60 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  18898. 1148.60 s [algebraic-graphs] OK: x * empty == x
  18899. 1148.60 s [algebraic-graphs] OK: empty * x == x
  18900. 1148.60 s [algebraic-graphs] OK: x * y == y * x
  18901. 1148.60 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  18902. 1148.61 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  18903. 1148.61 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  18904. 1148.61 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  18905. 1148.61 s [algebraic-graphs] OK: x + empty == x
  18906. 1148.61 s [algebraic-graphs] OK: empty + x == x
  18907. 1148.61 s [algebraic-graphs] OK: x + x == x
  18908. 1148.61 s [algebraic-graphs] OK: x * y + x + y == x * y
  18909. 1148.61 s [algebraic-graphs] OK: x * x * x == x * x
  18910. 1148.61 s [algebraic-graphs]
  18911. 1148.61 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  18912. 1148.61 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  18913. 1148.61 s [algebraic-graphs]
  18914. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  18915. 1148.61 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18916. 1148.61 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18917. 1148.61 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18918. 1148.61 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18919. 1148.61 s [algebraic-graphs]
  18920. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  18921. 1148.61 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18922. 1148.61 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18923. 1148.61 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18924. 1148.61 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18925. 1148.61 s [algebraic-graphs]
  18926. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  18927. 1148.61 s [algebraic-graphs] OK: isEmpty empty == True
  18928. 1148.61 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18929. 1148.61 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18930. 1148.61 s [algebraic-graphs] OK: hasVertex x empty == False
  18931. 1148.61 s [algebraic-graphs]
  18932. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  18933. 1148.61 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18934. 1148.61 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18935. 1148.61 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18936. 1148.61 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18937. 1148.61 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  18938. 1148.61 s [algebraic-graphs]
  18939. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  18940. 1148.61 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18941. 1148.61 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18942. 1148.61 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18943. 1148.61 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18944. 1148.61 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  18945. 1148.61 s [algebraic-graphs]
  18946. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  18947. 1148.61 s [algebraic-graphs] OK: vertex . Left == leftVertex
  18948. 1148.61 s [algebraic-graphs] OK: vertex . Right == rightVertex
  18949. 1148.61 s [algebraic-graphs]
  18950. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  18951. 1148.61 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  18952. 1148.61 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18953. 1148.61 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18954. 1148.61 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18955. 1148.61 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  18956. 1148.61 s [algebraic-graphs]
  18957. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  18958. 1148.61 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18959. 1148.61 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18960. 1148.61 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18961. 1148.61 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18962. 1148.61 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18963. 1148.61 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18964. 1148.61 s [algebraic-graphs]
  18965. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  18966. 1148.61 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  18967. 1148.61 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  18968. 1148.61 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  18969. 1148.61 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  18970. 1148.61 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  18971. 1148.61 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18972. 1148.61 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18973. 1148.61 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18974. 1148.61 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18975. 1148.61 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18976. 1148.61 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  18977. 1148.61 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  18978. 1148.61 s [algebraic-graphs]
  18979. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  18980. 1148.61 s [algebraic-graphs] OK: vertices [] [] == empty
  18981. 1148.61 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  18982. 1148.61 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  18983. 1148.61 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  18984. 1148.61 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  18985. 1148.61 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  18986. 1148.61 s [algebraic-graphs]
  18987. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  18988. 1148.61 s [algebraic-graphs] OK: edges [] == empty
  18989. 1148.61 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18990. 1148.61 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18991. 1148.61 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  18992. 1148.61 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18993. 1148.61 s [algebraic-graphs]
  18994. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  18995. 1148.61 s [algebraic-graphs] OK: overlays [] == empty
  18996. 1148.61 s [algebraic-graphs] OK: overlays [x] == x
  18997. 1148.61 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18998. 1148.61 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18999. 1148.61 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19000. 1148.61 s [algebraic-graphs]
  19001. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  19002. 1148.61 s [algebraic-graphs] OK: connects [] == empty
  19003. 1148.61 s [algebraic-graphs] OK: connects [x] == x
  19004. 1148.61 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19005. 1148.61 s [algebraic-graphs] OK: connects == foldr connect empty
  19006. 1148.61 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19007. 1148.61 s [algebraic-graphs]
  19008. 1148.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  19009. 1150.79 s [algebraic-graphs] OK: swap empty == empty
  19010. 1150.79 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  19011. 1150.79 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  19012. 1150.79 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  19013. 1150.79 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  19014. 1150.79 s [algebraic-graphs] OK: swap . swap == id
  19015. 1150.79 s [algebraic-graphs]
  19016. 1150.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  19017. 1150.79 s [algebraic-graphs] OK: toBipartite empty == empty
  19018. 1150.79 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  19019. 1150.79 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  19020. 1150.79 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  19021. 1150.79 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  19022. 1150.79 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  19023. 1150.79 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  19024. 1150.79 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  19025. 1150.79 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  19026. 1150.79 s [algebraic-graphs]
  19027. 1150.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  19028. 1150.79 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  19029. 1150.79 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  19030. 1150.79 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  19031. 1150.79 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  19032. 1150.80 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  19033. 1150.80 s [algebraic-graphs]
  19034. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  19035. 1150.80 s [algebraic-graphs] OK: fromBipartite empty == empty
  19036. 1150.80 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  19037. 1150.80 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  19038. 1150.80 s [algebraic-graphs]
  19039. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  19040. 1150.80 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  19041. 1150.80 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  19042. 1150.80 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  19043. 1150.80 s [algebraic-graphs]
  19044. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  19045. 1150.80 s [algebraic-graphs] OK: isEmpty empty == True
  19046. 1150.80 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19047. 1150.80 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19048. 1150.80 s [algebraic-graphs] OK: isEmpty == (==) empty
  19049. 1150.80 s [algebraic-graphs]
  19050. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  19051. 1150.80 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  19052. 1150.80 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  19053. 1150.80 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  19054. 1150.80 s [algebraic-graphs]
  19055. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  19056. 1150.80 s [algebraic-graphs] OK: hasRightVertex x empty == False
  19057. 1150.80 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  19058. 1150.80 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  19059. 1150.80 s [algebraic-graphs]
  19060. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  19061. 1150.80 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  19062. 1150.80 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  19063. 1150.80 s [algebraic-graphs]
  19064. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  19065. 1150.80 s [algebraic-graphs] OK: hasEdge x y empty == False
  19066. 1150.80 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19067. 1150.80 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19068. 1150.80 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19069. 1150.80 s [algebraic-graphs]
  19070. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  19071. 1150.80 s [algebraic-graphs] OK: leftVertexCount empty == 0
  19072. 1150.80 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  19073. 1150.80 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  19074. 1150.80 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  19075. 1150.80 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  19076. 1150.80 s [algebraic-graphs]
  19077. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  19078. 1150.80 s [algebraic-graphs] OK: rightVertexCount empty == 0
  19079. 1150.80 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  19080. 1150.80 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  19081. 1150.80 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  19082. 1150.80 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  19083. 1150.80 s [algebraic-graphs]
  19084. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  19085. 1150.80 s [algebraic-graphs] OK: vertexCount empty == 0
  19086. 1150.80 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19087. 1150.80 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  19088. 1150.80 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  19089. 1150.80 s [algebraic-graphs]
  19090. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  19091. 1150.80 s [algebraic-graphs] OK: edgeCount empty == 0
  19092. 1150.80 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19093. 1150.80 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19094. 1150.80 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  19095. 1150.80 s [algebraic-graphs]
  19096. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  19097. 1150.80 s [algebraic-graphs] OK: leftVertexList empty == []
  19098. 1150.80 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  19099. 1150.80 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  19100. 1150.80 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  19101. 1150.80 s [algebraic-graphs]
  19102. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  19103. 1150.80 s [algebraic-graphs] OK: rightVertexList empty == []
  19104. 1150.80 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  19105. 1150.80 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  19106. 1150.80 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  19107. 1150.80 s [algebraic-graphs]
  19108. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  19109. 1150.80 s [algebraic-graphs] OK: vertexList empty == []
  19110. 1150.80 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19111. 1150.80 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  19112. 1150.80 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  19113. 1150.80 s [algebraic-graphs]
  19114. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  19115. 1150.80 s [algebraic-graphs] OK: edgeList empty == []
  19116. 1150.80 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19117. 1150.80 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19118. 1150.80 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  19119. 1150.80 s [algebraic-graphs]
  19120. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  19121. 1150.80 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  19122. 1150.80 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  19123. 1150.80 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  19124. 1150.80 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  19125. 1150.80 s [algebraic-graphs]
  19126. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  19127. 1150.80 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  19128. 1150.80 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  19129. 1150.80 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  19130. 1150.80 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  19131. 1150.80 s [algebraic-graphs]
  19132. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  19133. 1150.80 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19134. 1150.80 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19135. 1150.80 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  19136. 1150.80 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  19137. 1150.80 s [algebraic-graphs]
  19138. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  19139. 1150.80 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19140. 1150.80 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19141. 1150.80 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19142. 1150.80 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  19143. 1150.80 s [algebraic-graphs]
  19144. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  19145. 1150.80 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  19146. 1150.80 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  19147. 1150.80 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  19148. 1150.80 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  19149. 1150.80 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  19150. 1150.80 s [algebraic-graphs]
  19151. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  19152. 1150.80 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  19153. 1150.80 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  19154. 1150.80 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  19155. 1150.80 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  19156. 1150.80 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  19157. 1150.80 s [algebraic-graphs]
  19158. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  19159. 1150.80 s [algebraic-graphs] OK: evenList [] == Nil
  19160. 1150.80 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  19161. 1150.80 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  19162. 1150.80 s [algebraic-graphs]
  19163. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  19164. 1150.80 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  19165. 1150.80 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  19166. 1150.80 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  19167. 1150.80 s [algebraic-graphs]
  19168. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  19169. 1150.80 s [algebraic-graphs] OK: path Nil == empty
  19170. 1150.80 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  19171. 1150.80 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  19172. 1150.80 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  19173. 1150.80 s [algebraic-graphs]
  19174. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  19175. 1150.80 s [algebraic-graphs] OK: circuit [] == empty
  19176. 1150.80 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  19177. 1150.80 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  19178. 1150.80 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  19179. 1150.80 s [algebraic-graphs]
  19180. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  19181. 1150.80 s [algebraic-graphs] OK: biclique [] [] == empty
  19182. 1150.80 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  19183. 1150.80 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  19184. 1150.80 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  19185. 1150.80 s [algebraic-graphs]
  19186. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  19187. 1150.80 s [algebraic-graphs] OK: star x [] == leftVertex x
  19188. 1150.80 s [algebraic-graphs] OK: star x [y] == edge x y
  19189. 1150.80 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19190. 1150.80 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  19191. 1150.80 s [algebraic-graphs]
  19192. 1150.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  19193. 1150.80 s [algebraic-graphs] OK: stars [] == empty
  19194. 1150.80 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  19195. 1150.80 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  19196. 1150.80 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  19197. 1196.14 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19198. 1196.18 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  19199. 1196.18 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  19200. 1196.18 s [algebraic-graphs]
  19201. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  19202. 1196.18 s [algebraic-graphs] OK: mesh xs [] == empty
  19203. 1196.18 s [algebraic-graphs] OK: mesh [] ys == empty
  19204. 1196.18 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  19205. 1196.18 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  19206. 1196.18 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  19207. 1196.18 s [algebraic-graphs]
  19208. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  19209. 1196.18 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  19210. 1196.18 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  19211. 1196.18 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  19212. 1196.18 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  19213. 1196.18 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  19214. 1196.18 s [algebraic-graphs]
  19215. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  19216. 1196.18 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  19217. 1196.18 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  19218. 1196.18 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  19219. 1196.18 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  19220. 1196.18 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  19221. 1196.18 s [algebraic-graphs]
  19222. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  19223. 1196.18 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  19224. 1196.18 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19225. 1196.18 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  19226. 1196.18 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  19227. 1196.18 s [algebraic-graphs]
  19228. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  19229. 1196.18 s [algebraic-graphs] OK: bimap f g empty == empty
  19230. 1196.18 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  19231. 1196.18 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  19232. 1196.18 s [algebraic-graphs] OK: bimap id id == id
  19233. 1196.18 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  19234. 1196.18 s [algebraic-graphs]
  19235. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  19236. 1196.18 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  19237. 1196.18 s [algebraic-graphs]
  19238. 1196.18 s [algebraic-graphs] OK: box x y ~~ box y x
  19239. 1196.18 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19240. 1196.18 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19241. 1196.18 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  19242. 1196.18 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  19243. 1196.18 s [algebraic-graphs] OK: box x empty ~~ empty
  19244. 1196.18 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  19245. 1196.18 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19246. 1196.18 s [algebraic-graphs]
  19247. 1196.18 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  19248. 1196.18 s [algebraic-graphs]
  19249. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  19250. 1196.18 s [algebraic-graphs] OK: consistent empty == True
  19251. 1196.18 s [algebraic-graphs] OK: consistent (vertex x) == True
  19252. 1196.18 s [algebraic-graphs] OK: consistent (edge x y) == True
  19253. 1196.18 s [algebraic-graphs] OK: consistent (edges x) == True
  19254. 1196.18 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  19255. 1196.18 s [algebraic-graphs] OK: consistent (swap x) == True
  19256. 1196.18 s [algebraic-graphs] OK: consistent (circuit xs) == True
  19257. 1196.18 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  19258. 1196.18 s [algebraic-graphs]
  19259. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  19260. 1196.18 s [algebraic-graphs] OK: detectParts empty == Right empty
  19261. 1196.18 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  19262. 1196.18 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  19263. 1196.18 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  19264. 1196.18 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  19265. 1196.18 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  19266. 1196.18 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  19267. 1196.18 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  19268. 1196.18 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  19269. 1196.18 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  19270. 1196.18 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  19271. 1196.18 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  19272. 1196.18 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  19273. 1196.18 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  19274. 1196.18 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  19275. 1196.18 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  19276. 1196.18 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  19277. 1196.18 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  19278. 1196.18 s [algebraic-graphs]
  19279. 1196.18 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  19280. 1196.18 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  19281. 1196.18 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  19282. 1196.18 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  19283. 1196.18 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  19284. 1196.18 s [algebraic-graphs]
  19285. 1196.18 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  19286. 1196.18 s [algebraic-graphs] OK: show (matching []) == "matching []"
  19287. 1196.18 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  19288. 1196.18 s [algebraic-graphs]
  19289. 1196.18 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  19290. 1196.18 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  19291. 1196.18 s [algebraic-graphs]
  19292. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  19293. 1196.18 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  19294. 1196.18 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  19295. 1196.18 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  19296. 1196.18 s [algebraic-graphs]
  19297. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  19298. 1196.18 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  19299. 1196.18 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  19300. 1196.18 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  19301. 1196.18 s [algebraic-graphs]
  19302. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  19303. 1196.18 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  19304. 1196.18 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  19305. 1196.18 s [algebraic-graphs]
  19306. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  19307. 1196.18 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  19308. 1196.18 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  19309. 1196.18 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  19310. 1196.18 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  19311. 1196.18 s [algebraic-graphs]
  19312. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  19313. 1196.18 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  19314. 1196.18 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  19315. 1196.18 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  19316. 1196.18 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  19317. 1196.18 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  19318. 1196.18 s [algebraic-graphs]
  19319. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  19320. 1196.18 s [algebraic-graphs] OK: maxMatching empty == matching []
  19321. 1196.18 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  19322. 1196.18 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  19323. 1196.18 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  19324. 1196.18 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  19325. 1196.18 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  19326. 1196.18 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  19327. 1196.18 s [algebraic-graphs]
  19328. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  19329. 1196.18 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  19330. 1196.18 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  19331. 1196.18 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  19332. 1196.18 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  19333. 1196.18 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  19334. 1196.18 s [algebraic-graphs]
  19335. 1196.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  19336. 1196.18 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  19337. 1200.18 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  19338. 1200.18 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  19339. 1200.18 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  19340. 1200.18 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  19341. 1200.18 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  19342. 1200.18 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  19343. 1200.18 s [algebraic-graphs]
  19344. 1200.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  19345. 1200.18 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  19346. 1200.18 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  19347. 1200.18 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  19348. 1200.18 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  19349. 1200.18 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  19350. 1200.18 s [algebraic-graphs]
  19351. 1200.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  19352. 1200.18 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  19353. 1200.18 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  19354. 1200.18 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  19355. 1200.18 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  19356. 1200.18 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  19357. 1200.18 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  19358. 1200.18 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  19359. 1200.18 s [algebraic-graphs]
  19360. 1200.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  19361. 1200.18 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  19362. 1200.18 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  19363. 1200.18 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  19364. 1200.18 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  19365. 1200.18 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  19366. 1200.18 s [algebraic-graphs]
  19367. 1200.18 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  19368. 1200.18 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  19369. 1200.18 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  19370. 1200.18 s [algebraic-graphs]
  19371. 1200.18 s [algebraic-graphs] ============ Export.Eq ============
  19372. 1200.18 s [algebraic-graphs] OK: mempty /= literal ""
  19373. 1200.18 s [algebraic-graphs]
  19374. 1200.18 s [algebraic-graphs] ============ Export.Ord ============
  19375. 1200.18 s [algebraic-graphs] OK: mempty < literal ""
  19376. 1200.18 s [algebraic-graphs]
  19377. 1200.18 s [algebraic-graphs] ============ Export.isEmpty ============
  19378. 1200.18 s [algebraic-graphs] OK: isEmpty mempty == True
  19379. 1200.18 s [algebraic-graphs] OK: isEmpty (literal "") == False
  19380. 1200.18 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  19381. 1200.18 s [algebraic-graphs]
  19382. 1200.18 s [algebraic-graphs] ============ Export.literal ============
  19383. 1200.18 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  19384. 1200.18 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  19385. 1200.18 s [algebraic-graphs] OK: render . literal == id
  19386. 1200.18 s [algebraic-graphs]
  19387. 1200.18 s [algebraic-graphs] ============ Export.render ============
  19388. 1200.18 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  19389. 1200.18 s [algebraic-graphs] OK: render mempty == mempty
  19390. 1200.18 s [algebraic-graphs]
  19391. 1200.18 s [algebraic-graphs] ============ Export.<+> ============
  19392. 1200.18 s [algebraic-graphs] OK: x <+> mempty == x
  19393. 1200.18 s [algebraic-graphs] OK: mempty <+> x == x
  19394. 1200.18 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  19395. 1200.18 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  19396. 1200.18 s [algebraic-graphs]
  19397. 1200.18 s [algebraic-graphs] ============ Export.brackets ============
  19398. 1200.18 s [algebraic-graphs] OK: brackets "i" == "[i]"
  19399. 1200.18 s [algebraic-graphs] OK: brackets mempty == "[]"
  19400. 1200.18 s [algebraic-graphs]
  19401. 1200.18 s [algebraic-graphs] ============ Export.doubleQuotes ============
  19402. 1200.18 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  19403. 1200.18 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  19404. 1200.18 s [algebraic-graphs]
  19405. 1200.18 s [algebraic-graphs] ============ Export.indent ============
  19406. 1200.18 s [algebraic-graphs] OK: indent 0 == id
  19407. 1200.18 s [algebraic-graphs] OK: indent 1 mempty == " "
  19408. 1200.18 s [algebraic-graphs]
  19409. 1200.18 s [algebraic-graphs] ============ Export.unlines ============
  19410. 1200.18 s [algebraic-graphs] OK: unlines [] == mempty
  19411. 1200.18 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  19412. 1200.18 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  19413. 1200.18 s [algebraic-graphs]
  19414. 1200.18 s [algebraic-graphs] ============ Export.export ============
  19415. 1200.18 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  19416. 1200.18 s [algebraic-graphs]
  19417. 1200.18 s [algebraic-graphs] ============ Export.Dot.export ============
  19418. 1200.18 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  19419. 1200.18 s [algebraic-graphs]
  19420. 1200.18 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  19421. 1200.18 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  19422. 1200.18 s [algebraic-graphs]
  19423. 1200.18 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  19424. 1200.18 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  19425. 1200.18 s [algebraic-graphs]
  19426. 1200.18 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  19427. 1200.18 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  19428. 1200.18 s [algebraic-graphs]
  19429. 1200.18 s [algebraic-graphs] ============ Graph ============
  19430. 1200.18 s [algebraic-graphs] OK: Axioms of graphs
  19431. 1200.18 s [algebraic-graphs] OK: Theorems of graphs
  19432. 1200.18 s [algebraic-graphs]
  19433. 1200.18 s [algebraic-graphs] ============ Graph.Ord ============
  19434. 1200.18 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19435. 1200.18 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19436. 1200.18 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19437. 1200.18 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19438. 1200.18 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19439. 1200.18 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19440. 1200.18 s [algebraic-graphs] OK: x <= x + y
  19441. 1200.18 s [algebraic-graphs] OK: x + y <= x * y
  19442. 1200.18 s [algebraic-graphs]
  19443. 1200.18 s [algebraic-graphs] ============ Graph.empty ============
  19444. 1200.18 s [algebraic-graphs] OK: isEmpty empty == True
  19445. 1200.18 s [algebraic-graphs] OK: hasVertex x empty == False
  19446. 1200.18 s [algebraic-graphs] OK: vertexCount empty == 0
  19447. 1200.18 s [algebraic-graphs] OK: edgeCount empty == 0
  19448. 1200.18 s [algebraic-graphs]
  19449. 1200.18 s [algebraic-graphs] ============ Graph.vertex ============
  19450. 1200.18 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19451. 1200.18 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19452. 1200.18 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19453. 1200.18 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19454. 1200.18 s [algebraic-graphs]
  19455. 1200.18 s [algebraic-graphs] ============ Graph.edge ============
  19456. 1200.18 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19457. 1200.18 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19458. 1200.18 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19459. 1200.18 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19460. 1200.18 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19461. 1200.18 s [algebraic-graphs]
  19462. 1200.18 s [algebraic-graphs] ============ Graph.overlay ============
  19463. 1200.18 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19464. 1200.18 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19465. 1200.18 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19466. 1200.18 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19467. 1200.18 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19468. 1200.18 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19469. 1200.18 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19470. 1200.18 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19471. 1200.18 s [algebraic-graphs]
  19472. 1200.18 s [algebraic-graphs] ============ Graph.connect ============
  19473. 1200.18 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  19474. 1200.18 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19475. 1200.18 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19476. 1200.19 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19477. 1200.19 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19478. 1200.19 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19479. 1200.19 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19480. 1200.19 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19481. 1200.19 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19482. 1200.19 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19483. 1200.19 s [algebraic-graphs]
  19484. 1200.19 s [algebraic-graphs] ============ Graph.vertices ============
  19485. 1200.19 s [algebraic-graphs] OK: vertices [] == empty
  19486. 1200.19 s [algebraic-graphs] OK: vertices [x] == vertex x
  19487. 1200.19 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19488. 1200.19 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19489. 1200.19 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19490. 1200.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19491. 1200.19 s [algebraic-graphs]
  19492. 1200.19 s [algebraic-graphs] ============ Graph.edges ============
  19493. 1200.19 s [algebraic-graphs] OK: edges [] == empty
  19494. 1200.19 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  19495. 1200.19 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  19496. 1200.19 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  19497. 1200.19 s [algebraic-graphs]
  19498. 1200.19 s [algebraic-graphs] ============ Graph.overlays ============
  19499. 1200.19 s [algebraic-graphs] OK: overlays [] == empty
  19500. 1200.19 s [algebraic-graphs] OK: overlays [x] == x
  19501. 1200.19 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19502. 1200.19 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19503. 1200.19 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19504. 1200.19 s [algebraic-graphs]
  19505. 1200.19 s [algebraic-graphs] ============ Graph.connects ============
  19506. 1200.19 s [algebraic-graphs] OK: connects [] == empty
  19507. 1200.19 s [algebraic-graphs] OK: connects [x] == x
  19508. 1200.19 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19509. 1200.19 s [algebraic-graphs] OK: connects == foldr connect empty
  19510. 1200.19 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19511. 1200.19 s [algebraic-graphs]
  19512. 1200.19 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  19513. 1200.19 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19514. 1200.19 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19515. 1200.19 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19516. 1200.19 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19517. 1200.19 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  19518. 1200.19 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19519. 1200.19 s [algebraic-graphs]
  19520. 1200.19 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  19521. 1200.19 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  19522. 1200.19 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  19523. 1200.19 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  19524. 1200.19 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  19525. 1200.19 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  19526. 1200.19 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  19527. 1200.19 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  19528. 1200.19 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  19529. 1200.19 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  19530. 1201.48 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  19531. 1201.48 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  19532. 1201.57 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  19533. 1201.57 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  19534. 1201.57 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  19535. 1201.57 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  19536. 1201.57 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  19537. 1201.57 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  19538. 1201.57 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  19539. 1201.57 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  19540. 1201.57 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  19541. 1201.57 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  19542. 1201.57 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  19543. 1201.57 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  19544. 1201.57 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  19545. 1201.57 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  19546. 1201.57 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  19547. 1201.57 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  19548. 1201.57 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  19549. 1201.57 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19550. 1201.57 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  19551. 1201.57 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  19552. 1201.57 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  19553. 1201.57 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  19554. 1201.57 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  19555. 1201.57 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19556. 1201.57 s [algebraic-graphs]
  19557. 1201.57 s [algebraic-graphs] ============ Graph.foldg ============
  19558. 1201.57 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  19559. 1201.57 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  19560. 1201.57 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  19561. 1201.57 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  19562. 1201.57 s [algebraic-graphs]
  19563. 1201.57 s [algebraic-graphs] ============ Graph.isEmpty ============
  19564. 1201.57 s [algebraic-graphs] OK: isEmpty empty == True
  19565. 1201.57 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19566. 1201.57 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19567. 1201.57 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19568. 1201.57 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  19569. 1201.57 s [algebraic-graphs]
  19570. 1201.57 s [algebraic-graphs] ============ Graph.hasVertex ============
  19571. 1201.57 s [algebraic-graphs] OK: hasVertex x empty == False
  19572. 1201.57 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19573. 1201.57 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19574. 1201.57 s [algebraic-graphs]
  19575. 1201.57 s [algebraic-graphs] ============ Graph.hasEdge ============
  19576. 1201.57 s [algebraic-graphs] OK: hasEdge x y empty == False
  19577. 1201.57 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19578. 1201.57 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19579. 1201.57 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19580. 1201.57 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19581. 1201.57 s [algebraic-graphs]
  19582. 1201.57 s [algebraic-graphs] ============ Graph.vertexCount ============
  19583. 1201.57 s [algebraic-graphs] OK: vertexCount empty == 0
  19584. 1201.57 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19585. 1201.57 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19586. 1201.57 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19587. 1201.57 s [algebraic-graphs]
  19588. 1201.57 s [algebraic-graphs] ============ Graph.edgeCount ============
  19589. 1201.57 s [algebraic-graphs] OK: edgeCount empty == 0
  19590. 1201.57 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19591. 1201.57 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19592. 1201.57 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19593. 1201.57 s [algebraic-graphs]
  19594. 1201.57 s [algebraic-graphs] ============ Graph.vertexList ============
  19595. 1201.57 s [algebraic-graphs] OK: vertexList empty == []
  19596. 1201.57 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19597. 1201.57 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19598. 1201.57 s [algebraic-graphs]
  19599. 1201.57 s [algebraic-graphs] ============ Graph.vertexSet ============
  19600. 1201.57 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19601. 1201.57 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19602. 1201.57 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19603. 1201.57 s [algebraic-graphs]
  19604. 1201.57 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  19605. 1201.57 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  19606. 1201.57 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  19607. 1201.57 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  19608. 1201.57 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  19609. 1201.57 s [algebraic-graphs]
  19610. 1201.57 s [algebraic-graphs] ============ Graph.edgeList ============
  19611. 1201.57 s [algebraic-graphs] OK: edgeList empty == []
  19612. 1201.57 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19613. 1201.57 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19614. 1201.57 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19615. 1201.57 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  19616. 1201.57 s [algebraic-graphs]
  19617. 1201.57 s [algebraic-graphs] ============ Graph.edgeSet ============
  19618. 1201.57 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19619. 1201.57 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19620. 1201.57 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19621. 1201.57 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  19622. 1201.57 s [algebraic-graphs]
  19623. 1201.57 s [algebraic-graphs] ============ Graph.adjacencyList ============
  19624. 1201.57 s [algebraic-graphs] OK: adjacencyList empty == []
  19625. 1201.57 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19626. 1201.57 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  19627. 1201.57 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  19628. 1201.57 s [algebraic-graphs]
  19629. 1201.57 s [algebraic-graphs] ============ Graph.preSet ============
  19630. 1201.57 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19631. 1201.57 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19632. 1201.57 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19633. 1201.57 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19634. 1201.57 s [algebraic-graphs]
  19635. 1201.57 s [algebraic-graphs] ============ Graph.preIntSet ============
  19636. 1201.57 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  19637. 1201.57 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  19638. 1201.57 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  19639. 1201.57 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  19640. 1201.57 s [algebraic-graphs]
  19641. 1201.57 s [algebraic-graphs] ============ Graph.postSet ============
  19642. 1201.57 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19643. 1201.57 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19644. 1201.57 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19645. 1201.57 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19646. 1201.57 s [algebraic-graphs]
  19647. 1201.57 s [algebraic-graphs] ============ Graph.postIntSet ============
  19648. 1201.57 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  19649. 1201.57 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  19650. 1201.57 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  19651. 1201.57 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  19652. 1201.57 s [algebraic-graphs]
  19653. 1201.57 s [algebraic-graphs] ============ Graph.size ============
  19654. 1201.57 s [algebraic-graphs] OK: size empty == 1
  19655. 1201.57 s [algebraic-graphs] OK: size (vertex x) == 1
  19656. 1201.58 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19657. 1201.58 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19658. 1201.58 s [algebraic-graphs] OK: size x >= 1
  19659. 1201.58 s [algebraic-graphs] OK: size x >= vertexCount x
  19660. 1201.58 s [algebraic-graphs]
  19661. 1201.58 s [algebraic-graphs] ============ Graph.path ============
  19662. 1201.58 s [algebraic-graphs] OK: path [] == empty
  19663. 1201.58 s [algebraic-graphs] OK: path [x] == vertex x
  19664. 1201.58 s [algebraic-graphs] OK: path [x,y] == edge x y
  19665. 1201.58 s [algebraic-graphs]
  19666. 1201.58 s [algebraic-graphs] ============ Graph.circuit ============
  19667. 1201.58 s [algebraic-graphs] OK: circuit [] == empty
  19668. 1201.58 s [algebraic-graphs] OK: circuit [x] == edge x x
  19669. 1201.58 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  19670. 1201.58 s [algebraic-graphs]
  19671. 1201.58 s [algebraic-graphs] ============ Graph.clique ============
  19672. 1201.58 s [algebraic-graphs] OK: clique [] == empty
  19673. 1201.58 s [algebraic-graphs] OK: clique [x] == vertex x
  19674. 1201.58 s [algebraic-graphs] OK: clique [x,y] == edge x y
  19675. 1201.58 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  19676. 1201.58 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  19677. 1201.58 s [algebraic-graphs]
  19678. 1201.58 s [algebraic-graphs] ============ Graph.biclique ============
  19679. 1201.58 s [algebraic-graphs] OK: biclique [] [] == empty
  19680. 1201.58 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  19681. 1201.58 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  19682. 1201.58 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19683. 1201.58 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  19684. 1201.58 s [algebraic-graphs]
  19685. 1201.58 s [algebraic-graphs] ============ Graph.star ============
  19686. 1201.58 s [algebraic-graphs] OK: star x [] == vertex x
  19687. 1201.58 s [algebraic-graphs] OK: star x [y] == edge x y
  19688. 1201.58 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19689. 1201.58 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  19690. 1201.58 s [algebraic-graphs]
  19691. 1201.58 s [algebraic-graphs] ============ Graph.stars ============
  19692. 1201.58 s [algebraic-graphs] OK: stars [] == empty
  19693. 1201.58 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  19694. 1201.58 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  19695. 1201.58 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  19696. 1201.58 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  19697. 1201.58 s [algebraic-graphs] OK: stars . adjacencyList == id
  19698. 1201.58 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  19699. 1201.58 s [algebraic-graphs]
  19700. 1201.58 s [algebraic-graphs] ============ Graph.tree ============
  19701. 1201.58 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19702. 1201.58 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  19703. 1201.58 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19704. 1201.58 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  19705. 1201.58 s [algebraic-graphs]
  19706. 1201.58 s [algebraic-graphs] ============ Graph.forest ============
  19707. 1201.58 s [algebraic-graphs] OK: forest [] == empty
  19708. 1201.58 s [algebraic-graphs] OK: forest [x] == tree x
  19709. 1201.58 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  19710. 1201.58 s [algebraic-graphs] OK: forest == overlays . map tree
  19711. 1201.58 s [algebraic-graphs]
  19712. 1201.58 s [algebraic-graphs] ============ Graph.removeVertex ============
  19713. 1206.71 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19714. 1206.71 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19715. 1206.71 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  19716. 1206.74 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  19717. 1206.74 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19718. 1206.74 s [algebraic-graphs]
  19719. 1206.74 s [algebraic-graphs] ============ Graph.removeEdge ============
  19720. 1206.74 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  19721. 1206.74 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19722. 1206.74 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19723. 1206.74 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19724. 1206.74 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19725. 1206.74 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  19726. 1206.74 s [algebraic-graphs]
  19727. 1206.74 s [algebraic-graphs] ============ Graph.replaceVertex ============
  19728. 1206.74 s [algebraic-graphs] OK: replaceVertex x x == id
  19729. 1206.74 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19730. 1206.74 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19731. 1206.74 s [algebraic-graphs]
  19732. 1206.74 s [algebraic-graphs] ============ Graph.mergeVertices ============
  19733. 1206.74 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19734. 1206.74 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19735. 1206.74 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19736. 1206.74 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19737. 1206.74 s [algebraic-graphs]
  19738. 1206.74 s [algebraic-graphs] ============ Graph.transpose ============
  19739. 1206.74 s [algebraic-graphs] OK: transpose empty == empty
  19740. 1206.74 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19741. 1206.74 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19742. 1206.74 s [algebraic-graphs] OK: transpose . transpose == id
  19743. 1206.74 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19744. 1206.74 s [algebraic-graphs]
  19745. 1206.74 s [algebraic-graphs] ============ Graph.gmap ============
  19746. 1206.74 s [algebraic-graphs] OK: gmap f empty == empty
  19747. 1206.74 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19748. 1206.74 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19749. 1206.74 s [algebraic-graphs] OK: gmap id == id
  19750. 1206.74 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19751. 1206.74 s [algebraic-graphs]
  19752. 1206.74 s [algebraic-graphs] ============ Graph.induce ============
  19753. 1206.74 s [algebraic-graphs] OK: induce (const True ) x == x
  19754. 1206.74 s [algebraic-graphs] OK: induce (const False) x == empty
  19755. 1206.74 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19756. 1206.74 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19757. 1206.74 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19758. 1206.74 s [algebraic-graphs]
  19759. 1206.74 s [algebraic-graphs] ============ Graph.induceJust ============
  19760. 1206.74 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19761. 1206.74 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19762. 1206.74 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19763. 1206.74 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19764. 1206.74 s [algebraic-graphs]
  19765. 1206.74 s [algebraic-graphs] ============ Graph.compose ============
  19766. 1206.74 s [algebraic-graphs] OK: compose empty x == empty
  19767. 1206.74 s [algebraic-graphs] OK: compose x empty == empty
  19768. 1206.74 s [algebraic-graphs] OK: compose (vertex x) y == empty
  19769. 1206.74 s [algebraic-graphs] OK: compose x (vertex y) == empty
  19770. 1206.74 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  19771. 1206.74 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  19772. 1206.74 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  19773. 1206.74 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  19774. 1206.74 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  19775. 1206.74 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  19776. 1206.74 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  19777. 1206.74 s [algebraic-graphs]
  19778. 1206.74 s [algebraic-graphs] ============ Graph.(===) ============
  19779. 1206.74 s [algebraic-graphs] OK: x === x == True
  19780. 1206.74 s [algebraic-graphs] OK: x === x + empty == False
  19781. 1206.74 s [algebraic-graphs] OK: x + y === x + y == True
  19782. 1206.74 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  19783. 1206.74 s [algebraic-graphs] OK: x + y === x * y == False
  19784. 1206.74 s [algebraic-graphs]
  19785. 1206.74 s [algebraic-graphs] ============ Graph.mesh ============
  19786. 1206.74 s [algebraic-graphs] OK: mesh xs [] == empty
  19787. 1206.74 s [algebraic-graphs] OK: mesh [] ys == empty
  19788. 1206.74 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  19789. 1206.74 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  19790. 1206.74 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  19791. 1206.74 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  19792. 1206.74 s [algebraic-graphs]
  19793. 1206.74 s [algebraic-graphs] ============ Graph.torus ============
  19794. 1206.74 s [algebraic-graphs] OK: torus xs [] == empty
  19795. 1206.74 s [algebraic-graphs] OK: torus [] ys == empty
  19796. 1206.74 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  19797. 1206.74 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  19798. 1206.75 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  19799. 1206.75 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  19800. 1206.75 s [algebraic-graphs]
  19801. 1206.75 s [algebraic-graphs] ============ Graph.deBruijn ============
  19802. 1206.75 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  19803. 1206.75 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  19804. 1206.75 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  19805. 1206.75 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  19806. 1206.75 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  19807. 1206.75 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  19808. 1206.75 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  19809. 1206.75 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  19810. 1206.75 s [algebraic-graphs]
  19811. 1206.75 s [algebraic-graphs] ============ Graph.splitVertex ============
  19812. 1206.75 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  19813. 1206.75 s [algebraic-graphs] OK: splitVertex x [x] == id
  19814. 1206.75 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  19815. 1206.75 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  19816. 1206.75 s [algebraic-graphs]
  19817. 1206.75 s [algebraic-graphs] ============ Graph.bind ============
  19818. 1206.75 s [algebraic-graphs] OK: bind empty f == empty
  19819. 1206.75 s [algebraic-graphs] OK: bind (vertex x) f == f x
  19820. 1206.75 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  19821. 1206.75 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  19822. 1206.75 s [algebraic-graphs] OK: bind x (const empty) == empty
  19823. 1206.75 s [algebraic-graphs] OK: bind x vertex == x
  19824. 1206.75 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  19825. 1206.75 s [algebraic-graphs]
  19826. 1206.75 s [algebraic-graphs] ============ Graph.simplify ============
  19827. 1206.75 s [algebraic-graphs] OK: simplify == id
  19828. 1206.75 s [algebraic-graphs] OK: size (simplify x) <= size x
  19829. 1206.75 s [algebraic-graphs]
  19830. 1206.75 s [algebraic-graphs] ============ Graph.box ============
  19831. 1206.75 s [algebraic-graphs] OK: box x y ~~ box y x
  19832. 1206.75 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  19833. 1206.75 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19834. 1206.75 s [algebraic-graphs] OK: box x empty ~~ empty
  19835. 1206.75 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19836. 1206.75 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19837. 1206.75 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19838. 1206.75 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19839. 1206.75 s [algebraic-graphs]
  19840. 1206.75 s [algebraic-graphs] ============ Graph.sparsify ============
  19841. 1206.75 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  19842. 1206.75 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  19843. 1206.75 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  19844. 1206.75 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  19845. 1206.75 s [algebraic-graphs]
  19846. 1206.75 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  19847. 1206.75 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  19848. 1206.75 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  19849. 1206.75 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  19850. 1206.75 s [algebraic-graphs]
  19851. 1206.75 s [algebraic-graphs] ============ Graph.context ============
  19852. 1206.75 s [algebraic-graphs] OK: context (const False) x == Nothing
  19853. 1206.75 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  19854. 1206.75 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  19855. 1206.75 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  19856. 1206.75 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  19857. 1206.75 s [algebraic-graphs]
  19858. 1206.75 s [algebraic-graphs] ============ Graph.buildg ============
  19859. 1206.75 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  19860. 1206.75 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  19861. 1206.75 s [algebraic-graphs] OK: buildg (\e v o c -> o (foldg e v o c x) (foldg e v o c y)) == overlay x y
  19862. 1206.75 s [algebraic-graphs] OK: buildg (\e v o c -> c (foldg e v o c x) (foldg e v o c y)) == connect x y
  19863. 1206.75 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  19864. 1206.75 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  19865. 1206.75 s [algebraic-graphs]
  19866. 1206.75 s [algebraic-graphs] ============ Internal.List ============
  19867. 1206.75 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  19868. 1206.75 s [algebraic-graphs]
  19869. 1206.75 s [algebraic-graphs] ============ Graph.Label ============
  19870. 1206.75 s [algebraic-graphs]
  19871. 1206.75 s [algebraic-graphs] ============ Any: instances ============
  19872. 1206.75 s [algebraic-graphs] OK: Semiring
  19873. 1206.75 s [algebraic-graphs] OK: StarSemiring
  19874. 1206.75 s [algebraic-graphs] OK: Dioid
  19875. 1206.75 s [algebraic-graphs]
  19876. 1206.75 s [algebraic-graphs] ============ Distance Int: instances ============
  19877. 1206.75 s [algebraic-graphs] OK: Semiring
  19878. 1206.75 s [algebraic-graphs] OK: StarSemiring
  19879. 1206.75 s [algebraic-graphs] OK: Dioid
  19880. 1206.75 s [algebraic-graphs]
  19881. 1206.75 s [algebraic-graphs] ============ Capacity Int: instances ============
  19882. 1206.75 s [algebraic-graphs] OK: Semiring
  19883. 1206.75 s [algebraic-graphs] OK: StarSemiring
  19884. 1206.75 s [algebraic-graphs] OK: Dioid
  19885. 1206.75 s [algebraic-graphs]
  19886. 1206.75 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  19887. 1206.75 s [algebraic-graphs] OK: LeftNearRing
  19888. 1206.75 s [algebraic-graphs]
  19889. 1206.75 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  19890. 1206.75 s [algebraic-graphs] OK: Semiring
  19891. 1206.75 s [algebraic-graphs] OK: Dioid
  19892. 1206.75 s [algebraic-graphs]
  19893. 1206.75 s [algebraic-graphs] ============ Count Int: instances ============
  19894. 1206.75 s [algebraic-graphs] OK: Semiring
  19895. 1206.75 s [algebraic-graphs] OK: StarSemiring
  19896. 1206.75 s [algebraic-graphs]
  19897. 1206.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  19898. 1206.75 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  19899. 1206.75 s [algebraic-graphs] OK: empty
  19900. 1206.75 s [algebraic-graphs] OK: vertex
  19901. 1206.75 s [algebraic-graphs] OK: edge
  19902. 1206.75 s [algebraic-graphs] OK: overlay
  19903. 1206.75 s [algebraic-graphs] OK: connect
  19904. 1206.75 s [algebraic-graphs] OK: vertices
  19905. 1206.75 s [algebraic-graphs] OK: edges
  19906. 1206.75 s [algebraic-graphs] OK: overlays
  19907. 1206.75 s [algebraic-graphs] OK: fromAdjacencyMaps
  19908. 1206.75 s [algebraic-graphs] OK: removeVertex
  19909. 1206.75 s [algebraic-graphs] OK: removeEdge
  19910. 1206.75 s [algebraic-graphs] OK: replaceVertex
  19911. 1206.75 s [algebraic-graphs] OK: replaceEdge
  19912. 1206.75 s [algebraic-graphs] OK: transpose
  19913. 1206.75 s [algebraic-graphs] OK: gmap
  19914. 1206.75 s [algebraic-graphs] OK: emap
  19915. 1206.75 s [algebraic-graphs] OK: induce
  19916. 1206.75 s [algebraic-graphs] OK: closure
  19917. 1206.75 s [algebraic-graphs] OK: reflexiveClosure
  19918. 1206.75 s [algebraic-graphs] OK: symmetricClosure
  19919. 1206.75 s [algebraic-graphs] OK: transitiveClosure
  19920. 1206.75 s [algebraic-graphs]
  19921. 1206.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  19922. 1206.75 s [algebraic-graphs] OK: isEmpty empty == True
  19923. 1206.75 s [algebraic-graphs] OK: hasVertex x empty == False
  19924. 1206.75 s [algebraic-graphs] OK: vertexCount empty == 0
  19925. 1206.75 s [algebraic-graphs] OK: edgeCount empty == 0
  19926. 1206.75 s [algebraic-graphs]
  19927. 1206.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  19928. 1206.75 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19929. 1206.75 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19930. 1206.75 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19931. 1206.75 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19932. 1206.75 s [algebraic-graphs]
  19933. 1209.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  19934. 1209.40 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19935. 1209.40 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19936. 1209.40 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19937. 1209.40 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19938. 1209.40 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19939. 1209.40 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19940. 1209.40 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19941. 1209.40 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19942. 1209.40 s [algebraic-graphs]
  19943. 1209.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  19944. 1209.40 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19945. 1209.40 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19946. 1209.40 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19947. 1209.40 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19948. 1209.40 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19949. 1209.40 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19950. 1209.40 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19951. 1209.40 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19952. 1209.40 s [algebraic-graphs]
  19953. 1209.40 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19954. 1209.40 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19955. 1209.40 s [algebraic-graphs]
  19956. 1209.40 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19957. 1209.40 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19958. 1209.40 s [algebraic-graphs]
  19959. 1209.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  19960. 1209.40 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19961. 1209.40 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19962. 1209.40 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19963. 1209.40 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19964. 1209.40 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19965. 1209.40 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19966. 1209.40 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19967. 1209.40 s [algebraic-graphs]
  19968. 1209.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  19969. 1209.40 s [algebraic-graphs] OK: vertices [] == empty
  19970. 1209.40 s [algebraic-graphs] OK: vertices [x] == vertex x
  19971. 1209.40 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19972. 1209.40 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19973. 1209.40 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19974. 1209.40 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19975. 1209.40 s [algebraic-graphs]
  19976. 1209.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  19977. 1209.40 s [algebraic-graphs] OK: edges [] == empty
  19978. 1209.40 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19979. 1209.40 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19980. 1209.40 s [algebraic-graphs]
  19981. 1209.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  19982. 1209.40 s [algebraic-graphs] OK: overlays [] == empty
  19983. 1209.40 s [algebraic-graphs] OK: overlays [x] == x
  19984. 1209.40 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19985. 1209.40 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19986. 1209.40 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19987. 1209.40 s [algebraic-graphs]
  19988. 1209.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  19989. 1209.40 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  19990. 1209.40 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  19991. 1209.40 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  19992. 1209.40 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  19993. 1209.40 s [algebraic-graphs]
  19994. 1209.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  19995. 1209.40 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19996. 1209.40 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19997. 1209.40 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19998. 1209.40 s [algebraic-graphs]
  19999. 1209.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  20000. 1209.40 s [algebraic-graphs] OK: isEmpty empty == True
  20001. 1209.40 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20002. 1209.40 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20003. 1209.40 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20004. 1209.40 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  20005. 1209.40 s [algebraic-graphs]
  20006. 1209.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  20007. 1209.41 s [algebraic-graphs] OK: hasVertex x empty == False
  20008. 1209.41 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20009. 1209.41 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20010. 1209.41 s [algebraic-graphs]
  20011. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  20012. 1209.41 s [algebraic-graphs] OK: hasEdge x y empty == False
  20013. 1209.41 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20014. 1209.41 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  20015. 1209.41 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20016. 1209.41 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  20017. 1209.41 s [algebraic-graphs]
  20018. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  20019. 1209.41 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  20020. 1209.41 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  20021. 1209.41 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  20022. 1209.41 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  20023. 1209.41 s [algebraic-graphs]
  20024. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  20025. 1209.41 s [algebraic-graphs] OK: vertexCount empty == 0
  20026. 1209.41 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20027. 1209.41 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20028. 1209.41 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20029. 1209.41 s [algebraic-graphs]
  20030. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  20031. 1209.41 s [algebraic-graphs] OK: edgeCount empty == 0
  20032. 1209.41 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20033. 1209.41 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  20034. 1209.41 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20035. 1209.41 s [algebraic-graphs]
  20036. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  20037. 1209.41 s [algebraic-graphs] OK: vertexList empty == []
  20038. 1209.41 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20039. 1209.41 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20040. 1209.41 s [algebraic-graphs]
  20041. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  20042. 1209.41 s [algebraic-graphs] OK: edgeList empty == []
  20043. 1209.41 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20044. 1209.41 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  20045. 1209.41 s [algebraic-graphs]
  20046. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  20047. 1209.41 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20048. 1209.41 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20049. 1209.41 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20050. 1209.41 s [algebraic-graphs]
  20051. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  20052. 1209.41 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20053. 1209.41 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20054. 1209.41 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  20055. 1209.41 s [algebraic-graphs]
  20056. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  20057. 1209.41 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20058. 1209.41 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20059. 1209.41 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  20060. 1209.41 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  20061. 1209.41 s [algebraic-graphs]
  20062. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  20063. 1209.41 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20064. 1209.41 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20065. 1209.41 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  20066. 1209.41 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  20067. 1209.41 s [algebraic-graphs]
  20068. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  20069. 1209.41 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  20070. 1209.41 s [algebraic-graphs]
  20071. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  20072. 1209.41 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20073. 1209.41 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20074. 1209.41 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  20075. 1209.41 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  20076. 1209.41 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20077. 1209.41 s [algebraic-graphs]
  20078. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  20079. 1209.41 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  20080. 1209.41 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20081. 1209.41 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20082. 1209.41 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20083. 1209.41 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20084. 1209.41 s [algebraic-graphs]
  20085. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  20086. 1209.41 s [algebraic-graphs] OK: replaceVertex x x == id
  20087. 1209.41 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20088. 1209.41 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  20089. 1209.41 s [algebraic-graphs]
  20090. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  20091. 1209.41 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  20092. 1209.41 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  20093. 1209.41 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  20094. 1209.41 s [algebraic-graphs]
  20095. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  20096. 1209.41 s [algebraic-graphs] OK: transpose empty == empty
  20097. 1209.41 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20098. 1209.41 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  20099. 1209.41 s [algebraic-graphs] OK: transpose . transpose == id
  20100. 1209.41 s [algebraic-graphs]
  20101. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  20102. 1209.41 s [algebraic-graphs] OK: gmap f empty == empty
  20103. 1209.41 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20104. 1209.41 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  20105. 1209.41 s [algebraic-graphs] OK: gmap id == id
  20106. 1209.41 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20107. 1209.41 s [algebraic-graphs]
  20108. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  20109. 1209.41 s [algebraic-graphs] OK: emap h empty == empty
  20110. 1209.41 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  20111. 1209.41 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  20112. 1209.41 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  20113. 1209.41 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  20114. 1209.41 s [algebraic-graphs] OK: emap id == id
  20115. 1209.41 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  20116. 1209.41 s [algebraic-graphs]
  20117. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  20118. 1209.41 s [algebraic-graphs] OK: induce (const True ) x == x
  20119. 1209.41 s [algebraic-graphs] OK: induce (const False) x == empty
  20120. 1209.41 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20121. 1209.41 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20122. 1209.41 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20123. 1209.41 s [algebraic-graphs]
  20124. 1209.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  20125. 1210.71 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20126. 1210.71 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20127. 1210.71 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20128. 1210.71 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20129. 1210.71 s [algebraic-graphs]
  20130. 1210.71 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  20131. 1210.71 s [algebraic-graphs] OK: closure empty == empty
  20132. 1210.71 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  20133. 1210.71 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  20134. 1210.71 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  20135. 1210.71 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20136. 1210.71 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20137. 1210.71 s [algebraic-graphs] OK: closure . closure == closure
  20138. 1210.71 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20139. 1210.71 s [algebraic-graphs]
  20140. 1210.71 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  20141. 1210.71 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20142. 1210.71 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  20143. 1210.71 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  20144. 1210.71 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  20145. 1210.71 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20146. 1210.71 s [algebraic-graphs]
  20147. 1210.71 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  20148. 1210.71 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20149. 1210.71 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20150. 1210.71 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  20151. 1210.71 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20152. 1210.71 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20153. 1210.71 s [algebraic-graphs]
  20154. 1210.72 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  20155. 1210.72 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20156. 1210.72 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20157. 1210.72 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  20158. 1210.72 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20159. 1210.72 s [algebraic-graphs]
  20160. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  20161. 1210.72 s [algebraic-graphs] OK: isEmpty empty == True
  20162. 1210.72 s [algebraic-graphs] OK: hasVertex x empty == False
  20163. 1210.72 s [algebraic-graphs] OK: vertexCount empty == 0
  20164. 1210.72 s [algebraic-graphs] OK: edgeCount empty == 0
  20165. 1210.72 s [algebraic-graphs]
  20166. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  20167. 1210.72 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20168. 1210.72 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20169. 1210.72 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20170. 1210.72 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20171. 1210.72 s [algebraic-graphs]
  20172. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  20173. 1210.72 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  20174. 1210.72 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  20175. 1210.72 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  20176. 1210.72 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  20177. 1210.72 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  20178. 1210.72 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  20179. 1210.72 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  20180. 1210.72 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  20181. 1210.72 s [algebraic-graphs]
  20182. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  20183. 1210.72 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20184. 1210.72 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20185. 1210.72 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20186. 1210.72 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20187. 1210.72 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20188. 1210.72 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20189. 1210.72 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20190. 1210.72 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20191. 1210.72 s [algebraic-graphs]
  20192. 1210.72 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  20193. 1210.72 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  20194. 1210.72 s [algebraic-graphs]
  20195. 1210.72 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  20196. 1210.72 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  20197. 1210.72 s [algebraic-graphs]
  20198. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  20199. 1210.72 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  20200. 1210.72 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  20201. 1210.72 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  20202. 1210.72 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  20203. 1210.72 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20204. 1210.72 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  20205. 1210.72 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  20206. 1210.72 s [algebraic-graphs]
  20207. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  20208. 1210.72 s [algebraic-graphs] OK: vertices [] == empty
  20209. 1210.72 s [algebraic-graphs] OK: vertices [x] == vertex x
  20210. 1210.72 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20211. 1210.72 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20212. 1210.72 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20213. 1210.72 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20214. 1210.72 s [algebraic-graphs]
  20215. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  20216. 1210.72 s [algebraic-graphs] OK: edges [] == empty
  20217. 1210.72 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  20218. 1210.72 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  20219. 1210.72 s [algebraic-graphs]
  20220. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  20221. 1210.72 s [algebraic-graphs] OK: overlays [] == empty
  20222. 1210.72 s [algebraic-graphs] OK: overlays [x] == x
  20223. 1210.72 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20224. 1210.72 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20225. 1210.72 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20226. 1210.72 s [algebraic-graphs]
  20227. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  20228. 1210.72 s [algebraic-graphs] OK: foldg empty vertex connect == id
  20229. 1210.72 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  20230. 1210.72 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  20231. 1210.72 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  20232. 1210.72 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  20233. 1210.72 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  20234. 1210.72 s [algebraic-graphs]
  20235. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  20236. 1210.72 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  20237. 1210.72 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  20238. 1210.72 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  20239. 1210.72 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  20240. 1210.72 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  20241. 1210.72 s [algebraic-graphs]
  20242. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  20243. 1210.72 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20244. 1210.72 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20245. 1210.72 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20246. 1210.72 s [algebraic-graphs]
  20247. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  20248. 1210.72 s [algebraic-graphs] OK: isEmpty empty == True
  20249. 1210.72 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20250. 1210.72 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20251. 1210.72 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20252. 1210.72 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  20253. 1210.72 s [algebraic-graphs]
  20254. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.size ============
  20255. 1210.72 s [algebraic-graphs] OK: size empty == 1
  20256. 1210.72 s [algebraic-graphs] OK: size (vertex x) == 1
  20257. 1210.72 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20258. 1210.72 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20259. 1210.72 s [algebraic-graphs] OK: size x >= 1
  20260. 1210.72 s [algebraic-graphs] OK: size x >= vertexCount x
  20261. 1210.72 s [algebraic-graphs]
  20262. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  20263. 1210.72 s [algebraic-graphs] OK: hasVertex x empty == False
  20264. 1210.72 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20265. 1210.72 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20266. 1210.72 s [algebraic-graphs]
  20267. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  20268. 1210.72 s [algebraic-graphs] OK: hasEdge x y empty == False
  20269. 1210.72 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20270. 1210.72 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  20271. 1210.72 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20272. 1210.72 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  20273. 1210.72 s [algebraic-graphs]
  20274. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  20275. 1210.72 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  20276. 1210.72 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  20277. 1210.72 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  20278. 1210.72 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  20279. 1210.72 s [algebraic-graphs]
  20280. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  20281. 1210.72 s [algebraic-graphs] OK: vertexCount empty == 0
  20282. 1210.72 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20283. 1210.72 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20284. 1210.72 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20285. 1210.72 s [algebraic-graphs]
  20286. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  20287. 1210.72 s [algebraic-graphs] OK: edgeCount empty == 0
  20288. 1210.72 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20289. 1210.72 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  20290. 1210.72 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20291. 1210.72 s [algebraic-graphs]
  20292. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  20293. 1210.72 s [algebraic-graphs] OK: vertexList empty == []
  20294. 1210.72 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20295. 1210.72 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20296. 1210.72 s [algebraic-graphs]
  20297. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  20298. 1210.72 s [algebraic-graphs] OK: edgeList empty == []
  20299. 1210.72 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20300. 1210.72 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  20301. 1210.72 s [algebraic-graphs]
  20302. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  20303. 1210.72 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20304. 1210.72 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20305. 1210.72 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20306. 1210.72 s [algebraic-graphs]
  20307. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  20308. 1210.72 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20309. 1210.72 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20310. 1210.72 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  20311. 1210.72 s [algebraic-graphs]
  20312. 1210.72 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  20313. 1210.72 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20314. 1210.72 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20315. 1214.49 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  20316. 1214.63 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  20317. 1214.63 s [algebraic-graphs]
  20318. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  20319. 1214.63 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20320. 1214.63 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20321. 1214.63 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  20322. 1214.63 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  20323. 1214.63 s [algebraic-graphs]
  20324. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  20325. 1214.63 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20326. 1214.63 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20327. 1214.63 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  20328. 1214.63 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  20329. 1214.63 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20330. 1214.63 s [algebraic-graphs]
  20331. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  20332. 1214.63 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  20333. 1214.63 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20334. 1214.63 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20335. 1214.63 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20336. 1214.63 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20337. 1214.63 s [algebraic-graphs]
  20338. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  20339. 1214.63 s [algebraic-graphs] OK: replaceVertex x x == id
  20340. 1214.63 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20341. 1214.63 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  20342. 1214.63 s [algebraic-graphs]
  20343. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  20344. 1214.63 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  20345. 1214.63 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  20346. 1214.63 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  20347. 1214.63 s [algebraic-graphs]
  20348. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  20349. 1214.63 s [algebraic-graphs] OK: transpose empty == empty
  20350. 1214.63 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20351. 1214.63 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  20352. 1214.63 s [algebraic-graphs] OK: transpose . transpose == id
  20353. 1214.63 s [algebraic-graphs]
  20354. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  20355. 1214.63 s [algebraic-graphs] OK: fmap f empty == empty
  20356. 1214.63 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  20357. 1214.63 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  20358. 1214.63 s [algebraic-graphs] OK: fmap id == id
  20359. 1214.63 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  20360. 1214.63 s [algebraic-graphs]
  20361. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  20362. 1214.63 s [algebraic-graphs] OK: emap h empty == empty
  20363. 1214.63 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  20364. 1214.63 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  20365. 1214.63 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  20366. 1214.63 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  20367. 1214.63 s [algebraic-graphs] OK: emap id == id
  20368. 1214.63 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  20369. 1214.63 s [algebraic-graphs]
  20370. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  20371. 1214.63 s [algebraic-graphs] OK: induce (const True ) x == x
  20372. 1214.63 s [algebraic-graphs] OK: induce (const False) x == empty
  20373. 1214.63 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20374. 1214.63 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20375. 1214.63 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20376. 1214.63 s [algebraic-graphs]
  20377. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  20378. 1214.63 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20379. 1214.63 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20380. 1214.63 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20381. 1214.63 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20382. 1214.63 s [algebraic-graphs]
  20383. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  20384. 1214.63 s [algebraic-graphs] OK: closure empty == empty
  20385. 1214.63 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  20386. 1214.63 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  20387. 1214.63 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  20388. 1214.63 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20389. 1214.63 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20390. 1214.63 s [algebraic-graphs] OK: closure . closure == closure
  20391. 1214.63 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20392. 1214.63 s [algebraic-graphs]
  20393. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  20394. 1214.63 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20395. 1214.63 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  20396. 1214.63 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  20397. 1214.63 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  20398. 1214.63 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20399. 1214.63 s [algebraic-graphs]
  20400. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  20401. 1214.63 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20402. 1214.63 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20403. 1214.63 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  20404. 1214.63 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20405. 1214.63 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20406. 1214.63 s [algebraic-graphs]
  20407. 1214.63 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  20408. 1214.63 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20409. 1214.64 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20410. 1214.64 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  20411. 1214.64 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20412. 1214.64 s [algebraic-graphs]
  20413. 1214.64 s [algebraic-graphs] ============ Labelled.Graph.context ============
  20414. 1214.64 s [algebraic-graphs] OK: context (const False) x == Nothing
  20415. 1214.64 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  20416. 1214.64 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  20417. 1214.64 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  20418. 1214.64 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  20419. 1214.64 s [algebraic-graphs]
  20420. 1214.64 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  20421. 1214.64 s [algebraic-graphs] OK: Axioms of non-empty graphs
  20422. 1214.64 s [algebraic-graphs] OK: Theorems of non-empty graphs
  20423. 1214.64 s [algebraic-graphs]
  20424. 1214.64 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  20425. 1214.64 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20426. 1214.64 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20427. 1214.64 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20428. 1214.64 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20429. 1214.64 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20430. 1214.64 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20431. 1214.64 s [algebraic-graphs] OK: x <= x + y
  20432. 1214.64 s [algebraic-graphs] OK: x + y <= x * y
  20433. 1214.64 s [algebraic-graphs]
  20434. 1214.64 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  20435. 1214.64 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  20436. 1214.64 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  20437. 1214.64 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  20438. 1214.64 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  20439. 1214.64 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  20440. 1214.64 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  20441. 1214.64 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  20442. 1214.64 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  20443. 1214.64 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  20444. 1214.64 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  20445. 1214.64 s [algebraic-graphs]
  20446. 1214.64 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  20447. 1214.64 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  20448. 1214.64 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  20449. 1214.64 s [algebraic-graphs]
  20450. 1214.64 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  20451. 1214.64 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  20452. 1214.64 s [algebraic-graphs]
  20453. 1214.64 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  20454. 1214.64 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20455. 1214.64 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20456. 1214.64 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20457. 1214.64 s [algebraic-graphs]
  20458. 1214.64 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  20459. 1214.64 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20460. 1214.64 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20461. 1214.64 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20462. 1214.64 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20463. 1214.64 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20464. 1214.64 s [algebraic-graphs]
  20465. 1214.64 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  20466. 1214.64 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20467. 1214.64 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20468. 1214.64 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20469. 1214.64 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20470. 1214.64 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20471. 1214.64 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20472. 1214.64 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20473. 1214.64 s [algebraic-graphs]
  20474. 1214.64 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  20475. 1214.64 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20476. 1214.64 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20477. 1214.64 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20478. 1214.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20479. 1214.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20480. 1214.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20481. 1214.64 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20482. 1214.64 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20483. 1214.64 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20484. 1214.64 s [algebraic-graphs]
  20485. 1214.64 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  20486. 1214.64 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  20487. 1214.64 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  20488. 1214.64 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  20489. 1214.64 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20490. 1214.64 s [algebraic-graphs]
  20491. 1214.64 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  20492. 1214.64 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  20493. 1214.64 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  20494. 1214.64 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  20495. 1214.64 s [algebraic-graphs]
  20496. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  20497. 1218.92 s [algebraic-graphs] OK: overlays1 [x] == x
  20498. 1218.92 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  20499. 1218.92 s [algebraic-graphs]
  20500. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  20501. 1218.92 s [algebraic-graphs] OK: connects1 [x] == x
  20502. 1218.92 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  20503. 1218.92 s [algebraic-graphs]
  20504. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  20505. 1218.92 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20506. 1218.92 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20507. 1218.92 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  20508. 1218.92 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20509. 1218.92 s [algebraic-graphs]
  20510. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  20511. 1218.92 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20512. 1218.92 s [algebraic-graphs]
  20513. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  20514. 1218.92 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20515. 1218.92 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20516. 1218.92 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20517. 1218.92 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20518. 1218.92 s [algebraic-graphs]
  20519. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  20520. 1218.92 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20521. 1218.92 s [algebraic-graphs] OK: vertexCount x >= 1
  20522. 1218.92 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  20523. 1218.92 s [algebraic-graphs]
  20524. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  20525. 1218.92 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20526. 1218.92 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20527. 1218.92 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20528. 1218.92 s [algebraic-graphs]
  20529. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  20530. 1218.92 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  20531. 1218.92 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  20532. 1218.92 s [algebraic-graphs]
  20533. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  20534. 1218.92 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20535. 1218.92 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20536. 1218.92 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20537. 1218.92 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  20538. 1218.92 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20539. 1218.92 s [algebraic-graphs]
  20540. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  20541. 1218.92 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20542. 1218.92 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20543. 1218.92 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  20544. 1218.92 s [algebraic-graphs]
  20545. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  20546. 1218.92 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20547. 1218.92 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20548. 1218.92 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  20549. 1218.92 s [algebraic-graphs]
  20550. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  20551. 1218.92 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20552. 1218.92 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20553. 1218.92 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20554. 1218.92 s [algebraic-graphs]
  20555. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  20556. 1218.92 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20557. 1218.92 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20558. 1218.92 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20559. 1218.92 s [algebraic-graphs]
  20560. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  20561. 1218.92 s [algebraic-graphs] OK: path1 [x] == vertex x
  20562. 1218.92 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  20563. 1218.92 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  20564. 1218.92 s [algebraic-graphs]
  20565. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  20566. 1218.92 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  20567. 1218.92 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  20568. 1218.92 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  20569. 1218.92 s [algebraic-graphs]
  20570. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  20571. 1218.92 s [algebraic-graphs] OK: clique1 [x] == vertex x
  20572. 1218.92 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  20573. 1218.92 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  20574. 1218.92 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  20575. 1218.92 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  20576. 1218.92 s [algebraic-graphs]
  20577. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  20578. 1218.92 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20579. 1218.92 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  20580. 1218.92 s [algebraic-graphs]
  20581. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  20582. 1218.92 s [algebraic-graphs] OK: star x [] == vertex x
  20583. 1218.92 s [algebraic-graphs] OK: star x [y] == edge x y
  20584. 1218.92 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  20585. 1218.92 s [algebraic-graphs]
  20586. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  20587. 1218.92 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20588. 1218.92 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20589. 1218.92 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20590. 1218.92 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20591. 1218.92 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20592. 1218.92 s [algebraic-graphs]
  20593. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  20594. 1218.92 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20595. 1218.92 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20596. 1218.92 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20597. 1218.92 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20598. 1218.92 s [algebraic-graphs]
  20599. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  20600. 1218.92 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20601. 1218.92 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20602. 1218.92 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20603. 1218.92 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20604. 1218.92 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20605. 1218.92 s [algebraic-graphs]
  20606. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  20607. 1218.92 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20608. 1218.92 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20609. 1218.92 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20610. 1218.92 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20611. 1218.92 s [algebraic-graphs]
  20612. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  20613. 1218.92 s [algebraic-graphs] OK: replaceVertex x x == id
  20614. 1218.92 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20615. 1218.92 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20616. 1218.92 s [algebraic-graphs]
  20617. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  20618. 1218.92 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20619. 1218.92 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20620. 1218.92 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20621. 1218.92 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20622. 1218.92 s [algebraic-graphs]
  20623. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  20624. 1218.92 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20625. 1218.92 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20626. 1218.92 s [algebraic-graphs] OK: transpose . transpose == id
  20627. 1218.92 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20628. 1218.92 s [algebraic-graphs]
  20629. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  20630. 1218.92 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20631. 1218.92 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20632. 1218.92 s [algebraic-graphs] OK: gmap id == id
  20633. 1218.92 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20634. 1218.92 s [algebraic-graphs]
  20635. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  20636. 1218.92 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20637. 1218.92 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20638. 1218.92 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20639. 1218.92 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20640. 1218.92 s [algebraic-graphs]
  20641. 1218.92 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  20642. 1218.92 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20643. 1218.92 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20644. 1218.92 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  20645. 1218.92 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  20646. 1218.92 s [algebraic-graphs]
  20647. 1218.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  20648. 1218.93 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20649. 1218.93 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20650. 1218.93 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  20651. 1218.93 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  20652. 1218.93 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20653. 1218.93 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20654. 1218.93 s [algebraic-graphs] OK: closure . closure == closure
  20655. 1218.93 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20656. 1218.93 s [algebraic-graphs]
  20657. 1218.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  20658. 1218.93 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20659. 1218.93 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20660. 1218.93 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  20661. 1218.93 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20662. 1218.93 s [algebraic-graphs]
  20663. 1218.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  20664. 1218.93 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20665. 1218.93 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  20666. 1218.93 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20667. 1218.93 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20668. 1218.93 s [algebraic-graphs]
  20669. 1218.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  20670. 1218.93 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20671. 1218.93 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20672. 1218.93 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  20673. 1218.93 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20674. 1218.93 s [algebraic-graphs]
  20675. 1218.93 s [algebraic-graphs] ============ NonEmpty.Graph.============
  20676. 1218.93 s [algebraic-graphs] OK: Axioms of non-empty graphs
  20677. 1218.93 s [algebraic-graphs] OK: Theorems of non-empty graphs
  20678. 1218.93 s [algebraic-graphs]
  20679. 1218.93 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  20680. 1218.93 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20681. 1218.93 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20682. 1218.93 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20683. 1218.93 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20684. 1218.93 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20685. 1218.93 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20686. 1218.93 s [algebraic-graphs] OK: x <= x + y
  20687. 1218.93 s [algebraic-graphs] OK: x + y <= x * y
  20688. 1218.93 s [algebraic-graphs]
  20689. 1218.93 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  20690. 1218.93 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  20691. 1218.93 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  20692. 1218.93 s [algebraic-graphs] OK: fmap id == id
  20693. 1218.93 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  20694. 1218.93 s [algebraic-graphs]
  20695. 1218.93 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  20696. 1218.93 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  20697. 1222.24 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  20698. 1222.24 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  20699. 1222.36 s [algebraic-graphs] OK: (x >>= vertex) == x
  20700. 1222.36 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  20701. 1222.36 s [algebraic-graphs]
  20702. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  20703. 1222.36 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  20704. 1222.36 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  20705. 1222.36 s [algebraic-graphs]
  20706. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  20707. 1222.36 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20708. 1222.36 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20709. 1222.36 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20710. 1222.36 s [algebraic-graphs] OK: size (vertex x) == 1
  20711. 1222.36 s [algebraic-graphs]
  20712. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  20713. 1222.36 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20714. 1222.36 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20715. 1222.36 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20716. 1222.36 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20717. 1222.36 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20718. 1222.36 s [algebraic-graphs]
  20719. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  20720. 1222.36 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20721. 1222.36 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20722. 1222.36 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20723. 1222.36 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20724. 1222.36 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20725. 1222.36 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20726. 1222.36 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20727. 1222.36 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20728. 1222.36 s [algebraic-graphs]
  20729. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  20730. 1222.36 s [algebraic-graphs] OK: overlay1 empty x == x
  20731. 1222.36 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  20732. 1222.36 s [algebraic-graphs]
  20733. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  20734. 1222.36 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20735. 1222.36 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20736. 1222.36 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20737. 1222.36 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20738. 1222.36 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20739. 1222.36 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20740. 1222.36 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20741. 1222.36 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20742. 1222.36 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20743. 1222.36 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20744. 1222.36 s [algebraic-graphs]
  20745. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  20746. 1222.36 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  20747. 1222.36 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  20748. 1222.36 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  20749. 1222.36 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20750. 1222.36 s [algebraic-graphs]
  20751. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  20752. 1222.36 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  20753. 1222.36 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  20754. 1222.36 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  20755. 1222.36 s [algebraic-graphs]
  20756. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  20757. 1222.36 s [algebraic-graphs] OK: overlays1 [x] == x
  20758. 1222.36 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  20759. 1222.36 s [algebraic-graphs]
  20760. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  20761. 1222.36 s [algebraic-graphs] OK: connects1 [x] == x
  20762. 1222.36 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  20763. 1222.36 s [algebraic-graphs]
  20764. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  20765. 1222.36 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  20766. 1222.36 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  20767. 1222.36 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  20768. 1222.36 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  20769. 1222.36 s [algebraic-graphs]
  20770. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  20771. 1222.36 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20772. 1222.36 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20773. 1222.36 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  20774. 1222.36 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20775. 1222.36 s [algebraic-graphs]
  20776. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  20777. 1222.36 s [algebraic-graphs] OK: x === x == True
  20778. 1222.36 s [algebraic-graphs] OK: x + y === x + y == True
  20779. 1222.36 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  20780. 1222.36 s [algebraic-graphs] OK: x + y === x * y == False
  20781. 1222.36 s [algebraic-graphs]
  20782. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  20783. 1222.36 s [algebraic-graphs] OK: size (vertex x) == 1
  20784. 1222.36 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20785. 1222.36 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20786. 1222.36 s [algebraic-graphs] OK: size x >= 1
  20787. 1222.36 s [algebraic-graphs] OK: size x >= vertexCount x
  20788. 1222.36 s [algebraic-graphs]
  20789. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  20790. 1222.36 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20791. 1222.36 s [algebraic-graphs]
  20792. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  20793. 1222.36 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20794. 1222.36 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20795. 1222.36 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20796. 1222.36 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20797. 1222.36 s [algebraic-graphs]
  20798. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  20799. 1222.36 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20800. 1222.36 s [algebraic-graphs] OK: vertexCount x >= 1
  20801. 1222.36 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  20802. 1222.36 s [algebraic-graphs]
  20803. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  20804. 1222.36 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20805. 1222.36 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20806. 1222.36 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20807. 1222.36 s [algebraic-graphs]
  20808. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  20809. 1222.36 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  20810. 1222.36 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  20811. 1222.36 s [algebraic-graphs]
  20812. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  20813. 1222.36 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20814. 1222.36 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20815. 1222.36 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20816. 1222.36 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  20817. 1222.36 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20818. 1222.36 s [algebraic-graphs]
  20819. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  20820. 1222.36 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20821. 1222.36 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20822. 1222.36 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  20823. 1222.36 s [algebraic-graphs]
  20824. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  20825. 1222.36 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20826. 1222.36 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20827. 1222.36 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  20828. 1222.36 s [algebraic-graphs]
  20829. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  20830. 1222.36 s [algebraic-graphs] OK: path1 [x] == vertex x
  20831. 1222.36 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  20832. 1222.36 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  20833. 1222.36 s [algebraic-graphs]
  20834. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  20835. 1222.36 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  20836. 1222.36 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  20837. 1222.36 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  20838. 1222.36 s [algebraic-graphs]
  20839. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  20840. 1222.36 s [algebraic-graphs] OK: clique1 [x] == vertex x
  20841. 1222.36 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  20842. 1222.36 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  20843. 1222.36 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  20844. 1222.36 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  20845. 1222.36 s [algebraic-graphs]
  20846. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  20847. 1222.36 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20848. 1222.36 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  20849. 1222.36 s [algebraic-graphs]
  20850. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  20851. 1222.36 s [algebraic-graphs] OK: star x [] == vertex x
  20852. 1222.36 s [algebraic-graphs] OK: star x [y] == edge x y
  20853. 1222.36 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  20854. 1222.36 s [algebraic-graphs]
  20855. 1222.36 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  20856. 1222.36 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20857. 1222.37 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20858. 1222.37 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20859. 1222.37 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20860. 1222.37 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20861. 1222.37 s [algebraic-graphs]
  20862. 1222.37 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  20863. 1222.37 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20864. 1222.37 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20865. 1222.37 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20866. 1222.37 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20867. 1222.37 s [algebraic-graphs]
  20868. 1222.37 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  20869. 1222.37 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  20870. 1222.37 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  20871. 1222.37 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  20872. 1222.37 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  20873. 1222.37 s [algebraic-graphs]
  20874. 1222.37 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  20875. 1222.37 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  20876. 1222.37 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  20877. 1222.37 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  20878. 1222.37 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  20879. 1222.37 s [algebraic-graphs]
  20880. 1222.37 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  20881. 1222.37 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20882. 1222.37 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20883. 1222.37 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20884. 1222.37 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20885. 1222.37 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20886. 1222.37 s [algebraic-graphs]
  20887. 1222.37 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  20888. 1222.37 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20889. 1222.37 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20890. 1222.37 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20891. 1222.37 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20892. 1222.37 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  20893. 1222.37 s [algebraic-graphs]
  20894. 1222.37 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  20895. 1222.37 s [algebraic-graphs] OK: replaceVertex x x == id
  20896. 1222.37 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20897. 1222.37 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20898. 1222.37 s [algebraic-graphs]
  20899. 1222.37 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  20900. 1222.37 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20901. 1234.40 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20902. 1234.40 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20903. 1234.44 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20904. 1234.44 s [algebraic-graphs]
  20905. 1234.44 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  20906. 1234.44 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  20907. 1234.44 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  20908. 1234.44 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  20909. 1234.44 s [algebraic-graphs]
  20910. 1234.44 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  20911. 1234.44 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20912. 1234.44 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20913. 1234.44 s [algebraic-graphs] OK: transpose . transpose == id
  20914. 1234.44 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20915. 1234.44 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20916. 1234.44 s [algebraic-graphs]
  20917. 1234.44 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  20918. 1234.44 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20919. 1234.44 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20920. 1234.44 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20921. 1234.44 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20922. 1234.44 s [algebraic-graphs]
  20923. 1234.44 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  20924. 1234.44 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20925. 1234.44 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20926. 1234.44 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  20927. 1234.44 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  20928. 1234.44 s [algebraic-graphs]
  20929. 1234.44 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  20930. 1234.44 s [algebraic-graphs] OK: simplify == id
  20931. 1234.44 s [algebraic-graphs] OK: size (simplify x) <= size x
  20932. 1234.44 s [algebraic-graphs] OK: simplify 1 === 1
  20933. 1234.44 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  20934. 1234.44 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  20935. 1234.44 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  20936. 1234.44 s [algebraic-graphs]
  20937. 1234.44 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  20938. 1234.44 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  20939. 1234.44 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  20940. 1234.44 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  20941. 1234.44 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  20942. 1234.44 s [algebraic-graphs]
  20943. 1234.44 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  20944. 1234.44 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  20945. 1234.44 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  20946. 1234.44 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  20947. 1234.44 s [algebraic-graphs]
  20948. 1234.44 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  20949. 1234.44 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  20950. 1234.44 s [algebraic-graphs] OK: box x y ~~ box y x
  20951. 1234.44 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20952. 1234.44 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20953. 1234.44 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20954. 1234.44 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20955. 1234.44 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20956. 1234.44 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20957. 1234.44 s [algebraic-graphs]
  20958. 1234.44 s [algebraic-graphs] ============ Relation ============
  20959. 1234.44 s [algebraic-graphs] OK: Axioms of graphs
  20960. 1234.44 s [algebraic-graphs]
  20961. 1234.44 s [algebraic-graphs] ============ Relation.consistent ============
  20962. 1234.44 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20963. 1234.44 s [algebraic-graphs]
  20964. 1234.44 s [algebraic-graphs] OK: consistent empty == True
  20965. 1234.44 s [algebraic-graphs] OK: consistent (vertex x) == True
  20966. 1234.44 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20967. 1234.44 s [algebraic-graphs] OK: consistent (connect x y) == True
  20968. 1234.44 s [algebraic-graphs] OK: consistent (edge x y) == True
  20969. 1234.44 s [algebraic-graphs] OK: consistent (edges xs) == True
  20970. 1234.44 s [algebraic-graphs] OK: consistent (stars xs) == True
  20971. 1234.44 s [algebraic-graphs]
  20972. 1234.44 s [algebraic-graphs] ============ Relation.Show ============
  20973. 1234.44 s [algebraic-graphs] OK: show (empty ) == "empty"
  20974. 1234.44 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20975. 1234.44 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20976. 1234.44 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20977. 1234.44 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20978. 1234.44 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20979. 1234.44 s [algebraic-graphs]
  20980. 1234.44 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20981. 1234.44 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20982. 1234.44 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20983. 1234.44 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20984. 1234.44 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20985. 1234.44 s [algebraic-graphs]
  20986. 1234.44 s [algebraic-graphs] ============ Relation.Ord ============
  20987. 1234.44 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20988. 1234.44 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20989. 1234.44 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20990. 1234.44 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20991. 1234.44 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20992. 1234.44 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20993. 1234.44 s [algebraic-graphs] OK: x <= x + y
  20994. 1234.44 s [algebraic-graphs] OK: x + y <= x * y
  20995. 1234.44 s [algebraic-graphs]
  20996. 1234.44 s [algebraic-graphs] ============ Relation.empty ============
  20997. 1234.44 s [algebraic-graphs] OK: isEmpty empty == True
  20998. 1234.44 s [algebraic-graphs] OK: hasVertex x empty == False
  20999. 1234.44 s [algebraic-graphs] OK: vertexCount empty == 0
  21000. 1234.44 s [algebraic-graphs] OK: edgeCount empty == 0
  21001. 1234.44 s [algebraic-graphs]
  21002. 1234.44 s [algebraic-graphs] ============ Relation.vertex ============
  21003. 1234.44 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21004. 1234.44 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21005. 1234.44 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21006. 1234.44 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21007. 1234.44 s [algebraic-graphs]
  21008. 1234.44 s [algebraic-graphs] ============ Relation.edge ============
  21009. 1234.44 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21010. 1234.44 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21011. 1234.44 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21012. 1234.44 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21013. 1234.44 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21014. 1234.44 s [algebraic-graphs]
  21015. 1234.44 s [algebraic-graphs] ============ Relation.overlay ============
  21016. 1234.44 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21017. 1234.44 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21018. 1234.44 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21019. 1234.44 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21020. 1234.44 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21021. 1234.44 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21022. 1234.44 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21023. 1234.44 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21024. 1234.44 s [algebraic-graphs]
  21025. 1234.44 s [algebraic-graphs] ============ Relation.connect ============
  21026. 1234.44 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21027. 1234.44 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21028. 1234.44 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21029. 1234.44 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21030. 1234.44 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21031. 1234.44 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21032. 1234.44 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21033. 1234.44 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21034. 1234.44 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21035. 1234.44 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21036. 1234.44 s [algebraic-graphs]
  21037. 1234.44 s [algebraic-graphs] ============ Relation.vertices ============
  21038. 1234.44 s [algebraic-graphs] OK: vertices [] == empty
  21039. 1234.44 s [algebraic-graphs] OK: vertices [x] == vertex x
  21040. 1234.44 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21041. 1234.44 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21042. 1234.44 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21043. 1234.44 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21044. 1234.44 s [algebraic-graphs]
  21045. 1234.44 s [algebraic-graphs] ============ Relation.edges ============
  21046. 1234.44 s [algebraic-graphs] OK: edges [] == empty
  21047. 1234.44 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21048. 1234.44 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21049. 1234.44 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21050. 1234.44 s [algebraic-graphs]
  21051. 1234.44 s [algebraic-graphs] ============ Relation.overlays ============
  21052. 1234.44 s [algebraic-graphs] OK: overlays [] == empty
  21053. 1234.44 s [algebraic-graphs] OK: overlays [x] == x
  21054. 1234.44 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21055. 1234.44 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21056. 1234.44 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21057. 1234.44 s [algebraic-graphs]
  21058. 1234.44 s [algebraic-graphs] ============ Relation.connects ============
  21059. 1234.44 s [algebraic-graphs] OK: connects [] == empty
  21060. 1234.44 s [algebraic-graphs] OK: connects [x] == x
  21061. 1234.44 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21062. 1234.44 s [algebraic-graphs] OK: connects == foldr connect empty
  21063. 1234.44 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21064. 1234.44 s [algebraic-graphs]
  21065. 1234.44 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  21066. 1234.44 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21067. 1234.44 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21068. 1234.44 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21069. 1234.44 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21070. 1234.44 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21071. 1234.44 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21072. 1234.44 s [algebraic-graphs]
  21073. 1234.44 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  21074. 1234.45 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21075. 1234.45 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21076. 1234.45 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21077. 1234.45 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21078. 1234.45 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21079. 1234.45 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21080. 1234.45 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21081. 1234.45 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21082. 1234.45 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21083. 1234.45 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21084. 1234.45 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21085. 1234.45 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21086. 1234.45 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21087. 1234.45 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21088. 1234.45 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21089. 1234.45 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21090. 1234.45 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21091. 1241.90 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21092. 1241.93 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21093. 1241.93 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21094. 1241.93 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21095. 1241.93 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21096. 1241.93 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21097. 1241.93 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21098. 1241.93 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21099. 1241.93 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21100. 1241.93 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21101. 1241.93 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21102. 1241.93 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21103. 1241.93 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21104. 1241.93 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21105. 1241.93 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21106. 1241.93 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21107. 1241.93 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21108. 1241.93 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21109. 1241.93 s [algebraic-graphs]
  21110. 1241.93 s [algebraic-graphs] ============ Relation.foldg ============
  21111. 1241.93 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21112. 1241.93 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21113. 1241.93 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21114. 1241.93 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21115. 1241.93 s [algebraic-graphs]
  21116. 1241.93 s [algebraic-graphs] ============ Relation.isEmpty ============
  21117. 1241.93 s [algebraic-graphs] OK: isEmpty empty == True
  21118. 1241.93 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21119. 1241.93 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21120. 1241.93 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21121. 1241.93 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21122. 1241.93 s [algebraic-graphs]
  21123. 1241.93 s [algebraic-graphs] ============ Relation.hasVertex ============
  21124. 1241.93 s [algebraic-graphs] OK: hasVertex x empty == False
  21125. 1241.93 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21126. 1241.93 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21127. 1241.93 s [algebraic-graphs]
  21128. 1241.93 s [algebraic-graphs] ============ Relation.hasEdge ============
  21129. 1241.93 s [algebraic-graphs] OK: hasEdge x y empty == False
  21130. 1241.93 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21131. 1241.93 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21132. 1241.93 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21133. 1241.93 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21134. 1241.93 s [algebraic-graphs]
  21135. 1241.93 s [algebraic-graphs] ============ Relation.vertexCount ============
  21136. 1241.93 s [algebraic-graphs] OK: vertexCount empty == 0
  21137. 1241.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21138. 1241.93 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21139. 1241.93 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21140. 1241.93 s [algebraic-graphs]
  21141. 1241.93 s [algebraic-graphs] ============ Relation.edgeCount ============
  21142. 1241.94 s [algebraic-graphs] OK: edgeCount empty == 0
  21143. 1241.94 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21144. 1241.94 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21145. 1241.94 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21146. 1241.94 s [algebraic-graphs]
  21147. 1241.94 s [algebraic-graphs] ============ Relation.vertexList ============
  21148. 1241.94 s [algebraic-graphs] OK: vertexList empty == []
  21149. 1241.94 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21150. 1241.94 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21151. 1241.94 s [algebraic-graphs]
  21152. 1241.94 s [algebraic-graphs] ============ Relation.vertexSet ============
  21153. 1241.94 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21154. 1241.94 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21155. 1241.94 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21156. 1241.94 s [algebraic-graphs]
  21157. 1241.94 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  21158. 1241.94 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21159. 1241.94 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21160. 1241.94 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21161. 1241.94 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21162. 1241.94 s [algebraic-graphs]
  21163. 1241.94 s [algebraic-graphs] ============ Relation.edgeList ============
  21164. 1241.94 s [algebraic-graphs] OK: edgeList empty == []
  21165. 1241.94 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21166. 1241.94 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21167. 1241.94 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  21168. 1241.94 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21169. 1241.94 s [algebraic-graphs]
  21170. 1241.94 s [algebraic-graphs] ============ Relation.edgeSet ============
  21171. 1241.94 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21172. 1241.94 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21173. 1241.94 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21174. 1241.94 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21175. 1241.94 s [algebraic-graphs]
  21176. 1241.94 s [algebraic-graphs] ============ Relation.adjacencyList ============
  21177. 1241.94 s [algebraic-graphs] OK: adjacencyList empty == []
  21178. 1241.94 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21179. 1241.94 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  21180. 1241.94 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  21181. 1241.94 s [algebraic-graphs]
  21182. 1241.94 s [algebraic-graphs] ============ Relation.preSet ============
  21183. 1241.94 s [algebraic-graphs] OK: preSet x empty == Set.empty
  21184. 1241.94 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  21185. 1241.94 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  21186. 1241.94 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  21187. 1241.94 s [algebraic-graphs]
  21188. 1241.94 s [algebraic-graphs] ============ Relation.preIntSet ============
  21189. 1241.94 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  21190. 1241.94 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  21191. 1241.94 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  21192. 1241.94 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  21193. 1241.94 s [algebraic-graphs]
  21194. 1241.94 s [algebraic-graphs] ============ Relation.postSet ============
  21195. 1241.94 s [algebraic-graphs] OK: postSet x empty == Set.empty
  21196. 1241.94 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  21197. 1241.94 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  21198. 1241.94 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  21199. 1241.94 s [algebraic-graphs]
  21200. 1241.94 s [algebraic-graphs] ============ Relation.postIntSet ============
  21201. 1241.94 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  21202. 1241.94 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  21203. 1241.94 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  21204. 1241.94 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  21205. 1241.94 s [algebraic-graphs]
  21206. 1241.94 s [algebraic-graphs] ============ Relation.path ============
  21207. 1241.94 s [algebraic-graphs] OK: path [] == empty
  21208. 1241.94 s [algebraic-graphs] OK: path [x] == vertex x
  21209. 1241.94 s [algebraic-graphs] OK: path [x,y] == edge x y
  21210. 1241.94 s [algebraic-graphs]
  21211. 1241.94 s [algebraic-graphs] ============ Relation.circuit ============
  21212. 1241.94 s [algebraic-graphs] OK: circuit [] == empty
  21213. 1241.94 s [algebraic-graphs] OK: circuit [x] == edge x x
  21214. 1241.94 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21215. 1241.94 s [algebraic-graphs]
  21216. 1241.94 s [algebraic-graphs] ============ Relation.clique ============
  21217. 1241.94 s [algebraic-graphs] OK: clique [] == empty
  21218. 1241.94 s [algebraic-graphs] OK: clique [x] == vertex x
  21219. 1241.94 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21220. 1241.94 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21221. 1241.94 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21222. 1241.94 s [algebraic-graphs]
  21223. 1241.94 s [algebraic-graphs] ============ Relation.biclique ============
  21224. 1241.94 s [algebraic-graphs] OK: biclique [] [] == empty
  21225. 1241.94 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21226. 1241.94 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21227. 1241.94 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21228. 1241.94 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21229. 1241.94 s [algebraic-graphs]
  21230. 1241.94 s [algebraic-graphs] ============ Relation.star ============
  21231. 1241.94 s [algebraic-graphs] OK: star x [] == vertex x
  21232. 1241.94 s [algebraic-graphs] OK: star x [y] == edge x y
  21233. 1241.94 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21234. 1241.94 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21235. 1241.94 s [algebraic-graphs]
  21236. 1241.94 s [algebraic-graphs] ============ Relation.stars ============
  21237. 1241.94 s [algebraic-graphs] OK: stars [] == empty
  21238. 1241.94 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21239. 1241.94 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21240. 1241.94 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21241. 1241.94 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21242. 1241.94 s [algebraic-graphs] OK: stars . adjacencyList == id
  21243. 1241.94 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21244. 1241.94 s [algebraic-graphs]
  21245. 1241.94 s [algebraic-graphs] ============ Relation.tree ============
  21246. 1241.94 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21247. 1241.94 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21248. 1241.94 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21249. 1241.94 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21250. 1241.94 s [algebraic-graphs]
  21251. 1241.94 s [algebraic-graphs] ============ Relation.forest ============
  21252. 1241.94 s [algebraic-graphs] OK: forest [] == empty
  21253. 1241.94 s [algebraic-graphs] OK: forest [x] == tree x
  21254. 1241.94 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21255. 1241.94 s [algebraic-graphs] OK: forest == overlays . map tree
  21256. 1241.94 s [algebraic-graphs]
  21257. 1241.94 s [algebraic-graphs] ============ Relation.removeVertex ============
  21258. 1241.94 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21259. 1241.94 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21260. 1241.94 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21261. 1241.94 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21262. 1241.94 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21263. 1241.94 s [algebraic-graphs]
  21264. 1241.94 s [algebraic-graphs] ============ Relation.removeEdge ============
  21265. 1241.94 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21266. 1241.94 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21267. 1241.94 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21268. 1241.94 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21269. 1241.94 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21270. 1241.94 s [algebraic-graphs]
  21271. 1241.94 s [algebraic-graphs] ============ Relation.replaceVertex ============
  21272. 1241.94 s [algebraic-graphs] OK: replaceVertex x x == id
  21273. 1241.94 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21274. 1241.94 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21275. 1241.94 s [algebraic-graphs]
  21276. 1241.94 s [algebraic-graphs] ============ Relation.mergeVertices ============
  21277. 1241.94 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21278. 1287.43 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21279. 1287.43 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21280. 1287.46 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21281. 1287.46 s [algebraic-graphs]
  21282. 1287.46 s [algebraic-graphs] ============ Relation.transpose ============
  21283. 1287.46 s [algebraic-graphs] OK: transpose empty == empty
  21284. 1287.46 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21285. 1287.46 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21286. 1287.46 s [algebraic-graphs] OK: transpose . transpose == id
  21287. 1287.46 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21288. 1287.46 s [algebraic-graphs]
  21289. 1287.46 s [algebraic-graphs] ============ Relation.gmap ============
  21290. 1287.46 s [algebraic-graphs] OK: gmap f empty == empty
  21291. 1287.46 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21292. 1287.46 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21293. 1287.46 s [algebraic-graphs] OK: gmap id == id
  21294. 1287.46 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21295. 1287.46 s [algebraic-graphs]
  21296. 1287.46 s [algebraic-graphs] ============ Relation.induce ============
  21297. 1287.46 s [algebraic-graphs] OK: induce (const True ) x == x
  21298. 1287.46 s [algebraic-graphs] OK: induce (const False) x == empty
  21299. 1287.46 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21300. 1287.46 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21301. 1287.46 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21302. 1287.46 s [algebraic-graphs]
  21303. 1287.46 s [algebraic-graphs] ============ Relation.compose ============
  21304. 1287.46 s [algebraic-graphs] OK: compose empty x == empty
  21305. 1287.46 s [algebraic-graphs] OK: compose x empty == empty
  21306. 1287.46 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21307. 1287.46 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21308. 1287.46 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21309. 1287.46 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21310. 1287.46 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21311. 1287.46 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21312. 1287.46 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21313. 1287.46 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21314. 1287.47 s [algebraic-graphs]
  21315. 1287.47 s [algebraic-graphs] ============ Relation.closure ============
  21316. 1287.47 s [algebraic-graphs] OK: closure empty == empty
  21317. 1287.47 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  21318. 1287.47 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  21319. 1287.47 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21320. 1287.47 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  21321. 1287.47 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  21322. 1287.47 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  21323. 1287.47 s [algebraic-graphs] OK: closure . closure == closure
  21324. 1287.47 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  21325. 1287.47 s [algebraic-graphs]
  21326. 1287.47 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  21327. 1287.47 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  21328. 1287.47 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  21329. 1287.47 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  21330. 1287.47 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21331. 1287.47 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  21332. 1287.47 s [algebraic-graphs]
  21333. 1287.47 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  21334. 1287.47 s [algebraic-graphs] OK: symmetricClosure empty == empty
  21335. 1287.47 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  21336. 1287.47 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  21337. 1287.47 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  21338. 1287.47 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  21339. 1287.47 s [algebraic-graphs]
  21340. 1287.47 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  21341. 1287.47 s [algebraic-graphs] OK: transitiveClosure empty == empty
  21342. 1287.47 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  21343. 1287.47 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  21344. 1287.47 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  21345. 1287.47 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  21346. 1287.47 s [algebraic-graphs]
  21347. 1287.47 s [algebraic-graphs] ============ Relation.induceJust ============
  21348. 1287.47 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21349. 1287.47 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21350. 1287.47 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21351. 1287.47 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21352. 1287.47 s [algebraic-graphs]
  21353. 1287.47 s [algebraic-graphs] ============ ReflexiveRelation ============
  21354. 1287.47 s [algebraic-graphs] OK: Axioms of reflexive graphs
  21355. 1287.47 s [algebraic-graphs]
  21356. 1287.47 s [algebraic-graphs] ============ TransitiveRelation ============
  21357. 1287.47 s [algebraic-graphs] OK: Axioms of transitive graphs
  21358. 1287.47 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  21359. 1287.47 s [algebraic-graphs]
  21360. 1287.47 s [algebraic-graphs] ============ PreorderRelation ============
  21361. 1287.47 s [algebraic-graphs] OK: Axioms of preorder graphs
  21362. 1287.47 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  21363. 1287.47 s [algebraic-graphs]
  21364. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation ============
  21365. 1287.47 s [algebraic-graphs] OK: Axioms of undirected graphs
  21366. 1287.47 s [algebraic-graphs]
  21367. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  21368. 1287.47 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  21369. 1287.47 s [algebraic-graphs]
  21370. 1287.47 s [algebraic-graphs] OK: consistent empty == True
  21371. 1287.47 s [algebraic-graphs] OK: consistent (vertex x) == True
  21372. 1287.47 s [algebraic-graphs] OK: consistent (overlay x y) == True
  21373. 1287.47 s [algebraic-graphs] OK: consistent (connect x y) == True
  21374. 1287.47 s [algebraic-graphs] OK: consistent (edge x y) == True
  21375. 1287.47 s [algebraic-graphs] OK: consistent (edges xs) == True
  21376. 1287.47 s [algebraic-graphs] OK: consistent (stars xs) == True
  21377. 1287.47 s [algebraic-graphs]
  21378. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  21379. 1287.47 s [algebraic-graphs] OK: show (empty ) == "empty"
  21380. 1287.47 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  21381. 1287.47 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  21382. 1287.47 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  21383. 1287.47 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  21384. 1287.47 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  21385. 1287.47 s [algebraic-graphs]
  21386. 1287.47 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  21387. 1287.47 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  21388. 1287.47 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  21389. 1287.47 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  21390. 1287.47 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  21391. 1287.47 s [algebraic-graphs]
  21392. 1287.47 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  21393. 1287.47 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  21394. 1287.47 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  21395. 1287.47 s [algebraic-graphs]
  21396. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  21397. 1287.47 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  21398. 1287.47 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  21399. 1287.47 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  21400. 1287.47 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  21401. 1287.47 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  21402. 1287.47 s [algebraic-graphs]
  21403. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  21404. 1287.47 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  21405. 1287.47 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  21406. 1287.47 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  21407. 1287.47 s [algebraic-graphs]
  21408. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  21409. 1287.47 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21410. 1287.47 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21411. 1287.47 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21412. 1287.47 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21413. 1287.47 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21414. 1287.47 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  21415. 1287.47 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  21416. 1287.47 s [algebraic-graphs] OK: x <= x + y
  21417. 1287.47 s [algebraic-graphs] OK: x + y <= x * y
  21418. 1287.47 s [algebraic-graphs]
  21419. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  21420. 1287.47 s [algebraic-graphs] OK: isEmpty empty == True
  21421. 1287.47 s [algebraic-graphs] OK: hasVertex x empty == False
  21422. 1287.47 s [algebraic-graphs] OK: vertexCount empty == 0
  21423. 1287.47 s [algebraic-graphs] OK: edgeCount empty == 0
  21424. 1287.47 s [algebraic-graphs]
  21425. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  21426. 1287.47 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21427. 1287.47 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21428. 1287.47 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21429. 1287.47 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21430. 1287.47 s [algebraic-graphs]
  21431. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  21432. 1287.47 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21433. 1287.47 s [algebraic-graphs] OK: edge x y == edge y x
  21434. 1287.47 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  21435. 1287.47 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21436. 1287.47 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21437. 1287.47 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21438. 1287.47 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21439. 1287.47 s [algebraic-graphs]
  21440. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  21441. 1287.47 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21442. 1287.47 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21443. 1287.47 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21444. 1287.47 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21445. 1287.47 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21446. 1287.47 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21447. 1287.47 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21448. 1287.47 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21449. 1287.47 s [algebraic-graphs]
  21450. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  21451. 1287.47 s [algebraic-graphs] OK: connect x y == connect y x
  21452. 1287.47 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21453. 1287.47 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21454. 1287.47 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21455. 1287.47 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21456. 1287.47 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21457. 1287.47 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21458. 1287.47 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  21459. 1287.47 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21460. 1287.47 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21461. 1287.47 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21462. 1287.47 s [algebraic-graphs]
  21463. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  21464. 1287.47 s [algebraic-graphs] OK: vertices [] == empty
  21465. 1287.47 s [algebraic-graphs] OK: vertices [x] == vertex x
  21466. 1287.47 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21467. 1287.47 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21468. 1287.47 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21469. 1287.47 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21470. 1287.47 s [algebraic-graphs]
  21471. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  21472. 1287.47 s [algebraic-graphs] OK: edges [] == empty
  21473. 1287.47 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21474. 1287.47 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  21475. 1287.47 s [algebraic-graphs]
  21476. 1287.47 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  21477. 1287.47 s [algebraic-graphs] OK: overlays [] == empty
  21478. 1311.97 s [algebraic-graphs] OK: overlays [x] == x
  21479. 1312.00 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21480. 1312.00 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21481. 1312.00 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21482. 1312.00 s [algebraic-graphs]
  21483. 1312.00 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  21484. 1312.00 s [algebraic-graphs] OK: connects [] == empty
  21485. 1312.00 s [algebraic-graphs] OK: connects [x] == x
  21486. 1312.00 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21487. 1312.00 s [algebraic-graphs] OK: connects == foldr connect empty
  21488. 1312.00 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21489. 1312.00 s [algebraic-graphs] OK: connects == connects . reverse
  21490. 1312.00 s [algebraic-graphs]
  21491. 1312.00 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  21492. 1312.00 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21493. 1312.00 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21494. 1312.00 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21495. 1312.01 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21496. 1312.01 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21497. 1312.01 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21498. 1312.01 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  21499. 1312.01 s [algebraic-graphs]
  21500. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  21501. 1312.01 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21502. 1312.01 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21503. 1312.01 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21504. 1312.01 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21505. 1312.01 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21506. 1312.01 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21507. 1312.01 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21508. 1312.01 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21509. 1312.01 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21510. 1312.01 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21511. 1312.01 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21512. 1312.01 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21513. 1312.01 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21514. 1312.01 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21515. 1312.01 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21516. 1312.01 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21517. 1312.01 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21518. 1312.01 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21519. 1312.01 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21520. 1312.01 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21521. 1312.01 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21522. 1312.01 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21523. 1312.01 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21524. 1312.01 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21525. 1312.01 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21526. 1312.01 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21527. 1312.01 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21528. 1312.01 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21529. 1312.01 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21530. 1312.01 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21531. 1312.01 s [algebraic-graphs]
  21532. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  21533. 1312.01 s [algebraic-graphs] OK: isEmpty empty == True
  21534. 1312.01 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21535. 1312.01 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21536. 1312.01 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21537. 1312.01 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21538. 1312.01 s [algebraic-graphs]
  21539. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  21540. 1312.01 s [algebraic-graphs] OK: hasVertex x empty == False
  21541. 1312.01 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21542. 1312.01 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21543. 1312.01 s [algebraic-graphs]
  21544. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  21545. 1312.01 s [algebraic-graphs] OK: hasEdge x y empty == False
  21546. 1312.01 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21547. 1312.01 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21548. 1312.01 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  21549. 1312.01 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21550. 1312.01 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  21551. 1312.01 s [algebraic-graphs]
  21552. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  21553. 1312.01 s [algebraic-graphs] OK: vertexCount empty == 0
  21554. 1312.01 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21555. 1312.01 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21556. 1312.01 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21557. 1312.01 s [algebraic-graphs]
  21558. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  21559. 1312.01 s [algebraic-graphs] OK: edgeCount empty == 0
  21560. 1312.01 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21561. 1312.01 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21562. 1312.01 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21563. 1312.01 s [algebraic-graphs]
  21564. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  21565. 1312.01 s [algebraic-graphs] OK: vertexList empty == []
  21566. 1312.01 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21567. 1312.01 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21568. 1312.01 s [algebraic-graphs]
  21569. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  21570. 1312.01 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21571. 1312.01 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21572. 1312.01 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21573. 1312.01 s [algebraic-graphs]
  21574. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  21575. 1312.01 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21576. 1312.01 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21577. 1312.01 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21578. 1312.01 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21579. 1312.01 s [algebraic-graphs]
  21580. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  21581. 1312.01 s [algebraic-graphs] OK: edgeList empty == []
  21582. 1312.01 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21583. 1312.01 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  21584. 1312.01 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  21585. 1312.01 s [algebraic-graphs]
  21586. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  21587. 1312.01 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21588. 1312.01 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21589. 1312.01 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  21590. 1312.01 s [algebraic-graphs]
  21591. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  21592. 1312.01 s [algebraic-graphs] OK: adjacencyList empty == []
  21593. 1312.01 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21594. 1312.01 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  21595. 1312.01 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  21596. 1312.01 s [algebraic-graphs]
  21597. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  21598. 1312.01 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  21599. 1312.01 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  21600. 1312.01 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  21601. 1312.01 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  21602. 1312.01 s [algebraic-graphs]
  21603. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  21604. 1312.01 s [algebraic-graphs] OK: path [] == empty
  21605. 1312.01 s [algebraic-graphs] OK: path [x] == vertex x
  21606. 1312.01 s [algebraic-graphs] OK: path [x,y] == edge x y
  21607. 1312.01 s [algebraic-graphs] OK: path == path . reverse
  21608. 1312.01 s [algebraic-graphs]
  21609. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  21610. 1312.01 s [algebraic-graphs] OK: circuit [] == empty
  21611. 1312.01 s [algebraic-graphs] OK: circuit [x] == edge x x
  21612. 1312.01 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21613. 1312.01 s [algebraic-graphs] OK: circuit == circuit . reverse
  21614. 1312.01 s [algebraic-graphs]
  21615. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  21616. 1312.01 s [algebraic-graphs] OK: clique [] == empty
  21617. 1312.01 s [algebraic-graphs] OK: clique [x] == vertex x
  21618. 1312.01 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21619. 1312.01 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21620. 1312.01 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21621. 1312.01 s [algebraic-graphs] OK: clique == clique . reverse
  21622. 1312.01 s [algebraic-graphs]
  21623. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  21624. 1312.01 s [algebraic-graphs] OK: biclique [] [] == empty
  21625. 1312.01 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21626. 1312.01 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21627. 1312.01 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21628. 1312.01 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21629. 1312.01 s [algebraic-graphs]
  21630. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  21631. 1312.01 s [algebraic-graphs] OK: star x [] == vertex x
  21632. 1312.01 s [algebraic-graphs] OK: star x [y] == edge x y
  21633. 1312.01 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21634. 1312.01 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21635. 1312.01 s [algebraic-graphs]
  21636. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  21637. 1312.01 s [algebraic-graphs] OK: stars [] == empty
  21638. 1312.01 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21639. 1312.01 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21640. 1312.01 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21641. 1312.01 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21642. 1312.01 s [algebraic-graphs] OK: stars . adjacencyList == id
  21643. 1312.01 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21644. 1312.01 s [algebraic-graphs]
  21645. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  21646. 1312.01 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21647. 1312.01 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21648. 1312.01 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21649. 1312.01 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21650. 1312.01 s [algebraic-graphs]
  21651. 1312.01 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  21652. 1312.01 s [algebraic-graphs] OK: forest [] == empty
  21653. 1321.73 s [algebraic-graphs] OK: forest [x] == tree x
  21654. 1321.73 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21655. 1321.77 s [algebraic-graphs] OK: forest == overlays . map tree
  21656. 1321.77 s [algebraic-graphs]
  21657. 1321.77 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  21658. 1321.77 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21659. 1321.77 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21660. 1321.77 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21661. 1321.77 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21662. 1321.77 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21663. 1321.77 s [algebraic-graphs]
  21664. 1321.77 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  21665. 1321.77 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21666. 1321.77 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21667. 1321.77 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21668. 1321.77 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21669. 1321.77 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21670. 1321.77 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21671. 1321.77 s [algebraic-graphs]
  21672. 1321.77 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  21673. 1321.77 s [algebraic-graphs] OK: replaceVertex x x == id
  21674. 1321.77 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21675. 1321.77 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21676. 1321.77 s [algebraic-graphs]
  21677. 1321.77 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  21678. 1321.77 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21679. 1321.77 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21680. 1321.77 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21681. 1321.77 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21682. 1321.77 s [algebraic-graphs]
  21683. 1321.77 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  21684. 1321.77 s [algebraic-graphs] OK: gmap f empty == empty
  21685. 1321.77 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21686. 1321.77 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21687. 1321.77 s [algebraic-graphs] OK: gmap id == id
  21688. 1321.77 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21689. 1321.77 s [algebraic-graphs]
  21690. 1321.77 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  21691. 1321.77 s [algebraic-graphs] OK: induce (const True ) x == x
  21692. 1321.77 s [algebraic-graphs] OK: induce (const False) x == empty
  21693. 1321.77 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21694. 1321.77 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21695. 1321.77 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21696. 1321.77 s [algebraic-graphs]
  21697. 1321.77 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  21698. 1321.77 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21699. 1321.77 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21700. 1321.77 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21701. 1321.77 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21702. 1321.77 s [algebraic-graphs]
  21703. 1321.77 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  21704. 1321.77 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  21705. 1321.77 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  21706. 1321.77 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  21707. 1321.77 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  21708. 1321.77 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  21709. 1321.77 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  21710. 1321.77 s [algebraic-graphs]
  21711. 1321.77 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  21712. 1321.77 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  21713. 1321.77 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  21714. 1321.77 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  21715. 1321.77 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  21716. 1321.77 s [algebraic-graphs]
  21717. 1321.77 s [algebraic-graphs] ============ Typed ============
  21718. 1321.77 s [algebraic-graphs]
  21719. 1321.77 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  21720. 1321.77 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21721. 1321.77 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21722. 1321.77 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  21723. 1321.77 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21724. 1321.77 s [algebraic-graphs]
  21725. 1321.77 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  21726. 1321.77 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21727. 1321.77 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21728. 1321.77 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  21729. 1321.77 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21730. 1321.77 s [algebraic-graphs]
  21731. 1321.77 s [algebraic-graphs] ============ Typed.dfsForest ============
  21732. 1321.77 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  21733. 1321.77 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  21734. 1321.77 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  21735. 1321.77 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  21736. 1321.77 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  21737. 1321.77 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  21738. 1321.77 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  21739. 1321.77 s [algebraic-graphs]
  21740. 1321.77 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  21741. 1321.77 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  21742. 1321.77 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  21743. 1321.77 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  21744. 1321.77 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  21745. 1321.77 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  21746. 1321.77 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  21747. 1321.77 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  21748. 1321.78 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  21749. 1321.78 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  21750. 1321.78 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  21751. 1321.78 s [algebraic-graphs]
  21752. 1321.78 s [algebraic-graphs] ============ Typed.dfs ============
  21753. 1321.78 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  21754. 1321.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  21755. 1321.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  21756. 1321.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  21757. 1321.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  21758. 1321.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  21759. 1321.78 s [algebraic-graphs] OK: dfs % x $ [] == []
  21760. 1321.78 s [algebraic-graphs]
  21761. 1321.78 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  21762. 1321.78 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  21763. 1321.78 s [algebraic-graphs]
  21764. 1321.78 s [algebraic-graphs] ============ Typed.topSort ============
  21765. 1321.78 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  21766. 1321.78 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  21767. 1321.78 s [algebraic-graphs]
  21768. 1321.78 s [algebraic-graphs] ============ Graph.Undirected ============
  21769. 1321.78 s [algebraic-graphs] OK: Axioms of undirected graphs
  21770. 1321.78 s [algebraic-graphs]
  21771. 1321.78 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  21772. 1321.78 s [algebraic-graphs] OK: show (empty ) == "empty"
  21773. 1321.78 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  21774. 1321.78 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  21775. 1321.78 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  21776. 1321.78 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  21777. 1321.78 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  21778. 1321.78 s [algebraic-graphs]
  21779. 1321.78 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  21780. 1321.78 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  21781. 1321.78 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  21782. 1321.78 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  21783. 1321.78 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  21784. 1321.78 s [algebraic-graphs]
  21785. 1321.78 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  21786. 1321.78 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  21787. 1321.78 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  21788. 1321.78 s [algebraic-graphs]
  21789. 1321.78 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  21790. 1321.78 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  21791. 1321.78 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21792. 1321.78 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  21793. 1321.78 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  21794. 1321.78 s [algebraic-graphs]
  21795. 1321.78 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  21796. 1321.78 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  21797. 1321.78 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21798. 1321.78 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  21799. 1321.78 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  21800. 1321.78 s [algebraic-graphs]
  21801. 1321.78 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  21802. 1321.78 s [algebraic-graphs] OK: complement empty == empty
  21803. 1321.78 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  21804. 1321.78 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  21805. 1321.78 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  21806. 1321.78 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  21807. 1321.78 s [algebraic-graphs] OK: complement . complement == id
  21808. 1321.78 s [algebraic-graphs]
  21809. 1321.78 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  21810. 1321.78 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21811. 1321.78 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21812. 1321.78 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21813. 1321.78 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21814. 1321.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21815. 1321.78 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  21816. 1321.78 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  21817. 1321.78 s [algebraic-graphs] OK: x <= x + y
  21818. 1321.78 s [algebraic-graphs] OK: x + y <= x * y
  21819. 1321.78 s [algebraic-graphs]
  21820. 1321.78 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  21821. 1321.78 s [algebraic-graphs] OK: isEmpty empty == True
  21822. 1321.78 s [algebraic-graphs] OK: hasVertex x empty == False
  21823. 1321.78 s [algebraic-graphs] OK: vertexCount empty == 0
  21824. 1321.78 s [algebraic-graphs] OK: edgeCount empty == 0
  21825. 1321.78 s [algebraic-graphs]
  21826. 1321.78 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  21827. 1321.78 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21828. 1321.78 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21829. 1321.78 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21830. 1321.78 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21831. 1321.78 s [algebraic-graphs]
  21832. 1321.78 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  21833. 1321.78 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21834. 1321.78 s [algebraic-graphs] OK: edge x y == edge y x
  21835. 1335.53 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  21836. 1335.53 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21837. 1335.53 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21838. 1335.57 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21839. 1335.57 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21840. 1335.57 s [algebraic-graphs]
  21841. 1335.57 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  21842. 1335.57 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21843. 1335.57 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21844. 1335.57 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21845. 1335.57 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21846. 1335.57 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21847. 1335.57 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21848. 1335.57 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21849. 1335.57 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21850. 1335.57 s [algebraic-graphs]
  21851. 1335.57 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  21852. 1335.57 s [algebraic-graphs] OK: connect x y == connect y x
  21853. 1335.57 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21854. 1335.57 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21855. 1335.57 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21856. 1335.57 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21857. 1335.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21858. 1335.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21859. 1335.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  21860. 1335.57 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21861. 1335.57 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21862. 1335.57 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21863. 1335.57 s [algebraic-graphs]
  21864. 1335.57 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  21865. 1335.57 s [algebraic-graphs] OK: vertices [] == empty
  21866. 1335.57 s [algebraic-graphs] OK: vertices [x] == vertex x
  21867. 1335.57 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21868. 1335.57 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21869. 1335.57 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21870. 1335.57 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21871. 1335.57 s [algebraic-graphs]
  21872. 1335.57 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  21873. 1335.57 s [algebraic-graphs] OK: edges [] == empty
  21874. 1335.57 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21875. 1335.57 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  21876. 1335.57 s [algebraic-graphs]
  21877. 1335.57 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  21878. 1335.57 s [algebraic-graphs] OK: overlays [] == empty
  21879. 1335.57 s [algebraic-graphs] OK: overlays [x] == x
  21880. 1335.57 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21881. 1335.57 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21882. 1335.57 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21883. 1335.57 s [algebraic-graphs]
  21884. 1335.57 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  21885. 1335.57 s [algebraic-graphs] OK: connects [] == empty
  21886. 1335.57 s [algebraic-graphs] OK: connects [x] == x
  21887. 1335.57 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21888. 1335.57 s [algebraic-graphs] OK: connects == foldr connect empty
  21889. 1335.57 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21890. 1335.57 s [algebraic-graphs] OK: connects == connects . reverse
  21891. 1335.57 s [algebraic-graphs]
  21892. 1335.57 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  21893. 1335.57 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21894. 1335.57 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21895. 1335.57 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21896. 1335.57 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21897. 1335.57 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21898. 1335.57 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21899. 1335.57 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  21900. 1335.57 s [algebraic-graphs]
  21901. 1335.57 s [algebraic-graphs] ============ Graph.Undirected.path ============
  21902. 1335.57 s [algebraic-graphs] OK: path [] == empty
  21903. 1335.57 s [algebraic-graphs] OK: path [x] == vertex x
  21904. 1335.57 s [algebraic-graphs] OK: path [x,y] == edge x y
  21905. 1335.57 s [algebraic-graphs] OK: path == path . reverse
  21906. 1335.57 s [algebraic-graphs]
  21907. 1335.57 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  21908. 1335.57 s [algebraic-graphs] OK: circuit [] == empty
  21909. 1335.57 s [algebraic-graphs] OK: circuit [x] == edge x x
  21910. 1335.57 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21911. 1335.57 s [algebraic-graphs] OK: circuit == circuit . reverse
  21912. 1335.57 s [algebraic-graphs]
  21913. 1335.57 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  21914. 1335.57 s [algebraic-graphs] OK: clique [] == empty
  21915. 1335.58 s [algebraic-graphs] OK: clique [x] == vertex x
  21916. 1335.58 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21917. 1335.58 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21918. 1335.58 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21919. 1335.58 s [algebraic-graphs] OK: clique == clique . reverse
  21920. 1335.58 s [algebraic-graphs]
  21921. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  21922. 1335.58 s [algebraic-graphs] OK: biclique [] [] == empty
  21923. 1335.58 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21924. 1335.58 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21925. 1335.58 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21926. 1335.58 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21927. 1335.58 s [algebraic-graphs]
  21928. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.star ============
  21929. 1335.58 s [algebraic-graphs] OK: star x [] == vertex x
  21930. 1335.58 s [algebraic-graphs] OK: star x [y] == edge x y
  21931. 1335.58 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21932. 1335.58 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21933. 1335.58 s [algebraic-graphs]
  21934. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  21935. 1335.58 s [algebraic-graphs] OK: stars [] == empty
  21936. 1335.58 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21937. 1335.58 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21938. 1335.58 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21939. 1335.58 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21940. 1335.58 s [algebraic-graphs] OK: stars . adjacencyList == id
  21941. 1335.58 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21942. 1335.58 s [algebraic-graphs]
  21943. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  21944. 1335.58 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21945. 1335.58 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21946. 1335.58 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21947. 1335.58 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21948. 1335.58 s [algebraic-graphs]
  21949. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  21950. 1335.58 s [algebraic-graphs] OK: forest [] == empty
  21951. 1335.58 s [algebraic-graphs] OK: forest [x] == tree x
  21952. 1335.58 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21953. 1335.58 s [algebraic-graphs] OK: forest == overlays . map tree
  21954. 1335.58 s [algebraic-graphs]
  21955. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  21956. 1335.58 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21957. 1335.58 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21958. 1335.58 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21959. 1335.58 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21960. 1335.58 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21961. 1335.58 s [algebraic-graphs]
  21962. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  21963. 1335.58 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21964. 1335.58 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21965. 1335.58 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21966. 1335.58 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21967. 1335.58 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21968. 1335.58 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21969. 1335.58 s [algebraic-graphs]
  21970. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  21971. 1335.58 s [algebraic-graphs] OK: replaceVertex x x == id
  21972. 1335.58 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21973. 1335.58 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21974. 1335.58 s [algebraic-graphs]
  21975. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  21976. 1335.58 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21977. 1335.58 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21978. 1335.58 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21979. 1335.58 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21980. 1335.58 s [algebraic-graphs]
  21981. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  21982. 1335.58 s [algebraic-graphs] OK: gmap f empty == empty
  21983. 1335.58 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21984. 1335.58 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21985. 1335.58 s [algebraic-graphs] OK: gmap id == id
  21986. 1335.58 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21987. 1335.58 s [algebraic-graphs]
  21988. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  21989. 1335.58 s [algebraic-graphs] OK: induce (const True ) x == x
  21990. 1335.58 s [algebraic-graphs] OK: induce (const False) x == empty
  21991. 1335.58 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21992. 1335.58 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21993. 1335.58 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21994. 1335.58 s [algebraic-graphs]
  21995. 1335.58 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  21996. 1335.58 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21997. 1335.58 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21998. 1335.58 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21999. 1335.58 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22000. 1335.58 s [algebraic-graphs] Test suite main: PASS
  22001. 1335.58 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  22002. 1335.58 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  22003. 1335.58 s [algebraic-graphs] checkPhase completed in 4 minutes 23 seconds
  22004. 1335.58 s [algebraic-graphs] Phase: haddockPhase
  22005. 1335.88 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  22006. 1335.89 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  22007. 1336.20 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  22008. 1336.79 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  22009. 1336.91 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  22010. 1337.10 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  22011. 1337.16 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  22012. 1337.38 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  22013. 1337.52 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  22014. 1337.92 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  22015. 1338.27 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  22016. 1338.83 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  22017. 1338.95 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  22018. 1339.16 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  22019. 1339.16 s [algebraic-graphs] In the use of ‘head’
  22020. 1339.16 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  22021. 1339.16 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  22022. 1339.16 s [algebraic-graphs] |
  22023. 1339.16 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  22024. 1339.16 s [algebraic-graphs] | ^^^^
  22025. 1339.16 s [algebraic-graphs]
  22026. 1339.17 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  22027. 1339.17 s [algebraic-graphs] In the use of ‘tail’
  22028. 1339.17 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  22029. 1339.17 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  22030. 1339.17 s [algebraic-graphs] |
  22031. 1339.17 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  22032. 1339.17 s [algebraic-graphs] | ^^^^
  22033. 1339.17 s [algebraic-graphs]
  22034. 1339.17 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  22035. 1339.17 s [algebraic-graphs] In the use of ‘head’
  22036. 1339.17 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  22037. 1339.17 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  22038. 1339.17 s [algebraic-graphs] |
  22039. 1339.17 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  22040. 1339.17 s [algebraic-graphs] | ^^^^
  22041. 1339.17 s [algebraic-graphs]
  22042. 1339.17 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  22043. 1339.17 s [algebraic-graphs] In the use of ‘tail’
  22044. 1339.17 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  22045. 1339.17 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  22046. 1339.17 s [algebraic-graphs] |
  22047. 1339.17 s [algebraic-graphs] 397 | bnd' = tail bnd
  22048. 1339.17 s [algebraic-graphs] | ^^^^
  22049. 1339.17 s [algebraic-graphs]
  22050. 1339.18 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  22051. 1339.28 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  22052. 1339.57 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22053. 1339.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22054. 1339.57 s [algebraic-graphs] will become an error in a future GHC release.
  22055. 1339.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22056. 1339.57 s [algebraic-graphs] |
  22057. 1339.57 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  22058. 1339.57 s [algebraic-graphs] | ^
  22059. 1339.57 s [algebraic-graphs]
  22060. 1339.57 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22061. 1339.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22062. 1339.57 s [algebraic-graphs] will become an error in a future GHC release.
  22063. 1339.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22064. 1339.57 s [algebraic-graphs] |
  22065. 1339.57 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  22066. 1339.57 s [algebraic-graphs] | ^
  22067. 1339.57 s [algebraic-graphs]
  22068. 1339.58 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22069. 1339.58 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22070. 1339.58 s [algebraic-graphs] will become an error in a future GHC release.
  22071. 1339.58 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22072. 1339.58 s [algebraic-graphs] |
  22073. 1339.58 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  22074. 1339.58 s [algebraic-graphs] | ^
  22075. 1339.58 s [algebraic-graphs]
  22076. 1339.58 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22077. 1339.58 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22078. 1339.58 s [algebraic-graphs] will become an error in a future GHC release.
  22079. 1339.58 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22080. 1339.58 s [algebraic-graphs] |
  22081. 1339.58 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  22082. 1339.58 s [algebraic-graphs] | ^
  22083. 1339.58 s [algebraic-graphs]
  22084. 1339.58 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22085. 1339.58 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22086. 1339.58 s [algebraic-graphs] will become an error in a future GHC release.
  22087. 1339.58 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22088. 1339.58 s [algebraic-graphs] |
  22089. 1339.58 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  22090. 1339.58 s [algebraic-graphs] | ^
  22091. 1339.58 s [algebraic-graphs]
  22092. 1339.58 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22093. 1339.58 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22094. 1339.58 s [algebraic-graphs] will become an error in a future GHC release.
  22095. 1339.58 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22096. 1339.58 s [algebraic-graphs] |
  22097. 1339.58 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  22098. 1339.58 s [algebraic-graphs] | ^
  22099. 1339.58 s [algebraic-graphs]
  22100. 1339.58 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22101. 1339.58 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22102. 1339.58 s [algebraic-graphs] will become an error in a future GHC release.
  22103. 1339.58 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22104. 1339.58 s [algebraic-graphs] |
  22105. 1339.58 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  22106. 1339.58 s [algebraic-graphs] | ^
  22107. 1339.58 s [algebraic-graphs]
  22108. 1339.59 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  22109. 1339.75 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  22110. 1339.85 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  22111. 1340.11 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  22112. 1340.28 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  22113. 1340.47 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  22114. 1340.49 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  22115. 1340.54 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  22116. 1340.57 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22117. 1340.66 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22118. 1340.66 s [algebraic-graphs] will become an error in a future GHC release.
  22119. 1340.66 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22120. 1340.66 s [algebraic-graphs] |
  22121. 1340.66 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  22122. 1340.66 s [algebraic-graphs] | ^
  22123. 1340.66 s [algebraic-graphs]
  22124. 1340.66 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  22125. 1340.66 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22126. 1340.66 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22127. 1340.66 s [algebraic-graphs] will become an error in a future GHC release.
  22128. 1340.66 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22129. 1340.66 s [algebraic-graphs] |
  22130. 1340.66 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  22131. 1340.66 s [algebraic-graphs] | ^
  22132. 1340.66 s [algebraic-graphs]
  22133. 1340.66 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22134. 1340.66 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22135. 1340.66 s [algebraic-graphs] will become an error in a future GHC release.
  22136. 1340.66 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22137. 1340.66 s [algebraic-graphs] |
  22138. 1340.66 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  22139. 1340.66 s [algebraic-graphs] | ^
  22140. 1340.66 s [algebraic-graphs]
  22141. 1340.66 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  22142. 1340.79 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  22143. 1340.87 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  22144. 1340.89 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  22145. 1340.91 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  22146. 1340.92 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  22147. 1340.95 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  22148. 1340.97 s [algebraic-graphs] Haddock coverage:
  22149. 1340.98 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22150. 1340.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22151. 1340.98 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22152. 1340.98 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22153. 1340.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22154. 1340.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22155. 1340.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22156. 1341.00 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  22157. 1341.00 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22158. 1341.00 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  22159. 1341.00 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  22160. 1341.00 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  22161. 1341.00 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22162. 1341.00 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22163. 1341.00 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  22164. 1341.02 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  22165. 1341.03 s [algebraic-graphs] Warning: 'nub' is out of scope.
  22166. 1341.03 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22167. 1341.03 s [algebraic-graphs] Warning: 'sort' is out of scope.
  22168. 1341.03 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22169. 1341.03 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  22170. 1341.03 s [algebraic-graphs] Missing documentation for:
  22171. 1341.03 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  22172. 1341.03 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  22173. 1341.03 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  22174. 1341.03 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  22175. 1341.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22176. 1341.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22177. 1341.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  22178. 1341.03 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  22179. 1341.03 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22180. 1341.03 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  22181. 1341.03 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  22182. 1341.03 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  22183. 1341.03 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  22184. 1341.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22185. 1341.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22186. 1341.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  22187. 1341.04 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22188. 1341.04 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  22189. 1341.04 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22190. 1341.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22191. 1341.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22192. 1341.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  22193. 1341.07 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  22194. 1341.07 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  22195. 1341.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22196. 1341.07 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  22197. 1341.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22198. 1341.07 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  22199. 1341.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22200. 1341.07 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  22201. 1341.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22202. 1341.07 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  22203. 1341.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22204. 1341.07 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  22205. 1341.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22206. 1341.08 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  22207. 1341.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22208. 1341.08 s [algebraic-graphs] Warning: 'box' is out of scope.
  22209. 1341.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22210. 1341.08 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  22211. 1341.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22212. 1341.09 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  22213. 1341.10 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22214. 1341.10 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22215. 1341.10 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22216. 1341.10 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22217. 1341.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22218. 1341.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22219. 1341.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22220. 1341.10 s [algebraic-graphs] Warning: 'nub' is out of scope.
  22221. 1341.10 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22222. 1341.11 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  22223. 1341.11 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  22224. 1341.11 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  22225. 1341.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22226. 1341.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22227. 1341.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  22228. 1341.12 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  22229. 1341.13 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  22230. 1341.13 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22231. 1341.13 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  22232. 1341.13 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  22233. 1341.13 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  22234. 1341.13 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22235. 1341.13 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22236. 1341.13 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  22237. 1341.13 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22238. 1341.13 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22239. 1341.13 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22240. 1341.13 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22241. 1341.13 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22242. 1341.13 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22243. 1341.14 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  22244. 1341.14 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  22245. 1341.14 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  22246. 1341.14 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  22247. 1341.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22248. 1341.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22249. 1341.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  22250. 1341.14 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  22251. 1341.14 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  22252. 1341.14 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  22253. 1341.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22254. 1341.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22255. 1341.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  22256. 1341.14 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  22257. 1341.14 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  22258. 1341.14 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  22259. 1341.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22260. 1341.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22261. 1341.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  22262. 1341.14 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  22263. 1341.14 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  22264. 1341.14 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  22265. 1341.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22266. 1341.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22267. 1341.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  22268. 1341.14 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  22269. 1341.14 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  22270. 1341.14 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  22271. 1341.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22272. 1341.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22273. 1341.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  22274. 1341.14 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  22275. 1341.15 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  22276. 1341.15 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  22277. 1341.15 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  22278. 1341.15 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22279. 1341.15 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22280. 1341.15 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  22281. 1341.15 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  22282. 1341.15 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22283. 1341.15 s [algebraic-graphs] Warning: 'empty' is out of scope.
  22284. 1341.15 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22285. 1341.15 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  22286. 1341.15 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22287. 1341.15 s [algebraic-graphs] Warning: 'edges' is out of scope.
  22288. 1341.15 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22289. 1341.16 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  22290. 1341.16 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22291. 1341.16 s [algebraic-graphs] Warning: 'stars' is out of scope.
  22292. 1341.16 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22293. 1341.16 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  22294. 1341.17 s [algebraic-graphs] Warning: 'nub' is out of scope.
  22295. 1341.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22296. 1341.17 s [algebraic-graphs] Warning: 'sort' is out of scope.
  22297. 1341.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22298. 1341.17 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  22299. 1341.17 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22300. 1341.17 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  22301. 1341.17 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22302. 1341.17 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22303. 1341.17 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  22304. 1341.17 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  22305. 1341.17 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  22306. 1341.17 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  22307. 1341.17 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22308. 1341.17 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22309. 1341.17 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  22310. 1341.18 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  22311. 1341.18 s [algebraic-graphs] Missing documentation for:
  22312. 1341.18 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  22313. 1341.18 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22314. 1341.18 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  22315. 1341.18 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22316. 1341.18 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22317. 1341.18 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22318. 1341.18 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22319. 1341.18 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  22320. 1341.18 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  22321. 1341.18 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22322. 1341.18 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22323. 1341.18 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22324. 1341.18 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22325. 1341.18 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  22326. 1341.18 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  22327. 1341.18 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  22328. 1341.18 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22329. 1341.18 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22330. 1341.18 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  22331. 1341.18 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  22332. 1341.18 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  22333. 1341.18 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  22334. 1341.18 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22335. 1341.18 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22336. 1341.18 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  22337. 1341.19 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  22338. 1341.19 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  22339. 1341.19 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  22340. 1341.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22341. 1341.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22342. 1341.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  22343. 1341.19 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  22344. 1341.20 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  22345. 1341.20 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  22346. 1341.20 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  22347. 1341.20 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22348. 1341.20 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22349. 1341.20 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  22350. 1341.20 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  22351. 1341.20 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  22352. 1341.20 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  22353. 1341.20 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  22354. 1341.20 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22355. 1341.20 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22356. 1341.20 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  22357. 1341.21 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22358. 1341.21 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  22359. 1341.21 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22360. 1341.21 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22361. 1341.21 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22362. 1341.21 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  22363. 1341.21 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  22364. 1341.21 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22365. 1341.22 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  22366. 1341.22 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  22367. 1341.22 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  22368. 1341.22 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  22369. 1341.22 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22370. 1341.22 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22371. 1341.22 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  22372. 1341.22 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  22373. 1341.22 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  22374. 1341.22 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  22375. 1341.22 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22376. 1341.22 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22377. 1341.22 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  22378. 1341.23 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22379. 1341.23 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  22380. 1341.23 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22381. 1341.23 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22382. 1341.23 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22383. 1341.23 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  22384. 1341.24 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  22385. 1341.24 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  22386. 1341.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22387. 1341.25 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  22388. 1341.26 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22389. 1341.26 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  22390. 1341.26 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22391. 1341.26 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22392. 1341.26 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22393. 1341.26 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  22394. 1341.26 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  22395. 1341.26 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  22396. 1341.26 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  22397. 1341.26 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22398. 1341.26 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22399. 1341.26 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  22400. 1341.27 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  22401. 1341.27 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  22402. 1341.27 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  22403. 1341.27 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  22404. 1341.27 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22405. 1341.27 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22406. 1341.27 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  22407. 1341.27 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22408. 1341.27 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  22409. 1341.27 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22410. 1341.27 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22411. 1341.27 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22412. 1341.27 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  22413. 1341.28 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  22414. 1341.28 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  22415. 1341.28 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  22416. 1341.28 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22417. 1341.28 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22418. 1341.28 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  22419. 1341.29 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  22420. 1341.29 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  22421. 1341.29 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  22422. 1341.29 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  22423. 1341.29 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  22424. 1341.29 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  22425. 1341.29 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22426. 1341.29 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22427. 1341.29 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  22428. 1341.29 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  22429. 1341.29 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  22430. 1341.29 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  22431. 1341.29 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  22432. 1341.29 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22433. 1341.29 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22434. 1341.29 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  22435. 1341.30 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  22436. 1341.30 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22437. 1341.30 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  22438. 1341.31 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22439. 1341.31 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  22440. 1341.31 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22441. 1341.31 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22442. 1341.31 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22443. 1341.31 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  22444. 1341.32 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  22445. 1341.42 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  22446. 1341.42 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  22447. 1341.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  22448. 1341.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  22449. 1341.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22450. 1341.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22451. 1341.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  22452. 1341.42 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  22453. 1341.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22454. 1341.42 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  22455. 1341.42 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  22456. 1341.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  22457. 1341.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  22458. 1341.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22459. 1341.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22460. 1341.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  22461. 1341.42 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  22462. 1341.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22463. 1341.42 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  22464. 1341.42 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  22465. 1341.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  22466. 1341.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  22467. 1341.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22468. 1341.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22469. 1341.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  22470. 1341.43 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  22471. 1341.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22472. 1341.43 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  22473. 1341.43 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  22474. 1341.43 s [algebraic-graphs] Missing documentation for:
  22475. 1341.43 s [algebraic-graphs] Module header
  22476. 1341.43 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  22477. 1341.43 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  22478. 1341.43 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  22479. 1341.43 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  22480. 1341.43 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  22481. 1341.43 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  22482. 1341.43 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  22483. 1341.43 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  22484. 1341.43 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  22485. 1341.43 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  22486. 1341.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22487. 1341.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22488. 1341.43 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  22489. 1341.43 s [algebraic-graphs] Warning: 'array' is out of scope.
  22490. 1341.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22491. 1341.43 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  22492. 1341.43 s [algebraic-graphs] Missing documentation for:
  22493. 1341.43 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  22494. 1341.67 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  22495. 1341.67 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  22496. 1341.67 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  22497. 1341.67 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  22498. 1341.69 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  22499. 1341.69 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  22500. 1341.70 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  22501. 1341.70 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  22502. 1341.70 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  22503. 1341.71 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  22504. 1341.71 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  22505. 1341.72 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  22506. 1341.72 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  22507. 1341.75 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  22508. 1341.75 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  22509. 1341.76 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  22510. 1341.76 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  22511. 1341.77 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  22512. 1341.77 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  22513. 1348.45 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  22514. 1348.45 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  22515. 1348.52 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  22516. 1348.53 s [algebraic-graphs] Phase: installPhase
  22517. 1348.63 s [algebraic-graphs] Installing library in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22518. 1349.47 s [algebraic-graphs] Phase: fixupPhase
  22519. 1349.50 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7
  22520. 1349.52 s [algebraic-graphs] shrinking /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSalgebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW-ghc9.10.3.so
  22521. 1349.53 s [algebraic-graphs] checking for references to /build/ in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7...
  22522. 1349.58 s [algebraic-graphs] patching script interpreter paths in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7
  22523. 1349.58 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib
  22524. 1350.00 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc
  22525. 1350.02 s [algebraic-graphs] checking for references to /build/ in /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc...
  22526. 1350.06 s [algebraic-graphs] patching script interpreter paths in /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc
  22527. 1350.27 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7 /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc
  22528. 1350.76 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  22529. 1350.78 s [post-build-hook] Uploading to the NixCI cache: /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7 /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc
  22530. 1350.83 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22531. 1350.99 s [post-build-hook] copying 1 paths...
  22532. 1350.99 s [post-build-hook] copying path '/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  22533. 1359.47 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22534. 1359.61 s [post-build-hook] copying 0 paths...
  22535. 1359.64 s Progress: 14 of 19 built, 193 of 193 downloaded from cache
  22536. 1359.72 s Building algebraic-graph-duoids
  22537. 1359.89 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  22538. 1359.89 s [algebraic-graph-duoids] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  22539. 1360.22 s [algebraic-graph-duoids] Phase: unpackPhase
  22540. 1360.23 s [algebraic-graph-duoids] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./algebraic-graphs
  22541. 1360.32 s [algebraic-graph-duoids] source root is algebraic-graphs
  22542. 1360.33 s [algebraic-graph-duoids] Phase: patchPhase
  22543. 1360.34 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  22544. 1360.35 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.vpwI7S5bEi/setup-package.conf.d -threaded
  22545. 1360.42 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.vpwI7S5bEi/Main.o )
  22546. 1360.50 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  22547. 1362.20 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  22548. 1362.21 s [algebraic-graph-duoids] Phase: configurePhase
  22549. 1362.22 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.vpwI7S5bEi/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  22550. 1362.23 s [algebraic-graph-duoids] Using Parsec parser
  22551. 1362.23 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  22552. 1362.68 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  22553. 1363.04 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  22554. 1363.04 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  22555. 1363.04 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  22556. 1363.04 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  22557. 1363.04 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  22558. 1363.04 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  22559. 1363.04 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  22560. 1363.04 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  22561. 1363.04 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  22562. 1363.04 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  22563. 1363.04 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  22564. 1363.04 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  22565. 1363.04 s [algebraic-graph-duoids] hedgehog-1.5
  22566. 1363.04 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  22567. 1363.04 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  22568. 1363.04 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  22569. 1363.04 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  22570. 1363.04 s [algebraic-graph-duoids] <0.25: using doctest-0.24.2
  22571. 1363.04 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  22572. 1363.04 s [algebraic-graph-duoids] Source component graph:
  22573. 1363.04 s [algebraic-graph-duoids] component lib
  22574. 1363.04 s [algebraic-graph-duoids] component test:doctests dependency lib
  22575. 1363.04 s [algebraic-graph-duoids] component test:laws dependency lib
  22576. 1363.04 s [algebraic-graph-duoids] Configured component graph:
  22577. 1363.04 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22578. 1363.04 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22579. 1363.04 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22580. 1363.04 s [algebraic-graph-duoids] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  22581. 1363.04 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22582. 1363.04 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-BCBiHvpUmmaDfl9bHiyWkI-doctests
  22583. 1363.04 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22584. 1363.04 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22585. 1363.04 s [algebraic-graph-duoids] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  22586. 1363.04 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22587. 1363.04 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-IjWb2oI1gcnJxK84yFuagh-laws
  22588. 1363.04 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22589. 1363.04 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22590. 1363.04 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22591. 1363.04 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  22592. 1363.04 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22593. 1363.04 s [algebraic-graph-duoids] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  22594. 1363.04 s [algebraic-graph-duoids] Linked component graph:
  22595. 1363.04 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22596. 1363.04 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22597. 1363.04 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22598. 1363.04 s [algebraic-graph-duoids] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  22599. 1363.04 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22600. 1363.04 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI:Algebra.Graph.Duoid.Orphans
  22601. 1363.04 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-BCBiHvpUmmaDfl9bHiyWkI-doctests
  22602. 1363.04 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22603. 1363.04 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22604. 1363.04 s [algebraic-graph-duoids] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  22605. 1363.04 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22606. 1363.04 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-IjWb2oI1gcnJxK84yFuagh-laws
  22607. 1363.04 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22608. 1363.04 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22609. 1363.04 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22610. 1363.04 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  22611. 1363.04 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22612. 1363.04 s [algebraic-graph-duoids] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  22613. 1363.04 s [algebraic-graph-duoids] Ready component graph:
  22614. 1363.04 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22615. 1363.04 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22616. 1363.04 s [algebraic-graph-duoids] depends base-4.20.2.0-acb8
  22617. 1363.04 s [algebraic-graph-duoids] depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  22618. 1363.04 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22619. 1363.04 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-IjWb2oI1gcnJxK84yFuagh-laws
  22620. 1363.04 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22621. 1363.04 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22622. 1363.04 s [algebraic-graph-duoids] depends base-4.20.2.0-acb8
  22623. 1363.04 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  22624. 1363.04 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22625. 1363.04 s [algebraic-graph-duoids] depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  22626. 1363.04 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-BCBiHvpUmmaDfl9bHiyWkI-doctests
  22627. 1363.04 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22628. 1363.04 s [algebraic-graph-duoids] depends base-4.20.2.0-acb8
  22629. 1363.04 s [algebraic-graph-duoids] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  22630. 1363.04 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22631. 1363.04 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  22632. 1363.04 s [algebraic-graph-duoids] Using compiler: ghc-9.10.3
  22633. 1363.04 s [algebraic-graph-duoids] Using install prefix:
  22634. 1363.04 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
  22635. 1363.04 s [algebraic-graph-duoids] Executables installed in:
  22636. 1363.04 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/bin
  22637. 1363.04 s [algebraic-graph-duoids] Libraries installed in:
  22638. 1363.04 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22639. 1363.04 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  22640. 1363.04 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  22641. 1363.04 s [algebraic-graph-duoids] Private executables installed in:
  22642. 1363.04 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0
  22643. 1363.04 s [algebraic-graph-duoids] Data files installed in:
  22644. 1363.04 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0
  22645. 1363.04 s [algebraic-graph-duoids] Documentation installed in:
  22646. 1363.04 s [algebraic-graph-duoids] /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  22647. 1363.04 s [algebraic-graph-duoids] Configuration files installed in:
  22648. 1363.04 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/etc
  22649. 1363.04 s [algebraic-graph-duoids] No alex found
  22650. 1363.04 s [algebraic-graph-duoids] Using ar found on system at:
  22651. 1363.04 s [algebraic-graph-duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  22652. 1363.04 s [algebraic-graph-duoids] No c2hs found
  22653. 1363.04 s [algebraic-graph-duoids] No cpphs found
  22654. 1363.04 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  22655. 1363.04 s [algebraic-graph-duoids] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  22656. 1363.04 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  22657. 1363.04 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  22658. 1363.04 s [algebraic-graph-duoids] Using ghc version 9.10.3 found on system at:
  22659. 1363.04 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  22660. 1363.04 s [algebraic-graph-duoids] Using ghc-pkg version 9.10.3 found on system at:
  22661. 1363.04 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  22662. 1363.04 s [algebraic-graph-duoids] No ghcjs found
  22663. 1363.04 s [algebraic-graph-duoids] No ghcjs-pkg found
  22664. 1363.04 s [algebraic-graph-duoids] No greencard found
  22665. 1363.04 s [algebraic-graph-duoids] Using haddock version 2.31.1 found on system at:
  22666. 1363.04 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  22667. 1363.04 s [algebraic-graph-duoids] No happy found
  22668. 1363.04 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  22669. 1363.04 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  22670. 1363.04 s [algebraic-graph-duoids] No hmake found
  22671. 1363.04 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  22672. 1363.04 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  22673. 1363.04 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  22674. 1363.04 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  22675. 1363.04 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  22676. 1363.04 s [algebraic-graph-duoids] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  22677. 1363.04 s [algebraic-graph-duoids] No jhc found
  22678. 1363.04 s [algebraic-graph-duoids] Using ld found on system at:
  22679. 1363.04 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  22680. 1363.04 s [algebraic-graph-duoids] No pkg-config found
  22681. 1363.04 s [algebraic-graph-duoids] Using runghc version 9.10.3 found on system at:
  22682. 1363.04 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  22683. 1363.04 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  22684. 1363.04 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  22685. 1363.04 s [algebraic-graph-duoids] Using tar found on system at:
  22686. 1363.04 s [algebraic-graph-duoids] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  22687. 1363.04 s [algebraic-graph-duoids] No uhc found
  22688. 1363.28 s [algebraic-graph-duoids] Phase: buildPhase
  22689. 1363.42 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  22690. 1363.42 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  22691. 1363.62 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.o, dist/build/Algebra/Graph/Duoid.dyn_o )
  22692. 1364.11 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.o, dist/build/Algebra/Graph/Duoid/Orphans.dyn_o )
  22693. 1365.22 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  22694. 1365.80 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.p_o )
  22695. 1374.33 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22696. 1374.33 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22697. 1374.53 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  22698. 1375.90 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  22699. 1377.20 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22700. 1377.20 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22701. 1377.42 s [algebraic-graph-duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  22702. 1377.96 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  22703. 1378.72 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  22704. 1383.49 s [algebraic-graph-duoids] Phase: checkPhase
  22705. 1383.82 s [algebraic-graph-duoids] Running 2 test suites...
  22706. 1383.82 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  22707. 1383.96 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  22708. 1383.96 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  22709. 1383.96 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  22710. 1383.96 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  22711. 1383.96 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  22712. 1383.96 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  22713. 1383.96 s [algebraic-graph-duoids] ✓ 5 succeeded.
  22714. 1383.96 s [algebraic-graph-duoids] Test suite laws: PASS
  22715. 1383.96 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  22716. 1383.96 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  22717. 1384.74 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  22718. 1384.79 s [algebraic-graph-duoids] NameLib Nothing
  22719. 1384.79 s [algebraic-graph-duoids] ----------------------------------------
  22720. 1384.80 s [algebraic-graph-duoids] Test suite doctests: PASS
  22721. 1384.80 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  22722. 1384.80 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  22723. 1384.81 s [algebraic-graph-duoids] Phase: haddockPhase
  22724. 1385.21 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  22725. 1385.21 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  22726. 1385.74 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
  22727. 1386.45 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
  22728. 1386.59 s [algebraic-graph-duoids] Haddock coverage:
  22729. 1386.59 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  22730. 1386.59 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  22731. 1399.20 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  22732. 1399.20 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  22733. 1399.27 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22734. 1399.27 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22735. 1399.29 s [algebraic-graph-duoids] Phase: installPhase
  22736. 1399.37 s [algebraic-graph-duoids] Installing library in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22737. 1399.75 s [algebraic-graph-duoids] Phase: fixupPhase
  22738. 1399.77 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
  22739. 1399.78 s [algebraic-graph-duoids] shrinking /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSalgebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI-ghc9.10.3.so
  22740. 1399.78 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0...
  22741. 1399.81 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
  22742. 1399.81 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib
  22743. 1399.86 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc
  22744. 1399.87 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc...
  22745. 1399.89 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc
  22746. 1400.07 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
  22747. 1400.56 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  22748. 1400.59 s [post-build-hook] Uploading to the NixCI cache: /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
  22749. 1400.63 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22750. 1400.65 s [post-build-hook] copying 2 paths...
  22751. 1400.65 s [post-build-hook] copying path '/nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  22752. 1400.86 s [post-build-hook] copying path '/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  22753. 1401.47 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22754. 1401.62 s [post-build-hook] copying 0 paths...
  22755. 1401.64 s Progress: 15 of 19 built, 193 of 193 downloaded from cache
  22756. 1401.71 s Building ghc-9.10.3-with-packages
  22757. 1401.78 s [ghc-9.10.3-with-packages] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/nix-support:
  22758. 1401.78 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22759. 1401.79 s [ghc-9.10.3-with-packages] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/nix-support:
  22760. 1401.79 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22761. 1401.80 s [ghc-9.10.3-with-packages] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/nix-support:
  22762. 1401.80 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22763. 1401.80 s [ghc-9.10.3-with-packages] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/nix-support:
  22764. 1401.80 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22765. 1401.81 s [ghc-9.10.3-with-packages] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/nix-support:
  22766. 1401.81 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22767. 1401.81 s [ghc-9.10.3-with-packages] /nix/store/q9bmv83s4921kh6z965q0v2glgm742gx-ghc-compat-plugin-0.1.0.1/nix-support:
  22768. 1401.81 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22769. 1401.81 s [ghc-9.10.3-with-packages] /nix/store/q9bmv83s4921kh6z965q0v2glgm742gx-ghc-compat-plugin-0.1.0.1/nix-support:
  22770. 1401.81 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22771. 1401.82 s [ghc-9.10.3-with-packages] /nix/store/6s0czylb98l3w1dfdbw1lz6d0xz5dik2-hedgehog-1.5/nix-support:
  22772. 1401.82 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22773. 1401.82 s [ghc-9.10.3-with-packages] /nix/store/6s0czylb98l3w1dfdbw1lz6d0xz5dik2-hedgehog-1.5/nix-support:
  22774. 1401.82 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22775. 1401.83 s [ghc-9.10.3-with-packages] /nix/store/yv1515y35b5d87px2xnywdrzl57bzj36-ansi-terminal-1.1.3/nix-support:
  22776. 1401.83 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22777. 1401.83 s [ghc-9.10.3-with-packages] /nix/store/yv1515y35b5d87px2xnywdrzl57bzj36-ansi-terminal-1.1.3/nix-support:
  22778. 1401.83 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22779. 1401.83 s [ghc-9.10.3-with-packages] /nix/store/sjm0zblwxqfdk46ck7qrjg10f19k2b3q-async-2.2.5/nix-support:
  22780. 1401.83 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22781. 1401.83 s [ghc-9.10.3-with-packages] /nix/store/sjm0zblwxqfdk46ck7qrjg10f19k2b3q-async-2.2.5/nix-support:
  22782. 1401.83 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22783. 1401.83 s [ghc-9.10.3-with-packages] /nix/store/mrh8y1rc5sfl36wh0q014barx02dk48a-barbies-2.1.1.0/nix-support:
  22784. 1401.83 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22785. 1401.84 s [ghc-9.10.3-with-packages] /nix/store/mrh8y1rc5sfl36wh0q014barx02dk48a-barbies-2.1.1.0/nix-support:
  22786. 1401.84 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22787. 1401.85 s [ghc-9.10.3-with-packages] /nix/store/nwqnn7mc9y6m6qhlf4b04dm8b694ihir-concurrent-output-1.10.21/nix-support:
  22788. 1401.85 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22789. 1401.85 s [ghc-9.10.3-with-packages] /nix/store/nwqnn7mc9y6m6qhlf4b04dm8b694ihir-concurrent-output-1.10.21/nix-support:
  22790. 1401.85 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22791. 1401.86 s [ghc-9.10.3-with-packages] /nix/store/c0kvhsdh044cby9s385kdp6fzrwnx0b2-lifted-async-0.10.2.7/nix-support:
  22792. 1401.86 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22793. 1401.86 s [ghc-9.10.3-with-packages] /nix/store/c0kvhsdh044cby9s385kdp6fzrwnx0b2-lifted-async-0.10.2.7/nix-support:
  22794. 1401.86 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22795. 1401.86 s [ghc-9.10.3-with-packages] /nix/store/88zzrq6z3q2i7raa4bqrfzp2xm1spfzs-mmorph-1.2.1/nix-support:
  22796. 1401.86 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22797. 1401.86 s [ghc-9.10.3-with-packages] /nix/store/88zzrq6z3q2i7raa4bqrfzp2xm1spfzs-mmorph-1.2.1/nix-support:
  22798. 1401.86 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22799. 1401.86 s [ghc-9.10.3-with-packages] /nix/store/g2qvb2hxv61dkd7kcwl314bfkn49w353-monad-control-1.0.3.1/nix-support:
  22800. 1401.86 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22801. 1401.87 s [ghc-9.10.3-with-packages] /nix/store/g2qvb2hxv61dkd7kcwl314bfkn49w353-monad-control-1.0.3.1/nix-support:
  22802. 1401.87 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22803. 1401.87 s [ghc-9.10.3-with-packages] /nix/store/6cndgccwks6pzgpp40sd3yqj1gwrwcpc-pretty-show-1.10/nix-support:
  22804. 1401.87 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22805. 1401.87 s [ghc-9.10.3-with-packages] /nix/store/6cndgccwks6pzgpp40sd3yqj1gwrwcpc-pretty-show-1.10/nix-support:
  22806. 1401.87 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22807. 1401.87 s [ghc-9.10.3-with-packages] /nix/store/cbkpv0a2jd34ji7dmwlcs5079p09clw9-primitive-0.9.1.0/nix-support:
  22808. 1401.87 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22809. 1401.88 s [ghc-9.10.3-with-packages] /nix/store/cbkpv0a2jd34ji7dmwlcs5079p09clw9-primitive-0.9.1.0/nix-support:
  22810. 1401.88 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22811. 1401.88 s [ghc-9.10.3-with-packages] /nix/store/8l34z8pqyxz1a375p2mjy2x9pl7qwv9j-random-1.2.1.3/nix-support:
  22812. 1401.88 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22813. 1401.88 s [ghc-9.10.3-with-packages] /nix/store/8l34z8pqyxz1a375p2mjy2x9pl7qwv9j-random-1.2.1.3/nix-support:
  22814. 1401.88 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22815. 1401.88 s [ghc-9.10.3-with-packages] /nix/store/h9ngfa8xz6vn23w9hbg6hfcciqp1618a-resourcet-1.3.0/nix-support:
  22816. 1401.88 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22817. 1401.89 s [ghc-9.10.3-with-packages] /nix/store/h9ngfa8xz6vn23w9hbg6hfcciqp1618a-resourcet-1.3.0/nix-support:
  22818. 1401.89 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22819. 1401.89 s [ghc-9.10.3-with-packages] /nix/store/7vn9fv3b7f0ajmhrb61h3cnsym1y3n3f-safe-exceptions-0.1.7.4/nix-support:
  22820. 1401.89 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22821. 1401.89 s [ghc-9.10.3-with-packages] /nix/store/7vn9fv3b7f0ajmhrb61h3cnsym1y3n3f-safe-exceptions-0.1.7.4/nix-support:
  22822. 1401.89 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22823. 1401.89 s [ghc-9.10.3-with-packages] /nix/store/na9f6zzz8s1k6g1id7dcffl0gi7r7cjj-transformers-base-0.4.6/nix-support:
  22824. 1401.89 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22825. 1401.90 s [ghc-9.10.3-with-packages] /nix/store/na9f6zzz8s1k6g1id7dcffl0gi7r7cjj-transformers-base-0.4.6/nix-support:
  22826. 1401.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22827. 1401.90 s [ghc-9.10.3-with-packages] /nix/store/25k1v3pwwy7x5gym9q9dhviv0csxvvmn-wl-pprint-annotated-0.1.0.1/nix-support:
  22828. 1401.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22829. 1401.90 s [ghc-9.10.3-with-packages] /nix/store/25k1v3pwwy7x5gym9q9dhviv0csxvvmn-wl-pprint-annotated-0.1.0.1/nix-support:
  22830. 1401.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22831. 1401.90 s [ghc-9.10.3-with-packages] /nix/store/8gj8b8i9s12rdfbqmdph9s03wnpqh44d-ansi-terminal-types-1.1.3/nix-support:
  22832. 1401.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22833. 1401.90 s [ghc-9.10.3-with-packages] /nix/store/8gj8b8i9s12rdfbqmdph9s03wnpqh44d-ansi-terminal-types-1.1.3/nix-support:
  22834. 1401.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22835. 1401.91 s [ghc-9.10.3-with-packages] /nix/store/m2gbv27qwdgpizs36ysfzkc543z73msp-hashable-1.5.0.0/nix-support:
  22836. 1401.91 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22837. 1401.92 s [ghc-9.10.3-with-packages] /nix/store/m2gbv27qwdgpizs36ysfzkc543z73msp-hashable-1.5.0.0/nix-support:
  22838. 1401.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22839. 1401.92 s [ghc-9.10.3-with-packages] /nix/store/k735nrbnq1v6hqj9l4aqf84zvqnc17fb-distributive-0.6.2.1/nix-support:
  22840. 1401.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22841. 1401.92 s [ghc-9.10.3-with-packages] /nix/store/k735nrbnq1v6hqj9l4aqf84zvqnc17fb-distributive-0.6.2.1/nix-support:
  22842. 1401.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22843. 1401.93 s [ghc-9.10.3-with-packages] /nix/store/qlaran7276vq5yfddk8gjyb0bbl7463d-constraints-0.14.2/nix-support:
  22844. 1401.93 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22845. 1401.93 s [ghc-9.10.3-with-packages] /nix/store/qlaran7276vq5yfddk8gjyb0bbl7463d-constraints-0.14.2/nix-support:
  22846. 1401.93 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22847. 1401.93 s [ghc-9.10.3-with-packages] /nix/store/anslqcpw3nb5ij1vvfxxqb4m5q9x9jkp-lifted-base-0.2.3.12/nix-support:
  22848. 1401.93 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22849. 1401.94 s [ghc-9.10.3-with-packages] /nix/store/anslqcpw3nb5ij1vvfxxqb4m5q9x9jkp-lifted-base-0.2.3.12/nix-support:
  22850. 1401.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22851. 1401.94 s [ghc-9.10.3-with-packages] /nix/store/yf7r6nnmfc4mwj08iavfcxpp70mj6mkq-transformers-compat-0.7.2/nix-support:
  22852. 1401.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22853. 1401.94 s [ghc-9.10.3-with-packages] /nix/store/yf7r6nnmfc4mwj08iavfcxpp70mj6mkq-transformers-compat-0.7.2/nix-support:
  22854. 1401.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22855. 1401.95 s [ghc-9.10.3-with-packages] /nix/store/v6jdycf0p0gypqgg67hc7k45i6p25cwj-splitmix-0.1.3.1/nix-support:
  22856. 1401.95 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22857. 1401.95 s [ghc-9.10.3-with-packages] /nix/store/v6jdycf0p0gypqgg67hc7k45i6p25cwj-splitmix-0.1.3.1/nix-support:
  22858. 1401.95 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22859. 1401.95 s [ghc-9.10.3-with-packages] /nix/store/3d0qs4aijgblg7mvsxzr2b168hmncirn-unliftio-core-0.2.1.0/nix-support:
  22860. 1401.95 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22861. 1401.96 s [ghc-9.10.3-with-packages] /nix/store/3d0qs4aijgblg7mvsxzr2b168hmncirn-unliftio-core-0.2.1.0/nix-support:
  22862. 1401.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22863. 1401.96 s [ghc-9.10.3-with-packages] /nix/store/kspxaj152b3jyd5yfwmkb8fi5l571rms-base-orphans-0.9.3/nix-support:
  22864. 1401.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22865. 1401.96 s [ghc-9.10.3-with-packages] /nix/store/kspxaj152b3jyd5yfwmkb8fi5l571rms-base-orphans-0.9.3/nix-support:
  22866. 1401.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22867. 1401.96 s [ghc-9.10.3-with-packages] /nix/store/c1ickhy1b9cnskfyjr6bhh9xbczy60w0-tagged-0.8.9/nix-support:
  22868. 1401.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22869. 1401.97 s [ghc-9.10.3-with-packages] /nix/store/c1ickhy1b9cnskfyjr6bhh9xbczy60w0-tagged-0.8.9/nix-support:
  22870. 1401.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22871. 1401.97 s [ghc-9.10.3-with-packages] /nix/store/rwvnxl3wi6qdd2mffsl3rymh0infb7nh-boring-0.2.2/nix-support:
  22872. 1401.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22873. 1401.97 s [ghc-9.10.3-with-packages] /nix/store/rwvnxl3wi6qdd2mffsl3rymh0infb7nh-boring-0.2.2/nix-support:
  22874. 1401.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22875. 1402.97 s [ghc-9.10.3-with-packages] Warning: include-dirs: /nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages/lib/ghc-9.10.3/lib/../lib/x86_64-linux-ghc-9.10.3/directory-1.3.8.5-e377/include doesn't exist or isn't a directory
  22876. 1404.11 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages
  22877. 1404.66 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  22878. 1404.74 s [post-build-hook] Uploading to the NixCI cache: /nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages
  22879. 1404.74 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22880. 1404.84 s [post-build-hook] copying 0 paths...
  22881. 1404.91 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22882. 1405.05 s [post-build-hook] copying 0 paths...
  22883. 1405.07 s Progress: 16 of 18 built, 193 of 193 downloaded from cache
  22884. 1405.14 s Building all-packages
  22885. 1405.30 s [all-packages] created 3 symlinks in user environment
  22886. 1405.34 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/ixzvjr63jxyv2qcimlscx110zhfd5s9a-all-packages
  22887. 1405.85 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  22888. 1405.87 s [post-build-hook] Uploading to the NixCI cache: /nix/store/ixzvjr63jxyv2qcimlscx110zhfd5s9a-all-packages
  22889. 1405.92 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22890. 1406.02 s [post-build-hook] copying 0 paths...
  22891. 1406.09 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22892. 1406.26 s [post-build-hook] copying 0 paths...
  22893. 1406.29 s Progress: 17 of 18 built, 193 of 193 downloaded from cache
Tail Raw Logs