1. 0.13 s $ /nix/store/9ypz3flqsrl5xl495mm8h645gadjsxi1-coreutils-9.11/bin/timeout --kill-after=15s 7200s /nix/store/23zk8sgzamrbmj1fday15szf7f2279s8-nix-2.34.7/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --log-format internal-json build --no-link --print-out-paths git+https://github.com/sellout/duoids?ref=do-helpers&rev=4415bc17d6e7dc493e0ba036c397559d9b43477f#packages.x86_64-linux.ghc9101_all --print-build-logs
  2. 0.17 s warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
  3. 0.17 s Pass '--accept-flake-config' to trust it
  4. 0.17 s warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
  5. 0.17 s Pass '--accept-flake-config' to trust it
  6. 0.17 s warning: ignoring untrusted flake configuration setting 'extra-substituters'.
  7. 0.17 s Pass '--accept-flake-config' to trust it
  8. 0.17 s warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
  9. 0.17 s Pass '--accept-flake-config' to trust it
  10. 0.17 s warning: ignoring untrusted flake configuration setting 'sandbox'.
  11. 0.17 s Pass '--accept-flake-config' to trust it
  12. 0.17 s warning: ignoring untrusted flake configuration setting 'use-registries'.
  13. 0.17 s Pass '--accept-flake-config' to trust it
  14. 0.85 s error (ignored): SQLite database '/var/cache/nix-ci-worker/eval-cache-v6/332ac380fc21d537dd399ae00234081c7a9833ea642f2fa8bbeeaa4b8bf81126.sqlite' is busy
  15. 2.89 s
  16. 7.84 s Downloading cached libxcrypt from https://cache.nix-ci.com
  17. 7.84 s Downloading cached colour-2.3.6-data from https://cache.nix-ci.com
  18. 7.86 s Downloading cached pretty-show-1.10-data from https://cache.nix-ci.com
  19. 7.86 s Downloading cached ghc-9.10.1-doc from https://cache.nix-ci.com
  20. 7.86 s Downloading cached die-hook from https://cache.nix-ci.com
  21. 7.86 s Downloading cached lndir from https://cache.nix-ci.com
  22. 7.91 s Building /nix/store/18xb04slazjwcsbr2ryj11rkc4ahd7yn-builder.pl.drv
  23. 7.91 s Downloading cached algebraic-graphs-0.7-r3.cabal from https://cache.nix-ci.com
  24. 7.91 s Downloading cached algebraic-graphs from https://cache.nix-ci.com
  25. 7.91 s Downloading cached hscolour from https://cache.nix-ci.com
  26. 7.92 s Downloading cached extra-1.7.16-r1.cabal from https://cache.nix-ci.com
  27. 7.92 s Downloading cached extra from https://cache.nix-ci.com
  28. 7.94 s Downloading cached quickcheck-instances-0.3.32-r1.cabal from https://cache.nix-ci.com
  29. 7.94 s Downloading cached quickcheck-instances from https://cache.nix-ci.com
  30. 7.95 s Downloading cached unordered-containers-0.2.20-r4.cabal from https://cache.nix-ci.com
  31. 7.96 s Downloading cached vector-0.13.2.0-r1.cabal from https://cache.nix-ci.com
  32. 7.96 s Downloading cached unordered-containers from https://cache.nix-ci.com
  33. 7.97 s Progress: 0 of 92 built (1 building), 1 of 155 downloaded from cache (15 downloading)
  34. 7.97 s Progress: 0 of 92 built (1 building), 2 of 155 downloaded from cache (14 downloading)
  35. 7.97 s Progress: 0 of 92 built (1 building), 3 of 155 downloaded from cache (13 downloading)
  36. 7.97 s [builder.pl] Phase: patchPhase
  37. 7.97 s Downloading cached jailbreak-cabal from https://cache.nix-ci.com
  38. 7.97 s Downloading cached nothunks-0.3.0.0-r1.cabal from https://cache.nix-ci.com
  39. 7.97 s Downloading cached nothunks from https://cache.nix-ci.com
  40. 7.98 s [builder.pl] Phase: updateAutotoolsGnuConfigScriptsPhase
  41. 7.98 s Progress: 0 of 91 built (1 building), 4 of 155 downloaded from cache (15 downloading)
  42. 7.98 s Downloading cached make-shell-wrapper-hook from https://cache.nix-ci.com
  43. 7.99 s Progress: 0 of 90 built (1 building), 5 of 155 downloaded from cache (15 downloading)
  44. 7.99 s Downloading cached perl from https://cache.nix-ci.com
  45. 8.00 s [builder.pl] Phase: configurePhase
  46. 8.00 s Progress: 0 of 89 built (1 building), 6 of 155 downloaded from cache (15 downloading)
  47. 8.00 s Downloading cached vector from https://cache.nix-ci.com
  48. 8.02 s [builder.pl] no configure script, doing nothing
  49. 8.02 s [builder.pl] Phase: buildPhase
  50. 8.03 s [builder.pl] Phase: checkPhase
  51. 8.04 s Progress: 0 of 89 built (1 building), 7 of 155 downloaded from cache (15 downloading)
  52. 8.04 s [builder.pl] Phase: installPhase
  53. 8.04 s Progress: 0 of 89 built (1 building), 8 of 155 downloaded from cache (14 downloading)
  54. 8.05 s [builder.pl] no Makefile or custom installPhase, doing nothing
  55. 8.05 s [builder.pl] Phase: fixupPhase
  56. 8.07 s Progress: 0 of 88 built (1 building), 9 of 155 downloaded from cache (13 downloading)
  57. 8.08 s [builder.pl] shrinking RPATHs of ELF executables and libraries in /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
  58. 8.08 s [builder.pl] checking for references to /build/ in /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl...
  59. 8.09 s [builder.pl] patching script interpreter paths in /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
  60. 8.09 s Progress: 0 of 87 built (1 building), 10 of 155 downloaded from cache (12 downloading)
  61. 8.10 s Progress: 0 of 86 built (1 building), 11 of 155 downloaded from cache (11 downloading)
  62. 8.18 s [builder.pl:post-build] Uploading to cachix cache "sellout": /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
  63. 8.80 s [builder.pl:post-build] Nothing to push - all store paths are already on Cachix.
  64. 8.83 s [builder.pl:post-build] Uploading to the NixCI cache: /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
  65. 8.91 s [builder.pl:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  66. 8.99 s [builder.pl:post-build] copying 0 paths...
  67. 9.10 s [builder.pl:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  68. 9.17 s [builder.pl:post-build] copying 0 paths...
  69. 9.20 s Progress: 1 of 86 built, 11 of 155 downloaded from cache (11 downloading)
  70. 9.20 s Progress: 1 of 85 built, 12 of 155 downloaded from cache (10 downloading)
  71. 9.20 s Progress: 1 of 85 built, 13 of 155 downloaded from cache (9 downloading)
  72. 9.20 s Progress: 1 of 85 built, 14 of 155 downloaded from cache (8 downloading)
  73. 9.20 s Progress: 1 of 85 built, 15 of 155 downloaded from cache (7 downloading)
  74. 9.20 s Progress: 1 of 85 built, 16 of 155 downloaded from cache (6 downloading)
  75. 9.20 s Progress: 1 of 85 built, 17 of 155 downloaded from cache (5 downloading)
  76. 9.20 s Progress: 1 of 85 built, 18 of 155 downloaded from cache (4 downloading)
  77. 9.20 s Progress: 1 of 85 built, 19 of 155 downloaded from cache (3 downloading)
  78. 9.20 s Progress: 1 of 85 built, 20 of 155 downloaded from cache (2 downloading)
  79. 9.20 s Progress: 1 of 85 built, 21 of 155 downloaded from cache (1 downloading)
  80. 19.55 s Progress: 1 of 75 built, 22 of 155 downloaded from cache
  81. 19.55 s Downloading cached Cabal-syntax-3.12.1.0-doc from https://sellout.cachix.org
  82. 19.58 s Downloading cached OneTuple-0.4.2-doc from https://cache.nix-ci.com
  83. 19.58 s Downloading cached assoc-1.1.1-doc from https://cache.nix-ci.com
  84. 19.58 s Downloading cached base-orphans-0.9.3-doc from https://cache.nix-ci.com
  85. 19.58 s Downloading cached call-stack-0.4.0-doc from https://cache.nix-ci.com
  86. 19.58 s Downloading cached clock-0.8.4-doc from https://cache.nix-ci.com
  87. 19.58 s Downloading cached code-page-0.2.1-doc from https://cache.nix-ci.com
  88. 19.58 s Downloading cached colour-2.3.6-doc from https://cache.nix-ci.com
  89. 19.58 s Downloading cached erf-2.0.0.0-doc from https://cache.nix-ci.com
  90. 19.58 s Downloading cached ghc from https://cache.nix-ci.com
  91. 19.58 s Downloading cached haskell-lexer-1.1.2-doc from https://cache.nix-ci.com
  92. 19.58 s Downloading cached inspection-testing-0.5.0.3-doc from https://cache.nix-ci.com
  93. 19.58 s Downloading cached ghc-paths-0.1.0.12-doc from https://sellout.cachix.org
  94. 19.58 s Downloading cached hashable-1.4.7.0-doc from https://cache.nix-ci.com
  95. 19.58 s Downloading cached integer-logarithms-1.0.4-doc from https://cache.nix-ci.com
  96. 19.58 s Downloading cached mmorph-1.2.0-doc from https://cache.nix-ci.com
  97. 20.01 s Progress: 1 of 74 built, 23 of 155 downloaded from cache (15 downloading)
  98. 20.01 s Downloading cached old-locale-1.0.0.7-doc from https://cache.nix-ci.com
  99. 20.51 s Progress: 1 of 74 built, 24 of 155 downloaded from cache (15 downloading)
  100. 20.51 s Downloading cached prettyprinter-1.7.1-doc from https://cache.nix-ci.com
  101. 20.52 s Progress: 1 of 74 built, 25 of 155 downloaded from cache (15 downloading)
  102. 20.52 s Downloading cached primitive-0.9.1.0-doc from https://cache.nix-ci.com
  103. 20.53 s Progress: 1 of 74 built, 26 of 155 downloaded from cache (15 downloading)
  104. 20.53 s Downloading cached HUnit-1.6.2.0-doc from https://cache.nix-ci.com
  105. 20.53 s Progress: 1 of 74 built, 27 of 155 downloaded from cache (15 downloading)
  106. 20.53 s Downloading cached safe-exceptions-0.1.7.4-doc from https://cache.nix-ci.com
  107. 20.56 s Progress: 1 of 74 built, 28 of 155 downloaded from cache (15 downloading)
  108. 20.56 s Downloading cached splitmix-0.1.1-doc from https://cache.nix-ci.com
  109. 20.56 s Progress: 1 of 74 built, 29 of 155 downloaded from cache (15 downloading)
  110. 20.56 s Downloading cached async-2.2.5-doc from https://cache.nix-ci.com
  111. 20.57 s Progress: 1 of 74 built, 30 of 155 downloaded from cache (15 downloading)
  112. 20.57 s Downloading cached Cabal-3.12.1.0-doc from https://sellout.cachix.org
  113. 20.57 s Progress: 1 of 74 built, 31 of 155 downloaded from cache (15 downloading)
  114. 20.57 s Downloading cached case-insensitive-1.2.1.0-doc from https://cache.nix-ci.com
  115. 20.58 s Progress: 1 of 74 built, 32 of 155 downloaded from cache (15 downloading)
  116. 20.58 s Downloading cached data-fix-0.3.4-doc from https://cache.nix-ci.com
  117. 20.59 s Progress: 1 of 74 built, 33 of 155 downloaded from cache (15 downloading)
  118. 20.59 s Downloading cached ansi-terminal-types-1.1-doc from https://cache.nix-ci.com
  119. 20.62 s Progress: 1 of 74 built, 34 of 155 downloaded from cache (15 downloading)
  120. 20.62 s Progress: 1 of 74 built, 35 of 155 downloaded from cache (15 downloading)
  121. 20.62 s Downloading cached syb-0.7.2.4-doc from https://cache.nix-ci.com
  122. 20.62 s Downloading cached tagged-0.8.8-doc from https://cache.nix-ci.com
  123. 20.63 s Progress: 1 of 74 built, 36 of 155 downloaded from cache (15 downloading)
  124. 20.63 s Downloading cached terminal-size-0.3.4-doc from https://cache.nix-ci.com
  125. 20.66 s Progress: 1 of 74 built, 37 of 155 downloaded from cache (15 downloading)
  126. 20.66 s Downloading cached text-short-0.1.6-doc from https://cache.nix-ci.com
  127. 21.21 s Progress: 1 of 74 built, 38 of 155 downloaded from cache (15 downloading)
  128. 21.21 s Downloading cached pretty-show-1.10-doc from https://cache.nix-ci.com
  129. 21.33 s Progress: 1 of 74 built, 39 of 155 downloaded from cache (15 downloading)
  130. 21.33 s Downloading cached old-time-1.1.0.4-doc from https://cache.nix-ci.com
  131. 21.75 s Progress: 1 of 74 built, 40 of 155 downloaded from cache (15 downloading)
  132. 21.75 s Downloading cached cabal-doctest-1.0.11-doc from https://sellout.cachix.org
  133. 21.77 s Progress: 1 of 74 built, 41 of 155 downloaded from cache (15 downloading)
  134. 21.77 s Downloading cached these-1.2.1-doc from https://cache.nix-ci.com
  135. 21.79 s Progress: 1 of 74 built, 42 of 155 downloaded from cache (15 downloading)
  136. 21.79 s Downloading cached time-compat-1.9.7-doc from https://cache.nix-ci.com
  137. 21.80 s Progress: 1 of 74 built, 43 of 155 downloaded from cache (15 downloading)
  138. 21.80 s Downloading cached scientific-0.3.8.0-doc from https://cache.nix-ci.com
  139. 21.80 s Progress: 1 of 74 built, 44 of 155 downloaded from cache (15 downloading)
  140. 21.80 s Downloading cached transformers-base-0.4.6-doc from https://cache.nix-ci.com
  141. 21.80 s Progress: 1 of 74 built, 45 of 155 downloaded from cache (15 downloading)
  142. 21.80 s Downloading cached transformers-compat-0.7.2-doc from https://cache.nix-ci.com
  143. 21.80 s Progress: 1 of 74 built, 46 of 155 downloaded from cache (15 downloading)
  144. 21.81 s Downloading cached ansi-terminal-1.1.2-doc from https://cache.nix-ci.com
  145. 21.81 s Progress: 1 of 74 built, 47 of 155 downloaded from cache (15 downloading)
  146. 21.81 s Downloading cached unliftio-core-0.2.1.0-doc from https://cache.nix-ci.com
  147. 21.82 s Progress: 1 of 74 built, 48 of 155 downloaded from cache (15 downloading)
  148. 21.82 s Downloading cached vector-stream-0.1.0.1-doc from https://cache.nix-ci.com
  149. 21.85 s Progress: 1 of 74 built, 49 of 155 downloaded from cache (15 downloading)
  150. 21.85 s Downloading cached random-1.2.1.3-doc from https://cache.nix-ci.com
  151. 21.86 s Progress: 1 of 74 built, 50 of 155 downloaded from cache (15 downloading)
  152. 21.86 s Downloading cached doctest-0.22.6-doc from https://sellout.cachix.org
  153. 21.93 s Progress: 1 of 74 built, 51 of 155 downloaded from cache (15 downloading)
  154. 21.93 s Downloading cached wherefrom-compat-0.1.1.1-doc from https://cache.nix-ci.com
  155. 21.96 s Progress: 1 of 74 built, 52 of 155 downloaded from cache (15 downloading)
  156. 21.96 s Downloading cached boring-0.2.2-doc from https://cache.nix-ci.com
  157. 22.23 s Progress: 1 of 74 built, 53 of 155 downloaded from cache (15 downloading)
  158. 22.23 s Downloading cached distributive-0.6.2.1-doc from https://cache.nix-ci.com
  159. 22.32 s Progress: 1 of 74 built, 54 of 155 downloaded from cache (15 downloading)
  160. 22.33 s Downloading cached wl-pprint-annotated-0.1.0.1-doc from https://cache.nix-ci.com
  161. 22.36 s Progress: 1 of 74 built, 55 of 155 downloaded from cache (15 downloading)
  162. 22.49 s Progress: 1 of 74 built, 56 of 155 downloaded from cache (14 downloading)
  163. 22.78 s Progress: 1 of 74 built, 57 of 155 downloaded from cache (13 downloading)
  164. 22.78 s Downloading cached strict-0.5.1-doc from https://cache.nix-ci.com
  165. 22.83 s Progress: 1 of 74 built, 58 of 155 downloaded from cache (13 downloading)
  166. 22.87 s Progress: 1 of 74 built, 59 of 155 downloaded from cache (12 downloading)
  167. 22.87 s Downloading cached monad-control-1.0.3.1-doc from https://cache.nix-ci.com
  168. 22.87 s Progress: 1 of 74 built, 60 of 155 downloaded from cache (12 downloading)
  169. 22.87 s Progress: 1 of 74 built, 61 of 155 downloaded from cache (11 downloading)
  170. 22.87 s Downloading cached resourcet-1.3.0-doc from https://cache.nix-ci.com
  171. 22.87 s Progress: 1 of 74 built, 62 of 155 downloaded from cache (11 downloading)
  172. 22.87 s Downloading cached concurrent-output-1.10.21-doc from https://cache.nix-ci.com
  173. 22.87 s Downloading cached prettyprinter-ansi-terminal-1.1.3-doc from https://cache.nix-ci.com
  174. 22.87 s Progress: 1 of 74 built, 63 of 155 downloaded from cache (12 downloading)
  175. 22.95 s Progress: 1 of 74 built, 64 of 155 downloaded from cache (11 downloading)
  176. 22.95 s Progress: 1 of 74 built, 65 of 155 downloaded from cache (10 downloading)
  177. 22.96 s Progress: 1 of 74 built, 66 of 155 downloaded from cache (9 downloading)
  178. 22.96 s Downloading cached QuickCheck-2.14.3-doc from https://cache.nix-ci.com
  179. 22.96 s Downloading cached uuid-types-1.0.6-doc from https://cache.nix-ci.com
  180. 23.01 s Progress: 1 of 74 built, 67 of 155 downloaded from cache (10 downloading)
  181. 23.02 s Downloading cached constraints-0.14.2-doc from https://cache.nix-ci.com
  182. 23.30 s Progress: 1 of 74 built, 68 of 155 downloaded from cache (10 downloading)
  183. 23.30 s Downloading cached barbies-2.1.1.0-doc from https://cache.nix-ci.com
  184. 23.46 s Progress: 1 of 74 built, 69 of 155 downloaded from cache (10 downloading)
  185. 23.94 s Progress: 1 of 74 built, 70 of 155 downloaded from cache (9 downloading)
  186. 23.95 s Progress: 1 of 74 built, 71 of 155 downloaded from cache (8 downloading)
  187. 23.95 s Progress: 1 of 74 built, 72 of 155 downloaded from cache (8 downloading)
  188. 23.95 s Downloading cached lifted-base-0.2.3.12-doc from https://cache.nix-ci.com
  189. 23.95 s Downloading cached optparse-applicative-0.18.1.0-doc from https://cache.nix-ci.com
  190. 23.98 s Progress: 1 of 74 built, 73 of 155 downloaded from cache (8 downloading)
  191. 24.00 s Progress: 1 of 74 built, 74 of 155 downloaded from cache (7 downloading)
  192. 24.06 s Progress: 1 of 74 built, 75 of 155 downloaded from cache (6 downloading)
  193. 24.08 s Progress: 1 of 74 built, 76 of 155 downloaded from cache (5 downloading)
  194. 24.08 s Downloading cached ChasingBottoms-1.3.1.15-doc from https://cache.nix-ci.com
  195. 24.13 s Progress: 1 of 74 built, 77 of 155 downloaded from cache (5 downloading)
  196. 24.46 s Progress: 1 of 74 built, 78 of 155 downloaded from cache (4 downloading)
  197. 25.11 s Progress: 1 of 74 built, 79 of 155 downloaded from cache (3 downloading)
  198. 25.14 s Downloading cached lifted-async-0.10.2.7-doc from https://cache.nix-ci.com
  199. 25.17 s Progress: 1 of 74 built, 80 of 155 downloaded from cache (3 downloading)
  200. 25.17 s Downloading cached tasty-1.5.3-doc from https://cache.nix-ci.com
  201. 25.35 s Progress: 1 of 74 built, 81 of 155 downloaded from cache (3 downloading)
  202. 26.28 s Progress: 1 of 74 built, 82 of 155 downloaded from cache (2 downloading)
  203. 26.28 s Downloading cached hedgehog-1.5-doc from https://cache.nix-ci.com
  204. 26.35 s Progress: 1 of 74 built, 83 of 155 downloaded from cache (2 downloading)
  205. 26.36 s Downloading cached tasty-hunit-0.10.2-doc from https://cache.nix-ci.com
  206. 26.36 s Downloading cached tasty-inspection-testing-0.2.1-doc from https://cache.nix-ci.com
  207. 26.36 s Downloading cached tasty-quickcheck-0.11-doc from https://cache.nix-ci.com
  208. 26.97 s Progress: 1 of 74 built, 84 of 155 downloaded from cache (4 downloading)
  209. 27.06 s Progress: 1 of 74 built, 85 of 155 downloaded from cache (3 downloading)
  210. 27.08 s Progress: 1 of 74 built, 86 of 155 downloaded from cache (2 downloading)
  211. 27.08 s Downloading cached tasty-hedgehog-1.4.0.2-doc from https://cache.nix-ci.com
  212. 27.10 s Progress: 1 of 74 built, 87 of 155 downloaded from cache (2 downloading)
  213. 27.27 s Progress: 1 of 74 built, 88 of 155 downloaded from cache (1 downloading)
  214. 47.66 s Progress: 1 of 74 built, 89 of 155 downloaded from cache
  215. 47.66 s Downloading cached clock from https://cache.nix-ci.com
  216. 47.66 s Downloading cached code-page from https://cache.nix-ci.com
  217. 47.68 s Downloading cached colour from https://cache.nix-ci.com
  218. 47.68 s Downloading cached call-stack from https://cache.nix-ci.com
  219. 47.68 s Downloading cached Cabal-syntax from https://sellout.cachix.org
  220. 47.68 s Downloading cached OneTuple from https://cache.nix-ci.com
  221. 47.68 s Downloading cached assoc from https://cache.nix-ci.com
  222. 47.68 s Downloading cached inspection-testing from https://cache.nix-ci.com
  223. 47.68 s Downloading cached haskell-lexer from https://cache.nix-ci.com
  224. 47.68 s Downloading cached ghc-paths from https://sellout.cachix.org
  225. 47.68 s Downloading cached base-orphans from https://cache.nix-ci.com
  226. 47.68 s Downloading cached erf from https://cache.nix-ci.com
  227. 47.68 s Downloading cached old-locale from https://cache.nix-ci.com
  228. 47.68 s Downloading cached hashable from https://cache.nix-ci.com
  229. 47.68 s Downloading cached integer-logarithms from https://cache.nix-ci.com
  230. 47.68 s Downloading cached prettyprinter from https://cache.nix-ci.com
  231. 47.84 s Progress: 1 of 73 built, 90 of 155 downloaded from cache (15 downloading)
  232. 47.86 s Downloading cached primitive from https://cache.nix-ci.com
  233. 47.89 s Progress: 1 of 73 built, 91 of 155 downloaded from cache (15 downloading)
  234. 47.89 s Downloading cached HUnit from https://cache.nix-ci.com
  235. 47.91 s Progress: 1 of 73 built, 92 of 155 downloaded from cache (15 downloading)
  236. 47.92 s Progress: 1 of 73 built, 93 of 155 downloaded from cache (15 downloading)
  237. 47.92 s Downloading cached safe-exceptions from https://cache.nix-ci.com
  238. 47.93 s Downloading cached splitmix from https://cache.nix-ci.com
  239. 47.93 s Progress: 1 of 72 built, 94 of 155 downloaded from cache (15 downloading)
  240. 47.93 s Downloading cached syb from https://cache.nix-ci.com
  241. 47.95 s Progress: 1 of 72 built, 95 of 155 downloaded from cache (15 downloading)
  242. 47.95 s Downloading cached old-time from https://cache.nix-ci.com
  243. 47.98 s Progress: 1 of 71 built, 96 of 155 downloaded from cache (15 downloading)
  244. 47.98 s Downloading cached tagged from https://cache.nix-ci.com
  245. 47.99 s Progress: 1 of 70 built, 97 of 155 downloaded from cache (15 downloading)
  246. 47.99 s Downloading cached terminal-size from https://cache.nix-ci.com
  247. 48.04 s Progress: 1 of 69 built, 98 of 155 downloaded from cache (15 downloading)
  248. 48.04 s Downloading cached transformers-compat from https://cache.nix-ci.com
  249. 48.06 s Progress: 1 of 69 built, 99 of 155 downloaded from cache (15 downloading)
  250. 48.06 s Downloading cached unliftio-core from https://cache.nix-ci.com
  251. 48.14 s Progress: 1 of 68 built, 100 of 155 downloaded from cache (15 downloading)
  252. 48.14 s Downloading cached ansi-terminal-types from https://cache.nix-ci.com
  253. 48.20 s Progress: 1 of 67 built, 101 of 155 downloaded from cache (15 downloading)
  254. 48.20 s Downloading cached vector-stream from https://cache.nix-ci.com
  255. 48.22 s Progress: 1 of 66 built, 102 of 155 downloaded from cache (15 downloading)
  256. 48.22 s Downloading cached wherefrom-compat from https://cache.nix-ci.com
  257. 48.24 s Progress: 1 of 65 built, 103 of 155 downloaded from cache (15 downloading)
  258. 48.24 s Downloading cached random from https://cache.nix-ci.com
  259. 48.32 s Progress: 1 of 64 built, 104 of 155 downloaded from cache (15 downloading)
  260. 48.32 s Downloading cached async from https://cache.nix-ci.com
  261. 48.37 s Progress: 1 of 63 built, 105 of 155 downloaded from cache (15 downloading)
  262. 48.37 s Downloading cached case-insensitive from https://cache.nix-ci.com
  263. 48.46 s Progress: 1 of 63 built, 106 of 155 downloaded from cache (15 downloading)
  264. 48.46 s Downloading cached data-fix from https://cache.nix-ci.com
  265. 48.48 s Progress: 1 of 62 built, 107 of 155 downloaded from cache (15 downloading)
  266. 48.48 s Progress: 1 of 62 built, 108 of 155 downloaded from cache (14 downloading)
  267. 48.48 s Progress: 1 of 62 built, 109 of 155 downloaded from cache (13 downloading)
  268. 48.48 s Downloading cached distributive from https://cache.nix-ci.com
  269. 48.48 s Downloading cached boring from https://cache.nix-ci.com
  270. 48.48 s Downloading cached doctest from https://sellout.cachix.org
  271. 48.51 s Progress: 1 of 59 built, 110 of 155 downloaded from cache (15 downloading)
  272. 48.51 s Downloading cached text-short from https://cache.nix-ci.com
  273. 48.51 s Progress: 1 of 58 built, 111 of 155 downloaded from cache (15 downloading)
  274. 48.53 s Downloading cached these from https://cache.nix-ci.com
  275. 48.57 s Progress: 1 of 57 built, 112 of 155 downloaded from cache (15 downloading)
  276. 48.57 s Downloading cached ansi-terminal from https://cache.nix-ci.com
  277. 48.60 s Progress: 1 of 56 built, 113 of 155 downloaded from cache (15 downloading)
  278. 48.60 s Downloading cached pretty-show from https://cache.nix-ci.com
  279. 48.68 s Progress: 1 of 55 built, 114 of 155 downloaded from cache (15 downloading)
  280. 48.68 s Downloading cached time-compat from https://cache.nix-ci.com
  281. 48.68 s Progress: 1 of 54 built, 115 of 155 downloaded from cache (15 downloading)
  282. 48.68 s Downloading cached resourcet from https://cache.nix-ci.com
  283. 48.68 s Progress: 1 of 53 built, 116 of 155 downloaded from cache (15 downloading)
  284. 48.69 s Downloading cached scientific from https://cache.nix-ci.com
  285. 48.74 s Progress: 1 of 52 built, 117 of 155 downloaded from cache (15 downloading)
  286. 48.74 s Downloading cached mmorph from https://cache.nix-ci.com
  287. 48.74 s Progress: 1 of 51 built, 118 of 155 downloaded from cache (15 downloading)
  288. 48.75 s Progress: 1 of 51 built, 119 of 155 downloaded from cache (14 downloading)
  289. 48.75 s Downloading cached transformers-base from https://cache.nix-ci.com
  290. 48.75 s Downloading cached wl-pprint-annotated from https://cache.nix-ci.com
  291. 48.76 s Progress: 1 of 50 built, 120 of 155 downloaded from cache (15 downloading)
  292. 48.76 s Downloading cached constraints from https://cache.nix-ci.com
  293. 48.76 s Progress: 1 of 49 built, 121 of 155 downloaded from cache (15 downloading)
  294. 48.81 s Progress: 1 of 48 built, 122 of 155 downloaded from cache (14 downloading)
  295. 48.81 s Downloading cached barbies from https://cache.nix-ci.com
  296. 48.89 s Progress: 1 of 47 built, 123 of 155 downloaded from cache (14 downloading)
  297. 49.02 s Progress: 1 of 46 built, 124 of 155 downloaded from cache (13 downloading)
  298. 49.02 s Downloading cached strict from https://cache.nix-ci.com
  299. 49.03 s Progress: 1 of 45 built, 125 of 155 downloaded from cache (13 downloading)
  300. 49.03 s Downloading cached concurrent-output from https://cache.nix-ci.com
  301. 49.03 s Progress: 1 of 44 built, 126 of 155 downloaded from cache (14 downloading)
  302. 49.03 s Downloading cached prettyprinter-ansi-terminal from https://cache.nix-ci.com
  303. 49.03 s Downloading cached monad-control from https://cache.nix-ci.com
  304. 49.04 s Progress: 1 of 43 built, 127 of 155 downloaded from cache (14 downloading)
  305. 49.05 s Progress: 1 of 42 built, 128 of 155 downloaded from cache (13 downloading)
  306. 49.06 s Progress: 1 of 41 built, 129 of 155 downloaded from cache (12 downloading)
  307. 49.13 s Progress: 1 of 40 built, 130 of 155 downloaded from cache (11 downloading)
  308. 49.15 s Downloading cached QuickCheck from https://cache.nix-ci.com
  309. 49.15 s Downloading cached uuid-types from https://cache.nix-ci.com
  310. 49.21 s Progress: 1 of 39 built, 131 of 155 downloaded from cache (12 downloading)
  311. 49.27 s Progress: 1 of 38 built, 132 of 155 downloaded from cache (11 downloading)
  312. 49.32 s Progress: 1 of 37 built, 133 of 155 downloaded from cache (10 downloading)
  313. 49.37 s Progress: 1 of 36 built, 134 of 155 downloaded from cache (9 downloading)
  314. 49.37 s Downloading cached lifted-base from https://cache.nix-ci.com
  315. 49.46 s Progress: 1 of 35 built, 135 of 155 downloaded from cache (9 downloading)
  316. 49.47 s Downloading cached optparse-applicative from https://cache.nix-ci.com
  317. 49.56 s Progress: 1 of 35 built, 136 of 155 downloaded from cache (9 downloading)
  318. 49.56 s Progress: 1 of 34 built, 137 of 155 downloaded from cache (8 downloading)
  319. 49.56 s Progress: 1 of 34 built, 138 of 155 downloaded from cache (7 downloading)
  320. 49.60 s Progress: 1 of 32 built, 139 of 155 downloaded from cache (6 downloading)
  321. 49.64 s Progress: 1 of 31 built, 140 of 155 downloaded from cache (5 downloading)
  322. 49.72 s Progress: 1 of 30 built, 141 of 155 downloaded from cache (4 downloading)
  323. 49.73 s Downloading cached lifted-async from https://cache.nix-ci.com
  324. 50.07 s Progress: 1 of 29 built, 142 of 155 downloaded from cache (4 downloading)
  325. 50.07 s Downloading cached hedgehog from https://cache.nix-ci.com
  326. 50.14 s Progress: 1 of 28 built, 143 of 155 downloaded from cache (4 downloading)
  327. 50.14 s Downloading cached ChasingBottoms from https://cache.nix-ci.com
  328. 50.15 s Progress: 1 of 27 built, 144 of 155 downloaded from cache (4 downloading)
  329. 50.15 s Downloading cached tasty from https://cache.nix-ci.com
  330. 50.48 s Progress: 1 of 27 built, 145 of 155 downloaded from cache (4 downloading)
  331. 50.59 s Progress: 1 of 26 built, 146 of 155 downloaded from cache (3 downloading)
  332. 50.60 s Progress: 1 of 25 built, 147 of 155 downloaded from cache (2 downloading)
  333. 50.60 s Downloading cached tasty-hunit from https://cache.nix-ci.com
  334. 50.60 s Downloading cached tasty-inspection-testing from https://cache.nix-ci.com
  335. 50.60 s Downloading cached tasty-quickcheck from https://cache.nix-ci.com
  336. 50.74 s Progress: 1 of 24 built, 148 of 155 downloaded from cache (4 downloading)
  337. 50.74 s Downloading cached tasty-hedgehog from https://cache.nix-ci.com
  338. 51.02 s Progress: 1 of 23 built, 149 of 155 downloaded from cache (4 downloading)
  339. 51.02 s Downloading cached Cabal from https://sellout.cachix.org
  340. 51.12 s Progress: 1 of 23 built, 150 of 155 downloaded from cache (4 downloading)
  341. 51.27 s Progress: 1 of 22 built, 151 of 155 downloaded from cache (3 downloading)
  342. 51.28 s Progress: 1 of 21 built, 152 of 155 downloaded from cache (2 downloading)
  343. 51.28 s Progress: 1 of 20 built, 153 of 155 downloaded from cache (1 downloading)
  344. 52.14 s Building /nix/store/9sdcph0ixy8mnwgybcgqawcy6bdqrkzc-vector-0.13.2.0.drv
  345. 52.31 s Progress: 1 of 19 built (1 building), 154 of 155 downloaded from cache
  346. 52.31 s Downloading cached cabal-doctest from https://sellout.cachix.org
  347. 52.41 s [vector] Phase: setupCompilerEnvironmentPhase
  348. 52.42 s [vector] Build with /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1.
  349. 52.73 s Progress: 1 of 18 built (1 building), 155 of 155 downloaded from cache
  350. 52.81 s Building /nix/store/sn9v7d5qic5j6m039azvjlm4nw1006gw-duoids-0.0.1.0.drv
  351. 52.95 s [vector] Phase: unpackPhase
  352. 52.96 s [duoids] Phase: setupCompilerEnvironmentPhase
  353. 52.97 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  354. 52.98 s [duoids] Build with /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1.
  355. 52.99 s [vector] source root is vector-0.13.2.0
  356. 53.01 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  357. 53.02 s [vector] Phase: patchPhase
  358. 53.03 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/1.cabal.
  359. 53.05 s [vector] Phase: compileBuildDriverPhase
  360. 53.06 s [vector] setupCompileFlags: -package-db=/build/tmp.BqbhsHiyOp/setup-package.conf.d -threaded
  361. 53.21 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.BqbhsHiyOp/Main.o )
  362. 53.35 s [vector] [2 of 2] Linking Setup
  363. 53.40 s [duoids] Phase: unpackPhase
  364. 53.42 s [duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./core
  365. 53.43 s [duoids] source root is core
  366. 53.46 s [duoids] Phase: patchPhase
  367. 53.49 s [duoids] Phase: compileBuildDriverPhase
  368. 53.50 s [duoids] setupCompileFlags: -package-db=/build/tmp.zvAuCI1Mxy/setup-package.conf.d -threaded
  369. 53.69 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.zvAuCI1Mxy/Main.o )
  370. 54.13 s [duoids] [2 of 2] Linking Setup
  371. 56.10 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  372. 56.19 s [vector] Phase: configurePhase
  373. 56.25 s [vector] configureFlags: --verbose --prefix=/nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.BqbhsHiyOp/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/lib
  374. 56.33 s [vector] Using Parsec parser
  375. 56.33 s [vector] Configuring vector-0.13.2.0...
  376. 57.19 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  377. 57.19 s [vector] wall=False
  378. 57.30 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  379. 57.34 s [duoids] Phase: configurePhase
  380. 57.36 s [duoids] configureFlags: --verbose --prefix=/nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/l31pq99d0s01hyhhawj0sg8q79780r6i-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.zvAuCI1Mxy/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/lib
  381. 57.42 s [duoids] Using Parsec parser
  382. 57.42 s [duoids] Configuring duoids-0.0.1.0...
  383. 58.28 s [vector] Dependency base >=4.9 && <4.22: using base-4.20.0.0
  384. 58.31 s [vector] Dependency deepseq >=1.1 && <1.6: using deepseq-1.5.0.0
  385. 58.31 s [vector] Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
  386. 58.31 s [vector] Dependency vector-stream >=0.1 && <0.2: using vector-stream-0.1.0.1
  387. 58.31 s [vector] Dependency base: using base-4.20.0.0
  388. 58.31 s [vector] Dependency random >=1.2: using random-1.2.1.3
  389. 58.31 s [vector] Dependency tasty: using tasty-1.5.3
  390. 58.31 s [vector] Dependency vector: using vector-0.13.2.0
  391. 58.31 s [vector] Dependency QuickCheck >=2.9 && <2.16: using QuickCheck-2.14.3
  392. 58.31 s [vector] Dependency base >=4.5 && <5: using base-4.20.0.0
  393. 58.31 s [vector] Dependency base-orphans >=0.6: using base-orphans-0.9.3
  394. 58.31 s [vector] Dependency primitive: using primitive-0.9.1.0
  395. 58.31 s [vector] Dependency random: using random-1.2.1.3
  396. 58.31 s [vector] Dependency tasty: using tasty-1.5.3
  397. 58.31 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  398. 58.31 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11
  399. 58.31 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  400. 58.31 s [vector] Dependency transformers >=0.2.0.0: using transformers-0.6.1.1
  401. 58.31 s [vector] Dependency vector: using vector-0.13.2.0
  402. 58.31 s [vector] Dependency QuickCheck >=2.9 && <2.16: using QuickCheck-2.14.3
  403. 58.31 s [vector] Dependency base >=4.5 && <5: using base-4.20.0.0
  404. 58.31 s [vector] Dependency base-orphans >=0.6: using base-orphans-0.9.3
  405. 58.31 s [vector] Dependency primitive: using primitive-0.9.1.0
  406. 58.31 s [vector] Dependency random: using random-1.2.1.3
  407. 58.31 s [vector] Dependency tasty: using tasty-1.5.3
  408. 58.31 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  409. 58.31 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11
  410. 58.31 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  411. 58.31 s [vector] Dependency transformers >=0.2.0.0: using transformers-0.6.1.1
  412. 58.31 s [vector] Dependency vector: using vector-0.13.2.0
  413. 58.31 s [vector] Dependency base: using base-4.20.0.0
  414. 58.31 s [vector] Dependency doctest >=0.15 && <0.24: using doctest-0.22.6
  415. 58.31 s [vector] Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
  416. 58.31 s [vector] Dependency vector: using vector-0.13.2.0
  417. 58.31 s [vector] Dependency base: using base-4.20.0.0
  418. 58.31 s [vector] Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
  419. 58.31 s [vector] Dependency tasty: using tasty-1.5.3
  420. 58.31 s [vector] Dependency tasty-inspection-testing >=0.1: using
  421. 58.31 s [vector] tasty-inspection-testing-0.2.1
  422. 58.31 s [vector] Dependency vector: using vector-0.13.2.0
  423. 58.31 s [vector] Source component graph:
  424. 58.31 s [vector] component lib
  425. 58.31 s [vector] component lib:benchmarks-O2 dependency lib
  426. 58.31 s [vector] component test:vector-doctest dependency lib
  427. 58.31 s [vector] component test:vector-inspection dependency lib
  428. 58.31 s [vector] component test:vector-tests-O0 dependency lib
  429. 58.31 s [vector] component test:vector-tests-O2 dependency lib
  430. 58.31 s [vector] Configured component graph:
  431. 58.31 s [vector] component vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  432. 58.31 s [vector] include base-4.20.0.0-d8e2
  433. 58.31 s [vector] include deepseq-1.5.0.0-e78d
  434. 58.31 s [vector] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  435. 58.31 s [vector] include vector-stream-0.1.0.1-I4ZycYjaHWg9qHo1QAO0zS
  436. 58.31 s [vector] component vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2
  437. 58.31 s [vector] include base-4.20.0.0-d8e2
  438. 58.31 s [vector] include random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  439. 58.31 s [vector] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  440. 58.31 s [vector] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  441. 58.31 s [vector] component vector-0.13.2.0-9wI5Pusx7a32bzpNhK3iKi-vector-doctest
  442. 58.31 s [vector] include base-4.20.0.0-d8e2
  443. 58.31 s [vector] include doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  444. 58.31 s [vector] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  445. 58.31 s [vector] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  446. 58.31 s [vector] component vector-0.13.2.0-L3C3eAc8zF2FVACyMoWMDT-vector-inspection
  447. 58.31 s [vector] include base-4.20.0.0-d8e2
  448. 58.31 s [vector] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  449. 58.31 s [vector] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  450. 58.31 s [vector] include tasty-inspection-testing-0.2.1-KhwdvEEGMGyKgyRLWycYwm
  451. 58.31 s [vector] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  452. 58.31 s [vector] component vector-0.13.2.0-6jQ0p0eDTnsBi0Cbj7lpz0-vector-tests-O0
  453. 58.31 s [vector] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  454. 58.31 s [vector] include base-4.20.0.0-d8e2
  455. 58.32 s [vector] include base-orphans-0.9.3-BchTUzm72AKiKJlpZU0ez
  456. 58.32 s [vector] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  457. 58.32 s [vector] include random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  458. 58.32 s [vector] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  459. 58.32 s [vector] include tasty-hunit-0.10.2-KYicHyB7xyiGpoiECfGyrz
  460. 58.32 s [vector] include tasty-quickcheck-0.11-IoWMNeRe4fVBeUSir8EfUO
  461. 58.32 s [vector] include template-haskell-2.22.0.0-5f29
  462. 58.32 s [vector] include transformers-0.6.1.1-3641
  463. 58.32 s [vector] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  464. 58.32 s [vector] component vector-0.13.2.0-CDtH1MCgsrCH5LaoFSatrm-vector-tests-O2
  465. 58.32 s [vector] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  466. 58.32 s [vector] include base-4.20.0.0-d8e2
  467. 58.32 s [vector] include base-orphans-0.9.3-BchTUzm72AKiKJlpZU0ez
  468. 58.32 s [vector] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  469. 58.32 s [vector] include random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  470. 58.32 s [vector] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  471. 58.32 s [vector] include tasty-hunit-0.10.2-KYicHyB7xyiGpoiECfGyrz
  472. 58.32 s [vector] include tasty-quickcheck-0.11-IoWMNeRe4fVBeUSir8EfUO
  473. 58.32 s [vector] include template-haskell-2.22.0.0-5f29
  474. 58.32 s [vector] include transformers-0.6.1.1-3641
  475. 58.32 s [vector] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  476. 58.32 s [vector] Linked component graph:
  477. 58.32 s [vector] unit vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  478. 58.32 s [vector] include base-4.20.0.0-d8e2
  479. 58.32 s [vector] include deepseq-1.5.0.0-e78d
  480. 58.32 s [vector] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  481. 58.32 s [vector] include vector-stream-0.1.0.1-I4ZycYjaHWg9qHo1QAO0zS
  482. 58.32 s [vector] Data.Vector=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0:Data.Vector.Unboxed.Mutable
  483. 58.32 s [vector] unit vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2
  484. 58.32 s [vector] include base-4.20.0.0-d8e2
  485. 58.32 s [vector] include random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  486. 58.32 s [vector] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  487. 58.32 s [vector] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  488. 58.40 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2:Bench.Vector.TestData.ParenTree
  489. 58.40 s [vector] unit vector-0.13.2.0-9wI5Pusx7a32bzpNhK3iKi-vector-doctest
  490. 58.40 s [vector] include base-4.20.0.0-d8e2
  491. 58.40 s [vector] include doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  492. 58.40 s [vector] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  493. 58.40 s [vector] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  494. 58.40 s [vector] unit vector-0.13.2.0-L3C3eAc8zF2FVACyMoWMDT-vector-inspection
  495. 58.40 s [vector] include base-4.20.0.0-d8e2
  496. 58.40 s [vector] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  497. 58.40 s [vector] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  498. 58.40 s [vector] include tasty-inspection-testing-0.2.1-KhwdvEEGMGyKgyRLWycYwm
  499. 58.40 s [vector] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  500. 58.40 s [vector] unit vector-0.13.2.0-6jQ0p0eDTnsBi0Cbj7lpz0-vector-tests-O0
  501. 58.40 s [vector] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  502. 58.40 s [vector] include base-4.20.0.0-d8e2
  503. 58.40 s [vector] include base-orphans-0.9.3-BchTUzm72AKiKJlpZU0ez
  504. 58.40 s [vector] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  505. 58.40 s [vector] include random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  506. 58.40 s [vector] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  507. 58.40 s [vector] include tasty-hunit-0.10.2-KYicHyB7xyiGpoiECfGyrz
  508. 58.40 s [vector] include tasty-quickcheck-0.11-IoWMNeRe4fVBeUSir8EfUO
  509. 58.40 s [vector] include template-haskell-2.22.0.0-5f29
  510. 58.40 s [vector] include transformers-0.6.1.1-3641
  511. 58.40 s [vector] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  512. 58.40 s [vector] unit vector-0.13.2.0-CDtH1MCgsrCH5LaoFSatrm-vector-tests-O2
  513. 58.40 s [vector] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  514. 58.40 s [vector] include base-4.20.0.0-d8e2
  515. 58.40 s [vector] include base-orphans-0.9.3-BchTUzm72AKiKJlpZU0ez
  516. 58.40 s [vector] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  517. 58.40 s [vector] include random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  518. 58.40 s [vector] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  519. 58.40 s [vector] include tasty-hunit-0.10.2-KYicHyB7xyiGpoiECfGyrz
  520. 58.40 s [vector] include tasty-quickcheck-0.11-IoWMNeRe4fVBeUSir8EfUO
  521. 58.40 s [vector] include template-haskell-2.22.0.0-5f29
  522. 58.40 s [vector] include transformers-0.6.1.1-3641
  523. 58.40 s [vector] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  524. 58.40 s [vector] Ready component graph:
  525. 58.40 s [vector] definite vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  526. 58.40 s [vector] depends base-4.20.0.0-d8e2
  527. 58.40 s [vector] depends deepseq-1.5.0.0-e78d
  528. 58.40 s [vector] depends primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  529. 58.41 s [vector] depends vector-stream-0.1.0.1-I4ZycYjaHWg9qHo1QAO0zS
  530. 58.41 s [vector] definite vector-0.13.2.0-L3C3eAc8zF2FVACyMoWMDT-vector-inspection
  531. 58.41 s [vector] depends base-4.20.0.0-d8e2
  532. 58.41 s [vector] depends primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  533. 58.41 s [vector] depends tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  534. 58.41 s [vector] depends tasty-inspection-testing-0.2.1-KhwdvEEGMGyKgyRLWycYwm
  535. 58.41 s [vector] depends vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  536. 58.41 s [vector] definite vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2
  537. 58.41 s [vector] depends base-4.20.0.0-d8e2
  538. 58.41 s [vector] depends random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  539. 58.41 s [vector] depends tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  540. 58.41 s [vector] depends vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  541. 58.41 s [vector] definite vector-0.13.2.0-CDtH1MCgsrCH5LaoFSatrm-vector-tests-O2
  542. 58.41 s [vector] depends QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  543. 58.41 s [vector] depends base-4.20.0.0-d8e2
  544. 58.41 s [vector] depends base-orphans-0.9.3-BchTUzm72AKiKJlpZU0ez
  545. 58.41 s [vector] depends primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  546. 58.41 s [vector] depends random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  547. 58.41 s [vector] depends tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  548. 58.41 s [vector] depends tasty-hunit-0.10.2-KYicHyB7xyiGpoiECfGyrz
  549. 58.41 s [vector] depends tasty-quickcheck-0.11-IoWMNeRe4fVBeUSir8EfUO
  550. 58.41 s [vector] depends template-haskell-2.22.0.0-5f29
  551. 58.41 s [vector] depends transformers-0.6.1.1-3641
  552. 58.41 s [vector] depends vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  553. 58.41 s [vector] definite vector-0.13.2.0-9wI5Pusx7a32bzpNhK3iKi-vector-doctest
  554. 58.41 s [vector] depends base-4.20.0.0-d8e2
  555. 58.41 s [vector] depends doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  556. 58.41 s [vector] depends primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  557. 58.41 s [vector] depends vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  558. 58.41 s [vector] definite vector-0.13.2.0-6jQ0p0eDTnsBi0Cbj7lpz0-vector-tests-O0
  559. 58.41 s [vector] depends QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  560. 58.41 s [vector] depends base-4.20.0.0-d8e2
  561. 58.41 s [vector] depends base-orphans-0.9.3-BchTUzm72AKiKJlpZU0ez
  562. 58.41 s [vector] depends primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  563. 58.41 s [vector] depends random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  564. 58.41 s [vector] depends tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  565. 58.41 s [vector] depends tasty-hunit-0.10.2-KYicHyB7xyiGpoiECfGyrz
  566. 58.41 s [vector] depends tasty-quickcheck-0.11-IoWMNeRe4fVBeUSir8EfUO
  567. 58.41 s [vector] depends template-haskell-2.22.0.0-5f29
  568. 58.41 s [vector] depends transformers-0.6.1.1-3641
  569. 58.41 s [vector] depends vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  570. 58.41 s [vector] Using Cabal-3.12.0.0 compiled by ghc-9.10
  571. 58.41 s [vector] Using compiler: ghc-9.10.1
  572. 58.41 s [vector] Using install prefix:
  573. 58.41 s [vector] /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0
  574. 58.41 s [vector] Executables installed in:
  575. 58.41 s [vector] /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/bin
  576. 58.41 s [vector] Libraries installed in:
  577. 58.41 s [vector] /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  578. 58.41 s [vector] Dynamic Libraries installed in:
  579. 58.41 s [vector] /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5
  580. 58.41 s [vector] Private executables installed in:
  581. 58.41 s [vector] /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.10.1-c9f5/vector-0.13.2.0
  582. 58.41 s [vector] Data files installed in:
  583. 58.41 s [vector] /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/share/x86_64-linux-ghc-9.10.1-c9f5/vector-0.13.2.0
  584. 58.41 s [vector] Documentation installed in:
  585. 58.42 s [vector] /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.10.1-c9f5/vector-0.13.2.0
  586. 58.42 s [vector] Configuration files installed in:
  587. 58.42 s [vector] /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/etc
  588. 58.42 s [vector] No alex found
  589. 58.42 s [vector] Using ar found on system at:
  590. 58.42 s [vector] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  591. 58.42 s [vector] No c2hs found
  592. 58.42 s [vector] No cpphs found
  593. 58.42 s [vector] Using doctest version 0.22.6 found on system at:
  594. 58.42 s [vector] /nix/store/2cb590hnnq4abkx6yb17l1iych2yf7bc-doctest-0.22.6/bin/doctest
  595. 58.42 s [vector] Using gcc version 14.3.0 given by user at:
  596. 58.42 s [vector] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  597. 58.42 s [vector] Using ghc version 9.10.1 found on system at:
  598. 58.42 s [vector] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc
  599. 58.42 s [vector] Using ghc-pkg version 9.10.1 found on system at:
  600. 58.42 s [vector] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc-pkg-9.10.1
  601. 58.42 s [vector] No ghcjs found
  602. 58.42 s [vector] No ghcjs-pkg found
  603. 58.42 s [vector] No greencard found
  604. 58.42 s [vector] Using haddock version 2.28.0 found on system at:
  605. 58.42 s [vector] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/haddock-ghc-9.10.1
  606. 58.42 s [vector] No happy found
  607. 58.43 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  608. 58.43 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  609. 58.43 s [vector] No hmake found
  610. 58.43 s [vector] Using hpc version 0.69 found on system at:
  611. 58.43 s [vector] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hpc-ghc-9.10.1
  612. 58.43 s [vector] Using hsc2hs version 0.68.10 found on system at:
  613. 58.43 s [vector] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hsc2hs-ghc-9.10.1
  614. 58.43 s [vector] Using hscolour version 1.25 found on system at:
  615. 58.43 s [vector] /nix/store/c0gbcvjjvqzy92m9ycv6zcqiczs6bvyw-hscolour-1.25/bin/HsColour
  616. 58.43 s [vector] No jhc found
  617. 58.43 s [vector] Using ld found on system at:
  618. 58.43 s [vector] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  619. 58.43 s [vector] No pkg-config found
  620. 58.43 s [vector] Using runghc version 9.10.1 found on system at:
  621. 58.43 s [vector] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/runghc-9.10.1
  622. 58.43 s [vector] Using strip version 2.44 found on system at:
  623. 58.43 s [vector] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  624. 58.43 s [vector] Using tar found on system at:
  625. 58.43 s [vector] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  626. 58.43 s [vector] No uhc found
  627. 58.48 s [duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  628. 58.98 s [vector] Phase: buildPhase
  629. 59.27 s [vector] Preprocessing library for vector-0.13.2.0...
  630. 59.29 s [vector] Building library for vector-0.13.2.0...
  631. 59.75 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  632. 59.75 s [duoids] >=4.21.0 && <4.22: using base-4.20.0.0
  633. 59.76 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  634. 59.76 s [duoids] >=4.21.0 && <4.22: using base-4.20.0.0
  635. 59.76 s [duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  636. 59.76 s [duoids] <0.25: using doctest-0.22.6
  637. 59.76 s [duoids] Dependency duoids: using duoids-0.0.1.0
  638. 59.76 s [duoids] Source component graph:
  639. 59.76 s [duoids] component lib
  640. 59.76 s [duoids] component test:doctests dependency lib
  641. 59.76 s [duoids] Configured component graph:
  642. 59.76 s [duoids] component duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  643. 59.76 s [duoids] include base-4.20.0.0-d8e2
  644. 59.76 s [duoids] component duoids-0.0.1.0-8XbgI3GY1HC8fvjOkIOHpE-doctests
  645. 59.76 s [duoids] include base-4.20.0.0-d8e2
  646. 59.76 s [duoids] include doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  647. 59.76 s [duoids] include duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  648. 59.76 s [duoids] Linked component graph:
  649. 59.76 s [duoids] unit duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  650. 59.76 s [duoids] include base-4.20.0.0-d8e2
  651. 59.76 s [duoids] Control.Duoidal=duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN:Control.Duoidal,Control.Duoidal.Do=duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN:Control.Duoidal.Do,Control.Duoidal.Either=duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN:Control.Duoidal.Either,Control.Duoidal.Fail=duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN:Control.Duoidal.Fail,Control.Duoidal.Fix=duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN:Control.Duoidal.Fix,Control.Duoidal.Laws=duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN:Data.Duoid.Laws
  652. 59.76 s [duoids] unit duoids-0.0.1.0-8XbgI3GY1HC8fvjOkIOHpE-doctests
  653. 59.76 s [duoids] include base-4.20.0.0-d8e2
  654. 59.76 s [duoids] include doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  655. 59.76 s [duoids] include duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  656. 59.76 s [duoids] Ready component graph:
  657. 59.76 s [duoids] definite duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  658. 59.76 s [duoids] depends base-4.20.0.0-d8e2
  659. 59.76 s [duoids] definite duoids-0.0.1.0-8XbgI3GY1HC8fvjOkIOHpE-doctests
  660. 59.76 s [duoids] depends base-4.20.0.0-d8e2
  661. 59.76 s [duoids] depends doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  662. 59.77 s [duoids] depends duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  663. 59.77 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  664. 59.77 s [duoids] Using compiler: ghc-9.10.1
  665. 59.77 s [duoids] Using install prefix:
  666. 59.77 s [duoids] /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0
  667. 59.77 s [duoids] Executables installed in:
  668. 59.77 s [duoids] /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0/bin
  669. 59.77 s [duoids] Libraries installed in:
  670. 59.77 s [duoids] /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  671. 59.77 s [duoids] Dynamic Libraries installed in:
  672. 59.77 s [duoids] /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5
  673. 59.77 s [duoids] Private executables installed in:
  674. 59.77 s [duoids] /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.1-c9f5/duoids-0.0.1.0
  675. 59.77 s [duoids] Data files installed in:
  676. 59.77 s [duoids] /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.1-c9f5/duoids-0.0.1.0
  677. 59.77 s [duoids] Documentation installed in:
  678. 59.77 s [duoids] /nix/store/l31pq99d0s01hyhhawj0sg8q79780r6i-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  679. 59.77 s [duoids] Configuration files installed in:
  680. 59.77 s [duoids] /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0/etc
  681. 59.77 s [duoids] No alex found
  682. 59.77 s [duoids] Using ar found on system at:
  683. 59.77 s [duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  684. 59.77 s [duoids] No c2hs found
  685. 59.77 s [duoids] No cpphs found
  686. 59.77 s [duoids] Using doctest version 0.22.6 found on system at:
  687. 59.77 s [duoids] /nix/store/2cb590hnnq4abkx6yb17l1iych2yf7bc-doctest-0.22.6/bin/doctest
  688. 59.77 s [duoids] Using gcc version 14.3.0 given by user at:
  689. 59.77 s [duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  690. 59.77 s [duoids] Using ghc version 9.10.1 found on system at:
  691. 59.77 s [duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc
  692. 59.77 s [duoids] Using ghc-pkg version 9.10.1 found on system at:
  693. 59.77 s [duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc-pkg-9.10.1
  694. 59.77 s [duoids] No ghcjs found
  695. 59.77 s [duoids] No ghcjs-pkg found
  696. 59.77 s [duoids] No greencard found
  697. 59.77 s [duoids] Using haddock version 2.28.0 found on system at:
  698. 59.77 s [duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/haddock-ghc-9.10.1
  699. 59.77 s [duoids] No happy found
  700. 59.77 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  701. 59.78 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  702. 59.78 s [duoids] No hmake found
  703. 59.78 s [duoids] Using hpc version 0.69 found on system at:
  704. 59.78 s [duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hpc-ghc-9.10.1
  705. 59.78 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  706. 59.78 s [duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hsc2hs-ghc-9.10.1
  707. 59.78 s [duoids] Using hscolour version 1.25 found on system at:
  708. 59.78 s [duoids] /nix/store/c0gbcvjjvqzy92m9ycv6zcqiczs6bvyw-hscolour-1.25/bin/HsColour
  709. 59.78 s [duoids] No jhc found
  710. 59.78 s [duoids] Using ld found on system at:
  711. 59.78 s [duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  712. 59.78 s [duoids] No pkg-config found
  713. 59.78 s [duoids] Using runghc version 9.10.1 found on system at:
  714. 59.78 s [duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/runghc-9.10.1
  715. 59.78 s [duoids] Using strip version 2.44 found on system at:
  716. 59.78 s [duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  717. 59.78 s [duoids] Using tar found on system at:
  718. 59.78 s [duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  719. 59.78 s [duoids] No uhc found
  720. 60.48 s [duoids] Phase: buildPhase
  721. 61.17 s [duoids] Preprocessing library for duoids-0.0.1.0...
  722. 61.20 s [duoids] Building library for duoids-0.0.1.0...
  723. 61.52 s [duoids] [1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o )
  724. 63.17 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 )
  725. 63.40 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  726. 64.34 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 )
  727. 64.85 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 )
  728. 66.65 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 )
  729. 66.65 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 )
  730. 66.65 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 )
  731. 66.65 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 )
  732. 70.64 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  733. 76.00 s [duoids] [4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, dist/build/Control/Duoidal/Fix.o, dist/build/Control/Duoidal/Fix.dyn_o )
  734. 76.19 s [duoids] [5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, dist/build/Control/Duoidal/Fail.o, dist/build/Control/Duoidal/Fail.dyn_o )
  735. 76.19 s [duoids] [6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o )
  736. 76.19 s [duoids] [7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, dist/build/Control/Duoidal/Do.o, dist/build/Control/Duoidal/Do.dyn_o )
  737. 76.32 s [duoids] [8 of 9] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o )
  738. 76.32 s [duoids] [9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o )
  739. 77.00 s [duoids] [1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  740. 78.38 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  741. 81.96 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  742. 82.14 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 )
  743. 87.32 s [duoids] [4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, dist/build/Control/Duoidal/Fix.p_o )
  744. 87.82 s [duoids] [5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, dist/build/Control/Duoidal/Fail.p_o )
  745. 87.84 s [duoids] [6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  746. 88.37 s [duoids] [7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, dist/build/Control/Duoidal/Do.p_o )
  747. 88.37 s [duoids] [8 of 9] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  748. 88.37 s [duoids] [9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  749. 89.04 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 )
  750. 89.96 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  751. 89.96 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  752. 90.12 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  753. 90.74 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  754. 91.43 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  755. 94.62 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 )
  756. 95.61 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 )
  757. 98.62 s [duoids] buildPhase completed in 38 seconds
  758. 98.62 s [duoids] Phase: checkPhase
  759. 99.07 s [duoids] Running 1 test suites...
  760. 99.07 s [duoids] Test suite doctests: RUNNING...
  761. 99.88 s [duoids] on the commandline: warning: [GHC-98887]
  762. 99.88 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  763. 99.90 s [duoids]
  764. 99.90 s [duoids] on the commandline: warning: [GHC-98887]
  765. 99.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  766. 99.90 s [duoids]
  767. 99.90 s [duoids] on the commandline: warning: [GHC-98887]
  768. 99.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  769. 99.90 s [duoids]
  770. 99.90 s [duoids] on the commandline: warning: [GHC-98887]
  771. 99.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  772. 99.90 s [duoids]
  773. 99.90 s [duoids] on the commandline: warning: [GHC-98887]
  774. 99.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  775. 99.90 s [duoids]
  776. 99.90 s [duoids] on the commandline: warning: [GHC-98887]
  777. 99.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  778. 99.90 s [duoids]
  779. 99.90 s [duoids] on the commandline: warning: [GHC-98887]
  780. 99.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  781. 99.90 s [duoids]
  782. 99.90 s [duoids] on the commandline: warning: [GHC-98887]
  783. 99.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  784. 99.90 s [duoids]
  785. 99.90 s [duoids] on the commandline: warning: [GHC-98887]
  786. 99.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  787. 99.90 s [duoids]
  788. 99.91 s [duoids] on the commandline: warning: [GHC-98887]
  789. 99.91 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  790. 99.91 s [duoids]
  791. 99.91 s [duoids] on the commandline: warning: [GHC-98887]
  792. 99.91 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  793. 99.91 s [duoids]
  794. 99.91 s [duoids] on the commandline: warning: [GHC-98887]
  795. 99.91 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  796. 99.91 s [duoids]
  797. 99.92 s [duoids] on the commandline: warning: [GHC-98887]
  798. 99.92 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  799. 99.92 s [duoids]
  800. 99.92 s [duoids] on the commandline: warning: [GHC-98887]
  801. 99.92 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  802. 99.92 s [duoids]
  803. 99.93 s [duoids] on the commandline: warning: [GHC-98887]
  804. 99.93 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  805. 99.93 s [duoids]
  806. 102.03 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  807. 102.13 s [duoids] Test suite doctests: PASS
  808. 102.13 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  809. 102.13 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  810. 102.14 s [duoids] Phase: haddockPhase
  811. 102.46 s [duoids] Preprocessing library for duoids-0.0.1.0...
  812. 102.46 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  813. 102.83 s [duoids] [1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing )
  814. 103.08 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing )
  815. 103.69 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing )
  816. 104.86 s [duoids] [4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, nothing )
  817. 104.89 s [duoids] [5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, nothing )
  818. 104.92 s [duoids] [6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing )
  819. 104.92 s [duoids] [7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, nothing )
  820. 104.92 s [duoids] [8 of 9] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing )
  821. 105.01 s [duoids] [9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing )
  822. 105.06 s [duoids] Haddock coverage:
  823. 105.06 s [duoids] Warning: 'cancel' is out of scope.
  824. 105.07 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  825. 105.07 s [duoids] Warning: 'Par' is ambiguous. It is defined
  826. 105.07 s [duoids] * at src/Data/Duoid.hs:53:17
  827. 105.07 s [duoids] * at src/Data/Duoid.hs:53:1
  828. 105.07 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  829. 105.07 s [duoids] by specifying the type/value namespace explicitly.
  830. 105.07 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:53:1
  831. 105.07 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  832. 105.07 s [duoids] * at src/Data/Duoid.hs:59:17
  833. 105.07 s [duoids] * at src/Data/Duoid.hs:59:1
  834. 105.07 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  835. 105.07 s [duoids] by specifying the type/value namespace explicitly.
  836. 105.07 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:59:1
  837. 105.08 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  838. 105.08 s [duoids] Warning: 'ExceptT' is out of scope.
  839. 105.08 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  840. 105.08 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  841. 105.08 s [duoids] * at src/Control/Duoidal.hs:228:24
  842. 105.08 s [duoids] * at src/Control/Duoidal.hs:228:1
  843. 105.08 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  844. 105.08 s [duoids] by specifying the type/value namespace explicitly.
  845. 105.08 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:228:1
  846. 105.08 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  847. 105.08 s [duoids] * at src/Control/Duoidal.hs:243:26
  848. 105.08 s [duoids] * at src/Control/Duoidal.hs:243:1
  849. 105.08 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  850. 105.09 s [duoids] by specifying the type/value namespace explicitly.
  851. 105.09 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:243:1
  852. 105.09 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  853. 105.09 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  854. 105.09 s [duoids] Warning: 'Validation' is out of scope.
  855. 105.09 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  856. 105.09 s [duoids] Warning: 'fail' is out of scope.
  857. 105.09 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  858. 105.09 s [duoids] Warning: 'MonadFail' is out of scope.
  859. 105.09 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  860. 105.09 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  861. 105.09 s [duoids] * at src/Control/Duoidal.hs:529:27
  862. 105.09 s [duoids] * at src/Control/Duoidal.hs:529:1
  863. 105.09 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  864. 105.09 s [duoids] by specifying the type/value namespace explicitly.
  865. 105.09 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:529:1
  866. 105.09 s [duoids] Warning: 'Writer' is out of scope.
  867. 105.09 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  868. 105.09 s [duoids] Warning: 'Set' is out of scope.
  869. 105.09 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  870. 105.09 s [duoids] Warning: 'Char' is out of scope.
  871. 105.09 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  872. 105.09 s [duoids] Warning: 'Const' is ambiguous. It is defined
  873. 105.10 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  874. 105.10 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  875. 105.10 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  876. 105.10 s [duoids] by specifying the type/value namespace explicitly.
  877. 105.10 s [duoids] Defaulting to the one defined in ‘GHC.Internal.Data.Functor.Const’
  878. 105.10 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  879. 105.10 s [duoids] * at src/Control/Duoidal.hs:279:1
  880. 105.10 s [duoids] * at src/Data/Duoid.hs:74:1
  881. 105.10 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  882. 105.10 s [duoids] by specifying the type/value namespace explicitly.
  883. 105.10 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:74:1
  884. 105.11 s [duoids] 46% ( 28 / 60) in 'Control.Duoidal'
  885. 105.11 s [duoids] Missing documentation for:
  886. 105.11 s [duoids] DuoidalIO (src/Control/Duoidal.hs:470)
  887. 105.11 s [duoids] Parallel (src/Control/Duoidal.hs:228)
  888. 105.11 s [duoids] traverse_ (src/Control/Duoidal.hs:395)
  889. 105.11 s [duoids] for (src/Control/Duoidal.hs:401)
  890. 105.11 s [duoids] for_ (src/Control/Duoidal.hs:407)
  891. 105.11 s [duoids] forever (src/Control/Duoidal.hs:427)
  892. 105.11 s [duoids] Sequential (src/Control/Duoidal.hs:243)
  893. 105.11 s [duoids] >> (src/Control/Duoidal.hs:339)
  894. 105.11 s [duoids] >>= (src/Control/Duoidal.hs:450)
  895. 105.11 s [duoids] >=> (src/Control/Duoidal.hs:460)
  896. 105.11 s [duoids] =<< (src/Control/Duoidal.hs:455)
  897. 105.11 s [duoids] <=< (src/Control/Duoidal.hs:465)
  898. 105.11 s [duoids] join (src/Control/Duoidal.hs:447)
  899. 105.11 s [duoids] ap (src/Control/Duoidal.hs:314)
  900. 105.11 s [duoids] return (src/Control/Duoidal.hs:290)
  901. 105.11 s [duoids] liftM2 (src/Control/Duoidal.hs:297)
  902. 105.11 s [duoids] liftM3 (src/Control/Duoidal.hs:304)
  903. 105.11 s [duoids] mapM (src/Control/Duoidal.hs:392)
  904. 105.11 s [duoids] mapM_ (src/Control/Duoidal.hs:398)
  905. 105.11 s [duoids] forM (src/Control/Duoidal.hs:404)
  906. 105.12 s [duoids] forM_ (src/Control/Duoidal.hs:410)
  907. 105.12 s [duoids] sequence (src/Control/Duoidal.hs:417)
  908. 105.12 s [duoids] sequence_ (src/Control/Duoidal.hs:424)
  909. 105.12 s [duoids] forever' (src/Control/Duoidal.hs:430)
  910. 105.12 s [duoids] unless' (src/Control/Duoidal.hs:437)
  911. 105.12 s [duoids] when' (src/Control/Duoidal.hs:444)
  912. 105.12 s [duoids] normalPure (src/Control/Duoidal.hs:474)
  913. 105.12 s [duoids] sequentialAp (src/Control/Duoidal.hs:490)
  914. 105.12 s [duoids] sequentialBind (src/Control/Duoidal.hs:494)
  915. 105.12 s [duoids] sequentialLiftA2 (src/Control/Duoidal.hs:485)
  916. 105.12 s [duoids] sequentialPure (src/Control/Duoidal.hs:477)
  917. 105.12 s [duoids] commutativeAp (src/Control/Duoidal.hs:544)
  918. 105.12 s [duoids] 100% ( 3 / 3) in 'Control.Duoidal.Fix'
  919. 105.12 s [duoids] 100% ( 3 / 3) in 'Control.Duoidal.Fail'
  920. 105.21 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  921. 105.22 s [duoids] 55% ( 5 / 9) in 'Control.Duoidal.Do'
  922. 105.22 s [duoids] Missing documentation for:
  923. 105.22 s [duoids] join (src/Control/Duoidal.hs:447)
  924. 105.22 s [duoids] return (src/Control/Duoidal.hs:290)
  925. 105.22 s [duoids] >> (src/Control/Duoidal.hs:339)
  926. 105.22 s [duoids] >>= (src/Control/Duoidal.hs:450)
  927. 105.22 s [duoids] 16% ( 2 / 12) in 'Data.Duoid.Laws'
  928. 105.22 s [duoids] Missing documentation for:
  929. 105.22 s [duoids] Law (src/Data/Duoid/Laws.hs:27)
  930. 105.22 s [duoids] Laws (src/Data/Duoid/Laws.hs:49)
  931. 105.22 s [duoids] getLaws (src/Data/Duoid/Laws.hs:57)
  932. 105.22 s [duoids] NormalLaws (src/Data/Duoid/Laws.hs:70)
  933. 105.22 s [duoids] getNormalLaws (src/Data/Duoid/Laws.hs:76)
  934. 105.22 s [duoids] checkLaw (src/Data/Duoid/Laws.hs:30)
  935. 105.22 s [duoids] interchangeLaw (src/Data/Duoid/Laws.hs:33)
  936. 105.22 s [duoids] joinUnitLaw (src/Data/Duoid/Laws.hs:43)
  937. 105.22 s [duoids] splitUnitLaw (src/Data/Duoid/Laws.hs:40)
  938. 105.22 s [duoids] swapUnitLaw (src/Data/Duoid/Laws.hs:46)
  939. 105.22 s [duoids] 50% ( 3 / 6) in 'Control.Duoidal.Laws'
  940. 105.22 s [duoids] Missing documentation for:
  941. 105.22 s [duoids] joinUnit (src/Control/Duoidal/Laws.hs:67)
  942. 105.22 s [duoids] splitUnit (src/Control/Duoidal/Laws.hs:63)
  943. 105.22 s [duoids] swapUnit (src/Control/Duoidal/Laws.hs:74)
  944. 118.97 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  945. 119.23 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  946. 119.29 s [duoids] Phase: installPhase
  947. 119.79 s [duoids] Installing library in /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  948. 119.83 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 )
  949. 119.84 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  950. 121.50 s [duoids] Phase: fixupPhase
  951. 121.59 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0
  952. 121.60 s [duoids] shrinking /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSduoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN-ghc9.10.1.so
  953. 121.79 s [duoids] checking for references to /build/ in /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0...
  954. 121.87 s [duoids] patching script interpreter paths in /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0
  955. 121.90 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0/lib
  956. 122.78 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/l31pq99d0s01hyhhawj0sg8q79780r6i-duoids-0.0.1.0-doc
  957. 122.81 s [duoids] checking for references to /build/ in /nix/store/l31pq99d0s01hyhhawj0sg8q79780r6i-duoids-0.0.1.0-doc...
  958. 122.84 s [duoids] patching script interpreter paths in /nix/store/l31pq99d0s01hyhhawj0sg8q79780r6i-duoids-0.0.1.0-doc
  959. 123.22 s [duoids:post-build] Uploading to cachix cache "sellout": /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0 /nix/store/l31pq99d0s01hyhhawj0sg8q79780r6i-duoids-0.0.1.0-doc
  960. 124.56 s [duoids:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  961. 124.56 s [duoids:post-build]
  962. 124.96 s [duoids:post-build] Pushing /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0 (7.95 MiB)
  963. 125.01 s [duoids:post-build] Pushing /nix/store/l31pq99d0s01hyhhawj0sg8q79780r6i-duoids-0.0.1.0-doc (2.08 MiB)
  964. 126.85 s [duoids:post-build]
  965. 126.85 s [duoids:post-build] All done.
  966. 127.00 s [duoids:post-build] Uploading to the NixCI cache: /nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0 /nix/store/l31pq99d0s01hyhhawj0sg8q79780r6i-duoids-0.0.1.0-doc
  967. 127.50 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  968. 127.58 s [duoids:post-build] copying 2 paths...
  969. 127.58 s [duoids:post-build] copying path '/nix/store/l31pq99d0s01hyhhawj0sg8q79780r6i-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  970. 129.11 s [duoids:post-build] copying path '/nix/store/9pw5ivf38z0lwcjnbij5vird9dp2hhjg-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  971. 135.71 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  972. 137.12 s [duoids:post-build] copying 44 paths...
  973. 137.13 s [duoids:post-build] copying path '/nix/store/prk4rzs4k0244ksk82rp2l3d9zx9zjqp-ghc-9.10.1.drv' to 'https://cache.nix-ci.com'...
  974. 137.97 s [duoids:post-build] copying path '/nix/store/8378kdym1ws909idix0f2jymv8gqf8p2-hscolour-1.25.drv' to 'https://cache.nix-ci.com'...
  975. 138.18 s [duoids:post-build] copying path '/nix/store/kp43cbsyj1g5dvwkjbhix14p3v8gd6fa-nanospec-0.2.2.drv' to 'https://cache.nix-ci.com'...
  976. 138.18 s [duoids:post-build] copying path '/nix/store/qy8gf9rsnca7q039ln91zrsfnv9lksq5-happy-lib-2.0.2.drv' to 'https://cache.nix-ci.com'...
  977. 138.18 s [duoids:post-build] copying path '/nix/store/m2c74px8dbns479fxy59zg7ns5yprm27-splitmix-0.1.1.drv' to 'https://cache.nix-ci.com'...
  978. 138.18 s [duoids:post-build] copying path '/nix/store/842nvil9jxjj3y6jnbixygc3lsb35acr-call-stack-0.4.0.drv' to 'https://cache.nix-ci.com'...
  979. 138.22 s [duoids:post-build] copying path '/nix/store/mjgkxd4zi4g5awzc7fh0dm3h1hc97cmx-transformers-compat-0.7.2.drv' to 'https://cache.nix-ci.com'...
  980. 138.22 s [duoids:post-build] copying path '/nix/store/ksa0xr3qk135ymm8r2yyqyga4fybfdlx-code-page-0.2.1.drv' to 'https://cache.nix-ci.com'...
  981. 138.23 s [duoids:post-build] copying path '/nix/store/8m11c9xwi69qfnpa3qczsn5xfw1dz927-haskell-lexer-1.1.2.drv' to 'https://cache.nix-ci.com'...
  982. 138.23 s [duoids:post-build] copying path '/nix/store/d1g8anj1w6g3xymcsrllj4qaq7iqvc24-colour-2.3.6.drv' to 'https://cache.nix-ci.com'...
  983. 138.23 s [duoids:post-build] copying path '/nix/store/qg0102ga21sifg1hr7cz2s9djr5fl1k7-primitive-0.9.1.0.drv' to 'https://cache.nix-ci.com'...
  984. 138.23 s [duoids:post-build] copying path '/nix/store/qiwc5iqadhnrxa7zkrgmh32vpf8ji2zx-base-compat-0.13.1.drv' to 'https://cache.nix-ci.com'...
  985. 138.25 s [duoids:post-build] copying path '/nix/store/zbfc1j0ma9v5jvhv27dhj4s5v1da0l39-tagged-0.8.8.drv' to 'https://cache.nix-ci.com'...
  986. 138.36 s [duoids:post-build] copying path '/nix/store/fdqry9isbncacp1wnm1a87c7ha0p1j89-prettyprinter-1.7.1.drv' to 'https://cache.nix-ci.com'...
  987. 138.78 s [duoids:post-build] copying path '/nix/store/5fhkx0dm5nf2v5wvab68n9s073irf5sn-logging-facade-0.3.1.drv' to 'https://cache.nix-ci.com'...
  988. 138.85 s [duoids:post-build] copying path '/nix/store/6azf5nwbn7z48adlidbb37x6m9ddjnlg-ansi-terminal-types-1.1.drv' to 'https://cache.nix-ci.com'...
  989. 138.86 s [duoids:post-build] copying path '/nix/store/zxb83bcqbgxla5mhjb7khprgximv8rfi-HUnit-1.6.2.0.drv' to 'https://cache.nix-ci.com'...
  990. 138.87 s [duoids:post-build] copying path '/nix/store/dzxxj38n8wb8h3cjxgdf8ifgz0nx97ry-random-1.2.1.3.drv' to 'https://cache.nix-ci.com'...
  991. 138.88 s [duoids:post-build] copying path '/nix/store/fvjabr7p2dkr4ax2fd4dys76wk2s8w13-happy-2.0.2.drv' to 'https://cache.nix-ci.com'...
  992. 139.05 s [duoids:post-build] copying path '/nix/store/ndg0mwkvl3pdxxkwhv6wnqs651igngzl-alex-3.5.3.0.drv' to 'https://cache.nix-ci.com'...
  993. 139.07 s [duoids:post-build] copying path '/nix/store/q70jfg9pm1ybr8c5ldmnwi3p0mlfrry3-temporary-1.3.drv' to 'https://cache.nix-ci.com'...
  994. 139.07 s [duoids:post-build] copying path '/nix/store/j2lyw7qpfxjdjjyb4il2wbk4d4y7ci60-tf-random-0.5.drv' to 'https://cache.nix-ci.com'...
  995. 139.13 s [duoids:post-build] copying path '/nix/store/j22hn10sfzzbck41gi8cw4qadxfdfg3n-ansi-terminal-1.1.2.drv' to 'https://cache.nix-ci.com'...
  996. 139.15 s [duoids:post-build] copying path '/nix/store/8yblgscp3lfh3gr3zrpwkw8j24z17nwr-hspec-expectations-0.8.4.drv' to 'https://cache.nix-ci.com'...
  997. 139.18 s [duoids:post-build] copying path '/nix/store/z530cndicy9zcppfarh9mvbbrzi2rxri-QuickCheck-2.14.3.drv' to 'https://cache.nix-ci.com'...
  998. 139.27 s [duoids:post-build] copying path '/nix/store/hy8rvwscc99yjv3599agfjkia20jyq4a-Cabal-syntax-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  999. 139.41 s [duoids:post-build] copying path '/nix/store/di7qw3jwkqgicc2wysbd9s37bdw697v1-prettyprinter-ansi-terminal-1.1.3.drv' to 'https://cache.nix-ci.com'...
  1000. 139.50 s [duoids:post-build] copying path '/nix/store/4f2plnpw26qrhsqkwwfy7v4mikhs8gxc-quickcheck-io-0.2.0.drv' to 'https://cache.nix-ci.com'...
  1001. 139.54 s [duoids:post-build] copying path '/nix/store/awimzqm9w2l09ksd80l6lap42vlvf2ms-Cabal-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  1002. 139.56 s [duoids:post-build] copying path '/nix/store/qv63mvr0bldvsv17bkkv7i4h2fimf2a0-mockery-0.3.5.drv' to 'https://cache.nix-ci.com'...
  1003. 139.56 s [duoids:post-build] copying path '/nix/store/svbgv5r9gn69jmk1cc2alyn6r71m0f49-silently-1.2.5.4.drv' to 'https://cache.nix-ci.com'...
  1004. 139.64 s [duoids:post-build] copying path '/nix/store/ymrn1kk07dsl8dar52szlv2lcw6zg530-optparse-applicative-0.18.1.0.drv' to 'https://cache.nix-ci.com'...
  1005. 139.75 s [duoids:post-build] copying path '/nix/store/myjz0ws7j8r538g631765g80gimrl72a-cabal-doctest-1.0.11.drv' to 'https://cache.nix-ci.com'...
  1006. 139.76 s [duoids:post-build] copying path '/nix/store/njx3jz8qq9r2ml4x341qrw351yvmx98l-hspec-core-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1007. 139.77 s [duoids:post-build] copying path '/nix/store/bh5pcsc9v6k1b9q5k3mnz2bg1y88banf-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
  1008. 139.78 s [duoids:post-build] copying path '/nix/store/galclh6xiw4wsfqwqv8dgvw3bc3g8ili-hspec-meta-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1009. 139.85 s [duoids:post-build] copying path '/nix/store/ayg22bfxzk3gyak9mm84pwd1n5074n87-tasty-1.5.3.drv' to 'https://cache.nix-ci.com'...
  1010. 140.01 s [duoids:post-build] copying path '/nix/store/2knilv5hc6fjz51fr9746k1n8xb6ld9c-hspec-discover-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1011. 140.05 s [duoids:post-build] copying path '/nix/store/87dm746kqd0cqark0g3z3lr72vxmz5gs-tasty-hunit-0.10.2.drv' to 'https://cache.nix-ci.com'...
  1012. 140.20 s [duoids:post-build] copying path '/nix/store/gn1ai8x8b9y7sfsxi5y3mkcmivqcysyk-hspec-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1013. 140.21 s [duoids:post-build] copying path '/nix/store/kdbc1avq2jpznadc3i8smj80nqr3v56l-syb-0.7.2.4.drv' to 'https://cache.nix-ci.com'...
  1014. 140.36 s [duoids:post-build] copying path '/nix/store/fr8n39jzs72angi6miaaifgrgln08lzp-stringbuilder-0.5.1.drv' to 'https://cache.nix-ci.com'...
  1015. 140.52 s [duoids:post-build] copying path '/nix/store/ypg6a307jw604b44rl7gbhqyfyzrgr8b-doctest-0.22.6.drv' to 'https://cache.nix-ci.com'...
  1016. 140.71 s [duoids:post-build] copying path '/nix/store/sn9v7d5qic5j6m039azvjlm4nw1006gw-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1017. 141.16 s Progress: 2 of 18 built (1 building), 155 of 155 downloaded from cache
  1018. 141.34 s Building /nix/store/z96v278n92c6dzbs64z27b6js90whsd3-duoidal-transformers-0.0.1.0.drv
  1019. 141.54 s Building /nix/store/khplkrx5xawd60m434swhnqbh1i3ys54-duoids-hedgehog-0.0.1.0.drv
  1020. 141.63 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  1021. 141.65 s [duoidal-transformers] Build with /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1.
  1022. 141.97 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  1023. 141.99 s [duoids-hedgehog] Build with /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1.
  1024. 142.85 s [duoidal-transformers] Phase: unpackPhase
  1025. 142.90 s [duoidal-transformers] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./transformers
  1026. 142.95 s [duoidal-transformers] source root is transformers
  1027. 143.02 s [duoidal-transformers] Phase: patchPhase
  1028. 143.17 s [duoidal-transformers] Phase: compileBuildDriverPhase
  1029. 143.20 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.h8rnLf2mpD/setup-package.conf.d -threaded
  1030. 143.28 s [duoids-hedgehog] Phase: unpackPhase
  1031. 143.33 s [duoids-hedgehog] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./hedgehog
  1032. 143.38 s [duoids-hedgehog] source root is hedgehog
  1033. 143.47 s [duoids-hedgehog] Phase: patchPhase
  1034. 143.53 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  1035. 143.55 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.WARMQCJ3I5/setup-package.conf.d -threaded
  1036. 143.79 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.h8rnLf2mpD/Main.o )
  1037. 143.81 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.WARMQCJ3I5/Main.o )
  1038. 144.15 s [duoids-hedgehog] [2 of 2] Linking Setup
  1039. 144.40 s [duoidal-transformers] [2 of 2] Linking Setup
  1040. 148.47 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  1041. 148.49 s [duoids-hedgehog] Phase: configurePhase
  1042. 148.53 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/b76hy1gnqqlrv5mw6zx2s52rcf63rj7l-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.WARMQCJ3I5/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/lib
  1043. 148.54 s [duoids-hedgehog] Using Parsec parser
  1044. 148.54 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  1045. 149.04 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  1046. 149.08 s [duoidal-transformers] Phase: configurePhase
  1047. 149.09 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/h6827lfblapvxn3hxhv6vssv2g39xzwx-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.h8rnLf2mpD/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/lib
  1048. 149.13 s [duoidal-transformers] Using Parsec parser
  1049. 149.13 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  1050. 150.01 s [duoids-hedgehog] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  1051. 150.74 s [duoidal-transformers] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  1052. 151.38 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1053. 151.38 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.20.0.0
  1054. 151.38 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  1055. 151.38 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  1056. 151.38 s [duoids-hedgehog] hedgehog-1.5
  1057. 151.38 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1058. 151.38 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.20.0.0
  1059. 151.38 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  1060. 151.38 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  1061. 151.38 s [duoids-hedgehog] hedgehog-1.5
  1062. 151.38 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1063. 151.38 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.20.0.0
  1064. 151.38 s [duoids-hedgehog] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  1065. 151.38 s [duoids-hedgehog] <0.25: using doctest-0.22.6
  1066. 151.38 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  1067. 151.38 s [duoids-hedgehog] Source component graph:
  1068. 151.38 s [duoids-hedgehog] component lib
  1069. 151.39 s [duoids-hedgehog] component test:doctests dependency lib
  1070. 151.39 s [duoids-hedgehog] component test:laws dependency lib
  1071. 151.39 s [duoids-hedgehog] Configured component graph:
  1072. 151.39 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1073. 151.39 s [duoids-hedgehog] include base-4.20.0.0-d8e2
  1074. 151.39 s [duoids-hedgehog] include duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  1075. 151.39 s [duoids-hedgehog] include hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  1076. 151.39 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-FBLnzHJdSIE5hjChIBOl14-doctests
  1077. 151.39 s [duoids-hedgehog] include base-4.20.0.0-d8e2
  1078. 151.39 s [duoids-hedgehog] include doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  1079. 151.39 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1080. 151.39 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-ENaoV6P97juK0ffWDtmrom-laws
  1081. 151.39 s [duoids-hedgehog] include base-4.20.0.0-d8e2
  1082. 151.39 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1083. 151.39 s [duoids-hedgehog] include hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  1084. 151.39 s [duoids-hedgehog] Linked component graph:
  1085. 151.39 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1086. 151.39 s [duoids-hedgehog] include base-4.20.0.0-d8e2
  1087. 151.39 s [duoids-hedgehog] include duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  1088. 151.39 s [duoids-hedgehog] include hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  1089. 151.39 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc:Test.Duoidal
  1090. 151.39 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-FBLnzHJdSIE5hjChIBOl14-doctests
  1091. 151.39 s [duoids-hedgehog] include base-4.20.0.0-d8e2
  1092. 151.39 s [duoids-hedgehog] include doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  1093. 151.39 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1094. 151.39 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-ENaoV6P97juK0ffWDtmrom-laws
  1095. 151.39 s [duoids-hedgehog] include base-4.20.0.0-d8e2
  1096. 151.39 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1097. 151.39 s [duoids-hedgehog] include hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  1098. 151.39 s [duoids-hedgehog] Ready component graph:
  1099. 151.39 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1100. 151.39 s [duoids-hedgehog] depends base-4.20.0.0-d8e2
  1101. 151.39 s [duoids-hedgehog] depends duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  1102. 151.39 s [duoids-hedgehog] depends hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  1103. 151.39 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-ENaoV6P97juK0ffWDtmrom-laws
  1104. 151.39 s [duoids-hedgehog] depends base-4.20.0.0-d8e2
  1105. 151.39 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1106. 151.39 s [duoids-hedgehog] depends hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  1107. 151.39 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-FBLnzHJdSIE5hjChIBOl14-doctests
  1108. 151.39 s [duoids-hedgehog] depends base-4.20.0.0-d8e2
  1109. 151.39 s [duoids-hedgehog] depends doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  1110. 151.39 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1111. 151.39 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1112. 151.39 s [duoids-hedgehog] Using compiler: ghc-9.10.1
  1113. 151.39 s [duoids-hedgehog] Using install prefix:
  1114. 151.39 s [duoids-hedgehog] /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0
  1115. 151.39 s [duoids-hedgehog] Executables installed in:
  1116. 151.39 s [duoids-hedgehog] /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0/bin
  1117. 151.39 s [duoids-hedgehog] Libraries installed in:
  1118. 151.39 s [duoids-hedgehog] /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1119. 151.39 s [duoids-hedgehog] Dynamic Libraries installed in:
  1120. 151.39 s [duoids-hedgehog] /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5
  1121. 151.39 s [duoids-hedgehog] Private executables installed in:
  1122. 151.39 s [duoids-hedgehog] /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.10.1-c9f5/duoids-hedgehog-0.0.1.0
  1123. 151.39 s [duoids-hedgehog] Data files installed in:
  1124. 151.39 s [duoids-hedgehog] /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.10.1-c9f5/duoids-hedgehog-0.0.1.0
  1125. 151.39 s [duoids-hedgehog] Documentation installed in:
  1126. 151.39 s [duoids-hedgehog] /nix/store/b76hy1gnqqlrv5mw6zx2s52rcf63rj7l-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  1127. 151.39 s [duoids-hedgehog] Configuration files installed in:
  1128. 151.39 s [duoids-hedgehog] /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0/etc
  1129. 151.39 s [duoids-hedgehog] No alex found
  1130. 151.39 s [duoids-hedgehog] Using ar found on system at:
  1131. 151.39 s [duoids-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  1132. 151.39 s [duoids-hedgehog] No c2hs found
  1133. 151.39 s [duoids-hedgehog] No cpphs found
  1134. 151.39 s [duoids-hedgehog] Using doctest version 0.22.6 found on system at:
  1135. 151.39 s [duoids-hedgehog] /nix/store/2cb590hnnq4abkx6yb17l1iych2yf7bc-doctest-0.22.6/bin/doctest
  1136. 151.39 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  1137. 151.39 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  1138. 151.39 s [duoids-hedgehog] Using ghc version 9.10.1 found on system at:
  1139. 151.40 s [duoids-hedgehog] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc
  1140. 151.40 s [duoids-hedgehog] Using ghc-pkg version 9.10.1 found on system at:
  1141. 151.40 s [duoids-hedgehog] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc-pkg-9.10.1
  1142. 151.40 s [duoids-hedgehog] No ghcjs found
  1143. 151.40 s [duoids-hedgehog] No ghcjs-pkg found
  1144. 151.40 s [duoids-hedgehog] No greencard found
  1145. 151.40 s [duoids-hedgehog] Using haddock version 2.28.0 found on system at:
  1146. 151.40 s [duoids-hedgehog] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/haddock-ghc-9.10.1
  1147. 151.40 s [duoids-hedgehog] No happy found
  1148. 151.40 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  1149. 151.40 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1150. 151.40 s [duoids-hedgehog] No hmake found
  1151. 151.40 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  1152. 151.40 s [duoids-hedgehog] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hpc-ghc-9.10.1
  1153. 151.40 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  1154. 151.40 s [duoids-hedgehog] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hsc2hs-ghc-9.10.1
  1155. 151.40 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  1156. 151.40 s [duoids-hedgehog] /nix/store/c0gbcvjjvqzy92m9ycv6zcqiczs6bvyw-hscolour-1.25/bin/HsColour
  1157. 151.40 s [duoids-hedgehog] No jhc found
  1158. 151.40 s [duoids-hedgehog] Using ld found on system at:
  1159. 151.40 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  1160. 151.40 s [duoids-hedgehog] No pkg-config found
  1161. 151.40 s [duoids-hedgehog] Using runghc version 9.10.1 found on system at:
  1162. 151.40 s [duoids-hedgehog] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/runghc-9.10.1
  1163. 151.40 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  1164. 151.40 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  1165. 151.40 s [duoids-hedgehog] Using tar found on system at:
  1166. 151.40 s [duoids-hedgehog] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  1167. 151.40 s [duoids-hedgehog] No uhc found
  1168. 152.17 s [duoids-hedgehog] Phase: buildPhase
  1169. 152.18 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1170. 152.18 s [duoidal-transformers] >=4.21.0 && <4.22: using base-4.20.0.0
  1171. 152.18 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  1172. 152.18 s [duoidal-transformers] Dependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.1
  1173. 152.18 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1174. 152.18 s [duoidal-transformers] >=4.21.0 && <4.22: using base-4.20.0.0
  1175. 152.18 s [duoidal-transformers] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  1176. 152.18 s [duoidal-transformers] <0.25: using doctest-0.22.6
  1177. 152.18 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  1178. 152.18 s [duoidal-transformers] Source component graph:
  1179. 152.18 s [duoidal-transformers] component lib
  1180. 152.18 s [duoidal-transformers] component test:doctests dependency lib
  1181. 152.18 s [duoidal-transformers] Configured component graph:
  1182. 152.18 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo
  1183. 152.18 s [duoidal-transformers] include base-4.20.0.0-d8e2
  1184. 152.18 s [duoidal-transformers] include duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  1185. 152.19 s [duoidal-transformers] include transformers-0.6.1.1-3641
  1186. 152.19 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-GBE6iK7qu8PGEbXqxJIaSm-doctests
  1187. 152.19 s [duoidal-transformers] include base-4.20.0.0-d8e2
  1188. 152.19 s [duoidal-transformers] include doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  1189. 152.19 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo
  1190. 152.19 s [duoidal-transformers] Linked component graph:
  1191. 152.19 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo
  1192. 152.19 s [duoidal-transformers] include base-4.20.0.0-d8e2
  1193. 152.19 s [duoidal-transformers] include duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  1194. 152.19 s [duoidal-transformers] include transformers-0.6.1.1-3641
  1195. 152.19 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo:Control.Duoidal.Trans.Orphans
  1196. 152.19 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-GBE6iK7qu8PGEbXqxJIaSm-doctests
  1197. 152.19 s [duoidal-transformers] include base-4.20.0.0-d8e2
  1198. 152.19 s [duoidal-transformers] include doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  1199. 152.19 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo
  1200. 152.19 s [duoidal-transformers] Ready component graph:
  1201. 152.19 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo
  1202. 152.19 s [duoidal-transformers] depends base-4.20.0.0-d8e2
  1203. 152.19 s [duoidal-transformers] depends duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  1204. 152.19 s [duoidal-transformers] depends transformers-0.6.1.1-3641
  1205. 152.19 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-GBE6iK7qu8PGEbXqxJIaSm-doctests
  1206. 152.19 s [duoidal-transformers] depends base-4.20.0.0-d8e2
  1207. 152.19 s [duoidal-transformers] depends doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  1208. 152.19 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo
  1209. 152.19 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1210. 152.19 s [duoidal-transformers] Using compiler: ghc-9.10.1
  1211. 152.19 s [duoidal-transformers] Using install prefix:
  1212. 152.19 s [duoidal-transformers] /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0
  1213. 152.19 s [duoidal-transformers] Executables installed in:
  1214. 152.19 s [duoidal-transformers] /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0/bin
  1215. 152.19 s [duoidal-transformers] Libraries installed in:
  1216. 152.19 s [duoidal-transformers] /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/duoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo
  1217. 152.19 s [duoidal-transformers] Dynamic Libraries installed in:
  1218. 152.19 s [duoidal-transformers] /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5
  1219. 152.19 s [duoidal-transformers] Private executables installed in:
  1220. 152.19 s [duoidal-transformers] /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.10.1-c9f5/duoidal-transformers-0.0.1.0
  1221. 152.19 s [duoidal-transformers] Data files installed in:
  1222. 152.19 s [duoidal-transformers] /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.10.1-c9f5/duoidal-transformers-0.0.1.0
  1223. 152.19 s [duoidal-transformers] Documentation installed in:
  1224. 152.19 s [duoidal-transformers] /nix/store/h6827lfblapvxn3hxhv6vssv2g39xzwx-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  1225. 152.19 s [duoidal-transformers] Configuration files installed in:
  1226. 152.19 s [duoidal-transformers] /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0/etc
  1227. 152.19 s [duoidal-transformers] No alex found
  1228. 152.19 s [duoidal-transformers] Using ar found on system at:
  1229. 152.19 s [duoidal-transformers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  1230. 152.19 s [duoidal-transformers] No c2hs found
  1231. 152.19 s [duoidal-transformers] No cpphs found
  1232. 152.19 s [duoidal-transformers] Using doctest version 0.22.6 found on system at:
  1233. 152.19 s [duoidal-transformers] /nix/store/2cb590hnnq4abkx6yb17l1iych2yf7bc-doctest-0.22.6/bin/doctest
  1234. 152.19 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  1235. 152.19 s [duoidal-transformers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  1236. 152.19 s [duoidal-transformers] Using ghc version 9.10.1 found on system at:
  1237. 152.19 s [duoidal-transformers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc
  1238. 152.19 s [duoidal-transformers] Using ghc-pkg version 9.10.1 found on system at:
  1239. 152.19 s [duoidal-transformers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc-pkg-9.10.1
  1240. 152.19 s [duoidal-transformers] No ghcjs found
  1241. 152.19 s [duoidal-transformers] No ghcjs-pkg found
  1242. 152.19 s [duoidal-transformers] No greencard found
  1243. 152.19 s [duoidal-transformers] Using haddock version 2.28.0 found on system at:
  1244. 152.19 s [duoidal-transformers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/haddock-ghc-9.10.1
  1245. 152.19 s [duoidal-transformers] No happy found
  1246. 152.19 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  1247. 152.19 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1248. 152.19 s [duoidal-transformers] No hmake found
  1249. 152.19 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  1250. 152.19 s [duoidal-transformers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hpc-ghc-9.10.1
  1251. 152.19 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  1252. 152.19 s [duoidal-transformers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hsc2hs-ghc-9.10.1
  1253. 152.19 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  1254. 152.19 s [duoidal-transformers] /nix/store/c0gbcvjjvqzy92m9ycv6zcqiczs6bvyw-hscolour-1.25/bin/HsColour
  1255. 152.19 s [duoidal-transformers] No jhc found
  1256. 152.19 s [duoidal-transformers] Using ld found on system at:
  1257. 152.19 s [duoidal-transformers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  1258. 152.19 s [duoidal-transformers] No pkg-config found
  1259. 152.19 s [duoidal-transformers] Using runghc version 9.10.1 found on system at:
  1260. 152.19 s [duoidal-transformers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/runghc-9.10.1
  1261. 152.19 s [duoidal-transformers] Using strip version 2.44 found on system at:
  1262. 152.19 s [duoidal-transformers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  1263. 152.19 s [duoidal-transformers] Using tar found on system at:
  1264. 152.19 s [duoidal-transformers] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  1265. 152.20 s [duoidal-transformers] No uhc found
  1266. 152.57 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1267. 152.57 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  1268. 152.80 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  1269. 153.01 s [duoidal-transformers] Phase: buildPhase
  1270. 153.36 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1271. 153.37 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  1272. 153.69 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 )
  1273. 153.96 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 )
  1274. 154.13 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  1275. 154.72 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  1276. 155.60 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 )
  1277. 156.38 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 )
  1278. 156.98 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  1279. 160.48 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1280. 160.53 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1281. 160.87 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1282. 160.87 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1283. 160.98 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  1284. 161.06 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1285. 161.85 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1286. 162.76 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  1287. 163.03 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  1288. 165.72 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1289. 165.74 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1290. 166.02 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1291. 166.68 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1292. 167.56 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  1293. 172.05 s [duoidal-transformers] Phase: checkPhase
  1294. 172.68 s [duoidal-transformers] Running 1 test suites...
  1295. 172.68 s [duoidal-transformers] Test suite doctests: RUNNING...
  1296. 173.65 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1297. 173.65 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1298. 173.65 s [duoidal-transformers]
  1299. 173.65 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1300. 173.65 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1301. 173.65 s [duoidal-transformers]
  1302. 173.66 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1303. 173.66 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1304. 173.66 s [duoidal-transformers]
  1305. 174.25 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1306. 174.33 s [duoidal-transformers] Test suite doctests: PASS
  1307. 174.33 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  1308. 174.33 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  1309. 174.35 s [duoidal-transformers] Phase: haddockPhase
  1310. 174.91 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1311. 174.91 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  1312. 175.50 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing )
  1313. 176.15 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing )
  1314. 176.68 s [duoidal-transformers] Haddock coverage:
  1315. 176.68 s [duoidal-transformers] 33% ( 1 / 3) in 'Control.Duoidal.Trans.Class'
  1316. 176.68 s [duoidal-transformers] Missing documentation for:
  1317. 176.68 s [duoidal-transformers] DuoidalTrans (src/Control/Duoidal/Trans/Class.hs:18)
  1318. 176.68 s [duoidal-transformers] NormalTrans (src/Control/Duoidal/Trans/Class.hs:22)
  1319. 176.68 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  1320. 176.69 s [duoids-hedgehog] Phase: checkPhase
  1321. 177.43 s [duoids-hedgehog] Running 2 test suites...
  1322. 177.44 s [duoids-hedgehog] Test suite laws: RUNNING...
  1323. 177.45 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  1324. 177.45 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1325. 177.46 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1326. 177.46 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1327. 177.46 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1328. 177.46 s [duoids-hedgehog] ✓ 4 succeeded.
  1329. 177.46 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  1330. 177.46 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1331. 177.46 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1332. 177.46 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1333. 177.46 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1334. 177.46 s [duoids-hedgehog] ✓ 4 succeeded.
  1335. 177.46 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  1336. 177.46 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1337. 177.46 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1338. 177.46 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1339. 177.46 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1340. 177.46 s [duoids-hedgehog] ✓ 4 succeeded.
  1341. 177.46 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  1342. 177.47 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1343. 177.47 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1344. 177.47 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1345. 177.47 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1346. 177.47 s [duoids-hedgehog] ✓ 4 succeeded.
  1347. 177.47 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  1348. 177.47 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1349. 177.47 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1350. 177.47 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1351. 177.47 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1352. 177.47 s [duoids-hedgehog] ✓ 4 succeeded.
  1353. 177.47 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  1354. 177.47 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1355. 177.47 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1356. 177.47 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1357. 177.47 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1358. 177.47 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1359. 177.47 s [duoids-hedgehog] ✓ 5 succeeded.
  1360. 177.47 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  1361. 177.48 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1362. 177.48 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1363. 177.48 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1364. 177.48 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1365. 177.48 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1366. 177.48 s [duoids-hedgehog] ✓ 5 succeeded.
  1367. 177.48 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  1368. 177.48 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1369. 177.48 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1370. 177.48 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1371. 177.48 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1372. 177.48 s [duoids-hedgehog] ✓ 4 succeeded.
  1373. 177.48 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  1374. 177.48 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1375. 177.48 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1376. 177.48 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1377. 177.48 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1378. 177.48 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1379. 177.49 s [duoids-hedgehog] ✓ 5 succeeded.
  1380. 177.49 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  1381. 177.49 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1382. 177.49 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1383. 177.49 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1384. 177.49 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1385. 177.49 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1386. 177.49 s [duoids-hedgehog] ✓ 5 succeeded.
  1387. 177.49 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  1388. 177.49 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1389. 177.49 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1390. 177.49 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1391. 177.49 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1392. 177.49 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1393. 177.49 s [duoids-hedgehog] ✓ 5 succeeded.
  1394. 177.49 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  1395. 177.50 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1396. 177.50 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1397. 177.50 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1398. 177.50 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1399. 177.50 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1400. 177.50 s [duoids-hedgehog] ✓ 5 succeeded.
  1401. 177.50 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  1402. 177.50 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1403. 177.50 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1404. 177.50 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1405. 177.50 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1406. 177.50 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1407. 177.50 s [duoids-hedgehog] ✓ 5 succeeded.
  1408. 177.65 s [duoids-hedgehog] Test suite laws: PASS
  1409. 177.65 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  1410. 177.65 s [duoids-hedgehog] Test suite doctests: RUNNING...
  1411. 179.42 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1412. 179.52 s [duoids-hedgehog] Test suite doctests: PASS
  1413. 179.56 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  1414. 179.56 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  1415. 179.67 s [duoids-hedgehog] Phase: haddockPhase
  1416. 179.71 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 )
  1417. 179.71 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 )
  1418. 179.71 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 )
  1419. 179.71 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 )
  1420. 179.71 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 )
  1421. 180.29 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1422. 180.29 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  1423. 180.45 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 )
  1424. 180.45 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 )
  1425. 181.27 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing )
  1426. 181.77 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing )
  1427. 181.95 s [duoids-hedgehog] Haddock coverage:
  1428. 181.95 s [duoids-hedgehog] 33% ( 1 / 3) in 'Test.Duoid'
  1429. 181.95 s [duoids-hedgehog] Missing documentation for:
  1430. 181.95 s [duoids-hedgehog] validate (src/Test/Duoid.hs:72)
  1431. 181.95 s [duoids-hedgehog] validateNormal (src/Test/Duoid.hs:82)
  1432. 181.95 s [duoids-hedgehog] 50% ( 1 / 2) in 'Test.Duoidal'
  1433. 181.95 s [duoids-hedgehog] Missing documentation for:
  1434. 181.95 s [duoids-hedgehog] validate (src/Test/Duoidal.hs:98)
  1435. 186.64 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  1436. 186.66 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  1437. 186.82 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1438. 186.84 s [duoidal-transformers] Phase: installPhase
  1439. 187.23 s [duoidal-transformers] Installing library in /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/duoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo
  1440. 187.95 s [duoidal-transformers] Phase: fixupPhase
  1441. 188.06 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0
  1442. 188.07 s [duoidal-transformers] shrinking /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSduoidal-transformers-0.0.1.0-Bvne6Z3OrFT5f7jWbWoCo-ghc9.10.1.so
  1443. 188.09 s [duoidal-transformers] checking for references to /build/ in /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0...
  1444. 188.14 s [duoidal-transformers] patching script interpreter paths in /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0
  1445. 188.15 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0/lib
  1446. 188.34 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/h6827lfblapvxn3hxhv6vssv2g39xzwx-duoidal-transformers-0.0.1.0-doc
  1447. 188.36 s [duoidal-transformers] checking for references to /build/ in /nix/store/h6827lfblapvxn3hxhv6vssv2g39xzwx-duoidal-transformers-0.0.1.0-doc...
  1448. 188.38 s [duoidal-transformers] patching script interpreter paths in /nix/store/h6827lfblapvxn3hxhv6vssv2g39xzwx-duoidal-transformers-0.0.1.0-doc
  1449. 189.00 s [duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/h6827lfblapvxn3hxhv6vssv2g39xzwx-duoidal-transformers-0.0.1.0-doc /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0
  1450. 190.26 s [duoidal-transformers:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  1451. 190.26 s [duoidal-transformers:post-build]
  1452. 190.63 s [duoidal-transformers:post-build] Pushing /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0 (641.86 KiB)
  1453. 190.80 s [duoidal-transformers:post-build] Pushing /nix/store/h6827lfblapvxn3hxhv6vssv2g39xzwx-duoidal-transformers-0.0.1.0-doc (345.41 KiB)
  1454. 191.81 s [duoidal-transformers:post-build]
  1455. 191.81 s [duoidal-transformers:post-build] All done.
  1456. 192.07 s [duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/h6827lfblapvxn3hxhv6vssv2g39xzwx-duoidal-transformers-0.0.1.0-doc /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0
  1457. 192.73 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1458. 192.80 s [duoidal-transformers:post-build] copying 2 paths...
  1459. 192.80 s [duoidal-transformers:post-build] copying path '/nix/store/h6827lfblapvxn3hxhv6vssv2g39xzwx-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1460. 193.40 s [duoidal-transformers:post-build] copying path '/nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  1461. 194.79 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1462. 195.49 s [duoidal-transformers:post-build] copying 1 paths...
  1463. 195.49 s [duoidal-transformers:post-build] copying path '/nix/store/z96v278n92c6dzbs64z27b6js90whsd3-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1464. 195.99 s Progress: 3 of 17 built (2 building), 155 of 155 downloaded from cache
  1465. 198.47 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 )
  1466. 199.06 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  1467. 199.06 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  1468. 199.26 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1469. 199.26 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1470. 199.28 s [duoids-hedgehog] Phase: installPhase
  1471. 199.65 s [duoids-hedgehog] Installing library in /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  1472. 200.40 s [duoids-hedgehog] Phase: fixupPhase
  1473. 200.51 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0
  1474. 200.51 s [duoids-hedgehog] shrinking /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSduoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc-ghc9.10.1.so
  1475. 200.53 s [duoids-hedgehog] checking for references to /build/ in /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0...
  1476. 200.61 s [duoids-hedgehog] patching script interpreter paths in /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0
  1477. 200.66 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0/lib
  1478. 200.99 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/b76hy1gnqqlrv5mw6zx2s52rcf63rj7l-duoids-hedgehog-0.0.1.0-doc
  1479. 201.01 s [duoids-hedgehog] checking for references to /build/ in /nix/store/b76hy1gnqqlrv5mw6zx2s52rcf63rj7l-duoids-hedgehog-0.0.1.0-doc...
  1480. 201.06 s [duoids-hedgehog] patching script interpreter paths in /nix/store/b76hy1gnqqlrv5mw6zx2s52rcf63rj7l-duoids-hedgehog-0.0.1.0-doc
  1481. 201.74 s [duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/b76hy1gnqqlrv5mw6zx2s52rcf63rj7l-duoids-hedgehog-0.0.1.0-doc /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0
  1482. 203.09 s [duoids-hedgehog:post-build] Pushing 2 paths (130 are already present) using zstd to cache sellout ⏳
  1483. 203.09 s [duoids-hedgehog:post-build]
  1484. 203.47 s [duoids-hedgehog:post-build] Pushing /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0 (505.17 KiB)
  1485. 203.49 s [duoids-hedgehog:post-build] Pushing /nix/store/b76hy1gnqqlrv5mw6zx2s52rcf63rj7l-duoids-hedgehog-0.0.1.0-doc (299.84 KiB)
  1486. 204.50 s [duoids-hedgehog:post-build]
  1487. 204.50 s [duoids-hedgehog:post-build] All done.
  1488. 204.71 s [duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/b76hy1gnqqlrv5mw6zx2s52rcf63rj7l-duoids-hedgehog-0.0.1.0-doc /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0
  1489. 205.26 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1490. 205.35 s [duoids-hedgehog:post-build] copying 2 paths...
  1491. 205.35 s [duoids-hedgehog:post-build] copying path '/nix/store/b76hy1gnqqlrv5mw6zx2s52rcf63rj7l-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1492. 205.85 s [duoids-hedgehog:post-build] copying path '/nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  1493. 207.13 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1494. 207.96 s [duoids-hedgehog:post-build] copying 38 paths...
  1495. 207.96 s [duoids-hedgehog:post-build] copying path '/nix/store/0gl4l6fm6ixk11mpz1hhfr0fx3zwckpa-boring-0.2.2.drv' to 'https://cache.nix-ci.com'...
  1496. 207.96 s [duoids-hedgehog:post-build] copying path '/nix/store/4crv25hbdsx8cp92vrbj338lk4cdg2wb-old-locale-1.0.0.7.drv' to 'https://cache.nix-ci.com'...
  1497. 207.97 s [duoids-hedgehog:post-build] copying path '/nix/store/5l4s2jbckz3ra9nk8387bxgrd8aadl8w-base-orphans-0.9.3.drv' to 'https://cache.nix-ci.com'...
  1498. 207.97 s [duoids-hedgehog:post-build] copying path '/nix/store/7wyhmvc2isgn682l1pqfziixa1223lh5-terminal-size-0.3.4.drv' to 'https://cache.nix-ci.com'...
  1499. 207.97 s [duoids-hedgehog:post-build] copying path '/nix/store/g0pqmaf03nyg40ay7010jj5xgzmi8x6l-regex-base-0.94.0.3.drv' to 'https://cache.nix-ci.com'...
  1500. 207.97 s [duoids-hedgehog:post-build] copying path '/nix/store/afk5hcdqsrwwj1f20b4g8p5p6y0chxd2-jailbreak-cabal-1.4.1.drv' to 'https://cache.nix-ci.com'...
  1501. 207.97 s [duoids-hedgehog:post-build] copying path '/nix/store/4l1gl4dckhff449l6n6hr2skkgf2ayf1-pretty-show-1.10.drv' to 'https://cache.nix-ci.com'...
  1502. 207.97 s [duoids-hedgehog:post-build] copying path '/nix/store/fpfqipy0p5m42xbmim7q8h9xjfjzdydk-mmorph-1.2.0.drv' to 'https://cache.nix-ci.com'...
  1503. 207.97 s [duoids-hedgehog:post-build] copying path '/nix/store/ll2pf5swimvnrc3mw3kk102i35gv703z-wl-pprint-annotated-0.1.0.1.drv' to 'https://cache.nix-ci.com'...
  1504. 207.97 s [duoids-hedgehog:post-build] copying path '/nix/store/h8xw7nyc1gh8hs0pn6sdaa9wjqj6q9b9-erf-2.0.0.0.drv' to 'https://cache.nix-ci.com'...
  1505. 207.98 s [duoids-hedgehog:post-build] copying path '/nix/store/j3q2c9018r2i704j52k2hhbyx5c0v8cm-void-0.7.3.drv' to 'https://cache.nix-ci.com'...
  1506. 207.98 s [duoids-hedgehog:post-build] copying path '/nix/store/myzrmndv3hk91v9gyq0ksri4a1c4wkv7-prettyprinter-compat-ansi-wl-pprint-1.0.2.drv' to 'https://cache.nix-ci.com'...
  1507. 208.06 s [duoids-hedgehog:post-build] copying path '/nix/store/wkwwpjafavv2ql0a03x4lfnpc3xkhznz-pcre-light-0.4.1.3.drv' to 'https://cache.nix-ci.com'...
  1508. 208.06 s [duoids-hedgehog:post-build] copying path '/nix/store/xis7rsn2ly1120y43hgryag0ckgg86nn-unliftio-core-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  1509. 208.12 s [duoids-hedgehog:post-build] copying path '/nix/store/xpy9xlps27xc864y1y7pzjwk2jjvlivn-th-abstraction-0.7.1.0.drv' to 'https://cache.nix-ci.com'...
  1510. 208.12 s [duoids-hedgehog:post-build] copying path '/nix/store/m3m1i0gjmxf83b4yp3mvnnpyl6k0fagq-hostname-1.0.drv' to 'https://cache.nix-ci.com'...
  1511. 208.38 s [duoids-hedgehog:post-build] copying path '/nix/store/zrfxrhiy6zi8pa6hmyjkhczijs7shcfl-xml-1.3.14.drv' to 'https://cache.nix-ci.com'...
  1512. 208.43 s [duoids-hedgehog:post-build] copying path '/nix/store/zscg5h42930mrdr0b38v4652baw8jbzk-extensible-exceptions-0.1.1.4.drv' to 'https://cache.nix-ci.com'...
  1513. 208.51 s [duoids-hedgehog:post-build] copying path '/nix/store/w249ibcsxslh5hsi2f2i72g80xql12d8-safe-exceptions-0.1.7.4.drv' to 'https://cache.nix-ci.com'...
  1514. 208.55 s [duoids-hedgehog:post-build] copying path '/nix/store/mwkxsh49mhxgxl7paj0c2llnsyfx31h1-transformers-base-0.4.6.drv' to 'https://cache.nix-ci.com'...
  1515. 208.55 s [duoids-hedgehog:post-build] copying path '/nix/store/8y65hv1gpaqcv78s1wcpa3sjbdwzzg2g-ansi-wl-pprint-1.0.2.drv' to 'https://cache.nix-ci.com'...
  1516. 208.55 s [duoids-hedgehog:post-build] copying path '/nix/store/rd18nv81yznc0jf27mndks9s5ngigarf-regex-posix-0.96.0.2.drv' to 'https://cache.nix-ci.com'...
  1517. 208.55 s [duoids-hedgehog:post-build] copying path '/nix/store/wicw4ynf9gg3cj0dx9bv4hml4sa1sg2l-resourcet-1.3.0.drv' to 'https://cache.nix-ci.com'...
  1518. 208.57 s [duoids-hedgehog:post-build] copying path '/nix/store/68wsmbzj57ynmdm8siyl96lbsi52br1k-tasty-quickcheck-0.11.drv' to 'https://cache.nix-ci.com'...
  1519. 208.58 s [duoids-hedgehog:post-build] copying path '/nix/store/yif39j1ddg5xjn50ifzfh8gqrd1yf64j-generic-deriving-1.14.6.drv' to 'https://cache.nix-ci.com'...
  1520. 208.73 s [duoids-hedgehog:post-build] copying path '/nix/store/nddlrg4akmfs8k6kj8cpvr5llwnpmvns-monad-control-1.0.3.1.drv' to 'https://cache.nix-ci.com'...
  1521. 208.76 s [duoids-hedgehog:post-build] copying path '/nix/store/wy2r2nkj59x7srg8sjwadapig7qcf2nj-test-framework-0.8.2.2.drv' to 'https://cache.nix-ci.com'...
  1522. 208.80 s [duoids-hedgehog:post-build] copying path '/nix/store/vq612a209w5xn4rijhq39xff1kmy7m9d-distributive-0.6.2.1.drv' to 'https://cache.nix-ci.com'...
  1523. 208.80 s [duoids-hedgehog:post-build] copying path '/nix/store/ifvlmnng99nzh8q5p8bmi6vqyc5g5ydc-hashable-1.4.7.0.drv' to 'https://cache.nix-ci.com'...
  1524. 209.96 s [duoids-hedgehog:post-build] copying path '/nix/store/y3cbvssj75fif2qsqcwh2l4qrzbbvlz2-test-framework-hunit-0.3.0.2.drv' to 'https://cache.nix-ci.com'...
  1525. 209.98 s [duoids-hedgehog:post-build] copying path '/nix/store/sllc3hfdkh16dcdgfybqf08g6xnjaviz-constraints-0.14.2.drv' to 'https://cache.nix-ci.com'...
  1526. 209.98 s [duoids-hedgehog:post-build] copying path '/nix/store/2zhnh9al4jkmkx693agncq7bfrx1vld5-barbies-2.1.1.0.drv' to 'https://cache.nix-ci.com'...
  1527. 210.10 s [duoids-hedgehog:post-build] copying path '/nix/store/fp8m44vpn97dffzahpd8bfs3alldpnq5-async-2.2.5.drv' to 'https://cache.nix-ci.com'...
  1528. 210.11 s [duoids-hedgehog:post-build] copying path '/nix/store/15cw4xv48c9x54nznw7ckgs58bf1lp4c-lifted-base-0.2.3.12.drv' to 'https://cache.nix-ci.com'...
  1529. 210.30 s [duoids-hedgehog:post-build] copying path '/nix/store/3wzr1k0l2pl4q8ss1lg9l3w1b4m9aifp-lifted-async-0.10.2.7.drv' to 'https://cache.nix-ci.com'...
  1530. 210.32 s [duoids-hedgehog:post-build] copying path '/nix/store/0jxcb7bh84lhfm4v56hha3gzg612znb6-concurrent-output-1.10.21.drv' to 'https://cache.nix-ci.com'...
  1531. 210.52 s [duoids-hedgehog:post-build] copying path '/nix/store/m5j9mxbrqd3qyd49jdi83cdv135jdrw7-hedgehog-1.5.drv' to 'https://cache.nix-ci.com'...
  1532. 210.66 s [duoids-hedgehog:post-build] copying path '/nix/store/khplkrx5xawd60m434swhnqbh1i3ys54-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1533. 211.22 s Progress: 4 of 16 built (1 building), 155 of 155 downloaded from cache
  1534. 213.47 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 )
  1535. 231.86 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 )
  1536. 233.49 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 )
  1537. 233.93 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  1538. 234.23 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 )
  1539. 235.25 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 )
  1540. 235.25 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  1541. 235.25 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  1542. 235.25 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 )
  1543. 247.05 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  1544. 253.42 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  1545. 259.72 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  1546. 261.65 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  1547. 281.78 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  1548. 281.78 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  1549. 314.40 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  1550. 314.41 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  1551. 314.41 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  1552. 314.41 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  1553. 314.41 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  1554. 314.41 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  1555. 314.41 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  1556. 330.53 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  1557. 343.66 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  1558. 362.04 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  1559. 365.29 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
  1560. 365.29 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0...
  1561. 365.93 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  1562. 370.03 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 )
  1563. 370.05 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  1564. 372.98 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  1565. 375.51 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  1566. 377.87 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  1567. 377.89 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  1568. 378.07 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 )
  1569. 387.52 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 )
  1570. 387.54 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 )
  1571. 388.47 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 )
  1572. 388.47 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 )
  1573. 388.47 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 )
  1574. 388.47 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 )
  1575. 388.47 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 )
  1576. 388.47 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 )
  1577. 388.47 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 )
  1578. 388.47 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 )
  1579. 388.47 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 )
  1580. 388.47 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 )
  1581. 388.47 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 )
  1582. 389.17 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 )
  1583. 399.17 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 )
  1584. 399.18 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 )
  1585. 400.29 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 )
  1586. 400.29 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 )
  1587. 400.29 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 )
  1588. 400.29 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 )
  1589. 400.30 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 )
  1590. 400.30 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 )
  1591. 400.30 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 )
  1592. 400.30 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 )
  1593. 400.30 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  1594. 400.30 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 )
  1595. 400.30 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 )
  1596. 403.80 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
  1597. 403.81 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0...
  1598. 404.06 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 )
  1599. 405.01 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 )
  1600. 438.75 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 )
  1601. 438.77 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  1602. 438.77 s [vector] In the use of ‘tail’
  1603. 438.77 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1604. 438.77 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"."
  1605. 438.77 s [vector] |
  1606. 438.77 s [vector] 244 | postscanl f z = tail . scanl f z
  1607. 438.77 s [vector] | ^^^^
  1608. 438.77 s [vector]
  1609. 438.77 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  1610. 438.77 s [vector] In the use of ‘tail’
  1611. 438.77 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1612. 438.77 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"."
  1613. 438.77 s [vector] |
  1614. 438.77 s [vector] 245 | prescanr f z = tail . scanr f z
  1615. 438.77 s [vector] | ^^^^
  1616. 438.77 s [vector]
  1617. 438.77 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 )
  1618. 438.77 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  1619. 438.77 s [vector] In the use of ‘head’
  1620. 438.77 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1621. 438.77 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"."
  1622. 438.77 s [vector] |
  1623. 438.77 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  1624. 438.77 s [vector] | ^^^^
  1625. 438.77 s [vector]
  1626. 438.77 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  1627. 438.77 s [vector] In the use of ‘head’
  1628. 438.77 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1629. 438.77 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"."
  1630. 438.77 s [vector] |
  1631. 438.77 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  1632. 438.77 s [vector] | ^^^^
  1633. 438.77 s [vector]
  1634. 438.77 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  1635. 438.77 s [vector] In the use of ‘tail’
  1636. 438.77 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1637. 438.77 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"."
  1638. 438.77 s [vector] |
  1639. 438.77 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  1640. 438.77 s [vector] | ^^^^
  1641. 438.77 s [vector]
  1642. 438.77 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  1643. 438.77 s [vector] In the use of ‘head’
  1644. 438.77 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1645. 438.77 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"."
  1646. 438.77 s [vector] |
  1647. 438.77 s [vector] 439 | = V.uniq `eq` (map head . group)
  1648. 438.77 s [vector] | ^^^^
  1649. 438.77 s [vector]
  1650. 455.66 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 )
  1651. 563.58 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 )
  1652. 563.60 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 )
  1653. 563.60 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 )
  1654. 563.60 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 )
  1655. 563.60 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 )
  1656. 563.60 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 )
  1657. 563.60 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  1658. 563.60 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  1659. 563.60 s [vector] |
  1660. 563.60 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  1661. 563.61 s [vector] | ^^^^^^
  1662. 563.61 s [vector]
  1663. 563.61 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  1664. 563.61 s [vector] In the use of ‘head’
  1665. 563.61 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1666. 563.61 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"."
  1667. 563.61 s [vector] |
  1668. 563.61 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  1669. 563.61 s [vector] | ^^^^
  1670. 563.61 s [vector]
  1671. 563.61 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  1672. 563.61 s [vector] In the use of ‘tail’
  1673. 563.61 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1674. 563.61 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"."
  1675. 563.61 s [vector] |
  1676. 563.61 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  1677. 563.61 s [vector] | ^^^^
  1678. 563.61 s [vector]
  1679. 563.61 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 )
  1680. 565.72 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  1681. 567.97 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
  1682. 567.97 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0...
  1683. 568.15 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  1684. 569.29 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  1685. 577.79 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  1686. 577.80 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  1687. 578.20 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 )
  1688. 579.09 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 )
  1689. 582.83 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 )
  1690. 582.84 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  1691. 582.84 s [vector] In the use of ‘tail’
  1692. 582.84 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1693. 582.84 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"."
  1694. 582.84 s [vector] |
  1695. 582.84 s [vector] 244 | postscanl f z = tail . scanl f z
  1696. 582.84 s [vector] | ^^^^
  1697. 582.84 s [vector]
  1698. 582.84 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  1699. 582.84 s [vector] In the use of ‘tail’
  1700. 582.84 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1701. 582.84 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"."
  1702. 582.84 s [vector] |
  1703. 582.84 s [vector] 245 | prescanr f z = tail . scanr f z
  1704. 582.84 s [vector] | ^^^^
  1705. 582.84 s [vector]
  1706. 582.84 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 )
  1707. 582.84 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  1708. 582.84 s [vector] In the use of ‘head’
  1709. 582.84 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1710. 582.84 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"."
  1711. 582.84 s [vector] |
  1712. 582.84 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  1713. 582.84 s [vector] | ^^^^
  1714. 582.84 s [vector]
  1715. 582.84 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  1716. 582.84 s [vector] In the use of ‘head’
  1717. 582.84 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1718. 582.84 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"."
  1719. 582.84 s [vector] |
  1720. 582.84 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  1721. 582.84 s [vector] | ^^^^
  1722. 582.84 s [vector]
  1723. 582.84 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  1724. 582.84 s [vector] In the use of ‘tail’
  1725. 582.84 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1726. 582.85 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"."
  1727. 582.85 s [vector] |
  1728. 582.85 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  1729. 582.85 s [vector] | ^^^^
  1730. 582.85 s [vector]
  1731. 582.85 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  1732. 582.85 s [vector] In the use of ‘head’
  1733. 582.85 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1734. 582.85 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"."
  1735. 582.85 s [vector] |
  1736. 582.85 s [vector] 439 | = V.uniq `eq` (map head . group)
  1737. 582.85 s [vector] | ^^^^
  1738. 582.85 s [vector]
  1739. 585.86 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 )
  1740. 586.60 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 )
  1741. 586.70 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 )
  1742. 586.70 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 )
  1743. 586.70 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 )
  1744. 586.70 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 )
  1745. 586.70 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 )
  1746. 586.70 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  1747. 586.70 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  1748. 586.70 s [vector] |
  1749. 586.70 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  1750. 586.70 s [vector] | ^^^^^^
  1751. 586.70 s [vector]
  1752. 586.70 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  1753. 586.70 s [vector] In the use of ‘head’
  1754. 586.70 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1755. 586.70 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"."
  1756. 586.70 s [vector] |
  1757. 586.70 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  1758. 586.70 s [vector] | ^^^^
  1759. 586.70 s [vector]
  1760. 586.70 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  1761. 586.70 s [vector] In the use of ‘tail’
  1762. 586.70 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1763. 586.70 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"."
  1764. 586.70 s [vector] |
  1765. 586.70 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  1766. 586.70 s [vector] | ^^^^
  1767. 586.70 s [vector]
  1768. 586.70 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 )
  1769. 588.45 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  1770. 591.19 s [vector] buildPhase completed in 8 minutes 53 seconds
  1771. 591.19 s [vector] Phase: checkPhase
  1772. 591.93 s [vector] Running 2 test suites...
  1773. 591.93 s [vector] Test suite vector-tests-O0: RUNNING...
  1774. 592.03 s [vector] toplevel
  1775. 592.03 s [vector] Data.Vector.Fusion.Bundle
  1776. 592.04 s [vector] fromList.toList == id: OK (0.04s)
  1777. 592.08 s [vector] +++ OK, passed 100 tests.
  1778. 592.08 s [vector] toList.fromList == id: OK
  1779. 592.08 s [vector] +++ OK, passed 100 tests.
  1780. 592.08 s [vector] eq: OK
  1781. 592.08 s [vector] +++ OK, passed 100 tests.
  1782. 592.08 s [vector] length: OK
  1783. 592.08 s [vector] +++ OK, passed 100 tests.
  1784. 592.08 s [vector] null: OK
  1785. 592.08 s [vector] +++ OK, passed 100 tests.
  1786. 592.08 s [vector] empty: OK
  1787. 592.08 s [vector] +++ OK, passed 1 test.
  1788. 592.08 s [vector] singleton: OK
  1789. 592.08 s [vector] +++ OK, passed 100 tests.
  1790. 592.08 s [vector] replicate: OK
  1791. 592.08 s [vector] +++ OK, passed 100 tests.
  1792. 592.08 s [vector] cons: OK
  1793. 592.08 s [vector] +++ OK, passed 100 tests.
  1794. 592.08 s [vector] snoc: OK
  1795. 592.08 s [vector] +++ OK, passed 100 tests.
  1796. 592.08 s [vector] append: OK
  1797. 592.08 s [vector] +++ OK, passed 100 tests.
  1798. 592.08 s [vector] head: OK
  1799. 592.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1800. 592.08 s [vector] last: OK
  1801. 592.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1802. 592.08 s [vector] index: OK
  1803. 592.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1804. 592.08 s [vector] extract: OK
  1805. 592.08 s [vector] +++ OK, passed 100 tests.
  1806. 592.08 s [vector] init: OK
  1807. 592.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1808. 592.08 s [vector] tail: OK
  1809. 592.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1810. 592.08 s [vector] take: OK
  1811. 592.08 s [vector] +++ OK, passed 100 tests.
  1812. 592.08 s [vector] drop: OK
  1813. 592.09 s [vector] +++ OK, passed 100 tests.
  1814. 592.09 s [vector] map: OK
  1815. 592.09 s [vector] +++ OK, passed 100 tests.
  1816. 592.09 s [vector] zipWith: OK
  1817. 592.09 s [vector] +++ OK, passed 100 tests.
  1818. 592.09 s [vector] zipWith3: OK
  1819. 592.09 s [vector] +++ OK, passed 100 tests.
  1820. 592.09 s [vector] filter: OK
  1821. 592.09 s [vector] +++ OK, passed 100 tests.
  1822. 592.09 s [vector] takeWhile: OK
  1823. 592.09 s [vector] +++ OK, passed 100 tests.
  1824. 592.09 s [vector] dropWhile: OK
  1825. 592.09 s [vector] +++ OK, passed 100 tests.
  1826. 592.09 s [vector] elem: OK
  1827. 592.09 s [vector] +++ OK, passed 100 tests.
  1828. 592.09 s [vector] notElem: OK
  1829. 592.09 s [vector] +++ OK, passed 100 tests.
  1830. 592.09 s [vector] find: OK
  1831. 592.09 s [vector] +++ OK, passed 100 tests.
  1832. 592.09 s [vector] findIndex: OK
  1833. 592.09 s [vector] +++ OK, passed 100 tests.
  1834. 592.09 s [vector] foldl: OK
  1835. 592.09 s [vector] +++ OK, passed 100 tests.
  1836. 592.09 s [vector] foldl1: OK
  1837. 592.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1838. 592.09 s [vector] foldl': OK
  1839. 592.09 s [vector] +++ OK, passed 100 tests.
  1840. 592.10 s [vector] foldl1': OK
  1841. 592.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1842. 592.10 s [vector] foldr: OK
  1843. 592.10 s [vector] +++ OK, passed 100 tests.
  1844. 592.10 s [vector] foldr1: OK
  1845. 592.11 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1846. 592.11 s [vector] prescanl: OK
  1847. 592.11 s [vector] +++ OK, passed 100 tests.
  1848. 592.11 s [vector] prescanl': OK
  1849. 592.11 s [vector] +++ OK, passed 100 tests.
  1850. 592.12 s [vector] postscanl: OK
  1851. 592.12 s [vector] +++ OK, passed 100 tests.
  1852. 592.12 s [vector] postscanl': OK
  1853. 592.12 s [vector] +++ OK, passed 100 tests.
  1854. 592.13 s [vector] scanl: OK
  1855. 592.13 s [vector] +++ OK, passed 100 tests.
  1856. 592.13 s [vector] scanl': OK
  1857. 592.13 s [vector] +++ OK, passed 100 tests.
  1858. 592.13 s [vector] scanl1: OK
  1859. 592.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1860. 592.13 s [vector] scanl1': OK
  1861. 592.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1862. 592.14 s [vector] concatMap: OK
  1863. 592.14 s [vector] +++ OK, passed 100 tests.
  1864. 592.14 s [vector] unfoldr: OK
  1865. 592.14 s [vector] +++ OK, passed 100 tests.
  1866. 592.14 s [vector] and: OK
  1867. 592.14 s [vector] +++ OK, passed 100 tests.
  1868. 592.14 s [vector] or: OK
  1869. 592.14 s [vector] +++ OK, passed 100 tests.
  1870. 592.14 s [vector] Tests.Vector.Boxed
  1871. 592.14 s [vector] Bool
  1872. 592.14 s [vector] fromList.toList == id: OK
  1873. 592.14 s [vector] +++ OK, passed 100 tests.
  1874. 592.14 s [vector] toList.fromList == id: OK
  1875. 592.14 s [vector] +++ OK, passed 100 tests.
  1876. 592.14 s [vector] unstream.stream == id: OK
  1877. 592.14 s [vector] +++ OK, passed 100 tests.
  1878. 592.14 s [vector] stream.unstream == id: OK
  1879. 592.14 s [vector] +++ OK, passed 100 tests.
  1880. 592.14 s [vector] eq: OK
  1881. 592.14 s [vector] +++ OK, passed 100 tests.
  1882. 592.14 s [vector] length: OK
  1883. 592.14 s [vector] +++ OK, passed 100 tests.
  1884. 592.15 s [vector] null: OK
  1885. 592.15 s [vector] +++ OK, passed 100 tests.
  1886. 592.15 s [vector] index: OK
  1887. 592.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1888. 592.15 s [vector] safeIndex: OK
  1889. 592.15 s [vector] +++ OK, passed 100 tests.
  1890. 592.15 s [vector] head: OK
  1891. 592.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1892. 592.15 s [vector] last: OK
  1893. 592.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1894. 592.15 s [vector] unsafeIndex: OK
  1895. 592.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1896. 592.24 s [vector] unsafeHead: OK
  1897. 592.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1898. 592.24 s [vector] unsafeLast: OK
  1899. 592.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1900. 592.24 s [vector] slice: OK
  1901. 592.24 s [vector] +++ OK, passed 100 tests.
  1902. 592.24 s [vector] init: OK
  1903. 592.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1904. 592.24 s [vector] tail: OK
  1905. 592.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1906. 592.24 s [vector] take: OK
  1907. 592.24 s [vector] +++ OK, passed 100 tests.
  1908. 592.24 s [vector] drop: OK
  1909. 592.24 s [vector] +++ OK, passed 100 tests.
  1910. 592.24 s [vector] splitAt: OK
  1911. 592.24 s [vector] +++ OK, passed 100 tests.
  1912. 592.24 s [vector] empty: OK
  1913. 592.24 s [vector] +++ OK, passed 1 test.
  1914. 592.24 s [vector] singleton: OK
  1915. 592.24 s [vector] +++ OK, passed 100 tests.
  1916. 592.24 s [vector] replicate: OK
  1917. 592.24 s [vector] +++ OK, passed 100 tests.
  1918. 592.24 s [vector] generate: OK
  1919. 592.24 s [vector] +++ OK, passed 100 tests.
  1920. 592.24 s [vector] iterateN: OK
  1921. 592.24 s [vector] +++ OK, passed 100 tests.
  1922. 592.45 s [vector] iterateNM: OK (0.27s)
  1923. 592.45 s [vector] +++ OK, passed 100 tests.
  1924. 592.49 s [vector] generateM: OK (0.05s)
  1925. 592.49 s [vector] +++ OK, passed 100 tests.
  1926. 592.49 s [vector] replicateM: OK
  1927. 592.49 s [vector] +++ OK, passed 100 tests.
  1928. 592.49 s [vector] create: OK
  1929. 592.49 s [vector] +++ OK, passed 100 tests.
  1930. 592.49 s [vector] createT: OK
  1931. 592.49 s [vector] +++ OK, passed 100 tests.
  1932. 592.49 s [vector] unfoldr: OK
  1933. 592.49 s [vector] +++ OK, passed 100 tests.
  1934. 592.49 s [vector] unfoldrN: OK
  1935. 592.49 s [vector] +++ OK, passed 100 tests.
  1936. 592.50 s [vector] unfoldrExactN: OK
  1937. 592.50 s [vector] +++ OK, passed 100 tests.
  1938. 592.50 s [vector] unfoldrM: OK
  1939. 592.50 s [vector] +++ OK, passed 100 tests.
  1940. 592.52 s [vector] unfoldrNM: OK
  1941. 592.52 s [vector] +++ OK, passed 100 tests.
  1942. 592.57 s [vector] unfoldrExactNM: OK (0.07s)
  1943. 592.58 s [vector] +++ OK, passed 100 tests.
  1944. 592.58 s [vector] constructN: OK
  1945. 592.58 s [vector] +++ OK, passed 100 tests.
  1946. 592.58 s [vector] constructrN: OK
  1947. 592.58 s [vector] +++ OK, passed 100 tests.
  1948. 592.58 s [vector] cons: OK
  1949. 592.58 s [vector] +++ OK, passed 100 tests.
  1950. 592.58 s [vector] snoc: OK
  1951. 592.58 s [vector] +++ OK, passed 100 tests.
  1952. 592.58 s [vector] append: OK
  1953. 592.58 s [vector] +++ OK, passed 100 tests.
  1954. 592.60 s [vector] concat: OK (0.01s)
  1955. 592.60 s [vector] +++ OK, passed 100 tests.
  1956. 592.60 s [vector] force: OK
  1957. 592.60 s [vector] +++ OK, passed 100 tests.
  1958. 592.60 s [vector] upd: OK
  1959. 592.60 s [vector] +++ OK, passed 100 tests.
  1960. 592.60 s [vector] accum: OK
  1961. 592.60 s [vector] +++ OK, passed 100 tests.
  1962. 592.60 s [vector] reverse: OK
  1963. 592.60 s [vector] +++ OK, passed 100 tests.
  1964. 592.61 s [vector] backpermute: OK
  1965. 592.61 s [vector] +++ OK, passed 100 tests.
  1966. 592.61 s [vector] map: OK
  1967. 592.61 s [vector] +++ OK, passed 100 tests.
  1968. 592.61 s [vector] imap: OK
  1969. 592.61 s [vector] +++ OK, passed 100 tests.
  1970. 592.62 s [vector] concatMap: OK
  1971. 592.62 s [vector] +++ OK, passed 100 tests.
  1972. 592.62 s [vector] mapM: OK
  1973. 592.62 s [vector] +++ OK, passed 100 tests.
  1974. 592.64 s [vector] mapM_: OK (0.02s)
  1975. 592.64 s [vector] +++ OK, passed 100 tests.
  1976. 592.64 s [vector] forM: OK
  1977. 592.64 s [vector] +++ OK, passed 100 tests.
  1978. 592.66 s [vector] forM_: OK (0.02s)
  1979. 592.66 s [vector] +++ OK, passed 100 tests.
  1980. 592.68 s [vector] imapM: OK
  1981. 592.68 s [vector] +++ OK, passed 100 tests.
  1982. 592.69 s [vector] imapM_: OK (0.02s)
  1983. 592.69 s [vector] +++ OK, passed 100 tests.
  1984. 592.69 s [vector] zipWith: OK
  1985. 592.69 s [vector] +++ OK, passed 100 tests.
  1986. 592.69 s [vector] zipWith3: OK
  1987. 592.69 s [vector] +++ OK, passed 100 tests.
  1988. 592.69 s [vector] izipWith: OK
  1989. 592.69 s [vector] +++ OK, passed 100 tests.
  1990. 592.70 s [vector] izipWith3: OK
  1991. 592.70 s [vector] +++ OK, passed 100 tests.
  1992. 592.70 s [vector] izipWithM: OK
  1993. 592.70 s [vector] +++ OK, passed 100 tests.
  1994. 592.72 s [vector] izipWithM_: OK (0.02s)
  1995. 592.72 s [vector] +++ OK, passed 100 tests.
  1996. 592.72 s [vector] zipWithM: OK
  1997. 592.72 s [vector] +++ OK, passed 100 tests.
  1998. 592.73 s [vector] zipWithM_: OK (0.01s)
  1999. 592.73 s [vector] +++ OK, passed 100 tests.
  2000. 592.73 s [vector] filter: OK
  2001. 592.74 s [vector] +++ OK, passed 100 tests.
  2002. 592.74 s [vector] ifilter: OK
  2003. 592.74 s [vector] +++ OK, passed 100 tests.
  2004. 592.77 s [vector] filterM: OK (0.03s)
  2005. 592.77 s [vector] +++ OK, passed 100 tests.
  2006. 592.77 s [vector] uniq: OK
  2007. 592.77 s [vector] +++ OK, passed 100 tests.
  2008. 592.77 s [vector] mapMaybe: OK
  2009. 592.78 s [vector] +++ OK, passed 100 tests.
  2010. 592.78 s [vector] imapMaybe: OK
  2011. 592.78 s [vector] +++ OK, passed 100 tests.
  2012. 592.78 s [vector] takeWhile: OK
  2013. 592.78 s [vector] +++ OK, passed 100 tests.
  2014. 592.78 s [vector] dropWhile: OK
  2015. 592.78 s [vector] +++ OK, passed 100 tests.
  2016. 592.78 s [vector] partition: OK
  2017. 592.78 s [vector] +++ OK, passed 100 tests.
  2018. 592.78 s [vector] partitionWith: OK
  2019. 592.78 s [vector] +++ OK, passed 100 tests.
  2020. 592.78 s [vector] span: OK
  2021. 592.78 s [vector] +++ OK, passed 100 tests.
  2022. 592.78 s [vector] break: OK
  2023. 592.78 s [vector] +++ OK, passed 100 tests.
  2024. 592.78 s [vector] spanR: OK
  2025. 592.79 s [vector] +++ OK, passed 100 tests.
  2026. 592.79 s [vector] breakR: OK
  2027. 592.79 s [vector] +++ OK, passed 100 tests.
  2028. 592.79 s [vector] groupBy: OK
  2029. 592.79 s [vector] +++ OK, passed 100 tests.
  2030. 592.79 s [vector] elem: OK
  2031. 592.79 s [vector] +++ OK, passed 100 tests.
  2032. 592.84 s [vector] notElem: OK
  2033. 592.84 s [vector] +++ OK, passed 100 tests.
  2034. 592.84 s [vector] find: OK
  2035. 592.84 s [vector] +++ OK, passed 100 tests.
  2036. 592.84 s [vector] findIndex: OK
  2037. 592.84 s [vector] +++ OK, passed 100 tests.
  2038. 592.84 s [vector] findIndexR: OK
  2039. 592.84 s [vector] +++ OK, passed 100 tests.
  2040. 592.84 s [vector] findIndices: OK
  2041. 592.84 s [vector] +++ OK, passed 100 tests.
  2042. 592.84 s [vector] elemIndex: OK
  2043. 592.84 s [vector] +++ OK, passed 100 tests.
  2044. 592.84 s [vector] elemIndices: OK
  2045. 592.84 s [vector] +++ OK, passed 100 tests.
  2046. 592.84 s [vector] foldl: OK
  2047. 592.84 s [vector] +++ OK, passed 100 tests.
  2048. 592.84 s [vector] foldl1: OK
  2049. 592.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2050. 592.84 s [vector] foldl': OK
  2051. 592.84 s [vector] +++ OK, passed 100 tests.
  2052. 592.84 s [vector] foldl1': OK
  2053. 592.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2054. 592.84 s [vector] foldr: OK
  2055. 592.84 s [vector] +++ OK, passed 100 tests.
  2056. 592.84 s [vector] foldr1: OK
  2057. 592.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2058. 592.84 s [vector] foldr': OK
  2059. 592.84 s [vector] +++ OK, passed 100 tests.
  2060. 592.84 s [vector] foldr1': OK
  2061. 592.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2062. 592.84 s [vector] ifoldl: OK
  2063. 592.84 s [vector] +++ OK, passed 100 tests.
  2064. 592.84 s [vector] ifoldl': OK
  2065. 592.84 s [vector] +++ OK, passed 100 tests.
  2066. 592.84 s [vector] ifoldr: OK
  2067. 592.84 s [vector] +++ OK, passed 100 tests.
  2068. 592.84 s [vector] ifoldr': OK
  2069. 592.84 s [vector] +++ OK, passed 100 tests.
  2070. 592.84 s [vector] ifoldM: OK
  2071. 592.84 s [vector] +++ OK, passed 100 tests.
  2072. 592.84 s [vector] ifoldM': OK
  2073. 592.84 s [vector] +++ OK, passed 100 tests.
  2074. 592.84 s [vector] ifoldM_: OK (0.01s)
  2075. 592.84 s [vector] +++ OK, passed 100 tests.
  2076. 592.85 s [vector] ifoldM'_: OK (0.02s)
  2077. 592.85 s [vector] +++ OK, passed 100 tests.
  2078. 592.85 s [vector] all: OK
  2079. 592.86 s [vector] +++ OK, passed 100 tests.
  2080. 592.86 s [vector] any: OK
  2081. 592.86 s [vector] +++ OK, passed 100 tests.
  2082. 592.86 s [vector] prescanl: OK
  2083. 592.86 s [vector] +++ OK, passed 100 tests.
  2084. 592.86 s [vector] prescanl': OK
  2085. 592.86 s [vector] +++ OK, passed 100 tests.
  2086. 592.86 s [vector] postscanl: OK
  2087. 592.87 s [vector] +++ OK, passed 100 tests.
  2088. 592.87 s [vector] postscanl': OK
  2089. 592.87 s [vector] +++ OK, passed 100 tests.
  2090. 592.87 s [vector] scanl: OK
  2091. 592.88 s [vector] +++ OK, passed 100 tests.
  2092. 592.88 s [vector] scanl': OK
  2093. 592.88 s [vector] +++ OK, passed 100 tests.
  2094. 592.88 s [vector] scanl1: OK
  2095. 592.88 s [vector] +++ OK, passed 100 tests.
  2096. 592.88 s [vector] scanl1': OK
  2097. 592.88 s [vector] +++ OK, passed 100 tests.
  2098. 592.88 s [vector] iscanl: OK
  2099. 592.88 s [vector] +++ OK, passed 100 tests.
  2100. 592.88 s [vector] iscanl': OK
  2101. 592.88 s [vector] +++ OK, passed 100 tests.
  2102. 592.88 s [vector] prescanr: OK
  2103. 592.88 s [vector] +++ OK, passed 100 tests.
  2104. 592.88 s [vector] prescanr': OK
  2105. 592.88 s [vector] +++ OK, passed 100 tests.
  2106. 592.88 s [vector] postscanr: OK
  2107. 592.89 s [vector] +++ OK, passed 100 tests.
  2108. 592.89 s [vector] postscanr': OK
  2109. 592.89 s [vector] +++ OK, passed 100 tests.
  2110. 592.89 s [vector] scanr: OK
  2111. 592.89 s [vector] +++ OK, passed 100 tests.
  2112. 592.89 s [vector] scanr': OK
  2113. 592.89 s [vector] +++ OK, passed 100 tests.
  2114. 592.90 s [vector] scanr1: OK
  2115. 592.90 s [vector] +++ OK, passed 100 tests.
  2116. 592.90 s [vector] scanr1': OK
  2117. 592.90 s [vector] +++ OK, passed 100 tests.
  2118. 592.90 s [vector] iscanr: OK
  2119. 592.90 s [vector] +++ OK, passed 100 tests.
  2120. 592.91 s [vector] iscanr': OK
  2121. 592.91 s [vector] +++ OK, passed 100 tests.
  2122. 592.91 s [vector] mut_read: OK
  2123. 592.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2124. 592.91 s [vector] mut_write: OK
  2125. 592.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2126. 592.91 s [vector] mut_modify: OK
  2127. 592.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2128. 592.92 s [vector] mut_generate: OK
  2129. 592.92 s [vector] +++ OK, passed 100 tests.
  2130. 592.94 s [vector] mut_generateM: OK (0.01s)
  2131. 592.94 s [vector] +++ OK, passed 100 tests.
  2132. 592.96 s [vector] mut_mapM_: OK (0.01s)
  2133. 592.96 s [vector] +++ OK, passed 100 tests.
  2134. 592.96 s [vector] mut_imapM_: OK (0.02s)
  2135. 592.96 s [vector] +++ OK, passed 100 tests.
  2136. 592.98 s [vector] mut_forM_: OK (0.01s)
  2137. 592.98 s [vector] +++ OK, passed 100 tests.
  2138. 592.99 s [vector] mut_iforM_: OK (0.01s)
  2139. 592.99 s [vector] +++ OK, passed 100 tests.
  2140. 593.00 s [vector] mut_foldr: OK
  2141. 593.00 s [vector] +++ OK, passed 100 tests.
  2142. 593.00 s [vector] mut_foldr': OK
  2143. 593.00 s [vector] +++ OK, passed 100 tests.
  2144. 593.00 s [vector] mut_foldl: OK
  2145. 593.00 s [vector] +++ OK, passed 100 tests.
  2146. 593.00 s [vector] mut_foldl': OK
  2147. 593.00 s [vector] +++ OK, passed 100 tests.
  2148. 593.01 s [vector] mut_ifoldr: OK
  2149. 593.01 s [vector] +++ OK, passed 100 tests.
  2150. 593.01 s [vector] mut_ifoldr': OK
  2151. 593.01 s [vector] +++ OK, passed 100 tests.
  2152. 593.02 s [vector] mut_ifoldl: OK
  2153. 593.02 s [vector] +++ OK, passed 100 tests.
  2154. 593.02 s [vector] mut_ifoldl': OK
  2155. 593.03 s [vector] +++ OK, passed 100 tests.
  2156. 593.04 s [vector] mut_foldM: OK
  2157. 593.04 s [vector] +++ OK, passed 100 tests.
  2158. 593.04 s [vector] mut_foldM': OK
  2159. 593.04 s [vector] +++ OK, passed 100 tests.
  2160. 593.04 s [vector] mut_foldrM: OK
  2161. 593.04 s [vector] +++ OK, passed 100 tests.
  2162. 593.04 s [vector] mut_foldrM': OK
  2163. 593.05 s [vector] +++ OK, passed 100 tests.
  2164. 593.05 s [vector] mut_ifoldM: OK
  2165. 593.05 s [vector] +++ OK, passed 100 tests.
  2166. 593.06 s [vector] mut_ifoldM': OK
  2167. 593.06 s [vector] +++ OK, passed 100 tests.
  2168. 593.06 s [vector] mut_ifoldrM: OK
  2169. 593.06 s [vector] +++ OK, passed 100 tests.
  2170. 593.06 s [vector] mut_ifoldrM': OK
  2171. 593.06 s [vector] +++ OK, passed 100 tests.
  2172. 593.07 s [vector] compare: OK
  2173. 593.07 s [vector] +++ OK, passed 100 tests.
  2174. 593.07 s [vector] maximum: OK
  2175. 593.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2176. 593.07 s [vector] minimum: OK
  2177. 593.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2178. 593.07 s [vector] minIndex: OK
  2179. 593.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2180. 593.07 s [vector] maxIndex: OK
  2181. 593.07 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2182. 593.07 s [vector] maximumBy: OK
  2183. 593.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2184. 593.07 s [vector] minimumBy: OK
  2185. 593.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2186. 593.08 s [vector] maximumOn: OK
  2187. 593.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2188. 593.08 s [vector] minimumOn: OK
  2189. 593.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2190. 593.08 s [vector] maxIndexBy: OK
  2191. 593.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2192. 593.08 s [vector] minIndexBy: OK
  2193. 593.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2194. 593.08 s [vector] ListFirstMaxIndexWins: OK
  2195. 593.08 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2196. 593.08 s [vector] FalseListFirstMaxIndexWins: OK
  2197. 593.08 s [vector] +++ OK, failed as expected. (after 1 test):
  2198. 593.08 s [vector] Exception:
  2199. 593.08 s [vector] Prelude.foldr1: empty list
  2200. 593.08 s [vector] CallStack (from HasCallStack):
  2201. 593.08 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  2202. 593.08 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  2203. 593.08 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  2204. 593.09 s [vector] []
  2205. 593.09 s [vector] zip: OK
  2206. 593.09 s [vector] +++ OK, passed 100 tests.
  2207. 593.09 s [vector] zip3: OK
  2208. 593.09 s [vector] +++ OK, passed 100 tests.
  2209. 593.10 s [vector] unzip: OK
  2210. 593.10 s [vector] +++ OK, passed 100 tests.
  2211. 593.10 s [vector] unzip3: OK
  2212. 593.10 s [vector] +++ OK, passed 100 tests.
  2213. 593.10 s [vector] indexed: OK
  2214. 593.10 s [vector] +++ OK, passed 100 tests.
  2215. 593.12 s [vector] update: OK
  2216. 593.12 s [vector] +++ OK, passed 100 tests.
  2217. 593.12 s [vector] concat: OK (0.02s)
  2218. 593.12 s [vector] +++ OK, passed 100 tests.
  2219. 593.12 s [vector] mempty: OK
  2220. 593.12 s [vector] +++ OK, passed 1 test.
  2221. 593.14 s [vector] mappend: OK
  2222. 593.14 s [vector] +++ OK, passed 100 tests.
  2223. 593.14 s [vector] mconcat: OK (0.01s)
  2224. 593.14 s [vector] +++ OK, passed 100 tests.
  2225. 593.14 s [vector] fmap: OK
  2226. 593.16 s [vector] +++ OK, passed 100 tests.
  2227. 593.16 s [vector] return: OK
  2228. 593.16 s [vector] +++ OK, passed 100 tests.
  2229. 593.17 s [vector] bind: OK (0.03s)
  2230. 593.17 s [vector] +++ OK, passed 100 tests.
  2231. 593.17 s [vector] mzip: OK
  2232. 593.17 s [vector] +++ OK, passed 100 tests.
  2233. 593.17 s [vector] munzip: OK
  2234. 593.17 s [vector] +++ OK, passed 100 tests.
  2235. 593.17 s [vector] applicative_pure: OK
  2236. 593.17 s [vector] +++ OK, passed 100 tests.
  2237. 593.21 s [vector] applicative_appl: OK (0.03s)
  2238. 593.21 s [vector] +++ OK, passed 100 tests.
  2239. 593.21 s [vector] alternative_empty: OK
  2240. 593.21 s [vector] +++ OK, passed 1 test.
  2241. 593.22 s [vector] alternative_or: OK
  2242. 593.22 s [vector] +++ OK, passed 100 tests.
  2243. 593.26 s [vector] sequence: OK (0.05s)
  2244. 593.26 s [vector] +++ OK, passed 100 tests.
  2245. 593.27 s [vector] sequence_: OK (0.01s)
  2246. 593.27 s [vector] +++ OK, passed 100 tests.
  2247. 593.28 s [vector] glength: OK
  2248. 593.28 s [vector] +++ OK, passed 100 tests.
  2249. 593.28 s [vector] and: OK
  2250. 593.28 s [vector] +++ OK, passed 100 tests.
  2251. 593.28 s [vector] or: OK
  2252. 593.28 s [vector] +++ OK, passed 100 tests.
  2253. 593.28 s [vector] Int
  2254. 593.28 s [vector] fromList.toList == id: OK
  2255. 593.28 s [vector] +++ OK, passed 100 tests.
  2256. 593.28 s [vector] toList.fromList == id: OK
  2257. 593.28 s [vector] +++ OK, passed 100 tests.
  2258. 593.28 s [vector] unstream.stream == id: OK
  2259. 593.28 s [vector] +++ OK, passed 100 tests.
  2260. 593.28 s [vector] stream.unstream == id: OK
  2261. 593.28 s [vector] +++ OK, passed 100 tests.
  2262. 593.28 s [vector] eq: OK
  2263. 593.28 s [vector] +++ OK, passed 100 tests.
  2264. 593.28 s [vector] length: OK
  2265. 593.28 s [vector] +++ OK, passed 100 tests.
  2266. 593.28 s [vector] null: OK
  2267. 593.28 s [vector] +++ OK, passed 100 tests.
  2268. 593.28 s [vector] index: OK
  2269. 593.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2270. 593.28 s [vector] safeIndex: OK
  2271. 593.29 s [vector] +++ OK, passed 100 tests.
  2272. 593.29 s [vector] head: OK
  2273. 593.29 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2274. 593.29 s [vector] last: OK
  2275. 593.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2276. 593.29 s [vector] unsafeIndex: OK
  2277. 593.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2278. 593.29 s [vector] unsafeHead: OK
  2279. 593.29 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2280. 593.29 s [vector] unsafeLast: OK
  2281. 593.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2282. 593.30 s [vector] slice: OK
  2283. 593.30 s [vector] +++ OK, passed 100 tests.
  2284. 593.30 s [vector] init: OK
  2285. 593.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2286. 593.30 s [vector] tail: OK
  2287. 593.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2288. 593.30 s [vector] take: OK
  2289. 593.30 s [vector] +++ OK, passed 100 tests.
  2290. 593.30 s [vector] drop: OK
  2291. 593.30 s [vector] +++ OK, passed 100 tests.
  2292. 593.30 s [vector] splitAt: OK
  2293. 593.30 s [vector] +++ OK, passed 100 tests.
  2294. 593.30 s [vector] empty: OK
  2295. 593.30 s [vector] +++ OK, passed 1 test.
  2296. 593.30 s [vector] singleton: OK
  2297. 593.30 s [vector] +++ OK, passed 100 tests.
  2298. 593.30 s [vector] replicate: OK
  2299. 593.30 s [vector] +++ OK, passed 100 tests.
  2300. 593.31 s [vector] generate: OK
  2301. 593.31 s [vector] +++ OK, passed 100 tests.
  2302. 593.31 s [vector] iterateN: OK
  2303. 593.31 s [vector] +++ OK, passed 100 tests.
  2304. 593.40 s [vector] iterateNM: OK (0.09s)
  2305. 593.40 s [vector] +++ OK, passed 100 tests.
  2306. 593.42 s [vector] generateM: OK (0.02s)
  2307. 593.42 s [vector] +++ OK, passed 100 tests.
  2308. 593.45 s [vector] replicateM: OK (0.03s)
  2309. 593.45 s [vector] +++ OK, passed 100 tests.
  2310. 593.45 s [vector] create: OK
  2311. 593.45 s [vector] +++ OK, passed 100 tests.
  2312. 593.45 s [vector] createT: OK
  2313. 593.46 s [vector] +++ OK, passed 100 tests.
  2314. 593.46 s [vector] unfoldr: OK
  2315. 593.46 s [vector] +++ OK, passed 100 tests.
  2316. 593.46 s [vector] unfoldrN: OK
  2317. 593.46 s [vector] +++ OK, passed 100 tests.
  2318. 593.46 s [vector] unfoldrExactN: OK
  2319. 593.46 s [vector] +++ OK, passed 100 tests.
  2320. 593.52 s [vector] unfoldrM: OK (0.02s)
  2321. 593.52 s [vector] +++ OK, passed 100 tests.
  2322. 593.52 s [vector] unfoldrNM: OK (0.02s)
  2323. 593.53 s [vector] +++ OK, passed 100 tests.
  2324. 593.58 s [vector] unfoldrExactNM: OK (0.08s)
  2325. 593.59 s [vector] +++ OK, passed 100 tests.
  2326. 593.59 s [vector] constructN: OK
  2327. 593.59 s [vector] +++ OK, passed 100 tests.
  2328. 593.59 s [vector] constructrN: OK
  2329. 593.59 s [vector] +++ OK, passed 100 tests.
  2330. 593.59 s [vector] cons: OK
  2331. 593.59 s [vector] +++ OK, passed 100 tests.
  2332. 593.59 s [vector] snoc: OK
  2333. 593.60 s [vector] +++ OK, passed 100 tests.
  2334. 593.60 s [vector] append: OK
  2335. 593.60 s [vector] +++ OK, passed 100 tests.
  2336. 593.64 s [vector] concat: OK (0.04s)
  2337. 593.65 s [vector] +++ OK, passed 100 tests.
  2338. 593.65 s [vector] force: OK
  2339. 593.65 s [vector] +++ OK, passed 100 tests.
  2340. 593.65 s [vector] upd: OK
  2341. 593.65 s [vector] +++ OK, passed 100 tests.
  2342. 593.65 s [vector] accum: OK
  2343. 593.65 s [vector] +++ OK, passed 100 tests.
  2344. 593.65 s [vector] reverse: OK
  2345. 593.66 s [vector] +++ OK, passed 100 tests.
  2346. 593.66 s [vector] backpermute: OK
  2347. 593.66 s [vector] +++ OK, passed 100 tests.
  2348. 593.66 s [vector] map: OK
  2349. 593.67 s [vector] +++ OK, passed 100 tests.
  2350. 593.67 s [vector] imap: OK
  2351. 593.67 s [vector] +++ OK, passed 100 tests.
  2352. 593.67 s [vector] concatMap: OK
  2353. 593.68 s [vector] +++ OK, passed 100 tests.
  2354. 593.68 s [vector] mapM: OK
  2355. 593.68 s [vector] +++ OK, passed 100 tests.
  2356. 593.72 s [vector] mapM_: OK (0.04s)
  2357. 593.72 s [vector] +++ OK, passed 100 tests.
  2358. 593.72 s [vector] forM: OK
  2359. 593.73 s [vector] +++ OK, passed 100 tests.
  2360. 593.75 s [vector] forM_: OK (0.03s)
  2361. 593.75 s [vector] +++ OK, passed 100 tests.
  2362. 593.77 s [vector] imapM: OK (0.02s)
  2363. 593.77 s [vector] +++ OK, passed 100 tests.
  2364. 593.81 s [vector] imapM_: OK (0.04s)
  2365. 593.81 s [vector] +++ OK, passed 100 tests.
  2366. 593.81 s [vector] zipWith: OK
  2367. 593.81 s [vector] +++ OK, passed 100 tests.
  2368. 593.81 s [vector] zipWith3: OK
  2369. 593.82 s [vector] +++ OK, passed 100 tests.
  2370. 593.82 s [vector] izipWith: OK
  2371. 593.82 s [vector] +++ OK, passed 100 tests.
  2372. 593.83 s [vector] izipWith3: OK
  2373. 593.83 s [vector] +++ OK, passed 100 tests.
  2374. 593.83 s [vector] izipWithM: OK
  2375. 593.83 s [vector] +++ OK, passed 100 tests.
  2376. 593.85 s [vector] izipWithM_: OK (0.02s)
  2377. 593.85 s [vector] +++ OK, passed 100 tests.
  2378. 593.88 s [vector] zipWithM: OK
  2379. 593.88 s [vector] +++ OK, passed 100 tests.
  2380. 593.90 s [vector] zipWithM_: OK (0.04s)
  2381. 593.90 s [vector] +++ OK, passed 100 tests.
  2382. 593.92 s [vector] filter: OK (0.01s)
  2383. 593.92 s [vector] +++ OK, passed 100 tests.
  2384. 593.93 s [vector] ifilter: OK (0.01s)
  2385. 593.93 s [vector] +++ OK, passed 100 tests.
  2386. 594.01 s [vector] filterM: OK (0.08s)
  2387. 594.01 s [vector] +++ OK, passed 100 tests.
  2388. 594.01 s [vector] uniq: OK
  2389. 594.01 s [vector] +++ OK, passed 100 tests.
  2390. 594.01 s [vector] mapMaybe: OK
  2391. 594.01 s [vector] +++ OK, passed 100 tests.
  2392. 594.01 s [vector] imapMaybe: OK
  2393. 594.01 s [vector] +++ OK, passed 100 tests.
  2394. 594.02 s [vector] takeWhile: OK
  2395. 594.02 s [vector] +++ OK, passed 100 tests.
  2396. 594.02 s [vector] dropWhile: OK
  2397. 594.02 s [vector] +++ OK, passed 100 tests.
  2398. 594.02 s [vector] partition: OK
  2399. 594.03 s [vector] +++ OK, passed 100 tests.
  2400. 594.03 s [vector] partitionWith: OK
  2401. 594.03 s [vector] +++ OK, passed 100 tests.
  2402. 594.03 s [vector] span: OK
  2403. 594.03 s [vector] +++ OK, passed 100 tests.
  2404. 594.03 s [vector] break: OK
  2405. 594.03 s [vector] +++ OK, passed 100 tests.
  2406. 594.03 s [vector] spanR: OK
  2407. 594.03 s [vector] +++ OK, passed 100 tests.
  2408. 594.04 s [vector] breakR: OK
  2409. 594.05 s [vector] +++ OK, passed 100 tests.
  2410. 594.05 s [vector] groupBy: OK
  2411. 594.05 s [vector] +++ OK, passed 100 tests.
  2412. 594.05 s [vector] elem: OK
  2413. 594.05 s [vector] +++ OK, passed 100 tests.
  2414. 594.05 s [vector] notElem: OK
  2415. 594.05 s [vector] +++ OK, passed 100 tests.
  2416. 594.05 s [vector] find: OK
  2417. 594.05 s [vector] +++ OK, passed 100 tests.
  2418. 594.06 s [vector] findIndex: OK
  2419. 594.06 s [vector] +++ OK, passed 100 tests.
  2420. 594.06 s [vector] findIndexR: OK
  2421. 594.07 s [vector] +++ OK, passed 100 tests.
  2422. 594.07 s [vector] findIndices: OK
  2423. 594.07 s [vector] +++ OK, passed 100 tests.
  2424. 594.07 s [vector] elemIndex: OK
  2425. 594.07 s [vector] +++ OK, passed 100 tests.
  2426. 594.07 s [vector] elemIndices: OK
  2427. 594.07 s [vector] +++ OK, passed 100 tests.
  2428. 594.07 s [vector] foldl: OK
  2429. 594.07 s [vector] +++ OK, passed 100 tests.
  2430. 594.08 s [vector] foldl1: OK
  2431. 594.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2432. 594.08 s [vector] foldl': OK
  2433. 594.08 s [vector] +++ OK, passed 100 tests.
  2434. 594.09 s [vector] foldl1': OK
  2435. 594.09 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2436. 594.09 s [vector] foldr: OK
  2437. 594.09 s [vector] +++ OK, passed 100 tests.
  2438. 594.10 s [vector] foldr1: OK
  2439. 594.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2440. 594.10 s [vector] foldr': OK
  2441. 594.10 s [vector] +++ OK, passed 100 tests.
  2442. 594.11 s [vector] foldr1': OK
  2443. 594.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2444. 594.13 s [vector] ifoldl: OK (0.01s)
  2445. 594.13 s [vector] +++ OK, passed 100 tests.
  2446. 594.13 s [vector] ifoldl': OK
  2447. 594.13 s [vector] +++ OK, passed 100 tests.
  2448. 594.14 s [vector] ifoldr: OK
  2449. 594.14 s [vector] +++ OK, passed 100 tests.
  2450. 594.15 s [vector] ifoldr': OK
  2451. 594.15 s [vector] +++ OK, passed 100 tests.
  2452. 594.15 s [vector] ifoldM: OK
  2453. 594.15 s [vector] +++ OK, passed 100 tests.
  2454. 594.15 s [vector] ifoldM': OK
  2455. 594.17 s [vector] +++ OK, passed 100 tests.
  2456. 594.19 s [vector] ifoldM_: OK (0.03s)
  2457. 594.19 s [vector] +++ OK, passed 100 tests.
  2458. 594.22 s [vector] ifoldM'_: OK (0.04s)
  2459. 594.22 s [vector] +++ OK, passed 100 tests.
  2460. 594.23 s [vector] all: OK
  2461. 594.23 s [vector] +++ OK, passed 100 tests.
  2462. 594.23 s [vector] any: OK
  2463. 594.23 s [vector] +++ OK, passed 100 tests.
  2464. 594.23 s [vector] prescanl: OK
  2465. 594.23 s [vector] +++ OK, passed 100 tests.
  2466. 594.24 s [vector] prescanl': OK
  2467. 594.24 s [vector] +++ OK, passed 100 tests.
  2468. 594.24 s [vector] postscanl: OK
  2469. 594.25 s [vector] +++ OK, passed 100 tests.
  2470. 594.25 s [vector] postscanl': OK
  2471. 594.25 s [vector] +++ OK, passed 100 tests.
  2472. 594.25 s [vector] scanl: OK
  2473. 594.25 s [vector] +++ OK, passed 100 tests.
  2474. 594.25 s [vector] scanl': OK
  2475. 594.26 s [vector] +++ OK, passed 100 tests.
  2476. 594.26 s [vector] scanl1: OK
  2477. 594.26 s [vector] +++ OK, passed 100 tests.
  2478. 594.26 s [vector] scanl1': OK
  2479. 594.26 s [vector] +++ OK, passed 100 tests.
  2480. 594.28 s [vector] iscanl: OK
  2481. 594.28 s [vector] +++ OK, passed 100 tests.
  2482. 594.28 s [vector] iscanl': OK
  2483. 594.28 s [vector] +++ OK, passed 100 tests.
  2484. 594.28 s [vector] prescanr: OK
  2485. 594.28 s [vector] +++ OK, passed 100 tests.
  2486. 594.28 s [vector] prescanr': OK
  2487. 594.29 s [vector] +++ OK, passed 100 tests.
  2488. 594.29 s [vector] postscanr: OK
  2489. 594.29 s [vector] +++ OK, passed 100 tests.
  2490. 594.29 s [vector] postscanr': OK
  2491. 594.30 s [vector] +++ OK, passed 100 tests.
  2492. 594.32 s [vector] scanr: OK
  2493. 594.32 s [vector] +++ OK, passed 100 tests.
  2494. 594.33 s [vector] scanr': OK (0.02s)
  2495. 594.33 s [vector] +++ OK, passed 100 tests.
  2496. 594.33 s [vector] scanr1: OK
  2497. 594.33 s [vector] +++ OK, passed 100 tests.
  2498. 594.34 s [vector] scanr1': OK
  2499. 594.34 s [vector] +++ OK, passed 100 tests.
  2500. 594.34 s [vector] iscanr: OK
  2501. 594.34 s [vector] +++ OK, passed 100 tests.
  2502. 594.34 s [vector] iscanr': OK
  2503. 594.34 s [vector] +++ OK, passed 100 tests.
  2504. 594.35 s [vector] mut_read: OK
  2505. 594.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2506. 594.35 s [vector] mut_write: OK
  2507. 594.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2508. 594.35 s [vector] mut_modify: OK
  2509. 594.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2510. 594.35 s [vector] mut_generate: OK
  2511. 594.35 s [vector] +++ OK, passed 100 tests.
  2512. 594.37 s [vector] mut_generateM: OK (0.01s)
  2513. 594.37 s [vector] +++ OK, passed 100 tests.
  2514. 594.42 s [vector] mut_mapM_: OK (0.03s)
  2515. 594.42 s [vector] +++ OK, passed 100 tests.
  2516. 594.45 s [vector] mut_imapM_: OK (0.03s)
  2517. 594.45 s [vector] +++ OK, passed 100 tests.
  2518. 594.46 s [vector] mut_forM_: OK (0.03s)
  2519. 594.46 s [vector] +++ OK, passed 100 tests.
  2520. 594.48 s [vector] mut_iforM_: OK (0.03s)
  2521. 594.48 s [vector] +++ OK, passed 100 tests.
  2522. 594.48 s [vector] mut_foldr: OK
  2523. 594.48 s [vector] +++ OK, passed 100 tests.
  2524. 594.49 s [vector] mut_foldr': OK
  2525. 594.49 s [vector] +++ OK, passed 100 tests.
  2526. 594.49 s [vector] mut_foldl: OK
  2527. 594.50 s [vector] +++ OK, passed 100 tests.
  2528. 594.50 s [vector] mut_foldl': OK
  2529. 594.50 s [vector] +++ OK, passed 100 tests.
  2530. 594.50 s [vector] mut_ifoldr: OK
  2531. 594.50 s [vector] +++ OK, passed 100 tests.
  2532. 594.51 s [vector] mut_ifoldr': OK
  2533. 594.51 s [vector] +++ OK, passed 100 tests.
  2534. 594.52 s [vector] mut_ifoldl: OK
  2535. 594.52 s [vector] +++ OK, passed 100 tests.
  2536. 594.52 s [vector] mut_ifoldl': OK
  2537. 594.52 s [vector] +++ OK, passed 100 tests.
  2538. 594.53 s [vector] mut_foldM: OK
  2539. 594.53 s [vector] +++ OK, passed 100 tests.
  2540. 594.53 s [vector] mut_foldM': OK
  2541. 594.54 s [vector] +++ OK, passed 100 tests.
  2542. 594.54 s [vector] mut_foldrM: OK
  2543. 594.54 s [vector] +++ OK, passed 100 tests.
  2544. 594.55 s [vector] mut_foldrM': OK
  2545. 594.55 s [vector] +++ OK, passed 100 tests.
  2546. 594.55 s [vector] mut_ifoldM: OK
  2547. 594.56 s [vector] +++ OK, passed 100 tests.
  2548. 594.56 s [vector] mut_ifoldM': OK
  2549. 594.56 s [vector] +++ OK, passed 100 tests.
  2550. 594.57 s [vector] mut_ifoldrM: OK
  2551. 594.57 s [vector] +++ OK, passed 100 tests.
  2552. 594.57 s [vector] mut_ifoldrM': OK
  2553. 594.57 s [vector] +++ OK, passed 100 tests.
  2554. 594.57 s [vector] compare: OK
  2555. 594.58 s [vector] +++ OK, passed 100 tests.
  2556. 594.58 s [vector] maximum: OK
  2557. 594.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2558. 594.58 s [vector] minimum: OK
  2559. 594.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2560. 594.58 s [vector] minIndex: OK
  2561. 594.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2562. 594.59 s [vector] maxIndex: OK
  2563. 594.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2564. 594.59 s [vector] maximumBy: OK
  2565. 594.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2566. 594.59 s [vector] minimumBy: OK
  2567. 594.59 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2568. 594.59 s [vector] maximumOn: OK
  2569. 594.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2570. 594.59 s [vector] minimumOn: OK
  2571. 594.59 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2572. 594.59 s [vector] maxIndexBy: OK
  2573. 594.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2574. 594.59 s [vector] minIndexBy: OK
  2575. 594.60 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2576. 594.60 s [vector] ListFirstMaxIndexWins: OK
  2577. 594.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2578. 594.60 s [vector] FalseListFirstMaxIndexWins: OK
  2579. 594.60 s [vector] +++ OK, failed as expected. (after 1 test):
  2580. 594.60 s [vector] Exception:
  2581. 594.60 s [vector] Prelude.foldr1: empty list
  2582. 594.60 s [vector] CallStack (from HasCallStack):
  2583. 594.60 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  2584. 594.60 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  2585. 594.60 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  2586. 594.60 s [vector] []
  2587. 594.60 s [vector] zip: OK
  2588. 594.60 s [vector] +++ OK, passed 100 tests.
  2589. 594.60 s [vector] zip3: OK
  2590. 594.60 s [vector] +++ OK, passed 100 tests.
  2591. 594.61 s [vector] unzip: OK
  2592. 594.61 s [vector] +++ OK, passed 100 tests.
  2593. 594.61 s [vector] unzip3: OK
  2594. 594.61 s [vector] +++ OK, passed 100 tests.
  2595. 594.61 s [vector] indexed: OK
  2596. 594.61 s [vector] +++ OK, passed 100 tests.
  2597. 594.62 s [vector] update: OK
  2598. 594.62 s [vector] +++ OK, passed 100 tests.
  2599. 594.64 s [vector] concat: OK (0.02s)
  2600. 594.64 s [vector] +++ OK, passed 100 tests.
  2601. 594.64 s [vector] mempty: OK
  2602. 594.64 s [vector] +++ OK, passed 1 test.
  2603. 594.64 s [vector] mappend: OK
  2604. 594.64 s [vector] +++ OK, passed 100 tests.
  2605. 594.68 s [vector] mconcat: OK (0.03s)
  2606. 594.68 s [vector] +++ OK, passed 100 tests.
  2607. 594.68 s [vector] fmap: OK (0.01s)
  2608. 594.68 s [vector] +++ OK, passed 100 tests.
  2609. 594.71 s [vector] return: OK
  2610. 594.71 s [vector] +++ OK, passed 100 tests.
  2611. 594.81 s [vector] bind: OK (0.13s)
  2612. 594.81 s [vector] +++ OK, passed 100 tests.
  2613. 594.82 s [vector] mzip: OK
  2614. 594.82 s [vector] +++ OK, passed 100 tests.
  2615. 594.82 s [vector] munzip: OK
  2616. 594.82 s [vector] +++ OK, passed 100 tests.
  2617. 594.82 s [vector] applicative_pure: OK
  2618. 594.82 s [vector] +++ OK, passed 100 tests.
  2619. 594.99 s [vector] applicative_appl: OK (0.11s)
  2620. 594.99 s [vector] +++ OK, passed 100 tests.
  2621. 595.00 s [vector] alternative_empty: OK
  2622. 595.00 s [vector] +++ OK, passed 1 test.
  2623. 595.00 s [vector] alternative_or: OK
  2624. 595.00 s [vector] +++ OK, passed 100 tests.
  2625. 595.04 s [vector] sequence: OK (0.09s)
  2626. 595.04 s [vector] +++ OK, passed 100 tests.
  2627. 595.06 s [vector] sequence_: OK (0.02s)
  2628. 595.06 s [vector] +++ OK, passed 100 tests.
  2629. 595.06 s [vector] glength: OK
  2630. 595.06 s [vector] +++ OK, passed 100 tests.
  2631. 595.06 s [vector] sum: OK
  2632. 595.06 s [vector] +++ OK, passed 100 tests.
  2633. 595.06 s [vector] product: OK
  2634. 595.06 s [vector] +++ OK, passed 100 tests.
  2635. 595.06 s [vector] enumFromN: OK
  2636. 595.06 s [vector] +++ OK, passed 100 tests.
  2637. 595.06 s [vector] enumFromThenN: OK
  2638. 595.06 s [vector] +++ OK, passed 100 tests.
  2639. 595.07 s [vector] enumFromTo: OK
  2640. 595.07 s [vector] +++ OK, passed 100 tests.
  2641. 595.07 s [vector] enumFromThenTo: OK
  2642. 595.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2643. 595.07 s [vector] unstream
  2644. 595.08 s [vector] unstream == vunstream (exact): OK
  2645. 595.08 s [vector] +++ OK, passed 100 tests.
  2646. 595.08 s [vector] unstream == vunstream (unknown): OK
  2647. 595.08 s [vector] +++ OK, passed 100 tests.
  2648. 595.09 s [vector] unstreamR ~= vunstream (exact): OK
  2649. 595.09 s [vector] +++ OK, passed 100 tests.
  2650. 595.09 s [vector] unstreamR ~= vunstream (unknown): OK
  2651. 595.09 s [vector] +++ OK, passed 100 tests.
  2652. 595.09 s [vector] Tests.Vector.Primitive
  2653. 595.09 s [vector] Int
  2654. 595.11 s [vector] fromList.toList == id: OK
  2655. 595.11 s [vector] +++ OK, passed 100 tests.
  2656. 595.11 s [vector] toList.fromList == id: OK (0.02s)
  2657. 595.11 s [vector] +++ OK, passed 100 tests.
  2658. 595.11 s [vector] unstream.stream == id: OK
  2659. 595.11 s [vector] +++ OK, passed 100 tests.
  2660. 595.12 s [vector] stream.unstream == id: OK
  2661. 595.12 s [vector] +++ OK, passed 100 tests.
  2662. 595.12 s [vector] eq: OK
  2663. 595.12 s [vector] +++ OK, passed 100 tests.
  2664. 595.12 s [vector] length: OK
  2665. 595.12 s [vector] +++ OK, passed 100 tests.
  2666. 595.12 s [vector] null: OK
  2667. 595.12 s [vector] +++ OK, passed 100 tests.
  2668. 595.13 s [vector] index: OK
  2669. 595.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2670. 595.13 s [vector] safeIndex: OK
  2671. 595.13 s [vector] +++ OK, passed 100 tests.
  2672. 595.13 s [vector] head: OK
  2673. 595.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2674. 595.13 s [vector] last: OK
  2675. 595.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2676. 595.13 s [vector] unsafeIndex: OK
  2677. 595.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2678. 595.14 s [vector] unsafeHead: OK
  2679. 595.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2680. 595.14 s [vector] unsafeLast: OK
  2681. 595.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2682. 595.14 s [vector] slice: OK
  2683. 595.14 s [vector] +++ OK, passed 100 tests.
  2684. 595.14 s [vector] init: OK
  2685. 595.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2686. 595.15 s [vector] tail: OK
  2687. 595.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2688. 595.15 s [vector] take: OK
  2689. 595.15 s [vector] +++ OK, passed 100 tests.
  2690. 595.15 s [vector] drop: OK
  2691. 595.15 s [vector] +++ OK, passed 100 tests.
  2692. 595.16 s [vector] splitAt: OK
  2693. 595.16 s [vector] +++ OK, passed 100 tests.
  2694. 595.16 s [vector] empty: OK
  2695. 595.16 s [vector] +++ OK, passed 1 test.
  2696. 595.16 s [vector] singleton: OK
  2697. 595.16 s [vector] +++ OK, passed 100 tests.
  2698. 595.16 s [vector] replicate: OK
  2699. 595.16 s [vector] +++ OK, passed 100 tests.
  2700. 595.17 s [vector] generate: OK
  2701. 595.17 s [vector] +++ OK, passed 100 tests.
  2702. 595.17 s [vector] iterateN: OK
  2703. 595.18 s [vector] +++ OK, passed 100 tests.
  2704. 595.32 s [vector] iterateNM: OK (0.14s)
  2705. 595.32 s [vector] +++ OK, passed 100 tests.
  2706. 595.36 s [vector] generateM: OK (0.05s)
  2707. 595.36 s [vector] +++ OK, passed 100 tests.
  2708. 595.38 s [vector] replicateM: OK (0.02s)
  2709. 595.38 s [vector] +++ OK, passed 100 tests.
  2710. 595.38 s [vector] create: OK
  2711. 595.38 s [vector] +++ OK, passed 100 tests.
  2712. 595.38 s [vector] createT: OK
  2713. 595.38 s [vector] +++ OK, passed 100 tests.
  2714. 595.38 s [vector] unfoldr: OK
  2715. 595.38 s [vector] +++ OK, passed 100 tests.
  2716. 595.38 s [vector] unfoldrN: OK
  2717. 595.38 s [vector] +++ OK, passed 100 tests.
  2718. 595.38 s [vector] unfoldrExactN: OK
  2719. 595.39 s [vector] +++ OK, passed 100 tests.
  2720. 595.39 s [vector] unfoldrM: OK
  2721. 595.43 s [vector] +++ OK, passed 100 tests.
  2722. 595.45 s [vector] unfoldrNM: OK (0.04s)
  2723. 595.45 s [vector] +++ OK, passed 100 tests.
  2724. 595.46 s [vector] unfoldrExactNM: OK (0.03s)
  2725. 595.46 s [vector] +++ OK, passed 100 tests.
  2726. 595.47 s [vector] constructN: OK
  2727. 595.47 s [vector] +++ OK, passed 100 tests.
  2728. 595.47 s [vector] constructrN: OK
  2729. 595.47 s [vector] +++ OK, passed 100 tests.
  2730. 595.48 s [vector] cons: OK
  2731. 595.48 s [vector] +++ OK, passed 100 tests.
  2732. 595.48 s [vector] snoc: OK
  2733. 595.48 s [vector] +++ OK, passed 100 tests.
  2734. 595.48 s [vector] append: OK
  2735. 595.48 s [vector] +++ OK, passed 100 tests.
  2736. 595.51 s [vector] concat: OK (0.03s)
  2737. 595.51 s [vector] +++ OK, passed 100 tests.
  2738. 595.51 s [vector] force: OK
  2739. 595.51 s [vector] +++ OK, passed 100 tests.
  2740. 595.52 s [vector] upd: OK
  2741. 595.52 s [vector] +++ OK, passed 100 tests.
  2742. 595.52 s [vector] accum: OK
  2743. 595.52 s [vector] +++ OK, passed 100 tests.
  2744. 595.52 s [vector] reverse: OK
  2745. 595.52 s [vector] +++ OK, passed 100 tests.
  2746. 595.52 s [vector] backpermute: OK
  2747. 595.53 s [vector] +++ OK, passed 100 tests.
  2748. 595.53 s [vector] map: OK
  2749. 595.53 s [vector] +++ OK, passed 100 tests.
  2750. 595.54 s [vector] imap: OK
  2751. 595.54 s [vector] +++ OK, passed 100 tests.
  2752. 595.54 s [vector] concatMap: OK
  2753. 595.54 s [vector] +++ OK, passed 100 tests.
  2754. 595.56 s [vector] mapM: OK
  2755. 595.56 s [vector] +++ OK, passed 100 tests.
  2756. 595.59 s [vector] mapM_: OK (0.04s)
  2757. 595.59 s [vector] +++ OK, passed 100 tests.
  2758. 595.60 s [vector] forM: OK
  2759. 595.60 s [vector] +++ OK, passed 100 tests.
  2760. 595.63 s [vector] forM_: OK (0.03s)
  2761. 595.63 s [vector] +++ OK, passed 100 tests.
  2762. 595.64 s [vector] imapM: OK (0.01s)
  2763. 595.64 s [vector] +++ OK, passed 100 tests.
  2764. 595.68 s [vector] imapM_: OK (0.05s)
  2765. 595.68 s [vector] +++ OK, passed 100 tests.
  2766. 595.69 s [vector] zipWith: OK
  2767. 595.70 s [vector] +++ OK, passed 100 tests.
  2768. 595.70 s [vector] zipWith3: OK
  2769. 595.70 s [vector] +++ OK, passed 100 tests.
  2770. 595.70 s [vector] izipWith: OK
  2771. 595.70 s [vector] +++ OK, passed 100 tests.
  2772. 595.71 s [vector] izipWith3: OK
  2773. 595.71 s [vector] +++ OK, passed 100 tests.
  2774. 595.72 s [vector] izipWithM: OK
  2775. 595.72 s [vector] +++ OK, passed 100 tests.
  2776. 595.74 s [vector] izipWithM_: OK (0.03s)
  2777. 595.74 s [vector] +++ OK, passed 100 tests.
  2778. 595.75 s [vector] zipWithM: OK
  2779. 595.75 s [vector] +++ OK, passed 100 tests.
  2780. 595.77 s [vector] zipWithM_: OK (0.03s)
  2781. 595.78 s [vector] +++ OK, passed 100 tests.
  2782. 595.78 s [vector] filter: OK
  2783. 595.78 s [vector] +++ OK, passed 100 tests.
  2784. 595.78 s [vector] ifilter: OK
  2785. 595.78 s [vector] +++ OK, passed 100 tests.
  2786. 595.88 s [vector] filterM: OK (0.10s)
  2787. 595.88 s [vector] +++ OK, passed 100 tests.
  2788. 595.88 s [vector] uniq: OK
  2789. 595.88 s [vector] +++ OK, passed 100 tests.
  2790. 595.89 s [vector] mapMaybe: OK
  2791. 595.89 s [vector] +++ OK, passed 100 tests.
  2792. 595.89 s [vector] imapMaybe: OK
  2793. 595.89 s [vector] +++ OK, passed 100 tests.
  2794. 595.89 s [vector] takeWhile: OK
  2795. 595.89 s [vector] +++ OK, passed 100 tests.
  2796. 595.90 s [vector] dropWhile: OK
  2797. 595.90 s [vector] +++ OK, passed 100 tests.
  2798. 595.90 s [vector] partition: OK
  2799. 595.90 s [vector] +++ OK, passed 100 tests.
  2800. 595.90 s [vector] partitionWith: OK
  2801. 595.90 s [vector] +++ OK, passed 100 tests.
  2802. 595.91 s [vector] span: OK
  2803. 595.91 s [vector] +++ OK, passed 100 tests.
  2804. 595.91 s [vector] break: OK
  2805. 595.91 s [vector] +++ OK, passed 100 tests.
  2806. 595.91 s [vector] spanR: OK
  2807. 595.91 s [vector] +++ OK, passed 100 tests.
  2808. 595.91 s [vector] breakR: OK
  2809. 595.91 s [vector] +++ OK, passed 100 tests.
  2810. 595.92 s [vector] groupBy: OK
  2811. 595.92 s [vector] +++ OK, passed 100 tests.
  2812. 595.92 s [vector] elem: OK
  2813. 595.92 s [vector] +++ OK, passed 100 tests.
  2814. 595.92 s [vector] notElem: OK
  2815. 595.92 s [vector] +++ OK, passed 100 tests.
  2816. 595.92 s [vector] find: OK
  2817. 595.93 s [vector] +++ OK, passed 100 tests.
  2818. 595.93 s [vector] findIndex: OK
  2819. 595.93 s [vector] +++ OK, passed 100 tests.
  2820. 595.93 s [vector] findIndexR: OK
  2821. 595.93 s [vector] +++ OK, passed 100 tests.
  2822. 595.93 s [vector] findIndices: OK
  2823. 595.93 s [vector] +++ OK, passed 100 tests.
  2824. 595.93 s [vector] elemIndex: OK
  2825. 595.93 s [vector] +++ OK, passed 100 tests.
  2826. 595.93 s [vector] elemIndices: OK
  2827. 595.94 s [vector] +++ OK, passed 100 tests.
  2828. 595.95 s [vector] foldl: OK
  2829. 595.95 s [vector] +++ OK, passed 100 tests.
  2830. 595.95 s [vector] foldl1: OK
  2831. 595.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2832. 595.96 s [vector] foldl': OK
  2833. 595.96 s [vector] +++ OK, passed 100 tests.
  2834. 595.97 s [vector] foldl1': OK
  2835. 595.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2836. 595.97 s [vector] foldr: OK
  2837. 595.98 s [vector] +++ OK, passed 100 tests.
  2838. 595.98 s [vector] foldr1: OK
  2839. 595.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2840. 595.99 s [vector] foldr': OK
  2841. 595.99 s [vector] +++ OK, passed 100 tests.
  2842. 595.99 s [vector] foldr1': OK
  2843. 595.99 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2844. 596.01 s [vector] ifoldl: OK (0.01s)
  2845. 596.01 s [vector] +++ OK, passed 100 tests.
  2846. 596.01 s [vector] ifoldl': OK
  2847. 596.01 s [vector] +++ OK, passed 100 tests.
  2848. 596.02 s [vector] ifoldr: OK
  2849. 596.03 s [vector] +++ OK, passed 100 tests.
  2850. 596.03 s [vector] ifoldr': OK
  2851. 596.03 s [vector] +++ OK, passed 100 tests.
  2852. 596.04 s [vector] ifoldM: OK (0.01s)
  2853. 596.05 s [vector] +++ OK, passed 100 tests.
  2854. 596.05 s [vector] ifoldM': OK
  2855. 596.05 s [vector] +++ OK, passed 100 tests.
  2856. 596.09 s [vector] ifoldM_: OK (0.04s)
  2857. 596.09 s [vector] +++ OK, passed 100 tests.
  2858. 596.12 s [vector] ifoldM'_: OK (0.04s)
  2859. 596.13 s [vector] +++ OK, passed 100 tests.
  2860. 596.13 s [vector] all: OK
  2861. 596.13 s [vector] +++ OK, passed 100 tests.
  2862. 596.13 s [vector] any: OK
  2863. 596.13 s [vector] +++ OK, passed 100 tests.
  2864. 596.14 s [vector] prescanl: OK
  2865. 596.14 s [vector] +++ OK, passed 100 tests.
  2866. 596.14 s [vector] prescanl': OK
  2867. 596.14 s [vector] +++ OK, passed 100 tests.
  2868. 596.15 s [vector] postscanl: OK
  2869. 596.15 s [vector] +++ OK, passed 100 tests.
  2870. 596.15 s [vector] postscanl': OK
  2871. 596.15 s [vector] +++ OK, passed 100 tests.
  2872. 596.17 s [vector] scanl: OK
  2873. 596.17 s [vector] +++ OK, passed 100 tests.
  2874. 596.17 s [vector] scanl': OK
  2875. 596.17 s [vector] +++ OK, passed 100 tests.
  2876. 596.17 s [vector] scanl1: OK
  2877. 596.17 s [vector] +++ OK, passed 100 tests.
  2878. 596.18 s [vector] scanl1': OK
  2879. 596.18 s [vector] +++ OK, passed 100 tests.
  2880. 596.18 s [vector] iscanl: OK
  2881. 596.18 s [vector] +++ OK, passed 100 tests.
  2882. 596.19 s [vector] iscanl': OK
  2883. 596.19 s [vector] +++ OK, passed 100 tests.
  2884. 596.39 s [vector] prescanr: OK
  2885. 596.39 s [vector] +++ OK, passed 100 tests.
  2886. 596.39 s [vector] prescanr': OK
  2887. 596.39 s [vector] +++ OK, passed 100 tests.
  2888. 596.39 s [vector] postscanr: OK
  2889. 596.39 s [vector] +++ OK, passed 100 tests.
  2890. 596.39 s [vector] postscanr': OK
  2891. 596.39 s [vector] +++ OK, passed 100 tests.
  2892. 596.39 s [vector] scanr: OK
  2893. 596.39 s [vector] +++ OK, passed 100 tests.
  2894. 596.39 s [vector] scanr': OK
  2895. 596.39 s [vector] +++ OK, passed 100 tests.
  2896. 596.39 s [vector] scanr1: OK
  2897. 596.39 s [vector] +++ OK, passed 100 tests.
  2898. 596.39 s [vector] scanr1': OK
  2899. 596.39 s [vector] +++ OK, passed 100 tests.
  2900. 596.39 s [vector] iscanr: OK
  2901. 596.39 s [vector] +++ OK, passed 100 tests.
  2902. 596.39 s [vector] iscanr': OK
  2903. 596.39 s [vector] +++ OK, passed 100 tests.
  2904. 596.39 s [vector] mut_read: OK
  2905. 596.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2906. 596.39 s [vector] mut_write: OK
  2907. 596.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2908. 596.39 s [vector] mut_modify: OK
  2909. 596.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2910. 596.39 s [vector] mut_generate: OK
  2911. 596.39 s [vector] +++ OK, passed 100 tests.
  2912. 596.39 s [vector] mut_generateM: OK (0.02s)
  2913. 596.39 s [vector] +++ OK, passed 100 tests.
  2914. 596.39 s [vector] mut_mapM_: OK (0.03s)
  2915. 596.39 s [vector] +++ OK, passed 100 tests.
  2916. 596.39 s [vector] mut_imapM_: OK (0.03s)
  2917. 596.39 s [vector] +++ OK, passed 100 tests.
  2918. 596.39 s [vector] mut_forM_: OK (0.03s)
  2919. 596.39 s [vector] +++ OK, passed 100 tests.
  2920. 596.43 s [vector] mut_iforM_: OK (0.04s)
  2921. 596.43 s [vector] +++ OK, passed 100 tests.
  2922. 596.43 s [vector] mut_foldr: OK
  2923. 596.44 s [vector] +++ OK, passed 100 tests.
  2924. 596.44 s [vector] mut_foldr': OK
  2925. 596.44 s [vector] +++ OK, passed 100 tests.
  2926. 596.45 s [vector] mut_foldl: OK
  2927. 596.45 s [vector] +++ OK, passed 100 tests.
  2928. 596.45 s [vector] mut_foldl': OK
  2929. 596.45 s [vector] +++ OK, passed 100 tests.
  2930. 596.45 s [vector] mut_ifoldr: OK
  2931. 596.46 s [vector] +++ OK, passed 100 tests.
  2932. 596.47 s [vector] mut_ifoldr': OK
  2933. 596.47 s [vector] +++ OK, passed 100 tests.
  2934. 596.47 s [vector] mut_ifoldl: OK
  2935. 596.47 s [vector] +++ OK, passed 100 tests.
  2936. 596.49 s [vector] mut_ifoldl': OK
  2937. 596.49 s [vector] +++ OK, passed 100 tests.
  2938. 596.49 s [vector] mut_foldM: OK
  2939. 596.49 s [vector] +++ OK, passed 100 tests.
  2940. 596.50 s [vector] mut_foldM': OK
  2941. 596.50 s [vector] +++ OK, passed 100 tests.
  2942. 596.51 s [vector] mut_foldrM: OK
  2943. 596.51 s [vector] +++ OK, passed 100 tests.
  2944. 596.52 s [vector] mut_foldrM': OK
  2945. 596.53 s [vector] +++ OK, passed 100 tests.
  2946. 596.54 s [vector] mut_ifoldM: OK (0.01s)
  2947. 596.54 s [vector] +++ OK, passed 100 tests.
  2948. 596.54 s [vector] mut_ifoldM': OK (0.01s)
  2949. 596.54 s [vector] +++ OK, passed 100 tests.
  2950. 596.55 s [vector] mut_ifoldrM: OK
  2951. 596.55 s [vector] +++ OK, passed 100 tests.
  2952. 596.57 s [vector] mut_ifoldrM': OK (0.02s)
  2953. 596.57 s [vector] +++ OK, passed 100 tests.
  2954. 596.57 s [vector] compare: OK
  2955. 596.57 s [vector] +++ OK, passed 100 tests.
  2956. 596.57 s [vector] maximum: OK
  2957. 596.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2958. 596.57 s [vector] minimum: OK
  2959. 596.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2960. 596.57 s [vector] minIndex: OK
  2961. 596.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2962. 596.58 s [vector] maxIndex: OK
  2963. 596.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2964. 596.58 s [vector] maximumBy: OK
  2965. 596.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2966. 596.58 s [vector] minimumBy: OK
  2967. 596.58 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2968. 596.58 s [vector] maximumOn: OK
  2969. 596.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2970. 596.58 s [vector] minimumOn: OK
  2971. 596.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2972. 596.58 s [vector] maxIndexBy: OK
  2973. 596.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2974. 596.58 s [vector] minIndexBy: OK
  2975. 596.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2976. 596.58 s [vector] ListFirstMaxIndexWins: OK
  2977. 596.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2978. 596.58 s [vector] FalseListFirstMaxIndexWins: OK
  2979. 596.59 s [vector] +++ OK, failed as expected. (after 1 test):
  2980. 596.59 s [vector] Exception:
  2981. 596.59 s [vector] Prelude.foldr1: empty list
  2982. 596.59 s [vector] CallStack (from HasCallStack):
  2983. 596.59 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  2984. 596.59 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  2985. 596.59 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  2986. 596.59 s [vector] []
  2987. 596.59 s [vector] mempty: OK
  2988. 596.59 s [vector] +++ OK, passed 1 test.
  2989. 596.59 s [vector] mappend: OK
  2990. 596.59 s [vector] +++ OK, passed 100 tests.
  2991. 596.62 s [vector] mconcat: OK (0.03s)
  2992. 596.62 s [vector] +++ OK, passed 100 tests.
  2993. 596.62 s [vector] glength: OK
  2994. 596.62 s [vector] +++ OK, passed 100 tests.
  2995. 596.62 s [vector] sum: OK
  2996. 596.62 s [vector] +++ OK, passed 100 tests.
  2997. 596.62 s [vector] product: OK
  2998. 596.63 s [vector] +++ OK, passed 100 tests.
  2999. 596.63 s [vector] enumFromN: OK
  3000. 596.63 s [vector] +++ OK, passed 100 tests.
  3001. 596.63 s [vector] enumFromThenN: OK
  3002. 596.63 s [vector] +++ OK, passed 100 tests.
  3003. 596.63 s [vector] enumFromTo: OK
  3004. 596.63 s [vector] +++ OK, passed 100 tests.
  3005. 596.63 s [vector] enumFromThenTo: OK
  3006. 596.63 s [vector] +++ OK, passed 100 tests; 10 discarded.
  3007. 596.63 s [vector] Double
  3008. 596.63 s [vector] fromList.toList == id: OK
  3009. 596.63 s [vector] +++ OK, passed 100 tests.
  3010. 596.64 s [vector] toList.fromList == id: OK
  3011. 596.64 s [vector] +++ OK, passed 100 tests.
  3012. 596.64 s [vector] unstream.stream == id: OK
  3013. 596.64 s [vector] +++ OK, passed 100 tests.
  3014. 596.64 s [vector] stream.unstream == id: OK
  3015. 596.64 s [vector] +++ OK, passed 100 tests.
  3016. 596.64 s [vector] eq: OK
  3017. 596.64 s [vector] +++ OK, passed 100 tests.
  3018. 596.64 s [vector] length: OK
  3019. 596.64 s [vector] +++ OK, passed 100 tests.
  3020. 596.65 s [vector] null: OK
  3021. 596.65 s [vector] +++ OK, passed 100 tests.
  3022. 596.65 s [vector] index: OK
  3023. 596.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3024. 596.65 s [vector] safeIndex: OK
  3025. 596.65 s [vector] +++ OK, passed 100 tests.
  3026. 596.65 s [vector] head: OK
  3027. 596.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3028. 596.65 s [vector] last: OK
  3029. 596.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3030. 596.65 s [vector] unsafeIndex: OK
  3031. 596.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3032. 596.66 s [vector] unsafeHead: OK
  3033. 596.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3034. 596.66 s [vector] unsafeLast: OK
  3035. 596.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3036. 596.66 s [vector] slice: OK
  3037. 596.66 s [vector] +++ OK, passed 100 tests.
  3038. 596.67 s [vector] init: OK
  3039. 596.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3040. 596.67 s [vector] tail: OK
  3041. 596.67 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3042. 596.67 s [vector] take: OK
  3043. 596.67 s [vector] +++ OK, passed 100 tests.
  3044. 596.67 s [vector] drop: OK
  3045. 596.67 s [vector] +++ OK, passed 100 tests.
  3046. 596.67 s [vector] splitAt: OK
  3047. 596.67 s [vector] +++ OK, passed 100 tests.
  3048. 596.67 s [vector] empty: OK
  3049. 596.68 s [vector] +++ OK, passed 1 test.
  3050. 596.68 s [vector] singleton: OK
  3051. 596.68 s [vector] +++ OK, passed 100 tests.
  3052. 596.68 s [vector] replicate: OK
  3053. 596.68 s [vector] +++ OK, passed 100 tests.
  3054. 596.69 s [vector] generate: OK
  3055. 596.69 s [vector] +++ OK, passed 100 tests.
  3056. 596.69 s [vector] iterateN: OK
  3057. 596.69 s [vector] +++ OK, passed 100 tests.
  3058. 596.83 s [vector] iterateNM: OK (0.13s)
  3059. 596.83 s [vector] +++ OK, passed 100 tests.
  3060. 596.95 s [vector] generateM: OK (0.13s)
  3061. 596.95 s [vector] +++ OK, passed 100 tests.
  3062. 596.96 s [vector] replicateM: OK (0.02s)
  3063. 596.97 s [vector] +++ OK, passed 100 tests.
  3064. 596.97 s [vector] create: OK
  3065. 596.97 s [vector] +++ OK, passed 100 tests.
  3066. 596.97 s [vector] createT: OK
  3067. 596.97 s [vector] +++ OK, passed 100 tests.
  3068. 596.97 s [vector] unfoldr: OK
  3069. 596.97 s [vector] +++ OK, passed 100 tests.
  3070. 596.97 s [vector] unfoldrN: OK
  3071. 596.97 s [vector] +++ OK, passed 100 tests.
  3072. 596.97 s [vector] unfoldrExactN: OK
  3073. 596.98 s [vector] +++ OK, passed 100 tests.
  3074. 596.98 s [vector] unfoldrM: OK
  3075. 596.98 s [vector] +++ OK, passed 100 tests.
  3076. 596.99 s [vector] unfoldrNM: OK
  3077. 596.99 s [vector] +++ OK, passed 100 tests.
  3078. 597.05 s [vector] unfoldrExactNM: OK (0.06s)
  3079. 597.05 s [vector] +++ OK, passed 100 tests.
  3080. 597.10 s [vector] constructN: OK (0.04s)
  3081. 597.10 s [vector] +++ OK, passed 100 tests.
  3082. 597.20 s [vector] constructrN: OK (0.04s)
  3083. 597.20 s [vector] +++ OK, passed 100 tests.
  3084. 597.20 s [vector] cons: OK
  3085. 597.20 s [vector] +++ OK, passed 100 tests.
  3086. 597.20 s [vector] snoc: OK
  3087. 597.20 s [vector] +++ OK, passed 100 tests.
  3088. 597.20 s [vector] append: OK
  3089. 597.20 s [vector] +++ OK, passed 100 tests.
  3090. 597.25 s [vector] concat: OK (0.11s)
  3091. 597.25 s [vector] +++ OK, passed 100 tests.
  3092. 597.25 s [vector] force: OK
  3093. 597.26 s [vector] +++ OK, passed 100 tests.
  3094. 597.27 s [vector] upd: OK
  3095. 597.27 s [vector] +++ OK, passed 100 tests.
  3096. 597.30 s [vector] accum: OK (0.03s)
  3097. 597.30 s [vector] +++ OK, passed 100 tests.
  3098. 597.39 s [vector] reverse: OK
  3099. 597.39 s [vector] +++ OK, passed 100 tests.
  3100. 597.39 s [vector] backpermute: OK
  3101. 597.39 s [vector] +++ OK, passed 100 tests.
  3102. 597.39 s [vector] map: OK (0.01s)
  3103. 597.39 s [vector] +++ OK, passed 100 tests.
  3104. 597.39 s [vector] imap: OK (0.02s)
  3105. 597.39 s [vector] +++ OK, passed 100 tests.
  3106. 597.39 s [vector] concatMap: OK (0.02s)
  3107. 597.39 s [vector] +++ OK, passed 100 tests.
  3108. 597.39 s [vector] mapM: OK (0.02s)
  3109. 597.39 s [vector] +++ OK, passed 100 tests.
  3110. 597.47 s [vector] mapM_: OK (0.08s)
  3111. 597.49 s [vector] +++ OK, passed 100 tests.
  3112. 597.49 s [vector] forM: OK (0.02s)
  3113. 597.49 s [vector] +++ OK, passed 100 tests.
  3114. 597.57 s [vector] forM_: OK (0.09s)
  3115. 597.57 s [vector] +++ OK, passed 100 tests.
  3116. 597.59 s [vector] imapM: OK (0.02s)
  3117. 597.59 s [vector] +++ OK, passed 100 tests.
  3118. 597.69 s [vector] imapM_: OK (0.10s)
  3119. 597.69 s [vector] +++ OK, passed 100 tests.
  3120. 597.71 s [vector] zipWith: OK (0.02s)
  3121. 597.71 s [vector] +++ OK, passed 100 tests.
  3122. 597.73 s [vector] zipWith3: OK (0.02s)
  3123. 597.73 s [vector] +++ OK, passed 100 tests.
  3124. 597.75 s [vector] izipWith: OK (0.02s)
  3125. 597.75 s [vector] +++ OK, passed 100 tests.
  3126. 597.77 s [vector] izipWith3: OK (0.02s)
  3127. 597.77 s [vector] +++ OK, passed 100 tests.
  3128. 597.79 s [vector] izipWithM: OK (0.02s)
  3129. 597.79 s [vector] +++ OK, passed 100 tests.
  3130. 597.87 s [vector] izipWithM_: OK (0.07s)
  3131. 597.87 s [vector] +++ OK, passed 100 tests.
  3132. 597.91 s [vector] zipWithM: OK (0.02s)
  3133. 597.91 s [vector] +++ OK, passed 100 tests.
  3134. 597.95 s [vector] zipWithM_: OK (0.07s)
  3135. 597.95 s [vector] +++ OK, passed 100 tests.
  3136. 597.96 s [vector] filter: OK (0.02s)
  3137. 597.96 s [vector] +++ OK, passed 100 tests.
  3138. 597.99 s [vector] ifilter: OK
  3139. 597.99 s [vector] +++ OK, passed 100 tests.
  3140. 598.11 s [vector] filterM: OK (0.13s)
  3141. 598.11 s [vector] +++ OK, passed 100 tests.
  3142. 598.11 s [vector] uniq: OK
  3143. 598.11 s [vector] +++ OK, passed 100 tests.
  3144. 598.13 s [vector] mapMaybe: OK (0.02s)
  3145. 598.13 s [vector] +++ OK, passed 100 tests.
  3146. 598.15 s [vector] imapMaybe: OK (0.02s)
  3147. 598.15 s [vector] +++ OK, passed 100 tests.
  3148. 598.15 s [vector] takeWhile: OK
  3149. 598.15 s [vector] +++ OK, passed 100 tests.
  3150. 598.17 s [vector] dropWhile: OK
  3151. 598.17 s [vector] +++ OK, passed 100 tests.
  3152. 598.17 s [vector] partition: OK (0.01s)
  3153. 598.17 s [vector] +++ OK, passed 100 tests.
  3154. 598.19 s [vector] partitionWith: OK (0.02s)
  3155. 598.19 s [vector] +++ OK, passed 100 tests.
  3156. 598.19 s [vector] span: OK
  3157. 598.19 s [vector] +++ OK, passed 100 tests.
  3158. 598.20 s [vector] break: OK
  3159. 598.20 s [vector] +++ OK, passed 100 tests.
  3160. 598.20 s [vector] spanR: OK
  3161. 598.20 s [vector] +++ OK, passed 100 tests.
  3162. 598.20 s [vector] breakR: OK
  3163. 598.20 s [vector] +++ OK, passed 100 tests.
  3164. 598.23 s [vector] groupBy: OK (0.02s)
  3165. 598.23 s [vector] +++ OK, passed 100 tests.
  3166. 598.23 s [vector] elem: OK
  3167. 598.23 s [vector] +++ OK, passed 100 tests.
  3168. 598.23 s [vector] notElem: OK
  3169. 598.24 s [vector] +++ OK, passed 100 tests.
  3170. 598.24 s [vector] find: OK
  3171. 598.24 s [vector] +++ OK, passed 100 tests.
  3172. 598.24 s [vector] findIndex: OK
  3173. 598.24 s [vector] +++ OK, passed 100 tests.
  3174. 598.24 s [vector] findIndexR: OK
  3175. 598.25 s [vector] +++ OK, passed 100 tests.
  3176. 598.26 s [vector] findIndices: OK (0.02s)
  3177. 598.26 s [vector] +++ OK, passed 100 tests.
  3178. 598.26 s [vector] elemIndex: OK
  3179. 598.26 s [vector] +++ OK, passed 100 tests.
  3180. 598.27 s [vector] elemIndices: OK
  3181. 598.27 s [vector] +++ OK, passed 100 tests.
  3182. 598.29 s [vector] foldl: OK (0.03s)
  3183. 598.29 s [vector] +++ OK, passed 100 tests.
  3184. 598.33 s [vector] foldl1: OK (0.03s)
  3185. 598.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3186. 598.35 s [vector] foldl': OK (0.03s)
  3187. 598.36 s [vector] +++ OK, passed 100 tests.
  3188. 598.39 s [vector] foldl1': OK (0.03s)
  3189. 598.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3190. 598.40 s [vector] foldr: OK (0.03s)
  3191. 598.40 s [vector] +++ OK, passed 100 tests.
  3192. 598.43 s [vector] foldr1: OK (0.01s)
  3193. 598.44 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3194. 598.45 s [vector] foldr': OK (0.03s)
  3195. 598.45 s [vector] +++ OK, passed 100 tests.
  3196. 598.49 s [vector] foldr1': OK (0.01s)
  3197. 598.49 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3198. 598.53 s [vector] ifoldl: OK (0.04s)
  3199. 598.53 s [vector] +++ OK, passed 100 tests.
  3200. 598.57 s [vector] ifoldl': OK (0.03s)
  3201. 598.58 s [vector] +++ OK, passed 100 tests.
  3202. 598.61 s [vector] ifoldr: OK (0.03s)
  3203. 598.61 s [vector] +++ OK, passed 100 tests.
  3204. 598.63 s [vector] ifoldr': OK (0.03s)
  3205. 598.64 s [vector] +++ OK, passed 100 tests.
  3206. 598.68 s [vector] ifoldM: OK (0.04s)
  3207. 598.68 s [vector] +++ OK, passed 100 tests.
  3208. 598.71 s [vector] ifoldM': OK (0.04s)
  3209. 598.71 s [vector] +++ OK, passed 100 tests.
  3210. 598.83 s [vector] ifoldM_: OK (0.12s)
  3211. 598.83 s [vector] +++ OK, passed 100 tests.
  3212. 598.88 s [vector] ifoldM'_: OK (0.07s)
  3213. 598.88 s [vector] +++ OK, passed 100 tests.
  3214. 598.89 s [vector] all: OK
  3215. 598.89 s [vector] +++ OK, passed 100 tests.
  3216. 598.89 s [vector] any: OK
  3217. 598.89 s [vector] +++ OK, passed 100 tests.
  3218. 598.91 s [vector] prescanl: OK (0.02s)
  3219. 598.91 s [vector] +++ OK, passed 100 tests.
  3220. 598.95 s [vector] prescanl': OK (0.02s)
  3221. 598.95 s [vector] +++ OK, passed 100 tests.
  3222. 598.96 s [vector] postscanl: OK (0.02s)
  3223. 598.96 s [vector] +++ OK, passed 100 tests.
  3224. 599.00 s [vector] postscanl': OK (0.02s)
  3225. 599.00 s [vector] +++ OK, passed 100 tests.
  3226. 599.02 s [vector] scanl: OK (0.03s)
  3227. 599.02 s [vector] +++ OK, passed 100 tests.
  3228. 599.04 s [vector] scanl': OK (0.03s)
  3229. 599.04 s [vector] +++ OK, passed 100 tests.
  3230. 599.08 s [vector] scanl1: OK (0.03s)
  3231. 599.09 s [vector] +++ OK, passed 100 tests.
  3232. 599.09 s [vector] scanl1': OK (0.03s)
  3233. 599.09 s [vector] +++ OK, passed 100 tests.
  3234. 599.14 s [vector] iscanl: OK (0.03s)
  3235. 599.14 s [vector] +++ OK, passed 100 tests.
  3236. 599.16 s [vector] iscanl': OK (0.03s)
  3237. 599.16 s [vector] +++ OK, passed 100 tests.
  3238. 599.20 s [vector] prescanr: OK (0.03s)
  3239. 599.20 s [vector] +++ OK, passed 100 tests.
  3240. 599.21 s [vector] prescanr': OK (0.03s)
  3241. 599.21 s [vector] +++ OK, passed 100 tests.
  3242. 599.26 s [vector] postscanr: OK (0.02s)
  3243. 599.26 s [vector] +++ OK, passed 100 tests.
  3244. 599.28 s [vector] postscanr': OK (0.03s)
  3245. 599.29 s [vector] +++ OK, passed 100 tests.
  3246. 599.30 s [vector] scanr: OK (0.03s)
  3247. 599.30 s [vector] +++ OK, passed 100 tests.
  3248. 599.34 s [vector] scanr': OK (0.03s)
  3249. 599.34 s [vector] +++ OK, passed 100 tests.
  3250. 599.36 s [vector] scanr1: OK (0.03s)
  3251. 599.36 s [vector] +++ OK, passed 100 tests.
  3252. 599.38 s [vector] scanr1': OK (0.02s)
  3253. 599.38 s [vector] +++ OK, passed 100 tests.
  3254. 599.42 s [vector] iscanr: OK (0.03s)
  3255. 599.42 s [vector] +++ OK, passed 100 tests.
  3256. 599.44 s [vector] iscanr': OK (0.03s)
  3257. 599.44 s [vector] +++ OK, passed 100 tests.
  3258. 599.44 s [vector] mut_read: OK
  3259. 599.44 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3260. 599.44 s [vector] mut_write: OK
  3261. 599.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3262. 599.44 s [vector] mut_modify: OK
  3263. 599.44 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3264. 599.47 s [vector] mut_generate: OK
  3265. 599.47 s [vector] +++ OK, passed 100 tests.
  3266. 599.49 s [vector] mut_generateM: OK (0.03s)
  3267. 599.49 s [vector] +++ OK, passed 100 tests.
  3268. 599.54 s [vector] mut_mapM_: OK (0.07s)
  3269. 599.54 s [vector] +++ OK, passed 100 tests.
  3270. 599.65 s [vector] mut_imapM_: OK (0.08s)
  3271. 599.65 s [vector] +++ OK, passed 100 tests.
  3272. 599.73 s [vector] mut_forM_: OK (0.09s)
  3273. 599.73 s [vector] +++ OK, passed 100 tests.
  3274. 599.81 s [vector] mut_iforM_: OK (0.08s)
  3275. 599.81 s [vector] +++ OK, passed 100 tests.
  3276. 599.85 s [vector] mut_foldr: OK (0.03s)
  3277. 599.85 s [vector] +++ OK, passed 100 tests.
  3278. 599.87 s [vector] mut_foldr': OK (0.03s)
  3279. 599.87 s [vector] +++ OK, passed 100 tests.
  3280. 599.90 s [vector] mut_foldl: OK (0.03s)
  3281. 599.91 s [vector] +++ OK, passed 100 tests.
  3282. 599.95 s [vector] mut_foldl': OK (0.04s)
  3283. 599.95 s [vector] +++ OK, passed 100 tests.
  3284. 599.99 s [vector] mut_ifoldr: OK (0.03s)
  3285. 600.00 s [vector] +++ OK, passed 100 tests.
  3286. 600.01 s [vector] mut_ifoldr': OK (0.03s)
  3287. 600.01 s [vector] +++ OK, passed 100 tests.
  3288. 600.03 s [vector] mut_ifoldl: OK (0.03s)
  3289. 600.03 s [vector] +++ OK, passed 100 tests.
  3290. 600.07 s [vector] mut_ifoldl': OK (0.03s)
  3291. 600.07 s [vector] +++ OK, passed 100 tests.
  3292. 600.12 s [vector] mut_foldM: OK (0.03s)
  3293. 600.13 s [vector] +++ OK, passed 100 tests.
  3294. 600.14 s [vector] mut_foldM': OK (0.03s)
  3295. 600.14 s [vector] +++ OK, passed 100 tests.
  3296. 600.16 s [vector] mut_foldrM: OK (0.01s)
  3297. 600.16 s [vector] +++ OK, passed 100 tests.
  3298. 600.20 s [vector] mut_foldrM': OK (0.03s)
  3299. 600.21 s [vector] +++ OK, passed 100 tests.
  3300. 600.22 s [vector] mut_ifoldM: OK (0.03s)
  3301. 600.22 s [vector] +++ OK, passed 100 tests.
  3302. 600.26 s [vector] mut_ifoldM': OK (0.03s)
  3303. 600.26 s [vector] +++ OK, passed 100 tests.
  3304. 600.28 s [vector] mut_ifoldrM: OK (0.03s)
  3305. 600.28 s [vector] +++ OK, passed 100 tests.
  3306. 600.31 s [vector] mut_ifoldrM': OK (0.03s)
  3307. 600.31 s [vector] +++ OK, passed 100 tests.
  3308. 600.31 s [vector] compare: OK
  3309. 600.31 s [vector] +++ OK, passed 100 tests.
  3310. 600.32 s [vector] maximum: OK
  3311. 600.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3312. 600.32 s [vector] minimum: OK
  3313. 600.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3314. 600.32 s [vector] minIndex: OK
  3315. 600.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3316. 600.32 s [vector] maxIndex: OK
  3317. 600.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3318. 600.32 s [vector] maximumBy: OK
  3319. 600.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3320. 600.33 s [vector] minimumBy: OK
  3321. 600.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3322. 600.33 s [vector] maximumOn: OK
  3323. 600.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3324. 600.33 s [vector] minimumOn: OK
  3325. 600.33 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3326. 600.33 s [vector] maxIndexBy: OK
  3327. 600.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3328. 600.33 s [vector] minIndexBy: OK
  3329. 600.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3330. 600.34 s [vector] ListFirstMaxIndexWins: OK
  3331. 600.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3332. 600.34 s [vector] FalseListFirstMaxIndexWins: OK
  3333. 600.34 s [vector] +++ OK, failed as expected. (after 1 test):
  3334. 600.34 s [vector] Exception:
  3335. 600.34 s [vector] Prelude.foldr1: empty list
  3336. 600.34 s [vector] CallStack (from HasCallStack):
  3337. 600.34 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3338. 600.34 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3339. 600.34 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3340. 600.34 s [vector] []
  3341. 600.34 s [vector] mempty: OK
  3342. 600.34 s [vector] +++ OK, passed 1 test.
  3343. 600.36 s [vector] mappend: OK
  3344. 600.36 s [vector] +++ OK, passed 100 tests.
  3345. 600.40 s [vector] mconcat: OK (0.05s)
  3346. 600.40 s [vector] +++ OK, passed 100 tests.
  3347. 600.40 s [vector] glength: OK
  3348. 600.40 s [vector] +++ OK, passed 100 tests.
  3349. 600.41 s [vector] sum: OK
  3350. 600.41 s [vector] +++ OK, passed 100 tests.
  3351. 600.41 s [vector] product: OK
  3352. 600.41 s [vector] +++ OK, passed 100 tests.
  3353. 600.41 s [vector] enumFromN: OK
  3354. 600.41 s [vector] +++ OK, passed 100 tests.
  3355. 600.41 s [vector] enumFromThenN: OK
  3356. 600.41 s [vector] +++ OK, passed 100 tests.
  3357. 600.41 s [vector] enumFromTo: OK
  3358. 600.41 s [vector] +++ OK, passed 100 tests.
  3359. 600.42 s [vector] enumFromThenTo: OK
  3360. 600.42 s [vector] +++ OK, passed 100 tests; 6 discarded.
  3361. 600.42 s [vector] unstream
  3362. 600.42 s [vector] unstream == vunstream (exact): OK
  3363. 600.42 s [vector] +++ OK, passed 100 tests.
  3364. 600.43 s [vector] unstream == vunstream (unknown): OK
  3365. 600.43 s [vector] +++ OK, passed 100 tests.
  3366. 600.43 s [vector] unstreamR ~= vunstream (exact): OK
  3367. 600.43 s [vector] +++ OK, passed 100 tests.
  3368. 600.43 s [vector] unstreamR ~= vunstream (unknown): OK
  3369. 600.43 s [vector] +++ OK, passed 100 tests.
  3370. 600.43 s [vector] Tests.Vector.Storable
  3371. 600.43 s [vector] Data.Vector.Storable.Vector (Int)
  3372. 600.44 s [vector] fromList.toList == id: OK
  3373. 600.44 s [vector] +++ OK, passed 100 tests.
  3374. 600.44 s [vector] toList.fromList == id: OK
  3375. 600.44 s [vector] +++ OK, passed 100 tests.
  3376. 600.44 s [vector] unstream.stream == id: OK
  3377. 600.44 s [vector] +++ OK, passed 100 tests.
  3378. 600.44 s [vector] stream.unstream == id: OK
  3379. 600.44 s [vector] +++ OK, passed 100 tests.
  3380. 600.44 s [vector] eq: OK
  3381. 600.44 s [vector] +++ OK, passed 100 tests.
  3382. 600.44 s [vector] length: OK
  3383. 600.44 s [vector] +++ OK, passed 100 tests.
  3384. 600.44 s [vector] null: OK
  3385. 600.44 s [vector] +++ OK, passed 100 tests.
  3386. 600.45 s [vector] index: OK
  3387. 600.45 s [vector] +++ OK, passed 100 tests; 27 discarded.
  3388. 600.45 s [vector] safeIndex: OK
  3389. 600.45 s [vector] +++ OK, passed 100 tests.
  3390. 600.45 s [vector] head: OK
  3391. 600.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3392. 600.45 s [vector] last: OK
  3393. 600.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3394. 600.45 s [vector] unsafeIndex: OK
  3395. 600.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3396. 600.45 s [vector] unsafeHead: OK
  3397. 600.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3398. 600.45 s [vector] unsafeLast: OK
  3399. 600.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3400. 600.46 s [vector] slice: OK
  3401. 600.46 s [vector] +++ OK, passed 100 tests.
  3402. 600.46 s [vector] init: OK
  3403. 600.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3404. 600.46 s [vector] tail: OK
  3405. 600.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3406. 600.46 s [vector] take: OK
  3407. 600.46 s [vector] +++ OK, passed 100 tests.
  3408. 600.46 s [vector] drop: OK
  3409. 600.46 s [vector] +++ OK, passed 100 tests.
  3410. 600.47 s [vector] splitAt: OK
  3411. 600.47 s [vector] +++ OK, passed 100 tests.
  3412. 600.47 s [vector] empty: OK
  3413. 600.47 s [vector] +++ OK, passed 1 test.
  3414. 600.47 s [vector] singleton: OK
  3415. 600.47 s [vector] +++ OK, passed 100 tests.
  3416. 600.47 s [vector] replicate: OK
  3417. 600.47 s [vector] +++ OK, passed 100 tests.
  3418. 600.47 s [vector] generate: OK
  3419. 600.47 s [vector] +++ OK, passed 100 tests.
  3420. 600.47 s [vector] iterateN: OK
  3421. 600.48 s [vector] +++ OK, passed 100 tests.
  3422. 600.59 s [vector] iterateNM: OK (0.09s)
  3423. 600.59 s [vector] +++ OK, passed 100 tests.
  3424. 600.60 s [vector] generateM: OK (0.03s)
  3425. 600.60 s [vector] +++ OK, passed 100 tests.
  3426. 600.65 s [vector] replicateM: OK (0.05s)
  3427. 600.65 s [vector] +++ OK, passed 100 tests.
  3428. 600.65 s [vector] create: OK
  3429. 600.65 s [vector] +++ OK, passed 100 tests.
  3430. 600.68 s [vector] createT: OK
  3431. 600.68 s [vector] +++ OK, passed 100 tests.
  3432. 600.68 s [vector] unfoldr: OK
  3433. 600.68 s [vector] +++ OK, passed 100 tests.
  3434. 600.68 s [vector] unfoldrN: OK
  3435. 600.68 s [vector] +++ OK, passed 100 tests.
  3436. 600.68 s [vector] unfoldrExactN: OK
  3437. 600.68 s [vector] +++ OK, passed 100 tests.
  3438. 600.68 s [vector] unfoldrM: OK
  3439. 600.68 s [vector] +++ OK, passed 100 tests.
  3440. 600.68 s [vector] unfoldrNM: OK
  3441. 600.68 s [vector] +++ OK, passed 100 tests.
  3442. 600.79 s [vector] unfoldrExactNM: OK (0.11s)
  3443. 600.79 s [vector] +++ OK, passed 100 tests.
  3444. 600.79 s [vector] constructN: OK (0.01s)
  3445. 600.79 s [vector] +++ OK, passed 100 tests.
  3446. 600.80 s [vector] constructrN: OK
  3447. 600.81 s [vector] +++ OK, passed 100 tests.
  3448. 600.81 s [vector] cons: OK
  3449. 600.81 s [vector] +++ OK, passed 100 tests.
  3450. 600.81 s [vector] snoc: OK
  3451. 600.81 s [vector] +++ OK, passed 100 tests.
  3452. 600.82 s [vector] append: OK
  3453. 600.82 s [vector] +++ OK, passed 100 tests.
  3454. 600.84 s [vector] concat: OK (0.02s)
  3455. 600.84 s [vector] +++ OK, passed 100 tests.
  3456. 600.84 s [vector] force: OK
  3457. 600.84 s [vector] +++ OK, passed 100 tests.
  3458. 600.84 s [vector] upd: OK
  3459. 600.84 s [vector] +++ OK, passed 100 tests.
  3460. 600.85 s [vector] accum: OK
  3461. 600.85 s [vector] +++ OK, passed 100 tests.
  3462. 600.85 s [vector] reverse: OK
  3463. 600.85 s [vector] +++ OK, passed 100 tests.
  3464. 600.85 s [vector] backpermute: OK
  3465. 600.85 s [vector] +++ OK, passed 100 tests.
  3466. 600.86 s [vector] map: OK
  3467. 600.97 s [vector] +++ OK, passed 100 tests.
  3468. 600.97 s [vector] imap: OK
  3469. 600.97 s [vector] +++ OK, passed 100 tests.
  3470. 600.97 s [vector] concatMap: OK
  3471. 600.97 s [vector] +++ OK, passed 100 tests.
  3472. 600.97 s [vector] mapM: OK
  3473. 600.97 s [vector] +++ OK, passed 100 tests.
  3474. 600.97 s [vector] mapM_: OK (0.03s)
  3475. 600.97 s [vector] +++ OK, passed 100 tests.
  3476. 600.97 s [vector] forM: OK
  3477. 600.97 s [vector] +++ OK, passed 100 tests.
  3478. 600.97 s [vector] forM_: OK (0.03s)
  3479. 600.97 s [vector] +++ OK, passed 100 tests.
  3480. 600.97 s [vector] imapM: OK
  3481. 600.97 s [vector] +++ OK, passed 100 tests.
  3482. 600.98 s [vector] imapM_: OK (0.03s)
  3483. 600.99 s [vector] +++ OK, passed 100 tests.
  3484. 600.99 s [vector] zipWith: OK
  3485. 600.99 s [vector] +++ OK, passed 100 tests.
  3486. 600.99 s [vector] zipWith3: OK
  3487. 601.00 s [vector] +++ OK, passed 100 tests.
  3488. 601.00 s [vector] izipWith: OK
  3489. 601.00 s [vector] +++ OK, passed 100 tests.
  3490. 601.01 s [vector] izipWith3: OK
  3491. 601.01 s [vector] +++ OK, passed 100 tests.
  3492. 601.01 s [vector] izipWithM: OK
  3493. 601.01 s [vector] +++ OK, passed 100 tests.
  3494. 601.05 s [vector] izipWithM_: OK (0.03s)
  3495. 601.05 s [vector] +++ OK, passed 100 tests.
  3496. 601.05 s [vector] zipWithM: OK
  3497. 601.05 s [vector] +++ OK, passed 100 tests.
  3498. 601.07 s [vector] zipWithM_: OK (0.02s)
  3499. 601.07 s [vector] +++ OK, passed 100 tests.
  3500. 601.07 s [vector] filter: OK
  3501. 601.07 s [vector] +++ OK, passed 100 tests.
  3502. 601.09 s [vector] ifilter: OK
  3503. 601.09 s [vector] +++ OK, passed 100 tests.
  3504. 601.12 s [vector] filterM: OK (0.04s)
  3505. 601.12 s [vector] +++ OK, passed 100 tests.
  3506. 601.12 s [vector] uniq: OK
  3507. 601.15 s [vector] +++ OK, passed 100 tests.
  3508. 601.15 s [vector] mapMaybe: OK (0.03s)
  3509. 601.15 s [vector] +++ OK, passed 100 tests.
  3510. 601.16 s [vector] imapMaybe: OK
  3511. 601.16 s [vector] +++ OK, passed 100 tests.
  3512. 601.16 s [vector] takeWhile: OK
  3513. 601.16 s [vector] +++ OK, passed 100 tests.
  3514. 601.16 s [vector] dropWhile: OK
  3515. 601.16 s [vector] +++ OK, passed 100 tests.
  3516. 601.17 s [vector] partition: OK
  3517. 601.17 s [vector] +++ OK, passed 100 tests.
  3518. 601.17 s [vector] partitionWith: OK
  3519. 601.17 s [vector] +++ OK, passed 100 tests.
  3520. 601.17 s [vector] span: OK
  3521. 601.17 s [vector] +++ OK, passed 100 tests.
  3522. 601.17 s [vector] break: OK
  3523. 601.17 s [vector] +++ OK, passed 100 tests.
  3524. 601.17 s [vector] spanR: OK
  3525. 601.17 s [vector] +++ OK, passed 100 tests.
  3526. 601.18 s [vector] breakR: OK
  3527. 601.18 s [vector] +++ OK, passed 100 tests.
  3528. 601.18 s [vector] groupBy: OK
  3529. 601.18 s [vector] +++ OK, passed 100 tests.
  3530. 601.18 s [vector] elem: OK
  3531. 601.18 s [vector] +++ OK, passed 100 tests.
  3532. 601.18 s [vector] notElem: OK
  3533. 601.19 s [vector] +++ OK, passed 100 tests.
  3534. 601.19 s [vector] find: OK
  3535. 601.19 s [vector] +++ OK, passed 100 tests.
  3536. 601.19 s [vector] findIndex: OK
  3537. 601.19 s [vector] +++ OK, passed 100 tests.
  3538. 601.19 s [vector] findIndexR: OK
  3539. 601.19 s [vector] +++ OK, passed 100 tests.
  3540. 601.41 s [vector] findIndices: OK
  3541. 601.41 s [vector] +++ OK, passed 100 tests.
  3542. 601.41 s [vector] elemIndex: OK
  3543. 601.41 s [vector] +++ OK, passed 100 tests.
  3544. 601.41 s [vector] elemIndices: OK
  3545. 601.41 s [vector] +++ OK, passed 100 tests.
  3546. 601.41 s [vector] foldl: OK
  3547. 601.41 s [vector] +++ OK, passed 100 tests.
  3548. 601.41 s [vector] foldl1: OK
  3549. 601.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3550. 601.41 s [vector] foldl': OK
  3551. 601.41 s [vector] +++ OK, passed 100 tests.
  3552. 601.41 s [vector] foldl1': OK
  3553. 601.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3554. 601.41 s [vector] foldr: OK
  3555. 601.41 s [vector] +++ OK, passed 100 tests.
  3556. 601.41 s [vector] foldr1: OK
  3557. 601.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3558. 601.41 s [vector] foldr': OK
  3559. 601.41 s [vector] +++ OK, passed 100 tests.
  3560. 601.41 s [vector] foldr1': OK
  3561. 601.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3562. 601.41 s [vector] ifoldl: OK
  3563. 601.41 s [vector] +++ OK, passed 100 tests.
  3564. 601.41 s [vector] ifoldl': OK
  3565. 601.41 s [vector] +++ OK, passed 100 tests.
  3566. 601.41 s [vector] ifoldr: OK
  3567. 601.41 s [vector] +++ OK, passed 100 tests.
  3568. 601.41 s [vector] ifoldr': OK
  3569. 601.41 s [vector] +++ OK, passed 100 tests.
  3570. 601.41 s [vector] ifoldM: OK
  3571. 601.41 s [vector] +++ OK, passed 100 tests.
  3572. 601.41 s [vector] ifoldM': OK
  3573. 601.41 s [vector] +++ OK, passed 100 tests.
  3574. 601.41 s [vector] ifoldM_: OK (0.03s)
  3575. 601.41 s [vector] +++ OK, passed 100 tests.
  3576. 601.41 s [vector] ifoldM'_: OK (0.04s)
  3577. 601.41 s [vector] +++ OK, passed 100 tests.
  3578. 601.41 s [vector] all: OK
  3579. 601.41 s [vector] +++ OK, passed 100 tests.
  3580. 601.41 s [vector] any: OK
  3581. 601.41 s [vector] +++ OK, passed 100 tests.
  3582. 601.41 s [vector] prescanl: OK
  3583. 601.41 s [vector] +++ OK, passed 100 tests.
  3584. 601.41 s [vector] prescanl': OK
  3585. 601.41 s [vector] +++ OK, passed 100 tests.
  3586. 601.41 s [vector] postscanl: OK
  3587. 601.41 s [vector] +++ OK, passed 100 tests.
  3588. 601.41 s [vector] postscanl': OK
  3589. 601.41 s [vector] +++ OK, passed 100 tests.
  3590. 601.41 s [vector] scanl: OK
  3591. 601.41 s [vector] +++ OK, passed 100 tests.
  3592. 601.41 s [vector] scanl': OK
  3593. 601.41 s [vector] +++ OK, passed 100 tests.
  3594. 601.41 s [vector] scanl1: OK
  3595. 601.41 s [vector] +++ OK, passed 100 tests.
  3596. 601.41 s [vector] scanl1': OK
  3597. 601.41 s [vector] +++ OK, passed 100 tests.
  3598. 601.42 s [vector] iscanl: OK
  3599. 601.43 s [vector] +++ OK, passed 100 tests.
  3600. 601.43 s [vector] iscanl': OK
  3601. 601.43 s [vector] +++ OK, passed 100 tests.
  3602. 601.43 s [vector] prescanr: OK
  3603. 601.43 s [vector] +++ OK, passed 100 tests.
  3604. 601.45 s [vector] prescanr': OK
  3605. 601.45 s [vector] +++ OK, passed 100 tests.
  3606. 601.45 s [vector] postscanr: OK
  3607. 601.45 s [vector] +++ OK, passed 100 tests.
  3608. 601.46 s [vector] postscanr': OK
  3609. 601.46 s [vector] +++ OK, passed 100 tests.
  3610. 601.46 s [vector] scanr: OK
  3611. 601.46 s [vector] +++ OK, passed 100 tests.
  3612. 601.46 s [vector] scanr': OK
  3613. 601.47 s [vector] +++ OK, passed 100 tests.
  3614. 601.47 s [vector] scanr1: OK
  3615. 601.48 s [vector] +++ OK, passed 100 tests.
  3616. 601.48 s [vector] scanr1': OK
  3617. 601.48 s [vector] +++ OK, passed 100 tests.
  3618. 601.49 s [vector] iscanr: OK
  3619. 601.49 s [vector] +++ OK, passed 100 tests.
  3620. 601.50 s [vector] iscanr': OK
  3621. 601.50 s [vector] +++ OK, passed 100 tests.
  3622. 601.50 s [vector] mut_read: OK
  3623. 601.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3624. 601.50 s [vector] mut_write: OK
  3625. 601.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3626. 601.50 s [vector] mut_modify: OK
  3627. 601.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3628. 601.51 s [vector] mut_generate: OK
  3629. 601.52 s [vector] +++ OK, passed 100 tests.
  3630. 601.53 s [vector] mut_generateM: OK (0.02s)
  3631. 601.53 s [vector] +++ OK, passed 100 tests.
  3632. 601.55 s [vector] mut_mapM_: OK (0.03s)
  3633. 601.55 s [vector] +++ OK, passed 100 tests.
  3634. 601.59 s [vector] mut_imapM_: OK (0.03s)
  3635. 601.59 s [vector] +++ OK, passed 100 tests.
  3636. 601.61 s [vector] mut_forM_: OK (0.03s)
  3637. 601.61 s [vector] +++ OK, passed 100 tests.
  3638. 601.64 s [vector] mut_iforM_: OK (0.03s)
  3639. 601.65 s [vector] +++ OK, passed 100 tests.
  3640. 601.65 s [vector] mut_foldr: OK
  3641. 601.65 s [vector] +++ OK, passed 100 tests.
  3642. 601.65 s [vector] mut_foldr': OK
  3643. 601.66 s [vector] +++ OK, passed 100 tests.
  3644. 601.66 s [vector] mut_foldl: OK
  3645. 601.66 s [vector] +++ OK, passed 100 tests.
  3646. 601.66 s [vector] mut_foldl': OK
  3647. 601.67 s [vector] +++ OK, passed 100 tests.
  3648. 601.68 s [vector] mut_ifoldr: OK
  3649. 601.68 s [vector] +++ OK, passed 100 tests.
  3650. 601.68 s [vector] mut_ifoldr': OK
  3651. 601.68 s [vector] +++ OK, passed 100 tests.
  3652. 601.70 s [vector] mut_ifoldl: OK
  3653. 601.70 s [vector] +++ OK, passed 100 tests.
  3654. 601.70 s [vector] mut_ifoldl': OK
  3655. 601.70 s [vector] +++ OK, passed 100 tests.
  3656. 601.71 s [vector] mut_foldM: OK
  3657. 601.71 s [vector] +++ OK, passed 100 tests.
  3658. 601.71 s [vector] mut_foldM': OK
  3659. 601.72 s [vector] +++ OK, passed 100 tests.
  3660. 601.72 s [vector] mut_foldrM: OK
  3661. 601.72 s [vector] +++ OK, passed 100 tests.
  3662. 601.74 s [vector] mut_foldrM': OK
  3663. 601.74 s [vector] +++ OK, passed 100 tests.
  3664. 601.74 s [vector] mut_ifoldM: OK
  3665. 601.74 s [vector] +++ OK, passed 100 tests.
  3666. 601.80 s [vector] mut_ifoldM': OK (0.01s)
  3667. 601.80 s [vector] +++ OK, passed 100 tests.
  3668. 601.80 s [vector] mut_ifoldrM: OK
  3669. 601.80 s [vector] +++ OK, passed 100 tests.
  3670. 601.80 s [vector] mut_ifoldrM': OK
  3671. 601.80 s [vector] +++ OK, passed 100 tests.
  3672. 601.80 s [vector] compare: OK
  3673. 601.80 s [vector] +++ OK, passed 100 tests.
  3674. 601.80 s [vector] maximum: OK
  3675. 601.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3676. 601.80 s [vector] minimum: OK
  3677. 601.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3678. 601.80 s [vector] minIndex: OK
  3679. 601.80 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3680. 601.80 s [vector] maxIndex: OK
  3681. 601.80 s [vector] +++ OK, passed 100 tests; 23 discarded.
  3682. 601.80 s [vector] maximumBy: OK
  3683. 601.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3684. 601.80 s [vector] minimumBy: OK
  3685. 601.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3686. 601.80 s [vector] maximumOn: OK
  3687. 601.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3688. 601.80 s [vector] minimumOn: OK
  3689. 601.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3690. 601.80 s [vector] maxIndexBy: OK
  3691. 601.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3692. 601.80 s [vector] minIndexBy: OK
  3693. 601.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3694. 601.80 s [vector] ListFirstMaxIndexWins: OK
  3695. 601.80 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3696. 601.80 s [vector] FalseListFirstMaxIndexWins: OK
  3697. 601.81 s [vector] +++ OK, failed as expected. (after 1 test):
  3698. 601.81 s [vector] Exception:
  3699. 601.81 s [vector] Prelude.foldr1: empty list
  3700. 601.81 s [vector] CallStack (from HasCallStack):
  3701. 601.81 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3702. 601.81 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3703. 601.81 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3704. 601.81 s [vector] []
  3705. 601.81 s [vector] mempty: OK
  3706. 601.81 s [vector] +++ OK, passed 1 test.
  3707. 601.81 s [vector] mappend: OK
  3708. 601.81 s [vector] +++ OK, passed 100 tests.
  3709. 601.83 s [vector] mconcat: OK (0.03s)
  3710. 601.83 s [vector] +++ OK, passed 100 tests.
  3711. 601.83 s [vector] glength: OK
  3712. 601.83 s [vector] +++ OK, passed 100 tests.
  3713. 601.83 s [vector] sum: OK
  3714. 601.83 s [vector] +++ OK, passed 100 tests.
  3715. 601.83 s [vector] product: OK
  3716. 601.83 s [vector] +++ OK, passed 100 tests.
  3717. 601.83 s [vector] enumFromN: OK
  3718. 601.83 s [vector] +++ OK, passed 100 tests.
  3719. 601.83 s [vector] enumFromThenN: OK
  3720. 601.84 s [vector] +++ OK, passed 100 tests.
  3721. 601.84 s [vector] enumFromTo: OK
  3722. 601.84 s [vector] +++ OK, passed 100 tests.
  3723. 601.85 s [vector] enumFromThenTo: OK
  3724. 601.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3725. 601.85 s [vector] Data.Vector.Storable.Vector (Double)
  3726. 601.85 s [vector] fromList.toList == id: OK
  3727. 601.85 s [vector] +++ OK, passed 100 tests.
  3728. 601.85 s [vector] toList.fromList == id: OK
  3729. 601.85 s [vector] +++ OK, passed 100 tests.
  3730. 601.85 s [vector] unstream.stream == id: OK
  3731. 601.85 s [vector] +++ OK, passed 100 tests.
  3732. 601.85 s [vector] stream.unstream == id: OK
  3733. 601.85 s [vector] +++ OK, passed 100 tests.
  3734. 601.85 s [vector] eq: OK
  3735. 601.85 s [vector] +++ OK, passed 100 tests.
  3736. 601.86 s [vector] length: OK
  3737. 601.86 s [vector] +++ OK, passed 100 tests.
  3738. 601.86 s [vector] null: OK
  3739. 601.86 s [vector] +++ OK, passed 100 tests.
  3740. 601.86 s [vector] index: OK
  3741. 601.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3742. 601.86 s [vector] safeIndex: OK
  3743. 601.86 s [vector] +++ OK, passed 100 tests.
  3744. 601.86 s [vector] head: OK
  3745. 601.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3746. 601.86 s [vector] last: OK
  3747. 601.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3748. 601.86 s [vector] unsafeIndex: OK
  3749. 601.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3750. 601.87 s [vector] unsafeHead: OK
  3751. 601.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3752. 601.87 s [vector] unsafeLast: OK
  3753. 601.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3754. 601.87 s [vector] slice: OK
  3755. 601.87 s [vector] +++ OK, passed 100 tests.
  3756. 601.87 s [vector] init: OK
  3757. 601.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3758. 601.88 s [vector] tail: OK
  3759. 601.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3760. 601.88 s [vector] take: OK
  3761. 601.88 s [vector] +++ OK, passed 100 tests.
  3762. 601.88 s [vector] drop: OK
  3763. 601.88 s [vector] +++ OK, passed 100 tests.
  3764. 601.88 s [vector] splitAt: OK
  3765. 601.88 s [vector] +++ OK, passed 100 tests.
  3766. 601.88 s [vector] empty: OK
  3767. 601.88 s [vector] +++ OK, passed 1 test.
  3768. 601.88 s [vector] singleton: OK
  3769. 601.88 s [vector] +++ OK, passed 100 tests.
  3770. 601.89 s [vector] replicate: OK
  3771. 601.89 s [vector] +++ OK, passed 100 tests.
  3772. 601.89 s [vector] generate: OK
  3773. 601.89 s [vector] +++ OK, passed 100 tests.
  3774. 601.89 s [vector] iterateN: OK
  3775. 601.89 s [vector] +++ OK, passed 100 tests.
  3776. 601.98 s [vector] iterateNM: OK (0.08s)
  3777. 601.98 s [vector] +++ OK, passed 100 tests.
  3778. 602.04 s [vector] generateM: OK (0.04s)
  3779. 602.04 s [vector] +++ OK, passed 100 tests.
  3780. 602.04 s [vector] replicateM: OK (0.02s)
  3781. 602.05 s [vector] +++ OK, passed 100 tests.
  3782. 602.05 s [vector] create: OK
  3783. 602.05 s [vector] +++ OK, passed 100 tests.
  3784. 602.12 s [vector] createT: OK
  3785. 602.12 s [vector] +++ OK, passed 100 tests.
  3786. 602.12 s [vector] unfoldr: OK
  3787. 602.12 s [vector] +++ OK, passed 100 tests.
  3788. 602.12 s [vector] unfoldrN: OK
  3789. 602.12 s [vector] +++ OK, passed 100 tests.
  3790. 602.12 s [vector] unfoldrExactN: OK
  3791. 602.12 s [vector] +++ OK, passed 100 tests.
  3792. 602.12 s [vector] unfoldrM: OK
  3793. 602.12 s [vector] +++ OK, passed 100 tests.
  3794. 602.12 s [vector] unfoldrNM: OK
  3795. 602.12 s [vector] +++ OK, passed 100 tests.
  3796. 602.14 s [vector] unfoldrExactNM: OK (0.08s)
  3797. 602.15 s [vector] +++ OK, passed 100 tests.
  3798. 602.18 s [vector] constructN: OK (0.02s)
  3799. 602.18 s [vector] +++ OK, passed 100 tests.
  3800. 602.21 s [vector] constructrN: OK (0.03s)
  3801. 602.21 s [vector] +++ OK, passed 100 tests.
  3802. 602.21 s [vector] cons: OK
  3803. 602.21 s [vector] +++ OK, passed 100 tests.
  3804. 602.21 s [vector] snoc: OK
  3805. 602.22 s [vector] +++ OK, passed 100 tests.
  3806. 602.22 s [vector] append: OK
  3807. 602.22 s [vector] +++ OK, passed 100 tests.
  3808. 602.26 s [vector] concat: OK (0.04s)
  3809. 602.26 s [vector] +++ OK, passed 100 tests.
  3810. 602.26 s [vector] force: OK
  3811. 602.27 s [vector] +++ OK, passed 100 tests.
  3812. 602.27 s [vector] upd: OK
  3813. 602.28 s [vector] +++ OK, passed 100 tests.
  3814. 602.30 s [vector] accum: OK (0.03s)
  3815. 602.30 s [vector] +++ OK, passed 100 tests.
  3816. 602.31 s [vector] reverse: OK
  3817. 602.31 s [vector] +++ OK, passed 100 tests.
  3818. 602.31 s [vector] backpermute: OK
  3819. 602.31 s [vector] +++ OK, passed 100 tests.
  3820. 602.34 s [vector] map: OK (0.02s)
  3821. 602.34 s [vector] +++ OK, passed 100 tests.
  3822. 602.35 s [vector] imap: OK (0.02s)
  3823. 602.35 s [vector] +++ OK, passed 100 tests.
  3824. 602.38 s [vector] concatMap: OK
  3825. 602.38 s [vector] +++ OK, passed 100 tests.
  3826. 602.40 s [vector] mapM: OK (0.02s)
  3827. 602.40 s [vector] +++ OK, passed 100 tests.
  3828. 602.52 s [vector] mapM_: OK (0.10s)
  3829. 602.52 s [vector] +++ OK, passed 100 tests.
  3830. 602.52 s [vector] forM: OK (0.02s)
  3831. 602.52 s [vector] +++ OK, passed 100 tests.
  3832. 602.57 s [vector] forM_: OK (0.07s)
  3833. 602.57 s [vector] +++ OK, passed 100 tests.
  3834. 602.59 s [vector] imapM: OK (0.02s)
  3835. 602.59 s [vector] +++ OK, passed 100 tests.
  3836. 602.67 s [vector] imapM_: OK (0.08s)
  3837. 602.67 s [vector] +++ OK, passed 100 tests.
  3838. 602.69 s [vector] zipWith: OK (0.02s)
  3839. 602.69 s [vector] +++ OK, passed 100 tests.
  3840. 602.73 s [vector] zipWith3: OK (0.02s)
  3841. 602.73 s [vector] +++ OK, passed 100 tests.
  3842. 602.75 s [vector] izipWith: OK (0.02s)
  3843. 602.75 s [vector] +++ OK, passed 100 tests.
  3844. 602.79 s [vector] izipWith3: OK (0.02s)
  3845. 602.79 s [vector] +++ OK, passed 100 tests.
  3846. 602.79 s [vector] izipWithM: OK
  3847. 602.79 s [vector] +++ OK, passed 100 tests.
  3848. 602.84 s [vector] izipWithM_: OK (0.06s)
  3849. 602.84 s [vector] +++ OK, passed 100 tests.
  3850. 602.87 s [vector] zipWithM: OK (0.01s)
  3851. 602.89 s [vector] +++ OK, passed 100 tests.
  3852. 602.95 s [vector] zipWithM_: OK (0.09s)
  3853. 602.95 s [vector] +++ OK, passed 100 tests.
  3854. 602.96 s [vector] filter: OK (0.01s)
  3855. 602.96 s [vector] +++ OK, passed 100 tests.
  3856. 602.99 s [vector] ifilter: OK
  3857. 602.99 s [vector] +++ OK, passed 100 tests.
  3858. 603.18 s [vector] filterM: OK (0.16s)
  3859. 603.18 s [vector] +++ OK, passed 100 tests.
  3860. 603.18 s [vector] uniq: OK
  3861. 603.18 s [vector] +++ OK, passed 100 tests.
  3862. 603.18 s [vector] mapMaybe: OK (0.01s)
  3863. 603.18 s [vector] +++ OK, passed 100 tests.
  3864. 603.18 s [vector] imapMaybe: OK (0.02s)
  3865. 603.18 s [vector] +++ OK, passed 100 tests.
  3866. 603.18 s [vector] takeWhile: OK
  3867. 603.18 s [vector] +++ OK, passed 100 tests.
  3868. 603.18 s [vector] dropWhile: OK
  3869. 603.18 s [vector] +++ OK, passed 100 tests.
  3870. 603.19 s [vector] partition: OK (0.01s)
  3871. 603.19 s [vector] +++ OK, passed 100 tests.
  3872. 603.21 s [vector] partitionWith: OK
  3873. 603.21 s [vector] +++ OK, passed 100 tests.
  3874. 603.22 s [vector] span: OK
  3875. 603.22 s [vector] +++ OK, passed 100 tests.
  3876. 603.23 s [vector] break: OK
  3877. 603.23 s [vector] +++ OK, passed 100 tests.
  3878. 603.23 s [vector] spanR: OK
  3879. 603.23 s [vector] +++ OK, passed 100 tests.
  3880. 603.23 s [vector] breakR: OK
  3881. 603.24 s [vector] +++ OK, passed 100 tests.
  3882. 603.27 s [vector] groupBy: OK (0.03s)
  3883. 603.27 s [vector] +++ OK, passed 100 tests.
  3884. 603.27 s [vector] elem: OK
  3885. 603.27 s [vector] +++ OK, passed 100 tests.
  3886. 603.27 s [vector] notElem: OK
  3887. 603.27 s [vector] +++ OK, passed 100 tests.
  3888. 603.28 s [vector] find: OK
  3889. 603.28 s [vector] +++ OK, passed 100 tests.
  3890. 603.28 s [vector] findIndex: OK
  3891. 603.29 s [vector] +++ OK, passed 100 tests.
  3892. 603.29 s [vector] findIndexR: OK
  3893. 603.29 s [vector] +++ OK, passed 100 tests.
  3894. 603.30 s [vector] findIndices: OK (0.01s)
  3895. 603.30 s [vector] +++ OK, passed 100 tests.
  3896. 603.30 s [vector] elemIndex: OK
  3897. 603.30 s [vector] +++ OK, passed 100 tests.
  3898. 603.32 s [vector] elemIndices: OK
  3899. 603.32 s [vector] +++ OK, passed 100 tests.
  3900. 603.33 s [vector] foldl: OK (0.03s)
  3901. 603.33 s [vector] +++ OK, passed 100 tests.
  3902. 603.36 s [vector] foldl1: OK (0.03s)
  3903. 603.37 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3904. 603.40 s [vector] foldl': OK (0.03s)
  3905. 603.41 s [vector] +++ OK, passed 100 tests.
  3906. 603.43 s [vector] foldl1': OK (0.03s)
  3907. 603.43 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3908. 603.46 s [vector] foldr: OK (0.03s)
  3909. 603.46 s [vector] +++ OK, passed 100 tests.
  3910. 603.47 s [vector] foldr1: OK (0.03s)
  3911. 603.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3912. 603.50 s [vector] foldr': OK (0.02s)
  3913. 603.50 s [vector] +++ OK, passed 100 tests.
  3914. 603.54 s [vector] foldr1': OK (0.03s)
  3915. 603.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3916. 603.56 s [vector] ifoldl: OK (0.03s)
  3917. 603.56 s [vector] +++ OK, passed 100 tests.
  3918. 603.59 s [vector] ifoldl': OK (0.03s)
  3919. 603.59 s [vector] +++ OK, passed 100 tests.
  3920. 603.64 s [vector] ifoldr: OK (0.02s)
  3921. 603.64 s [vector] +++ OK, passed 100 tests.
  3922. 603.66 s [vector] ifoldr': OK (0.01s)
  3923. 603.67 s [vector] +++ OK, passed 100 tests.
  3924. 603.70 s [vector] ifoldM: OK (0.03s)
  3925. 603.70 s [vector] +++ OK, passed 100 tests.
  3926. 603.74 s [vector] ifoldM': OK (0.04s)
  3927. 603.74 s [vector] +++ OK, passed 100 tests.
  3928. 603.82 s [vector] ifoldM_: OK (0.09s)
  3929. 603.82 s [vector] +++ OK, passed 100 tests.
  3930. 603.88 s [vector] ifoldM'_: OK (0.07s)
  3931. 603.88 s [vector] +++ OK, passed 100 tests.
  3932. 603.88 s [vector] all: OK
  3933. 603.88 s [vector] +++ OK, passed 100 tests.
  3934. 603.90 s [vector] any: OK
  3935. 603.91 s [vector] +++ OK, passed 100 tests.
  3936. 603.92 s [vector] prescanl: OK (0.03s)
  3937. 603.93 s [vector] +++ OK, passed 100 tests.
  3938. 603.95 s [vector] prescanl': OK (0.03s)
  3939. 603.95 s [vector] +++ OK, passed 100 tests.
  3940. 603.98 s [vector] postscanl: OK (0.02s)
  3941. 603.98 s [vector] +++ OK, passed 100 tests.
  3942. 604.02 s [vector] postscanl': OK (0.03s)
  3943. 604.02 s [vector] +++ OK, passed 100 tests.
  3944. 604.04 s [vector] scanl: OK (0.03s)
  3945. 604.04 s [vector] +++ OK, passed 100 tests.
  3946. 604.08 s [vector] scanl': OK (0.03s)
  3947. 604.08 s [vector] +++ OK, passed 100 tests.
  3948. 604.10 s [vector] scanl1: OK (0.03s)
  3949. 604.10 s [vector] +++ OK, passed 100 tests.
  3950. 604.12 s [vector] scanl1': OK (0.03s)
  3951. 604.13 s [vector] +++ OK, passed 100 tests.
  3952. 604.16 s [vector] iscanl: OK (0.03s)
  3953. 604.16 s [vector] +++ OK, passed 100 tests.
  3954. 604.19 s [vector] iscanl': OK (0.04s)
  3955. 604.20 s [vector] +++ OK, passed 100 tests.
  3956. 604.23 s [vector] prescanr: OK (0.03s)
  3957. 604.23 s [vector] +++ OK, passed 100 tests.
  3958. 604.25 s [vector] prescanr': OK (0.03s)
  3959. 604.25 s [vector] +++ OK, passed 100 tests.
  3960. 604.27 s [vector] postscanr: OK (0.03s)
  3961. 604.28 s [vector] +++ OK, passed 100 tests.
  3962. 604.31 s [vector] postscanr': OK (0.03s)
  3963. 604.31 s [vector] +++ OK, passed 100 tests.
  3964. 604.33 s [vector] scanr: OK (0.03s)
  3965. 604.34 s [vector] +++ OK, passed 100 tests.
  3966. 604.37 s [vector] scanr': OK (0.03s)
  3967. 604.37 s [vector] +++ OK, passed 100 tests.
  3968. 604.39 s [vector] scanr1: OK (0.03s)
  3969. 604.41 s [vector] +++ OK, passed 100 tests.
  3970. 604.43 s [vector] scanr1': OK (0.04s)
  3971. 604.43 s [vector] +++ OK, passed 100 tests.
  3972. 604.45 s [vector] iscanr: OK (0.03s)
  3973. 604.45 s [vector] +++ OK, passed 100 tests.
  3974. 604.48 s [vector] iscanr': OK (0.03s)
  3975. 604.48 s [vector] +++ OK, passed 100 tests.
  3976. 604.48 s [vector] mut_read: OK
  3977. 604.48 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3978. 604.49 s [vector] mut_write: OK
  3979. 604.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3980. 604.49 s [vector] mut_modify: OK
  3981. 604.49 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3982. 604.51 s [vector] mut_generate: OK
  3983. 604.51 s [vector] +++ OK, passed 100 tests.
  3984. 604.55 s [vector] mut_generateM: OK (0.04s)
  3985. 604.55 s [vector] +++ OK, passed 100 tests.
  3986. 604.61 s [vector] mut_mapM_: OK (0.07s)
  3987. 604.61 s [vector] +++ OK, passed 100 tests.
  3988. 604.69 s [vector] mut_imapM_: OK (0.08s)
  3989. 604.69 s [vector] +++ OK, passed 100 tests.
  3990. 604.77 s [vector] mut_forM_: OK (0.07s)
  3991. 604.77 s [vector] +++ OK, passed 100 tests.
  3992. 604.88 s [vector] mut_iforM_: OK (0.10s)
  3993. 604.88 s [vector] +++ OK, passed 100 tests.
  3994. 604.90 s [vector] mut_foldr: OK (0.04s)
  3995. 604.90 s [vector] +++ OK, passed 100 tests.
  3996. 604.93 s [vector] mut_foldr': OK (0.02s)
  3997. 604.93 s [vector] +++ OK, passed 100 tests.
  3998. 604.96 s [vector] mut_foldl: OK (0.02s)
  3999. 604.96 s [vector] +++ OK, passed 100 tests.
  4000. 604.98 s [vector] mut_foldl': OK (0.03s)
  4001. 604.99 s [vector] +++ OK, passed 100 tests.
  4002. 605.01 s [vector] mut_ifoldr: OK (0.03s)
  4003. 605.01 s [vector] +++ OK, passed 100 tests.
  4004. 605.02 s [vector] mut_ifoldr': OK (0.02s)
  4005. 605.02 s [vector] +++ OK, passed 100 tests.
  4006. 605.08 s [vector] mut_ifoldl: OK (0.03s)
  4007. 605.08 s [vector] +++ OK, passed 100 tests.
  4008. 605.09 s [vector] mut_ifoldl': OK (0.03s)
  4009. 605.09 s [vector] +++ OK, passed 100 tests.
  4010. 605.10 s [vector] mut_foldM: OK (0.02s)
  4011. 605.10 s [vector] +++ OK, passed 100 tests.
  4012. 605.14 s [vector] mut_foldM': OK (0.03s)
  4013. 605.14 s [vector] +++ OK, passed 100 tests.
  4014. 605.16 s [vector] mut_foldrM: OK (0.03s)
  4015. 605.17 s [vector] +++ OK, passed 100 tests.
  4016. 605.20 s [vector] mut_foldrM': OK (0.03s)
  4017. 605.20 s [vector] +++ OK, passed 100 tests.
  4018. 605.22 s [vector] mut_ifoldM: OK (0.03s)
  4019. 605.22 s [vector] +++ OK, passed 100 tests.
  4020. 605.26 s [vector] mut_ifoldM': OK (0.03s)
  4021. 605.26 s [vector] +++ OK, passed 100 tests.
  4022. 605.28 s [vector] mut_ifoldrM: OK (0.03s)
  4023. 605.28 s [vector] +++ OK, passed 100 tests.
  4024. 605.31 s [vector] mut_ifoldrM': OK (0.03s)
  4025. 605.31 s [vector] +++ OK, passed 100 tests.
  4026. 605.32 s [vector] compare: OK
  4027. 605.32 s [vector] +++ OK, passed 100 tests.
  4028. 605.32 s [vector] maximum: OK
  4029. 605.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4030. 605.32 s [vector] minimum: OK
  4031. 605.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4032. 605.32 s [vector] minIndex: OK
  4033. 605.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4034. 605.32 s [vector] maxIndex: OK
  4035. 605.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4036. 605.33 s [vector] maximumBy: OK
  4037. 605.33 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4038. 605.33 s [vector] minimumBy: OK
  4039. 605.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4040. 605.33 s [vector] maximumOn: OK
  4041. 605.33 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4042. 605.33 s [vector] minimumOn: OK
  4043. 605.33 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4044. 605.34 s [vector] maxIndexBy: OK
  4045. 605.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4046. 605.34 s [vector] minIndexBy: OK
  4047. 605.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4048. 605.34 s [vector] ListFirstMaxIndexWins: OK
  4049. 605.34 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4050. 605.34 s [vector] FalseListFirstMaxIndexWins: OK
  4051. 605.34 s [vector] +++ OK, failed as expected. (after 1 test):
  4052. 605.34 s [vector] Exception:
  4053. 605.34 s [vector] Prelude.foldr1: empty list
  4054. 605.34 s [vector] CallStack (from HasCallStack):
  4055. 605.34 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4056. 605.34 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4057. 605.34 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4058. 605.34 s [vector] []
  4059. 605.34 s [vector] mempty: OK
  4060. 605.34 s [vector] +++ OK, passed 1 test.
  4061. 605.35 s [vector] mappend: OK
  4062. 605.36 s [vector] +++ OK, passed 100 tests.
  4063. 605.39 s [vector] mconcat: OK (0.04s)
  4064. 605.39 s [vector] +++ OK, passed 100 tests.
  4065. 605.40 s [vector] glength: OK
  4066. 605.40 s [vector] +++ OK, passed 100 tests.
  4067. 605.40 s [vector] sum: OK
  4068. 605.40 s [vector] +++ OK, passed 100 tests.
  4069. 605.40 s [vector] product: OK
  4070. 605.40 s [vector] +++ OK, passed 100 tests.
  4071. 605.40 s [vector] enumFromN: OK
  4072. 605.40 s [vector] +++ OK, passed 100 tests.
  4073. 605.40 s [vector] enumFromThenN: OK
  4074. 605.40 s [vector] +++ OK, passed 100 tests.
  4075. 605.41 s [vector] enumFromTo: OK
  4076. 605.41 s [vector] +++ OK, passed 100 tests.
  4077. 605.41 s [vector] enumFromThenTo: OK
  4078. 605.41 s [vector] +++ OK, passed 100 tests; 2 discarded.
  4079. 605.41 s [vector] unstream
  4080. 605.41 s [vector] unstream == vunstream (exact): OK
  4081. 605.41 s [vector] +++ OK, passed 100 tests.
  4082. 605.41 s [vector] unstream == vunstream (unknown): OK
  4083. 605.41 s [vector] +++ OK, passed 100 tests.
  4084. 605.42 s [vector] unstreamR ~= vunstream (exact): OK
  4085. 605.42 s [vector] +++ OK, passed 100 tests.
  4086. 605.42 s [vector] unstreamR ~= vunstream (unknown): OK
  4087. 605.42 s [vector] +++ OK, passed 100 tests.
  4088. 605.42 s [vector] Tests.Vector.Strict
  4089. 605.42 s [vector] Bool
  4090. 605.42 s [vector] fromList.toList == id: OK
  4091. 605.42 s [vector] +++ OK, passed 100 tests.
  4092. 605.42 s [vector] toList.fromList == id: OK
  4093. 605.42 s [vector] +++ OK, passed 100 tests.
  4094. 605.42 s [vector] unstream.stream == id: OK
  4095. 605.42 s [vector] +++ OK, passed 100 tests.
  4096. 605.42 s [vector] stream.unstream == id: OK
  4097. 605.42 s [vector] +++ OK, passed 100 tests.
  4098. 605.42 s [vector] eq: OK
  4099. 605.42 s [vector] +++ OK, passed 100 tests.
  4100. 605.42 s [vector] length: OK
  4101. 605.43 s [vector] +++ OK, passed 100 tests.
  4102. 605.43 s [vector] null: OK
  4103. 605.43 s [vector] +++ OK, passed 100 tests.
  4104. 605.43 s [vector] index: OK
  4105. 605.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4106. 605.43 s [vector] safeIndex: OK
  4107. 605.43 s [vector] +++ OK, passed 100 tests.
  4108. 605.43 s [vector] head: OK
  4109. 605.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4110. 605.43 s [vector] last: OK
  4111. 605.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4112. 605.43 s [vector] unsafeIndex: OK
  4113. 605.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4114. 605.43 s [vector] unsafeHead: OK
  4115. 605.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4116. 605.43 s [vector] unsafeLast: OK
  4117. 605.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4118. 605.43 s [vector] slice: OK
  4119. 605.43 s [vector] +++ OK, passed 100 tests.
  4120. 605.43 s [vector] init: OK
  4121. 605.43 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4122. 605.44 s [vector] tail: OK
  4123. 605.44 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4124. 605.44 s [vector] take: OK
  4125. 605.44 s [vector] +++ OK, passed 100 tests.
  4126. 605.44 s [vector] drop: OK
  4127. 605.44 s [vector] +++ OK, passed 100 tests.
  4128. 605.44 s [vector] splitAt: OK
  4129. 605.44 s [vector] +++ OK, passed 100 tests.
  4130. 605.44 s [vector] empty: OK
  4131. 605.44 s [vector] +++ OK, passed 1 test.
  4132. 605.44 s [vector] singleton: OK
  4133. 605.44 s [vector] +++ OK, passed 100 tests.
  4134. 605.44 s [vector] replicate: OK
  4135. 605.44 s [vector] +++ OK, passed 100 tests.
  4136. 605.44 s [vector] generate: OK
  4137. 605.44 s [vector] +++ OK, passed 100 tests.
  4138. 605.44 s [vector] iterateN: OK
  4139. 605.44 s [vector] +++ OK, passed 100 tests.
  4140. 605.47 s [vector] iterateNM: OK
  4141. 605.48 s [vector] +++ OK, passed 100 tests.
  4142. 605.50 s [vector] generateM: OK (0.02s)
  4143. 605.50 s [vector] +++ OK, passed 100 tests.
  4144. 605.51 s [vector] replicateM: OK (0.02s)
  4145. 605.51 s [vector] +++ OK, passed 100 tests.
  4146. 605.51 s [vector] create: OK
  4147. 605.51 s [vector] +++ OK, passed 100 tests.
  4148. 605.51 s [vector] createT: OK
  4149. 605.51 s [vector] +++ OK, passed 100 tests.
  4150. 605.51 s [vector] unfoldr: OK
  4151. 605.51 s [vector] +++ OK, passed 100 tests.
  4152. 605.51 s [vector] unfoldrN: OK
  4153. 605.51 s [vector] +++ OK, passed 100 tests.
  4154. 605.51 s [vector] unfoldrExactN: OK
  4155. 605.52 s [vector] +++ OK, passed 100 tests.
  4156. 605.52 s [vector] unfoldrM: OK
  4157. 605.52 s [vector] +++ OK, passed 100 tests.
  4158. 605.52 s [vector] unfoldrNM: OK
  4159. 605.52 s [vector] +++ OK, passed 100 tests.
  4160. 605.66 s [vector] unfoldrExactNM: OK (0.14s)
  4161. 605.66 s [vector] +++ OK, passed 100 tests.
  4162. 605.68 s [vector] constructN: OK (0.02s)
  4163. 605.68 s [vector] +++ OK, passed 100 tests.
  4164. 605.68 s [vector] constructrN: OK
  4165. 605.68 s [vector] +++ OK, passed 100 tests.
  4166. 605.68 s [vector] cons: OK
  4167. 605.68 s [vector] +++ OK, passed 100 tests.
  4168. 605.68 s [vector] snoc: OK
  4169. 605.68 s [vector] +++ OK, passed 100 tests.
  4170. 605.69 s [vector] append: OK
  4171. 605.69 s [vector] +++ OK, passed 100 tests.
  4172. 605.70 s [vector] concat: OK (0.02s)
  4173. 605.70 s [vector] +++ OK, passed 100 tests.
  4174. 605.71 s [vector] force: OK
  4175. 605.71 s [vector] +++ OK, passed 100 tests.
  4176. 605.71 s [vector] upd: OK
  4177. 605.71 s [vector] +++ OK, passed 100 tests.
  4178. 605.71 s [vector] accum: OK
  4179. 605.71 s [vector] +++ OK, passed 100 tests.
  4180. 605.71 s [vector] reverse: OK
  4181. 605.72 s [vector] +++ OK, passed 100 tests.
  4182. 605.72 s [vector] backpermute: OK
  4183. 605.72 s [vector] +++ OK, passed 100 tests.
  4184. 605.72 s [vector] map: OK
  4185. 605.72 s [vector] +++ OK, passed 100 tests.
  4186. 605.72 s [vector] imap: OK
  4187. 605.73 s [vector] +++ OK, passed 100 tests.
  4188. 605.73 s [vector] concatMap: OK
  4189. 605.73 s [vector] +++ OK, passed 100 tests.
  4190. 605.74 s [vector] mapM: OK
  4191. 605.74 s [vector] +++ OK, passed 100 tests.
  4192. 605.75 s [vector] mapM_: OK (0.02s)
  4193. 605.75 s [vector] +++ OK, passed 100 tests.
  4194. 605.75 s [vector] forM: OK
  4195. 605.76 s [vector] +++ OK, passed 100 tests.
  4196. 605.77 s [vector] forM_: OK (0.02s)
  4197. 605.77 s [vector] +++ OK, passed 100 tests.
  4198. 605.77 s [vector] imapM: OK
  4199. 605.77 s [vector] +++ OK, passed 100 tests.
  4200. 605.79 s [vector] imapM_: OK (0.02s)
  4201. 605.79 s [vector] +++ OK, passed 100 tests.
  4202. 605.79 s [vector] zipWith: OK
  4203. 605.79 s [vector] +++ OK, passed 100 tests.
  4204. 605.80 s [vector] zipWith3: OK
  4205. 605.80 s [vector] +++ OK, passed 100 tests.
  4206. 605.80 s [vector] izipWith: OK
  4207. 605.81 s [vector] +++ OK, passed 100 tests.
  4208. 605.81 s [vector] izipWith3: OK
  4209. 605.81 s [vector] +++ OK, passed 100 tests.
  4210. 605.82 s [vector] izipWithM: OK
  4211. 605.82 s [vector] +++ OK, passed 100 tests.
  4212. 605.83 s [vector] izipWithM_: OK (0.02s)
  4213. 605.85 s [vector] +++ OK, passed 100 tests.
  4214. 605.85 s [vector] zipWithM: OK
  4215. 605.85 s [vector] +++ OK, passed 100 tests.
  4216. 605.88 s [vector] zipWithM_: OK (0.05s)
  4217. 605.89 s [vector] +++ OK, passed 100 tests.
  4218. 605.89 s [vector] filter: OK
  4219. 605.89 s [vector] +++ OK, passed 100 tests.
  4220. 605.89 s [vector] ifilter: OK
  4221. 605.91 s [vector] +++ OK, passed 100 tests.
  4222. 605.92 s [vector] filterM: OK (0.03s)
  4223. 605.92 s [vector] +++ OK, passed 100 tests.
  4224. 605.92 s [vector] uniq: OK
  4225. 605.92 s [vector] +++ OK, passed 100 tests.
  4226. 605.92 s [vector] mapMaybe: OK
  4227. 605.93 s [vector] +++ OK, passed 100 tests.
  4228. 605.93 s [vector] imapMaybe: OK
  4229. 605.93 s [vector] +++ OK, passed 100 tests.
  4230. 605.93 s [vector] takeWhile: OK
  4231. 605.93 s [vector] +++ OK, passed 100 tests.
  4232. 605.93 s [vector] dropWhile: OK
  4233. 605.93 s [vector] +++ OK, passed 100 tests.
  4234. 605.94 s [vector] partition: OK
  4235. 605.94 s [vector] +++ OK, passed 100 tests.
  4236. 605.94 s [vector] partitionWith: OK
  4237. 605.94 s [vector] +++ OK, passed 100 tests.
  4238. 605.94 s [vector] span: OK
  4239. 605.94 s [vector] +++ OK, passed 100 tests.
  4240. 605.94 s [vector] break: OK
  4241. 605.94 s [vector] +++ OK, passed 100 tests.
  4242. 605.94 s [vector] spanR: OK
  4243. 605.94 s [vector] +++ OK, passed 100 tests.
  4244. 605.95 s [vector] breakR: OK
  4245. 605.95 s [vector] +++ OK, passed 100 tests.
  4246. 605.95 s [vector] groupBy: OK
  4247. 605.95 s [vector] +++ OK, passed 100 tests.
  4248. 605.95 s [vector] elem: OK
  4249. 606.01 s [vector] +++ OK, passed 100 tests.
  4250. 606.01 s [vector] notElem: OK
  4251. 606.01 s [vector] +++ OK, passed 100 tests.
  4252. 606.01 s [vector] find: OK
  4253. 606.01 s [vector] +++ OK, passed 100 tests.
  4254. 606.01 s [vector] findIndex: OK
  4255. 606.01 s [vector] +++ OK, passed 100 tests.
  4256. 606.01 s [vector] findIndexR: OK
  4257. 606.01 s [vector] +++ OK, passed 100 tests.
  4258. 606.01 s [vector] findIndices: OK
  4259. 606.01 s [vector] +++ OK, passed 100 tests.
  4260. 606.01 s [vector] elemIndex: OK
  4261. 606.01 s [vector] +++ OK, passed 100 tests.
  4262. 606.01 s [vector] elemIndices: OK
  4263. 606.01 s [vector] +++ OK, passed 100 tests.
  4264. 606.01 s [vector] foldl: OK
  4265. 606.01 s [vector] +++ OK, passed 100 tests.
  4266. 606.02 s [vector] foldl1: OK
  4267. 606.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4268. 606.02 s [vector] foldl': OK
  4269. 606.02 s [vector] +++ OK, passed 100 tests.
  4270. 606.02 s [vector] foldl1': OK
  4271. 606.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4272. 606.02 s [vector] foldr: OK
  4273. 606.02 s [vector] +++ OK, passed 100 tests.
  4274. 606.02 s [vector] foldr1: OK
  4275. 606.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4276. 606.02 s [vector] foldr': OK
  4277. 606.02 s [vector] +++ OK, passed 100 tests.
  4278. 606.02 s [vector] foldr1': OK
  4279. 606.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4280. 606.02 s [vector] ifoldl: OK
  4281. 606.02 s [vector] +++ OK, passed 100 tests.
  4282. 606.02 s [vector] ifoldl': OK
  4283. 606.02 s [vector] +++ OK, passed 100 tests.
  4284. 606.02 s [vector] ifoldr: OK
  4285. 606.02 s [vector] +++ OK, passed 100 tests.
  4286. 606.02 s [vector] ifoldr': OK
  4287. 606.02 s [vector] +++ OK, passed 100 tests.
  4288. 606.02 s [vector] ifoldM: OK
  4289. 606.02 s [vector] +++ OK, passed 100 tests.
  4290. 606.02 s [vector] ifoldM': OK
  4291. 606.07 s [vector] +++ OK, passed 100 tests.
  4292. 606.07 s [vector] ifoldM_: OK (0.03s)
  4293. 606.07 s [vector] +++ OK, passed 100 tests.
  4294. 606.08 s [vector] ifoldM'_: OK (0.03s)
  4295. 606.08 s [vector] +++ OK, passed 100 tests.
  4296. 606.08 s [vector] all: OK
  4297. 606.08 s [vector] +++ OK, passed 100 tests.
  4298. 606.08 s [vector] any: OK
  4299. 606.08 s [vector] +++ OK, passed 100 tests.
  4300. 606.09 s [vector] prescanl: OK
  4301. 606.09 s [vector] +++ OK, passed 100 tests.
  4302. 606.09 s [vector] prescanl': OK
  4303. 606.09 s [vector] +++ OK, passed 100 tests.
  4304. 606.09 s [vector] postscanl: OK
  4305. 606.09 s [vector] +++ OK, passed 100 tests.
  4306. 606.10 s [vector] postscanl': OK
  4307. 606.10 s [vector] +++ OK, passed 100 tests.
  4308. 606.10 s [vector] scanl: OK
  4309. 606.10 s [vector] +++ OK, passed 100 tests.
  4310. 606.10 s [vector] scanl': OK
  4311. 606.10 s [vector] +++ OK, passed 100 tests.
  4312. 606.10 s [vector] scanl1: OK
  4313. 606.10 s [vector] +++ OK, passed 100 tests.
  4314. 606.11 s [vector] scanl1': OK
  4315. 606.11 s [vector] +++ OK, passed 100 tests.
  4316. 606.11 s [vector] iscanl: OK
  4317. 606.11 s [vector] +++ OK, passed 100 tests.
  4318. 606.12 s [vector] iscanl': OK
  4319. 606.12 s [vector] +++ OK, passed 100 tests.
  4320. 606.13 s [vector] prescanr: OK
  4321. 606.13 s [vector] +++ OK, passed 100 tests.
  4322. 606.13 s [vector] prescanr': OK
  4323. 606.13 s [vector] +++ OK, passed 100 tests.
  4324. 606.13 s [vector] postscanr: OK
  4325. 606.14 s [vector] +++ OK, passed 100 tests.
  4326. 606.14 s [vector] postscanr': OK
  4327. 606.14 s [vector] +++ OK, passed 100 tests.
  4328. 606.22 s [vector] scanr: OK
  4329. 606.22 s [vector] +++ OK, passed 100 tests.
  4330. 606.22 s [vector] scanr': OK
  4331. 606.34 s [vector] +++ OK, passed 100 tests.
  4332. 606.34 s [vector] scanr1: OK
  4333. 606.34 s [vector] +++ OK, passed 100 tests.
  4334. 606.34 s [vector] scanr1': OK
  4335. 606.34 s [vector] +++ OK, passed 100 tests.
  4336. 606.34 s [vector] iscanr: OK
  4337. 606.34 s [vector] +++ OK, passed 100 tests.
  4338. 606.34 s [vector] iscanr': OK
  4339. 606.34 s [vector] +++ OK, passed 100 tests.
  4340. 606.34 s [vector] mut_read: OK
  4341. 606.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4342. 606.34 s [vector] mut_write: OK
  4343. 606.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4344. 606.34 s [vector] mut_modify: OK
  4345. 606.34 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4346. 606.34 s [vector] mut_generate: OK
  4347. 606.34 s [vector] +++ OK, passed 100 tests.
  4348. 606.35 s [vector] mut_generateM: OK (0.02s)
  4349. 606.35 s [vector] +++ OK, passed 100 tests.
  4350. 606.35 s [vector] mut_mapM_: OK (0.02s)
  4351. 606.35 s [vector] +++ OK, passed 100 tests.
  4352. 606.35 s [vector] mut_imapM_: OK (0.02s)
  4353. 606.35 s [vector] +++ OK, passed 100 tests.
  4354. 606.35 s [vector] mut_forM_: OK (0.02s)
  4355. 606.35 s [vector] +++ OK, passed 100 tests.
  4356. 606.35 s [vector] mut_iforM_: OK (0.02s)
  4357. 606.35 s [vector] +++ OK, passed 100 tests.
  4358. 606.35 s [vector] mut_foldr: OK
  4359. 606.35 s [vector] +++ OK, passed 100 tests.
  4360. 606.35 s [vector] mut_foldr': OK
  4361. 606.35 s [vector] +++ OK, passed 100 tests.
  4362. 606.35 s [vector] mut_foldl: OK
  4363. 606.35 s [vector] +++ OK, passed 100 tests.
  4364. 606.35 s [vector] mut_foldl': OK
  4365. 606.35 s [vector] +++ OK, passed 100 tests.
  4366. 606.35 s [vector] mut_ifoldr: OK
  4367. 606.35 s [vector] +++ OK, passed 100 tests.
  4368. 606.35 s [vector] mut_ifoldr': OK
  4369. 606.35 s [vector] +++ OK, passed 100 tests.
  4370. 606.35 s [vector] mut_ifoldl: OK
  4371. 606.35 s [vector] +++ OK, passed 100 tests.
  4372. 606.35 s [vector] mut_ifoldl': OK
  4373. 606.35 s [vector] +++ OK, passed 100 tests.
  4374. 606.35 s [vector] mut_foldM: OK
  4375. 606.35 s [vector] +++ OK, passed 100 tests.
  4376. 606.35 s [vector] mut_foldM': OK
  4377. 606.35 s [vector] +++ OK, passed 100 tests.
  4378. 606.35 s [vector] mut_foldrM: OK
  4379. 606.35 s [vector] +++ OK, passed 100 tests.
  4380. 606.35 s [vector] mut_foldrM': OK
  4381. 606.35 s [vector] +++ OK, passed 100 tests.
  4382. 606.35 s [vector] mut_ifoldM: OK
  4383. 606.35 s [vector] +++ OK, passed 100 tests.
  4384. 606.35 s [vector] mut_ifoldM': OK
  4385. 606.35 s [vector] +++ OK, passed 100 tests.
  4386. 606.35 s [vector] mut_ifoldrM: OK
  4387. 606.35 s [vector] +++ OK, passed 100 tests.
  4388. 606.35 s [vector] mut_ifoldrM': OK
  4389. 606.35 s [vector] +++ OK, passed 100 tests.
  4390. 606.35 s [vector] compare: OK
  4391. 606.35 s [vector] +++ OK, passed 100 tests.
  4392. 606.35 s [vector] maximum: OK
  4393. 606.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4394. 606.35 s [vector] minimum: OK
  4395. 606.35 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4396. 606.35 s [vector] minIndex: OK
  4397. 606.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4398. 606.35 s [vector] maxIndex: OK
  4399. 606.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4400. 606.35 s [vector] maximumBy: OK
  4401. 606.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4402. 606.35 s [vector] minimumBy: OK
  4403. 606.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4404. 606.35 s [vector] maximumOn: OK
  4405. 606.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4406. 606.35 s [vector] minimumOn: OK
  4407. 606.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4408. 606.35 s [vector] maxIndexBy: OK
  4409. 606.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4410. 606.36 s [vector] minIndexBy: OK
  4411. 606.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4412. 606.36 s [vector] ListFirstMaxIndexWins: OK
  4413. 606.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4414. 606.36 s [vector] FalseListFirstMaxIndexWins: OK
  4415. 606.36 s [vector] +++ OK, failed as expected. (after 1 test):
  4416. 606.36 s [vector] Exception:
  4417. 606.36 s [vector] Prelude.foldr1: empty list
  4418. 606.36 s [vector] CallStack (from HasCallStack):
  4419. 606.36 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4420. 606.36 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4421. 606.36 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4422. 606.36 s [vector] []
  4423. 606.36 s [vector] zip: OK
  4424. 606.36 s [vector] +++ OK, passed 100 tests.
  4425. 606.36 s [vector] zip3: OK
  4426. 606.36 s [vector] +++ OK, passed 100 tests.
  4427. 606.36 s [vector] unzip: OK
  4428. 606.37 s [vector] +++ OK, passed 100 tests.
  4429. 606.37 s [vector] unzip3: OK
  4430. 606.37 s [vector] +++ OK, passed 100 tests.
  4431. 606.37 s [vector] indexed: OK
  4432. 606.37 s [vector] +++ OK, passed 100 tests.
  4433. 606.38 s [vector] update: OK
  4434. 606.38 s [vector] +++ OK, passed 100 tests.
  4435. 606.41 s [vector] concat: OK (0.02s)
  4436. 606.41 s [vector] +++ OK, passed 100 tests.
  4437. 606.41 s [vector] mempty: OK
  4438. 606.41 s [vector] +++ OK, passed 1 test.
  4439. 606.41 s [vector] mappend: OK
  4440. 606.41 s [vector] +++ OK, passed 100 tests.
  4441. 606.44 s [vector] mconcat: OK (0.02s)
  4442. 606.44 s [vector] +++ OK, passed 100 tests.
  4443. 606.44 s [vector] fmap: OK
  4444. 606.44 s [vector] +++ OK, passed 100 tests.
  4445. 606.44 s [vector] return: OK
  4446. 606.44 s [vector] +++ OK, passed 100 tests.
  4447. 606.45 s [vector] bind: OK (0.03s)
  4448. 606.45 s [vector] +++ OK, passed 100 tests.
  4449. 606.45 s [vector] mzip: OK
  4450. 606.45 s [vector] +++ OK, passed 100 tests.
  4451. 606.45 s [vector] munzip: OK
  4452. 606.45 s [vector] +++ OK, passed 100 tests.
  4453. 606.45 s [vector] applicative_pure: OK
  4454. 606.47 s [vector] +++ OK, passed 100 tests.
  4455. 606.49 s [vector] applicative_appl: OK (0.03s)
  4456. 606.49 s [vector] +++ OK, passed 100 tests.
  4457. 606.49 s [vector] alternative_empty: OK
  4458. 606.49 s [vector] +++ OK, passed 1 test.
  4459. 606.49 s [vector] alternative_or: OK
  4460. 606.50 s [vector] +++ OK, passed 100 tests.
  4461. 606.54 s [vector] sequence: OK (0.05s)
  4462. 606.54 s [vector] +++ OK, passed 100 tests.
  4463. 606.56 s [vector] sequence_: OK (0.02s)
  4464. 606.56 s [vector] +++ OK, passed 100 tests.
  4465. 606.56 s [vector] glength: OK
  4466. 606.56 s [vector] +++ OK, passed 100 tests.
  4467. 606.56 s [vector] and: OK
  4468. 606.56 s [vector] +++ OK, passed 100 tests.
  4469. 606.56 s [vector] or: OK
  4470. 606.56 s [vector] +++ OK, passed 100 tests.
  4471. 606.56 s [vector] Int
  4472. 606.56 s [vector] fromList.toList == id: OK
  4473. 606.56 s [vector] +++ OK, passed 100 tests.
  4474. 606.56 s [vector] toList.fromList == id: OK
  4475. 606.57 s [vector] +++ OK, passed 100 tests.
  4476. 606.57 s [vector] unstream.stream == id: OK
  4477. 606.57 s [vector] +++ OK, passed 100 tests.
  4478. 606.57 s [vector] stream.unstream == id: OK
  4479. 606.57 s [vector] +++ OK, passed 100 tests.
  4480. 606.57 s [vector] eq: OK
  4481. 606.57 s [vector] +++ OK, passed 100 tests.
  4482. 606.57 s [vector] length: OK
  4483. 606.57 s [vector] +++ OK, passed 100 tests.
  4484. 606.57 s [vector] null: OK
  4485. 606.57 s [vector] +++ OK, passed 100 tests.
  4486. 606.57 s [vector] index: OK
  4487. 606.57 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4488. 606.57 s [vector] safeIndex: OK
  4489. 606.57 s [vector] +++ OK, passed 100 tests.
  4490. 606.57 s [vector] head: OK
  4491. 606.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4492. 606.58 s [vector] last: OK
  4493. 606.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4494. 606.58 s [vector] unsafeIndex: OK
  4495. 606.58 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4496. 606.58 s [vector] unsafeHead: OK
  4497. 606.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4498. 606.58 s [vector] unsafeLast: OK
  4499. 606.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4500. 606.58 s [vector] slice: OK
  4501. 606.58 s [vector] +++ OK, passed 100 tests.
  4502. 606.58 s [vector] init: OK
  4503. 606.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4504. 606.58 s [vector] tail: OK
  4505. 606.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4506. 606.59 s [vector] take: OK
  4507. 606.59 s [vector] +++ OK, passed 100 tests.
  4508. 606.59 s [vector] drop: OK
  4509. 606.59 s [vector] +++ OK, passed 100 tests.
  4510. 606.59 s [vector] splitAt: OK
  4511. 606.59 s [vector] +++ OK, passed 100 tests.
  4512. 606.59 s [vector] empty: OK
  4513. 606.59 s [vector] +++ OK, passed 1 test.
  4514. 606.59 s [vector] singleton: OK
  4515. 606.59 s [vector] +++ OK, passed 100 tests.
  4516. 606.59 s [vector] replicate: OK
  4517. 606.59 s [vector] +++ OK, passed 100 tests.
  4518. 606.59 s [vector] generate: OK
  4519. 606.60 s [vector] +++ OK, passed 100 tests.
  4520. 606.60 s [vector] iterateN: OK
  4521. 606.60 s [vector] +++ OK, passed 100 tests.
  4522. 606.66 s [vector] iterateNM: OK (0.07s)
  4523. 606.66 s [vector] +++ OK, passed 100 tests.
  4524. 606.68 s [vector] generateM: OK (0.02s)
  4525. 606.68 s [vector] +++ OK, passed 100 tests.
  4526. 606.69 s [vector] replicateM: OK (0.02s)
  4527. 606.69 s [vector] +++ OK, passed 100 tests.
  4528. 606.69 s [vector] create: OK
  4529. 606.69 s [vector] +++ OK, passed 100 tests.
  4530. 606.70 s [vector] createT: OK
  4531. 606.70 s [vector] +++ OK, passed 100 tests.
  4532. 606.70 s [vector] unfoldr: OK
  4533. 606.70 s [vector] +++ OK, passed 100 tests.
  4534. 606.70 s [vector] unfoldrN: OK
  4535. 606.70 s [vector] +++ OK, passed 100 tests.
  4536. 606.70 s [vector] unfoldrExactN: OK
  4537. 606.70 s [vector] +++ OK, passed 100 tests.
  4538. 606.71 s [vector] unfoldrM: OK
  4539. 606.71 s [vector] +++ OK, passed 100 tests.
  4540. 606.71 s [vector] unfoldrNM: OK
  4541. 606.73 s [vector] +++ OK, passed 100 tests.
  4542. 606.77 s [vector] unfoldrExactNM: OK (0.06s)
  4543. 606.77 s [vector] +++ OK, passed 100 tests.
  4544. 606.78 s [vector] constructN: OK
  4545. 606.78 s [vector] +++ OK, passed 100 tests.
  4546. 606.78 s [vector] constructrN: OK
  4547. 606.78 s [vector] +++ OK, passed 100 tests.
  4548. 606.78 s [vector] cons: OK
  4549. 606.78 s [vector] +++ OK, passed 100 tests.
  4550. 606.78 s [vector] snoc: OK
  4551. 606.78 s [vector] +++ OK, passed 100 tests.
  4552. 606.80 s [vector] append: OK
  4553. 606.80 s [vector] +++ OK, passed 100 tests.
  4554. 606.81 s [vector] concat: OK (0.02s)
  4555. 606.81 s [vector] +++ OK, passed 100 tests.
  4556. 606.81 s [vector] force: OK
  4557. 606.81 s [vector] +++ OK, passed 100 tests.
  4558. 606.81 s [vector] upd: OK
  4559. 606.81 s [vector] +++ OK, passed 100 tests.
  4560. 606.82 s [vector] accum: OK
  4561. 606.82 s [vector] +++ OK, passed 100 tests.
  4562. 606.82 s [vector] reverse: OK
  4563. 606.82 s [vector] +++ OK, passed 100 tests.
  4564. 606.83 s [vector] backpermute: OK
  4565. 606.83 s [vector] +++ OK, passed 100 tests.
  4566. 606.83 s [vector] map: OK
  4567. 606.84 s [vector] +++ OK, passed 100 tests.
  4568. 606.84 s [vector] imap: OK
  4569. 606.84 s [vector] +++ OK, passed 100 tests.
  4570. 606.84 s [vector] concatMap: OK
  4571. 606.84 s [vector] +++ OK, passed 100 tests.
  4572. 606.86 s [vector] mapM: OK
  4573. 606.86 s [vector] +++ OK, passed 100 tests.
  4574. 606.88 s [vector] mapM_: OK (0.03s)
  4575. 606.88 s [vector] +++ OK, passed 100 tests.
  4576. 606.89 s [vector] forM: OK
  4577. 606.89 s [vector] +++ OK, passed 100 tests.
  4578. 606.92 s [vector] forM_: OK (0.03s)
  4579. 606.92 s [vector] +++ OK, passed 100 tests.
  4580. 606.94 s [vector] imapM: OK
  4581. 606.94 s [vector] +++ OK, passed 100 tests.
  4582. 606.97 s [vector] imapM_: OK (0.04s)
  4583. 606.97 s [vector] +++ OK, passed 100 tests.
  4584. 606.97 s [vector] zipWith: OK
  4585. 606.97 s [vector] +++ OK, passed 100 tests.
  4586. 606.98 s [vector] zipWith3: OK
  4587. 606.98 s [vector] +++ OK, passed 100 tests.
  4588. 606.99 s [vector] izipWith: OK
  4589. 606.99 s [vector] +++ OK, passed 100 tests.
  4590. 607.00 s [vector] izipWith3: OK
  4591. 607.00 s [vector] +++ OK, passed 100 tests.
  4592. 607.02 s [vector] izipWithM: OK
  4593. 607.02 s [vector] +++ OK, passed 100 tests.
  4594. 607.04 s [vector] izipWithM_: OK (0.03s)
  4595. 607.04 s [vector] +++ OK, passed 100 tests.
  4596. 607.04 s [vector] zipWithM: OK
  4597. 607.04 s [vector] +++ OK, passed 100 tests.
  4598. 607.06 s [vector] zipWithM_: OK (0.03s)
  4599. 607.06 s [vector] +++ OK, passed 100 tests.
  4600. 607.07 s [vector] filter: OK
  4601. 607.07 s [vector] +++ OK, passed 100 tests.
  4602. 607.08 s [vector] ifilter: OK
  4603. 607.08 s [vector] +++ OK, passed 100 tests.
  4604. 607.13 s [vector] filterM: OK (0.06s)
  4605. 607.13 s [vector] +++ OK, passed 100 tests.
  4606. 607.13 s [vector] uniq: OK
  4607. 607.13 s [vector] +++ OK, passed 100 tests.
  4608. 607.14 s [vector] mapMaybe: OK
  4609. 607.14 s [vector] +++ OK, passed 100 tests.
  4610. 607.14 s [vector] imapMaybe: OK
  4611. 607.14 s [vector] +++ OK, passed 100 tests.
  4612. 607.14 s [vector] takeWhile: OK
  4613. 607.14 s [vector] +++ OK, passed 100 tests.
  4614. 607.15 s [vector] dropWhile: OK
  4615. 607.15 s [vector] +++ OK, passed 100 tests.
  4616. 607.15 s [vector] partition: OK
  4617. 607.15 s [vector] +++ OK, passed 100 tests.
  4618. 607.15 s [vector] partitionWith: OK
  4619. 607.15 s [vector] +++ OK, passed 100 tests.
  4620. 607.15 s [vector] span: OK
  4621. 607.16 s [vector] +++ OK, passed 100 tests.
  4622. 607.16 s [vector] break: OK
  4623. 607.16 s [vector] +++ OK, passed 100 tests.
  4624. 607.16 s [vector] spanR: OK
  4625. 607.16 s [vector] +++ OK, passed 100 tests.
  4626. 607.16 s [vector] breakR: OK
  4627. 607.16 s [vector] +++ OK, passed 100 tests.
  4628. 607.16 s [vector] groupBy: OK
  4629. 607.17 s [vector] +++ OK, passed 100 tests.
  4630. 607.17 s [vector] elem: OK
  4631. 607.17 s [vector] +++ OK, passed 100 tests.
  4632. 607.17 s [vector] notElem: OK
  4633. 607.17 s [vector] +++ OK, passed 100 tests.
  4634. 607.17 s [vector] find: OK
  4635. 607.17 s [vector] +++ OK, passed 100 tests.
  4636. 607.17 s [vector] findIndex: OK
  4637. 607.17 s [vector] +++ OK, passed 100 tests.
  4638. 607.18 s [vector] findIndexR: OK
  4639. 607.18 s [vector] +++ OK, passed 100 tests.
  4640. 607.18 s [vector] findIndices: OK
  4641. 607.18 s [vector] +++ OK, passed 100 tests.
  4642. 607.18 s [vector] elemIndex: OK
  4643. 607.18 s [vector] +++ OK, passed 100 tests.
  4644. 607.18 s [vector] elemIndices: OK
  4645. 607.18 s [vector] +++ OK, passed 100 tests.
  4646. 607.18 s [vector] foldl: OK
  4647. 607.19 s [vector] +++ OK, passed 100 tests.
  4648. 607.19 s [vector] foldl1: OK
  4649. 607.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4650. 607.20 s [vector] foldl': OK
  4651. 607.20 s [vector] +++ OK, passed 100 tests.
  4652. 607.20 s [vector] foldl1': OK
  4653. 607.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4654. 607.21 s [vector] foldr: OK
  4655. 607.21 s [vector] +++ OK, passed 100 tests.
  4656. 607.22 s [vector] foldr1: OK
  4657. 607.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4658. 607.22 s [vector] foldr': OK
  4659. 607.22 s [vector] +++ OK, passed 100 tests.
  4660. 607.24 s [vector] foldr1': OK
  4661. 607.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4662. 607.24 s [vector] ifoldl: OK
  4663. 607.24 s [vector] +++ OK, passed 100 tests.
  4664. 607.25 s [vector] ifoldl': OK
  4665. 607.25 s [vector] +++ OK, passed 100 tests.
  4666. 607.26 s [vector] ifoldr: OK
  4667. 607.26 s [vector] +++ OK, passed 100 tests.
  4668. 607.26 s [vector] ifoldr': OK
  4669. 607.26 s [vector] +++ OK, passed 100 tests.
  4670. 607.28 s [vector] ifoldM: OK
  4671. 607.28 s [vector] +++ OK, passed 100 tests.
  4672. 607.28 s [vector] ifoldM': OK
  4673. 607.28 s [vector] +++ OK, passed 100 tests.
  4674. 607.32 s [vector] ifoldM_: OK (0.04s)
  4675. 607.32 s [vector] +++ OK, passed 100 tests.
  4676. 607.35 s [vector] ifoldM'_: OK (0.03s)
  4677. 607.35 s [vector] +++ OK, passed 100 tests.
  4678. 607.35 s [vector] all: OK
  4679. 607.35 s [vector] +++ OK, passed 100 tests.
  4680. 607.35 s [vector] any: OK
  4681. 607.36 s [vector] +++ OK, passed 100 tests.
  4682. 607.37 s [vector] prescanl: OK
  4683. 607.37 s [vector] +++ OK, passed 100 tests.
  4684. 607.37 s [vector] prescanl': OK
  4685. 607.37 s [vector] +++ OK, passed 100 tests.
  4686. 607.37 s [vector] postscanl: OK
  4687. 607.38 s [vector] +++ OK, passed 100 tests.
  4688. 607.38 s [vector] postscanl': OK
  4689. 607.38 s [vector] +++ OK, passed 100 tests.
  4690. 607.39 s [vector] scanl: OK
  4691. 607.39 s [vector] +++ OK, passed 100 tests.
  4692. 607.39 s [vector] scanl': OK
  4693. 607.40 s [vector] +++ OK, passed 100 tests.
  4694. 607.40 s [vector] scanl1: OK
  4695. 607.40 s [vector] +++ OK, passed 100 tests.
  4696. 607.40 s [vector] scanl1': OK
  4697. 607.40 s [vector] +++ OK, passed 100 tests.
  4698. 607.41 s [vector] iscanl: OK
  4699. 607.41 s [vector] +++ OK, passed 100 tests.
  4700. 607.41 s [vector] iscanl': OK
  4701. 607.41 s [vector] +++ OK, passed 100 tests.
  4702. 607.42 s [vector] prescanr: OK
  4703. 607.42 s [vector] +++ OK, passed 100 tests.
  4704. 607.43 s [vector] prescanr': OK
  4705. 607.43 s [vector] +++ OK, passed 100 tests.
  4706. 607.43 s [vector] postscanr: OK
  4707. 607.43 s [vector] +++ OK, passed 100 tests.
  4708. 607.44 s [vector] postscanr': OK
  4709. 607.44 s [vector] +++ OK, passed 100 tests.
  4710. 607.45 s [vector] scanr: OK
  4711. 607.45 s [vector] +++ OK, passed 100 tests.
  4712. 607.45 s [vector] scanr': OK
  4713. 607.45 s [vector] +++ OK, passed 100 tests.
  4714. 607.45 s [vector] scanr1: OK
  4715. 607.46 s [vector] +++ OK, passed 100 tests.
  4716. 607.46 s [vector] scanr1': OK
  4717. 607.46 s [vector] +++ OK, passed 100 tests.
  4718. 607.46 s [vector] iscanr: OK
  4719. 607.47 s [vector] +++ OK, passed 100 tests.
  4720. 607.47 s [vector] iscanr': OK
  4721. 607.47 s [vector] +++ OK, passed 100 tests.
  4722. 607.47 s [vector] mut_read: OK
  4723. 607.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4724. 607.47 s [vector] mut_write: OK
  4725. 607.48 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4726. 607.48 s [vector] mut_modify: OK
  4727. 607.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4728. 607.48 s [vector] mut_generate: OK
  4729. 607.48 s [vector] +++ OK, passed 100 tests.
  4730. 607.50 s [vector] mut_generateM: OK (0.02s)
  4731. 607.50 s [vector] +++ OK, passed 100 tests.
  4732. 607.54 s [vector] mut_mapM_: OK (0.03s)
  4733. 607.54 s [vector] +++ OK, passed 100 tests.
  4734. 607.56 s [vector] mut_imapM_: OK (0.03s)
  4735. 607.56 s [vector] +++ OK, passed 100 tests.
  4736. 607.60 s [vector] mut_forM_: OK (0.03s)
  4737. 607.60 s [vector] +++ OK, passed 100 tests.
  4738. 607.62 s [vector] mut_iforM_: OK (0.03s)
  4739. 607.62 s [vector] +++ OK, passed 100 tests.
  4740. 607.62 s [vector] mut_foldr: OK
  4741. 607.62 s [vector] +++ OK, passed 100 tests.
  4742. 607.63 s [vector] mut_foldr': OK
  4743. 607.63 s [vector] +++ OK, passed 100 tests.
  4744. 607.63 s [vector] mut_foldl: OK
  4745. 607.63 s [vector] +++ OK, passed 100 tests.
  4746. 607.64 s [vector] mut_foldl': OK
  4747. 607.64 s [vector] +++ OK, passed 100 tests.
  4748. 607.64 s [vector] mut_ifoldr: OK
  4749. 607.65 s [vector] +++ OK, passed 100 tests.
  4750. 607.65 s [vector] mut_ifoldr': OK
  4751. 607.65 s [vector] +++ OK, passed 100 tests.
  4752. 607.66 s [vector] mut_ifoldl: OK
  4753. 607.66 s [vector] +++ OK, passed 100 tests.
  4754. 607.66 s [vector] mut_ifoldl': OK
  4755. 607.66 s [vector] +++ OK, passed 100 tests.
  4756. 607.67 s [vector] mut_foldM: OK
  4757. 607.68 s [vector] +++ OK, passed 100 tests.
  4758. 607.68 s [vector] mut_foldM': OK
  4759. 607.68 s [vector] +++ OK, passed 100 tests.
  4760. 607.68 s [vector] mut_foldrM: OK
  4761. 607.68 s [vector] +++ OK, passed 100 tests.
  4762. 607.68 s [vector] mut_foldrM': OK
  4763. 607.68 s [vector] +++ OK, passed 100 tests.
  4764. 607.69 s [vector] mut_ifoldM: OK
  4765. 607.69 s [vector] +++ OK, passed 100 tests.
  4766. 607.69 s [vector] mut_ifoldM': OK
  4767. 607.70 s [vector] +++ OK, passed 100 tests.
  4768. 607.70 s [vector] mut_ifoldrM: OK
  4769. 607.71 s [vector] +++ OK, passed 100 tests.
  4770. 607.71 s [vector] mut_ifoldrM': OK
  4771. 607.71 s [vector] +++ OK, passed 100 tests.
  4772. 607.71 s [vector] compare: OK
  4773. 607.71 s [vector] +++ OK, passed 100 tests.
  4774. 607.71 s [vector] maximum: OK
  4775. 607.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4776. 607.71 s [vector] minimum: OK
  4777. 607.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4778. 607.71 s [vector] minIndex: OK
  4779. 607.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4780. 607.71 s [vector] maxIndex: OK
  4781. 607.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4782. 607.71 s [vector] maximumBy: OK
  4783. 607.72 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4784. 607.72 s [vector] minimumBy: OK
  4785. 607.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4786. 607.72 s [vector] maximumOn: OK
  4787. 607.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4788. 607.72 s [vector] minimumOn: OK
  4789. 607.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4790. 607.72 s [vector] maxIndexBy: OK
  4791. 607.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4792. 607.72 s [vector] minIndexBy: OK
  4793. 607.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4794. 607.72 s [vector] ListFirstMaxIndexWins: OK
  4795. 607.72 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4796. 607.72 s [vector] FalseListFirstMaxIndexWins: OK
  4797. 607.72 s [vector] +++ OK, failed as expected. (after 1 test):
  4798. 607.72 s [vector] Exception:
  4799. 607.73 s [vector] Prelude.foldr1: empty list
  4800. 607.73 s [vector] CallStack (from HasCallStack):
  4801. 607.73 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4802. 607.73 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4803. 607.73 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4804. 607.73 s [vector] []
  4805. 607.73 s [vector] zip: OK
  4806. 607.73 s [vector] +++ OK, passed 100 tests.
  4807. 607.73 s [vector] zip3: OK
  4808. 607.73 s [vector] +++ OK, passed 100 tests.
  4809. 607.73 s [vector] unzip: OK
  4810. 607.73 s [vector] +++ OK, passed 100 tests.
  4811. 607.73 s [vector] unzip3: OK
  4812. 607.73 s [vector] +++ OK, passed 100 tests.
  4813. 607.73 s [vector] indexed: OK
  4814. 607.74 s [vector] +++ OK, passed 100 tests.
  4815. 607.74 s [vector] update: OK
  4816. 607.74 s [vector] +++ OK, passed 100 tests.
  4817. 607.77 s [vector] concat: OK (0.02s)
  4818. 607.77 s [vector] +++ OK, passed 100 tests.
  4819. 607.77 s [vector] mempty: OK
  4820. 607.77 s [vector] +++ OK, passed 1 test.
  4821. 607.77 s [vector] mappend: OK
  4822. 607.77 s [vector] +++ OK, passed 100 tests.
  4823. 607.79 s [vector] mconcat: OK (0.02s)
  4824. 607.79 s [vector] +++ OK, passed 100 tests.
  4825. 607.79 s [vector] fmap: OK
  4826. 607.79 s [vector] +++ OK, passed 100 tests.
  4827. 607.79 s [vector] return: OK
  4828. 607.80 s [vector] +++ OK, passed 100 tests.
  4829. 607.82 s [vector] bind: OK (0.03s)
  4830. 607.82 s [vector] +++ OK, passed 100 tests.
  4831. 607.82 s [vector] mzip: OK
  4832. 607.82 s [vector] +++ OK, passed 100 tests.
  4833. 607.82 s [vector] munzip: OK
  4834. 607.82 s [vector] +++ OK, passed 100 tests.
  4835. 607.82 s [vector] applicative_pure: OK
  4836. 607.83 s [vector] +++ OK, passed 100 tests.
  4837. 607.89 s [vector] applicative_appl: OK (0.07s)
  4838. 607.89 s [vector] +++ OK, passed 100 tests.
  4839. 607.89 s [vector] alternative_empty: OK
  4840. 607.89 s [vector] +++ OK, passed 1 test.
  4841. 607.91 s [vector] alternative_or: OK
  4842. 607.91 s [vector] +++ OK, passed 100 tests.
  4843. 607.99 s [vector] sequence: OK (0.08s)
  4844. 607.99 s [vector] +++ OK, passed 100 tests.
  4845. 607.99 s [vector] sequence_: OK (0.02s)
  4846. 607.99 s [vector] +++ OK, passed 100 tests.
  4847. 607.99 s [vector] glength: OK
  4848. 607.99 s [vector] +++ OK, passed 100 tests.
  4849. 607.99 s [vector] sum: OK
  4850. 607.99 s [vector] +++ OK, passed 100 tests.
  4851. 607.99 s [vector] product: OK
  4852. 607.99 s [vector] +++ OK, passed 100 tests.
  4853. 607.99 s [vector] enumFromN: OK
  4854. 607.99 s [vector] +++ OK, passed 100 tests.
  4855. 607.99 s [vector] enumFromThenN: OK
  4856. 607.99 s [vector] +++ OK, passed 100 tests.
  4857. 607.99 s [vector] enumFromTo: OK
  4858. 607.99 s [vector] +++ OK, passed 100 tests.
  4859. 608.00 s [vector] enumFromThenTo: OK
  4860. 608.00 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4861. 608.00 s [vector] unstream
  4862. 608.00 s [vector] unstream == vunstream (exact): OK
  4863. 608.00 s [vector] +++ OK, passed 100 tests.
  4864. 608.00 s [vector] unstream == vunstream (unknown): OK
  4865. 608.00 s [vector] +++ OK, passed 100 tests.
  4866. 608.00 s [vector] unstreamR ~= vunstream (exact): OK
  4867. 608.00 s [vector] +++ OK, passed 100 tests.
  4868. 608.00 s [vector] unstreamR ~= vunstream (unknown): OK
  4869. 608.00 s [vector] +++ OK, passed 100 tests.
  4870. 608.00 s [vector] Tests.Vector.Unboxed
  4871. 608.00 s [vector] ()
  4872. 608.01 s [vector] fromList.toList == id: OK
  4873. 608.01 s [vector] +++ OK, passed 100 tests.
  4874. 608.01 s [vector] toList.fromList == id: OK
  4875. 608.01 s [vector] +++ OK, passed 100 tests.
  4876. 608.01 s [vector] unstream.stream == id: OK
  4877. 608.01 s [vector] +++ OK, passed 100 tests.
  4878. 608.01 s [vector] stream.unstream == id: OK
  4879. 608.01 s [vector] +++ OK, passed 100 tests.
  4880. 608.01 s [vector] eq: OK
  4881. 608.01 s [vector] +++ OK, passed 100 tests.
  4882. 608.01 s [vector] length: OK
  4883. 608.01 s [vector] +++ OK, passed 100 tests.
  4884. 608.01 s [vector] null: OK
  4885. 608.01 s [vector] +++ OK, passed 100 tests.
  4886. 608.01 s [vector] index: OK
  4887. 608.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4888. 608.01 s [vector] safeIndex: OK
  4889. 608.01 s [vector] +++ OK, passed 100 tests.
  4890. 608.01 s [vector] head: OK
  4891. 608.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4892. 608.01 s [vector] last: OK
  4893. 608.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4894. 608.01 s [vector] unsafeIndex: OK
  4895. 608.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4896. 608.01 s [vector] unsafeHead: OK
  4897. 608.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4898. 608.01 s [vector] unsafeLast: OK
  4899. 608.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4900. 608.01 s [vector] slice: OK
  4901. 608.02 s [vector] +++ OK, passed 100 tests.
  4902. 608.02 s [vector] init: OK
  4903. 608.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4904. 608.02 s [vector] tail: OK
  4905. 608.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4906. 608.02 s [vector] take: OK
  4907. 608.02 s [vector] +++ OK, passed 100 tests.
  4908. 608.02 s [vector] drop: OK
  4909. 608.02 s [vector] +++ OK, passed 100 tests.
  4910. 608.02 s [vector] splitAt: OK
  4911. 608.02 s [vector] +++ OK, passed 100 tests.
  4912. 608.02 s [vector] empty: OK
  4913. 608.02 s [vector] +++ OK, passed 1 test.
  4914. 608.02 s [vector] singleton: OK
  4915. 608.02 s [vector] +++ OK, passed 100 tests.
  4916. 608.02 s [vector] replicate: OK
  4917. 608.02 s [vector] +++ OK, passed 100 tests.
  4918. 608.02 s [vector] generate: OK
  4919. 608.02 s [vector] +++ OK, passed 100 tests.
  4920. 608.02 s [vector] iterateN: OK
  4921. 608.02 s [vector] +++ OK, passed 100 tests.
  4922. 608.09 s [vector] iterateNM: OK (0.06s)
  4923. 608.09 s [vector] +++ OK, passed 100 tests.
  4924. 608.10 s [vector] generateM: OK (0.02s)
  4925. 608.10 s [vector] +++ OK, passed 100 tests.
  4926. 608.11 s [vector] replicateM: OK
  4927. 608.11 s [vector] +++ OK, passed 100 tests.
  4928. 608.11 s [vector] create: OK
  4929. 608.11 s [vector] +++ OK, passed 100 tests.
  4930. 608.11 s [vector] createT: OK
  4931. 608.11 s [vector] +++ OK, passed 100 tests.
  4932. 608.11 s [vector] unfoldr: OK
  4933. 608.11 s [vector] +++ OK, passed 100 tests.
  4934. 608.11 s [vector] unfoldrN: OK
  4935. 608.11 s [vector] +++ OK, passed 100 tests.
  4936. 608.12 s [vector] unfoldrExactN: OK
  4937. 608.12 s [vector] +++ OK, passed 100 tests.
  4938. 608.12 s [vector] unfoldrM: OK
  4939. 608.12 s [vector] +++ OK, passed 100 tests.
  4940. 608.14 s [vector] unfoldrNM: OK (0.01s)
  4941. 608.14 s [vector] +++ OK, passed 100 tests.
  4942. 608.29 s [vector] unfoldrExactNM: OK (0.05s)
  4943. 608.29 s [vector] +++ OK, passed 100 tests.
  4944. 608.29 s [vector] constructN: OK
  4945. 608.29 s [vector] +++ OK, passed 100 tests.
  4946. 608.29 s [vector] constructrN: OK
  4947. 608.29 s [vector] +++ OK, passed 100 tests.
  4948. 608.29 s [vector] cons: OK
  4949. 608.29 s [vector] +++ OK, passed 100 tests.
  4950. 608.29 s [vector] snoc: OK
  4951. 608.29 s [vector] +++ OK, passed 100 tests.
  4952. 608.29 s [vector] append: OK
  4953. 608.29 s [vector] +++ OK, passed 100 tests.
  4954. 608.29 s [vector] concat: OK (0.01s)
  4955. 608.29 s [vector] +++ OK, passed 100 tests.
  4956. 608.29 s [vector] force: OK
  4957. 608.29 s [vector] +++ OK, passed 100 tests.
  4958. 608.29 s [vector] upd: OK
  4959. 608.29 s [vector] +++ OK, passed 100 tests.
  4960. 608.29 s [vector] accum: OK
  4961. 608.29 s [vector] +++ OK, passed 100 tests.
  4962. 608.29 s [vector] reverse: OK
  4963. 608.29 s [vector] +++ OK, passed 100 tests.
  4964. 608.29 s [vector] backpermute: OK
  4965. 608.29 s [vector] +++ OK, passed 100 tests.
  4966. 608.29 s [vector] map: OK
  4967. 608.29 s [vector] +++ OK, passed 100 tests.
  4968. 608.29 s [vector] imap: OK
  4969. 608.29 s [vector] +++ OK, passed 100 tests.
  4970. 608.29 s [vector] concatMap: OK
  4971. 608.29 s [vector] +++ OK, passed 100 tests.
  4972. 608.29 s [vector] mapM: OK
  4973. 608.29 s [vector] +++ OK, passed 100 tests.
  4974. 608.29 s [vector] mapM_: OK (0.02s)
  4975. 608.29 s [vector] +++ OK, passed 100 tests.
  4976. 608.29 s [vector] forM: OK
  4977. 608.29 s [vector] +++ OK, passed 100 tests.
  4978. 608.29 s [vector] forM_: OK (0.02s)
  4979. 608.29 s [vector] +++ OK, passed 100 tests.
  4980. 608.29 s [vector] imapM: OK
  4981. 608.29 s [vector] +++ OK, passed 100 tests.
  4982. 608.29 s [vector] imapM_: OK (0.02s)
  4983. 608.29 s [vector] +++ OK, passed 100 tests.
  4984. 608.29 s [vector] zipWith: OK
  4985. 608.29 s [vector] +++ OK, passed 100 tests.
  4986. 608.29 s [vector] zipWith3: OK
  4987. 608.29 s [vector] +++ OK, passed 100 tests.
  4988. 608.29 s [vector] izipWith: OK
  4989. 608.29 s [vector] +++ OK, passed 100 tests.
  4990. 608.30 s [vector] izipWith3: OK
  4991. 608.30 s [vector] +++ OK, passed 100 tests.
  4992. 608.30 s [vector] izipWithM: OK
  4993. 608.31 s [vector] +++ OK, passed 100 tests.
  4994. 608.32 s [vector] izipWithM_: OK (0.01s)
  4995. 608.32 s [vector] +++ OK, passed 100 tests.
  4996. 608.32 s [vector] zipWithM: OK
  4997. 608.32 s [vector] +++ OK, passed 100 tests.
  4998. 608.33 s [vector] zipWithM_: OK (0.01s)
  4999. 608.33 s [vector] +++ OK, passed 100 tests.
  5000. 608.33 s [vector] filter: OK
  5001. 608.33 s [vector] +++ OK, passed 100 tests.
  5002. 608.35 s [vector] ifilter: OK
  5003. 608.35 s [vector] +++ OK, passed 100 tests.
  5004. 608.40 s [vector] filterM: OK (0.07s)
  5005. 608.40 s [vector] +++ OK, passed 100 tests.
  5006. 608.40 s [vector] uniq: OK
  5007. 608.40 s [vector] +++ OK, passed 100 tests.
  5008. 608.40 s [vector] mapMaybe: OK
  5009. 608.41 s [vector] +++ OK, passed 100 tests.
  5010. 608.41 s [vector] imapMaybe: OK
  5011. 608.41 s [vector] +++ OK, passed 100 tests.
  5012. 608.41 s [vector] takeWhile: OK
  5013. 608.41 s [vector] +++ OK, passed 100 tests.
  5014. 608.41 s [vector] dropWhile: OK
  5015. 608.41 s [vector] +++ OK, passed 100 tests.
  5016. 608.42 s [vector] partition: OK
  5017. 608.42 s [vector] +++ OK, passed 100 tests.
  5018. 608.42 s [vector] partitionWith: OK
  5019. 608.42 s [vector] +++ OK, passed 100 tests.
  5020. 608.42 s [vector] span: OK
  5021. 608.42 s [vector] +++ OK, passed 100 tests.
  5022. 608.42 s [vector] break: OK
  5023. 608.42 s [vector] +++ OK, passed 100 tests.
  5024. 608.42 s [vector] spanR: OK
  5025. 608.42 s [vector] +++ OK, passed 100 tests.
  5026. 608.42 s [vector] breakR: OK
  5027. 608.42 s [vector] +++ OK, passed 100 tests.
  5028. 608.42 s [vector] groupBy: OK
  5029. 608.42 s [vector] +++ OK, passed 100 tests.
  5030. 608.43 s [vector] elem: OK
  5031. 608.43 s [vector] +++ OK, passed 100 tests.
  5032. 608.43 s [vector] notElem: OK
  5033. 608.43 s [vector] +++ OK, passed 100 tests.
  5034. 608.43 s [vector] find: OK
  5035. 608.43 s [vector] +++ OK, passed 100 tests.
  5036. 608.43 s [vector] findIndex: OK
  5037. 608.43 s [vector] +++ OK, passed 100 tests.
  5038. 608.43 s [vector] findIndexR: OK
  5039. 608.43 s [vector] +++ OK, passed 100 tests.
  5040. 608.43 s [vector] findIndices: OK
  5041. 608.43 s [vector] +++ OK, passed 100 tests.
  5042. 608.43 s [vector] elemIndex: OK
  5043. 608.43 s [vector] +++ OK, passed 100 tests.
  5044. 608.43 s [vector] elemIndices: OK
  5045. 608.43 s [vector] +++ OK, passed 100 tests.
  5046. 608.43 s [vector] foldl: OK
  5047. 608.43 s [vector] +++ OK, passed 100 tests.
  5048. 608.43 s [vector] foldl1: OK
  5049. 608.44 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5050. 608.44 s [vector] foldl': OK
  5051. 608.44 s [vector] +++ OK, passed 100 tests.
  5052. 608.44 s [vector] foldl1': OK
  5053. 608.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5054. 608.44 s [vector] foldr: OK
  5055. 608.44 s [vector] +++ OK, passed 100 tests.
  5056. 608.44 s [vector] foldr1: OK
  5057. 608.44 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5058. 608.44 s [vector] foldr': OK
  5059. 608.44 s [vector] +++ OK, passed 100 tests.
  5060. 608.44 s [vector] foldr1': OK
  5061. 608.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5062. 608.44 s [vector] ifoldl: OK
  5063. 608.44 s [vector] +++ OK, passed 100 tests.
  5064. 608.44 s [vector] ifoldl': OK
  5065. 608.44 s [vector] +++ OK, passed 100 tests.
  5066. 608.45 s [vector] ifoldr: OK
  5067. 608.45 s [vector] +++ OK, passed 100 tests.
  5068. 608.45 s [vector] ifoldr': OK
  5069. 608.45 s [vector] +++ OK, passed 100 tests.
  5070. 608.45 s [vector] ifoldM: OK
  5071. 608.45 s [vector] +++ OK, passed 100 tests.
  5072. 608.45 s [vector] ifoldM': OK
  5073. 608.47 s [vector] +++ OK, passed 100 tests.
  5074. 608.49 s [vector] ifoldM_: OK (0.02s)
  5075. 608.49 s [vector] +++ OK, passed 100 tests.
  5076. 608.52 s [vector] ifoldM'_: OK (0.02s)
  5077. 608.52 s [vector] +++ OK, passed 100 tests.
  5078. 608.52 s [vector] all: OK
  5079. 608.52 s [vector] +++ OK, passed 100 tests.
  5080. 608.52 s [vector] any: OK
  5081. 608.52 s [vector] +++ OK, passed 100 tests.
  5082. 608.52 s [vector] prescanl: OK
  5083. 608.52 s [vector] +++ OK, passed 100 tests.
  5084. 608.52 s [vector] prescanl': OK
  5085. 608.52 s [vector] +++ OK, passed 100 tests.
  5086. 608.52 s [vector] postscanl: OK
  5087. 608.52 s [vector] +++ OK, passed 100 tests.
  5088. 608.52 s [vector] postscanl': OK
  5089. 608.52 s [vector] +++ OK, passed 100 tests.
  5090. 608.52 s [vector] scanl: OK
  5091. 608.52 s [vector] +++ OK, passed 100 tests.
  5092. 608.52 s [vector] scanl': OK
  5093. 608.52 s [vector] +++ OK, passed 100 tests.
  5094. 608.52 s [vector] scanl1: OK
  5095. 608.52 s [vector] +++ OK, passed 100 tests.
  5096. 608.52 s [vector] scanl1': OK
  5097. 608.53 s [vector] +++ OK, passed 100 tests.
  5098. 608.53 s [vector] iscanl: OK
  5099. 608.53 s [vector] +++ OK, passed 100 tests.
  5100. 608.53 s [vector] iscanl': OK
  5101. 608.53 s [vector] +++ OK, passed 100 tests.
  5102. 608.53 s [vector] prescanr: OK
  5103. 608.54 s [vector] +++ OK, passed 100 tests.
  5104. 608.54 s [vector] prescanr': OK
  5105. 608.54 s [vector] +++ OK, passed 100 tests.
  5106. 608.54 s [vector] postscanr: OK
  5107. 608.54 s [vector] +++ OK, passed 100 tests.
  5108. 608.54 s [vector] postscanr': OK
  5109. 608.54 s [vector] +++ OK, passed 100 tests.
  5110. 608.54 s [vector] scanr: OK
  5111. 608.54 s [vector] +++ OK, passed 100 tests.
  5112. 608.54 s [vector] scanr': OK
  5113. 608.54 s [vector] +++ OK, passed 100 tests.
  5114. 608.54 s [vector] scanr1: OK
  5115. 608.54 s [vector] +++ OK, passed 100 tests.
  5116. 608.54 s [vector] scanr1': OK
  5117. 608.54 s [vector] +++ OK, passed 100 tests.
  5118. 608.54 s [vector] iscanr: OK
  5119. 608.54 s [vector] +++ OK, passed 100 tests.
  5120. 608.54 s [vector] iscanr': OK
  5121. 608.55 s [vector] +++ OK, passed 100 tests.
  5122. 608.55 s [vector] mut_read: OK
  5123. 608.55 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5124. 608.55 s [vector] mut_write: OK
  5125. 608.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5126. 608.55 s [vector] mut_modify: OK
  5127. 608.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5128. 608.55 s [vector] mut_generate: OK
  5129. 608.55 s [vector] +++ OK, passed 100 tests.
  5130. 608.57 s [vector] mut_generateM: OK (0.01s)
  5131. 608.57 s [vector] +++ OK, passed 100 tests.
  5132. 608.59 s [vector] mut_mapM_: OK (0.02s)
  5133. 608.59 s [vector] +++ OK, passed 100 tests.
  5134. 608.61 s [vector] mut_imapM_: OK (0.02s)
  5135. 608.63 s [vector] +++ OK, passed 100 tests.
  5136. 608.63 s [vector] mut_forM_: OK (0.02s)
  5137. 608.63 s [vector] +++ OK, passed 100 tests.
  5138. 608.63 s [vector] mut_iforM_: OK (0.02s)
  5139. 608.63 s [vector] +++ OK, passed 100 tests.
  5140. 608.63 s [vector] mut_foldr: OK
  5141. 608.63 s [vector] +++ OK, passed 100 tests.
  5142. 608.63 s [vector] mut_foldr': OK
  5143. 608.63 s [vector] +++ OK, passed 100 tests.
  5144. 608.63 s [vector] mut_foldl: OK
  5145. 608.63 s [vector] +++ OK, passed 100 tests.
  5146. 608.63 s [vector] mut_foldl': OK
  5147. 608.63 s [vector] +++ OK, passed 100 tests.
  5148. 608.64 s [vector] mut_ifoldr: OK
  5149. 608.64 s [vector] +++ OK, passed 100 tests.
  5150. 608.64 s [vector] mut_ifoldr': OK
  5151. 608.64 s [vector] +++ OK, passed 100 tests.
  5152. 608.64 s [vector] mut_ifoldl: OK
  5153. 608.64 s [vector] +++ OK, passed 100 tests.
  5154. 608.64 s [vector] mut_ifoldl': OK
  5155. 608.64 s [vector] +++ OK, passed 100 tests.
  5156. 608.64 s [vector] mut_foldM: OK
  5157. 608.64 s [vector] +++ OK, passed 100 tests.
  5158. 608.65 s [vector] mut_foldM': OK
  5159. 608.65 s [vector] +++ OK, passed 100 tests.
  5160. 608.65 s [vector] mut_foldrM: OK
  5161. 608.65 s [vector] +++ OK, passed 100 tests.
  5162. 608.65 s [vector] mut_foldrM': OK
  5163. 608.65 s [vector] +++ OK, passed 100 tests.
  5164. 608.65 s [vector] mut_ifoldM: OK
  5165. 608.65 s [vector] +++ OK, passed 100 tests.
  5166. 608.65 s [vector] mut_ifoldM': OK
  5167. 608.66 s [vector] +++ OK, passed 100 tests.
  5168. 608.66 s [vector] mut_ifoldrM: OK
  5169. 608.66 s [vector] +++ OK, passed 100 tests.
  5170. 608.66 s [vector] mut_ifoldrM': OK
  5171. 608.66 s [vector] +++ OK, passed 100 tests.
  5172. 608.66 s [vector] compare: OK
  5173. 608.66 s [vector] +++ OK, passed 100 tests.
  5174. 608.66 s [vector] maximum: OK
  5175. 608.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5176. 608.66 s [vector] minimum: OK
  5177. 608.66 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5178. 608.66 s [vector] minIndex: OK
  5179. 608.66 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5180. 608.66 s [vector] maxIndex: OK
  5181. 608.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5182. 608.66 s [vector] maximumBy: OK
  5183. 608.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5184. 608.67 s [vector] minimumBy: OK
  5185. 608.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5186. 608.67 s [vector] maximumOn: OK
  5187. 608.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5188. 608.67 s [vector] minimumOn: OK
  5189. 608.67 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5190. 608.67 s [vector] maxIndexBy: OK
  5191. 608.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5192. 608.67 s [vector] minIndexBy: OK
  5193. 608.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5194. 608.67 s [vector] ListFirstMaxIndexWins: OK
  5195. 608.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5196. 608.67 s [vector] FalseListFirstMaxIndexWins: OK
  5197. 608.67 s [vector] +++ OK, failed as expected. (after 1 test):
  5198. 608.67 s [vector] Exception:
  5199. 608.67 s [vector] Prelude.foldr1: empty list
  5200. 608.67 s [vector] CallStack (from HasCallStack):
  5201. 608.67 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5202. 608.67 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5203. 608.67 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5204. 608.67 s [vector] []
  5205. 608.67 s [vector] zip: OK
  5206. 608.68 s [vector] +++ OK, passed 100 tests.
  5207. 608.68 s [vector] zip3: OK
  5208. 608.68 s [vector] +++ OK, passed 100 tests.
  5209. 608.68 s [vector] unzip: OK
  5210. 608.68 s [vector] +++ OK, passed 100 tests.
  5211. 608.68 s [vector] unzip3: OK
  5212. 608.68 s [vector] +++ OK, passed 100 tests.
  5213. 608.69 s [vector] indexed: OK
  5214. 608.69 s [vector] +++ OK, passed 100 tests.
  5215. 608.69 s [vector] update: OK
  5216. 608.69 s [vector] +++ OK, passed 100 tests.
  5217. 608.69 s [vector] mempty: OK
  5218. 608.69 s [vector] +++ OK, passed 1 test.
  5219. 608.69 s [vector] mappend: OK
  5220. 608.69 s [vector] +++ OK, passed 100 tests.
  5221. 608.71 s [vector] mconcat: OK (0.02s)
  5222. 608.71 s [vector] +++ OK, passed 100 tests.
  5223. 608.72 s [vector] glength: OK
  5224. 608.72 s [vector] +++ OK, passed 100 tests.
  5225. 608.72 s [vector] (Bool)
  5226. 608.72 s [vector] fromList.toList == id: OK
  5227. 608.72 s [vector] +++ OK, passed 100 tests.
  5228. 608.72 s [vector] toList.fromList == id: OK
  5229. 608.72 s [vector] +++ OK, passed 100 tests.
  5230. 608.72 s [vector] unstream.stream == id: OK
  5231. 608.72 s [vector] +++ OK, passed 100 tests.
  5232. 608.72 s [vector] stream.unstream == id: OK
  5233. 608.72 s [vector] +++ OK, passed 100 tests.
  5234. 608.72 s [vector] eq: OK
  5235. 608.72 s [vector] +++ OK, passed 100 tests.
  5236. 608.72 s [vector] length: OK
  5237. 608.72 s [vector] +++ OK, passed 100 tests.
  5238. 608.72 s [vector] null: OK
  5239. 608.72 s [vector] +++ OK, passed 100 tests.
  5240. 608.72 s [vector] index: OK
  5241. 608.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5242. 608.72 s [vector] safeIndex: OK
  5243. 608.72 s [vector] +++ OK, passed 100 tests.
  5244. 608.73 s [vector] head: OK
  5245. 608.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5246. 608.73 s [vector] last: OK
  5247. 608.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5248. 608.73 s [vector] unsafeIndex: OK
  5249. 608.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5250. 608.73 s [vector] unsafeHead: OK
  5251. 608.73 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5252. 608.73 s [vector] unsafeLast: OK
  5253. 608.73 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5254. 608.73 s [vector] slice: OK
  5255. 608.73 s [vector] +++ OK, passed 100 tests.
  5256. 608.73 s [vector] init: OK
  5257. 608.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5258. 608.73 s [vector] tail: OK
  5259. 608.73 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5260. 608.73 s [vector] take: OK
  5261. 608.74 s [vector] +++ OK, passed 100 tests.
  5262. 608.74 s [vector] drop: OK
  5263. 608.74 s [vector] +++ OK, passed 100 tests.
  5264. 608.74 s [vector] splitAt: OK
  5265. 608.74 s [vector] +++ OK, passed 100 tests.
  5266. 608.74 s [vector] empty: OK
  5267. 608.74 s [vector] +++ OK, passed 1 test.
  5268. 608.74 s [vector] singleton: OK
  5269. 608.74 s [vector] +++ OK, passed 100 tests.
  5270. 608.74 s [vector] replicate: OK
  5271. 608.74 s [vector] +++ OK, passed 100 tests.
  5272. 608.74 s [vector] generate: OK
  5273. 608.74 s [vector] +++ OK, passed 100 tests.
  5274. 608.75 s [vector] iterateN: OK
  5275. 608.75 s [vector] +++ OK, passed 100 tests.
  5276. 608.85 s [vector] iterateNM: OK (0.05s)
  5277. 608.85 s [vector] +++ OK, passed 100 tests.
  5278. 608.85 s [vector] generateM: OK (0.03s)
  5279. 608.85 s [vector] +++ OK, passed 100 tests.
  5280. 608.86 s [vector] replicateM: OK (0.03s)
  5281. 608.86 s [vector] +++ OK, passed 100 tests.
  5282. 608.86 s [vector] create: OK
  5283. 608.86 s [vector] +++ OK, passed 100 tests.
  5284. 608.86 s [vector] createT: OK
  5285. 608.86 s [vector] +++ OK, passed 100 tests.
  5286. 608.86 s [vector] unfoldr: OK
  5287. 608.86 s [vector] +++ OK, passed 100 tests.
  5288. 608.86 s [vector] unfoldrN: OK
  5289. 608.86 s [vector] +++ OK, passed 100 tests.
  5290. 608.87 s [vector] unfoldrExactN: OK
  5291. 608.87 s [vector] +++ OK, passed 100 tests.
  5292. 608.88 s [vector] unfoldrM: OK
  5293. 608.88 s [vector] +++ OK, passed 100 tests.
  5294. 608.88 s [vector] unfoldrNM: OK
  5295. 608.89 s [vector] +++ OK, passed 100 tests.
  5296. 608.96 s [vector] unfoldrExactNM: OK (0.07s)
  5297. 608.96 s [vector] +++ OK, passed 100 tests.
  5298. 608.96 s [vector] constructN: OK
  5299. 608.96 s [vector] +++ OK, passed 100 tests.
  5300. 608.97 s [vector] constructrN: OK
  5301. 608.97 s [vector] +++ OK, passed 100 tests.
  5302. 608.97 s [vector] cons: OK
  5303. 608.97 s [vector] +++ OK, passed 100 tests.
  5304. 608.97 s [vector] snoc: OK
  5305. 608.97 s [vector] +++ OK, passed 100 tests.
  5306. 608.97 s [vector] append: OK
  5307. 608.99 s [vector] +++ OK, passed 100 tests.
  5308. 609.00 s [vector] concat: OK (0.02s)
  5309. 609.00 s [vector] +++ OK, passed 100 tests.
  5310. 609.00 s [vector] force: OK
  5311. 609.00 s [vector] +++ OK, passed 100 tests.
  5312. 609.00 s [vector] upd: OK
  5313. 609.00 s [vector] +++ OK, passed 100 tests.
  5314. 609.00 s [vector] accum: OK
  5315. 609.01 s [vector] +++ OK, passed 100 tests.
  5316. 609.01 s [vector] reverse: OK
  5317. 609.01 s [vector] +++ OK, passed 100 tests.
  5318. 609.01 s [vector] backpermute: OK
  5319. 609.01 s [vector] +++ OK, passed 100 tests.
  5320. 609.01 s [vector] map: OK
  5321. 609.01 s [vector] +++ OK, passed 100 tests.
  5322. 609.01 s [vector] imap: OK
  5323. 609.02 s [vector] +++ OK, passed 100 tests.
  5324. 609.02 s [vector] concatMap: OK
  5325. 609.02 s [vector] +++ OK, passed 100 tests.
  5326. 609.02 s [vector] mapM: OK
  5327. 609.03 s [vector] +++ OK, passed 100 tests.
  5328. 609.04 s [vector] mapM_: OK (0.02s)
  5329. 609.04 s [vector] +++ OK, passed 100 tests.
  5330. 609.05 s [vector] forM: OK
  5331. 609.05 s [vector] +++ OK, passed 100 tests.
  5332. 609.06 s [vector] forM_: OK (0.02s)
  5333. 609.07 s [vector] +++ OK, passed 100 tests.
  5334. 609.07 s [vector] imapM: OK
  5335. 609.07 s [vector] +++ OK, passed 100 tests.
  5336. 609.09 s [vector] imapM_: OK (0.02s)
  5337. 609.09 s [vector] +++ OK, passed 100 tests.
  5338. 609.10 s [vector] zipWith: OK
  5339. 609.10 s [vector] +++ OK, passed 100 tests.
  5340. 609.10 s [vector] zipWith3: OK
  5341. 609.10 s [vector] +++ OK, passed 100 tests.
  5342. 609.11 s [vector] izipWith: OK
  5343. 609.11 s [vector] +++ OK, passed 100 tests.
  5344. 609.11 s [vector] izipWith3: OK
  5345. 609.11 s [vector] +++ OK, passed 100 tests.
  5346. 609.11 s [vector] izipWithM: OK
  5347. 609.13 s [vector] +++ OK, passed 100 tests.
  5348. 609.13 s [vector] izipWithM_: OK (0.02s)
  5349. 609.13 s [vector] +++ OK, passed 100 tests.
  5350. 609.15 s [vector] zipWithM: OK
  5351. 609.15 s [vector] +++ OK, passed 100 tests.
  5352. 609.15 s [vector] zipWithM_: OK (0.02s)
  5353. 609.15 s [vector] +++ OK, passed 100 tests.
  5354. 609.15 s [vector] filter: OK
  5355. 609.15 s [vector] +++ OK, passed 100 tests.
  5356. 609.16 s [vector] ifilter: OK
  5357. 609.16 s [vector] +++ OK, passed 100 tests.
  5358. 609.23 s [vector] filterM: OK (0.07s)
  5359. 609.23 s [vector] +++ OK, passed 100 tests.
  5360. 609.23 s [vector] uniq: OK
  5361. 609.23 s [vector] +++ OK, passed 100 tests.
  5362. 609.23 s [vector] mapMaybe: OK
  5363. 609.24 s [vector] +++ OK, passed 100 tests.
  5364. 609.24 s [vector] imapMaybe: OK
  5365. 609.24 s [vector] +++ OK, passed 100 tests.
  5366. 609.24 s [vector] takeWhile: OK
  5367. 609.24 s [vector] +++ OK, passed 100 tests.
  5368. 609.24 s [vector] dropWhile: OK
  5369. 609.24 s [vector] +++ OK, passed 100 tests.
  5370. 609.24 s [vector] partition: OK
  5371. 609.24 s [vector] +++ OK, passed 100 tests.
  5372. 609.24 s [vector] partitionWith: OK
  5373. 609.25 s [vector] +++ OK, passed 100 tests.
  5374. 609.25 s [vector] span: OK
  5375. 609.25 s [vector] +++ OK, passed 100 tests.
  5376. 609.25 s [vector] break: OK
  5377. 609.25 s [vector] +++ OK, passed 100 tests.
  5378. 609.27 s [vector] spanR: OK
  5379. 609.27 s [vector] +++ OK, passed 100 tests.
  5380. 609.28 s [vector] breakR: OK (0.02s)
  5381. 609.28 s [vector] +++ OK, passed 100 tests.
  5382. 609.28 s [vector] groupBy: OK
  5383. 609.28 s [vector] +++ OK, passed 100 tests.
  5384. 609.28 s [vector] elem: OK
  5385. 609.28 s [vector] +++ OK, passed 100 tests.
  5386. 609.28 s [vector] notElem: OK
  5387. 609.28 s [vector] +++ OK, passed 100 tests.
  5388. 609.28 s [vector] find: OK
  5389. 609.29 s [vector] +++ OK, passed 100 tests.
  5390. 609.29 s [vector] findIndex: OK
  5391. 609.29 s [vector] +++ OK, passed 100 tests.
  5392. 609.29 s [vector] findIndexR: OK
  5393. 609.29 s [vector] +++ OK, passed 100 tests.
  5394. 609.29 s [vector] findIndices: OK
  5395. 609.29 s [vector] +++ OK, passed 100 tests.
  5396. 609.30 s [vector] elemIndex: OK
  5397. 609.30 s [vector] +++ OK, passed 100 tests.
  5398. 609.30 s [vector] elemIndices: OK
  5399. 609.30 s [vector] +++ OK, passed 100 tests.
  5400. 609.31 s [vector] foldl: OK
  5401. 609.31 s [vector] +++ OK, passed 100 tests.
  5402. 609.32 s [vector] foldl1: OK
  5403. 609.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5404. 609.32 s [vector] foldl': OK
  5405. 609.32 s [vector] +++ OK, passed 100 tests.
  5406. 609.32 s [vector] foldl1': OK
  5407. 609.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5408. 609.32 s [vector] foldr: OK
  5409. 609.32 s [vector] +++ OK, passed 100 tests.
  5410. 609.32 s [vector] foldr1: OK
  5411. 609.32 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5412. 609.32 s [vector] foldr': OK
  5413. 609.32 s [vector] +++ OK, passed 100 tests.
  5414. 609.32 s [vector] foldr1': OK
  5415. 609.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5416. 609.33 s [vector] ifoldl: OK
  5417. 609.33 s [vector] +++ OK, passed 100 tests.
  5418. 609.33 s [vector] ifoldl': OK
  5419. 609.34 s [vector] +++ OK, passed 100 tests.
  5420. 609.34 s [vector] ifoldr: OK
  5421. 609.34 s [vector] +++ OK, passed 100 tests.
  5422. 609.35 s [vector] ifoldr': OK
  5423. 609.35 s [vector] +++ OK, passed 100 tests.
  5424. 609.35 s [vector] ifoldM: OK
  5425. 609.35 s [vector] +++ OK, passed 100 tests.
  5426. 609.36 s [vector] ifoldM': OK
  5427. 609.37 s [vector] +++ OK, passed 100 tests.
  5428. 609.39 s [vector] ifoldM_: OK (0.03s)
  5429. 609.39 s [vector] +++ OK, passed 100 tests.
  5430. 609.41 s [vector] ifoldM'_: OK (0.02s)
  5431. 609.42 s [vector] +++ OK, passed 100 tests.
  5432. 609.42 s [vector] all: OK
  5433. 609.42 s [vector] +++ OK, passed 100 tests.
  5434. 609.42 s [vector] any: OK
  5435. 609.42 s [vector] +++ OK, passed 100 tests.
  5436. 609.42 s [vector] prescanl: OK
  5437. 609.42 s [vector] +++ OK, passed 100 tests.
  5438. 609.42 s [vector] prescanl': OK
  5439. 609.43 s [vector] +++ OK, passed 100 tests.
  5440. 609.43 s [vector] postscanl: OK
  5441. 609.43 s [vector] +++ OK, passed 100 tests.
  5442. 609.43 s [vector] postscanl': OK
  5443. 609.44 s [vector] +++ OK, passed 100 tests.
  5444. 609.44 s [vector] scanl: OK
  5445. 609.44 s [vector] +++ OK, passed 100 tests.
  5446. 609.44 s [vector] scanl': OK
  5447. 609.44 s [vector] +++ OK, passed 100 tests.
  5448. 609.45 s [vector] scanl1: OK
  5449. 609.45 s [vector] +++ OK, passed 100 tests.
  5450. 609.45 s [vector] scanl1': OK
  5451. 609.45 s [vector] +++ OK, passed 100 tests.
  5452. 609.45 s [vector] iscanl: OK
  5453. 609.46 s [vector] +++ OK, passed 100 tests.
  5454. 609.47 s [vector] iscanl': OK
  5455. 609.47 s [vector] +++ OK, passed 100 tests.
  5456. 609.47 s [vector] prescanr: OK
  5457. 609.47 s [vector] +++ OK, passed 100 tests.
  5458. 609.47 s [vector] prescanr': OK
  5459. 609.47 s [vector] +++ OK, passed 100 tests.
  5460. 609.47 s [vector] postscanr: OK
  5461. 609.47 s [vector] +++ OK, passed 100 tests.
  5462. 609.48 s [vector] postscanr': OK
  5463. 609.48 s [vector] +++ OK, passed 100 tests.
  5464. 609.48 s [vector] scanr: OK
  5465. 609.48 s [vector] +++ OK, passed 100 tests.
  5466. 609.48 s [vector] scanr': OK
  5467. 609.48 s [vector] +++ OK, passed 100 tests.
  5468. 609.48 s [vector] scanr1: OK
  5469. 609.49 s [vector] +++ OK, passed 100 tests.
  5470. 609.49 s [vector] scanr1': OK
  5471. 609.50 s [vector] +++ OK, passed 100 tests.
  5472. 609.50 s [vector] iscanr: OK
  5473. 609.50 s [vector] +++ OK, passed 100 tests.
  5474. 609.50 s [vector] iscanr': OK
  5475. 609.50 s [vector] +++ OK, passed 100 tests.
  5476. 609.50 s [vector] mut_read: OK
  5477. 609.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5478. 609.50 s [vector] mut_write: OK
  5479. 609.50 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5480. 609.50 s [vector] mut_modify: OK
  5481. 609.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5482. 609.51 s [vector] mut_generate: OK
  5483. 609.51 s [vector] +++ OK, passed 100 tests.
  5484. 609.53 s [vector] mut_generateM: OK (0.02s)
  5485. 609.53 s [vector] +++ OK, passed 100 tests.
  5486. 609.55 s [vector] mut_mapM_: OK (0.02s)
  5487. 609.55 s [vector] +++ OK, passed 100 tests.
  5488. 609.57 s [vector] mut_imapM_: OK (0.02s)
  5489. 609.58 s [vector] +++ OK, passed 100 tests.
  5490. 609.61 s [vector] mut_forM_: OK (0.03s)
  5491. 609.61 s [vector] +++ OK, passed 100 tests.
  5492. 609.66 s [vector] mut_iforM_: OK (0.05s)
  5493. 609.66 s [vector] +++ OK, passed 100 tests.
  5494. 609.66 s [vector] mut_foldr: OK
  5495. 609.66 s [vector] +++ OK, passed 100 tests.
  5496. 609.67 s [vector] mut_foldr': OK
  5497. 609.68 s [vector] +++ OK, passed 100 tests.
  5498. 609.68 s [vector] mut_foldl: OK
  5499. 609.68 s [vector] +++ OK, passed 100 tests.
  5500. 609.68 s [vector] mut_foldl': OK
  5501. 609.69 s [vector] +++ OK, passed 100 tests.
  5502. 609.71 s [vector] mut_ifoldr: OK (0.01s)
  5503. 609.71 s [vector] +++ OK, passed 100 tests.
  5504. 609.71 s [vector] mut_ifoldr': OK
  5505. 609.71 s [vector] +++ OK, passed 100 tests.
  5506. 609.71 s [vector] mut_ifoldl: OK
  5507. 609.71 s [vector] +++ OK, passed 100 tests.
  5508. 609.71 s [vector] mut_ifoldl': OK
  5509. 609.72 s [vector] +++ OK, passed 100 tests.
  5510. 609.72 s [vector] mut_foldM: OK
  5511. 609.72 s [vector] +++ OK, passed 100 tests.
  5512. 609.72 s [vector] mut_foldM': OK
  5513. 609.72 s [vector] +++ OK, passed 100 tests.
  5514. 609.73 s [vector] mut_foldrM: OK
  5515. 609.73 s [vector] +++ OK, passed 100 tests.
  5516. 609.80 s [vector] mut_foldrM': OK
  5517. 609.80 s [vector] +++ OK, passed 100 tests.
  5518. 609.80 s [vector] mut_ifoldM: OK
  5519. 609.80 s [vector] +++ OK, passed 100 tests.
  5520. 609.80 s [vector] mut_ifoldM': OK
  5521. 609.80 s [vector] +++ OK, passed 100 tests.
  5522. 609.80 s [vector] mut_ifoldrM: OK
  5523. 609.80 s [vector] +++ OK, passed 100 tests.
  5524. 609.80 s [vector] mut_ifoldrM': OK
  5525. 609.80 s [vector] +++ OK, passed 100 tests.
  5526. 609.80 s [vector] compare: OK
  5527. 609.80 s [vector] +++ OK, passed 100 tests.
  5528. 609.80 s [vector] maximum: OK
  5529. 609.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5530. 609.80 s [vector] minimum: OK
  5531. 609.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5532. 609.80 s [vector] minIndex: OK
  5533. 609.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5534. 609.80 s [vector] maxIndex: OK
  5535. 609.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5536. 609.80 s [vector] maximumBy: OK
  5537. 609.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5538. 609.80 s [vector] minimumBy: OK
  5539. 609.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5540. 609.80 s [vector] maximumOn: OK
  5541. 609.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5542. 609.80 s [vector] minimumOn: OK
  5543. 609.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5544. 609.80 s [vector] maxIndexBy: OK
  5545. 609.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5546. 609.80 s [vector] minIndexBy: OK
  5547. 609.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5548. 609.80 s [vector] ListFirstMaxIndexWins: OK
  5549. 609.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5550. 609.80 s [vector] FalseListFirstMaxIndexWins: OK
  5551. 609.80 s [vector] +++ OK, failed as expected. (after 1 test):
  5552. 609.80 s [vector] Exception:
  5553. 609.80 s [vector] Prelude.foldr1: empty list
  5554. 609.80 s [vector] CallStack (from HasCallStack):
  5555. 609.80 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5556. 609.81 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5557. 609.81 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5558. 609.81 s [vector] []
  5559. 609.81 s [vector] zip: OK
  5560. 609.81 s [vector] +++ OK, passed 100 tests.
  5561. 609.81 s [vector] zip3: OK
  5562. 609.81 s [vector] +++ OK, passed 100 tests.
  5563. 609.81 s [vector] unzip: OK
  5564. 609.81 s [vector] +++ OK, passed 100 tests.
  5565. 609.81 s [vector] unzip3: OK
  5566. 609.81 s [vector] +++ OK, passed 100 tests.
  5567. 609.81 s [vector] indexed: OK
  5568. 609.81 s [vector] +++ OK, passed 100 tests.
  5569. 609.81 s [vector] update: OK
  5570. 609.81 s [vector] +++ OK, passed 100 tests.
  5571. 609.81 s [vector] mempty: OK
  5572. 609.81 s [vector] +++ OK, passed 1 test.
  5573. 609.81 s [vector] mappend: OK
  5574. 609.81 s [vector] +++ OK, passed 100 tests.
  5575. 609.83 s [vector] mconcat: OK (0.03s)
  5576. 609.83 s [vector] +++ OK, passed 100 tests.
  5577. 609.83 s [vector] glength: OK
  5578. 609.83 s [vector] +++ OK, passed 100 tests.
  5579. 609.83 s [vector] and: OK
  5580. 609.83 s [vector] +++ OK, passed 100 tests.
  5581. 609.83 s [vector] or: OK
  5582. 609.84 s [vector] +++ OK, passed 100 tests.
  5583. 609.84 s [vector] (Int)
  5584. 609.84 s [vector] fromList.toList == id: OK
  5585. 609.84 s [vector] +++ OK, passed 100 tests.
  5586. 609.84 s [vector] toList.fromList == id: OK
  5587. 609.84 s [vector] +++ OK, passed 100 tests.
  5588. 609.84 s [vector] unstream.stream == id: OK
  5589. 609.84 s [vector] +++ OK, passed 100 tests.
  5590. 609.84 s [vector] stream.unstream == id: OK
  5591. 609.84 s [vector] +++ OK, passed 100 tests.
  5592. 609.84 s [vector] eq: OK
  5593. 609.84 s [vector] +++ OK, passed 100 tests.
  5594. 609.84 s [vector] length: OK
  5595. 609.84 s [vector] +++ OK, passed 100 tests.
  5596. 609.85 s [vector] null: OK
  5597. 609.85 s [vector] +++ OK, passed 100 tests.
  5598. 609.85 s [vector] index: OK
  5599. 609.85 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5600. 609.85 s [vector] safeIndex: OK
  5601. 609.85 s [vector] +++ OK, passed 100 tests.
  5602. 609.85 s [vector] head: OK
  5603. 609.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5604. 609.85 s [vector] last: OK
  5605. 609.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5606. 609.86 s [vector] unsafeIndex: OK
  5607. 609.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5608. 609.86 s [vector] unsafeHead: OK
  5609. 609.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5610. 609.86 s [vector] unsafeLast: OK
  5611. 609.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5612. 609.86 s [vector] slice: OK
  5613. 609.86 s [vector] +++ OK, passed 100 tests.
  5614. 609.86 s [vector] init: OK
  5615. 609.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5616. 609.86 s [vector] tail: OK
  5617. 609.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5618. 609.87 s [vector] take: OK
  5619. 609.87 s [vector] +++ OK, passed 100 tests.
  5620. 609.87 s [vector] drop: OK
  5621. 609.87 s [vector] +++ OK, passed 100 tests.
  5622. 609.87 s [vector] splitAt: OK
  5623. 609.87 s [vector] +++ OK, passed 100 tests.
  5624. 609.87 s [vector] empty: OK
  5625. 609.87 s [vector] +++ OK, passed 1 test.
  5626. 609.87 s [vector] singleton: OK
  5627. 609.87 s [vector] +++ OK, passed 100 tests.
  5628. 609.87 s [vector] replicate: OK
  5629. 609.87 s [vector] +++ OK, passed 100 tests.
  5630. 609.88 s [vector] generate: OK
  5631. 609.88 s [vector] +++ OK, passed 100 tests.
  5632. 609.88 s [vector] iterateN: OK
  5633. 609.88 s [vector] +++ OK, passed 100 tests.
  5634. 609.97 s [vector] iterateNM: OK (0.08s)
  5635. 609.97 s [vector] +++ OK, passed 100 tests.
  5636. 609.99 s [vector] generateM: OK (0.02s)
  5637. 609.99 s [vector] +++ OK, passed 100 tests.
  5638. 610.02 s [vector] replicateM: OK (0.03s)
  5639. 610.02 s [vector] +++ OK, passed 100 tests.
  5640. 610.02 s [vector] create: OK
  5641. 610.02 s [vector] +++ OK, passed 100 tests.
  5642. 610.02 s [vector] createT: OK
  5643. 610.02 s [vector] +++ OK, passed 100 tests.
  5644. 610.02 s [vector] unfoldr: OK
  5645. 610.02 s [vector] +++ OK, passed 100 tests.
  5646. 610.02 s [vector] unfoldrN: OK
  5647. 610.02 s [vector] +++ OK, passed 100 tests.
  5648. 610.02 s [vector] unfoldrExactN: OK
  5649. 610.02 s [vector] +++ OK, passed 100 tests.
  5650. 610.05 s [vector] unfoldrM: OK
  5651. 610.05 s [vector] +++ OK, passed 100 tests.
  5652. 610.05 s [vector] unfoldrNM: OK
  5653. 610.05 s [vector] +++ OK, passed 100 tests.
  5654. 610.12 s [vector] unfoldrExactNM: OK (0.08s)
  5655. 610.12 s [vector] +++ OK, passed 100 tests.
  5656. 610.12 s [vector] constructN: OK
  5657. 610.12 s [vector] +++ OK, passed 100 tests.
  5658. 610.13 s [vector] constructrN: OK
  5659. 610.13 s [vector] +++ OK, passed 100 tests.
  5660. 610.13 s [vector] cons: OK
  5661. 610.13 s [vector] +++ OK, passed 100 tests.
  5662. 610.13 s [vector] snoc: OK
  5663. 610.14 s [vector] +++ OK, passed 100 tests.
  5664. 610.14 s [vector] append: OK
  5665. 610.14 s [vector] +++ OK, passed 100 tests.
  5666. 610.17 s [vector] concat: OK (0.03s)
  5667. 610.17 s [vector] +++ OK, passed 100 tests.
  5668. 610.17 s [vector] force: OK
  5669. 610.17 s [vector] +++ OK, passed 100 tests.
  5670. 610.18 s [vector] upd: OK
  5671. 610.18 s [vector] +++ OK, passed 100 tests.
  5672. 610.18 s [vector] accum: OK
  5673. 610.18 s [vector] +++ OK, passed 100 tests.
  5674. 610.18 s [vector] reverse: OK
  5675. 610.18 s [vector] +++ OK, passed 100 tests.
  5676. 610.19 s [vector] backpermute: OK
  5677. 610.19 s [vector] +++ OK, passed 100 tests.
  5678. 610.19 s [vector] map: OK
  5679. 610.19 s [vector] +++ OK, passed 100 tests.
  5680. 610.20 s [vector] imap: OK
  5681. 610.20 s [vector] +++ OK, passed 100 tests.
  5682. 610.20 s [vector] concatMap: OK
  5683. 610.21 s [vector] +++ OK, passed 100 tests.
  5684. 610.21 s [vector] mapM: OK
  5685. 610.21 s [vector] +++ OK, passed 100 tests.
  5686. 610.26 s [vector] mapM_: OK (0.04s)
  5687. 610.26 s [vector] +++ OK, passed 100 tests.
  5688. 610.26 s [vector] forM: OK
  5689. 610.26 s [vector] +++ OK, passed 100 tests.
  5690. 610.29 s [vector] forM_: OK (0.03s)
  5691. 610.29 s [vector] +++ OK, passed 100 tests.
  5692. 610.29 s [vector] imapM: OK
  5693. 610.31 s [vector] +++ OK, passed 100 tests.
  5694. 610.33 s [vector] imapM_: OK (0.03s)
  5695. 610.33 s [vector] +++ OK, passed 100 tests.
  5696. 610.33 s [vector] zipWith: OK
  5697. 610.33 s [vector] +++ OK, passed 100 tests.
  5698. 610.34 s [vector] zipWith3: OK
  5699. 610.34 s [vector] +++ OK, passed 100 tests.
  5700. 610.34 s [vector] izipWith: OK
  5701. 610.34 s [vector] +++ OK, passed 100 tests.
  5702. 610.35 s [vector] izipWith3: OK
  5703. 610.35 s [vector] +++ OK, passed 100 tests.
  5704. 610.36 s [vector] izipWithM: OK
  5705. 610.37 s [vector] +++ OK, passed 100 tests.
  5706. 610.39 s [vector] izipWithM_: OK (0.02s)
  5707. 610.39 s [vector] +++ OK, passed 100 tests.
  5708. 610.39 s [vector] zipWithM: OK
  5709. 610.39 s [vector] +++ OK, passed 100 tests.
  5710. 610.41 s [vector] zipWithM_: OK (0.02s)
  5711. 610.41 s [vector] +++ OK, passed 100 tests.
  5712. 610.42 s [vector] filter: OK
  5713. 610.42 s [vector] +++ OK, passed 100 tests.
  5714. 610.43 s [vector] ifilter: OK
  5715. 610.43 s [vector] +++ OK, passed 100 tests.
  5716. 610.47 s [vector] filterM: OK (0.05s)
  5717. 610.47 s [vector] +++ OK, passed 100 tests.
  5718. 610.48 s [vector] uniq: OK
  5719. 610.48 s [vector] +++ OK, passed 100 tests.
  5720. 610.48 s [vector] mapMaybe: OK
  5721. 610.48 s [vector] +++ OK, passed 100 tests.
  5722. 610.49 s [vector] imapMaybe: OK
  5723. 610.49 s [vector] +++ OK, passed 100 tests.
  5724. 610.49 s [vector] takeWhile: OK
  5725. 610.49 s [vector] +++ OK, passed 100 tests.
  5726. 610.49 s [vector] dropWhile: OK
  5727. 610.49 s [vector] +++ OK, passed 100 tests.
  5728. 610.50 s [vector] partition: OK
  5729. 610.50 s [vector] +++ OK, passed 100 tests.
  5730. 610.50 s [vector] partitionWith: OK
  5731. 610.50 s [vector] +++ OK, passed 100 tests.
  5732. 610.50 s [vector] span: OK
  5733. 610.50 s [vector] +++ OK, passed 100 tests.
  5734. 610.51 s [vector] break: OK
  5735. 610.51 s [vector] +++ OK, passed 100 tests.
  5736. 610.51 s [vector] spanR: OK
  5737. 610.51 s [vector] +++ OK, passed 100 tests.
  5738. 610.51 s [vector] breakR: OK
  5739. 610.51 s [vector] +++ OK, passed 100 tests.
  5740. 610.52 s [vector] groupBy: OK
  5741. 610.52 s [vector] +++ OK, passed 100 tests.
  5742. 610.52 s [vector] elem: OK
  5743. 610.52 s [vector] +++ OK, passed 100 tests.
  5744. 610.52 s [vector] notElem: OK
  5745. 610.52 s [vector] +++ OK, passed 100 tests.
  5746. 610.52 s [vector] find: OK
  5747. 610.52 s [vector] +++ OK, passed 100 tests.
  5748. 610.52 s [vector] findIndex: OK
  5749. 610.52 s [vector] +++ OK, passed 100 tests.
  5750. 610.53 s [vector] findIndexR: OK
  5751. 610.53 s [vector] +++ OK, passed 100 tests.
  5752. 610.53 s [vector] findIndices: OK
  5753. 610.53 s [vector] +++ OK, passed 100 tests.
  5754. 610.53 s [vector] elemIndex: OK
  5755. 610.53 s [vector] +++ OK, passed 100 tests.
  5756. 610.53 s [vector] elemIndices: OK
  5757. 610.54 s [vector] +++ OK, passed 100 tests.
  5758. 610.54 s [vector] foldl: OK
  5759. 610.57 s [vector] +++ OK, passed 100 tests.
  5760. 610.57 s [vector] foldl1: OK
  5761. 610.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5762. 610.57 s [vector] foldl': OK (0.02s)
  5763. 610.57 s [vector] +++ OK, passed 100 tests.
  5764. 610.58 s [vector] foldl1': OK
  5765. 610.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5766. 610.58 s [vector] foldr: OK
  5767. 610.58 s [vector] +++ OK, passed 100 tests.
  5768. 610.59 s [vector] foldr1: OK
  5769. 610.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5770. 610.59 s [vector] foldr': OK
  5771. 610.59 s [vector] +++ OK, passed 100 tests.
  5772. 610.60 s [vector] foldr1': OK
  5773. 610.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5774. 610.62 s [vector] ifoldl: OK
  5775. 610.62 s [vector] +++ OK, passed 100 tests.
  5776. 610.62 s [vector] ifoldl': OK
  5777. 610.62 s [vector] +++ OK, passed 100 tests.
  5778. 610.62 s [vector] ifoldr: OK
  5779. 610.67 s [vector] +++ OK, passed 100 tests.
  5780. 610.67 s [vector] ifoldr': OK (0.01s)
  5781. 610.67 s [vector] +++ OK, passed 100 tests.
  5782. 610.67 s [vector] ifoldM: OK
  5783. 610.67 s [vector] +++ OK, passed 100 tests.
  5784. 610.67 s [vector] ifoldM': OK
  5785. 610.67 s [vector] +++ OK, passed 100 tests.
  5786. 610.78 s [vector] ifoldM_: OK (0.12s)
  5787. 610.78 s [vector] +++ OK, passed 100 tests.
  5788. 610.83 s [vector] ifoldM'_: OK (0.06s)
  5789. 610.83 s [vector] +++ OK, passed 100 tests.
  5790. 610.83 s [vector] all: OK
  5791. 610.83 s [vector] +++ OK, passed 100 tests.
  5792. 610.83 s [vector] any: OK
  5793. 610.83 s [vector] +++ OK, passed 100 tests.
  5794. 610.83 s [vector] prescanl: OK
  5795. 610.84 s [vector] +++ OK, passed 100 tests.
  5796. 610.84 s [vector] prescanl': OK
  5797. 610.84 s [vector] +++ OK, passed 100 tests.
  5798. 610.85 s [vector] postscanl: OK
  5799. 610.85 s [vector] +++ OK, passed 100 tests.
  5800. 610.85 s [vector] postscanl': OK
  5801. 610.85 s [vector] +++ OK, passed 100 tests.
  5802. 610.86 s [vector] scanl: OK
  5803. 610.86 s [vector] +++ OK, passed 100 tests.
  5804. 610.86 s [vector] scanl': OK
  5805. 610.86 s [vector] +++ OK, passed 100 tests.
  5806. 610.86 s [vector] scanl1: OK
  5807. 610.87 s [vector] +++ OK, passed 100 tests.
  5808. 610.87 s [vector] scanl1': OK
  5809. 610.88 s [vector] +++ OK, passed 100 tests.
  5810. 610.88 s [vector] iscanl: OK
  5811. 610.88 s [vector] +++ OK, passed 100 tests.
  5812. 610.89 s [vector] iscanl': OK
  5813. 610.89 s [vector] +++ OK, passed 100 tests.
  5814. 610.89 s [vector] prescanr: OK
  5815. 610.90 s [vector] +++ OK, passed 100 tests.
  5816. 610.90 s [vector] prescanr': OK
  5817. 610.90 s [vector] +++ OK, passed 100 tests.
  5818. 610.90 s [vector] postscanr: OK
  5819. 610.91 s [vector] +++ OK, passed 100 tests.
  5820. 610.92 s [vector] postscanr': OK
  5821. 610.92 s [vector] +++ OK, passed 100 tests.
  5822. 610.92 s [vector] scanr: OK
  5823. 610.92 s [vector] +++ OK, passed 100 tests.
  5824. 610.93 s [vector] scanr': OK
  5825. 610.93 s [vector] +++ OK, passed 100 tests.
  5826. 610.93 s [vector] scanr1: OK
  5827. 610.93 s [vector] +++ OK, passed 100 tests.
  5828. 610.94 s [vector] scanr1': OK
  5829. 610.94 s [vector] +++ OK, passed 100 tests.
  5830. 610.94 s [vector] iscanr: OK
  5831. 610.95 s [vector] +++ OK, passed 100 tests.
  5832. 610.95 s [vector] iscanr': OK
  5833. 610.96 s [vector] +++ OK, passed 100 tests.
  5834. 610.96 s [vector] mut_read: OK
  5835. 610.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5836. 610.96 s [vector] mut_write: OK
  5837. 610.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5838. 610.96 s [vector] mut_modify: OK
  5839. 610.96 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5840. 610.97 s [vector] mut_generate: OK
  5841. 610.97 s [vector] +++ OK, passed 100 tests.
  5842. 610.99 s [vector] mut_generateM: OK (0.02s)
  5843. 610.99 s [vector] +++ OK, passed 100 tests.
  5844. 611.03 s [vector] mut_mapM_: OK (0.03s)
  5845. 611.03 s [vector] +++ OK, passed 100 tests.
  5846. 611.05 s [vector] mut_imapM_: OK (0.03s)
  5847. 611.05 s [vector] +++ OK, passed 100 tests.
  5848. 611.10 s [vector] mut_forM_: OK (0.03s)
  5849. 611.10 s [vector] +++ OK, passed 100 tests.
  5850. 611.11 s [vector] mut_iforM_: OK (0.03s)
  5851. 611.11 s [vector] +++ OK, passed 100 tests.
  5852. 611.11 s [vector] mut_foldr: OK
  5853. 611.12 s [vector] +++ OK, passed 100 tests.
  5854. 611.12 s [vector] mut_foldr': OK
  5855. 611.12 s [vector] +++ OK, passed 100 tests.
  5856. 611.13 s [vector] mut_foldl: OK
  5857. 611.13 s [vector] +++ OK, passed 100 tests.
  5858. 611.13 s [vector] mut_foldl': OK
  5859. 611.13 s [vector] +++ OK, passed 100 tests.
  5860. 611.14 s [vector] mut_ifoldr: OK
  5861. 611.14 s [vector] +++ OK, passed 100 tests.
  5862. 611.14 s [vector] mut_ifoldr': OK
  5863. 611.14 s [vector] +++ OK, passed 100 tests.
  5864. 611.15 s [vector] mut_ifoldl: OK
  5865. 611.15 s [vector] +++ OK, passed 100 tests.
  5866. 611.16 s [vector] mut_ifoldl': OK
  5867. 611.16 s [vector] +++ OK, passed 100 tests.
  5868. 611.16 s [vector] mut_foldM: OK
  5869. 611.16 s [vector] +++ OK, passed 100 tests.
  5870. 611.17 s [vector] mut_foldM': OK
  5871. 611.17 s [vector] +++ OK, passed 100 tests.
  5872. 611.18 s [vector] mut_foldrM: OK
  5873. 611.18 s [vector] +++ OK, passed 100 tests.
  5874. 611.19 s [vector] mut_foldrM': OK
  5875. 611.19 s [vector] +++ OK, passed 100 tests.
  5876. 611.20 s [vector] mut_ifoldM: OK
  5877. 611.20 s [vector] +++ OK, passed 100 tests.
  5878. 611.20 s [vector] mut_ifoldM': OK
  5879. 611.20 s [vector] +++ OK, passed 100 tests.
  5880. 611.21 s [vector] mut_ifoldrM: OK
  5881. 611.21 s [vector] +++ OK, passed 100 tests.
  5882. 611.21 s [vector] mut_ifoldrM': OK
  5883. 611.22 s [vector] +++ OK, passed 100 tests.
  5884. 611.22 s [vector] compare: OK
  5885. 611.22 s [vector] +++ OK, passed 100 tests.
  5886. 611.22 s [vector] maximum: OK
  5887. 611.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5888. 611.22 s [vector] minimum: OK
  5889. 611.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5890. 611.39 s [vector] minIndex: OK
  5891. 611.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5892. 611.39 s [vector] maxIndex: OK
  5893. 611.39 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5894. 611.39 s [vector] maximumBy: OK
  5895. 611.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5896. 611.39 s [vector] minimumBy: OK
  5897. 611.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5898. 611.39 s [vector] maximumOn: OK
  5899. 611.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5900. 611.39 s [vector] minimumOn: OK
  5901. 611.39 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5902. 611.39 s [vector] maxIndexBy: OK
  5903. 611.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5904. 611.39 s [vector] minIndexBy: OK
  5905. 611.39 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5906. 611.39 s [vector] ListFirstMaxIndexWins: OK
  5907. 611.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5908. 611.39 s [vector] FalseListFirstMaxIndexWins: OK
  5909. 611.39 s [vector] +++ OK, failed as expected. (after 1 test):
  5910. 611.39 s [vector] Exception:
  5911. 611.39 s [vector] Prelude.foldr1: empty list
  5912. 611.40 s [vector] CallStack (from HasCallStack):
  5913. 611.40 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5914. 611.40 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5915. 611.40 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5916. 611.40 s [vector] []
  5917. 611.40 s [vector] zip: OK
  5918. 611.40 s [vector] +++ OK, passed 100 tests.
  5919. 611.40 s [vector] zip3: OK
  5920. 611.40 s [vector] +++ OK, passed 100 tests.
  5921. 611.40 s [vector] unzip: OK
  5922. 611.40 s [vector] +++ OK, passed 100 tests.
  5923. 611.40 s [vector] unzip3: OK
  5924. 611.40 s [vector] +++ OK, passed 100 tests.
  5925. 611.40 s [vector] indexed: OK
  5926. 611.40 s [vector] +++ OK, passed 100 tests.
  5927. 611.40 s [vector] update: OK
  5928. 611.40 s [vector] +++ OK, passed 100 tests.
  5929. 611.40 s [vector] mempty: OK
  5930. 611.40 s [vector] +++ OK, passed 1 test.
  5931. 611.40 s [vector] mappend: OK
  5932. 611.40 s [vector] +++ OK, passed 100 tests.
  5933. 611.40 s [vector] mconcat: OK (0.01s)
  5934. 611.40 s [vector] +++ OK, passed 100 tests.
  5935. 611.40 s [vector] glength: OK
  5936. 611.40 s [vector] +++ OK, passed 100 tests.
  5937. 611.40 s [vector] sum: OK
  5938. 611.40 s [vector] +++ OK, passed 100 tests.
  5939. 611.40 s [vector] product: OK
  5940. 611.40 s [vector] +++ OK, passed 100 tests.
  5941. 611.40 s [vector] enumFromN: OK
  5942. 611.40 s [vector] +++ OK, passed 100 tests.
  5943. 611.40 s [vector] enumFromThenN: OK
  5944. 611.40 s [vector] +++ OK, passed 100 tests.
  5945. 611.40 s [vector] enumFromTo: OK
  5946. 611.40 s [vector] +++ OK, passed 100 tests.
  5947. 611.40 s [vector] enumFromThenTo: OK
  5948. 611.40 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5949. 611.40 s [vector] (Float)
  5950. 611.40 s [vector] fromList.toList == id: OK
  5951. 611.40 s [vector] +++ OK, passed 100 tests.
  5952. 611.40 s [vector] toList.fromList == id: OK
  5953. 611.40 s [vector] +++ OK, passed 100 tests.
  5954. 611.40 s [vector] unstream.stream == id: OK
  5955. 611.40 s [vector] +++ OK, passed 100 tests.
  5956. 611.40 s [vector] stream.unstream == id: OK
  5957. 611.40 s [vector] +++ OK, passed 100 tests.
  5958. 611.40 s [vector] eq: OK
  5959. 611.40 s [vector] +++ OK, passed 100 tests.
  5960. 611.40 s [vector] length: OK
  5961. 611.40 s [vector] +++ OK, passed 100 tests.
  5962. 611.40 s [vector] null: OK
  5963. 611.40 s [vector] +++ OK, passed 100 tests.
  5964. 611.40 s [vector] index: OK
  5965. 611.40 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5966. 611.40 s [vector] safeIndex: OK
  5967. 611.40 s [vector] +++ OK, passed 100 tests.
  5968. 611.40 s [vector] head: OK
  5969. 611.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5970. 611.40 s [vector] last: OK
  5971. 611.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5972. 611.40 s [vector] unsafeIndex: OK
  5973. 611.40 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5974. 611.40 s [vector] unsafeHead: OK
  5975. 611.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5976. 611.40 s [vector] unsafeLast: OK
  5977. 611.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5978. 611.40 s [vector] slice: OK
  5979. 611.40 s [vector] +++ OK, passed 100 tests.
  5980. 611.40 s [vector] init: OK
  5981. 611.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5982. 611.40 s [vector] tail: OK
  5983. 611.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5984. 611.40 s [vector] take: OK
  5985. 611.40 s [vector] +++ OK, passed 100 tests.
  5986. 611.40 s [vector] drop: OK
  5987. 611.40 s [vector] +++ OK, passed 100 tests.
  5988. 611.40 s [vector] splitAt: OK
  5989. 611.40 s [vector] +++ OK, passed 100 tests.
  5990. 611.40 s [vector] empty: OK
  5991. 611.40 s [vector] +++ OK, passed 1 test.
  5992. 611.40 s [vector] singleton: OK
  5993. 611.40 s [vector] +++ OK, passed 100 tests.
  5994. 611.40 s [vector] replicate: OK
  5995. 611.40 s [vector] +++ OK, passed 100 tests.
  5996. 611.40 s [vector] generate: OK
  5997. 611.40 s [vector] +++ OK, passed 100 tests.
  5998. 611.40 s [vector] iterateN: OK
  5999. 611.40 s [vector] +++ OK, passed 100 tests.
  6000. 611.47 s [vector] iterateNM: OK (0.10s)
  6001. 611.48 s [vector] +++ OK, passed 100 tests.
  6002. 611.58 s [vector] generateM: OK (0.12s)
  6003. 611.60 s [vector] +++ OK, passed 100 tests.
  6004. 611.66 s [vector] replicateM: OK (0.03s)
  6005. 611.66 s [vector] +++ OK, passed 100 tests.
  6006. 611.66 s [vector] create: OK
  6007. 611.66 s [vector] +++ OK, passed 100 tests.
  6008. 611.66 s [vector] createT: OK
  6009. 611.66 s [vector] +++ OK, passed 100 tests.
  6010. 611.66 s [vector] unfoldr: OK
  6011. 611.66 s [vector] +++ OK, passed 100 tests.
  6012. 611.66 s [vector] unfoldrN: OK
  6013. 611.66 s [vector] +++ OK, passed 100 tests.
  6014. 611.66 s [vector] unfoldrExactN: OK
  6015. 611.66 s [vector] +++ OK, passed 100 tests.
  6016. 611.66 s [vector] unfoldrM: OK
  6017. 611.66 s [vector] +++ OK, passed 100 tests.
  6018. 611.66 s [vector] unfoldrNM: OK
  6019. 611.66 s [vector] +++ OK, passed 100 tests.
  6020. 611.73 s [vector] unfoldrExactNM: OK (0.09s)
  6021. 611.73 s [vector] +++ OK, passed 100 tests.
  6022. 611.75 s [vector] constructN: OK (0.02s)
  6023. 611.75 s [vector] +++ OK, passed 100 tests.
  6024. 611.77 s [vector] constructrN: OK (0.02s)
  6025. 611.78 s [vector] +++ OK, passed 100 tests.
  6026. 611.78 s [vector] cons: OK
  6027. 611.78 s [vector] +++ OK, passed 100 tests.
  6028. 611.78 s [vector] snoc: OK
  6029. 611.78 s [vector] +++ OK, passed 100 tests.
  6030. 611.78 s [vector] append: OK
  6031. 611.79 s [vector] +++ OK, passed 100 tests.
  6032. 611.85 s [vector] concat: OK (0.06s)
  6033. 611.85 s [vector] +++ OK, passed 100 tests.
  6034. 611.85 s [vector] force: OK
  6035. 611.85 s [vector] +++ OK, passed 100 tests.
  6036. 611.88 s [vector] upd: OK
  6037. 611.88 s [vector] +++ OK, passed 100 tests.
  6038. 611.88 s [vector] accum: OK (0.02s)
  6039. 611.88 s [vector] +++ OK, passed 100 tests.
  6040. 611.88 s [vector] reverse: OK
  6041. 611.88 s [vector] +++ OK, passed 100 tests.
  6042. 611.89 s [vector] backpermute: OK
  6043. 611.89 s [vector] +++ OK, passed 100 tests.
  6044. 611.89 s [vector] map: OK (0.01s)
  6045. 611.89 s [vector] +++ OK, passed 100 tests.
  6046. 611.91 s [vector] imap: OK (0.01s)
  6047. 611.91 s [vector] +++ OK, passed 100 tests.
  6048. 611.93 s [vector] concatMap: OK (0.01s)
  6049. 611.93 s [vector] +++ OK, passed 100 tests.
  6050. 611.93 s [vector] mapM: OK (0.01s)
  6051. 611.93 s [vector] +++ OK, passed 100 tests.
  6052. 612.01 s [vector] mapM_: OK (0.07s)
  6053. 612.01 s [vector] +++ OK, passed 100 tests.
  6054. 612.03 s [vector] forM: OK (0.01s)
  6055. 612.03 s [vector] +++ OK, passed 100 tests.
  6056. 612.09 s [vector] forM_: OK (0.07s)
  6057. 612.09 s [vector] +++ OK, passed 100 tests.
  6058. 612.11 s [vector] imapM: OK (0.01s)
  6059. 612.11 s [vector] +++ OK, passed 100 tests.
  6060. 612.16 s [vector] imapM_: OK (0.06s)
  6061. 612.17 s [vector] +++ OK, passed 100 tests.
  6062. 612.17 s [vector] zipWith: OK (0.01s)
  6063. 612.17 s [vector] +++ OK, passed 100 tests.
  6064. 612.19 s [vector] zipWith3: OK (0.01s)
  6065. 612.19 s [vector] +++ OK, passed 100 tests.
  6066. 612.19 s [vector] izipWith: OK (0.01s)
  6067. 612.19 s [vector] +++ OK, passed 100 tests.
  6068. 612.21 s [vector] izipWith3: OK (0.01s)
  6069. 612.21 s [vector] +++ OK, passed 100 tests.
  6070. 612.23 s [vector] izipWithM: OK (0.01s)
  6071. 612.23 s [vector] +++ OK, passed 100 tests.
  6072. 612.28 s [vector] izipWithM_: OK (0.06s)
  6073. 612.28 s [vector] +++ OK, passed 100 tests.
  6074. 612.28 s [vector] zipWithM: OK (0.01s)
  6075. 612.28 s [vector] +++ OK, passed 100 tests.
  6076. 612.33 s [vector] zipWithM_: OK (0.03s)
  6077. 612.33 s [vector] +++ OK, passed 100 tests.
  6078. 612.34 s [vector] filter: OK
  6079. 612.34 s [vector] +++ OK, passed 100 tests.
  6080. 612.35 s [vector] ifilter: OK
  6081. 612.35 s [vector] +++ OK, passed 100 tests.
  6082. 612.54 s [vector] filterM: OK (0.19s)
  6083. 612.55 s [vector] +++ OK, passed 100 tests.
  6084. 612.55 s [vector] uniq: OK
  6085. 612.55 s [vector] +++ OK, passed 100 tests.
  6086. 612.57 s [vector] mapMaybe: OK (0.02s)
  6087. 612.57 s [vector] +++ OK, passed 100 tests.
  6088. 612.59 s [vector] imapMaybe: OK (0.02s)
  6089. 612.59 s [vector] +++ OK, passed 100 tests.
  6090. 612.60 s [vector] takeWhile: OK
  6091. 612.60 s [vector] +++ OK, passed 100 tests.
  6092. 612.60 s [vector] dropWhile: OK
  6093. 612.60 s [vector] +++ OK, passed 100 tests.
  6094. 612.61 s [vector] partition: OK
  6095. 612.61 s [vector] +++ OK, passed 100 tests.
  6096. 612.62 s [vector] partitionWith: OK (0.01s)
  6097. 612.62 s [vector] +++ OK, passed 100 tests.
  6098. 612.63 s [vector] span: OK
  6099. 612.63 s [vector] +++ OK, passed 100 tests.
  6100. 612.63 s [vector] break: OK
  6101. 612.63 s [vector] +++ OK, passed 100 tests.
  6102. 612.65 s [vector] spanR: OK
  6103. 612.65 s [vector] +++ OK, passed 100 tests.
  6104. 612.65 s [vector] breakR: OK
  6105. 612.65 s [vector] +++ OK, passed 100 tests.
  6106. 612.65 s [vector] groupBy: OK (0.02s)
  6107. 612.65 s [vector] +++ OK, passed 100 tests.
  6108. 612.65 s [vector] elem: OK
  6109. 612.66 s [vector] +++ OK, passed 100 tests.
  6110. 612.66 s [vector] notElem: OK
  6111. 612.66 s [vector] +++ OK, passed 100 tests.
  6112. 612.66 s [vector] find: OK
  6113. 612.66 s [vector] +++ OK, passed 100 tests.
  6114. 612.67 s [vector] findIndex: OK
  6115. 612.67 s [vector] +++ OK, passed 100 tests.
  6116. 612.67 s [vector] findIndexR: OK
  6117. 612.67 s [vector] +++ OK, passed 100 tests.
  6118. 612.68 s [vector] findIndices: OK
  6119. 612.68 s [vector] +++ OK, passed 100 tests.
  6120. 612.68 s [vector] elemIndex: OK
  6121. 612.68 s [vector] +++ OK, passed 100 tests.
  6122. 612.68 s [vector] elemIndices: OK
  6123. 612.69 s [vector] +++ OK, passed 100 tests.
  6124. 612.71 s [vector] foldl: OK (0.02s)
  6125. 612.72 s [vector] +++ OK, passed 100 tests.
  6126. 612.73 s [vector] foldl1: OK (0.02s)
  6127. 612.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6128. 612.75 s [vector] foldl': OK (0.02s)
  6129. 612.75 s [vector] +++ OK, passed 100 tests.
  6130. 612.77 s [vector] foldl1': OK (0.02s)
  6131. 612.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6132. 612.79 s [vector] foldr: OK (0.02s)
  6133. 612.79 s [vector] +++ OK, passed 100 tests.
  6134. 612.81 s [vector] foldr1: OK (0.02s)
  6135. 612.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6136. 612.83 s [vector] foldr': OK (0.02s)
  6137. 612.83 s [vector] +++ OK, passed 100 tests.
  6138. 612.83 s [vector] foldr1': OK (0.02s)
  6139. 612.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6140. 612.85 s [vector] ifoldl: OK (0.02s)
  6141. 612.85 s [vector] +++ OK, passed 100 tests.
  6142. 612.89 s [vector] ifoldl': OK (0.02s)
  6143. 612.89 s [vector] +++ OK, passed 100 tests.
  6144. 612.89 s [vector] ifoldr: OK (0.02s)
  6145. 612.89 s [vector] +++ OK, passed 100 tests.
  6146. 612.91 s [vector] ifoldr': OK (0.02s)
  6147. 612.91 s [vector] +++ OK, passed 100 tests.
  6148. 612.93 s [vector] ifoldM: OK (0.02s)
  6149. 612.93 s [vector] +++ OK, passed 100 tests.
  6150. 612.95 s [vector] ifoldM': OK (0.02s)
  6151. 612.96 s [vector] +++ OK, passed 100 tests.
  6152. 613.06 s [vector] ifoldM_: OK (0.09s)
  6153. 613.06 s [vector] +++ OK, passed 100 tests.
  6154. 613.13 s [vector] ifoldM'_: OK (0.08s)
  6155. 613.13 s [vector] +++ OK, passed 100 tests.
  6156. 613.13 s [vector] all: OK
  6157. 613.13 s [vector] +++ OK, passed 100 tests.
  6158. 613.13 s [vector] any: OK
  6159. 613.13 s [vector] +++ OK, passed 100 tests.
  6160. 613.16 s [vector] prescanl: OK (0.01s)
  6161. 613.16 s [vector] +++ OK, passed 100 tests.
  6162. 613.16 s [vector] prescanl': OK (0.02s)
  6163. 613.17 s [vector] +++ OK, passed 100 tests.
  6164. 613.19 s [vector] postscanl: OK (0.02s)
  6165. 613.19 s [vector] +++ OK, passed 100 tests.
  6166. 613.19 s [vector] postscanl': OK (0.02s)
  6167. 613.19 s [vector] +++ OK, passed 100 tests.
  6168. 613.23 s [vector] scanl: OK (0.02s)
  6169. 613.23 s [vector] +++ OK, passed 100 tests.
  6170. 613.23 s [vector] scanl': OK (0.02s)
  6171. 613.23 s [vector] +++ OK, passed 100 tests.
  6172. 613.25 s [vector] scanl1: OK (0.02s)
  6173. 613.25 s [vector] +++ OK, passed 100 tests.
  6174. 613.27 s [vector] scanl1': OK (0.02s)
  6175. 613.27 s [vector] +++ OK, passed 100 tests.
  6176. 613.29 s [vector] iscanl: OK (0.02s)
  6177. 613.29 s [vector] +++ OK, passed 100 tests.
  6178. 613.31 s [vector] iscanl': OK (0.02s)
  6179. 613.31 s [vector] +++ OK, passed 100 tests.
  6180. 613.33 s [vector] prescanr: OK (0.02s)
  6181. 613.33 s [vector] +++ OK, passed 100 tests.
  6182. 613.35 s [vector] prescanr': OK (0.02s)
  6183. 613.36 s [vector] +++ OK, passed 100 tests.
  6184. 613.37 s [vector] postscanr: OK (0.02s)
  6185. 613.37 s [vector] +++ OK, passed 100 tests.
  6186. 613.40 s [vector] postscanr': OK (0.02s)
  6187. 613.40 s [vector] +++ OK, passed 100 tests.
  6188. 613.41 s [vector] scanr: OK (0.02s)
  6189. 613.41 s [vector] +++ OK, passed 100 tests.
  6190. 613.43 s [vector] scanr': OK (0.02s)
  6191. 613.43 s [vector] +++ OK, passed 100 tests.
  6192. 613.45 s [vector] scanr1: OK (0.02s)
  6193. 613.45 s [vector] +++ OK, passed 100 tests.
  6194. 613.45 s [vector] scanr1': OK (0.02s)
  6195. 613.45 s [vector] +++ OK, passed 100 tests.
  6196. 613.49 s [vector] iscanr: OK (0.02s)
  6197. 613.49 s [vector] +++ OK, passed 100 tests.
  6198. 613.49 s [vector] iscanr': OK (0.02s)
  6199. 613.49 s [vector] +++ OK, passed 100 tests.
  6200. 613.49 s [vector] mut_read: OK
  6201. 613.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6202. 613.50 s [vector] mut_write: OK
  6203. 613.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6204. 613.50 s [vector] mut_modify: OK
  6205. 613.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6206. 613.51 s [vector] mut_generate: OK
  6207. 613.51 s [vector] +++ OK, passed 100 tests.
  6208. 613.55 s [vector] mut_generateM: OK (0.03s)
  6209. 613.55 s [vector] +++ OK, passed 100 tests.
  6210. 613.61 s [vector] mut_mapM_: OK (0.06s)
  6211. 613.61 s [vector] +++ OK, passed 100 tests.
  6212. 613.65 s [vector] mut_imapM_: OK (0.05s)
  6213. 613.65 s [vector] +++ OK, passed 100 tests.
  6214. 613.71 s [vector] mut_forM_: OK (0.05s)
  6215. 613.71 s [vector] +++ OK, passed 100 tests.
  6216. 613.79 s [vector] mut_iforM_: OK (0.08s)
  6217. 613.80 s [vector] +++ OK, passed 100 tests.
  6218. 613.80 s [vector] mut_foldr: OK (0.02s)
  6219. 613.80 s [vector] +++ OK, passed 100 tests.
  6220. 613.81 s [vector] mut_foldr': OK (0.02s)
  6221. 613.82 s [vector] +++ OK, passed 100 tests.
  6222. 613.83 s [vector] mut_foldl: OK (0.02s)
  6223. 613.83 s [vector] +++ OK, passed 100 tests.
  6224. 613.85 s [vector] mut_foldl': OK (0.02s)
  6225. 613.86 s [vector] +++ OK, passed 100 tests.
  6226. 613.87 s [vector] mut_ifoldr: OK (0.02s)
  6227. 613.87 s [vector] +++ OK, passed 100 tests.
  6228. 613.90 s [vector] mut_ifoldr': OK (0.02s)
  6229. 613.90 s [vector] +++ OK, passed 100 tests.
  6230. 613.90 s [vector] mut_ifoldl: OK (0.02s)
  6231. 613.90 s [vector] +++ OK, passed 100 tests.
  6232. 613.91 s [vector] mut_ifoldl': OK (0.01s)
  6233. 613.92 s [vector] +++ OK, passed 100 tests.
  6234. 613.93 s [vector] mut_foldM: OK (0.02s)
  6235. 613.93 s [vector] +++ OK, passed 100 tests.
  6236. 613.95 s [vector] mut_foldM': OK (0.01s)
  6237. 613.95 s [vector] +++ OK, passed 100 tests.
  6238. 613.97 s [vector] mut_foldrM: OK (0.02s)
  6239. 613.97 s [vector] +++ OK, passed 100 tests.
  6240. 613.99 s [vector] mut_foldrM': OK (0.02s)
  6241. 613.99 s [vector] +++ OK, passed 100 tests.
  6242. 613.99 s [vector] mut_ifoldM: OK (0.02s)
  6243. 613.99 s [vector] +++ OK, passed 100 tests.
  6244. 614.01 s [vector] mut_ifoldM': OK (0.02s)
  6245. 614.01 s [vector] +++ OK, passed 100 tests.
  6246. 614.03 s [vector] mut_ifoldrM: OK (0.02s)
  6247. 614.03 s [vector] +++ OK, passed 100 tests.
  6248. 614.05 s [vector] mut_ifoldrM': OK (0.02s)
  6249. 614.05 s [vector] +++ OK, passed 100 tests.
  6250. 614.05 s [vector] compare: OK
  6251. 614.05 s [vector] +++ OK, passed 100 tests.
  6252. 614.05 s [vector] maximum: OK
  6253. 614.05 s [vector] +++ OK, passed 100 tests; 26 discarded.
  6254. 614.05 s [vector] minimum: OK
  6255. 614.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6256. 614.05 s [vector] minIndex: OK
  6257. 614.05 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6258. 614.06 s [vector] maxIndex: OK
  6259. 614.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6260. 614.06 s [vector] maximumBy: OK
  6261. 614.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6262. 614.06 s [vector] minimumBy: OK
  6263. 614.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6264. 614.06 s [vector] maximumOn: OK
  6265. 614.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6266. 614.07 s [vector] minimumOn: OK
  6267. 614.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6268. 614.07 s [vector] maxIndexBy: OK
  6269. 614.07 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6270. 614.07 s [vector] minIndexBy: OK
  6271. 614.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6272. 614.07 s [vector] ListFirstMaxIndexWins: OK
  6273. 614.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6274. 614.08 s [vector] FalseListFirstMaxIndexWins: OK
  6275. 614.08 s [vector] +++ OK, failed as expected. (after 1 test):
  6276. 614.08 s [vector] Exception:
  6277. 614.08 s [vector] Prelude.foldr1: empty list
  6278. 614.08 s [vector] CallStack (from HasCallStack):
  6279. 614.08 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6280. 614.08 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6281. 614.08 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6282. 614.08 s [vector] []
  6283. 614.08 s [vector] zip: OK
  6284. 614.08 s [vector] +++ OK, passed 100 tests.
  6285. 614.08 s [vector] zip3: OK
  6286. 614.08 s [vector] +++ OK, passed 100 tests.
  6287. 614.09 s [vector] unzip: OK
  6288. 614.09 s [vector] +++ OK, passed 100 tests.
  6289. 614.10 s [vector] unzip3: OK
  6290. 614.10 s [vector] +++ OK, passed 100 tests.
  6291. 614.10 s [vector] indexed: OK
  6292. 614.10 s [vector] +++ OK, passed 100 tests.
  6293. 614.10 s [vector] update: OK
  6294. 614.10 s [vector] +++ OK, passed 100 tests.
  6295. 614.11 s [vector] mempty: OK
  6296. 614.11 s [vector] +++ OK, passed 1 test.
  6297. 614.13 s [vector] mappend: OK
  6298. 614.14 s [vector] +++ OK, passed 100 tests.
  6299. 614.18 s [vector] mconcat: OK (0.07s)
  6300. 614.18 s [vector] +++ OK, passed 100 tests.
  6301. 614.18 s [vector] glength: OK
  6302. 614.18 s [vector] +++ OK, passed 100 tests.
  6303. 614.19 s [vector] sum: OK
  6304. 614.19 s [vector] +++ OK, passed 100 tests.
  6305. 614.19 s [vector] product: OK
  6306. 614.19 s [vector] +++ OK, passed 100 tests.
  6307. 614.19 s [vector] enumFromN: OK
  6308. 614.19 s [vector] +++ OK, passed 100 tests.
  6309. 614.19 s [vector] enumFromThenN: OK
  6310. 614.19 s [vector] +++ OK, passed 100 tests.
  6311. 614.19 s [vector] enumFromTo: OK
  6312. 614.19 s [vector] +++ OK, passed 100 tests.
  6313. 614.19 s [vector] enumFromThenTo: OK
  6314. 614.19 s [vector] +++ OK, passed 100 tests.
  6315. 614.19 s [vector] (Double)
  6316. 614.20 s [vector] fromList.toList == id: OK
  6317. 614.20 s [vector] +++ OK, passed 100 tests.
  6318. 614.20 s [vector] toList.fromList == id: OK
  6319. 614.20 s [vector] +++ OK, passed 100 tests.
  6320. 614.20 s [vector] unstream.stream == id: OK
  6321. 614.20 s [vector] +++ OK, passed 100 tests.
  6322. 614.20 s [vector] stream.unstream == id: OK
  6323. 614.20 s [vector] +++ OK, passed 100 tests.
  6324. 614.20 s [vector] eq: OK
  6325. 614.20 s [vector] +++ OK, passed 100 tests.
  6326. 614.20 s [vector] length: OK
  6327. 614.20 s [vector] +++ OK, passed 100 tests.
  6328. 614.20 s [vector] null: OK
  6329. 614.20 s [vector] +++ OK, passed 100 tests.
  6330. 614.21 s [vector] index: OK
  6331. 614.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6332. 614.21 s [vector] safeIndex: OK
  6333. 614.21 s [vector] +++ OK, passed 100 tests.
  6334. 614.21 s [vector] head: OK
  6335. 614.21 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6336. 614.21 s [vector] last: OK
  6337. 614.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6338. 614.21 s [vector] unsafeIndex: OK
  6339. 614.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6340. 614.21 s [vector] unsafeHead: OK
  6341. 614.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6342. 614.22 s [vector] unsafeLast: OK
  6343. 614.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6344. 614.22 s [vector] slice: OK
  6345. 614.22 s [vector] +++ OK, passed 100 tests.
  6346. 614.22 s [vector] init: OK
  6347. 614.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6348. 614.22 s [vector] tail: OK
  6349. 614.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6350. 614.22 s [vector] take: OK
  6351. 614.22 s [vector] +++ OK, passed 100 tests.
  6352. 614.23 s [vector] drop: OK
  6353. 614.23 s [vector] +++ OK, passed 100 tests.
  6354. 614.23 s [vector] splitAt: OK
  6355. 614.23 s [vector] +++ OK, passed 100 tests.
  6356. 614.23 s [vector] empty: OK
  6357. 614.23 s [vector] +++ OK, passed 1 test.
  6358. 614.23 s [vector] singleton: OK
  6359. 614.23 s [vector] +++ OK, passed 100 tests.
  6360. 614.23 s [vector] replicate: OK
  6361. 614.23 s [vector] +++ OK, passed 100 tests.
  6362. 614.23 s [vector] generate: OK
  6363. 614.23 s [vector] +++ OK, passed 100 tests.
  6364. 614.24 s [vector] iterateN: OK
  6365. 614.25 s [vector] +++ OK, passed 100 tests.
  6366. 614.29 s [vector] iterateNM: OK (0.05s)
  6367. 614.29 s [vector] +++ OK, passed 100 tests.
  6368. 614.38 s [vector] generateM: OK (0.06s)
  6369. 614.38 s [vector] +++ OK, passed 100 tests.
  6370. 614.40 s [vector] replicateM: OK (0.04s)
  6371. 614.40 s [vector] +++ OK, passed 100 tests.
  6372. 614.40 s [vector] create: OK
  6373. 614.40 s [vector] +++ OK, passed 100 tests.
  6374. 614.40 s [vector] createT: OK
  6375. 614.40 s [vector] +++ OK, passed 100 tests.
  6376. 614.40 s [vector] unfoldr: OK
  6377. 614.40 s [vector] +++ OK, passed 100 tests.
  6378. 614.41 s [vector] unfoldrN: OK
  6379. 614.41 s [vector] +++ OK, passed 100 tests.
  6380. 614.41 s [vector] unfoldrExactN: OK
  6381. 614.41 s [vector] +++ OK, passed 100 tests.
  6382. 614.41 s [vector] unfoldrM: OK
  6383. 614.41 s [vector] +++ OK, passed 100 tests.
  6384. 614.43 s [vector] unfoldrNM: OK
  6385. 614.43 s [vector] +++ OK, passed 100 tests.
  6386. 614.49 s [vector] unfoldrExactNM: OK (0.06s)
  6387. 614.49 s [vector] +++ OK, passed 100 tests.
  6388. 614.53 s [vector] constructN: OK (0.06s)
  6389. 614.53 s [vector] +++ OK, passed 100 tests.
  6390. 614.62 s [vector] constructrN: OK (0.08s)
  6391. 614.62 s [vector] +++ OK, passed 100 tests.
  6392. 614.62 s [vector] cons: OK
  6393. 614.62 s [vector] +++ OK, passed 100 tests.
  6394. 614.62 s [vector] snoc: OK
  6395. 614.63 s [vector] +++ OK, passed 100 tests.
  6396. 614.65 s [vector] append: OK (0.01s)
  6397. 614.65 s [vector] +++ OK, passed 100 tests.
  6398. 614.79 s [vector] concat: OK (0.16s)
  6399. 614.79 s [vector] +++ OK, passed 100 tests.
  6400. 614.80 s [vector] force: OK
  6401. 614.80 s [vector] +++ OK, passed 100 tests.
  6402. 614.82 s [vector] upd: OK
  6403. 614.82 s [vector] +++ OK, passed 100 tests.
  6404. 614.83 s [vector] accum: OK (0.03s)
  6405. 614.83 s [vector] +++ OK, passed 100 tests.
  6406. 614.83 s [vector] reverse: OK
  6407. 614.84 s [vector] +++ OK, passed 100 tests.
  6408. 614.86 s [vector] backpermute: OK (0.01s)
  6409. 614.86 s [vector] +++ OK, passed 100 tests.
  6410. 614.89 s [vector] map: OK (0.03s)
  6411. 614.89 s [vector] +++ OK, passed 100 tests.
  6412. 614.89 s [vector] imap: OK (0.02s)
  6413. 614.89 s [vector] +++ OK, passed 100 tests.
  6414. 614.93 s [vector] concatMap: OK (0.02s)
  6415. 614.93 s [vector] +++ OK, passed 100 tests.
  6416. 614.93 s [vector] mapM: OK (0.02s)
  6417. 614.93 s [vector] +++ OK, passed 100 tests.
  6418. 615.03 s [vector] mapM_: OK (0.09s)
  6419. 615.03 s [vector] +++ OK, passed 100 tests.
  6420. 615.03 s [vector] forM: OK (0.01s)
  6421. 615.03 s [vector] +++ OK, passed 100 tests.
  6422. 615.19 s [vector] forM_: OK (0.16s)
  6423. 615.19 s [vector] +++ OK, passed 100 tests.
  6424. 615.21 s [vector] imapM: OK (0.02s)
  6425. 615.21 s [vector] +++ OK, passed 100 tests.
  6426. 615.31 s [vector] imapM_: OK (0.09s)
  6427. 615.31 s [vector] +++ OK, passed 100 tests.
  6428. 615.34 s [vector] zipWith: OK (0.03s)
  6429. 615.34 s [vector] +++ OK, passed 100 tests.
  6430. 615.35 s [vector] zipWith3: OK (0.02s)
  6431. 615.35 s [vector] +++ OK, passed 100 tests.
  6432. 615.37 s [vector] izipWith: OK (0.02s)
  6433. 615.37 s [vector] +++ OK, passed 100 tests.
  6434. 615.41 s [vector] izipWith3: OK (0.03s)
  6435. 615.41 s [vector] +++ OK, passed 100 tests.
  6436. 615.43 s [vector] izipWithM: OK (0.03s)
  6437. 615.43 s [vector] +++ OK, passed 100 tests.
  6438. 615.53 s [vector] izipWithM_: OK (0.09s)
  6439. 615.53 s [vector] +++ OK, passed 100 tests.
  6440. 615.55 s [vector] zipWithM: OK (0.02s)
  6441. 615.55 s [vector] +++ OK, passed 100 tests.
  6442. 615.61 s [vector] zipWithM_: OK (0.06s)
  6443. 615.61 s [vector] +++ OK, passed 100 tests.
  6444. 615.61 s [vector] filter: OK (0.01s)
  6445. 615.61 s [vector] +++ OK, passed 100 tests.
  6446. 615.63 s [vector] ifilter: OK (0.02s)
  6447. 615.63 s [vector] +++ OK, passed 100 tests.
  6448. 615.74 s [vector] filterM: OK (0.11s)
  6449. 615.74 s [vector] +++ OK, passed 100 tests.
  6450. 615.74 s [vector] uniq: OK
  6451. 615.74 s [vector] +++ OK, passed 100 tests.
  6452. 615.75 s [vector] mapMaybe: OK (0.01s)
  6453. 615.75 s [vector] +++ OK, passed 100 tests.
  6454. 615.77 s [vector] imapMaybe: OK (0.02s)
  6455. 615.77 s [vector] +++ OK, passed 100 tests.
  6456. 615.77 s [vector] takeWhile: OK
  6457. 615.77 s [vector] +++ OK, passed 100 tests.
  6458. 615.77 s [vector] dropWhile: OK
  6459. 615.77 s [vector] +++ OK, passed 100 tests.
  6460. 615.79 s [vector] partition: OK (0.01s)
  6461. 615.79 s [vector] +++ OK, passed 100 tests.
  6462. 615.80 s [vector] partitionWith: OK (0.02s)
  6463. 615.80 s [vector] +++ OK, passed 100 tests.
  6464. 615.80 s [vector] span: OK
  6465. 615.80 s [vector] +++ OK, passed 100 tests.
  6466. 615.80 s [vector] break: OK
  6467. 615.81 s [vector] +++ OK, passed 100 tests.
  6468. 615.81 s [vector] spanR: OK
  6469. 615.81 s [vector] +++ OK, passed 100 tests.
  6470. 615.83 s [vector] breakR: OK
  6471. 615.83 s [vector] +++ OK, passed 100 tests.
  6472. 615.83 s [vector] groupBy: OK (0.02s)
  6473. 615.84 s [vector] +++ OK, passed 100 tests.
  6474. 615.84 s [vector] elem: OK
  6475. 615.84 s [vector] +++ OK, passed 100 tests.
  6476. 615.84 s [vector] notElem: OK
  6477. 615.84 s [vector] +++ OK, passed 100 tests.
  6478. 615.84 s [vector] find: OK
  6479. 615.84 s [vector] +++ OK, passed 100 tests.
  6480. 615.84 s [vector] findIndex: OK
  6481. 615.84 s [vector] +++ OK, passed 100 tests.
  6482. 615.84 s [vector] findIndexR: OK
  6483. 615.85 s [vector] +++ OK, passed 100 tests.
  6484. 615.86 s [vector] findIndices: OK (0.01s)
  6485. 615.86 s [vector] +++ OK, passed 100 tests.
  6486. 615.86 s [vector] elemIndex: OK
  6487. 615.86 s [vector] +++ OK, passed 100 tests.
  6488. 615.86 s [vector] elemIndices: OK
  6489. 615.87 s [vector] +++ OK, passed 100 tests.
  6490. 615.89 s [vector] foldl: OK (0.02s)
  6491. 615.89 s [vector] +++ OK, passed 100 tests.
  6492. 615.93 s [vector] foldl1: OK (0.03s)
  6493. 615.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6494. 615.95 s [vector] foldl': OK (0.02s)
  6495. 615.95 s [vector] +++ OK, passed 100 tests.
  6496. 615.97 s [vector] foldl1': OK (0.02s)
  6497. 615.97 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6498. 615.99 s [vector] foldr: OK (0.02s)
  6499. 615.99 s [vector] +++ OK, passed 100 tests.
  6500. 616.03 s [vector] foldr1: OK (0.03s)
  6501. 616.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6502. 616.07 s [vector] foldr': OK (0.04s)
  6503. 616.07 s [vector] +++ OK, passed 100 tests.
  6504. 616.09 s [vector] foldr1': OK (0.03s)
  6505. 616.09 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6506. 616.14 s [vector] ifoldl: OK (0.03s)
  6507. 616.14 s [vector] +++ OK, passed 100 tests.
  6508. 616.15 s [vector] ifoldl': OK (0.02s)
  6509. 616.16 s [vector] +++ OK, passed 100 tests.
  6510. 616.17 s [vector] ifoldr: OK (0.03s)
  6511. 616.17 s [vector] +++ OK, passed 100 tests.
  6512. 616.22 s [vector] ifoldr': OK (0.02s)
  6513. 616.22 s [vector] +++ OK, passed 100 tests.
  6514. 616.24 s [vector] ifoldM: OK (0.03s)
  6515. 616.34 s [vector] +++ OK, passed 100 tests.
  6516. 616.34 s [vector] ifoldM': OK (0.03s)
  6517. 616.34 s [vector] +++ OK, passed 100 tests.
  6518. 616.35 s [vector] ifoldM_: OK (0.10s)
  6519. 616.35 s [vector] +++ OK, passed 100 tests.
  6520. 616.40 s [vector] ifoldM'_: OK (0.06s)
  6521. 616.41 s [vector] +++ OK, passed 100 tests.
  6522. 616.41 s [vector] all: OK
  6523. 616.41 s [vector] +++ OK, passed 100 tests.
  6524. 616.43 s [vector] any: OK
  6525. 616.43 s [vector] +++ OK, passed 100 tests.
  6526. 616.45 s [vector] prescanl: OK (0.02s)
  6527. 616.45 s [vector] +++ OK, passed 100 tests.
  6528. 616.47 s [vector] prescanl': OK (0.02s)
  6529. 616.47 s [vector] +++ OK, passed 100 tests.
  6530. 616.49 s [vector] postscanl: OK (0.03s)
  6531. 616.49 s [vector] +++ OK, passed 100 tests.
  6532. 616.51 s [vector] postscanl': OK (0.03s)
  6533. 616.51 s [vector] +++ OK, passed 100 tests.
  6534. 616.55 s [vector] scanl: OK (0.03s)
  6535. 616.55 s [vector] +++ OK, passed 100 tests.
  6536. 616.57 s [vector] scanl': OK (0.02s)
  6537. 616.57 s [vector] +++ OK, passed 100 tests.
  6538. 616.58 s [vector] scanl1: OK (0.03s)
  6539. 616.58 s [vector] +++ OK, passed 100 tests.
  6540. 616.61 s [vector] scanl1': OK (0.03s)
  6541. 616.61 s [vector] +++ OK, passed 100 tests.
  6542. 616.65 s [vector] iscanl: OK (0.03s)
  6543. 616.65 s [vector] +++ OK, passed 100 tests.
  6544. 616.67 s [vector] iscanl': OK (0.03s)
  6545. 616.67 s [vector] +++ OK, passed 100 tests.
  6546. 616.69 s [vector] prescanr: OK (0.02s)
  6547. 616.69 s [vector] +++ OK, passed 100 tests.
  6548. 616.72 s [vector] prescanr': OK (0.03s)
  6549. 616.72 s [vector] +++ OK, passed 100 tests.
  6550. 616.75 s [vector] postscanr: OK (0.03s)
  6551. 616.75 s [vector] +++ OK, passed 100 tests.
  6552. 616.79 s [vector] postscanr': OK (0.04s)
  6553. 616.79 s [vector] +++ OK, passed 100 tests.
  6554. 616.83 s [vector] scanr: OK (0.04s)
  6555. 616.83 s [vector] +++ OK, passed 100 tests.
  6556. 616.87 s [vector] scanr': OK (0.03s)
  6557. 616.87 s [vector] +++ OK, passed 100 tests.
  6558. 616.89 s [vector] scanr1: OK (0.02s)
  6559. 616.89 s [vector] +++ OK, passed 100 tests.
  6560. 616.91 s [vector] scanr1': OK (0.02s)
  6561. 616.91 s [vector] +++ OK, passed 100 tests.
  6562. 616.93 s [vector] iscanr: OK (0.02s)
  6563. 616.93 s [vector] +++ OK, passed 100 tests.
  6564. 616.94 s [vector] iscanr': OK (0.03s)
  6565. 616.95 s [vector] +++ OK, passed 100 tests.
  6566. 616.95 s [vector] mut_read: OK
  6567. 616.95 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6568. 616.95 s [vector] mut_write: OK
  6569. 616.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6570. 616.96 s [vector] mut_modify: OK
  6571. 616.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6572. 616.96 s [vector] mut_generate: OK
  6573. 616.96 s [vector] +++ OK, passed 100 tests.
  6574. 616.99 s [vector] mut_generateM: OK (0.03s)
  6575. 616.99 s [vector] +++ OK, passed 100 tests.
  6576. 617.05 s [vector] mut_mapM_: OK (0.05s)
  6577. 617.05 s [vector] +++ OK, passed 100 tests.
  6578. 617.11 s [vector] mut_imapM_: OK (0.06s)
  6579. 617.11 s [vector] +++ OK, passed 100 tests.
  6580. 617.17 s [vector] mut_forM_: OK (0.06s)
  6581. 617.17 s [vector] +++ OK, passed 100 tests.
  6582. 617.24 s [vector] mut_iforM_: OK (0.07s)
  6583. 617.25 s [vector] +++ OK, passed 100 tests.
  6584. 617.25 s [vector] mut_foldr: OK (0.01s)
  6585. 617.25 s [vector] +++ OK, passed 100 tests.
  6586. 617.27 s [vector] mut_foldr': OK (0.02s)
  6587. 617.27 s [vector] +++ OK, passed 100 tests.
  6588. 617.32 s [vector] mut_foldl: OK (0.03s)
  6589. 617.32 s [vector] +++ OK, passed 100 tests.
  6590. 617.33 s [vector] mut_foldl': OK (0.02s)
  6591. 617.33 s [vector] +++ OK, passed 100 tests.
  6592. 617.37 s [vector] mut_ifoldr: OK (0.03s)
  6593. 617.37 s [vector] +++ OK, passed 100 tests.
  6594. 617.37 s [vector] mut_ifoldr': OK (0.03s)
  6595. 617.37 s [vector] +++ OK, passed 100 tests.
  6596. 617.41 s [vector] mut_ifoldl: OK (0.03s)
  6597. 617.41 s [vector] +++ OK, passed 100 tests.
  6598. 617.44 s [vector] mut_ifoldl': OK (0.03s)
  6599. 617.44 s [vector] +++ OK, passed 100 tests.
  6600. 617.47 s [vector] mut_foldM: OK (0.03s)
  6601. 617.47 s [vector] +++ OK, passed 100 tests.
  6602. 617.51 s [vector] mut_foldM': OK (0.04s)
  6603. 617.52 s [vector] +++ OK, passed 100 tests.
  6604. 617.63 s [vector] mut_foldrM: OK (0.05s)
  6605. 617.63 s [vector] +++ OK, passed 100 tests.
  6606. 617.63 s [vector] mut_foldrM': OK (0.05s)
  6607. 617.63 s [vector] +++ OK, passed 100 tests.
  6608. 617.65 s [vector] mut_ifoldM: OK (0.05s)
  6609. 617.65 s [vector] +++ OK, passed 100 tests.
  6610. 617.69 s [vector] mut_ifoldM': OK (0.02s)
  6611. 617.69 s [vector] +++ OK, passed 100 tests.
  6612. 617.72 s [vector] mut_ifoldrM: OK (0.04s)
  6613. 617.72 s [vector] +++ OK, passed 100 tests.
  6614. 617.76 s [vector] mut_ifoldrM': OK (0.04s)
  6615. 617.76 s [vector] +++ OK, passed 100 tests.
  6616. 617.76 s [vector] compare: OK
  6617. 617.76 s [vector] +++ OK, passed 100 tests.
  6618. 617.76 s [vector] maximum: OK
  6619. 617.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6620. 617.77 s [vector] minimum: OK
  6621. 617.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6622. 617.77 s [vector] minIndex: OK
  6623. 617.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6624. 617.77 s [vector] maxIndex: OK
  6625. 617.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6626. 617.78 s [vector] maximumBy: OK
  6627. 617.78 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6628. 617.78 s [vector] minimumBy: OK
  6629. 617.78 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6630. 617.78 s [vector] maximumOn: OK
  6631. 617.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6632. 617.78 s [vector] minimumOn: OK
  6633. 617.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6634. 617.80 s [vector] maxIndexBy: OK
  6635. 617.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6636. 617.80 s [vector] minIndexBy: OK
  6637. 617.80 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6638. 617.81 s [vector] ListFirstMaxIndexWins: OK
  6639. 617.81 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6640. 617.81 s [vector] FalseListFirstMaxIndexWins: OK
  6641. 617.81 s [vector] +++ OK, failed as expected. (after 1 test):
  6642. 617.81 s [vector] Exception:
  6643. 617.81 s [vector] Prelude.foldr1: empty list
  6644. 617.81 s [vector] CallStack (from HasCallStack):
  6645. 617.81 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6646. 617.81 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6647. 617.81 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6648. 617.81 s [vector] []
  6649. 617.81 s [vector] zip: OK
  6650. 617.81 s [vector] +++ OK, passed 100 tests.
  6651. 617.82 s [vector] zip3: OK
  6652. 617.82 s [vector] +++ OK, passed 100 tests.
  6653. 617.82 s [vector] unzip: OK
  6654. 617.82 s [vector] +++ OK, passed 100 tests.
  6655. 617.83 s [vector] unzip3: OK
  6656. 617.83 s [vector] +++ OK, passed 100 tests.
  6657. 617.83 s [vector] indexed: OK
  6658. 617.83 s [vector] +++ OK, passed 100 tests.
  6659. 617.84 s [vector] update: OK
  6660. 617.84 s [vector] +++ OK, passed 100 tests.
  6661. 617.84 s [vector] mempty: OK
  6662. 617.84 s [vector] +++ OK, passed 1 test.
  6663. 617.84 s [vector] mappend: OK
  6664. 617.84 s [vector] +++ OK, passed 100 tests.
  6665. 617.90 s [vector] mconcat: OK (0.05s)
  6666. 617.90 s [vector] +++ OK, passed 100 tests.
  6667. 617.90 s [vector] glength: OK
  6668. 617.90 s [vector] +++ OK, passed 100 tests.
  6669. 617.90 s [vector] sum: OK
  6670. 617.90 s [vector] +++ OK, passed 100 tests.
  6671. 617.90 s [vector] product: OK
  6672. 617.90 s [vector] +++ OK, passed 100 tests.
  6673. 617.90 s [vector] enumFromN: OK
  6674. 617.90 s [vector] +++ OK, passed 100 tests.
  6675. 617.90 s [vector] enumFromThenN: OK
  6676. 617.91 s [vector] +++ OK, passed 100 tests.
  6677. 617.91 s [vector] enumFromTo: OK
  6678. 617.91 s [vector] +++ OK, passed 100 tests.
  6679. 617.91 s [vector] enumFromThenTo: OK
  6680. 617.91 s [vector] +++ OK, passed 100 tests.
  6681. 617.91 s [vector] (Int,Bool)
  6682. 617.91 s [vector] fromList.toList == id: OK
  6683. 617.91 s [vector] +++ OK, passed 100 tests.
  6684. 617.91 s [vector] toList.fromList == id: OK
  6685. 617.91 s [vector] +++ OK, passed 100 tests.
  6686. 617.91 s [vector] unstream.stream == id: OK
  6687. 617.91 s [vector] +++ OK, passed 100 tests.
  6688. 617.92 s [vector] stream.unstream == id: OK
  6689. 617.92 s [vector] +++ OK, passed 100 tests.
  6690. 617.92 s [vector] eq: OK
  6691. 617.92 s [vector] +++ OK, passed 100 tests.
  6692. 617.92 s [vector] length: OK
  6693. 617.92 s [vector] +++ OK, passed 100 tests.
  6694. 617.92 s [vector] null: OK
  6695. 617.92 s [vector] +++ OK, passed 100 tests.
  6696. 617.92 s [vector] index: OK
  6697. 617.92 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6698. 617.92 s [vector] safeIndex: OK
  6699. 617.92 s [vector] +++ OK, passed 100 tests.
  6700. 617.93 s [vector] head: OK
  6701. 617.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6702. 617.93 s [vector] last: OK
  6703. 617.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6704. 617.93 s [vector] unsafeIndex: OK
  6705. 617.93 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6706. 617.93 s [vector] unsafeHead: OK
  6707. 617.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6708. 617.93 s [vector] unsafeLast: OK
  6709. 617.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6710. 617.93 s [vector] slice: OK
  6711. 617.93 s [vector] +++ OK, passed 100 tests.
  6712. 617.94 s [vector] init: OK
  6713. 617.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6714. 617.94 s [vector] tail: OK
  6715. 617.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6716. 617.95 s [vector] take: OK
  6717. 617.95 s [vector] +++ OK, passed 100 tests.
  6718. 617.95 s [vector] drop: OK
  6719. 617.95 s [vector] +++ OK, passed 100 tests.
  6720. 617.95 s [vector] splitAt: OK
  6721. 617.95 s [vector] +++ OK, passed 100 tests.
  6722. 617.95 s [vector] empty: OK
  6723. 617.96 s [vector] +++ OK, passed 1 test.
  6724. 617.98 s [vector] singleton: OK
  6725. 617.98 s [vector] +++ OK, passed 100 tests.
  6726. 618.00 s [vector] replicate: OK (0.04s)
  6727. 618.00 s [vector] +++ OK, passed 100 tests.
  6728. 618.00 s [vector] generate: OK
  6729. 618.00 s [vector] +++ OK, passed 100 tests.
  6730. 618.01 s [vector] iterateN: OK
  6731. 618.01 s [vector] +++ OK, passed 100 tests.
  6732. 618.13 s [vector] iterateNM: OK (0.11s)
  6733. 618.13 s [vector] +++ OK, passed 100 tests.
  6734. 618.19 s [vector] generateM: OK (0.07s)
  6735. 618.19 s [vector] +++ OK, passed 100 tests.
  6736. 618.20 s [vector] replicateM: OK (0.02s)
  6737. 618.20 s [vector] +++ OK, passed 100 tests.
  6738. 618.20 s [vector] create: OK
  6739. 618.20 s [vector] +++ OK, passed 100 tests.
  6740. 618.21 s [vector] createT: OK
  6741. 618.21 s [vector] +++ OK, passed 100 tests.
  6742. 618.21 s [vector] unfoldr: OK
  6743. 618.21 s [vector] +++ OK, passed 100 tests.
  6744. 618.21 s [vector] unfoldrN: OK
  6745. 618.21 s [vector] +++ OK, passed 100 tests.
  6746. 618.21 s [vector] unfoldrExactN: OK
  6747. 618.21 s [vector] +++ OK, passed 100 tests.
  6748. 618.22 s [vector] unfoldrM: OK
  6749. 618.23 s [vector] +++ OK, passed 100 tests.
  6750. 618.23 s [vector] unfoldrNM: OK
  6751. 618.23 s [vector] +++ OK, passed 100 tests.
  6752. 618.35 s [vector] unfoldrExactNM: OK (0.11s)
  6753. 618.36 s [vector] +++ OK, passed 100 tests.
  6754. 618.36 s [vector] constructN: OK (0.01s)
  6755. 618.36 s [vector] +++ OK, passed 100 tests.
  6756. 618.37 s [vector] constructrN: OK (0.02s)
  6757. 618.37 s [vector] +++ OK, passed 100 tests.
  6758. 618.37 s [vector] cons: OK
  6759. 618.37 s [vector] +++ OK, passed 100 tests.
  6760. 618.37 s [vector] snoc: OK
  6761. 618.37 s [vector] +++ OK, passed 100 tests.
  6762. 618.39 s [vector] append: OK
  6763. 618.39 s [vector] +++ OK, passed 100 tests.
  6764. 618.46 s [vector] concat: OK (0.08s)
  6765. 618.47 s [vector] +++ OK, passed 100 tests.
  6766. 618.47 s [vector] force: OK
  6767. 618.47 s [vector] +++ OK, passed 100 tests.
  6768. 618.47 s [vector] upd: OK
  6769. 618.47 s [vector] +++ OK, passed 100 tests.
  6770. 618.49 s [vector] accum: OK (0.02s)
  6771. 618.49 s [vector] +++ OK, passed 100 tests.
  6772. 618.49 s [vector] reverse: OK
  6773. 618.49 s [vector] +++ OK, passed 100 tests.
  6774. 618.49 s [vector] backpermute: OK
  6775. 618.49 s [vector] +++ OK, passed 100 tests.
  6776. 618.51 s [vector] map: OK
  6777. 618.51 s [vector] +++ OK, passed 100 tests.
  6778. 618.51 s [vector] imap: OK
  6779. 618.51 s [vector] +++ OK, passed 100 tests.
  6780. 618.53 s [vector] concatMap: OK (0.01s)
  6781. 618.53 s [vector] +++ OK, passed 100 tests.
  6782. 618.53 s [vector] mapM: OK (0.01s)
  6783. 618.53 s [vector] +++ OK, passed 100 tests.
  6784. 618.61 s [vector] mapM_: OK (0.05s)
  6785. 618.61 s [vector] +++ OK, passed 100 tests.
  6786. 618.63 s [vector] forM: OK (0.01s)
  6787. 618.63 s [vector] +++ OK, passed 100 tests.
  6788. 618.87 s [vector] forM_: OK (0.25s)
  6789. 618.87 s [vector] +++ OK, passed 100 tests.
  6790. 618.89 s [vector] imapM: OK (0.02s)
  6791. 618.89 s [vector] +++ OK, passed 100 tests.
  6792. 619.11 s [vector] imapM_: OK (0.21s)
  6793. 619.11 s [vector] +++ OK, passed 100 tests.
  6794. 619.13 s [vector] zipWith: OK (0.02s)
  6795. 619.13 s [vector] +++ OK, passed 100 tests.
  6796. 619.13 s [vector] zipWith3: OK (0.02s)
  6797. 619.13 s [vector] +++ OK, passed 100 tests.
  6798. 619.17 s [vector] izipWith: OK (0.02s)
  6799. 619.17 s [vector] +++ OK, passed 100 tests.
  6800. 619.21 s [vector] izipWith3: OK (0.02s)
  6801. 619.21 s [vector] +++ OK, passed 100 tests.
  6802. 619.21 s [vector] izipWithM: OK (0.02s)
  6803. 619.21 s [vector] +++ OK, passed 100 tests.
  6804. 619.27 s [vector] izipWithM_: OK (0.07s)
  6805. 619.27 s [vector] +++ OK, passed 100 tests.
  6806. 619.32 s [vector] zipWithM: OK (0.02s)
  6807. 619.32 s [vector] +++ OK, passed 100 tests.
  6808. 619.37 s [vector] zipWithM_: OK (0.06s)
  6809. 619.37 s [vector] +++ OK, passed 100 tests.
  6810. 619.37 s [vector] filter: OK (0.02s)
  6811. 619.37 s [vector] +++ OK, passed 100 tests.
  6812. 619.41 s [vector] ifilter: OK (0.03s)
  6813. 619.41 s [vector] +++ OK, passed 100 tests.
  6814. 619.59 s [vector] filterM: OK (0.18s)
  6815. 619.59 s [vector] +++ OK, passed 100 tests.
  6816. 619.59 s [vector] uniq: OK (0.01s)
  6817. 619.59 s [vector] +++ OK, passed 100 tests.
  6818. 619.61 s [vector] mapMaybe: OK (0.02s)
  6819. 619.61 s [vector] +++ OK, passed 100 tests.
  6820. 619.64 s [vector] imapMaybe: OK (0.02s)
  6821. 619.64 s [vector] +++ OK, passed 100 tests.
  6822. 619.64 s [vector] takeWhile: OK
  6823. 619.64 s [vector] +++ OK, passed 100 tests.
  6824. 619.65 s [vector] dropWhile: OK (0.01s)
  6825. 619.65 s [vector] +++ OK, passed 100 tests.
  6826. 619.67 s [vector] partition: OK (0.02s)
  6827. 619.67 s [vector] +++ OK, passed 100 tests.
  6828. 619.69 s [vector] partitionWith: OK (0.02s)
  6829. 619.69 s [vector] +++ OK, passed 100 tests.
  6830. 619.72 s [vector] span: OK (0.01s)
  6831. 619.72 s [vector] +++ OK, passed 100 tests.
  6832. 619.72 s [vector] break: OK (0.01s)
  6833. 619.72 s [vector] +++ OK, passed 100 tests.
  6834. 619.73 s [vector] spanR: OK
  6835. 619.73 s [vector] +++ OK, passed 100 tests.
  6836. 619.73 s [vector] breakR: OK
  6837. 619.73 s [vector] +++ OK, passed 100 tests.
  6838. 619.76 s [vector] groupBy: OK (0.02s)
  6839. 619.76 s [vector] +++ OK, passed 100 tests.
  6840. 619.76 s [vector] elem: OK
  6841. 619.76 s [vector] +++ OK, passed 100 tests.
  6842. 619.77 s [vector] notElem: OK
  6843. 619.78 s [vector] +++ OK, passed 100 tests.
  6844. 619.78 s [vector] find: OK (0.01s)
  6845. 619.79 s [vector] +++ OK, passed 100 tests.
  6846. 619.79 s [vector] findIndex: OK
  6847. 619.79 s [vector] +++ OK, passed 100 tests.
  6848. 619.79 s [vector] findIndexR: OK
  6849. 619.79 s [vector] +++ OK, passed 100 tests.
  6850. 619.79 s [vector] findIndices: OK
  6851. 619.79 s [vector] +++ OK, passed 100 tests.
  6852. 619.79 s [vector] elemIndex: OK
  6853. 619.79 s [vector] +++ OK, passed 100 tests.
  6854. 619.79 s [vector] elemIndices: OK
  6855. 619.80 s [vector] +++ OK, passed 100 tests.
  6856. 619.81 s [vector] foldl: OK
  6857. 619.81 s [vector] +++ OK, passed 100 tests.
  6858. 619.81 s [vector] foldl1: OK
  6859. 619.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6860. 619.82 s [vector] foldl': OK
  6861. 619.82 s [vector] +++ OK, passed 100 tests.
  6862. 619.83 s [vector] foldl1': OK
  6863. 619.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6864. 619.84 s [vector] foldr: OK
  6865. 619.84 s [vector] +++ OK, passed 100 tests.
  6866. 619.85 s [vector] foldr1: OK
  6867. 619.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6868. 619.85 s [vector] foldr': OK
  6869. 619.86 s [vector] +++ OK, passed 100 tests.
  6870. 619.86 s [vector] foldr1': OK
  6871. 619.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6872. 619.87 s [vector] ifoldl: OK
  6873. 619.87 s [vector] +++ OK, passed 100 tests.
  6874. 619.89 s [vector] ifoldl': OK (0.01s)
  6875. 619.89 s [vector] +++ OK, passed 100 tests.
  6876. 619.90 s [vector] ifoldr: OK (0.01s)
  6877. 619.90 s [vector] +++ OK, passed 100 tests.
  6878. 619.90 s [vector] ifoldr': OK
  6879. 619.90 s [vector] +++ OK, passed 100 tests.
  6880. 619.92 s [vector] ifoldM: OK (0.01s)
  6881. 619.92 s [vector] +++ OK, passed 100 tests.
  6882. 619.93 s [vector] ifoldM': OK (0.01s)
  6883. 619.93 s [vector] +++ OK, passed 100 tests.
  6884. 619.99 s [vector] ifoldM_: OK (0.06s)
  6885. 619.99 s [vector] +++ OK, passed 100 tests.
  6886. 620.03 s [vector] ifoldM'_: OK (0.05s)
  6887. 620.04 s [vector] +++ OK, passed 100 tests.
  6888. 620.04 s [vector] all: OK
  6889. 620.04 s [vector] +++ OK, passed 100 tests.
  6890. 620.05 s [vector] any: OK
  6891. 620.05 s [vector] +++ OK, passed 100 tests.
  6892. 620.05 s [vector] prescanl: OK
  6893. 620.05 s [vector] +++ OK, passed 100 tests.
  6894. 620.07 s [vector] prescanl': OK (0.01s)
  6895. 620.07 s [vector] +++ OK, passed 100 tests.
  6896. 620.07 s [vector] postscanl: OK (0.01s)
  6897. 620.07 s [vector] +++ OK, passed 100 tests.
  6898. 620.09 s [vector] postscanl': OK (0.01s)
  6899. 620.09 s [vector] +++ OK, passed 100 tests.
  6900. 620.10 s [vector] scanl: OK
  6901. 620.10 s [vector] +++ OK, passed 100 tests.
  6902. 620.11 s [vector] scanl': OK (0.01s)
  6903. 620.11 s [vector] +++ OK, passed 100 tests.
  6904. 620.11 s [vector] scanl1: OK (0.01s)
  6905. 620.11 s [vector] +++ OK, passed 100 tests.
  6906. 620.12 s [vector] scanl1': OK (0.01s)
  6907. 620.12 s [vector] +++ OK, passed 100 tests.
  6908. 620.15 s [vector] iscanl: OK
  6909. 620.15 s [vector] +++ OK, passed 100 tests.
  6910. 620.15 s [vector] iscanl': OK (0.01s)
  6911. 620.15 s [vector] +++ OK, passed 100 tests.
  6912. 620.17 s [vector] prescanr: OK (0.01s)
  6913. 620.17 s [vector] +++ OK, passed 100 tests.
  6914. 620.17 s [vector] prescanr': OK
  6915. 620.17 s [vector] +++ OK, passed 100 tests.
  6916. 620.18 s [vector] postscanr: OK
  6917. 620.19 s [vector] +++ OK, passed 100 tests.
  6918. 620.19 s [vector] postscanr': OK (0.01s)
  6919. 620.19 s [vector] +++ OK, passed 100 tests.
  6920. 620.21 s [vector] scanr: OK (0.01s)
  6921. 620.21 s [vector] +++ OK, passed 100 tests.
  6922. 620.21 s [vector] scanr': OK (0.01s)
  6923. 620.21 s [vector] +++ OK, passed 100 tests.
  6924. 620.23 s [vector] scanr1: OK (0.01s)
  6925. 620.23 s [vector] +++ OK, passed 100 tests.
  6926. 620.23 s [vector] scanr1': OK (0.01s)
  6927. 620.23 s [vector] +++ OK, passed 100 tests.
  6928. 620.25 s [vector] iscanr: OK (0.01s)
  6929. 620.25 s [vector] +++ OK, passed 100 tests.
  6930. 620.26 s [vector] iscanr': OK (0.01s)
  6931. 620.26 s [vector] +++ OK, passed 100 tests.
  6932. 620.27 s [vector] mut_read: OK
  6933. 620.27 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6934. 620.27 s [vector] mut_write: OK
  6935. 620.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6936. 620.27 s [vector] mut_modify: OK
  6937. 620.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6938. 620.29 s [vector] mut_generate: OK
  6939. 620.29 s [vector] +++ OK, passed 100 tests.
  6940. 620.31 s [vector] mut_generateM: OK (0.03s)
  6941. 620.31 s [vector] +++ OK, passed 100 tests.
  6942. 620.43 s [vector] mut_mapM_: OK (0.11s)
  6943. 620.43 s [vector] +++ OK, passed 100 tests.
  6944. 620.53 s [vector] mut_imapM_: OK (0.11s)
  6945. 620.53 s [vector] +++ OK, passed 100 tests.
  6946. 620.59 s [vector] mut_forM_: OK (0.06s)
  6947. 620.59 s [vector] +++ OK, passed 100 tests.
  6948. 620.64 s [vector] mut_iforM_: OK (0.05s)
  6949. 620.64 s [vector] +++ OK, passed 100 tests.
  6950. 620.65 s [vector] mut_foldr: OK
  6951. 620.65 s [vector] +++ OK, passed 100 tests.
  6952. 620.65 s [vector] mut_foldr': OK
  6953. 620.65 s [vector] +++ OK, passed 100 tests.
  6954. 620.65 s [vector] mut_foldl: OK
  6955. 620.66 s [vector] +++ OK, passed 100 tests.
  6956. 620.67 s [vector] mut_foldl': OK
  6957. 620.68 s [vector] +++ OK, passed 100 tests.
  6958. 620.69 s [vector] mut_ifoldr: OK (0.01s)
  6959. 620.69 s [vector] +++ OK, passed 100 tests.
  6960. 620.69 s [vector] mut_ifoldr': OK (0.01s)
  6961. 620.69 s [vector] +++ OK, passed 100 tests.
  6962. 620.71 s [vector] mut_ifoldl: OK (0.01s)
  6963. 620.71 s [vector] +++ OK, passed 100 tests.
  6964. 620.71 s [vector] mut_ifoldl': OK (0.01s)
  6965. 620.71 s [vector] +++ OK, passed 100 tests.
  6966. 620.73 s [vector] mut_foldM: OK (0.01s)
  6967. 620.73 s [vector] +++ OK, passed 100 tests.
  6968. 620.75 s [vector] mut_foldM': OK (0.01s)
  6969. 620.75 s [vector] +++ OK, passed 100 tests.
  6970. 620.75 s [vector] mut_foldrM: OK (0.01s)
  6971. 620.75 s [vector] +++ OK, passed 100 tests.
  6972. 620.76 s [vector] mut_foldrM': OK
  6973. 620.76 s [vector] +++ OK, passed 100 tests.
  6974. 620.79 s [vector] mut_ifoldM: OK (0.02s)
  6975. 620.79 s [vector] +++ OK, passed 100 tests.
  6976. 620.79 s [vector] mut_ifoldM': OK (0.02s)
  6977. 620.79 s [vector] +++ OK, passed 100 tests.
  6978. 620.81 s [vector] mut_ifoldrM: OK
  6979. 620.81 s [vector] +++ OK, passed 100 tests.
  6980. 620.82 s [vector] mut_ifoldrM': OK (0.01s)
  6981. 620.82 s [vector] +++ OK, passed 100 tests.
  6982. 620.82 s [vector] compare: OK
  6983. 620.82 s [vector] +++ OK, passed 100 tests.
  6984. 620.82 s [vector] maximum: OK
  6985. 620.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6986. 620.82 s [vector] minimum: OK
  6987. 620.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6988. 620.83 s [vector] minIndex: OK
  6989. 620.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6990. 620.83 s [vector] maxIndex: OK
  6991. 620.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6992. 620.83 s [vector] maximumBy: OK
  6993. 620.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6994. 620.84 s [vector] minimumBy: OK
  6995. 620.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6996. 620.84 s [vector] maximumOn: OK
  6997. 620.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6998. 620.84 s [vector] minimumOn: OK
  6999. 620.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7000. 620.84 s [vector] maxIndexBy: OK
  7001. 620.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7002. 620.84 s [vector] minIndexBy: OK
  7003. 620.84 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7004. 620.84 s [vector] ListFirstMaxIndexWins: OK
  7005. 620.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7006. 620.85 s [vector] FalseListFirstMaxIndexWins: OK
  7007. 620.85 s [vector] +++ OK, failed as expected. (after 1 test):
  7008. 620.85 s [vector] Exception:
  7009. 620.85 s [vector] Prelude.foldr1: empty list
  7010. 620.85 s [vector] CallStack (from HasCallStack):
  7011. 620.86 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7012. 620.86 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7013. 620.86 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7014. 620.86 s [vector] []
  7015. 620.86 s [vector] zip: OK
  7016. 620.86 s [vector] +++ OK, passed 100 tests.
  7017. 620.87 s [vector] zip3: OK
  7018. 620.87 s [vector] +++ OK, passed 100 tests.
  7019. 620.87 s [vector] unzip: OK
  7020. 620.87 s [vector] +++ OK, passed 100 tests.
  7021. 620.89 s [vector] unzip3: OK (0.01s)
  7022. 620.89 s [vector] +++ OK, passed 100 tests.
  7023. 620.89 s [vector] indexed: OK
  7024. 620.89 s [vector] +++ OK, passed 100 tests.
  7025. 620.89 s [vector] update: OK
  7026. 620.90 s [vector] +++ OK, passed 100 tests.
  7027. 620.90 s [vector] mempty: OK
  7028. 620.90 s [vector] +++ OK, passed 1 test.
  7029. 620.91 s [vector] mappend: OK
  7030. 620.91 s [vector] +++ OK, passed 100 tests.
  7031. 620.97 s [vector] mconcat: OK (0.07s)
  7032. 620.98 s [vector] +++ OK, passed 100 tests.
  7033. 620.98 s [vector] glength: OK
  7034. 620.98 s [vector] +++ OK, passed 100 tests.
  7035. 620.98 s [vector] (Int,Bool,Int)
  7036. 620.98 s [vector] fromList.toList == id: OK
  7037. 620.98 s [vector] +++ OK, passed 100 tests.
  7038. 620.98 s [vector] toList.fromList == id: OK
  7039. 620.98 s [vector] +++ OK, passed 100 tests.
  7040. 620.99 s [vector] unstream.stream == id: OK
  7041. 620.99 s [vector] +++ OK, passed 100 tests.
  7042. 620.99 s [vector] stream.unstream == id: OK
  7043. 620.99 s [vector] +++ OK, passed 100 tests.
  7044. 620.99 s [vector] eq: OK
  7045. 620.99 s [vector] +++ OK, passed 100 tests.
  7046. 620.99 s [vector] length: OK
  7047. 620.99 s [vector] +++ OK, passed 100 tests.
  7048. 621.00 s [vector] null: OK
  7049. 621.00 s [vector] +++ OK, passed 100 tests.
  7050. 621.00 s [vector] index: OK
  7051. 621.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7052. 621.00 s [vector] safeIndex: OK
  7053. 621.00 s [vector] +++ OK, passed 100 tests.
  7054. 621.01 s [vector] head: OK
  7055. 621.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7056. 621.01 s [vector] last: OK
  7057. 621.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7058. 621.01 s [vector] unsafeIndex: OK
  7059. 621.01 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7060. 621.01 s [vector] unsafeHead: OK
  7061. 621.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7062. 621.02 s [vector] unsafeLast: OK
  7063. 621.04 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7064. 621.04 s [vector] slice: OK
  7065. 621.04 s [vector] +++ OK, passed 100 tests.
  7066. 621.05 s [vector] init: OK (0.02s)
  7067. 621.05 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7068. 621.05 s [vector] tail: OK
  7069. 621.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7070. 621.05 s [vector] take: OK
  7071. 621.05 s [vector] +++ OK, passed 100 tests.
  7072. 621.06 s [vector] drop: OK
  7073. 621.06 s [vector] +++ OK, passed 100 tests.
  7074. 621.06 s [vector] splitAt: OK
  7075. 621.06 s [vector] +++ OK, passed 100 tests.
  7076. 621.06 s [vector] empty: OK
  7077. 621.06 s [vector] +++ OK, passed 1 test.
  7078. 621.06 s [vector] singleton: OK
  7079. 621.06 s [vector] +++ OK, passed 100 tests.
  7080. 621.06 s [vector] replicate: OK
  7081. 621.06 s [vector] +++ OK, passed 100 tests.
  7082. 621.06 s [vector] generate: OK
  7083. 621.07 s [vector] +++ OK, passed 100 tests.
  7084. 621.07 s [vector] iterateN: OK
  7085. 621.07 s [vector] +++ OK, passed 100 tests.
  7086. 621.15 s [vector] iterateNM: OK (0.07s)
  7087. 621.15 s [vector] +++ OK, passed 100 tests.
  7088. 621.33 s [vector] generateM: OK (0.18s)
  7089. 621.33 s [vector] +++ OK, passed 100 tests.
  7090. 621.44 s [vector] replicateM: OK (0.03s)
  7091. 621.44 s [vector] +++ OK, passed 100 tests.
  7092. 621.44 s [vector] create: OK
  7093. 621.44 s [vector] +++ OK, passed 100 tests.
  7094. 621.44 s [vector] createT: OK
  7095. 621.44 s [vector] +++ OK, passed 100 tests.
  7096. 621.44 s [vector] unfoldr: OK
  7097. 621.44 s [vector] +++ OK, passed 100 tests.
  7098. 621.44 s [vector] unfoldrN: OK
  7099. 621.44 s [vector] +++ OK, passed 100 tests.
  7100. 621.44 s [vector] unfoldrExactN: OK
  7101. 621.44 s [vector] +++ OK, passed 100 tests.
  7102. 621.44 s [vector] unfoldrM: OK (0.02s)
  7103. 621.44 s [vector] +++ OK, passed 100 tests.
  7104. 621.44 s [vector] unfoldrNM: OK
  7105. 621.44 s [vector] +++ OK, passed 100 tests.
  7106. 621.50 s [vector] unfoldrExactNM: OK (0.09s)
  7107. 621.51 s [vector] +++ OK, passed 100 tests.
  7108. 621.52 s [vector] constructN: OK (0.03s)
  7109. 621.52 s [vector] +++ OK, passed 100 tests.
  7110. 621.55 s [vector] constructrN: OK (0.02s)
  7111. 621.55 s [vector] +++ OK, passed 100 tests.
  7112. 621.55 s [vector] cons: OK
  7113. 621.55 s [vector] +++ OK, passed 100 tests.
  7114. 621.55 s [vector] snoc: OK
  7115. 621.56 s [vector] +++ OK, passed 100 tests.
  7116. 621.56 s [vector] append: OK
  7117. 621.56 s [vector] +++ OK, passed 100 tests.
  7118. 621.70 s [vector] concat: OK (0.13s)
  7119. 621.70 s [vector] +++ OK, passed 100 tests.
  7120. 621.70 s [vector] force: OK
  7121. 621.70 s [vector] +++ OK, passed 100 tests.
  7122. 621.72 s [vector] upd: OK
  7123. 621.72 s [vector] +++ OK, passed 100 tests.
  7124. 621.74 s [vector] accum: OK (0.03s)
  7125. 621.74 s [vector] +++ OK, passed 100 tests.
  7126. 621.74 s [vector] reverse: OK
  7127. 621.74 s [vector] +++ OK, passed 100 tests.
  7128. 621.74 s [vector] backpermute: OK
  7129. 621.76 s [vector] +++ OK, passed 100 tests.
  7130. 621.76 s [vector] map: OK (0.01s)
  7131. 621.76 s [vector] +++ OK, passed 100 tests.
  7132. 621.78 s [vector] imap: OK (0.01s)
  7133. 621.78 s [vector] +++ OK, passed 100 tests.
  7134. 621.80 s [vector] concatMap: OK (0.02s)
  7135. 621.80 s [vector] +++ OK, passed 100 tests.
  7136. 621.82 s [vector] mapM: OK (0.01s)
  7137. 621.82 s [vector] +++ OK, passed 100 tests.
  7138. 621.90 s [vector] mapM_: OK (0.08s)
  7139. 621.90 s [vector] +++ OK, passed 100 tests.
  7140. 621.90 s [vector] forM: OK (0.01s)
  7141. 621.90 s [vector] +++ OK, passed 100 tests.
  7142. 621.98 s [vector] forM_: OK (0.08s)
  7143. 621.98 s [vector] +++ OK, passed 100 tests.
  7144. 622.00 s [vector] imapM: OK (0.01s)
  7145. 622.00 s [vector] +++ OK, passed 100 tests.
  7146. 622.14 s [vector] imapM_: OK (0.14s)
  7147. 622.14 s [vector] +++ OK, passed 100 tests.
  7148. 622.14 s [vector] zipWith: OK (0.01s)
  7149. 622.14 s [vector] +++ OK, passed 100 tests.
  7150. 622.16 s [vector] zipWith3: OK (0.02s)
  7151. 622.16 s [vector] +++ OK, passed 100 tests.
  7152. 622.18 s [vector] izipWith: OK (0.02s)
  7153. 622.19 s [vector] +++ OK, passed 100 tests.
  7154. 622.22 s [vector] izipWith3: OK (0.02s)
  7155. 622.22 s [vector] +++ OK, passed 100 tests.
  7156. 622.24 s [vector] izipWithM: OK (0.02s)
  7157. 622.24 s [vector] +++ OK, passed 100 tests.
  7158. 622.34 s [vector] izipWithM_: OK (0.10s)
  7159. 622.34 s [vector] +++ OK, passed 100 tests.
  7160. 622.34 s [vector] zipWithM: OK (0.01s)
  7161. 622.34 s [vector] +++ OK, passed 100 tests.
  7162. 622.42 s [vector] zipWithM_: OK (0.08s)
  7163. 622.42 s [vector] +++ OK, passed 100 tests.
  7164. 622.44 s [vector] filter: OK
  7165. 622.44 s [vector] +++ OK, passed 100 tests.
  7166. 622.44 s [vector] ifilter: OK (0.01s)
  7167. 622.44 s [vector] +++ OK, passed 100 tests.
  7168. 622.63 s [vector] filterM: OK (0.15s)
  7169. 622.63 s [vector] +++ OK, passed 100 tests.
  7170. 622.63 s [vector] uniq: OK
  7171. 622.63 s [vector] +++ OK, passed 100 tests.
  7172. 622.63 s [vector] mapMaybe: OK
  7173. 622.63 s [vector] +++ OK, passed 100 tests.
  7174. 622.63 s [vector] imapMaybe: OK (0.01s)
  7175. 622.63 s [vector] +++ OK, passed 100 tests.
  7176. 622.63 s [vector] takeWhile: OK
  7177. 622.63 s [vector] +++ OK, passed 100 tests.
  7178. 622.63 s [vector] dropWhile: OK
  7179. 622.63 s [vector] +++ OK, passed 100 tests.
  7180. 622.63 s [vector] partition: OK
  7181. 622.63 s [vector] +++ OK, passed 100 tests.
  7182. 622.64 s [vector] partitionWith: OK
  7183. 622.64 s [vector] +++ OK, passed 100 tests.
  7184. 622.64 s [vector] span: OK
  7185. 622.65 s [vector] +++ OK, passed 100 tests.
  7186. 622.66 s [vector] break: OK
  7187. 622.66 s [vector] +++ OK, passed 100 tests.
  7188. 622.66 s [vector] spanR: OK
  7189. 622.66 s [vector] +++ OK, passed 100 tests.
  7190. 622.67 s [vector] breakR: OK
  7191. 622.67 s [vector] +++ OK, passed 100 tests.
  7192. 622.67 s [vector] groupBy: OK (0.01s)
  7193. 622.67 s [vector] +++ OK, passed 100 tests.
  7194. 622.67 s [vector] elem: OK
  7195. 622.67 s [vector] +++ OK, passed 100 tests.
  7196. 622.67 s [vector] notElem: OK
  7197. 622.68 s [vector] +++ OK, passed 100 tests.
  7198. 622.68 s [vector] find: OK
  7199. 622.68 s [vector] +++ OK, passed 100 tests.
  7200. 622.68 s [vector] findIndex: OK
  7201. 622.68 s [vector] +++ OK, passed 100 tests.
  7202. 622.68 s [vector] findIndexR: OK
  7203. 622.68 s [vector] +++ OK, passed 100 tests.
  7204. 622.69 s [vector] findIndices: OK
  7205. 622.70 s [vector] +++ OK, passed 100 tests.
  7206. 622.70 s [vector] elemIndex: OK
  7207. 622.70 s [vector] +++ OK, passed 100 tests.
  7208. 622.70 s [vector] elemIndices: OK
  7209. 622.70 s [vector] +++ OK, passed 100 tests.
  7210. 622.72 s [vector] foldl: OK (0.01s)
  7211. 622.72 s [vector] +++ OK, passed 100 tests.
  7212. 622.74 s [vector] foldl1: OK (0.01s)
  7213. 622.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7214. 622.76 s [vector] foldl': OK (0.02s)
  7215. 622.77 s [vector] +++ OK, passed 100 tests.
  7216. 622.77 s [vector] foldl1': OK (0.02s)
  7217. 622.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7218. 622.78 s [vector] foldr: OK (0.01s)
  7219. 622.78 s [vector] +++ OK, passed 100 tests.
  7220. 622.80 s [vector] foldr1: OK (0.01s)
  7221. 622.80 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7222. 622.80 s [vector] foldr': OK (0.01s)
  7223. 622.80 s [vector] +++ OK, passed 100 tests.
  7224. 622.82 s [vector] foldr1': OK (0.01s)
  7225. 622.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7226. 622.84 s [vector] ifoldl: OK (0.02s)
  7227. 622.84 s [vector] +++ OK, passed 100 tests.
  7228. 622.84 s [vector] ifoldl': OK (0.01s)
  7229. 622.84 s [vector] +++ OK, passed 100 tests.
  7230. 622.86 s [vector] ifoldr: OK (0.01s)
  7231. 622.86 s [vector] +++ OK, passed 100 tests.
  7232. 622.89 s [vector] ifoldr': OK (0.01s)
  7233. 622.91 s [vector] +++ OK, passed 100 tests.
  7234. 622.91 s [vector] ifoldM: OK (0.01s)
  7235. 622.91 s [vector] +++ OK, passed 100 tests.
  7236. 622.93 s [vector] ifoldM': OK (0.02s)
  7237. 622.93 s [vector] +++ OK, passed 100 tests.
  7238. 623.00 s [vector] ifoldM_: OK (0.09s)
  7239. 623.00 s [vector] +++ OK, passed 100 tests.
  7240. 623.09 s [vector] ifoldM'_: OK (0.09s)
  7241. 623.09 s [vector] +++ OK, passed 100 tests.
  7242. 623.09 s [vector] all: OK
  7243. 623.09 s [vector] +++ OK, passed 100 tests.
  7244. 623.09 s [vector] any: OK
  7245. 623.10 s [vector] +++ OK, passed 100 tests.
  7246. 623.12 s [vector] prescanl: OK (0.01s)
  7247. 623.12 s [vector] +++ OK, passed 100 tests.
  7248. 623.14 s [vector] prescanl': OK (0.02s)
  7249. 623.14 s [vector] +++ OK, passed 100 tests.
  7250. 623.14 s [vector] postscanl: OK (0.02s)
  7251. 623.14 s [vector] +++ OK, passed 100 tests.
  7252. 623.18 s [vector] postscanl': OK (0.01s)
  7253. 623.18 s [vector] +++ OK, passed 100 tests.
  7254. 623.20 s [vector] scanl: OK (0.02s)
  7255. 623.20 s [vector] +++ OK, passed 100 tests.
  7256. 623.22 s [vector] scanl': OK (0.02s)
  7257. 623.22 s [vector] +++ OK, passed 100 tests.
  7258. 623.24 s [vector] scanl1: OK (0.02s)
  7259. 623.24 s [vector] +++ OK, passed 100 tests.
  7260. 623.26 s [vector] scanl1': OK (0.02s)
  7261. 623.27 s [vector] +++ OK, passed 100 tests.
  7262. 623.28 s [vector] iscanl: OK (0.02s)
  7263. 623.28 s [vector] +++ OK, passed 100 tests.
  7264. 623.30 s [vector] iscanl': OK (0.02s)
  7265. 623.30 s [vector] +++ OK, passed 100 tests.
  7266. 623.32 s [vector] prescanr: OK (0.02s)
  7267. 623.32 s [vector] +++ OK, passed 100 tests.
  7268. 623.34 s [vector] prescanr': OK (0.01s)
  7269. 623.34 s [vector] +++ OK, passed 100 tests.
  7270. 623.34 s [vector] postscanr: OK (0.01s)
  7271. 623.34 s [vector] +++ OK, passed 100 tests.
  7272. 623.36 s [vector] postscanr': OK (0.01s)
  7273. 623.36 s [vector] +++ OK, passed 100 tests.
  7274. 623.38 s [vector] scanr: OK (0.02s)
  7275. 623.38 s [vector] +++ OK, passed 100 tests.
  7276. 623.38 s [vector] scanr': OK (0.01s)
  7277. 623.39 s [vector] +++ OK, passed 100 tests.
  7278. 623.40 s [vector] scanr1: OK (0.01s)
  7279. 623.40 s [vector] +++ OK, passed 100 tests.
  7280. 623.42 s [vector] scanr1': OK (0.02s)
  7281. 623.43 s [vector] +++ OK, passed 100 tests.
  7282. 623.44 s [vector] iscanr: OK (0.02s)
  7283. 623.44 s [vector] +++ OK, passed 100 tests.
  7284. 623.45 s [vector] iscanr': OK (0.02s)
  7285. 623.45 s [vector] +++ OK, passed 100 tests.
  7286. 623.45 s [vector] mut_read: OK
  7287. 623.46 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7288. 623.46 s [vector] mut_write: OK
  7289. 623.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7290. 623.47 s [vector] mut_modify: OK
  7291. 623.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7292. 623.48 s [vector] mut_generate: OK
  7293. 623.48 s [vector] +++ OK, passed 100 tests.
  7294. 623.52 s [vector] mut_generateM: OK (0.05s)
  7295. 623.52 s [vector] +++ OK, passed 100 tests.
  7296. 623.60 s [vector] mut_mapM_: OK (0.07s)
  7297. 623.60 s [vector] +++ OK, passed 100 tests.
  7298. 623.66 s [vector] mut_imapM_: OK (0.07s)
  7299. 623.66 s [vector] +++ OK, passed 100 tests.
  7300. 623.75 s [vector] mut_forM_: OK (0.08s)
  7301. 623.75 s [vector] +++ OK, passed 100 tests.
  7302. 623.86 s [vector] mut_iforM_: OK (0.12s)
  7303. 623.86 s [vector] +++ OK, passed 100 tests.
  7304. 623.88 s [vector] mut_foldr: OK (0.02s)
  7305. 623.88 s [vector] +++ OK, passed 100 tests.
  7306. 623.90 s [vector] mut_foldr': OK (0.01s)
  7307. 623.90 s [vector] +++ OK, passed 100 tests.
  7308. 623.92 s [vector] mut_foldl: OK (0.01s)
  7309. 623.92 s [vector] +++ OK, passed 100 tests.
  7310. 623.93 s [vector] mut_foldl': OK (0.01s)
  7311. 623.93 s [vector] +++ OK, passed 100 tests.
  7312. 623.93 s [vector] mut_ifoldr: OK (0.02s)
  7313. 623.93 s [vector] +++ OK, passed 100 tests.
  7314. 623.95 s [vector] mut_ifoldr': OK
  7315. 623.95 s [vector] +++ OK, passed 100 tests.
  7316. 623.96 s [vector] mut_ifoldl: OK (0.01s)
  7317. 623.96 s [vector] +++ OK, passed 100 tests.
  7318. 623.98 s [vector] mut_ifoldl': OK (0.01s)
  7319. 623.98 s [vector] +++ OK, passed 100 tests.
  7320. 624.00 s [vector] mut_foldM: OK (0.01s)
  7321. 624.00 s [vector] +++ OK, passed 100 tests.
  7322. 624.00 s [vector] mut_foldM': OK (0.01s)
  7323. 624.00 s [vector] +++ OK, passed 100 tests.
  7324. 624.02 s [vector] mut_foldrM: OK (0.01s)
  7325. 624.02 s [vector] +++ OK, passed 100 tests.
  7326. 624.02 s [vector] mut_foldrM': OK (0.01s)
  7327. 624.02 s [vector] +++ OK, passed 100 tests.
  7328. 624.06 s [vector] mut_ifoldM: OK (0.02s)
  7329. 624.06 s [vector] +++ OK, passed 100 tests.
  7330. 624.06 s [vector] mut_ifoldM': OK (0.02s)
  7331. 624.06 s [vector] +++ OK, passed 100 tests.
  7332. 624.08 s [vector] mut_ifoldrM: OK (0.02s)
  7333. 624.09 s [vector] +++ OK, passed 100 tests.
  7334. 624.10 s [vector] mut_ifoldrM': OK (0.02s)
  7335. 624.10 s [vector] +++ OK, passed 100 tests.
  7336. 624.10 s [vector] compare: OK
  7337. 624.10 s [vector] +++ OK, passed 100 tests.
  7338. 624.10 s [vector] maximum: OK
  7339. 624.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7340. 624.11 s [vector] minimum: OK
  7341. 624.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7342. 624.11 s [vector] minIndex: OK
  7343. 624.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7344. 624.11 s [vector] maxIndex: OK
  7345. 624.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7346. 624.12 s [vector] maximumBy: OK
  7347. 624.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7348. 624.12 s [vector] minimumBy: OK
  7349. 624.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7350. 624.13 s [vector] maximumOn: OK
  7351. 624.13 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7352. 624.13 s [vector] minimumOn: OK
  7353. 624.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7354. 624.13 s [vector] maxIndexBy: OK
  7355. 624.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7356. 624.13 s [vector] minIndexBy: OK
  7357. 624.14 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7358. 624.14 s [vector] ListFirstMaxIndexWins: OK
  7359. 624.14 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7360. 624.14 s [vector] FalseListFirstMaxIndexWins: OK
  7361. 624.14 s [vector] +++ OK, failed as expected. (after 1 test):
  7362. 624.14 s [vector] Exception:
  7363. 624.14 s [vector] Prelude.foldr1: empty list
  7364. 624.14 s [vector] CallStack (from HasCallStack):
  7365. 624.14 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7366. 624.14 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7367. 624.14 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7368. 624.14 s [vector] []
  7369. 624.16 s [vector] zip: OK
  7370. 624.16 s [vector] +++ OK, passed 100 tests.
  7371. 624.16 s [vector] zip3: OK
  7372. 624.16 s [vector] +++ OK, passed 100 tests.
  7373. 624.18 s [vector] unzip: OK (0.01s)
  7374. 624.18 s [vector] +++ OK, passed 100 tests.
  7375. 624.19 s [vector] unzip3: OK (0.02s)
  7376. 624.19 s [vector] +++ OK, passed 100 tests.
  7377. 624.19 s [vector] indexed: OK
  7378. 624.19 s [vector] +++ OK, passed 100 tests.
  7379. 624.20 s [vector] update: OK
  7380. 624.20 s [vector] +++ OK, passed 100 tests.
  7381. 624.20 s [vector] mempty: OK
  7382. 624.20 s [vector] +++ OK, passed 1 test.
  7383. 624.21 s [vector] mappend: OK
  7384. 624.22 s [vector] +++ OK, passed 100 tests.
  7385. 624.33 s [vector] mconcat: OK (0.12s)
  7386. 624.33 s [vector] +++ OK, passed 100 tests.
  7387. 624.34 s [vector] glength: OK
  7388. 624.34 s [vector] +++ OK, passed 100 tests.
  7389. 624.34 s [vector] unstream
  7390. 624.34 s [vector] unstream == vunstream (exact): OK
  7391. 624.34 s [vector] +++ OK, passed 100 tests.
  7392. 624.34 s [vector] unstream == vunstream (unknown): OK
  7393. 624.34 s [vector] +++ OK, passed 100 tests.
  7394. 624.34 s [vector] unstreamR ~= vunstream (exact): OK
  7395. 624.35 s [vector] +++ OK, passed 100 tests.
  7396. 624.35 s [vector] unstreamR ~= vunstream (unknown): OK
  7397. 624.35 s [vector] +++ OK, passed 100 tests.
  7398. 624.35 s [vector] Data.Vector.Storable.Vector Alignment
  7399. 624.35 s [vector] Aligned Double: OK
  7400. 624.35 s [vector] Aligned Int: OK
  7401. 624.35 s [vector] Regression tests
  7402. 624.35 s [vector] enumFromTo crash #188
  7403. 624.35 s [vector] Word8: OK
  7404. 624.35 s [vector] Word16: OK
  7405. 624.35 s [vector] Word32: OK
  7406. 624.35 s [vector] Word64: OK
  7407. 624.35 s [vector] Word: OK
  7408. 624.35 s [vector] Int8: OK
  7409. 624.35 s [vector] Int16: OK
  7410. 624.35 s [vector] Int32: OK
  7411. 624.35 s [vector] Int64: OK
  7412. 624.35 s [vector] Int: OK
  7413. 624.35 s [vector] Char: OK
  7414. 624.35 s [vector] Negative tests
  7415. 624.35 s [vector] slice out of bounds #257
  7416. 624.35 s [vector] Boxed
  7417. 624.35 s [vector] Negative ix: OK
  7418. 624.35 s [vector] Negative size: OK
  7419. 624.35 s [vector] Negative ix and size: OK
  7420. 624.35 s [vector] Too large ix: OK
  7421. 624.35 s [vector] Too large size: OK
  7422. 624.35 s [vector] Too large ix and size: OK
  7423. 624.35 s [vector] Overflow: OK
  7424. 624.35 s [vector] OutOfMemory: OK
  7425. 624.35 s [vector] Primitive
  7426. 624.35 s [vector] Negative ix: OK
  7427. 624.35 s [vector] Negative size: OK
  7428. 624.35 s [vector] Negative ix and size: OK
  7429. 624.35 s [vector] Too large ix: OK
  7430. 624.35 s [vector] Too large size: OK
  7431. 624.35 s [vector] Too large ix and size: OK
  7432. 624.35 s [vector] Overflow: OK
  7433. 624.35 s [vector] OutOfMemory: OK
  7434. 624.35 s [vector] Storable
  7435. 624.35 s [vector] Negative ix: OK
  7436. 624.35 s [vector] Negative size: OK
  7437. 624.35 s [vector] Negative ix and size: OK
  7438. 624.35 s [vector] Too large ix: OK
  7439. 624.35 s [vector] Too large size: OK
  7440. 624.35 s [vector] Too large ix and size: OK
  7441. 624.35 s [vector] Overflow: OK
  7442. 624.35 s [vector] OutOfMemory: OK
  7443. 624.35 s [vector] Unboxed
  7444. 624.35 s [vector] Negative ix: OK
  7445. 624.36 s [vector] Negative size: OK
  7446. 624.36 s [vector] Negative ix and size: OK
  7447. 624.36 s [vector] Too large ix: OK
  7448. 624.36 s [vector] Too large size: OK
  7449. 624.36 s [vector] Too large ix and size: OK
  7450. 624.36 s [vector] Overflow: OK
  7451. 624.36 s [vector] OutOfMemory: OK
  7452. 624.36 s [vector] take #282
  7453. 624.36 s [vector] Boxed: OK
  7454. 624.36 s [vector] Primitive: OK
  7455. 624.36 s [vector] Storable: OK
  7456. 624.36 s [vector] Unboxed: OK
  7457. 624.36 s [vector] Data.Vector
  7458. 624.36 s [vector] MonadFix: OK
  7459. 624.36 s [vector] toFromArray: OK
  7460. 624.36 s [vector] toFromArraySlice: OK
  7461. 624.36 s [vector] toFromArraySliceUnsafe: OK
  7462. 624.36 s [vector] toFromMutableArray: OK
  7463. 624.36 s [vector] Data.Vector.Mutable (Move): OK
  7464. 624.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7465. 624.36 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  7466. 624.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7467. 624.36 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  7468. 624.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7469. 624.36 s [vector] Data.Vector.Storable.Mutable (Move): OK
  7470. 624.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7471. 624.42 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.05s)
  7472. 624.42 s [vector] +++ OK, passed 1 test.
  7473. 624.49 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.07s)
  7474. 624.49 s [vector] +++ OK, passed 1 test.
  7475. 624.49 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  7476. 624.49 s [vector] +++ OK, passed 100 tests.
  7477. 624.49 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  7478. 624.49 s [vector] +++ OK, passed 100 tests.
  7479. 624.51 s [vector]
  7480. 624.51 s [vector] All 2808 tests passed (32.52s)
  7481. 624.51 s [vector] Test suite vector-tests-O0: PASS
  7482. 624.51 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  7483. 624.51 s [vector] Test suite vector-tests-O2: RUNNING...
  7484. 624.62 s [vector] toplevel
  7485. 624.62 s [vector] Data.Vector.Fusion.Bundle
  7486. 624.62 s [vector] fromList.toList == id: OK
  7487. 624.62 s [vector] +++ OK, passed 100 tests.
  7488. 624.63 s [vector] toList.fromList == id: OK
  7489. 624.63 s [vector] +++ OK, passed 100 tests.
  7490. 624.63 s [vector] eq: OK
  7491. 624.63 s [vector] +++ OK, passed 100 tests.
  7492. 624.63 s [vector] length: OK (0.01s)
  7493. 624.63 s [vector] +++ OK, passed 100 tests.
  7494. 624.63 s [vector] null: OK
  7495. 624.63 s [vector] +++ OK, passed 100 tests.
  7496. 624.63 s [vector] empty: OK
  7497. 624.63 s [vector] +++ OK, passed 1 test.
  7498. 624.63 s [vector] singleton: OK
  7499. 624.63 s [vector] +++ OK, passed 100 tests.
  7500. 624.63 s [vector] replicate: OK
  7501. 624.63 s [vector] +++ OK, passed 100 tests.
  7502. 624.63 s [vector] cons: OK
  7503. 624.63 s [vector] +++ OK, passed 100 tests.
  7504. 624.63 s [vector] snoc: OK
  7505. 624.69 s [vector] +++ OK, passed 100 tests.
  7506. 624.69 s [vector] append: OK (0.02s)
  7507. 624.69 s [vector] +++ OK, passed 100 tests.
  7508. 624.69 s [vector] head: OK
  7509. 624.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7510. 624.69 s [vector] last: OK
  7511. 624.69 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7512. 624.69 s [vector] index: OK
  7513. 624.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7514. 624.69 s [vector] extract: OK
  7515. 624.69 s [vector] +++ OK, passed 100 tests.
  7516. 624.69 s [vector] init: OK
  7517. 624.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7518. 624.69 s [vector] tail: OK
  7519. 624.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7520. 624.69 s [vector] take: OK
  7521. 624.69 s [vector] +++ OK, passed 100 tests.
  7522. 624.69 s [vector] drop: OK
  7523. 624.69 s [vector] +++ OK, passed 100 tests.
  7524. 624.69 s [vector] map: OK
  7525. 624.69 s [vector] +++ OK, passed 100 tests.
  7526. 624.69 s [vector] zipWith: OK
  7527. 624.69 s [vector] +++ OK, passed 100 tests.
  7528. 624.69 s [vector] zipWith3: OK
  7529. 624.69 s [vector] +++ OK, passed 100 tests.
  7530. 624.69 s [vector] filter: OK
  7531. 624.69 s [vector] +++ OK, passed 100 tests.
  7532. 624.69 s [vector] takeWhile: OK
  7533. 624.69 s [vector] +++ OK, passed 100 tests.
  7534. 624.69 s [vector] dropWhile: OK
  7535. 624.69 s [vector] +++ OK, passed 100 tests.
  7536. 624.69 s [vector] elem: OK
  7537. 624.69 s [vector] +++ OK, passed 100 tests.
  7538. 624.69 s [vector] notElem: OK
  7539. 624.69 s [vector] +++ OK, passed 100 tests.
  7540. 624.69 s [vector] find: OK
  7541. 624.69 s [vector] +++ OK, passed 100 tests.
  7542. 624.69 s [vector] findIndex: OK
  7543. 624.69 s [vector] +++ OK, passed 100 tests.
  7544. 624.69 s [vector] foldl: OK
  7545. 624.69 s [vector] +++ OK, passed 100 tests.
  7546. 624.69 s [vector] foldl1: OK
  7547. 624.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7548. 624.69 s [vector] foldl': OK
  7549. 624.69 s [vector] +++ OK, passed 100 tests.
  7550. 624.69 s [vector] foldl1': OK
  7551. 624.69 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7552. 624.69 s [vector] foldr: OK
  7553. 624.69 s [vector] +++ OK, passed 100 tests.
  7554. 624.69 s [vector] foldr1: OK
  7555. 624.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7556. 624.69 s [vector] prescanl: OK
  7557. 624.69 s [vector] +++ OK, passed 100 tests.
  7558. 624.69 s [vector] prescanl': OK
  7559. 624.69 s [vector] +++ OK, passed 100 tests.
  7560. 624.69 s [vector] postscanl: OK
  7561. 624.69 s [vector] +++ OK, passed 100 tests.
  7562. 624.69 s [vector] postscanl': OK
  7563. 624.70 s [vector] +++ OK, passed 100 tests.
  7564. 624.70 s [vector] scanl: OK
  7565. 624.70 s [vector] +++ OK, passed 100 tests.
  7566. 624.70 s [vector] scanl': OK
  7567. 624.70 s [vector] +++ OK, passed 100 tests.
  7568. 624.71 s [vector] scanl1: OK
  7569. 624.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7570. 624.71 s [vector] scanl1': OK
  7571. 624.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7572. 624.71 s [vector] concatMap: OK
  7573. 624.71 s [vector] +++ OK, passed 100 tests.
  7574. 624.71 s [vector] unfoldr: OK
  7575. 624.71 s [vector] +++ OK, passed 100 tests.
  7576. 624.71 s [vector] and: OK
  7577. 624.71 s [vector] +++ OK, passed 100 tests.
  7578. 624.72 s [vector] or: OK
  7579. 624.72 s [vector] +++ OK, passed 100 tests.
  7580. 624.72 s [vector] Tests.Vector.Boxed
  7581. 624.72 s [vector] Bool
  7582. 624.72 s [vector] fromList.toList == id: OK
  7583. 624.72 s [vector] +++ OK, passed 100 tests.
  7584. 624.72 s [vector] toList.fromList == id: OK
  7585. 624.72 s [vector] +++ OK, passed 100 tests.
  7586. 624.72 s [vector] unstream.stream == id: OK
  7587. 624.72 s [vector] +++ OK, passed 100 tests.
  7588. 624.72 s [vector] stream.unstream == id: OK
  7589. 624.72 s [vector] +++ OK, passed 100 tests.
  7590. 624.72 s [vector] eq: OK
  7591. 624.72 s [vector] +++ OK, passed 100 tests.
  7592. 624.72 s [vector] length: OK
  7593. 624.72 s [vector] +++ OK, passed 100 tests.
  7594. 624.72 s [vector] null: OK
  7595. 624.72 s [vector] +++ OK, passed 100 tests.
  7596. 624.72 s [vector] index: OK
  7597. 624.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7598. 624.72 s [vector] safeIndex: OK
  7599. 624.72 s [vector] +++ OK, passed 100 tests.
  7600. 624.72 s [vector] head: OK
  7601. 624.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7602. 624.72 s [vector] last: OK
  7603. 624.72 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7604. 624.72 s [vector] unsafeIndex: OK
  7605. 624.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7606. 624.72 s [vector] unsafeHead: OK
  7607. 624.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7608. 624.72 s [vector] unsafeLast: OK
  7609. 624.72 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7610. 624.72 s [vector] slice: OK
  7611. 624.72 s [vector] +++ OK, passed 100 tests.
  7612. 624.72 s [vector] init: OK
  7613. 624.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7614. 624.72 s [vector] tail: OK
  7615. 624.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7616. 624.72 s [vector] take: OK
  7617. 624.72 s [vector] +++ OK, passed 100 tests.
  7618. 624.73 s [vector] drop: OK
  7619. 624.73 s [vector] +++ OK, passed 100 tests.
  7620. 624.73 s [vector] splitAt: OK
  7621. 624.73 s [vector] +++ OK, passed 100 tests.
  7622. 624.73 s [vector] empty: OK
  7623. 624.73 s [vector] +++ OK, passed 1 test.
  7624. 624.73 s [vector] singleton: OK
  7625. 624.73 s [vector] +++ OK, passed 100 tests.
  7626. 624.73 s [vector] replicate: OK
  7627. 624.73 s [vector] +++ OK, passed 100 tests.
  7628. 624.73 s [vector] generate: OK
  7629. 624.73 s [vector] +++ OK, passed 100 tests.
  7630. 624.73 s [vector] iterateN: OK
  7631. 624.75 s [vector] +++ OK, passed 100 tests.
  7632. 624.76 s [vector] iterateNM: OK (0.01s)
  7633. 624.76 s [vector] +++ OK, passed 100 tests.
  7634. 624.77 s [vector] generateM: OK (0.02s)
  7635. 624.77 s [vector] +++ OK, passed 100 tests.
  7636. 624.77 s [vector] replicateM: OK
  7637. 624.77 s [vector] +++ OK, passed 100 tests.
  7638. 624.79 s [vector] create: OK
  7639. 624.79 s [vector] +++ OK, passed 100 tests.
  7640. 624.79 s [vector] createT: OK
  7641. 624.79 s [vector] +++ OK, passed 100 tests.
  7642. 624.79 s [vector] unfoldr: OK
  7643. 624.79 s [vector] +++ OK, passed 100 tests.
  7644. 624.80 s [vector] unfoldrN: OK
  7645. 624.80 s [vector] +++ OK, passed 100 tests.
  7646. 624.80 s [vector] unfoldrExactN: OK
  7647. 624.80 s [vector] +++ OK, passed 100 tests.
  7648. 624.81 s [vector] unfoldrM: OK (0.01s)
  7649. 624.81 s [vector] +++ OK, passed 100 tests.
  7650. 624.82 s [vector] unfoldrNM: OK (0.02s)
  7651. 624.82 s [vector] +++ OK, passed 100 tests.
  7652. 624.85 s [vector] unfoldrExactNM: OK (0.03s)
  7653. 624.85 s [vector] +++ OK, passed 100 tests.
  7654. 624.85 s [vector] constructN: OK
  7655. 624.85 s [vector] +++ OK, passed 100 tests.
  7656. 624.85 s [vector] constructrN: OK
  7657. 624.85 s [vector] +++ OK, passed 100 tests.
  7658. 624.85 s [vector] cons: OK
  7659. 624.85 s [vector] +++ OK, passed 100 tests.
  7660. 624.85 s [vector] snoc: OK
  7661. 624.85 s [vector] +++ OK, passed 100 tests.
  7662. 624.86 s [vector] append: OK
  7663. 624.86 s [vector] +++ OK, passed 100 tests.
  7664. 624.87 s [vector] concat: OK (0.02s)
  7665. 624.88 s [vector] +++ OK, passed 100 tests.
  7666. 624.88 s [vector] force: OK
  7667. 624.88 s [vector] +++ OK, passed 100 tests.
  7668. 624.88 s [vector] upd: OK
  7669. 624.88 s [vector] +++ OK, passed 100 tests.
  7670. 624.88 s [vector] accum: OK
  7671. 624.88 s [vector] +++ OK, passed 100 tests.
  7672. 624.88 s [vector] reverse: OK
  7673. 624.95 s [vector] +++ OK, passed 100 tests.
  7674. 624.95 s [vector] backpermute: OK
  7675. 624.95 s [vector] +++ OK, passed 100 tests.
  7676. 624.95 s [vector] map: OK
  7677. 624.95 s [vector] +++ OK, passed 100 tests.
  7678. 624.95 s [vector] imap: OK
  7679. 624.95 s [vector] +++ OK, passed 100 tests.
  7680. 624.95 s [vector] concatMap: OK
  7681. 624.95 s [vector] +++ OK, passed 100 tests.
  7682. 624.95 s [vector] mapM: OK
  7683. 624.95 s [vector] +++ OK, passed 100 tests.
  7684. 624.95 s [vector] mapM_: OK (0.02s)
  7685. 624.95 s [vector] +++ OK, passed 100 tests.
  7686. 624.95 s [vector] forM: OK
  7687. 624.95 s [vector] +++ OK, passed 100 tests.
  7688. 624.95 s [vector] forM_: OK (0.02s)
  7689. 624.95 s [vector] +++ OK, passed 100 tests.
  7690. 624.95 s [vector] imapM: OK
  7691. 624.95 s [vector] +++ OK, passed 100 tests.
  7692. 624.95 s [vector] imapM_: OK (0.02s)
  7693. 624.95 s [vector] +++ OK, passed 100 tests.
  7694. 624.95 s [vector] zipWith: OK
  7695. 624.95 s [vector] +++ OK, passed 100 tests.
  7696. 624.96 s [vector] zipWith3: OK
  7697. 624.96 s [vector] +++ OK, passed 100 tests.
  7698. 624.96 s [vector] izipWith: OK
  7699. 624.96 s [vector] +++ OK, passed 100 tests.
  7700. 624.96 s [vector] izipWith3: OK
  7701. 624.96 s [vector] +++ OK, passed 100 tests.
  7702. 624.96 s [vector] izipWithM: OK
  7703. 624.98 s [vector] +++ OK, passed 100 tests.
  7704. 624.98 s [vector] izipWithM_: OK (0.02s)
  7705. 624.98 s [vector] +++ OK, passed 100 tests.
  7706. 624.98 s [vector] zipWithM: OK
  7707. 624.98 s [vector] +++ OK, passed 100 tests.
  7708. 624.99 s [vector] zipWithM_: OK (0.01s)
  7709. 624.99 s [vector] +++ OK, passed 100 tests.
  7710. 625.00 s [vector] filter: OK
  7711. 625.00 s [vector] +++ OK, passed 100 tests.
  7712. 625.00 s [vector] ifilter: OK
  7713. 625.00 s [vector] +++ OK, passed 100 tests.
  7714. 625.06 s [vector] filterM: OK (0.06s)
  7715. 625.06 s [vector] +++ OK, passed 100 tests.
  7716. 625.06 s [vector] uniq: OK
  7717. 625.07 s [vector] +++ OK, passed 100 tests.
  7718. 625.07 s [vector] mapMaybe: OK
  7719. 625.07 s [vector] +++ OK, passed 100 tests.
  7720. 625.07 s [vector] imapMaybe: OK
  7721. 625.07 s [vector] +++ OK, passed 100 tests.
  7722. 625.07 s [vector] takeWhile: OK
  7723. 625.07 s [vector] +++ OK, passed 100 tests.
  7724. 625.07 s [vector] dropWhile: OK
  7725. 625.07 s [vector] +++ OK, passed 100 tests.
  7726. 625.07 s [vector] partition: OK
  7727. 625.07 s [vector] +++ OK, passed 100 tests.
  7728. 625.07 s [vector] partitionWith: OK
  7729. 625.07 s [vector] +++ OK, passed 100 tests.
  7730. 625.07 s [vector] span: OK
  7731. 625.08 s [vector] +++ OK, passed 100 tests.
  7732. 625.08 s [vector] break: OK
  7733. 625.08 s [vector] +++ OK, passed 100 tests.
  7734. 625.08 s [vector] spanR: OK
  7735. 625.08 s [vector] +++ OK, passed 100 tests.
  7736. 625.08 s [vector] breakR: OK
  7737. 625.08 s [vector] +++ OK, passed 100 tests.
  7738. 625.08 s [vector] groupBy: OK
  7739. 625.08 s [vector] +++ OK, passed 100 tests.
  7740. 625.08 s [vector] elem: OK
  7741. 625.08 s [vector] +++ OK, passed 100 tests.
  7742. 625.08 s [vector] notElem: OK
  7743. 625.08 s [vector] +++ OK, passed 100 tests.
  7744. 625.09 s [vector] find: OK
  7745. 625.09 s [vector] +++ OK, passed 100 tests.
  7746. 625.09 s [vector] findIndex: OK
  7747. 625.09 s [vector] +++ OK, passed 100 tests.
  7748. 625.09 s [vector] findIndexR: OK
  7749. 625.09 s [vector] +++ OK, passed 100 tests.
  7750. 625.09 s [vector] findIndices: OK
  7751. 625.09 s [vector] +++ OK, passed 100 tests.
  7752. 625.09 s [vector] elemIndex: OK
  7753. 625.09 s [vector] +++ OK, passed 100 tests.
  7754. 625.09 s [vector] elemIndices: OK
  7755. 625.09 s [vector] +++ OK, passed 100 tests.
  7756. 625.09 s [vector] foldl: OK
  7757. 625.09 s [vector] +++ OK, passed 100 tests.
  7758. 625.09 s [vector] foldl1: OK
  7759. 625.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7760. 625.10 s [vector] foldl': OK
  7761. 625.10 s [vector] +++ OK, passed 100 tests.
  7762. 625.10 s [vector] foldl1': OK
  7763. 625.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7764. 625.10 s [vector] foldr: OK
  7765. 625.10 s [vector] +++ OK, passed 100 tests.
  7766. 625.10 s [vector] foldr1: OK
  7767. 625.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7768. 625.11 s [vector] foldr': OK
  7769. 625.11 s [vector] +++ OK, passed 100 tests.
  7770. 625.11 s [vector] foldr1': OK
  7771. 625.11 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7772. 625.11 s [vector] ifoldl: OK
  7773. 625.11 s [vector] +++ OK, passed 100 tests.
  7774. 625.11 s [vector] ifoldl': OK
  7775. 625.12 s [vector] +++ OK, passed 100 tests.
  7776. 625.12 s [vector] ifoldr: OK
  7777. 625.12 s [vector] +++ OK, passed 100 tests.
  7778. 625.12 s [vector] ifoldr': OK
  7779. 625.12 s [vector] +++ OK, passed 100 tests.
  7780. 625.13 s [vector] ifoldM: OK
  7781. 625.13 s [vector] +++ OK, passed 100 tests.
  7782. 625.13 s [vector] ifoldM': OK
  7783. 625.13 s [vector] +++ OK, passed 100 tests.
  7784. 625.15 s [vector] ifoldM_: OK (0.02s)
  7785. 625.15 s [vector] +++ OK, passed 100 tests.
  7786. 625.17 s [vector] ifoldM'_: OK (0.01s)
  7787. 625.17 s [vector] +++ OK, passed 100 tests.
  7788. 625.17 s [vector] all: OK
  7789. 625.17 s [vector] +++ OK, passed 100 tests.
  7790. 625.17 s [vector] any: OK
  7791. 625.17 s [vector] +++ OK, passed 100 tests.
  7792. 625.18 s [vector] prescanl: OK
  7793. 625.18 s [vector] +++ OK, passed 100 tests.
  7794. 625.18 s [vector] prescanl': OK
  7795. 625.18 s [vector] +++ OK, passed 100 tests.
  7796. 625.18 s [vector] postscanl: OK
  7797. 625.18 s [vector] +++ OK, passed 100 tests.
  7798. 625.19 s [vector] postscanl': OK
  7799. 625.19 s [vector] +++ OK, passed 100 tests.
  7800. 625.19 s [vector] scanl: OK
  7801. 625.19 s [vector] +++ OK, passed 100 tests.
  7802. 625.19 s [vector] scanl': OK
  7803. 625.19 s [vector] +++ OK, passed 100 tests.
  7804. 625.19 s [vector] scanl1: OK
  7805. 625.19 s [vector] +++ OK, passed 100 tests.
  7806. 625.20 s [vector] scanl1': OK
  7807. 625.20 s [vector] +++ OK, passed 100 tests.
  7808. 625.20 s [vector] iscanl: OK
  7809. 625.20 s [vector] +++ OK, passed 100 tests.
  7810. 625.20 s [vector] iscanl': OK
  7811. 625.20 s [vector] +++ OK, passed 100 tests.
  7812. 625.20 s [vector] prescanr: OK
  7813. 625.20 s [vector] +++ OK, passed 100 tests.
  7814. 625.22 s [vector] prescanr': OK
  7815. 625.22 s [vector] +++ OK, passed 100 tests.
  7816. 625.22 s [vector] postscanr: OK
  7817. 625.22 s [vector] +++ OK, passed 100 tests.
  7818. 625.22 s [vector] postscanr': OK
  7819. 625.22 s [vector] +++ OK, passed 100 tests.
  7820. 625.22 s [vector] scanr: OK
  7821. 625.22 s [vector] +++ OK, passed 100 tests.
  7822. 625.22 s [vector] scanr': OK
  7823. 625.22 s [vector] +++ OK, passed 100 tests.
  7824. 625.22 s [vector] scanr1: OK
  7825. 625.22 s [vector] +++ OK, passed 100 tests.
  7826. 625.22 s [vector] scanr1': OK
  7827. 625.22 s [vector] +++ OK, passed 100 tests.
  7828. 625.22 s [vector] iscanr: OK
  7829. 625.22 s [vector] +++ OK, passed 100 tests.
  7830. 625.23 s [vector] iscanr': OK
  7831. 625.23 s [vector] +++ OK, passed 100 tests.
  7832. 625.23 s [vector] mut_read: OK
  7833. 625.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7834. 625.23 s [vector] mut_write: OK
  7835. 625.23 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7836. 625.23 s [vector] mut_modify: OK
  7837. 625.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7838. 625.23 s [vector] mut_generate: OK
  7839. 625.24 s [vector] +++ OK, passed 100 tests.
  7840. 625.26 s [vector] mut_generateM: OK (0.01s)
  7841. 625.26 s [vector] +++ OK, passed 100 tests.
  7842. 625.26 s [vector] mut_mapM_: OK (0.01s)
  7843. 625.26 s [vector] +++ OK, passed 100 tests.
  7844. 625.28 s [vector] mut_imapM_: OK (0.01s)
  7845. 625.28 s [vector] +++ OK, passed 100 tests.
  7846. 625.30 s [vector] mut_forM_: OK (0.02s)
  7847. 625.30 s [vector] +++ OK, passed 100 tests.
  7848. 625.31 s [vector] mut_iforM_: OK (0.02s)
  7849. 625.31 s [vector] +++ OK, passed 100 tests.
  7850. 625.31 s [vector] mut_foldr: OK
  7851. 625.31 s [vector] +++ OK, passed 100 tests.
  7852. 625.31 s [vector] mut_foldr': OK
  7853. 625.31 s [vector] +++ OK, passed 100 tests.
  7854. 625.31 s [vector] mut_foldl: OK
  7855. 625.31 s [vector] +++ OK, passed 100 tests.
  7856. 625.31 s [vector] mut_foldl': OK
  7857. 625.31 s [vector] +++ OK, passed 100 tests.
  7858. 625.31 s [vector] mut_ifoldr: OK
  7859. 625.31 s [vector] +++ OK, passed 100 tests.
  7860. 625.32 s [vector] mut_ifoldr': OK
  7861. 625.32 s [vector] +++ OK, passed 100 tests.
  7862. 625.32 s [vector] mut_ifoldl: OK
  7863. 625.32 s [vector] +++ OK, passed 100 tests.
  7864. 625.32 s [vector] mut_ifoldl': OK
  7865. 625.32 s [vector] +++ OK, passed 100 tests.
  7866. 625.33 s [vector] mut_foldM: OK
  7867. 625.33 s [vector] +++ OK, passed 100 tests.
  7868. 625.33 s [vector] mut_foldM': OK
  7869. 625.33 s [vector] +++ OK, passed 100 tests.
  7870. 625.33 s [vector] mut_foldrM: OK
  7871. 625.33 s [vector] +++ OK, passed 100 tests.
  7872. 625.33 s [vector] mut_foldrM': OK
  7873. 625.33 s [vector] +++ OK, passed 100 tests.
  7874. 625.33 s [vector] mut_ifoldM: OK
  7875. 625.33 s [vector] +++ OK, passed 100 tests.
  7876. 625.34 s [vector] mut_ifoldM': OK
  7877. 625.34 s [vector] +++ OK, passed 100 tests.
  7878. 625.34 s [vector] mut_ifoldrM: OK
  7879. 625.34 s [vector] +++ OK, passed 100 tests.
  7880. 625.34 s [vector] mut_ifoldrM': OK
  7881. 625.34 s [vector] +++ OK, passed 100 tests.
  7882. 625.34 s [vector] compare: OK
  7883. 625.34 s [vector] +++ OK, passed 100 tests.
  7884. 625.34 s [vector] maximum: OK
  7885. 625.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7886. 625.34 s [vector] minimum: OK
  7887. 625.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7888. 625.34 s [vector] minIndex: OK
  7889. 625.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7890. 625.34 s [vector] maxIndex: OK
  7891. 625.34 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7892. 625.34 s [vector] maximumBy: OK
  7893. 625.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7894. 625.35 s [vector] minimumBy: OK
  7895. 625.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7896. 625.35 s [vector] maximumOn: OK
  7897. 625.35 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7898. 625.35 s [vector] minimumOn: OK
  7899. 625.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7900. 625.35 s [vector] maxIndexBy: OK
  7901. 625.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7902. 625.35 s [vector] minIndexBy: OK
  7903. 625.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7904. 625.35 s [vector] ListFirstMaxIndexWins: OK
  7905. 625.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7906. 625.35 s [vector] FalseListFirstMaxIndexWins: OK
  7907. 625.35 s [vector] +++ OK, failed as expected. (after 1 test):
  7908. 625.35 s [vector] Exception:
  7909. 625.35 s [vector] Prelude.foldr1: empty list
  7910. 625.35 s [vector] CallStack (from HasCallStack):
  7911. 625.35 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7912. 625.35 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7913. 625.35 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7914. 625.35 s [vector] []
  7915. 625.35 s [vector] zip: OK
  7916. 625.35 s [vector] +++ OK, passed 100 tests.
  7917. 625.35 s [vector] zip3: OK
  7918. 625.35 s [vector] +++ OK, passed 100 tests.
  7919. 625.35 s [vector] unzip: OK
  7920. 625.36 s [vector] +++ OK, passed 100 tests.
  7921. 625.36 s [vector] unzip3: OK
  7922. 625.36 s [vector] +++ OK, passed 100 tests.
  7923. 625.36 s [vector] indexed: OK
  7924. 625.36 s [vector] +++ OK, passed 100 tests.
  7925. 625.36 s [vector] update: OK
  7926. 625.37 s [vector] +++ OK, passed 100 tests.
  7927. 625.37 s [vector] concat: OK (0.01s)
  7928. 625.38 s [vector] +++ OK, passed 100 tests.
  7929. 625.38 s [vector] mempty: OK
  7930. 625.38 s [vector] +++ OK, passed 1 test.
  7931. 625.38 s [vector] mappend: OK
  7932. 625.38 s [vector] +++ OK, passed 100 tests.
  7933. 625.39 s [vector] mconcat: OK (0.01s)
  7934. 625.39 s [vector] +++ OK, passed 100 tests.
  7935. 625.39 s [vector] fmap: OK
  7936. 625.39 s [vector] +++ OK, passed 100 tests.
  7937. 625.39 s [vector] return: OK
  7938. 625.40 s [vector] +++ OK, passed 100 tests.
  7939. 625.41 s [vector] bind: OK (0.02s)
  7940. 625.41 s [vector] +++ OK, passed 100 tests.
  7941. 625.41 s [vector] mzip: OK
  7942. 625.41 s [vector] +++ OK, passed 100 tests.
  7943. 625.41 s [vector] munzip: OK
  7944. 625.41 s [vector] +++ OK, passed 100 tests.
  7945. 625.41 s [vector] applicative_pure: OK
  7946. 625.42 s [vector] +++ OK, passed 100 tests.
  7947. 625.44 s [vector] applicative_appl: OK (0.03s)
  7948. 625.44 s [vector] +++ OK, passed 100 tests.
  7949. 625.44 s [vector] alternative_empty: OK
  7950. 625.45 s [vector] +++ OK, passed 1 test.
  7951. 625.45 s [vector] alternative_or: OK
  7952. 625.46 s [vector] +++ OK, passed 100 tests.
  7953. 625.50 s [vector] sequence: OK (0.04s)
  7954. 625.50 s [vector] +++ OK, passed 100 tests.
  7955. 625.51 s [vector] sequence_: OK (0.03s)
  7956. 625.51 s [vector] +++ OK, passed 100 tests.
  7957. 625.51 s [vector] glength: OK
  7958. 625.51 s [vector] +++ OK, passed 100 tests.
  7959. 625.51 s [vector] and: OK
  7960. 625.51 s [vector] +++ OK, passed 100 tests.
  7961. 625.51 s [vector] or: OK
  7962. 625.52 s [vector] +++ OK, passed 100 tests.
  7963. 625.52 s [vector] Int
  7964. 625.52 s [vector] fromList.toList == id: OK
  7965. 625.52 s [vector] +++ OK, passed 100 tests.
  7966. 625.52 s [vector] toList.fromList == id: OK
  7967. 625.52 s [vector] +++ OK, passed 100 tests.
  7968. 625.52 s [vector] unstream.stream == id: OK
  7969. 625.52 s [vector] +++ OK, passed 100 tests.
  7970. 625.52 s [vector] stream.unstream == id: OK
  7971. 625.52 s [vector] +++ OK, passed 100 tests.
  7972. 625.52 s [vector] eq: OK
  7973. 625.52 s [vector] +++ OK, passed 100 tests.
  7974. 625.52 s [vector] length: OK
  7975. 625.52 s [vector] +++ OK, passed 100 tests.
  7976. 625.52 s [vector] null: OK
  7977. 625.52 s [vector] +++ OK, passed 100 tests.
  7978. 625.52 s [vector] index: OK
  7979. 625.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7980. 625.52 s [vector] safeIndex: OK
  7981. 625.52 s [vector] +++ OK, passed 100 tests.
  7982. 625.52 s [vector] head: OK
  7983. 625.52 s [vector] +++ OK, passed 100 tests; 34 discarded.
  7984. 625.52 s [vector] last: OK
  7985. 625.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7986. 625.52 s [vector] unsafeIndex: OK
  7987. 625.52 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7988. 625.52 s [vector] unsafeHead: OK
  7989. 625.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7990. 625.52 s [vector] unsafeLast: OK
  7991. 625.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7992. 625.53 s [vector] slice: OK
  7993. 625.53 s [vector] +++ OK, passed 100 tests.
  7994. 625.53 s [vector] init: OK
  7995. 625.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7996. 625.53 s [vector] tail: OK
  7997. 625.53 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7998. 625.53 s [vector] take: OK
  7999. 625.53 s [vector] +++ OK, passed 100 tests.
  8000. 625.53 s [vector] drop: OK
  8001. 625.53 s [vector] +++ OK, passed 100 tests.
  8002. 625.53 s [vector] splitAt: OK
  8003. 625.53 s [vector] +++ OK, passed 100 tests.
  8004. 625.53 s [vector] empty: OK
  8005. 625.53 s [vector] +++ OK, passed 1 test.
  8006. 625.53 s [vector] singleton: OK
  8007. 625.53 s [vector] +++ OK, passed 100 tests.
  8008. 625.53 s [vector] replicate: OK
  8009. 625.53 s [vector] +++ OK, passed 100 tests.
  8010. 625.53 s [vector] generate: OK
  8011. 625.53 s [vector] +++ OK, passed 100 tests.
  8012. 625.54 s [vector] iterateN: OK
  8013. 625.54 s [vector] +++ OK, passed 100 tests.
  8014. 625.59 s [vector] iterateNM: OK (0.03s)
  8015. 625.59 s [vector] +++ OK, passed 100 tests.
  8016. 625.60 s [vector] generateM: OK (0.03s)
  8017. 625.60 s [vector] +++ OK, passed 100 tests.
  8018. 625.60 s [vector] replicateM: OK (0.02s)
  8019. 625.60 s [vector] +++ OK, passed 100 tests.
  8020. 625.61 s [vector] create: OK
  8021. 625.61 s [vector] +++ OK, passed 100 tests.
  8022. 625.61 s [vector] createT: OK
  8023. 625.61 s [vector] +++ OK, passed 100 tests.
  8024. 625.61 s [vector] unfoldr: OK
  8025. 625.61 s [vector] +++ OK, passed 100 tests.
  8026. 625.61 s [vector] unfoldrN: OK
  8027. 625.61 s [vector] +++ OK, passed 100 tests.
  8028. 625.61 s [vector] unfoldrExactN: OK
  8029. 625.61 s [vector] +++ OK, passed 100 tests.
  8030. 625.61 s [vector] unfoldrM: OK
  8031. 625.61 s [vector] +++ OK, passed 100 tests.
  8032. 625.62 s [vector] unfoldrNM: OK
  8033. 625.62 s [vector] +++ OK, passed 100 tests.
  8034. 625.73 s [vector] unfoldrExactNM: OK (0.10s)
  8035. 625.73 s [vector] +++ OK, passed 100 tests.
  8036. 625.74 s [vector] constructN: OK (0.02s)
  8037. 625.74 s [vector] +++ OK, passed 100 tests.
  8038. 625.75 s [vector] constructrN: OK (0.01s)
  8039. 625.75 s [vector] +++ OK, passed 100 tests.
  8040. 625.75 s [vector] cons: OK
  8041. 625.75 s [vector] +++ OK, passed 100 tests.
  8042. 625.75 s [vector] snoc: OK
  8043. 625.75 s [vector] +++ OK, passed 100 tests.
  8044. 625.78 s [vector] append: OK
  8045. 625.78 s [vector] +++ OK, passed 100 tests.
  8046. 625.78 s [vector] concat: OK (0.02s)
  8047. 625.78 s [vector] +++ OK, passed 100 tests.
  8048. 625.78 s [vector] force: OK
  8049. 625.78 s [vector] +++ OK, passed 100 tests.
  8050. 625.78 s [vector] upd: OK
  8051. 625.79 s [vector] +++ OK, passed 100 tests.
  8052. 625.79 s [vector] accum: OK
  8053. 625.79 s [vector] +++ OK, passed 100 tests.
  8054. 625.79 s [vector] reverse: OK
  8055. 625.79 s [vector] +++ OK, passed 100 tests.
  8056. 625.79 s [vector] backpermute: OK
  8057. 625.79 s [vector] +++ OK, passed 100 tests.
  8058. 625.79 s [vector] map: OK
  8059. 625.80 s [vector] +++ OK, passed 100 tests.
  8060. 625.80 s [vector] imap: OK
  8061. 625.80 s [vector] +++ OK, passed 100 tests.
  8062. 625.80 s [vector] concatMap: OK
  8063. 625.80 s [vector] +++ OK, passed 100 tests.
  8064. 625.84 s [vector] mapM: OK
  8065. 625.84 s [vector] +++ OK, passed 100 tests.
  8066. 625.84 s [vector] mapM_: OK (0.03s)
  8067. 625.84 s [vector] +++ OK, passed 100 tests.
  8068. 625.84 s [vector] forM: OK
  8069. 625.87 s [vector] +++ OK, passed 100 tests.
  8070. 625.88 s [vector] forM_: OK (0.03s)
  8071. 625.88 s [vector] +++ OK, passed 100 tests.
  8072. 625.88 s [vector] imapM: OK
  8073. 625.88 s [vector] +++ OK, passed 100 tests.
  8074. 625.91 s [vector] imapM_: OK (0.03s)
  8075. 625.91 s [vector] +++ OK, passed 100 tests.
  8076. 625.91 s [vector] zipWith: OK
  8077. 625.91 s [vector] +++ OK, passed 100 tests.
  8078. 625.91 s [vector] zipWith3: OK
  8079. 625.92 s [vector] +++ OK, passed 100 tests.
  8080. 625.92 s [vector] izipWith: OK
  8081. 625.92 s [vector] +++ OK, passed 100 tests.
  8082. 625.93 s [vector] izipWith3: OK
  8083. 625.93 s [vector] +++ OK, passed 100 tests.
  8084. 625.94 s [vector] izipWithM: OK
  8085. 625.94 s [vector] +++ OK, passed 100 tests.
  8086. 625.96 s [vector] izipWithM_: OK (0.03s)
  8087. 625.96 s [vector] +++ OK, passed 100 tests.
  8088. 625.96 s [vector] zipWithM: OK
  8089. 625.98 s [vector] +++ OK, passed 100 tests.
  8090. 625.98 s [vector] zipWithM_: OK (0.02s)
  8091. 625.99 s [vector] +++ OK, passed 100 tests.
  8092. 625.99 s [vector] filter: OK
  8093. 625.99 s [vector] +++ OK, passed 100 tests.
  8094. 626.00 s [vector] ifilter: OK
  8095. 626.00 s [vector] +++ OK, passed 100 tests.
  8096. 626.03 s [vector] filterM: OK (0.04s)
  8097. 626.03 s [vector] +++ OK, passed 100 tests.
  8098. 626.03 s [vector] uniq: OK
  8099. 626.03 s [vector] +++ OK, passed 100 tests.
  8100. 626.05 s [vector] mapMaybe: OK
  8101. 626.05 s [vector] +++ OK, passed 100 tests.
  8102. 626.05 s [vector] imapMaybe: OK
  8103. 626.05 s [vector] +++ OK, passed 100 tests.
  8104. 626.05 s [vector] takeWhile: OK
  8105. 626.05 s [vector] +++ OK, passed 100 tests.
  8106. 626.05 s [vector] dropWhile: OK
  8107. 626.05 s [vector] +++ OK, passed 100 tests.
  8108. 626.05 s [vector] partition: OK
  8109. 626.05 s [vector] +++ OK, passed 100 tests.
  8110. 626.05 s [vector] partitionWith: OK
  8111. 626.05 s [vector] +++ OK, passed 100 tests.
  8112. 626.05 s [vector] span: OK
  8113. 626.05 s [vector] +++ OK, passed 100 tests.
  8114. 626.05 s [vector] break: OK
  8115. 626.05 s [vector] +++ OK, passed 100 tests.
  8116. 626.05 s [vector] spanR: OK
  8117. 626.05 s [vector] +++ OK, passed 100 tests.
  8118. 626.06 s [vector] breakR: OK
  8119. 626.06 s [vector] +++ OK, passed 100 tests.
  8120. 626.06 s [vector] groupBy: OK
  8121. 626.06 s [vector] +++ OK, passed 100 tests.
  8122. 626.06 s [vector] elem: OK
  8123. 626.06 s [vector] +++ OK, passed 100 tests.
  8124. 626.06 s [vector] notElem: OK
  8125. 626.06 s [vector] +++ OK, passed 100 tests.
  8126. 626.06 s [vector] find: OK
  8127. 626.06 s [vector] +++ OK, passed 100 tests.
  8128. 626.06 s [vector] findIndex: OK
  8129. 626.06 s [vector] +++ OK, passed 100 tests.
  8130. 626.06 s [vector] findIndexR: OK
  8131. 626.06 s [vector] +++ OK, passed 100 tests.
  8132. 626.07 s [vector] findIndices: OK
  8133. 626.07 s [vector] +++ OK, passed 100 tests.
  8134. 626.07 s [vector] elemIndex: OK
  8135. 626.07 s [vector] +++ OK, passed 100 tests.
  8136. 626.07 s [vector] elemIndices: OK
  8137. 626.07 s [vector] +++ OK, passed 100 tests.
  8138. 626.08 s [vector] foldl: OK
  8139. 626.08 s [vector] +++ OK, passed 100 tests.
  8140. 626.08 s [vector] foldl1: OK
  8141. 626.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8142. 626.08 s [vector] foldl': OK
  8143. 626.08 s [vector] +++ OK, passed 100 tests.
  8144. 626.08 s [vector] foldl1': OK
  8145. 626.08 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8146. 626.09 s [vector] foldr: OK
  8147. 626.09 s [vector] +++ OK, passed 100 tests.
  8148. 626.09 s [vector] foldr1: OK
  8149. 626.09 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8150. 626.09 s [vector] foldr': OK
  8151. 626.10 s [vector] +++ OK, passed 100 tests.
  8152. 626.10 s [vector] foldr1': OK
  8153. 626.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8154. 626.11 s [vector] ifoldl: OK
  8155. 626.11 s [vector] +++ OK, passed 100 tests.
  8156. 626.12 s [vector] ifoldl': OK
  8157. 626.12 s [vector] +++ OK, passed 100 tests.
  8158. 626.12 s [vector] ifoldr: OK
  8159. 626.12 s [vector] +++ OK, passed 100 tests.
  8160. 626.12 s [vector] ifoldr': OK
  8161. 626.13 s [vector] +++ OK, passed 100 tests.
  8162. 626.13 s [vector] ifoldM: OK
  8163. 626.13 s [vector] +++ OK, passed 100 tests.
  8164. 626.14 s [vector] ifoldM': OK
  8165. 626.14 s [vector] +++ OK, passed 100 tests.
  8166. 626.18 s [vector] ifoldM_: OK (0.03s)
  8167. 626.18 s [vector] +++ OK, passed 100 tests.
  8168. 626.20 s [vector] ifoldM'_: OK (0.03s)
  8169. 626.20 s [vector] +++ OK, passed 100 tests.
  8170. 626.20 s [vector] all: OK
  8171. 626.20 s [vector] +++ OK, passed 100 tests.
  8172. 626.20 s [vector] any: OK
  8173. 626.20 s [vector] +++ OK, passed 100 tests.
  8174. 626.21 s [vector] prescanl: OK
  8175. 626.21 s [vector] +++ OK, passed 100 tests.
  8176. 626.22 s [vector] prescanl': OK
  8177. 626.22 s [vector] +++ OK, passed 100 tests.
  8178. 626.22 s [vector] postscanl: OK
  8179. 626.22 s [vector] +++ OK, passed 100 tests.
  8180. 626.22 s [vector] postscanl': OK
  8181. 626.23 s [vector] +++ OK, passed 100 tests.
  8182. 626.23 s [vector] scanl: OK
  8183. 626.23 s [vector] +++ OK, passed 100 tests.
  8184. 626.24 s [vector] scanl': OK
  8185. 626.24 s [vector] +++ OK, passed 100 tests.
  8186. 626.25 s [vector] scanl1: OK
  8187. 626.26 s [vector] +++ OK, passed 100 tests.
  8188. 626.26 s [vector] scanl1': OK
  8189. 626.26 s [vector] +++ OK, passed 100 tests.
  8190. 626.26 s [vector] iscanl: OK
  8191. 626.29 s [vector] +++ OK, passed 100 tests.
  8192. 626.30 s [vector] iscanl': OK (0.03s)
  8193. 626.30 s [vector] +++ OK, passed 100 tests.
  8194. 626.30 s [vector] prescanr: OK
  8195. 626.30 s [vector] +++ OK, passed 100 tests.
  8196. 626.31 s [vector] prescanr': OK
  8197. 626.31 s [vector] +++ OK, passed 100 tests.
  8198. 626.31 s [vector] postscanr: OK
  8199. 626.31 s [vector] +++ OK, passed 100 tests.
  8200. 626.32 s [vector] postscanr': OK
  8201. 626.32 s [vector] +++ OK, passed 100 tests.
  8202. 626.32 s [vector] scanr: OK
  8203. 626.32 s [vector] +++ OK, passed 100 tests.
  8204. 626.34 s [vector] scanr': OK
  8205. 626.50 s [vector] +++ OK, passed 100 tests.
  8206. 626.50 s [vector] scanr1: OK (0.01s)
  8207. 626.50 s [vector] +++ OK, passed 100 tests.
  8208. 626.50 s [vector] scanr1': OK (0.01s)
  8209. 626.50 s [vector] +++ OK, passed 100 tests.
  8210. 626.50 s [vector] iscanr: OK (0.01s)
  8211. 626.50 s [vector] +++ OK, passed 100 tests.
  8212. 626.50 s [vector] iscanr': OK (0.02s)
  8213. 626.50 s [vector] +++ OK, passed 100 tests.
  8214. 626.50 s [vector] mut_read: OK
  8215. 626.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8216. 626.50 s [vector] mut_write: OK (0.01s)
  8217. 626.50 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8218. 626.50 s [vector] mut_modify: OK (0.01s)
  8219. 626.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8220. 626.50 s [vector] mut_generate: OK
  8221. 626.50 s [vector] +++ OK, passed 100 tests.
  8222. 626.50 s [vector] mut_generateM: OK (0.04s)
  8223. 626.50 s [vector] +++ OK, passed 100 tests.
  8224. 626.54 s [vector] mut_mapM_: OK (0.06s)
  8225. 626.55 s [vector] +++ OK, passed 100 tests.
  8226. 626.81 s [vector] mut_imapM_: OK (0.15s)
  8227. 626.83 s [vector] +++ OK, passed 100 tests.
  8228. 626.84 s [vector] mut_forM_: OK (0.15s)
  8229. 626.84 s [vector] +++ OK, passed 100 tests.
  8230. 627.03 s [vector] mut_iforM_: OK (0.19s)
  8231. 627.03 s [vector] +++ OK, passed 100 tests.
  8232. 627.06 s [vector] mut_foldr: OK (0.02s)
  8233. 627.06 s [vector] +++ OK, passed 100 tests.
  8234. 627.08 s [vector] mut_foldr': OK (0.02s)
  8235. 627.08 s [vector] +++ OK, passed 100 tests.
  8236. 627.08 s [vector] mut_foldl: OK (0.01s)
  8237. 627.08 s [vector] +++ OK, passed 100 tests.
  8238. 627.09 s [vector] mut_foldl': OK (0.01s)
  8239. 627.09 s [vector] +++ OK, passed 100 tests.
  8240. 627.12 s [vector] mut_ifoldr: OK
  8241. 627.12 s [vector] +++ OK, passed 100 tests.
  8242. 627.12 s [vector] mut_ifoldr': OK
  8243. 627.12 s [vector] +++ OK, passed 100 tests.
  8244. 627.14 s [vector] mut_ifoldl: OK
  8245. 627.14 s [vector] +++ OK, passed 100 tests.
  8246. 627.14 s [vector] mut_ifoldl': OK (0.01s)
  8247. 627.15 s [vector] +++ OK, passed 100 tests.
  8248. 627.15 s [vector] mut_foldM: OK
  8249. 627.15 s [vector] +++ OK, passed 100 tests.
  8250. 627.15 s [vector] mut_foldM': OK
  8251. 627.16 s [vector] +++ OK, passed 100 tests.
  8252. 627.16 s [vector] mut_foldrM: OK
  8253. 627.16 s [vector] +++ OK, passed 100 tests.
  8254. 627.18 s [vector] mut_foldrM': OK
  8255. 627.18 s [vector] +++ OK, passed 100 tests.
  8256. 627.20 s [vector] mut_ifoldM: OK (0.03s)
  8257. 627.20 s [vector] +++ OK, passed 100 tests.
  8258. 627.20 s [vector] mut_ifoldM': OK (0.01s)
  8259. 627.20 s [vector] +++ OK, passed 100 tests.
  8260. 627.22 s [vector] mut_ifoldrM: OK
  8261. 627.22 s [vector] +++ OK, passed 100 tests.
  8262. 627.22 s [vector] mut_ifoldrM': OK
  8263. 627.22 s [vector] +++ OK, passed 100 tests.
  8264. 627.22 s [vector] compare: OK
  8265. 627.23 s [vector] +++ OK, passed 100 tests.
  8266. 627.23 s [vector] maximum: OK
  8267. 627.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8268. 627.23 s [vector] minimum: OK
  8269. 627.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8270. 627.23 s [vector] minIndex: OK
  8271. 627.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8272. 627.23 s [vector] maxIndex: OK
  8273. 627.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8274. 627.23 s [vector] maximumBy: OK
  8275. 627.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8276. 627.24 s [vector] minimumBy: OK
  8277. 627.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8278. 627.24 s [vector] maximumOn: OK
  8279. 627.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8280. 627.24 s [vector] minimumOn: OK
  8281. 627.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8282. 627.25 s [vector] maxIndexBy: OK
  8283. 627.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8284. 627.25 s [vector] minIndexBy: OK
  8285. 627.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8286. 627.25 s [vector] ListFirstMaxIndexWins: OK
  8287. 627.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8288. 627.25 s [vector] FalseListFirstMaxIndexWins: OK
  8289. 627.25 s [vector] +++ OK, failed as expected. (after 1 test):
  8290. 627.26 s [vector] Exception:
  8291. 627.26 s [vector] Prelude.foldr1: empty list
  8292. 627.26 s [vector] CallStack (from HasCallStack):
  8293. 627.26 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8294. 627.26 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8295. 627.26 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8296. 627.26 s [vector] []
  8297. 627.26 s [vector] zip: OK
  8298. 627.26 s [vector] +++ OK, passed 100 tests.
  8299. 627.26 s [vector] zip3: OK
  8300. 627.27 s [vector] +++ OK, passed 100 tests.
  8301. 627.27 s [vector] unzip: OK
  8302. 627.27 s [vector] +++ OK, passed 100 tests.
  8303. 627.27 s [vector] unzip3: OK
  8304. 627.28 s [vector] +++ OK, passed 100 tests.
  8305. 627.28 s [vector] indexed: OK
  8306. 627.28 s [vector] +++ OK, passed 100 tests.
  8307. 627.28 s [vector] update: OK
  8308. 627.28 s [vector] +++ OK, passed 100 tests.
  8309. 627.32 s [vector] concat: OK (0.04s)
  8310. 627.32 s [vector] +++ OK, passed 100 tests.
  8311. 627.32 s [vector] mempty: OK
  8312. 627.32 s [vector] +++ OK, passed 1 test.
  8313. 627.34 s [vector] mappend: OK
  8314. 627.34 s [vector] +++ OK, passed 100 tests.
  8315. 627.35 s [vector] mconcat: OK (0.02s)
  8316. 627.35 s [vector] +++ OK, passed 100 tests.
  8317. 627.35 s [vector] fmap: OK
  8318. 627.35 s [vector] +++ OK, passed 100 tests.
  8319. 627.35 s [vector] return: OK
  8320. 627.35 s [vector] +++ OK, passed 100 tests.
  8321. 627.38 s [vector] bind: OK (0.03s)
  8322. 627.38 s [vector] +++ OK, passed 100 tests.
  8323. 627.38 s [vector] mzip: OK
  8324. 627.38 s [vector] +++ OK, passed 100 tests.
  8325. 627.38 s [vector] munzip: OK
  8326. 627.38 s [vector] +++ OK, passed 100 tests.
  8327. 627.38 s [vector] applicative_pure: OK
  8328. 627.39 s [vector] +++ OK, passed 100 tests.
  8329. 627.44 s [vector] applicative_appl: OK (0.06s)
  8330. 627.44 s [vector] +++ OK, passed 100 tests.
  8331. 627.44 s [vector] alternative_empty: OK
  8332. 627.44 s [vector] +++ OK, passed 1 test.
  8333. 627.44 s [vector] alternative_or: OK
  8334. 627.46 s [vector] +++ OK, passed 100 tests.
  8335. 627.54 s [vector] sequence: OK (0.10s)
  8336. 627.54 s [vector] +++ OK, passed 100 tests.
  8337. 627.56 s [vector] sequence_: OK (0.02s)
  8338. 627.56 s [vector] +++ OK, passed 100 tests.
  8339. 627.56 s [vector] glength: OK
  8340. 627.56 s [vector] +++ OK, passed 100 tests.
  8341. 627.56 s [vector] sum: OK
  8342. 627.56 s [vector] +++ OK, passed 100 tests.
  8343. 627.56 s [vector] product: OK
  8344. 627.56 s [vector] +++ OK, passed 100 tests.
  8345. 627.56 s [vector] enumFromN: OK
  8346. 627.56 s [vector] +++ OK, passed 100 tests.
  8347. 627.56 s [vector] enumFromThenN: OK
  8348. 627.56 s [vector] +++ OK, passed 100 tests.
  8349. 627.56 s [vector] enumFromTo: OK
  8350. 627.56 s [vector] +++ OK, passed 100 tests.
  8351. 627.56 s [vector] enumFromThenTo: OK
  8352. 627.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8353. 627.56 s [vector] unstream
  8354. 627.56 s [vector] unstream == vunstream (exact): OK
  8355. 627.56 s [vector] +++ OK, passed 100 tests.
  8356. 627.56 s [vector] unstream == vunstream (unknown): OK
  8357. 627.56 s [vector] +++ OK, passed 100 tests.
  8358. 627.56 s [vector] unstreamR ~= vunstream (exact): OK
  8359. 627.56 s [vector] +++ OK, passed 100 tests.
  8360. 627.56 s [vector] unstreamR ~= vunstream (unknown): OK
  8361. 627.56 s [vector] +++ OK, passed 100 tests.
  8362. 627.56 s [vector] Tests.Vector.Primitive
  8363. 627.56 s [vector] Int
  8364. 627.56 s [vector] fromList.toList == id: OK
  8365. 627.56 s [vector] +++ OK, passed 100 tests.
  8366. 627.56 s [vector] toList.fromList == id: OK
  8367. 627.56 s [vector] +++ OK, passed 100 tests.
  8368. 627.57 s [vector] unstream.stream == id: OK
  8369. 627.57 s [vector] +++ OK, passed 100 tests.
  8370. 627.57 s [vector] stream.unstream == id: OK
  8371. 627.57 s [vector] +++ OK, passed 100 tests.
  8372. 627.57 s [vector] eq: OK
  8373. 627.57 s [vector] +++ OK, passed 100 tests.
  8374. 627.57 s [vector] length: OK
  8375. 627.57 s [vector] +++ OK, passed 100 tests.
  8376. 627.57 s [vector] null: OK
  8377. 627.57 s [vector] +++ OK, passed 100 tests.
  8378. 627.57 s [vector] index: OK
  8379. 627.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8380. 627.57 s [vector] safeIndex: OK
  8381. 627.57 s [vector] +++ OK, passed 100 tests.
  8382. 627.57 s [vector] head: OK
  8383. 627.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8384. 627.57 s [vector] last: OK
  8385. 627.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8386. 627.57 s [vector] unsafeIndex: OK
  8387. 627.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8388. 627.58 s [vector] unsafeHead: OK
  8389. 627.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8390. 627.58 s [vector] unsafeLast: OK
  8391. 627.58 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8392. 627.58 s [vector] slice: OK
  8393. 627.58 s [vector] +++ OK, passed 100 tests.
  8394. 627.58 s [vector] init: OK
  8395. 627.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8396. 627.58 s [vector] tail: OK
  8397. 627.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8398. 627.59 s [vector] take: OK
  8399. 627.59 s [vector] +++ OK, passed 100 tests.
  8400. 627.59 s [vector] drop: OK
  8401. 627.59 s [vector] +++ OK, passed 100 tests.
  8402. 627.59 s [vector] splitAt: OK
  8403. 627.59 s [vector] +++ OK, passed 100 tests.
  8404. 627.60 s [vector] empty: OK
  8405. 627.60 s [vector] +++ OK, passed 1 test.
  8406. 627.60 s [vector] singleton: OK
  8407. 627.60 s [vector] +++ OK, passed 100 tests.
  8408. 627.61 s [vector] replicate: OK
  8409. 627.61 s [vector] +++ OK, passed 100 tests.
  8410. 627.61 s [vector] generate: OK
  8411. 627.61 s [vector] +++ OK, passed 100 tests.
  8412. 627.62 s [vector] iterateN: OK
  8413. 627.62 s [vector] +++ OK, passed 100 tests.
  8414. 627.65 s [vector] iterateNM: OK (0.03s)
  8415. 627.65 s [vector] +++ OK, passed 100 tests.
  8416. 627.66 s [vector] generateM: OK (0.02s)
  8417. 627.66 s [vector] +++ OK, passed 100 tests.
  8418. 627.68 s [vector] replicateM: OK (0.02s)
  8419. 627.68 s [vector] +++ OK, passed 100 tests.
  8420. 627.68 s [vector] create: OK
  8421. 627.68 s [vector] +++ OK, passed 100 tests.
  8422. 627.68 s [vector] createT: OK
  8423. 627.68 s [vector] +++ OK, passed 100 tests.
  8424. 627.68 s [vector] unfoldr: OK
  8425. 627.69 s [vector] +++ OK, passed 100 tests.
  8426. 627.69 s [vector] unfoldrN: OK
  8427. 627.69 s [vector] +++ OK, passed 100 tests.
  8428. 627.69 s [vector] unfoldrExactN: OK
  8429. 627.69 s [vector] +++ OK, passed 100 tests.
  8430. 627.69 s [vector] unfoldrM: OK
  8431. 627.69 s [vector] +++ OK, passed 100 tests.
  8432. 627.69 s [vector] unfoldrNM: OK
  8433. 627.70 s [vector] +++ OK, passed 100 tests.
  8434. 627.71 s [vector] unfoldrExactNM: OK (0.01s)
  8435. 627.74 s [vector] +++ OK, passed 100 tests.
  8436. 627.74 s [vector] constructN: OK
  8437. 627.74 s [vector] +++ OK, passed 100 tests.
  8438. 627.75 s [vector] constructrN: OK
  8439. 627.75 s [vector] +++ OK, passed 100 tests.
  8440. 627.76 s [vector] cons: OK
  8441. 627.76 s [vector] +++ OK, passed 100 tests.
  8442. 627.77 s [vector] snoc: OK (0.01s)
  8443. 627.77 s [vector] +++ OK, passed 100 tests.
  8444. 627.78 s [vector] append: OK (0.01s)
  8445. 627.78 s [vector] +++ OK, passed 100 tests.
  8446. 627.81 s [vector] concat: OK (0.03s)
  8447. 627.81 s [vector] +++ OK, passed 100 tests.
  8448. 627.81 s [vector] force: OK
  8449. 627.81 s [vector] +++ OK, passed 100 tests.
  8450. 627.81 s [vector] upd: OK
  8451. 627.81 s [vector] +++ OK, passed 100 tests.
  8452. 627.82 s [vector] accum: OK
  8453. 627.82 s [vector] +++ OK, passed 100 tests.
  8454. 627.82 s [vector] reverse: OK
  8455. 627.82 s [vector] +++ OK, passed 100 tests.
  8456. 627.82 s [vector] backpermute: OK
  8457. 627.82 s [vector] +++ OK, passed 100 tests.
  8458. 627.83 s [vector] map: OK
  8459. 627.83 s [vector] +++ OK, passed 100 tests.
  8460. 627.83 s [vector] imap: OK
  8461. 627.83 s [vector] +++ OK, passed 100 tests.
  8462. 627.83 s [vector] concatMap: OK
  8463. 627.84 s [vector] +++ OK, passed 100 tests.
  8464. 627.86 s [vector] mapM: OK
  8465. 627.86 s [vector] +++ OK, passed 100 tests.
  8466. 627.89 s [vector] mapM_: OK (0.05s)
  8467. 627.89 s [vector] +++ OK, passed 100 tests.
  8468. 627.89 s [vector] forM: OK
  8469. 627.89 s [vector] +++ OK, passed 100 tests.
  8470. 627.92 s [vector] forM_: OK (0.03s)
  8471. 627.92 s [vector] +++ OK, passed 100 tests.
  8472. 627.93 s [vector] imapM: OK
  8473. 627.93 s [vector] +++ OK, passed 100 tests.
  8474. 627.97 s [vector] imapM_: OK (0.04s)
  8475. 627.97 s [vector] +++ OK, passed 100 tests.
  8476. 627.97 s [vector] zipWith: OK
  8477. 627.98 s [vector] +++ OK, passed 100 tests.
  8478. 627.98 s [vector] zipWith3: OK
  8479. 627.98 s [vector] +++ OK, passed 100 tests.
  8480. 628.09 s [vector] izipWith: OK
  8481. 628.09 s [vector] +++ OK, passed 100 tests.
  8482. 628.09 s [vector] izipWith3: OK
  8483. 628.09 s [vector] +++ OK, passed 100 tests.
  8484. 628.09 s [vector] izipWithM: OK
  8485. 628.09 s [vector] +++ OK, passed 100 tests.
  8486. 628.09 s [vector] izipWithM_: OK (0.02s)
  8487. 628.09 s [vector] +++ OK, passed 100 tests.
  8488. 628.09 s [vector] zipWithM: OK
  8489. 628.09 s [vector] +++ OK, passed 100 tests.
  8490. 628.09 s [vector] zipWithM_: OK (0.06s)
  8491. 628.09 s [vector] +++ OK, passed 100 tests.
  8492. 628.09 s [vector] filter: OK
  8493. 628.09 s [vector] +++ OK, passed 100 tests.
  8494. 628.10 s [vector] ifilter: OK
  8495. 628.10 s [vector] +++ OK, passed 100 tests.
  8496. 628.17 s [vector] filterM: OK (0.07s)
  8497. 628.17 s [vector] +++ OK, passed 100 tests.
  8498. 628.17 s [vector] uniq: OK
  8499. 628.17 s [vector] +++ OK, passed 100 tests.
  8500. 628.17 s [vector] mapMaybe: OK
  8501. 628.17 s [vector] +++ OK, passed 100 tests.
  8502. 628.17 s [vector] imapMaybe: OK
  8503. 628.17 s [vector] +++ OK, passed 100 tests.
  8504. 628.17 s [vector] takeWhile: OK
  8505. 628.17 s [vector] +++ OK, passed 100 tests.
  8506. 628.17 s [vector] dropWhile: OK
  8507. 628.18 s [vector] +++ OK, passed 100 tests.
  8508. 628.18 s [vector] partition: OK
  8509. 628.18 s [vector] +++ OK, passed 100 tests.
  8510. 628.18 s [vector] partitionWith: OK
  8511. 628.18 s [vector] +++ OK, passed 100 tests.
  8512. 628.18 s [vector] span: OK
  8513. 628.18 s [vector] +++ OK, passed 100 tests.
  8514. 628.18 s [vector] break: OK
  8515. 628.18 s [vector] +++ OK, passed 100 tests.
  8516. 628.18 s [vector] spanR: OK
  8517. 628.19 s [vector] +++ OK, passed 100 tests.
  8518. 628.19 s [vector] breakR: OK
  8519. 628.19 s [vector] +++ OK, passed 100 tests.
  8520. 628.19 s [vector] groupBy: OK
  8521. 628.19 s [vector] +++ OK, passed 100 tests.
  8522. 628.19 s [vector] elem: OK
  8523. 628.19 s [vector] +++ OK, passed 100 tests.
  8524. 628.19 s [vector] notElem: OK
  8525. 628.19 s [vector] +++ OK, passed 100 tests.
  8526. 628.19 s [vector] find: OK
  8527. 628.19 s [vector] +++ OK, passed 100 tests.
  8528. 628.19 s [vector] findIndex: OK
  8529. 628.19 s [vector] +++ OK, passed 100 tests.
  8530. 628.20 s [vector] findIndexR: OK
  8531. 628.20 s [vector] +++ OK, passed 100 tests.
  8532. 628.20 s [vector] findIndices: OK
  8533. 628.20 s [vector] +++ OK, passed 100 tests.
  8534. 628.20 s [vector] elemIndex: OK
  8535. 628.20 s [vector] +++ OK, passed 100 tests.
  8536. 628.20 s [vector] elemIndices: OK
  8537. 628.21 s [vector] +++ OK, passed 100 tests.
  8538. 628.21 s [vector] foldl: OK
  8539. 628.21 s [vector] +++ OK, passed 100 tests.
  8540. 628.21 s [vector] foldl1: OK
  8541. 628.21 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8542. 628.21 s [vector] foldl': OK
  8543. 628.22 s [vector] +++ OK, passed 100 tests.
  8544. 628.22 s [vector] foldl1': OK
  8545. 628.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8546. 628.22 s [vector] foldr: OK
  8547. 628.23 s [vector] +++ OK, passed 100 tests.
  8548. 628.23 s [vector] foldr1: OK
  8549. 628.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8550. 628.23 s [vector] foldr': OK
  8551. 628.23 s [vector] +++ OK, passed 100 tests.
  8552. 628.24 s [vector] foldr1': OK
  8553. 628.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8554. 628.24 s [vector] ifoldl: OK
  8555. 628.35 s [vector] +++ OK, passed 100 tests.
  8556. 628.35 s [vector] ifoldl': OK
  8557. 628.35 s [vector] +++ OK, passed 100 tests.
  8558. 628.35 s [vector] ifoldr: OK
  8559. 628.35 s [vector] +++ OK, passed 100 tests.
  8560. 628.35 s [vector] ifoldr': OK
  8561. 628.35 s [vector] +++ OK, passed 100 tests.
  8562. 628.35 s [vector] ifoldM: OK
  8563. 628.35 s [vector] +++ OK, passed 100 tests.
  8564. 628.35 s [vector] ifoldM': OK
  8565. 628.35 s [vector] +++ OK, passed 100 tests.
  8566. 628.35 s [vector] ifoldM_: OK (0.05s)
  8567. 628.35 s [vector] +++ OK, passed 100 tests.
  8568. 628.35 s [vector] ifoldM'_: OK (0.02s)
  8569. 628.35 s [vector] +++ OK, passed 100 tests.
  8570. 628.35 s [vector] all: OK
  8571. 628.35 s [vector] +++ OK, passed 100 tests.
  8572. 628.35 s [vector] any: OK
  8573. 628.35 s [vector] +++ OK, passed 100 tests.
  8574. 628.36 s [vector] prescanl: OK
  8575. 628.36 s [vector] +++ OK, passed 100 tests.
  8576. 628.36 s [vector] prescanl': OK
  8577. 628.36 s [vector] +++ OK, passed 100 tests.
  8578. 628.36 s [vector] postscanl: OK
  8579. 628.36 s [vector] +++ OK, passed 100 tests.
  8580. 628.36 s [vector] postscanl': OK
  8581. 628.37 s [vector] +++ OK, passed 100 tests.
  8582. 628.37 s [vector] scanl: OK
  8583. 628.37 s [vector] +++ OK, passed 100 tests.
  8584. 628.38 s [vector] scanl': OK
  8585. 628.38 s [vector] +++ OK, passed 100 tests.
  8586. 628.38 s [vector] scanl1: OK
  8587. 628.38 s [vector] +++ OK, passed 100 tests.
  8588. 628.41 s [vector] scanl1': OK
  8589. 628.41 s [vector] +++ OK, passed 100 tests.
  8590. 628.41 s [vector] iscanl: OK
  8591. 628.41 s [vector] +++ OK, passed 100 tests.
  8592. 628.41 s [vector] iscanl': OK
  8593. 628.41 s [vector] +++ OK, passed 100 tests.
  8594. 628.41 s [vector] prescanr: OK
  8595. 628.41 s [vector] +++ OK, passed 100 tests.
  8596. 628.41 s [vector] prescanr': OK
  8597. 628.41 s [vector] +++ OK, passed 100 tests.
  8598. 628.42 s [vector] postscanr: OK
  8599. 628.42 s [vector] +++ OK, passed 100 tests.
  8600. 628.42 s [vector] postscanr': OK
  8601. 628.43 s [vector] +++ OK, passed 100 tests.
  8602. 628.43 s [vector] scanr: OK
  8603. 628.43 s [vector] +++ OK, passed 100 tests.
  8604. 628.43 s [vector] scanr': OK
  8605. 628.43 s [vector] +++ OK, passed 100 tests.
  8606. 628.43 s [vector] scanr1: OK
  8607. 628.44 s [vector] +++ OK, passed 100 tests.
  8608. 628.44 s [vector] scanr1': OK
  8609. 628.44 s [vector] +++ OK, passed 100 tests.
  8610. 628.45 s [vector] iscanr: OK
  8611. 628.45 s [vector] +++ OK, passed 100 tests.
  8612. 628.45 s [vector] iscanr': OK
  8613. 628.45 s [vector] +++ OK, passed 100 tests.
  8614. 628.45 s [vector] mut_read: OK
  8615. 628.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8616. 628.45 s [vector] mut_write: OK
  8617. 628.45 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8618. 628.45 s [vector] mut_modify: OK
  8619. 628.45 s [vector] +++ OK, passed 100 tests; 25 discarded.
  8620. 628.46 s [vector] mut_generate: OK
  8621. 628.47 s [vector] +++ OK, passed 100 tests.
  8622. 628.47 s [vector] mut_generateM: OK (0.01s)
  8623. 628.47 s [vector] +++ OK, passed 100 tests.
  8624. 628.51 s [vector] mut_mapM_: OK (0.02s)
  8625. 628.51 s [vector] +++ OK, passed 100 tests.
  8626. 628.53 s [vector] mut_imapM_: OK (0.02s)
  8627. 628.53 s [vector] +++ OK, passed 100 tests.
  8628. 628.55 s [vector] mut_forM_: OK (0.03s)
  8629. 628.56 s [vector] +++ OK, passed 100 tests.
  8630. 628.68 s [vector] mut_iforM_: OK (0.13s)
  8631. 628.68 s [vector] +++ OK, passed 100 tests.
  8632. 628.68 s [vector] mut_foldr: OK
  8633. 628.68 s [vector] +++ OK, passed 100 tests.
  8634. 628.69 s [vector] mut_foldr': OK
  8635. 628.69 s [vector] +++ OK, passed 100 tests.
  8636. 628.69 s [vector] mut_foldl: OK
  8637. 628.69 s [vector] +++ OK, passed 100 tests.
  8638. 628.70 s [vector] mut_foldl': OK
  8639. 628.70 s [vector] +++ OK, passed 100 tests.
  8640. 628.70 s [vector] mut_ifoldr: OK
  8641. 628.70 s [vector] +++ OK, passed 100 tests.
  8642. 628.71 s [vector] mut_ifoldr': OK
  8643. 628.71 s [vector] +++ OK, passed 100 tests.
  8644. 628.71 s [vector] mut_ifoldl: OK
  8645. 628.72 s [vector] +++ OK, passed 100 tests.
  8646. 628.73 s [vector] mut_ifoldl': OK
  8647. 628.73 s [vector] +++ OK, passed 100 tests.
  8648. 628.73 s [vector] mut_foldM: OK
  8649. 628.73 s [vector] +++ OK, passed 100 tests.
  8650. 628.74 s [vector] mut_foldM': OK
  8651. 628.74 s [vector] +++ OK, passed 100 tests.
  8652. 628.74 s [vector] mut_foldrM: OK
  8653. 628.74 s [vector] +++ OK, passed 100 tests.
  8654. 628.74 s [vector] mut_foldrM': OK
  8655. 628.75 s [vector] +++ OK, passed 100 tests.
  8656. 628.75 s [vector] mut_ifoldM: OK
  8657. 628.75 s [vector] +++ OK, passed 100 tests.
  8658. 628.76 s [vector] mut_ifoldM': OK
  8659. 628.76 s [vector] +++ OK, passed 100 tests.
  8660. 628.76 s [vector] mut_ifoldrM: OK
  8661. 628.77 s [vector] +++ OK, passed 100 tests.
  8662. 628.77 s [vector] mut_ifoldrM': OK
  8663. 628.77 s [vector] +++ OK, passed 100 tests.
  8664. 628.77 s [vector] compare: OK
  8665. 628.77 s [vector] +++ OK, passed 100 tests.
  8666. 628.77 s [vector] maximum: OK
  8667. 628.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8668. 628.77 s [vector] minimum: OK
  8669. 628.77 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8670. 628.77 s [vector] minIndex: OK
  8671. 628.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8672. 628.77 s [vector] maxIndex: OK
  8673. 628.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8674. 628.78 s [vector] maximumBy: OK
  8675. 628.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8676. 628.78 s [vector] minimumBy: OK
  8677. 628.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8678. 628.78 s [vector] maximumOn: OK
  8679. 628.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8680. 628.78 s [vector] minimumOn: OK
  8681. 628.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8682. 628.78 s [vector] maxIndexBy: OK
  8683. 628.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8684. 628.79 s [vector] minIndexBy: OK
  8685. 628.79 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8686. 628.79 s [vector] ListFirstMaxIndexWins: OK
  8687. 628.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8688. 628.79 s [vector] FalseListFirstMaxIndexWins: OK
  8689. 628.79 s [vector] +++ OK, failed as expected. (after 1 test):
  8690. 628.79 s [vector] Exception:
  8691. 628.79 s [vector] Prelude.foldr1: empty list
  8692. 628.79 s [vector] CallStack (from HasCallStack):
  8693. 628.79 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8694. 628.79 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8695. 628.79 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8696. 628.79 s [vector] []
  8697. 628.79 s [vector] mempty: OK
  8698. 628.79 s [vector] +++ OK, passed 1 test.
  8699. 628.81 s [vector] mappend: OK
  8700. 628.81 s [vector] +++ OK, passed 100 tests.
  8701. 628.84 s [vector] mconcat: OK (0.04s)
  8702. 628.84 s [vector] +++ OK, passed 100 tests.
  8703. 628.84 s [vector] glength: OK
  8704. 628.84 s [vector] +++ OK, passed 100 tests.
  8705. 628.84 s [vector] sum: OK
  8706. 628.84 s [vector] +++ OK, passed 100 tests.
  8707. 628.84 s [vector] product: OK
  8708. 628.84 s [vector] +++ OK, passed 100 tests.
  8709. 628.84 s [vector] enumFromN: OK
  8710. 628.84 s [vector] +++ OK, passed 100 tests.
  8711. 628.84 s [vector] enumFromThenN: OK
  8712. 628.84 s [vector] +++ OK, passed 100 tests.
  8713. 628.84 s [vector] enumFromTo: OK
  8714. 628.85 s [vector] +++ OK, passed 100 tests.
  8715. 628.85 s [vector] enumFromThenTo: OK
  8716. 628.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8717. 628.85 s [vector] Double
  8718. 628.85 s [vector] fromList.toList == id: OK
  8719. 628.85 s [vector] +++ OK, passed 100 tests.
  8720. 628.85 s [vector] toList.fromList == id: OK
  8721. 628.85 s [vector] +++ OK, passed 100 tests.
  8722. 628.85 s [vector] unstream.stream == id: OK
  8723. 628.85 s [vector] +++ OK, passed 100 tests.
  8724. 628.86 s [vector] stream.unstream == id: OK
  8725. 628.86 s [vector] +++ OK, passed 100 tests.
  8726. 628.86 s [vector] eq: OK
  8727. 628.86 s [vector] +++ OK, passed 100 tests.
  8728. 628.86 s [vector] length: OK
  8729. 628.86 s [vector] +++ OK, passed 100 tests.
  8730. 628.86 s [vector] null: OK
  8731. 628.86 s [vector] +++ OK, passed 100 tests.
  8732. 628.86 s [vector] index: OK
  8733. 628.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8734. 628.87 s [vector] safeIndex: OK
  8735. 628.87 s [vector] +++ OK, passed 100 tests.
  8736. 628.87 s [vector] head: OK
  8737. 628.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8738. 628.87 s [vector] last: OK
  8739. 628.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8740. 628.89 s [vector] unsafeIndex: OK
  8741. 628.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8742. 628.89 s [vector] unsafeHead: OK
  8743. 628.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8744. 628.89 s [vector] unsafeLast: OK
  8745. 628.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8746. 628.90 s [vector] slice: OK
  8747. 628.90 s [vector] +++ OK, passed 100 tests.
  8748. 628.90 s [vector] init: OK
  8749. 628.90 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8750. 628.90 s [vector] tail: OK
  8751. 628.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8752. 628.90 s [vector] take: OK
  8753. 628.90 s [vector] +++ OK, passed 100 tests.
  8754. 628.91 s [vector] drop: OK
  8755. 628.91 s [vector] +++ OK, passed 100 tests.
  8756. 628.91 s [vector] splitAt: OK
  8757. 628.91 s [vector] +++ OK, passed 100 tests.
  8758. 628.91 s [vector] empty: OK
  8759. 628.91 s [vector] +++ OK, passed 1 test.
  8760. 628.91 s [vector] singleton: OK
  8761. 628.91 s [vector] +++ OK, passed 100 tests.
  8762. 628.91 s [vector] replicate: OK
  8763. 628.91 s [vector] +++ OK, passed 100 tests.
  8764. 628.92 s [vector] generate: OK
  8765. 628.92 s [vector] +++ OK, passed 100 tests.
  8766. 628.92 s [vector] iterateN: OK
  8767. 628.93 s [vector] +++ OK, passed 100 tests.
  8768. 629.01 s [vector] iterateNM: OK (0.08s)
  8769. 629.01 s [vector] +++ OK, passed 100 tests.
  8770. 629.07 s [vector] generateM: OK (0.07s)
  8771. 629.07 s [vector] +++ OK, passed 100 tests.
  8772. 629.13 s [vector] replicateM: OK (0.05s)
  8773. 629.13 s [vector] +++ OK, passed 100 tests.
  8774. 629.13 s [vector] create: OK
  8775. 629.13 s [vector] +++ OK, passed 100 tests.
  8776. 629.13 s [vector] createT: OK
  8777. 629.13 s [vector] +++ OK, passed 100 tests.
  8778. 629.13 s [vector] unfoldr: OK
  8779. 629.13 s [vector] +++ OK, passed 100 tests.
  8780. 629.14 s [vector] unfoldrN: OK
  8781. 629.14 s [vector] +++ OK, passed 100 tests.
  8782. 629.14 s [vector] unfoldrExactN: OK
  8783. 629.14 s [vector] +++ OK, passed 100 tests.
  8784. 629.14 s [vector] unfoldrM: OK
  8785. 629.14 s [vector] +++ OK, passed 100 tests.
  8786. 629.14 s [vector] unfoldrNM: OK
  8787. 629.15 s [vector] +++ OK, passed 100 tests.
  8788. 629.17 s [vector] unfoldrExactNM: OK (0.02s)
  8789. 629.17 s [vector] +++ OK, passed 100 tests.
  8790. 629.19 s [vector] constructN: OK (0.02s)
  8791. 629.19 s [vector] +++ OK, passed 100 tests.
  8792. 629.23 s [vector] constructrN: OK (0.04s)
  8793. 629.23 s [vector] +++ OK, passed 100 tests.
  8794. 629.23 s [vector] cons: OK
  8795. 629.23 s [vector] +++ OK, passed 100 tests.
  8796. 629.23 s [vector] snoc: OK
  8797. 629.24 s [vector] +++ OK, passed 100 tests.
  8798. 629.24 s [vector] append: OK
  8799. 629.25 s [vector] +++ OK, passed 100 tests.
  8800. 629.28 s [vector] concat: OK (0.05s)
  8801. 629.28 s [vector] +++ OK, passed 100 tests.
  8802. 629.29 s [vector] force: OK
  8803. 629.29 s [vector] +++ OK, passed 100 tests.
  8804. 629.29 s [vector] upd: OK
  8805. 629.29 s [vector] +++ OK, passed 100 tests.
  8806. 629.33 s [vector] accum: OK (0.04s)
  8807. 629.33 s [vector] +++ OK, passed 100 tests.
  8808. 629.33 s [vector] reverse: OK
  8809. 629.33 s [vector] +++ OK, passed 100 tests.
  8810. 629.33 s [vector] backpermute: OK
  8811. 629.35 s [vector] +++ OK, passed 100 tests.
  8812. 629.35 s [vector] map: OK (0.01s)
  8813. 629.35 s [vector] +++ OK, passed 100 tests.
  8814. 629.37 s [vector] imap: OK (0.01s)
  8815. 629.37 s [vector] +++ OK, passed 100 tests.
  8816. 629.39 s [vector] concatMap: OK
  8817. 629.39 s [vector] +++ OK, passed 100 tests.
  8818. 629.41 s [vector] mapM: OK (0.02s)
  8819. 629.41 s [vector] +++ OK, passed 100 tests.
  8820. 629.49 s [vector] mapM_: OK (0.08s)
  8821. 629.49 s [vector] +++ OK, passed 100 tests.
  8822. 629.52 s [vector] forM: OK (0.02s)
  8823. 629.52 s [vector] +++ OK, passed 100 tests.
  8824. 629.61 s [vector] forM_: OK (0.09s)
  8825. 629.61 s [vector] +++ OK, passed 100 tests.
  8826. 629.62 s [vector] imapM: OK (0.02s)
  8827. 629.62 s [vector] +++ OK, passed 100 tests.
  8828. 629.71 s [vector] imapM_: OK (0.10s)
  8829. 629.71 s [vector] +++ OK, passed 100 tests.
  8830. 629.73 s [vector] zipWith: OK (0.02s)
  8831. 629.73 s [vector] +++ OK, passed 100 tests.
  8832. 629.75 s [vector] zipWith3: OK (0.02s)
  8833. 629.75 s [vector] +++ OK, passed 100 tests.
  8834. 629.77 s [vector] izipWith: OK (0.02s)
  8835. 629.77 s [vector] +++ OK, passed 100 tests.
  8836. 629.79 s [vector] izipWith3: OK (0.02s)
  8837. 629.79 s [vector] +++ OK, passed 100 tests.
  8838. 629.81 s [vector] izipWithM: OK (0.02s)
  8839. 629.81 s [vector] +++ OK, passed 100 tests.
  8840. 629.89 s [vector] izipWithM_: OK (0.08s)
  8841. 629.89 s [vector] +++ OK, passed 100 tests.
  8842. 629.91 s [vector] zipWithM: OK (0.02s)
  8843. 629.91 s [vector] +++ OK, passed 100 tests.
  8844. 629.97 s [vector] zipWithM_: OK (0.06s)
  8845. 629.97 s [vector] +++ OK, passed 100 tests.
  8846. 629.99 s [vector] filter: OK (0.01s)
  8847. 629.99 s [vector] +++ OK, passed 100 tests.
  8848. 630.01 s [vector] ifilter: OK (0.01s)
  8849. 630.01 s [vector] +++ OK, passed 100 tests.
  8850. 630.10 s [vector] filterM: OK (0.11s)
  8851. 630.10 s [vector] +++ OK, passed 100 tests.
  8852. 630.11 s [vector] uniq: OK
  8853. 630.11 s [vector] +++ OK, passed 100 tests.
  8854. 630.13 s [vector] mapMaybe: OK (0.01s)
  8855. 630.13 s [vector] +++ OK, passed 100 tests.
  8856. 630.14 s [vector] imapMaybe: OK (0.01s)
  8857. 630.14 s [vector] +++ OK, passed 100 tests.
  8858. 630.14 s [vector] takeWhile: OK
  8859. 630.14 s [vector] +++ OK, passed 100 tests.
  8860. 630.15 s [vector] dropWhile: OK
  8861. 630.15 s [vector] +++ OK, passed 100 tests.
  8862. 630.17 s [vector] partition: OK (0.02s)
  8863. 630.17 s [vector] +++ OK, passed 100 tests.
  8864. 630.17 s [vector] partitionWith: OK (0.02s)
  8865. 630.17 s [vector] +++ OK, passed 100 tests.
  8866. 630.19 s [vector] span: OK
  8867. 630.19 s [vector] +++ OK, passed 100 tests.
  8868. 630.19 s [vector] break: OK
  8869. 630.19 s [vector] +++ OK, passed 100 tests.
  8870. 630.19 s [vector] spanR: OK
  8871. 630.19 s [vector] +++ OK, passed 100 tests.
  8872. 630.19 s [vector] breakR: OK
  8873. 630.21 s [vector] +++ OK, passed 100 tests.
  8874. 630.22 s [vector] groupBy: OK (0.02s)
  8875. 630.22 s [vector] +++ OK, passed 100 tests.
  8876. 630.22 s [vector] elem: OK
  8877. 630.22 s [vector] +++ OK, passed 100 tests.
  8878. 630.22 s [vector] notElem: OK
  8879. 630.22 s [vector] +++ OK, passed 100 tests.
  8880. 630.22 s [vector] find: OK
  8881. 630.23 s [vector] +++ OK, passed 100 tests.
  8882. 630.23 s [vector] findIndex: OK
  8883. 630.23 s [vector] +++ OK, passed 100 tests.
  8884. 630.23 s [vector] findIndexR: OK
  8885. 630.23 s [vector] +++ OK, passed 100 tests.
  8886. 630.25 s [vector] findIndices: OK
  8887. 630.25 s [vector] +++ OK, passed 100 tests.
  8888. 630.25 s [vector] elemIndex: OK
  8889. 630.25 s [vector] +++ OK, passed 100 tests.
  8890. 630.25 s [vector] elemIndices: OK
  8891. 630.25 s [vector] +++ OK, passed 100 tests.
  8892. 630.28 s [vector] foldl: OK (0.03s)
  8893. 630.28 s [vector] +++ OK, passed 100 tests.
  8894. 630.31 s [vector] foldl1: OK (0.01s)
  8895. 630.31 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8896. 630.35 s [vector] foldl': OK (0.03s)
  8897. 630.35 s [vector] +++ OK, passed 100 tests.
  8898. 630.37 s [vector] foldl1': OK (0.03s)
  8899. 630.37 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8900. 630.39 s [vector] foldr: OK (0.03s)
  8901. 630.39 s [vector] +++ OK, passed 100 tests.
  8902. 630.41 s [vector] foldr1: OK (0.03s)
  8903. 630.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8904. 630.45 s [vector] foldr': OK (0.02s)
  8905. 630.45 s [vector] +++ OK, passed 100 tests.
  8906. 630.47 s [vector] foldr1': OK (0.02s)
  8907. 630.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8908. 630.51 s [vector] ifoldl: OK (0.04s)
  8909. 630.51 s [vector] +++ OK, passed 100 tests.
  8910. 630.53 s [vector] ifoldl': OK (0.02s)
  8911. 630.53 s [vector] +++ OK, passed 100 tests.
  8912. 630.55 s [vector] ifoldr: OK (0.03s)
  8913. 630.56 s [vector] +++ OK, passed 100 tests.
  8914. 630.58 s [vector] ifoldr': OK (0.03s)
  8915. 630.58 s [vector] +++ OK, passed 100 tests.
  8916. 630.63 s [vector] ifoldM: OK (0.01s)
  8917. 630.63 s [vector] +++ OK, passed 100 tests.
  8918. 630.63 s [vector] ifoldM': OK (0.03s)
  8919. 630.63 s [vector] +++ OK, passed 100 tests.
  8920. 630.71 s [vector] ifoldM_: OK (0.07s)
  8921. 630.71 s [vector] +++ OK, passed 100 tests.
  8922. 630.80 s [vector] ifoldM'_: OK (0.09s)
  8923. 630.80 s [vector] +++ OK, passed 100 tests.
  8924. 630.80 s [vector] all: OK
  8925. 630.80 s [vector] +++ OK, passed 100 tests.
  8926. 630.80 s [vector] any: OK
  8927. 630.81 s [vector] +++ OK, passed 100 tests.
  8928. 630.83 s [vector] prescanl: OK (0.02s)
  8929. 630.83 s [vector] +++ OK, passed 100 tests.
  8930. 630.85 s [vector] prescanl': OK (0.03s)
  8931. 630.85 s [vector] +++ OK, passed 100 tests.
  8932. 630.89 s [vector] postscanl: OK (0.03s)
  8933. 630.89 s [vector] +++ OK, passed 100 tests.
  8934. 630.99 s [vector] postscanl': OK (0.10s)
  8935. 630.99 s [vector] +++ OK, passed 100 tests.
  8936. 631.04 s [vector] scanl: OK (0.03s)
  8937. 631.04 s [vector] +++ OK, passed 100 tests.
  8938. 631.07 s [vector] scanl': OK (0.03s)
  8939. 631.07 s [vector] +++ OK, passed 100 tests.
  8940. 631.09 s [vector] scanl1: OK (0.03s)
  8941. 631.09 s [vector] +++ OK, passed 100 tests.
  8942. 631.13 s [vector] scanl1': OK (0.03s)
  8943. 631.13 s [vector] +++ OK, passed 100 tests.
  8944. 631.17 s [vector] iscanl: OK (0.03s)
  8945. 631.18 s [vector] +++ OK, passed 100 tests.
  8946. 631.19 s [vector] iscanl': OK (0.03s)
  8947. 631.19 s [vector] +++ OK, passed 100 tests.
  8948. 631.25 s [vector] prescanr: OK (0.07s)
  8949. 631.26 s [vector] +++ OK, passed 100 tests.
  8950. 631.29 s [vector] prescanr': OK (0.01s)
  8951. 631.29 s [vector] +++ OK, passed 100 tests.
  8952. 631.33 s [vector] postscanr: OK (0.03s)
  8953. 631.34 s [vector] +++ OK, passed 100 tests.
  8954. 631.35 s [vector] postscanr': OK (0.03s)
  8955. 631.46 s [vector] +++ OK, passed 100 tests.
  8956. 631.46 s [vector] scanr: OK (0.03s)
  8957. 631.46 s [vector] +++ OK, passed 100 tests.
  8958. 631.46 s [vector] scanr': OK (0.03s)
  8959. 631.46 s [vector] +++ OK, passed 100 tests.
  8960. 631.46 s [vector] scanr1: OK (0.03s)
  8961. 631.46 s [vector] +++ OK, passed 100 tests.
  8962. 631.48 s [vector] scanr1': OK (0.03s)
  8963. 631.48 s [vector] +++ OK, passed 100 tests.
  8964. 631.52 s [vector] iscanr: OK (0.03s)
  8965. 631.52 s [vector] +++ OK, passed 100 tests.
  8966. 631.53 s [vector] iscanr': OK (0.03s)
  8967. 631.53 s [vector] +++ OK, passed 100 tests.
  8968. 631.53 s [vector] mut_read: OK
  8969. 631.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8970. 631.54 s [vector] mut_write: OK
  8971. 631.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8972. 631.54 s [vector] mut_modify: OK
  8973. 631.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8974. 631.54 s [vector] mut_generate: OK
  8975. 631.56 s [vector] +++ OK, passed 100 tests.
  8976. 631.57 s [vector] mut_generateM: OK (0.03s)
  8977. 631.57 s [vector] +++ OK, passed 100 tests.
  8978. 631.66 s [vector] mut_mapM_: OK (0.07s)
  8979. 631.66 s [vector] +++ OK, passed 100 tests.
  8980. 631.72 s [vector] mut_imapM_: OK (0.07s)
  8981. 631.73 s [vector] +++ OK, passed 100 tests.
  8982. 631.82 s [vector] mut_forM_: OK (0.09s)
  8983. 631.82 s [vector] +++ OK, passed 100 tests.
  8984. 631.90 s [vector] mut_iforM_: OK (0.08s)
  8985. 631.90 s [vector] +++ OK, passed 100 tests.
  8986. 631.94 s [vector] mut_foldr: OK (0.04s)
  8987. 631.94 s [vector] +++ OK, passed 100 tests.
  8988. 631.96 s [vector] mut_foldr': OK (0.02s)
  8989. 631.96 s [vector] +++ OK, passed 100 tests.
  8990. 631.99 s [vector] mut_foldl: OK (0.03s)
  8991. 631.99 s [vector] +++ OK, passed 100 tests.
  8992. 632.02 s [vector] mut_foldl': OK (0.03s)
  8993. 632.02 s [vector] +++ OK, passed 100 tests.
  8994. 632.04 s [vector] mut_ifoldr: OK (0.03s)
  8995. 632.04 s [vector] +++ OK, passed 100 tests.
  8996. 632.09 s [vector] mut_ifoldr': OK (0.03s)
  8997. 632.09 s [vector] +++ OK, passed 100 tests.
  8998. 632.10 s [vector] mut_ifoldl: OK (0.04s)
  8999. 632.10 s [vector] +++ OK, passed 100 tests.
  9000. 632.14 s [vector] mut_ifoldl': OK (0.01s)
  9001. 632.14 s [vector] +++ OK, passed 100 tests.
  9002. 632.19 s [vector] mut_foldM: OK (0.03s)
  9003. 632.19 s [vector] +++ OK, passed 100 tests.
  9004. 632.20 s [vector] mut_foldM': OK (0.03s)
  9005. 632.21 s [vector] +++ OK, passed 100 tests.
  9006. 632.24 s [vector] mut_foldrM: OK (0.03s)
  9007. 632.24 s [vector] +++ OK, passed 100 tests.
  9008. 632.26 s [vector] mut_foldrM': OK (0.02s)
  9009. 632.26 s [vector] +++ OK, passed 100 tests.
  9010. 632.29 s [vector] mut_ifoldM: OK (0.03s)
  9011. 632.29 s [vector] +++ OK, passed 100 tests.
  9012. 632.32 s [vector] mut_ifoldM': OK (0.03s)
  9013. 632.32 s [vector] +++ OK, passed 100 tests.
  9014. 632.34 s [vector] mut_ifoldrM: OK (0.02s)
  9015. 632.34 s [vector] +++ OK, passed 100 tests.
  9016. 632.36 s [vector] mut_ifoldrM': OK (0.02s)
  9017. 632.36 s [vector] +++ OK, passed 100 tests.
  9018. 632.36 s [vector] compare: OK
  9019. 632.36 s [vector] +++ OK, passed 100 tests.
  9020. 632.36 s [vector] maximum: OK
  9021. 632.36 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9022. 632.36 s [vector] minimum: OK
  9023. 632.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9024. 632.36 s [vector] minIndex: OK
  9025. 632.37 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9026. 632.37 s [vector] maxIndex: OK
  9027. 632.37 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9028. 632.37 s [vector] maximumBy: OK
  9029. 632.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9030. 632.37 s [vector] minimumBy: OK
  9031. 632.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9032. 632.37 s [vector] maximumOn: OK
  9033. 632.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9034. 632.38 s [vector] minimumOn: OK
  9035. 632.38 s [vector] +++ OK, passed 100 tests; 26 discarded.
  9036. 632.38 s [vector] maxIndexBy: OK
  9037. 632.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9038. 632.38 s [vector] minIndexBy: OK
  9039. 632.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9040. 632.38 s [vector] ListFirstMaxIndexWins: OK
  9041. 632.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9042. 632.39 s [vector] FalseListFirstMaxIndexWins: OK
  9043. 632.39 s [vector] +++ OK, failed as expected. (after 1 test):
  9044. 632.39 s [vector] Exception:
  9045. 632.39 s [vector] Prelude.foldr1: empty list
  9046. 632.39 s [vector] CallStack (from HasCallStack):
  9047. 632.39 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9048. 632.39 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9049. 632.39 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9050. 632.39 s [vector] []
  9051. 632.39 s [vector] mempty: OK
  9052. 632.39 s [vector] +++ OK, passed 1 test.
  9053. 632.40 s [vector] mappend: OK
  9054. 632.40 s [vector] +++ OK, passed 100 tests.
  9055. 632.43 s [vector] mconcat: OK (0.04s)
  9056. 632.43 s [vector] +++ OK, passed 100 tests.
  9057. 632.43 s [vector] glength: OK
  9058. 632.43 s [vector] +++ OK, passed 100 tests.
  9059. 632.43 s [vector] sum: OK
  9060. 632.44 s [vector] +++ OK, passed 100 tests.
  9061. 632.44 s [vector] product: OK
  9062. 632.44 s [vector] +++ OK, passed 100 tests.
  9063. 632.44 s [vector] enumFromN: OK
  9064. 632.44 s [vector] +++ OK, passed 100 tests.
  9065. 632.44 s [vector] enumFromThenN: OK
  9066. 632.44 s [vector] +++ OK, passed 100 tests.
  9067. 632.44 s [vector] enumFromTo: OK
  9068. 632.44 s [vector] +++ OK, passed 100 tests.
  9069. 632.44 s [vector] enumFromThenTo: OK
  9070. 632.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9071. 632.44 s [vector] unstream
  9072. 632.44 s [vector] unstream == vunstream (exact): OK
  9073. 632.44 s [vector] +++ OK, passed 100 tests.
  9074. 632.46 s [vector] unstream == vunstream (unknown): OK
  9075. 632.46 s [vector] +++ OK, passed 100 tests.
  9076. 632.46 s [vector] unstreamR ~= vunstream (exact): OK
  9077. 632.46 s [vector] +++ OK, passed 100 tests.
  9078. 632.46 s [vector] unstreamR ~= vunstream (unknown): OK
  9079. 632.46 s [vector] +++ OK, passed 100 tests.
  9080. 632.46 s [vector] Tests.Vector.Storable
  9081. 632.46 s [vector] Data.Vector.Storable.Vector (Int)
  9082. 632.46 s [vector] fromList.toList == id: OK
  9083. 632.46 s [vector] +++ OK, passed 100 tests.
  9084. 632.46 s [vector] toList.fromList == id: OK
  9085. 632.46 s [vector] +++ OK, passed 100 tests.
  9086. 632.46 s [vector] unstream.stream == id: OK
  9087. 632.46 s [vector] +++ OK, passed 100 tests.
  9088. 632.46 s [vector] stream.unstream == id: OK
  9089. 632.46 s [vector] +++ OK, passed 100 tests.
  9090. 632.46 s [vector] eq: OK
  9091. 632.46 s [vector] +++ OK, passed 100 tests.
  9092. 632.46 s [vector] length: OK
  9093. 632.46 s [vector] +++ OK, passed 100 tests.
  9094. 632.46 s [vector] null: OK
  9095. 632.46 s [vector] +++ OK, passed 100 tests.
  9096. 632.46 s [vector] index: OK
  9097. 632.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9098. 632.46 s [vector] safeIndex: OK
  9099. 632.46 s [vector] +++ OK, passed 100 tests.
  9100. 632.46 s [vector] head: OK
  9101. 632.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9102. 632.46 s [vector] last: OK
  9103. 632.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9104. 632.46 s [vector] unsafeIndex: OK
  9105. 632.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9106. 632.46 s [vector] unsafeHead: OK
  9107. 632.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9108. 632.46 s [vector] unsafeLast: OK
  9109. 632.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9110. 632.50 s [vector] slice: OK
  9111. 632.50 s [vector] +++ OK, passed 100 tests.
  9112. 632.50 s [vector] init: OK
  9113. 632.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9114. 632.50 s [vector] tail: OK
  9115. 632.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9116. 632.50 s [vector] take: OK
  9117. 632.50 s [vector] +++ OK, passed 100 tests.
  9118. 632.50 s [vector] drop: OK
  9119. 632.50 s [vector] +++ OK, passed 100 tests.
  9120. 632.50 s [vector] splitAt: OK
  9121. 632.50 s [vector] +++ OK, passed 100 tests.
  9122. 632.50 s [vector] empty: OK
  9123. 632.50 s [vector] +++ OK, passed 1 test.
  9124. 632.50 s [vector] singleton: OK
  9125. 632.50 s [vector] +++ OK, passed 100 tests.
  9126. 632.50 s [vector] replicate: OK
  9127. 632.50 s [vector] +++ OK, passed 100 tests.
  9128. 632.50 s [vector] generate: OK
  9129. 632.50 s [vector] +++ OK, passed 100 tests.
  9130. 632.50 s [vector] iterateN: OK
  9131. 632.50 s [vector] +++ OK, passed 100 tests.
  9132. 632.52 s [vector] iterateNM: OK (0.03s)
  9133. 632.52 s [vector] +++ OK, passed 100 tests.
  9134. 632.54 s [vector] generateM: OK (0.02s)
  9135. 632.54 s [vector] +++ OK, passed 100 tests.
  9136. 632.55 s [vector] replicateM: OK (0.01s)
  9137. 632.55 s [vector] +++ OK, passed 100 tests.
  9138. 632.55 s [vector] create: OK
  9139. 632.55 s [vector] +++ OK, passed 100 tests.
  9140. 632.55 s [vector] createT: OK
  9141. 632.56 s [vector] +++ OK, passed 100 tests.
  9142. 632.56 s [vector] unfoldr: OK
  9143. 632.56 s [vector] +++ OK, passed 100 tests.
  9144. 632.56 s [vector] unfoldrN: OK
  9145. 632.56 s [vector] +++ OK, passed 100 tests.
  9146. 632.56 s [vector] unfoldrExactN: OK
  9147. 632.56 s [vector] +++ OK, passed 100 tests.
  9148. 632.56 s [vector] unfoldrM: OK
  9149. 632.56 s [vector] +++ OK, passed 100 tests.
  9150. 632.56 s [vector] unfoldrNM: OK
  9151. 632.56 s [vector] +++ OK, passed 100 tests.
  9152. 632.60 s [vector] unfoldrExactNM: OK (0.04s)
  9153. 632.60 s [vector] +++ OK, passed 100 tests.
  9154. 632.61 s [vector] constructN: OK (0.01s)
  9155. 632.61 s [vector] +++ OK, passed 100 tests.
  9156. 632.61 s [vector] constructrN: OK
  9157. 632.62 s [vector] +++ OK, passed 100 tests.
  9158. 632.62 s [vector] cons: OK
  9159. 632.62 s [vector] +++ OK, passed 100 tests.
  9160. 632.62 s [vector] snoc: OK
  9161. 632.62 s [vector] +++ OK, passed 100 tests.
  9162. 632.62 s [vector] append: OK
  9163. 632.62 s [vector] +++ OK, passed 100 tests.
  9164. 632.65 s [vector] concat: OK (0.03s)
  9165. 632.65 s [vector] +++ OK, passed 100 tests.
  9166. 632.65 s [vector] force: OK
  9167. 632.65 s [vector] +++ OK, passed 100 tests.
  9168. 632.66 s [vector] upd: OK
  9169. 632.66 s [vector] +++ OK, passed 100 tests.
  9170. 632.66 s [vector] accum: OK
  9171. 632.66 s [vector] +++ OK, passed 100 tests.
  9172. 632.66 s [vector] reverse: OK
  9173. 632.66 s [vector] +++ OK, passed 100 tests.
  9174. 632.66 s [vector] backpermute: OK
  9175. 632.67 s [vector] +++ OK, passed 100 tests.
  9176. 632.67 s [vector] map: OK
  9177. 632.67 s [vector] +++ OK, passed 100 tests.
  9178. 632.67 s [vector] imap: OK
  9179. 632.68 s [vector] +++ OK, passed 100 tests.
  9180. 632.68 s [vector] concatMap: OK
  9181. 632.68 s [vector] +++ OK, passed 100 tests.
  9182. 632.68 s [vector] mapM: OK
  9183. 632.68 s [vector] +++ OK, passed 100 tests.
  9184. 632.71 s [vector] mapM_: OK (0.03s)
  9185. 632.71 s [vector] +++ OK, passed 100 tests.
  9186. 632.72 s [vector] forM: OK
  9187. 632.72 s [vector] +++ OK, passed 100 tests.
  9188. 632.75 s [vector] forM_: OK (0.03s)
  9189. 632.75 s [vector] +++ OK, passed 100 tests.
  9190. 632.75 s [vector] imapM: OK
  9191. 632.75 s [vector] +++ OK, passed 100 tests.
  9192. 632.78 s [vector] imapM_: OK (0.03s)
  9193. 632.78 s [vector] +++ OK, passed 100 tests.
  9194. 632.78 s [vector] zipWith: OK
  9195. 632.79 s [vector] +++ OK, passed 100 tests.
  9196. 632.79 s [vector] zipWith3: OK
  9197. 632.79 s [vector] +++ OK, passed 100 tests.
  9198. 632.80 s [vector] izipWith: OK
  9199. 632.80 s [vector] +++ OK, passed 100 tests.
  9200. 632.80 s [vector] izipWith3: OK
  9201. 632.80 s [vector] +++ OK, passed 100 tests.
  9202. 632.82 s [vector] izipWithM: OK
  9203. 632.82 s [vector] +++ OK, passed 100 tests.
  9204. 632.83 s [vector] izipWithM_: OK (0.02s)
  9205. 632.83 s [vector] +++ OK, passed 100 tests.
  9206. 632.84 s [vector] zipWithM: OK
  9207. 632.84 s [vector] +++ OK, passed 100 tests.
  9208. 632.85 s [vector] zipWithM_: OK (0.02s)
  9209. 632.85 s [vector] +++ OK, passed 100 tests.
  9210. 632.85 s [vector] filter: OK
  9211. 632.85 s [vector] +++ OK, passed 100 tests.
  9212. 632.85 s [vector] ifilter: OK
  9213. 632.86 s [vector] +++ OK, passed 100 tests.
  9214. 632.89 s [vector] filterM: OK (0.04s)
  9215. 632.89 s [vector] +++ OK, passed 100 tests.
  9216. 632.90 s [vector] uniq: OK
  9217. 632.90 s [vector] +++ OK, passed 100 tests.
  9218. 632.90 s [vector] mapMaybe: OK
  9219. 632.90 s [vector] +++ OK, passed 100 tests.
  9220. 632.91 s [vector] imapMaybe: OK
  9221. 632.91 s [vector] +++ OK, passed 100 tests.
  9222. 632.91 s [vector] takeWhile: OK
  9223. 632.91 s [vector] +++ OK, passed 100 tests.
  9224. 632.91 s [vector] dropWhile: OK
  9225. 632.91 s [vector] +++ OK, passed 100 tests.
  9226. 632.91 s [vector] partition: OK
  9227. 632.91 s [vector] +++ OK, passed 100 tests.
  9228. 632.91 s [vector] partitionWith: OK
  9229. 632.92 s [vector] +++ OK, passed 100 tests.
  9230. 632.92 s [vector] span: OK
  9231. 632.92 s [vector] +++ OK, passed 100 tests.
  9232. 632.92 s [vector] break: OK
  9233. 632.92 s [vector] +++ OK, passed 100 tests.
  9234. 632.92 s [vector] spanR: OK
  9235. 632.92 s [vector] +++ OK, passed 100 tests.
  9236. 632.92 s [vector] breakR: OK
  9237. 632.92 s [vector] +++ OK, passed 100 tests.
  9238. 632.92 s [vector] groupBy: OK
  9239. 632.93 s [vector] +++ OK, passed 100 tests.
  9240. 632.93 s [vector] elem: OK
  9241. 632.93 s [vector] +++ OK, passed 100 tests.
  9242. 632.93 s [vector] notElem: OK
  9243. 632.93 s [vector] +++ OK, passed 100 tests.
  9244. 632.93 s [vector] find: OK
  9245. 632.93 s [vector] +++ OK, passed 100 tests.
  9246. 632.93 s [vector] findIndex: OK
  9247. 632.93 s [vector] +++ OK, passed 100 tests.
  9248. 632.93 s [vector] findIndexR: OK
  9249. 632.93 s [vector] +++ OK, passed 100 tests.
  9250. 632.94 s [vector] findIndices: OK
  9251. 632.94 s [vector] +++ OK, passed 100 tests.
  9252. 632.94 s [vector] elemIndex: OK
  9253. 632.94 s [vector] +++ OK, passed 100 tests.
  9254. 632.94 s [vector] elemIndices: OK
  9255. 632.94 s [vector] +++ OK, passed 100 tests.
  9256. 632.94 s [vector] foldl: OK
  9257. 632.94 s [vector] +++ OK, passed 100 tests.
  9258. 632.94 s [vector] foldl1: OK
  9259. 632.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9260. 632.95 s [vector] foldl': OK
  9261. 632.96 s [vector] +++ OK, passed 100 tests.
  9262. 632.96 s [vector] foldl1': OK
  9263. 632.96 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9264. 632.96 s [vector] foldr: OK
  9265. 632.96 s [vector] +++ OK, passed 100 tests.
  9266. 632.96 s [vector] foldr1: OK
  9267. 632.97 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9268. 632.97 s [vector] foldr': OK
  9269. 632.97 s [vector] +++ OK, passed 100 tests.
  9270. 632.98 s [vector] foldr1': OK
  9271. 632.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9272. 632.98 s [vector] ifoldl: OK
  9273. 632.98 s [vector] +++ OK, passed 100 tests.
  9274. 632.99 s [vector] ifoldl': OK
  9275. 632.99 s [vector] +++ OK, passed 100 tests.
  9276. 632.99 s [vector] ifoldr: OK
  9277. 632.99 s [vector] +++ OK, passed 100 tests.
  9278. 632.99 s [vector] ifoldr': OK
  9279. 633.00 s [vector] +++ OK, passed 100 tests.
  9280. 633.00 s [vector] ifoldM: OK
  9281. 633.00 s [vector] +++ OK, passed 100 tests.
  9282. 633.00 s [vector] ifoldM': OK
  9283. 633.00 s [vector] +++ OK, passed 100 tests.
  9284. 633.05 s [vector] ifoldM_: OK (0.03s)
  9285. 633.05 s [vector] +++ OK, passed 100 tests.
  9286. 633.06 s [vector] ifoldM'_: OK (0.03s)
  9287. 633.06 s [vector] +++ OK, passed 100 tests.
  9288. 633.06 s [vector] all: OK
  9289. 633.06 s [vector] +++ OK, passed 100 tests.
  9290. 633.06 s [vector] any: OK
  9291. 633.06 s [vector] +++ OK, passed 100 tests.
  9292. 633.06 s [vector] prescanl: OK
  9293. 633.06 s [vector] +++ OK, passed 100 tests.
  9294. 633.07 s [vector] prescanl': OK
  9295. 633.07 s [vector] +++ OK, passed 100 tests.
  9296. 633.08 s [vector] postscanl: OK
  9297. 633.08 s [vector] +++ OK, passed 100 tests.
  9298. 633.08 s [vector] postscanl': OK
  9299. 633.08 s [vector] +++ OK, passed 100 tests.
  9300. 633.08 s [vector] scanl: OK
  9301. 633.08 s [vector] +++ OK, passed 100 tests.
  9302. 633.08 s [vector] scanl': OK
  9303. 633.10 s [vector] +++ OK, passed 100 tests.
  9304. 633.10 s [vector] scanl1: OK
  9305. 633.10 s [vector] +++ OK, passed 100 tests.
  9306. 633.10 s [vector] scanl1': OK
  9307. 633.10 s [vector] +++ OK, passed 100 tests.
  9308. 633.10 s [vector] iscanl: OK
  9309. 633.10 s [vector] +++ OK, passed 100 tests.
  9310. 633.11 s [vector] iscanl': OK
  9311. 633.11 s [vector] +++ OK, passed 100 tests.
  9312. 633.11 s [vector] prescanr: OK
  9313. 633.11 s [vector] +++ OK, passed 100 tests.
  9314. 633.12 s [vector] prescanr': OK
  9315. 633.12 s [vector] +++ OK, passed 100 tests.
  9316. 633.12 s [vector] postscanr: OK
  9317. 633.12 s [vector] +++ OK, passed 100 tests.
  9318. 633.12 s [vector] postscanr': OK
  9319. 633.12 s [vector] +++ OK, passed 100 tests.
  9320. 633.13 s [vector] scanr: OK
  9321. 633.13 s [vector] +++ OK, passed 100 tests.
  9322. 633.13 s [vector] scanr': OK
  9323. 633.14 s [vector] +++ OK, passed 100 tests.
  9324. 633.14 s [vector] scanr1: OK
  9325. 633.14 s [vector] +++ OK, passed 100 tests.
  9326. 633.14 s [vector] scanr1': OK
  9327. 633.15 s [vector] +++ OK, passed 100 tests.
  9328. 633.15 s [vector] iscanr: OK
  9329. 633.15 s [vector] +++ OK, passed 100 tests.
  9330. 633.15 s [vector] iscanr': OK
  9331. 633.15 s [vector] +++ OK, passed 100 tests.
  9332. 633.15 s [vector] mut_read: OK
  9333. 633.16 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9334. 633.16 s [vector] mut_write: OK
  9335. 633.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9336. 633.16 s [vector] mut_modify: OK
  9337. 633.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9338. 633.16 s [vector] mut_generate: OK
  9339. 633.16 s [vector] +++ OK, passed 100 tests.
  9340. 633.18 s [vector] mut_generateM: OK (0.02s)
  9341. 633.18 s [vector] +++ OK, passed 100 tests.
  9342. 633.20 s [vector] mut_mapM_: OK (0.03s)
  9343. 633.20 s [vector] +++ OK, passed 100 tests.
  9344. 633.28 s [vector] mut_imapM_: OK (0.06s)
  9345. 633.28 s [vector] +++ OK, passed 100 tests.
  9346. 633.30 s [vector] mut_forM_: OK (0.02s)
  9347. 633.30 s [vector] +++ OK, passed 100 tests.
  9348. 633.31 s [vector] mut_iforM_: OK (0.03s)
  9349. 633.31 s [vector] +++ OK, passed 100 tests.
  9350. 633.32 s [vector] mut_foldr: OK
  9351. 633.32 s [vector] +++ OK, passed 100 tests.
  9352. 633.32 s [vector] mut_foldr': OK
  9353. 633.32 s [vector] +++ OK, passed 100 tests.
  9354. 633.34 s [vector] mut_foldl: OK
  9355. 633.34 s [vector] +++ OK, passed 100 tests.
  9356. 633.35 s [vector] mut_foldl': OK (0.02s)
  9357. 633.35 s [vector] +++ OK, passed 100 tests.
  9358. 633.35 s [vector] mut_ifoldr: OK
  9359. 633.35 s [vector] +++ OK, passed 100 tests.
  9360. 633.36 s [vector] mut_ifoldr': OK
  9361. 633.36 s [vector] +++ OK, passed 100 tests.
  9362. 633.36 s [vector] mut_ifoldl: OK
  9363. 633.36 s [vector] +++ OK, passed 100 tests.
  9364. 633.37 s [vector] mut_ifoldl': OK
  9365. 633.37 s [vector] +++ OK, passed 100 tests.
  9366. 633.37 s [vector] mut_foldM: OK
  9367. 633.37 s [vector] +++ OK, passed 100 tests.
  9368. 633.37 s [vector] mut_foldM': OK
  9369. 633.37 s [vector] +++ OK, passed 100 tests.
  9370. 633.38 s [vector] mut_foldrM: OK
  9371. 633.38 s [vector] +++ OK, passed 100 tests.
  9372. 633.38 s [vector] mut_foldrM': OK
  9373. 633.38 s [vector] +++ OK, passed 100 tests.
  9374. 633.38 s [vector] mut_ifoldM: OK
  9375. 633.39 s [vector] +++ OK, passed 100 tests.
  9376. 633.39 s [vector] mut_ifoldM': OK
  9377. 633.39 s [vector] +++ OK, passed 100 tests.
  9378. 633.40 s [vector] mut_ifoldrM: OK
  9379. 633.40 s [vector] +++ OK, passed 100 tests.
  9380. 633.40 s [vector] mut_ifoldrM': OK
  9381. 633.40 s [vector] +++ OK, passed 100 tests.
  9382. 633.40 s [vector] compare: OK
  9383. 633.40 s [vector] +++ OK, passed 100 tests.
  9384. 633.40 s [vector] maximum: OK
  9385. 633.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9386. 633.40 s [vector] minimum: OK
  9387. 633.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9388. 633.40 s [vector] minIndex: OK
  9389. 633.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9390. 633.41 s [vector] maxIndex: OK
  9391. 633.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9392. 633.41 s [vector] maximumBy: OK
  9393. 633.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9394. 633.41 s [vector] minimumBy: OK
  9395. 633.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9396. 633.41 s [vector] maximumOn: OK
  9397. 633.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9398. 633.41 s [vector] minimumOn: OK
  9399. 633.41 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9400. 633.41 s [vector] maxIndexBy: OK
  9401. 633.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9402. 633.41 s [vector] minIndexBy: OK
  9403. 633.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9404. 633.42 s [vector] ListFirstMaxIndexWins: OK
  9405. 633.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9406. 633.42 s [vector] FalseListFirstMaxIndexWins: OK
  9407. 633.42 s [vector] +++ OK, failed as expected. (after 1 test):
  9408. 633.42 s [vector] Exception:
  9409. 633.42 s [vector] Prelude.foldr1: empty list
  9410. 633.42 s [vector] CallStack (from HasCallStack):
  9411. 633.42 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9412. 633.42 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9413. 633.42 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9414. 633.42 s [vector] []
  9415. 633.42 s [vector] mempty: OK
  9416. 633.42 s [vector] +++ OK, passed 1 test.
  9417. 633.42 s [vector] mappend: OK
  9418. 633.42 s [vector] +++ OK, passed 100 tests.
  9419. 633.45 s [vector] mconcat: OK (0.03s)
  9420. 633.45 s [vector] +++ OK, passed 100 tests.
  9421. 633.45 s [vector] glength: OK
  9422. 633.45 s [vector] +++ OK, passed 100 tests.
  9423. 633.45 s [vector] sum: OK
  9424. 633.46 s [vector] +++ OK, passed 100 tests.
  9425. 633.46 s [vector] product: OK
  9426. 633.46 s [vector] +++ OK, passed 100 tests.
  9427. 633.46 s [vector] enumFromN: OK
  9428. 633.46 s [vector] +++ OK, passed 100 tests.
  9429. 633.46 s [vector] enumFromThenN: OK
  9430. 633.46 s [vector] +++ OK, passed 100 tests.
  9431. 633.46 s [vector] enumFromTo: OK
  9432. 633.47 s [vector] +++ OK, passed 100 tests.
  9433. 633.47 s [vector] enumFromThenTo: OK
  9434. 633.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9435. 633.47 s [vector] Data.Vector.Storable.Vector (Double)
  9436. 633.47 s [vector] fromList.toList == id: OK
  9437. 633.47 s [vector] +++ OK, passed 100 tests.
  9438. 633.47 s [vector] toList.fromList == id: OK
  9439. 633.47 s [vector] +++ OK, passed 100 tests.
  9440. 633.47 s [vector] unstream.stream == id: OK
  9441. 633.47 s [vector] +++ OK, passed 100 tests.
  9442. 633.47 s [vector] stream.unstream == id: OK
  9443. 633.47 s [vector] +++ OK, passed 100 tests.
  9444. 633.48 s [vector] eq: OK
  9445. 633.48 s [vector] +++ OK, passed 100 tests.
  9446. 633.48 s [vector] length: OK
  9447. 633.48 s [vector] +++ OK, passed 100 tests.
  9448. 633.48 s [vector] null: OK
  9449. 633.48 s [vector] +++ OK, passed 100 tests.
  9450. 633.48 s [vector] index: OK
  9451. 633.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9452. 633.49 s [vector] safeIndex: OK
  9453. 633.49 s [vector] +++ OK, passed 100 tests.
  9454. 633.49 s [vector] head: OK
  9455. 633.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9456. 633.49 s [vector] last: OK
  9457. 633.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9458. 633.49 s [vector] unsafeIndex: OK
  9459. 633.49 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9460. 633.49 s [vector] unsafeHead: OK
  9461. 633.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9462. 633.50 s [vector] unsafeLast: OK
  9463. 633.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9464. 633.50 s [vector] slice: OK
  9465. 633.50 s [vector] +++ OK, passed 100 tests.
  9466. 633.50 s [vector] init: OK
  9467. 633.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9468. 633.50 s [vector] tail: OK
  9469. 633.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9470. 633.50 s [vector] take: OK
  9471. 633.51 s [vector] +++ OK, passed 100 tests.
  9472. 633.51 s [vector] drop: OK
  9473. 633.51 s [vector] +++ OK, passed 100 tests.
  9474. 633.51 s [vector] splitAt: OK
  9475. 633.51 s [vector] +++ OK, passed 100 tests.
  9476. 633.51 s [vector] empty: OK
  9477. 633.51 s [vector] +++ OK, passed 1 test.
  9478. 633.51 s [vector] singleton: OK
  9479. 633.51 s [vector] +++ OK, passed 100 tests.
  9480. 633.51 s [vector] replicate: OK
  9481. 633.51 s [vector] +++ OK, passed 100 tests.
  9482. 633.52 s [vector] generate: OK
  9483. 633.52 s [vector] +++ OK, passed 100 tests.
  9484. 633.54 s [vector] iterateN: OK (0.01s)
  9485. 633.54 s [vector] +++ OK, passed 100 tests.
  9486. 633.62 s [vector] iterateNM: OK (0.07s)
  9487. 633.62 s [vector] +++ OK, passed 100 tests.
  9488. 633.70 s [vector] generateM: OK (0.09s)
  9489. 633.70 s [vector] +++ OK, passed 100 tests.
  9490. 633.74 s [vector] replicateM: OK (0.06s)
  9491. 633.74 s [vector] +++ OK, passed 100 tests.
  9492. 633.75 s [vector] create: OK
  9493. 633.75 s [vector] +++ OK, passed 100 tests.
  9494. 633.75 s [vector] createT: OK
  9495. 633.75 s [vector] +++ OK, passed 100 tests.
  9496. 633.75 s [vector] unfoldr: OK
  9497. 633.75 s [vector] +++ OK, passed 100 tests.
  9498. 633.75 s [vector] unfoldrN: OK
  9499. 633.75 s [vector] +++ OK, passed 100 tests.
  9500. 633.75 s [vector] unfoldrExactN: OK
  9501. 633.76 s [vector] +++ OK, passed 100 tests.
  9502. 633.76 s [vector] unfoldrM: OK
  9503. 633.76 s [vector] +++ OK, passed 100 tests.
  9504. 633.76 s [vector] unfoldrNM: OK
  9505. 633.76 s [vector] +++ OK, passed 100 tests.
  9506. 633.80 s [vector] unfoldrExactNM: OK (0.04s)
  9507. 633.80 s [vector] +++ OK, passed 100 tests.
  9508. 633.84 s [vector] constructN: OK (0.03s)
  9509. 633.84 s [vector] +++ OK, passed 100 tests.
  9510. 633.87 s [vector] constructrN: OK (0.04s)
  9511. 633.87 s [vector] +++ OK, passed 100 tests.
  9512. 633.87 s [vector] cons: OK
  9513. 633.87 s [vector] +++ OK, passed 100 tests.
  9514. 633.87 s [vector] snoc: OK
  9515. 633.87 s [vector] +++ OK, passed 100 tests.
  9516. 633.87 s [vector] append: OK
  9517. 633.88 s [vector] +++ OK, passed 100 tests.
  9518. 633.93 s [vector] concat: OK (0.05s)
  9519. 633.93 s [vector] +++ OK, passed 100 tests.
  9520. 633.93 s [vector] force: OK
  9521. 633.93 s [vector] +++ OK, passed 100 tests.
  9522. 633.93 s [vector] upd: OK
  9523. 633.94 s [vector] +++ OK, passed 100 tests.
  9524. 633.96 s [vector] accum: OK (0.03s)
  9525. 633.96 s [vector] +++ OK, passed 100 tests.
  9526. 633.96 s [vector] reverse: OK
  9527. 633.97 s [vector] +++ OK, passed 100 tests.
  9528. 633.97 s [vector] backpermute: OK
  9529. 633.99 s [vector] +++ OK, passed 100 tests.
  9530. 634.02 s [vector] map: OK (0.04s)
  9531. 634.02 s [vector] +++ OK, passed 100 tests.
  9532. 634.04 s [vector] imap: OK (0.02s)
  9533. 634.04 s [vector] +++ OK, passed 100 tests.
  9534. 634.06 s [vector] concatMap: OK (0.02s)
  9535. 634.07 s [vector] +++ OK, passed 100 tests.
  9536. 634.07 s [vector] mapM: OK (0.02s)
  9537. 634.07 s [vector] +++ OK, passed 100 tests.
  9538. 634.14 s [vector] mapM_: OK (0.08s)
  9539. 634.14 s [vector] +++ OK, passed 100 tests.
  9540. 634.16 s [vector] forM: OK (0.02s)
  9541. 634.16 s [vector] +++ OK, passed 100 tests.
  9542. 634.22 s [vector] forM_: OK (0.07s)
  9543. 634.23 s [vector] +++ OK, passed 100 tests.
  9544. 634.24 s [vector] imapM: OK
  9545. 634.26 s [vector] +++ OK, passed 100 tests.
  9546. 634.32 s [vector] imapM_: OK (0.07s)
  9547. 634.32 s [vector] +++ OK, passed 100 tests.
  9548. 634.34 s [vector] zipWith: OK (0.02s)
  9549. 634.35 s [vector] +++ OK, passed 100 tests.
  9550. 634.38 s [vector] zipWith3: OK (0.02s)
  9551. 634.38 s [vector] +++ OK, passed 100 tests.
  9552. 634.38 s [vector] izipWith: OK (0.02s)
  9553. 634.38 s [vector] +++ OK, passed 100 tests.
  9554. 634.40 s [vector] izipWith3: OK (0.02s)
  9555. 634.40 s [vector] +++ OK, passed 100 tests.
  9556. 634.42 s [vector] izipWithM: OK (0.02s)
  9557. 634.42 s [vector] +++ OK, passed 100 tests.
  9558. 634.50 s [vector] izipWithM_: OK (0.08s)
  9559. 634.50 s [vector] +++ OK, passed 100 tests.
  9560. 634.52 s [vector] zipWithM: OK (0.02s)
  9561. 634.52 s [vector] +++ OK, passed 100 tests.
  9562. 634.59 s [vector] zipWithM_: OK (0.06s)
  9563. 634.59 s [vector] +++ OK, passed 100 tests.
  9564. 634.61 s [vector] filter: OK (0.01s)
  9565. 634.61 s [vector] +++ OK, passed 100 tests.
  9566. 634.61 s [vector] ifilter: OK (0.01s)
  9567. 634.61 s [vector] +++ OK, passed 100 tests.
  9568. 634.68 s [vector] filterM: OK (0.08s)
  9569. 634.68 s [vector] +++ OK, passed 100 tests.
  9570. 634.68 s [vector] uniq: OK
  9571. 634.68 s [vector] +++ OK, passed 100 tests.
  9572. 634.70 s [vector] mapMaybe: OK (0.01s)
  9573. 634.70 s [vector] +++ OK, passed 100 tests.
  9574. 634.71 s [vector] imapMaybe: OK (0.02s)
  9575. 634.71 s [vector] +++ OK, passed 100 tests.
  9576. 634.71 s [vector] takeWhile: OK
  9577. 634.72 s [vector] +++ OK, passed 100 tests.
  9578. 634.72 s [vector] dropWhile: OK
  9579. 634.72 s [vector] +++ OK, passed 100 tests.
  9580. 634.74 s [vector] partition: OK (0.02s)
  9581. 634.74 s [vector] +++ OK, passed 100 tests.
  9582. 634.76 s [vector] partitionWith: OK (0.02s)
  9583. 634.76 s [vector] +++ OK, passed 100 tests.
  9584. 634.76 s [vector] span: OK
  9585. 634.76 s [vector] +++ OK, passed 100 tests.
  9586. 634.76 s [vector] break: OK
  9587. 634.76 s [vector] +++ OK, passed 100 tests.
  9588. 634.76 s [vector] spanR: OK
  9589. 634.77 s [vector] +++ OK, passed 100 tests.
  9590. 634.78 s [vector] breakR: OK
  9591. 634.78 s [vector] +++ OK, passed 100 tests.
  9592. 634.79 s [vector] groupBy: OK (0.02s)
  9593. 634.79 s [vector] +++ OK, passed 100 tests.
  9594. 634.79 s [vector] elem: OK
  9595. 634.79 s [vector] +++ OK, passed 100 tests.
  9596. 634.79 s [vector] notElem: OK
  9597. 634.79 s [vector] +++ OK, passed 100 tests.
  9598. 634.79 s [vector] find: OK
  9599. 634.79 s [vector] +++ OK, passed 100 tests.
  9600. 634.79 s [vector] findIndex: OK
  9601. 634.79 s [vector] +++ OK, passed 100 tests.
  9602. 634.79 s [vector] findIndexR: OK
  9603. 634.80 s [vector] +++ OK, passed 100 tests.
  9604. 634.80 s [vector] findIndices: OK (0.01s)
  9605. 634.80 s [vector] +++ OK, passed 100 tests.
  9606. 634.81 s [vector] elemIndex: OK
  9607. 634.81 s [vector] +++ OK, passed 100 tests.
  9608. 634.81 s [vector] elemIndices: OK
  9609. 634.83 s [vector] +++ OK, passed 100 tests.
  9610. 634.84 s [vector] foldl: OK (0.03s)
  9611. 634.84 s [vector] +++ OK, passed 100 tests.
  9612. 634.88 s [vector] foldl1: OK (0.02s)
  9613. 634.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9614. 634.90 s [vector] foldl': OK (0.02s)
  9615. 634.90 s [vector] +++ OK, passed 100 tests.
  9616. 634.92 s [vector] foldl1': OK (0.03s)
  9617. 634.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9618. 634.96 s [vector] foldr: OK (0.03s)
  9619. 634.96 s [vector] +++ OK, passed 100 tests.
  9620. 634.97 s [vector] foldr1: OK (0.03s)
  9621. 634.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9622. 634.99 s [vector] foldr': OK
  9623. 635.00 s [vector] +++ OK, passed 100 tests.
  9624. 635.02 s [vector] foldr1': OK (0.02s)
  9625. 635.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9626. 635.04 s [vector] ifoldl: OK (0.02s)
  9627. 635.04 s [vector] +++ OK, passed 100 tests.
  9628. 635.08 s [vector] ifoldl': OK (0.03s)
  9629. 635.08 s [vector] +++ OK, passed 100 tests.
  9630. 635.10 s [vector] ifoldr: OK (0.03s)
  9631. 635.10 s [vector] +++ OK, passed 100 tests.
  9632. 635.12 s [vector] ifoldr': OK (0.02s)
  9633. 635.12 s [vector] +++ OK, passed 100 tests.
  9634. 635.16 s [vector] ifoldM: OK (0.03s)
  9635. 635.16 s [vector] +++ OK, passed 100 tests.
  9636. 635.17 s [vector] ifoldM': OK (0.03s)
  9637. 635.17 s [vector] +++ OK, passed 100 tests.
  9638. 635.24 s [vector] ifoldM_: OK (0.05s)
  9639. 635.24 s [vector] +++ OK, passed 100 tests.
  9640. 635.30 s [vector] ifoldM'_: OK (0.06s)
  9641. 635.30 s [vector] +++ OK, passed 100 tests.
  9642. 635.30 s [vector] all: OK
  9643. 635.30 s [vector] +++ OK, passed 100 tests.
  9644. 635.30 s [vector] any: OK
  9645. 635.30 s [vector] +++ OK, passed 100 tests.
  9646. 635.32 s [vector] prescanl: OK (0.02s)
  9647. 635.32 s [vector] +++ OK, passed 100 tests.
  9648. 635.35 s [vector] prescanl': OK (0.02s)
  9649. 635.35 s [vector] +++ OK, passed 100 tests.
  9650. 635.37 s [vector] postscanl: OK (0.01s)
  9651. 635.37 s [vector] +++ OK, passed 100 tests.
  9652. 635.42 s [vector] postscanl': OK (0.02s)
  9653. 635.42 s [vector] +++ OK, passed 100 tests.
  9654. 635.44 s [vector] scanl: OK (0.03s)
  9655. 635.45 s [vector] +++ OK, passed 100 tests.
  9656. 635.46 s [vector] scanl': OK (0.03s)
  9657. 635.46 s [vector] +++ OK, passed 100 tests.
  9658. 635.50 s [vector] scanl1: OK (0.03s)
  9659. 635.50 s [vector] +++ OK, passed 100 tests.
  9660. 635.52 s [vector] scanl1': OK (0.03s)
  9661. 635.52 s [vector] +++ OK, passed 100 tests.
  9662. 635.54 s [vector] iscanl: OK (0.03s)
  9663. 635.55 s [vector] +++ OK, passed 100 tests.
  9664. 635.58 s [vector] iscanl': OK (0.03s)
  9665. 635.59 s [vector] +++ OK, passed 100 tests.
  9666. 635.59 s [vector] prescanr: OK (0.03s)
  9667. 635.59 s [vector] +++ OK, passed 100 tests.
  9668. 635.64 s [vector] prescanr': OK (0.02s)
  9669. 635.64 s [vector] +++ OK, passed 100 tests.
  9670. 635.66 s [vector] postscanr: OK (0.04s)
  9671. 635.66 s [vector] +++ OK, passed 100 tests.
  9672. 635.70 s [vector] postscanr': OK
  9673. 635.70 s [vector] +++ OK, passed 100 tests.
  9674. 635.72 s [vector] scanr: OK (0.03s)
  9675. 635.72 s [vector] +++ OK, passed 100 tests.
  9676. 635.77 s [vector] scanr': OK (0.03s)
  9677. 635.77 s [vector] +++ OK, passed 100 tests.
  9678. 635.78 s [vector] scanr1: OK (0.03s)
  9679. 635.78 s [vector] +++ OK, passed 100 tests.
  9680. 635.82 s [vector] scanr1': OK (0.03s)
  9681. 635.82 s [vector] +++ OK, passed 100 tests.
  9682. 635.84 s [vector] iscanr: OK (0.03s)
  9683. 635.84 s [vector] +++ OK, passed 100 tests.
  9684. 635.87 s [vector] iscanr': OK (0.03s)
  9685. 635.87 s [vector] +++ OK, passed 100 tests.
  9686. 635.87 s [vector] mut_read: OK
  9687. 635.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9688. 635.87 s [vector] mut_write: OK
  9689. 635.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9690. 635.87 s [vector] mut_modify: OK
  9691. 635.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9692. 635.88 s [vector] mut_generate: OK
  9693. 635.88 s [vector] +++ OK, passed 100 tests.
  9694. 635.92 s [vector] mut_generateM: OK (0.03s)
  9695. 635.92 s [vector] +++ OK, passed 100 tests.
  9696. 635.99 s [vector] mut_mapM_: OK (0.06s)
  9697. 636.00 s [vector] +++ OK, passed 100 tests.
  9698. 636.06 s [vector] mut_imapM_: OK (0.07s)
  9699. 636.06 s [vector] +++ OK, passed 100 tests.
  9700. 636.12 s [vector] mut_forM_: OK (0.06s)
  9701. 636.12 s [vector] +++ OK, passed 100 tests.
  9702. 636.18 s [vector] mut_iforM_: OK (0.07s)
  9703. 636.18 s [vector] +++ OK, passed 100 tests.
  9704. 636.22 s [vector] mut_foldr: OK (0.02s)
  9705. 636.22 s [vector] +++ OK, passed 100 tests.
  9706. 636.24 s [vector] mut_foldr': OK (0.02s)
  9707. 636.24 s [vector] +++ OK, passed 100 tests.
  9708. 636.26 s [vector] mut_foldl: OK (0.03s)
  9709. 636.26 s [vector] +++ OK, passed 100 tests.
  9710. 636.28 s [vector] mut_foldl': OK (0.03s)
  9711. 636.28 s [vector] +++ OK, passed 100 tests.
  9712. 636.30 s [vector] mut_ifoldr: OK (0.03s)
  9713. 636.30 s [vector] +++ OK, passed 100 tests.
  9714. 636.34 s [vector] mut_ifoldr': OK (0.03s)
  9715. 636.34 s [vector] +++ OK, passed 100 tests.
  9716. 636.36 s [vector] mut_ifoldl: OK (0.03s)
  9717. 636.46 s [vector] +++ OK, passed 100 tests.
  9718. 636.46 s [vector] mut_ifoldl': OK (0.02s)
  9719. 636.46 s [vector] +++ OK, passed 100 tests.
  9720. 636.46 s [vector] mut_foldM: OK (0.03s)
  9721. 636.46 s [vector] +++ OK, passed 100 tests.
  9722. 636.46 s [vector] mut_foldM': OK (0.02s)
  9723. 636.46 s [vector] +++ OK, passed 100 tests.
  9724. 636.46 s [vector] mut_foldrM: OK (0.03s)
  9725. 636.47 s [vector] +++ OK, passed 100 tests.
  9726. 636.49 s [vector] mut_foldrM': OK (0.03s)
  9727. 636.49 s [vector] +++ OK, passed 100 tests.
  9728. 636.52 s [vector] mut_ifoldM: OK (0.03s)
  9729. 636.53 s [vector] +++ OK, passed 100 tests.
  9730. 636.54 s [vector] mut_ifoldM': OK (0.03s)
  9731. 636.54 s [vector] +++ OK, passed 100 tests.
  9732. 636.58 s [vector] mut_ifoldrM: OK (0.03s)
  9733. 636.58 s [vector] +++ OK, passed 100 tests.
  9734. 636.60 s [vector] mut_ifoldrM': OK (0.03s)
  9735. 636.60 s [vector] +++ OK, passed 100 tests.
  9736. 636.61 s [vector] compare: OK
  9737. 636.61 s [vector] +++ OK, passed 100 tests.
  9738. 636.61 s [vector] maximum: OK
  9739. 636.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9740. 636.61 s [vector] minimum: OK
  9741. 636.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9742. 636.61 s [vector] minIndex: OK
  9743. 636.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9744. 636.62 s [vector] maxIndex: OK
  9745. 636.62 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9746. 636.62 s [vector] maximumBy: OK
  9747. 636.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9748. 636.62 s [vector] minimumBy: OK
  9749. 636.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9750. 636.62 s [vector] maximumOn: OK
  9751. 636.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9752. 636.64 s [vector] minimumOn: OK (0.02s)
  9753. 636.64 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9754. 636.64 s [vector] maxIndexBy: OK
  9755. 636.64 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9756. 636.65 s [vector] minIndexBy: OK
  9757. 636.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9758. 636.65 s [vector] ListFirstMaxIndexWins: OK
  9759. 636.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9760. 636.65 s [vector] FalseListFirstMaxIndexWins: OK
  9761. 636.65 s [vector] +++ OK, failed as expected. (after 1 test):
  9762. 636.65 s [vector] Exception:
  9763. 636.65 s [vector] Prelude.foldr1: empty list
  9764. 636.65 s [vector] CallStack (from HasCallStack):
  9765. 636.65 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9766. 636.65 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9767. 636.65 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9768. 636.65 s [vector] []
  9769. 636.65 s [vector] mempty: OK
  9770. 636.65 s [vector] +++ OK, passed 1 test.
  9771. 636.65 s [vector] mappend: OK
  9772. 636.66 s [vector] +++ OK, passed 100 tests.
  9773. 636.69 s [vector] mconcat: OK (0.03s)
  9774. 636.69 s [vector] +++ OK, passed 100 tests.
  9775. 636.69 s [vector] glength: OK
  9776. 636.69 s [vector] +++ OK, passed 100 tests.
  9777. 636.69 s [vector] sum: OK
  9778. 636.69 s [vector] +++ OK, passed 100 tests.
  9779. 636.69 s [vector] product: OK
  9780. 636.69 s [vector] +++ OK, passed 100 tests.
  9781. 636.69 s [vector] enumFromN: OK
  9782. 636.69 s [vector] +++ OK, passed 100 tests.
  9783. 636.69 s [vector] enumFromThenN: OK
  9784. 636.69 s [vector] +++ OK, passed 100 tests.
  9785. 636.70 s [vector] enumFromTo: OK
  9786. 636.70 s [vector] +++ OK, passed 100 tests.
  9787. 636.71 s [vector] enumFromThenTo: OK
  9788. 636.71 s [vector] +++ OK, passed 100 tests.
  9789. 636.71 s [vector] unstream
  9790. 636.71 s [vector] unstream == vunstream (exact): OK
  9791. 636.71 s [vector] +++ OK, passed 100 tests.
  9792. 636.71 s [vector] unstream == vunstream (unknown): OK
  9793. 636.71 s [vector] +++ OK, passed 100 tests.
  9794. 636.71 s [vector] unstreamR ~= vunstream (exact): OK
  9795. 636.71 s [vector] +++ OK, passed 100 tests.
  9796. 636.71 s [vector] unstreamR ~= vunstream (unknown): OK
  9797. 636.71 s [vector] +++ OK, passed 100 tests.
  9798. 636.71 s [vector] Tests.Vector.Strict
  9799. 636.71 s [vector] Bool
  9800. 636.71 s [vector] fromList.toList == id: OK
  9801. 636.71 s [vector] +++ OK, passed 100 tests.
  9802. 636.71 s [vector] toList.fromList == id: OK
  9803. 636.71 s [vector] +++ OK, passed 100 tests.
  9804. 636.71 s [vector] unstream.stream == id: OK
  9805. 636.71 s [vector] +++ OK, passed 100 tests.
  9806. 636.71 s [vector] stream.unstream == id: OK
  9807. 636.71 s [vector] +++ OK, passed 100 tests.
  9808. 636.71 s [vector] eq: OK
  9809. 636.71 s [vector] +++ OK, passed 100 tests.
  9810. 636.71 s [vector] length: OK
  9811. 636.71 s [vector] +++ OK, passed 100 tests.
  9812. 636.71 s [vector] null: OK
  9813. 636.71 s [vector] +++ OK, passed 100 tests.
  9814. 636.71 s [vector] index: OK
  9815. 636.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9816. 636.71 s [vector] safeIndex: OK
  9817. 636.72 s [vector] +++ OK, passed 100 tests.
  9818. 636.72 s [vector] head: OK
  9819. 636.72 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9820. 636.72 s [vector] last: OK
  9821. 636.72 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9822. 636.72 s [vector] unsafeIndex: OK
  9823. 636.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9824. 636.72 s [vector] unsafeHead: OK
  9825. 636.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9826. 636.72 s [vector] unsafeLast: OK
  9827. 636.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9828. 636.72 s [vector] slice: OK
  9829. 636.72 s [vector] +++ OK, passed 100 tests.
  9830. 636.72 s [vector] init: OK
  9831. 636.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9832. 636.72 s [vector] tail: OK
  9833. 636.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9834. 636.72 s [vector] take: OK
  9835. 636.72 s [vector] +++ OK, passed 100 tests.
  9836. 636.72 s [vector] drop: OK
  9837. 636.73 s [vector] +++ OK, passed 100 tests.
  9838. 636.73 s [vector] splitAt: OK
  9839. 636.73 s [vector] +++ OK, passed 100 tests.
  9840. 636.73 s [vector] empty: OK
  9841. 636.73 s [vector] +++ OK, passed 1 test.
  9842. 636.73 s [vector] singleton: OK
  9843. 636.73 s [vector] +++ OK, passed 100 tests.
  9844. 636.73 s [vector] replicate: OK
  9845. 636.73 s [vector] +++ OK, passed 100 tests.
  9846. 636.73 s [vector] generate: OK
  9847. 636.73 s [vector] +++ OK, passed 100 tests.
  9848. 636.73 s [vector] iterateN: OK
  9849. 636.73 s [vector] +++ OK, passed 100 tests.
  9850. 636.82 s [vector] iterateNM: OK (0.08s)
  9851. 636.82 s [vector] +++ OK, passed 100 tests.
  9852. 636.90 s [vector] generateM: OK (0.08s)
  9853. 636.90 s [vector] +++ OK, passed 100 tests.
  9854. 636.90 s [vector] replicateM: OK (0.02s)
  9855. 636.90 s [vector] +++ OK, passed 100 tests.
  9856. 636.90 s [vector] create: OK
  9857. 636.90 s [vector] +++ OK, passed 100 tests.
  9858. 636.90 s [vector] createT: OK
  9859. 636.90 s [vector] +++ OK, passed 100 tests.
  9860. 636.90 s [vector] unfoldr: OK
  9861. 636.90 s [vector] +++ OK, passed 100 tests.
  9862. 636.91 s [vector] unfoldrN: OK
  9863. 636.91 s [vector] +++ OK, passed 100 tests.
  9864. 636.91 s [vector] unfoldrExactN: OK
  9865. 636.91 s [vector] +++ OK, passed 100 tests.
  9866. 636.92 s [vector] unfoldrM: OK
  9867. 636.92 s [vector] +++ OK, passed 100 tests.
  9868. 636.92 s [vector] unfoldrNM: OK
  9869. 636.92 s [vector] +++ OK, passed 100 tests.
  9870. 636.96 s [vector] unfoldrExactNM: OK (0.04s)
  9871. 636.96 s [vector] +++ OK, passed 100 tests.
  9872. 636.96 s [vector] constructN: OK
  9873. 636.96 s [vector] +++ OK, passed 100 tests.
  9874. 636.97 s [vector] constructrN: OK
  9875. 636.97 s [vector] +++ OK, passed 100 tests.
  9876. 636.97 s [vector] cons: OK
  9877. 636.97 s [vector] +++ OK, passed 100 tests.
  9878. 636.97 s [vector] snoc: OK
  9879. 636.97 s [vector] +++ OK, passed 100 tests.
  9880. 636.97 s [vector] append: OK
  9881. 636.99 s [vector] +++ OK, passed 100 tests.
  9882. 636.99 s [vector] concat: OK (0.02s)
  9883. 636.99 s [vector] +++ OK, passed 100 tests.
  9884. 636.99 s [vector] force: OK
  9885. 636.99 s [vector] +++ OK, passed 100 tests.
  9886. 636.99 s [vector] upd: OK
  9887. 637.00 s [vector] +++ OK, passed 100 tests.
  9888. 637.00 s [vector] accum: OK
  9889. 637.00 s [vector] +++ OK, passed 100 tests.
  9890. 637.00 s [vector] reverse: OK
  9891. 637.00 s [vector] +++ OK, passed 100 tests.
  9892. 637.00 s [vector] backpermute: OK
  9893. 637.00 s [vector] +++ OK, passed 100 tests.
  9894. 637.00 s [vector] map: OK
  9895. 637.00 s [vector] +++ OK, passed 100 tests.
  9896. 637.00 s [vector] imap: OK
  9897. 637.01 s [vector] +++ OK, passed 100 tests.
  9898. 637.01 s [vector] concatMap: OK
  9899. 637.01 s [vector] +++ OK, passed 100 tests.
  9900. 637.01 s [vector] mapM: OK
  9901. 637.01 s [vector] +++ OK, passed 100 tests.
  9902. 637.03 s [vector] mapM_: OK (0.02s)
  9903. 637.03 s [vector] +++ OK, passed 100 tests.
  9904. 637.04 s [vector] forM: OK
  9905. 637.04 s [vector] +++ OK, passed 100 tests.
  9906. 637.05 s [vector] forM_: OK (0.02s)
  9907. 637.05 s [vector] +++ OK, passed 100 tests.
  9908. 637.06 s [vector] imapM: OK
  9909. 637.06 s [vector] +++ OK, passed 100 tests.
  9910. 637.07 s [vector] imapM_: OK (0.02s)
  9911. 637.08 s [vector] +++ OK, passed 100 tests.
  9912. 637.08 s [vector] zipWith: OK
  9913. 637.08 s [vector] +++ OK, passed 100 tests.
  9914. 637.08 s [vector] zipWith3: OK
  9915. 637.08 s [vector] +++ OK, passed 100 tests.
  9916. 637.08 s [vector] izipWith: OK
  9917. 637.09 s [vector] +++ OK, passed 100 tests.
  9918. 637.09 s [vector] izipWith3: OK
  9919. 637.09 s [vector] +++ OK, passed 100 tests.
  9920. 637.09 s [vector] izipWithM: OK
  9921. 637.09 s [vector] +++ OK, passed 100 tests.
  9922. 637.11 s [vector] izipWithM_: OK (0.02s)
  9923. 637.11 s [vector] +++ OK, passed 100 tests.
  9924. 637.11 s [vector] zipWithM: OK
  9925. 637.11 s [vector] +++ OK, passed 100 tests.
  9926. 637.12 s [vector] zipWithM_: OK (0.01s)
  9927. 637.13 s [vector] +++ OK, passed 100 tests.
  9928. 637.13 s [vector] filter: OK
  9929. 637.13 s [vector] +++ OK, passed 100 tests.
  9930. 637.14 s [vector] ifilter: OK
  9931. 637.14 s [vector] +++ OK, passed 100 tests.
  9932. 637.18 s [vector] filterM: OK (0.05s)
  9933. 637.18 s [vector] +++ OK, passed 100 tests.
  9934. 637.18 s [vector] uniq: OK
  9935. 637.18 s [vector] +++ OK, passed 100 tests.
  9936. 637.18 s [vector] mapMaybe: OK
  9937. 637.18 s [vector] +++ OK, passed 100 tests.
  9938. 637.18 s [vector] imapMaybe: OK
  9939. 637.18 s [vector] +++ OK, passed 100 tests.
  9940. 637.18 s [vector] takeWhile: OK
  9941. 637.19 s [vector] +++ OK, passed 100 tests.
  9942. 637.19 s [vector] dropWhile: OK
  9943. 637.19 s [vector] +++ OK, passed 100 tests.
  9944. 637.19 s [vector] partition: OK
  9945. 637.19 s [vector] +++ OK, passed 100 tests.
  9946. 637.19 s [vector] partitionWith: OK
  9947. 637.19 s [vector] +++ OK, passed 100 tests.
  9948. 637.19 s [vector] span: OK
  9949. 637.19 s [vector] +++ OK, passed 100 tests.
  9950. 637.20 s [vector] break: OK
  9951. 637.20 s [vector] +++ OK, passed 100 tests.
  9952. 637.20 s [vector] spanR: OK
  9953. 637.20 s [vector] +++ OK, passed 100 tests.
  9954. 637.20 s [vector] breakR: OK
  9955. 637.20 s [vector] +++ OK, passed 100 tests.
  9956. 637.20 s [vector] groupBy: OK
  9957. 637.20 s [vector] +++ OK, passed 100 tests.
  9958. 637.20 s [vector] elem: OK
  9959. 637.20 s [vector] +++ OK, passed 100 tests.
  9960. 637.20 s [vector] notElem: OK
  9961. 637.20 s [vector] +++ OK, passed 100 tests.
  9962. 637.20 s [vector] find: OK
  9963. 637.20 s [vector] +++ OK, passed 100 tests.
  9964. 637.20 s [vector] findIndex: OK
  9965. 637.20 s [vector] +++ OK, passed 100 tests.
  9966. 637.21 s [vector] findIndexR: OK
  9967. 637.21 s [vector] +++ OK, passed 100 tests.
  9968. 637.21 s [vector] findIndices: OK
  9969. 637.21 s [vector] +++ OK, passed 100 tests.
  9970. 637.21 s [vector] elemIndex: OK
  9971. 637.21 s [vector] +++ OK, passed 100 tests.
  9972. 637.21 s [vector] elemIndices: OK
  9973. 637.21 s [vector] +++ OK, passed 100 tests.
  9974. 637.21 s [vector] foldl: OK
  9975. 637.21 s [vector] +++ OK, passed 100 tests.
  9976. 637.21 s [vector] foldl1: OK
  9977. 637.21 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9978. 637.22 s [vector] foldl': OK
  9979. 637.22 s [vector] +++ OK, passed 100 tests.
  9980. 637.22 s [vector] foldl1': OK
  9981. 637.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9982. 637.22 s [vector] foldr: OK
  9983. 637.22 s [vector] +++ OK, passed 100 tests.
  9984. 637.22 s [vector] foldr1: OK
  9985. 637.22 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9986. 637.23 s [vector] foldr': OK
  9987. 637.23 s [vector] +++ OK, passed 100 tests.
  9988. 637.23 s [vector] foldr1': OK
  9989. 637.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9990. 637.23 s [vector] ifoldl: OK
  9991. 637.23 s [vector] +++ OK, passed 100 tests.
  9992. 637.24 s [vector] ifoldl': OK
  9993. 637.24 s [vector] +++ OK, passed 100 tests.
  9994. 637.24 s [vector] ifoldr: OK
  9995. 637.24 s [vector] +++ OK, passed 100 tests.
  9996. 637.24 s [vector] ifoldr': OK
  9997. 637.24 s [vector] +++ OK, passed 100 tests.
  9998. 637.25 s [vector] ifoldM: OK
  9999. 637.25 s [vector] +++ OK, passed 100 tests.
  10000. 637.25 s [vector] ifoldM': OK
  10001. 637.25 s [vector] +++ OK, passed 100 tests.
  10002. 637.28 s [vector] ifoldM_: OK (0.03s)
  10003. 637.28 s [vector] +++ OK, passed 100 tests.
  10004. 637.30 s [vector] ifoldM'_: OK (0.02s)
  10005. 637.30 s [vector] +++ OK, passed 100 tests.
  10006. 637.30 s [vector] all: OK
  10007. 637.30 s [vector] +++ OK, passed 100 tests.
  10008. 637.30 s [vector] any: OK
  10009. 637.31 s [vector] +++ OK, passed 100 tests.
  10010. 637.31 s [vector] prescanl: OK
  10011. 637.31 s [vector] +++ OK, passed 100 tests.
  10012. 637.31 s [vector] prescanl': OK
  10013. 637.31 s [vector] +++ OK, passed 100 tests.
  10014. 637.31 s [vector] postscanl: OK
  10015. 637.31 s [vector] +++ OK, passed 100 tests.
  10016. 637.31 s [vector] postscanl': OK
  10017. 637.31 s [vector] +++ OK, passed 100 tests.
  10018. 637.31 s [vector] scanl: OK
  10019. 637.32 s [vector] +++ OK, passed 100 tests.
  10020. 637.32 s [vector] scanl': OK
  10021. 637.32 s [vector] +++ OK, passed 100 tests.
  10022. 637.32 s [vector] scanl1: OK
  10023. 637.32 s [vector] +++ OK, passed 100 tests.
  10024. 637.32 s [vector] scanl1': OK
  10025. 637.32 s [vector] +++ OK, passed 100 tests.
  10026. 637.33 s [vector] iscanl: OK
  10027. 637.33 s [vector] +++ OK, passed 100 tests.
  10028. 637.33 s [vector] iscanl': OK
  10029. 637.34 s [vector] +++ OK, passed 100 tests.
  10030. 637.34 s [vector] prescanr: OK
  10031. 637.34 s [vector] +++ OK, passed 100 tests.
  10032. 637.34 s [vector] prescanr': OK
  10033. 637.34 s [vector] +++ OK, passed 100 tests.
  10034. 637.34 s [vector] postscanr: OK
  10035. 637.34 s [vector] +++ OK, passed 100 tests.
  10036. 637.34 s [vector] postscanr': OK
  10037. 637.35 s [vector] +++ OK, passed 100 tests.
  10038. 637.35 s [vector] scanr: OK
  10039. 637.35 s [vector] +++ OK, passed 100 tests.
  10040. 637.36 s [vector] scanr': OK
  10041. 637.36 s [vector] +++ OK, passed 100 tests.
  10042. 637.36 s [vector] scanr1: OK
  10043. 637.36 s [vector] +++ OK, passed 100 tests.
  10044. 637.36 s [vector] scanr1': OK
  10045. 637.36 s [vector] +++ OK, passed 100 tests.
  10046. 637.36 s [vector] iscanr: OK
  10047. 637.37 s [vector] +++ OK, passed 100 tests.
  10048. 637.37 s [vector] iscanr': OK
  10049. 637.37 s [vector] +++ OK, passed 100 tests.
  10050. 637.37 s [vector] mut_read: OK
  10051. 637.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10052. 637.37 s [vector] mut_write: OK
  10053. 637.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10054. 637.37 s [vector] mut_modify: OK
  10055. 637.37 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10056. 637.37 s [vector] mut_generate: OK
  10057. 637.37 s [vector] +++ OK, passed 100 tests.
  10058. 637.40 s [vector] mut_generateM: OK (0.01s)
  10059. 637.40 s [vector] +++ OK, passed 100 tests.
  10060. 637.41 s [vector] mut_mapM_: OK (0.01s)
  10061. 637.41 s [vector] +++ OK, passed 100 tests.
  10062. 637.43 s [vector] mut_imapM_: OK (0.02s)
  10063. 637.43 s [vector] +++ OK, passed 100 tests.
  10064. 637.45 s [vector] mut_forM_: OK (0.02s)
  10065. 637.45 s [vector] +++ OK, passed 100 tests.
  10066. 637.46 s [vector] mut_iforM_: OK (0.02s)
  10067. 637.46 s [vector] +++ OK, passed 100 tests.
  10068. 637.46 s [vector] mut_foldr: OK
  10069. 637.46 s [vector] +++ OK, passed 100 tests.
  10070. 637.46 s [vector] mut_foldr': OK
  10071. 637.46 s [vector] +++ OK, passed 100 tests.
  10072. 637.46 s [vector] mut_foldl: OK
  10073. 637.46 s [vector] +++ OK, passed 100 tests.
  10074. 637.47 s [vector] mut_foldl': OK
  10075. 637.47 s [vector] +++ OK, passed 100 tests.
  10076. 637.47 s [vector] mut_ifoldr: OK
  10077. 637.47 s [vector] +++ OK, passed 100 tests.
  10078. 637.47 s [vector] mut_ifoldr': OK
  10079. 637.47 s [vector] +++ OK, passed 100 tests.
  10080. 637.48 s [vector] mut_ifoldl: OK
  10081. 637.48 s [vector] +++ OK, passed 100 tests.
  10082. 637.48 s [vector] mut_ifoldl': OK
  10083. 637.48 s [vector] +++ OK, passed 100 tests.
  10084. 637.48 s [vector] mut_foldM: OK
  10085. 637.48 s [vector] +++ OK, passed 100 tests.
  10086. 637.48 s [vector] mut_foldM': OK
  10087. 637.48 s [vector] +++ OK, passed 100 tests.
  10088. 637.48 s [vector] mut_foldrM: OK
  10089. 637.49 s [vector] +++ OK, passed 100 tests.
  10090. 637.49 s [vector] mut_foldrM': OK
  10091. 637.49 s [vector] +++ OK, passed 100 tests.
  10092. 637.49 s [vector] mut_ifoldM: OK
  10093. 637.49 s [vector] +++ OK, passed 100 tests.
  10094. 637.49 s [vector] mut_ifoldM': OK
  10095. 637.50 s [vector] +++ OK, passed 100 tests.
  10096. 637.50 s [vector] mut_ifoldrM: OK
  10097. 637.50 s [vector] +++ OK, passed 100 tests.
  10098. 637.50 s [vector] mut_ifoldrM': OK
  10099. 637.50 s [vector] +++ OK, passed 100 tests.
  10100. 637.50 s [vector] compare: OK
  10101. 637.50 s [vector] +++ OK, passed 100 tests.
  10102. 637.50 s [vector] maximum: OK
  10103. 637.51 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10104. 637.51 s [vector] minimum: OK
  10105. 637.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10106. 637.51 s [vector] minIndex: OK
  10107. 637.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10108. 637.51 s [vector] maxIndex: OK
  10109. 637.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10110. 637.51 s [vector] maximumBy: OK
  10111. 637.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10112. 637.51 s [vector] minimumBy: OK
  10113. 637.51 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10114. 637.51 s [vector] maximumOn: OK
  10115. 637.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10116. 637.51 s [vector] minimumOn: OK
  10117. 637.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10118. 637.51 s [vector] maxIndexBy: OK
  10119. 637.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10120. 637.51 s [vector] minIndexBy: OK
  10121. 637.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10122. 637.52 s [vector] ListFirstMaxIndexWins: OK
  10123. 637.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10124. 637.52 s [vector] FalseListFirstMaxIndexWins: OK
  10125. 637.52 s [vector] +++ OK, failed as expected. (after 1 test):
  10126. 637.52 s [vector] Exception:
  10127. 637.52 s [vector] Prelude.foldr1: empty list
  10128. 637.52 s [vector] CallStack (from HasCallStack):
  10129. 637.52 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10130. 637.52 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10131. 637.52 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10132. 637.52 s [vector] []
  10133. 637.52 s [vector] zip: OK
  10134. 637.52 s [vector] +++ OK, passed 100 tests.
  10135. 637.52 s [vector] zip3: OK
  10136. 637.52 s [vector] +++ OK, passed 100 tests.
  10137. 637.52 s [vector] unzip: OK
  10138. 637.52 s [vector] +++ OK, passed 100 tests.
  10139. 637.52 s [vector] unzip3: OK
  10140. 637.52 s [vector] +++ OK, passed 100 tests.
  10141. 637.52 s [vector] indexed: OK
  10142. 637.53 s [vector] +++ OK, passed 100 tests.
  10143. 637.53 s [vector] update: OK
  10144. 637.53 s [vector] +++ OK, passed 100 tests.
  10145. 637.54 s [vector] concat: OK (0.01s)
  10146. 637.54 s [vector] +++ OK, passed 100 tests.
  10147. 637.54 s [vector] mempty: OK
  10148. 637.54 s [vector] +++ OK, passed 1 test.
  10149. 637.54 s [vector] mappend: OK
  10150. 637.55 s [vector] +++ OK, passed 100 tests.
  10151. 637.55 s [vector] mconcat: OK (0.01s)
  10152. 637.55 s [vector] +++ OK, passed 100 tests.
  10153. 637.55 s [vector] fmap: OK
  10154. 637.55 s [vector] +++ OK, passed 100 tests.
  10155. 637.57 s [vector] return: OK
  10156. 637.57 s [vector] +++ OK, passed 100 tests.
  10157. 637.57 s [vector] bind: OK (0.02s)
  10158. 637.57 s [vector] +++ OK, passed 100 tests.
  10159. 637.57 s [vector] mzip: OK
  10160. 637.57 s [vector] +++ OK, passed 100 tests.
  10161. 637.57 s [vector] munzip: OK
  10162. 637.57 s [vector] +++ OK, passed 100 tests.
  10163. 637.57 s [vector] applicative_pure: OK
  10164. 637.59 s [vector] +++ OK, passed 100 tests.
  10165. 637.60 s [vector] applicative_appl: OK (0.03s)
  10166. 637.60 s [vector] +++ OK, passed 100 tests.
  10167. 637.61 s [vector] alternative_empty: OK
  10168. 637.61 s [vector] +++ OK, passed 1 test.
  10169. 637.61 s [vector] alternative_or: OK
  10170. 637.61 s [vector] +++ OK, passed 100 tests.
  10171. 637.69 s [vector] sequence: OK (0.08s)
  10172. 637.69 s [vector] +++ OK, passed 100 tests.
  10173. 637.71 s [vector] sequence_: OK (0.01s)
  10174. 637.71 s [vector] +++ OK, passed 100 tests.
  10175. 637.71 s [vector] glength: OK
  10176. 637.71 s [vector] +++ OK, passed 100 tests.
  10177. 637.71 s [vector] and: OK
  10178. 637.71 s [vector] +++ OK, passed 100 tests.
  10179. 637.71 s [vector] or: OK
  10180. 637.71 s [vector] +++ OK, passed 100 tests.
  10181. 637.71 s [vector] Int
  10182. 637.71 s [vector] fromList.toList == id: OK
  10183. 637.71 s [vector] +++ OK, passed 100 tests.
  10184. 637.71 s [vector] toList.fromList == id: OK
  10185. 637.71 s [vector] +++ OK, passed 100 tests.
  10186. 637.71 s [vector] unstream.stream == id: OK
  10187. 637.71 s [vector] +++ OK, passed 100 tests.
  10188. 637.71 s [vector] stream.unstream == id: OK
  10189. 637.71 s [vector] +++ OK, passed 100 tests.
  10190. 637.71 s [vector] eq: OK
  10191. 637.71 s [vector] +++ OK, passed 100 tests.
  10192. 637.71 s [vector] length: OK
  10193. 637.71 s [vector] +++ OK, passed 100 tests.
  10194. 637.71 s [vector] null: OK
  10195. 637.71 s [vector] +++ OK, passed 100 tests.
  10196. 637.71 s [vector] index: OK
  10197. 637.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10198. 637.71 s [vector] safeIndex: OK
  10199. 637.71 s [vector] +++ OK, passed 100 tests.
  10200. 637.72 s [vector] head: OK
  10201. 637.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10202. 637.72 s [vector] last: OK
  10203. 637.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10204. 637.72 s [vector] unsafeIndex: OK
  10205. 637.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10206. 637.72 s [vector] unsafeHead: OK
  10207. 637.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10208. 637.72 s [vector] unsafeLast: OK
  10209. 637.72 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10210. 637.72 s [vector] slice: OK
  10211. 637.72 s [vector] +++ OK, passed 100 tests.
  10212. 637.72 s [vector] init: OK
  10213. 637.72 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10214. 637.72 s [vector] tail: OK
  10215. 637.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10216. 637.72 s [vector] take: OK
  10217. 637.72 s [vector] +++ OK, passed 100 tests.
  10218. 637.72 s [vector] drop: OK
  10219. 637.72 s [vector] +++ OK, passed 100 tests.
  10220. 637.72 s [vector] splitAt: OK
  10221. 637.72 s [vector] +++ OK, passed 100 tests.
  10222. 637.72 s [vector] empty: OK
  10223. 637.72 s [vector] +++ OK, passed 1 test.
  10224. 637.72 s [vector] singleton: OK
  10225. 637.72 s [vector] +++ OK, passed 100 tests.
  10226. 637.72 s [vector] replicate: OK
  10227. 637.73 s [vector] +++ OK, passed 100 tests.
  10228. 637.73 s [vector] generate: OK
  10229. 637.73 s [vector] +++ OK, passed 100 tests.
  10230. 637.74 s [vector] iterateN: OK
  10231. 637.74 s [vector] +++ OK, passed 100 tests.
  10232. 637.76 s [vector] iterateNM: OK (0.03s)
  10233. 637.76 s [vector] +++ OK, passed 100 tests.
  10234. 637.84 s [vector] generateM: OK (0.06s)
  10235. 637.84 s [vector] +++ OK, passed 100 tests.
  10236. 637.86 s [vector] replicateM: OK (0.02s)
  10237. 637.86 s [vector] +++ OK, passed 100 tests.
  10238. 637.86 s [vector] create: OK
  10239. 637.86 s [vector] +++ OK, passed 100 tests.
  10240. 637.86 s [vector] createT: OK
  10241. 637.86 s [vector] +++ OK, passed 100 tests.
  10242. 637.86 s [vector] unfoldr: OK
  10243. 637.86 s [vector] +++ OK, passed 100 tests.
  10244. 637.86 s [vector] unfoldrN: OK
  10245. 637.86 s [vector] +++ OK, passed 100 tests.
  10246. 637.86 s [vector] unfoldrExactN: OK
  10247. 637.86 s [vector] +++ OK, passed 100 tests.
  10248. 637.86 s [vector] unfoldrM: OK
  10249. 637.86 s [vector] +++ OK, passed 100 tests.
  10250. 637.86 s [vector] unfoldrNM: OK
  10251. 637.86 s [vector] +++ OK, passed 100 tests.
  10252. 637.90 s [vector] unfoldrExactNM: OK (0.04s)
  10253. 637.90 s [vector] +++ OK, passed 100 tests.
  10254. 637.90 s [vector] constructN: OK
  10255. 637.90 s [vector] +++ OK, passed 100 tests.
  10256. 637.91 s [vector] constructrN: OK
  10257. 637.91 s [vector] +++ OK, passed 100 tests.
  10258. 637.91 s [vector] cons: OK
  10259. 637.91 s [vector] +++ OK, passed 100 tests.
  10260. 637.91 s [vector] snoc: OK
  10261. 637.91 s [vector] +++ OK, passed 100 tests.
  10262. 637.91 s [vector] append: OK
  10263. 637.92 s [vector] +++ OK, passed 100 tests.
  10264. 637.93 s [vector] concat: OK (0.02s)
  10265. 637.93 s [vector] +++ OK, passed 100 tests.
  10266. 637.93 s [vector] force: OK
  10267. 637.93 s [vector] +++ OK, passed 100 tests.
  10268. 637.93 s [vector] upd: OK
  10269. 637.93 s [vector] +++ OK, passed 100 tests.
  10270. 637.94 s [vector] accum: OK
  10271. 637.94 s [vector] +++ OK, passed 100 tests.
  10272. 637.94 s [vector] reverse: OK
  10273. 637.94 s [vector] +++ OK, passed 100 tests.
  10274. 637.94 s [vector] backpermute: OK
  10275. 637.94 s [vector] +++ OK, passed 100 tests.
  10276. 637.94 s [vector] map: OK
  10277. 637.94 s [vector] +++ OK, passed 100 tests.
  10278. 637.95 s [vector] imap: OK
  10279. 637.95 s [vector] +++ OK, passed 100 tests.
  10280. 637.95 s [vector] concatMap: OK
  10281. 637.95 s [vector] +++ OK, passed 100 tests.
  10282. 637.95 s [vector] mapM: OK
  10283. 637.95 s [vector] +++ OK, passed 100 tests.
  10284. 637.98 s [vector] mapM_: OK (0.03s)
  10285. 637.98 s [vector] +++ OK, passed 100 tests.
  10286. 637.98 s [vector] forM: OK
  10287. 637.98 s [vector] +++ OK, passed 100 tests.
  10288. 638.00 s [vector] forM_: OK (0.02s)
  10289. 638.00 s [vector] +++ OK, passed 100 tests.
  10290. 638.02 s [vector] imapM: OK
  10291. 638.02 s [vector] +++ OK, passed 100 tests.
  10292. 638.04 s [vector] imapM_: OK (0.03s)
  10293. 638.04 s [vector] +++ OK, passed 100 tests.
  10294. 638.04 s [vector] zipWith: OK
  10295. 638.04 s [vector] +++ OK, passed 100 tests.
  10296. 638.04 s [vector] zipWith3: OK
  10297. 638.04 s [vector] +++ OK, passed 100 tests.
  10298. 638.04 s [vector] izipWith: OK
  10299. 638.04 s [vector] +++ OK, passed 100 tests.
  10300. 638.05 s [vector] izipWith3: OK
  10301. 638.05 s [vector] +++ OK, passed 100 tests.
  10302. 638.05 s [vector] izipWithM: OK
  10303. 638.06 s [vector] +++ OK, passed 100 tests.
  10304. 638.08 s [vector] izipWithM_: OK (0.02s)
  10305. 638.08 s [vector] +++ OK, passed 100 tests.
  10306. 638.08 s [vector] zipWithM: OK
  10307. 638.08 s [vector] +++ OK, passed 100 tests.
  10308. 638.11 s [vector] zipWithM_: OK (0.02s)
  10309. 638.11 s [vector] +++ OK, passed 100 tests.
  10310. 638.11 s [vector] filter: OK
  10311. 638.11 s [vector] +++ OK, passed 100 tests.
  10312. 638.12 s [vector] ifilter: OK
  10313. 638.12 s [vector] +++ OK, passed 100 tests.
  10314. 638.15 s [vector] filterM: OK (0.04s)
  10315. 638.15 s [vector] +++ OK, passed 100 tests.
  10316. 638.15 s [vector] uniq: OK
  10317. 638.16 s [vector] +++ OK, passed 100 tests.
  10318. 638.16 s [vector] mapMaybe: OK
  10319. 638.16 s [vector] +++ OK, passed 100 tests.
  10320. 638.16 s [vector] imapMaybe: OK
  10321. 638.16 s [vector] +++ OK, passed 100 tests.
  10322. 638.16 s [vector] takeWhile: OK
  10323. 638.16 s [vector] +++ OK, passed 100 tests.
  10324. 638.16 s [vector] dropWhile: OK
  10325. 638.16 s [vector] +++ OK, passed 100 tests.
  10326. 638.16 s [vector] partition: OK
  10327. 638.16 s [vector] +++ OK, passed 100 tests.
  10328. 638.17 s [vector] partitionWith: OK
  10329. 638.17 s [vector] +++ OK, passed 100 tests.
  10330. 638.17 s [vector] span: OK
  10331. 638.17 s [vector] +++ OK, passed 100 tests.
  10332. 638.17 s [vector] break: OK
  10333. 638.17 s [vector] +++ OK, passed 100 tests.
  10334. 638.17 s [vector] spanR: OK
  10335. 638.17 s [vector] +++ OK, passed 100 tests.
  10336. 638.17 s [vector] breakR: OK
  10337. 638.17 s [vector] +++ OK, passed 100 tests.
  10338. 638.17 s [vector] groupBy: OK
  10339. 638.17 s [vector] +++ OK, passed 100 tests.
  10340. 638.17 s [vector] elem: OK
  10341. 638.17 s [vector] +++ OK, passed 100 tests.
  10342. 638.17 s [vector] notElem: OK
  10343. 638.17 s [vector] +++ OK, passed 100 tests.
  10344. 638.18 s [vector] find: OK
  10345. 638.18 s [vector] +++ OK, passed 100 tests.
  10346. 638.18 s [vector] findIndex: OK
  10347. 638.18 s [vector] +++ OK, passed 100 tests.
  10348. 638.18 s [vector] findIndexR: OK
  10349. 638.18 s [vector] +++ OK, passed 100 tests.
  10350. 638.18 s [vector] findIndices: OK
  10351. 638.18 s [vector] +++ OK, passed 100 tests.
  10352. 638.18 s [vector] elemIndex: OK
  10353. 638.18 s [vector] +++ OK, passed 100 tests.
  10354. 638.18 s [vector] elemIndices: OK
  10355. 638.18 s [vector] +++ OK, passed 100 tests.
  10356. 638.19 s [vector] foldl: OK
  10357. 638.19 s [vector] +++ OK, passed 100 tests.
  10358. 638.19 s [vector] foldl1: OK
  10359. 638.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10360. 638.19 s [vector] foldl': OK
  10361. 638.19 s [vector] +++ OK, passed 100 tests.
  10362. 638.19 s [vector] foldl1': OK
  10363. 638.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10364. 638.20 s [vector] foldr: OK
  10365. 638.20 s [vector] +++ OK, passed 100 tests.
  10366. 638.21 s [vector] foldr1: OK
  10367. 638.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10368. 638.21 s [vector] foldr': OK
  10369. 638.21 s [vector] +++ OK, passed 100 tests.
  10370. 638.21 s [vector] foldr1': OK
  10371. 638.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10372. 638.22 s [vector] ifoldl: OK
  10373. 638.22 s [vector] +++ OK, passed 100 tests.
  10374. 638.23 s [vector] ifoldl': OK
  10375. 638.23 s [vector] +++ OK, passed 100 tests.
  10376. 638.23 s [vector] ifoldr: OK
  10377. 638.23 s [vector] +++ OK, passed 100 tests.
  10378. 638.24 s [vector] ifoldr': OK (0.01s)
  10379. 638.24 s [vector] +++ OK, passed 100 tests.
  10380. 638.24 s [vector] ifoldM: OK
  10381. 638.25 s [vector] +++ OK, passed 100 tests.
  10382. 638.25 s [vector] ifoldM': OK
  10383. 638.26 s [vector] +++ OK, passed 100 tests.
  10384. 638.30 s [vector] ifoldM_: OK (0.04s)
  10385. 638.30 s [vector] +++ OK, passed 100 tests.
  10386. 638.35 s [vector] ifoldM'_: OK (0.05s)
  10387. 638.35 s [vector] +++ OK, passed 100 tests.
  10388. 638.35 s [vector] all: OK
  10389. 638.35 s [vector] +++ OK, passed 100 tests.
  10390. 638.35 s [vector] any: OK
  10391. 638.35 s [vector] +++ OK, passed 100 tests.
  10392. 638.36 s [vector] prescanl: OK
  10393. 638.36 s [vector] +++ OK, passed 100 tests.
  10394. 638.36 s [vector] prescanl': OK
  10395. 638.36 s [vector] +++ OK, passed 100 tests.
  10396. 638.36 s [vector] postscanl: OK
  10397. 638.37 s [vector] +++ OK, passed 100 tests.
  10398. 638.37 s [vector] postscanl': OK
  10399. 638.37 s [vector] +++ OK, passed 100 tests.
  10400. 638.38 s [vector] scanl: OK
  10401. 638.38 s [vector] +++ OK, passed 100 tests.
  10402. 638.38 s [vector] scanl': OK
  10403. 638.38 s [vector] +++ OK, passed 100 tests.
  10404. 638.38 s [vector] scanl1: OK
  10405. 638.38 s [vector] +++ OK, passed 100 tests.
  10406. 638.39 s [vector] scanl1': OK
  10407. 638.39 s [vector] +++ OK, passed 100 tests.
  10408. 638.40 s [vector] iscanl: OK
  10409. 638.40 s [vector] +++ OK, passed 100 tests.
  10410. 638.40 s [vector] iscanl': OK
  10411. 638.40 s [vector] +++ OK, passed 100 tests.
  10412. 638.40 s [vector] prescanr: OK
  10413. 638.40 s [vector] +++ OK, passed 100 tests.
  10414. 638.41 s [vector] prescanr': OK
  10415. 638.41 s [vector] +++ OK, passed 100 tests.
  10416. 638.41 s [vector] postscanr: OK
  10417. 638.41 s [vector] +++ OK, passed 100 tests.
  10418. 638.42 s [vector] postscanr': OK
  10419. 638.42 s [vector] +++ OK, passed 100 tests.
  10420. 638.42 s [vector] scanr: OK
  10421. 638.42 s [vector] +++ OK, passed 100 tests.
  10422. 638.43 s [vector] scanr': OK
  10423. 638.43 s [vector] +++ OK, passed 100 tests.
  10424. 638.43 s [vector] scanr1: OK
  10425. 638.43 s [vector] +++ OK, passed 100 tests.
  10426. 638.44 s [vector] scanr1': OK
  10427. 638.44 s [vector] +++ OK, passed 100 tests.
  10428. 638.44 s [vector] iscanr: OK
  10429. 638.44 s [vector] +++ OK, passed 100 tests.
  10430. 638.44 s [vector] iscanr': OK
  10431. 638.44 s [vector] +++ OK, passed 100 tests.
  10432. 638.44 s [vector] mut_read: OK
  10433. 638.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10434. 638.44 s [vector] mut_write: OK
  10435. 638.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10436. 638.45 s [vector] mut_modify: OK
  10437. 638.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10438. 638.45 s [vector] mut_generate: OK
  10439. 638.45 s [vector] +++ OK, passed 100 tests.
  10440. 638.46 s [vector] mut_generateM: OK
  10441. 638.46 s [vector] +++ OK, passed 100 tests.
  10442. 638.48 s [vector] mut_mapM_: OK (0.02s)
  10443. 638.48 s [vector] +++ OK, passed 100 tests.
  10444. 638.50 s [vector] mut_imapM_: OK (0.02s)
  10445. 638.50 s [vector] +++ OK, passed 100 tests.
  10446. 638.54 s [vector] mut_forM_: OK (0.02s)
  10447. 638.54 s [vector] +++ OK, passed 100 tests.
  10448. 638.55 s [vector] mut_iforM_: OK (0.02s)
  10449. 638.55 s [vector] +++ OK, passed 100 tests.
  10450. 638.55 s [vector] mut_foldr: OK
  10451. 638.55 s [vector] +++ OK, passed 100 tests.
  10452. 638.55 s [vector] mut_foldr': OK
  10453. 638.55 s [vector] +++ OK, passed 100 tests.
  10454. 638.57 s [vector] mut_foldl: OK
  10455. 638.57 s [vector] +++ OK, passed 100 tests.
  10456. 638.58 s [vector] mut_foldl': OK (0.02s)
  10457. 638.58 s [vector] +++ OK, passed 100 tests.
  10458. 638.58 s [vector] mut_ifoldr: OK
  10459. 638.58 s [vector] +++ OK, passed 100 tests.
  10460. 638.59 s [vector] mut_ifoldr': OK
  10461. 638.59 s [vector] +++ OK, passed 100 tests.
  10462. 638.60 s [vector] mut_ifoldl: OK
  10463. 638.60 s [vector] +++ OK, passed 100 tests.
  10464. 638.60 s [vector] mut_ifoldl': OK
  10465. 638.60 s [vector] +++ OK, passed 100 tests.
  10466. 638.60 s [vector] mut_foldM: OK
  10467. 638.61 s [vector] +++ OK, passed 100 tests.
  10468. 638.61 s [vector] mut_foldM': OK
  10469. 638.61 s [vector] +++ OK, passed 100 tests.
  10470. 638.61 s [vector] mut_foldrM: OK
  10471. 638.61 s [vector] +++ OK, passed 100 tests.
  10472. 638.62 s [vector] mut_foldrM': OK
  10473. 638.62 s [vector] +++ OK, passed 100 tests.
  10474. 638.62 s [vector] mut_ifoldM: OK
  10475. 638.62 s [vector] +++ OK, passed 100 tests.
  10476. 638.62 s [vector] mut_ifoldM': OK
  10477. 638.63 s [vector] +++ OK, passed 100 tests.
  10478. 638.63 s [vector] mut_ifoldrM: OK
  10479. 638.63 s [vector] +++ OK, passed 100 tests.
  10480. 638.63 s [vector] mut_ifoldrM': OK
  10481. 638.63 s [vector] +++ OK, passed 100 tests.
  10482. 638.63 s [vector] compare: OK
  10483. 638.64 s [vector] +++ OK, passed 100 tests.
  10484. 638.64 s [vector] maximum: OK
  10485. 638.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10486. 638.64 s [vector] minimum: OK
  10487. 638.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10488. 638.64 s [vector] minIndex: OK
  10489. 638.64 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10490. 638.64 s [vector] maxIndex: OK
  10491. 638.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10492. 638.64 s [vector] maximumBy: OK
  10493. 638.64 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10494. 638.64 s [vector] minimumBy: OK
  10495. 638.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10496. 638.64 s [vector] maximumOn: OK
  10497. 638.64 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10498. 638.65 s [vector] minimumOn: OK
  10499. 638.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10500. 638.65 s [vector] maxIndexBy: OK
  10501. 638.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10502. 638.65 s [vector] minIndexBy: OK
  10503. 638.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10504. 638.65 s [vector] ListFirstMaxIndexWins: OK
  10505. 638.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10506. 638.65 s [vector] FalseListFirstMaxIndexWins: OK
  10507. 638.65 s [vector] +++ OK, failed as expected. (after 1 test):
  10508. 638.65 s [vector] Exception:
  10509. 638.65 s [vector] Prelude.foldr1: empty list
  10510. 638.65 s [vector] CallStack (from HasCallStack):
  10511. 638.65 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10512. 638.65 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10513. 638.65 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10514. 638.65 s [vector] []
  10515. 638.65 s [vector] zip: OK
  10516. 638.65 s [vector] +++ OK, passed 100 tests.
  10517. 638.65 s [vector] zip3: OK
  10518. 638.65 s [vector] +++ OK, passed 100 tests.
  10519. 638.65 s [vector] unzip: OK
  10520. 638.65 s [vector] +++ OK, passed 100 tests.
  10521. 638.65 s [vector] unzip3: OK
  10522. 638.65 s [vector] +++ OK, passed 100 tests.
  10523. 638.65 s [vector] indexed: OK
  10524. 638.66 s [vector] +++ OK, passed 100 tests.
  10525. 638.66 s [vector] update: OK
  10526. 638.66 s [vector] +++ OK, passed 100 tests.
  10527. 638.67 s [vector] concat: OK (0.02s)
  10528. 638.67 s [vector] +++ OK, passed 100 tests.
  10529. 638.67 s [vector] mempty: OK
  10530. 638.67 s [vector] +++ OK, passed 1 test.
  10531. 638.68 s [vector] mappend: OK
  10532. 638.68 s [vector] +++ OK, passed 100 tests.
  10533. 638.69 s [vector] mconcat: OK (0.02s)
  10534. 638.69 s [vector] +++ OK, passed 100 tests.
  10535. 638.70 s [vector] fmap: OK
  10536. 638.70 s [vector] +++ OK, passed 100 tests.
  10537. 638.70 s [vector] return: OK
  10538. 638.70 s [vector] +++ OK, passed 100 tests.
  10539. 638.73 s [vector] bind: OK (0.03s)
  10540. 638.73 s [vector] +++ OK, passed 100 tests.
  10541. 638.73 s [vector] mzip: OK
  10542. 638.73 s [vector] +++ OK, passed 100 tests.
  10543. 638.73 s [vector] munzip: OK
  10544. 638.73 s [vector] +++ OK, passed 100 tests.
  10545. 638.74 s [vector] applicative_pure: OK
  10546. 638.74 s [vector] +++ OK, passed 100 tests.
  10547. 638.79 s [vector] applicative_appl: OK (0.06s)
  10548. 638.79 s [vector] +++ OK, passed 100 tests.
  10549. 638.79 s [vector] alternative_empty: OK
  10550. 638.79 s [vector] +++ OK, passed 1 test.
  10551. 638.80 s [vector] alternative_or: OK
  10552. 638.80 s [vector] +++ OK, passed 100 tests.
  10553. 638.86 s [vector] sequence: OK (0.05s)
  10554. 638.86 s [vector] +++ OK, passed 100 tests.
  10555. 638.86 s [vector] sequence_: OK (0.02s)
  10556. 638.86 s [vector] +++ OK, passed 100 tests.
  10557. 638.86 s [vector] glength: OK
  10558. 638.86 s [vector] +++ OK, passed 100 tests.
  10559. 638.86 s [vector] sum: OK
  10560. 638.86 s [vector] +++ OK, passed 100 tests.
  10561. 638.86 s [vector] product: OK
  10562. 638.86 s [vector] +++ OK, passed 100 tests.
  10563. 638.86 s [vector] enumFromN: OK
  10564. 638.86 s [vector] +++ OK, passed 100 tests.
  10565. 638.86 s [vector] enumFromThenN: OK
  10566. 638.86 s [vector] +++ OK, passed 100 tests.
  10567. 638.86 s [vector] enumFromTo: OK
  10568. 638.86 s [vector] +++ OK, passed 100 tests.
  10569. 638.86 s [vector] enumFromThenTo: OK
  10570. 638.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10571. 638.86 s [vector] unstream
  10572. 638.86 s [vector] unstream == vunstream (exact): OK
  10573. 638.86 s [vector] +++ OK, passed 100 tests.
  10574. 638.86 s [vector] unstream == vunstream (unknown): OK
  10575. 638.86 s [vector] +++ OK, passed 100 tests.
  10576. 638.86 s [vector] unstreamR ~= vunstream (exact): OK
  10577. 638.87 s [vector] +++ OK, passed 100 tests.
  10578. 638.87 s [vector] unstreamR ~= vunstream (unknown): OK
  10579. 638.87 s [vector] +++ OK, passed 100 tests.
  10580. 638.87 s [vector] Tests.Vector.Unboxed
  10581. 638.87 s [vector] ()
  10582. 638.87 s [vector] fromList.toList == id: OK
  10583. 638.87 s [vector] +++ OK, passed 100 tests.
  10584. 638.87 s [vector] toList.fromList == id: OK
  10585. 638.87 s [vector] +++ OK, passed 100 tests.
  10586. 638.87 s [vector] unstream.stream == id: OK
  10587. 638.87 s [vector] +++ OK, passed 100 tests.
  10588. 638.87 s [vector] stream.unstream == id: OK
  10589. 638.87 s [vector] +++ OK, passed 100 tests.
  10590. 638.87 s [vector] eq: OK
  10591. 638.87 s [vector] +++ OK, passed 100 tests.
  10592. 638.87 s [vector] length: OK
  10593. 638.87 s [vector] +++ OK, passed 100 tests.
  10594. 638.87 s [vector] null: OK
  10595. 638.87 s [vector] +++ OK, passed 100 tests.
  10596. 638.87 s [vector] index: OK
  10597. 638.87 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10598. 638.87 s [vector] safeIndex: OK
  10599. 638.87 s [vector] +++ OK, passed 100 tests.
  10600. 638.87 s [vector] head: OK
  10601. 638.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10602. 638.87 s [vector] last: OK
  10603. 638.87 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10604. 638.87 s [vector] unsafeIndex: OK
  10605. 638.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10606. 638.89 s [vector] unsafeHead: OK
  10607. 638.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10608. 638.89 s [vector] unsafeLast: OK
  10609. 638.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10610. 638.89 s [vector] slice: OK
  10611. 638.89 s [vector] +++ OK, passed 100 tests.
  10612. 638.89 s [vector] init: OK
  10613. 638.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10614. 638.90 s [vector] tail: OK
  10615. 638.90 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10616. 638.90 s [vector] take: OK
  10617. 638.90 s [vector] +++ OK, passed 100 tests.
  10618. 638.90 s [vector] drop: OK
  10619. 638.90 s [vector] +++ OK, passed 100 tests.
  10620. 638.90 s [vector] splitAt: OK
  10621. 638.90 s [vector] +++ OK, passed 100 tests.
  10622. 638.90 s [vector] empty: OK
  10623. 638.90 s [vector] +++ OK, passed 1 test.
  10624. 638.90 s [vector] singleton: OK
  10625. 638.90 s [vector] +++ OK, passed 100 tests.
  10626. 638.90 s [vector] replicate: OK
  10627. 638.90 s [vector] +++ OK, passed 100 tests.
  10628. 638.90 s [vector] generate: OK
  10629. 638.90 s [vector] +++ OK, passed 100 tests.
  10630. 638.92 s [vector] iterateN: OK
  10631. 638.92 s [vector] +++ OK, passed 100 tests.
  10632. 638.94 s [vector] iterateNM: OK (0.05s)
  10633. 638.94 s [vector] +++ OK, passed 100 tests.
  10634. 638.94 s [vector] generateM: OK (0.01s)
  10635. 638.94 s [vector] +++ OK, passed 100 tests.
  10636. 639.00 s [vector] replicateM: OK (0.02s)
  10637. 639.00 s [vector] +++ OK, passed 100 tests.
  10638. 639.00 s [vector] create: OK
  10639. 639.00 s [vector] +++ OK, passed 100 tests.
  10640. 639.00 s [vector] createT: OK
  10641. 639.00 s [vector] +++ OK, passed 100 tests.
  10642. 639.00 s [vector] unfoldr: OK
  10643. 639.00 s [vector] +++ OK, passed 100 tests.
  10644. 639.00 s [vector] unfoldrN: OK
  10645. 639.00 s [vector] +++ OK, passed 100 tests.
  10646. 639.00 s [vector] unfoldrExactN: OK
  10647. 639.00 s [vector] +++ OK, passed 100 tests.
  10648. 639.00 s [vector] unfoldrM: OK
  10649. 639.01 s [vector] +++ OK, passed 100 tests.
  10650. 639.04 s [vector] unfoldrNM: OK
  10651. 639.04 s [vector] +++ OK, passed 100 tests.
  10652. 639.05 s [vector] unfoldrExactNM: OK (0.04s)
  10653. 639.05 s [vector] +++ OK, passed 100 tests.
  10654. 639.05 s [vector] constructN: OK
  10655. 639.05 s [vector] +++ OK, passed 100 tests.
  10656. 639.05 s [vector] constructrN: OK
  10657. 639.05 s [vector] +++ OK, passed 100 tests.
  10658. 639.06 s [vector] cons: OK
  10659. 639.06 s [vector] +++ OK, passed 100 tests.
  10660. 639.06 s [vector] snoc: OK
  10661. 639.06 s [vector] +++ OK, passed 100 tests.
  10662. 639.06 s [vector] append: OK
  10663. 639.06 s [vector] +++ OK, passed 100 tests.
  10664. 639.07 s [vector] concat: OK (0.02s)
  10665. 639.07 s [vector] +++ OK, passed 100 tests.
  10666. 639.07 s [vector] force: OK
  10667. 639.08 s [vector] +++ OK, passed 100 tests.
  10668. 639.08 s [vector] upd: OK
  10669. 639.08 s [vector] +++ OK, passed 100 tests.
  10670. 639.08 s [vector] accum: OK
  10671. 639.08 s [vector] +++ OK, passed 100 tests.
  10672. 639.08 s [vector] reverse: OK
  10673. 639.08 s [vector] +++ OK, passed 100 tests.
  10674. 639.08 s [vector] backpermute: OK
  10675. 639.08 s [vector] +++ OK, passed 100 tests.
  10676. 639.08 s [vector] map: OK
  10677. 639.08 s [vector] +++ OK, passed 100 tests.
  10678. 639.09 s [vector] imap: OK
  10679. 639.09 s [vector] +++ OK, passed 100 tests.
  10680. 639.09 s [vector] concatMap: OK
  10681. 639.09 s [vector] +++ OK, passed 100 tests.
  10682. 639.10 s [vector] mapM: OK
  10683. 639.10 s [vector] +++ OK, passed 100 tests.
  10684. 639.11 s [vector] mapM_: OK (0.02s)
  10685. 639.11 s [vector] +++ OK, passed 100 tests.
  10686. 639.12 s [vector] forM: OK
  10687. 639.12 s [vector] +++ OK, passed 100 tests.
  10688. 639.12 s [vector] forM_: OK (0.01s)
  10689. 639.12 s [vector] +++ OK, passed 100 tests.
  10690. 639.14 s [vector] imapM: OK
  10691. 639.14 s [vector] +++ OK, passed 100 tests.
  10692. 639.14 s [vector] imapM_: OK (0.01s)
  10693. 639.14 s [vector] +++ OK, passed 100 tests.
  10694. 639.14 s [vector] zipWith: OK
  10695. 639.14 s [vector] +++ OK, passed 100 tests.
  10696. 639.14 s [vector] zipWith3: OK
  10697. 639.14 s [vector] +++ OK, passed 100 tests.
  10698. 639.14 s [vector] izipWith: OK
  10699. 639.14 s [vector] +++ OK, passed 100 tests.
  10700. 639.14 s [vector] izipWith3: OK
  10701. 639.14 s [vector] +++ OK, passed 100 tests.
  10702. 639.16 s [vector] izipWithM: OK
  10703. 639.16 s [vector] +++ OK, passed 100 tests.
  10704. 639.16 s [vector] izipWithM_: OK (0.01s)
  10705. 639.16 s [vector] +++ OK, passed 100 tests.
  10706. 639.16 s [vector] zipWithM: OK
  10707. 639.16 s [vector] +++ OK, passed 100 tests.
  10708. 639.17 s [vector] zipWithM_: OK (0.01s)
  10709. 639.17 s [vector] +++ OK, passed 100 tests.
  10710. 639.17 s [vector] filter: OK
  10711. 639.17 s [vector] +++ OK, passed 100 tests.
  10712. 639.17 s [vector] ifilter: OK
  10713. 639.18 s [vector] +++ OK, passed 100 tests.
  10714. 639.20 s [vector] filterM: OK (0.02s)
  10715. 639.20 s [vector] +++ OK, passed 100 tests.
  10716. 639.20 s [vector] uniq: OK
  10717. 639.20 s [vector] +++ OK, passed 100 tests.
  10718. 639.20 s [vector] mapMaybe: OK
  10719. 639.20 s [vector] +++ OK, passed 100 tests.
  10720. 639.20 s [vector] imapMaybe: OK
  10721. 639.20 s [vector] +++ OK, passed 100 tests.
  10722. 639.20 s [vector] takeWhile: OK
  10723. 639.20 s [vector] +++ OK, passed 100 tests.
  10724. 639.20 s [vector] dropWhile: OK
  10725. 639.20 s [vector] +++ OK, passed 100 tests.
  10726. 639.20 s [vector] partition: OK
  10727. 639.20 s [vector] +++ OK, passed 100 tests.
  10728. 639.20 s [vector] partitionWith: OK
  10729. 639.20 s [vector] +++ OK, passed 100 tests.
  10730. 639.20 s [vector] span: OK
  10731. 639.21 s [vector] +++ OK, passed 100 tests.
  10732. 639.21 s [vector] break: OK
  10733. 639.21 s [vector] +++ OK, passed 100 tests.
  10734. 639.21 s [vector] spanR: OK
  10735. 639.21 s [vector] +++ OK, passed 100 tests.
  10736. 639.21 s [vector] breakR: OK
  10737. 639.21 s [vector] +++ OK, passed 100 tests.
  10738. 639.21 s [vector] groupBy: OK
  10739. 639.21 s [vector] +++ OK, passed 100 tests.
  10740. 639.21 s [vector] elem: OK
  10741. 639.21 s [vector] +++ OK, passed 100 tests.
  10742. 639.22 s [vector] notElem: OK
  10743. 639.22 s [vector] +++ OK, passed 100 tests.
  10744. 639.22 s [vector] find: OK
  10745. 639.22 s [vector] +++ OK, passed 100 tests.
  10746. 639.22 s [vector] findIndex: OK
  10747. 639.22 s [vector] +++ OK, passed 100 tests.
  10748. 639.23 s [vector] findIndexR: OK
  10749. 639.23 s [vector] +++ OK, passed 100 tests.
  10750. 639.23 s [vector] findIndices: OK
  10751. 639.23 s [vector] +++ OK, passed 100 tests.
  10752. 639.23 s [vector] elemIndex: OK
  10753. 639.23 s [vector] +++ OK, passed 100 tests.
  10754. 639.23 s [vector] elemIndices: OK
  10755. 639.23 s [vector] +++ OK, passed 100 tests.
  10756. 639.23 s [vector] foldl: OK
  10757. 639.24 s [vector] +++ OK, passed 100 tests.
  10758. 639.24 s [vector] foldl1: OK
  10759. 639.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10760. 639.25 s [vector] foldl': OK
  10761. 639.25 s [vector] +++ OK, passed 100 tests.
  10762. 639.25 s [vector] foldl1': OK
  10763. 639.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10764. 639.26 s [vector] foldr: OK
  10765. 639.26 s [vector] +++ OK, passed 100 tests.
  10766. 639.26 s [vector] foldr1: OK
  10767. 639.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10768. 639.26 s [vector] foldr': OK
  10769. 639.26 s [vector] +++ OK, passed 100 tests.
  10770. 639.27 s [vector] foldr1': OK
  10771. 639.27 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10772. 639.28 s [vector] ifoldl: OK
  10773. 639.28 s [vector] +++ OK, passed 100 tests.
  10774. 639.28 s [vector] ifoldl': OK
  10775. 639.28 s [vector] +++ OK, passed 100 tests.
  10776. 639.28 s [vector] ifoldr: OK
  10777. 639.28 s [vector] +++ OK, passed 100 tests.
  10778. 639.28 s [vector] ifoldr': OK
  10779. 639.28 s [vector] +++ OK, passed 100 tests.
  10780. 639.28 s [vector] ifoldM: OK
  10781. 639.28 s [vector] +++ OK, passed 100 tests.
  10782. 639.28 s [vector] ifoldM': OK
  10783. 639.30 s [vector] +++ OK, passed 100 tests.
  10784. 639.32 s [vector] ifoldM_: OK (0.02s)
  10785. 639.32 s [vector] +++ OK, passed 100 tests.
  10786. 639.32 s [vector] ifoldM'_: OK (0.02s)
  10787. 639.32 s [vector] +++ OK, passed 100 tests.
  10788. 639.32 s [vector] all: OK
  10789. 639.32 s [vector] +++ OK, passed 100 tests.
  10790. 639.32 s [vector] any: OK
  10791. 639.32 s [vector] +++ OK, passed 100 tests.
  10792. 639.32 s [vector] prescanl: OK
  10793. 639.33 s [vector] +++ OK, passed 100 tests.
  10794. 639.33 s [vector] prescanl': OK
  10795. 639.33 s [vector] +++ OK, passed 100 tests.
  10796. 639.33 s [vector] postscanl: OK
  10797. 639.33 s [vector] +++ OK, passed 100 tests.
  10798. 639.33 s [vector] postscanl': OK
  10799. 639.33 s [vector] +++ OK, passed 100 tests.
  10800. 639.34 s [vector] scanl: OK
  10801. 639.34 s [vector] +++ OK, passed 100 tests.
  10802. 639.34 s [vector] scanl': OK
  10803. 639.35 s [vector] +++ OK, passed 100 tests.
  10804. 639.35 s [vector] scanl1: OK
  10805. 639.35 s [vector] +++ OK, passed 100 tests.
  10806. 639.36 s [vector] scanl1': OK
  10807. 639.36 s [vector] +++ OK, passed 100 tests.
  10808. 639.37 s [vector] iscanl: OK (0.01s)
  10809. 639.37 s [vector] +++ OK, passed 100 tests.
  10810. 639.37 s [vector] iscanl': OK
  10811. 639.38 s [vector] +++ OK, passed 100 tests.
  10812. 639.38 s [vector] prescanr: OK
  10813. 639.39 s [vector] +++ OK, passed 100 tests.
  10814. 639.39 s [vector] prescanr': OK
  10815. 639.39 s [vector] +++ OK, passed 100 tests.
  10816. 639.39 s [vector] postscanr: OK
  10817. 639.39 s [vector] +++ OK, passed 100 tests.
  10818. 639.39 s [vector] postscanr': OK
  10819. 639.39 s [vector] +++ OK, passed 100 tests.
  10820. 639.39 s [vector] scanr: OK
  10821. 639.39 s [vector] +++ OK, passed 100 tests.
  10822. 639.40 s [vector] scanr': OK
  10823. 639.40 s [vector] +++ OK, passed 100 tests.
  10824. 639.40 s [vector] scanr1: OK
  10825. 639.40 s [vector] +++ OK, passed 100 tests.
  10826. 639.40 s [vector] scanr1': OK
  10827. 639.40 s [vector] +++ OK, passed 100 tests.
  10828. 639.40 s [vector] iscanr: OK
  10829. 639.40 s [vector] +++ OK, passed 100 tests.
  10830. 639.40 s [vector] iscanr': OK
  10831. 639.41 s [vector] +++ OK, passed 100 tests.
  10832. 639.41 s [vector] mut_read: OK
  10833. 639.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10834. 639.41 s [vector] mut_write: OK
  10835. 639.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10836. 639.41 s [vector] mut_modify: OK
  10837. 639.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10838. 639.41 s [vector] mut_generate: OK
  10839. 639.42 s [vector] +++ OK, passed 100 tests.
  10840. 639.42 s [vector] mut_generateM: OK
  10841. 639.42 s [vector] +++ OK, passed 100 tests.
  10842. 639.44 s [vector] mut_mapM_: OK (0.02s)
  10843. 639.44 s [vector] +++ OK, passed 100 tests.
  10844. 639.46 s [vector] mut_imapM_: OK (0.01s)
  10845. 639.46 s [vector] +++ OK, passed 100 tests.
  10846. 639.46 s [vector] mut_forM_: OK
  10847. 639.46 s [vector] +++ OK, passed 100 tests.
  10848. 639.48 s [vector] mut_iforM_: OK (0.02s)
  10849. 639.48 s [vector] +++ OK, passed 100 tests.
  10850. 639.50 s [vector] mut_foldr: OK (0.02s)
  10851. 639.50 s [vector] +++ OK, passed 100 tests.
  10852. 639.50 s [vector] mut_foldr': OK
  10853. 639.50 s [vector] +++ OK, passed 100 tests.
  10854. 639.51 s [vector] mut_foldl: OK
  10855. 639.52 s [vector] +++ OK, passed 100 tests.
  10856. 639.52 s [vector] mut_foldl': OK
  10857. 639.52 s [vector] +++ OK, passed 100 tests.
  10858. 639.54 s [vector] mut_ifoldr: OK
  10859. 639.54 s [vector] +++ OK, passed 100 tests.
  10860. 639.54 s [vector] mut_ifoldr': OK
  10861. 639.55 s [vector] +++ OK, passed 100 tests.
  10862. 639.55 s [vector] mut_ifoldl: OK
  10863. 639.55 s [vector] +++ OK, passed 100 tests.
  10864. 639.56 s [vector] mut_ifoldl': OK
  10865. 639.56 s [vector] +++ OK, passed 100 tests.
  10866. 639.56 s [vector] mut_foldM: OK
  10867. 639.57 s [vector] +++ OK, passed 100 tests.
  10868. 639.58 s [vector] mut_foldM': OK
  10869. 639.58 s [vector] +++ OK, passed 100 tests.
  10870. 639.58 s [vector] mut_foldrM: OK
  10871. 639.58 s [vector] +++ OK, passed 100 tests.
  10872. 639.58 s [vector] mut_foldrM': OK
  10873. 639.58 s [vector] +++ OK, passed 100 tests.
  10874. 639.59 s [vector] mut_ifoldM: OK
  10875. 639.59 s [vector] +++ OK, passed 100 tests.
  10876. 639.59 s [vector] mut_ifoldM': OK
  10877. 639.59 s [vector] +++ OK, passed 100 tests.
  10878. 639.59 s [vector] mut_ifoldrM: OK
  10879. 639.59 s [vector] +++ OK, passed 100 tests.
  10880. 639.59 s [vector] mut_ifoldrM': OK
  10881. 639.59 s [vector] +++ OK, passed 100 tests.
  10882. 639.60 s [vector] compare: OK
  10883. 639.60 s [vector] +++ OK, passed 100 tests.
  10884. 639.60 s [vector] maximum: OK
  10885. 639.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10886. 639.60 s [vector] minimum: OK
  10887. 639.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10888. 639.60 s [vector] minIndex: OK
  10889. 639.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10890. 639.60 s [vector] maxIndex: OK
  10891. 639.60 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10892. 639.60 s [vector] maximumBy: OK
  10893. 639.60 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10894. 639.60 s [vector] minimumBy: OK
  10895. 639.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10896. 639.60 s [vector] maximumOn: OK
  10897. 639.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10898. 639.60 s [vector] minimumOn: OK
  10899. 639.60 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10900. 639.60 s [vector] maxIndexBy: OK
  10901. 639.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10902. 639.60 s [vector] minIndexBy: OK
  10903. 639.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10904. 639.61 s [vector] ListFirstMaxIndexWins: OK
  10905. 639.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10906. 639.61 s [vector] FalseListFirstMaxIndexWins: OK
  10907. 639.61 s [vector] +++ OK, failed as expected. (after 1 test):
  10908. 639.61 s [vector] Exception:
  10909. 639.61 s [vector] Prelude.foldr1: empty list
  10910. 639.61 s [vector] CallStack (from HasCallStack):
  10911. 639.61 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10912. 639.61 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10913. 639.61 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10914. 639.61 s [vector] []
  10915. 639.61 s [vector] zip: OK
  10916. 639.61 s [vector] +++ OK, passed 100 tests.
  10917. 639.61 s [vector] zip3: OK
  10918. 639.61 s [vector] +++ OK, passed 100 tests.
  10919. 639.61 s [vector] unzip: OK
  10920. 639.61 s [vector] +++ OK, passed 100 tests.
  10921. 639.62 s [vector] unzip3: OK
  10922. 639.62 s [vector] +++ OK, passed 100 tests.
  10923. 639.62 s [vector] indexed: OK
  10924. 639.62 s [vector] +++ OK, passed 100 tests.
  10925. 639.62 s [vector] update: OK
  10926. 639.62 s [vector] +++ OK, passed 100 tests.
  10927. 639.62 s [vector] mempty: OK
  10928. 639.62 s [vector] +++ OK, passed 1 test.
  10929. 639.62 s [vector] mappend: OK
  10930. 639.62 s [vector] +++ OK, passed 100 tests.
  10931. 639.64 s [vector] mconcat: OK (0.02s)
  10932. 639.64 s [vector] +++ OK, passed 100 tests.
  10933. 639.64 s [vector] glength: OK
  10934. 639.64 s [vector] +++ OK, passed 100 tests.
  10935. 639.64 s [vector] (Bool)
  10936. 639.64 s [vector] fromList.toList == id: OK
  10937. 639.64 s [vector] +++ OK, passed 100 tests.
  10938. 639.65 s [vector] toList.fromList == id: OK
  10939. 639.65 s [vector] +++ OK, passed 100 tests.
  10940. 639.65 s [vector] unstream.stream == id: OK
  10941. 639.65 s [vector] +++ OK, passed 100 tests.
  10942. 639.65 s [vector] stream.unstream == id: OK
  10943. 639.65 s [vector] +++ OK, passed 100 tests.
  10944. 639.65 s [vector] eq: OK
  10945. 639.65 s [vector] +++ OK, passed 100 tests.
  10946. 639.65 s [vector] length: OK
  10947. 639.65 s [vector] +++ OK, passed 100 tests.
  10948. 639.65 s [vector] null: OK
  10949. 639.65 s [vector] +++ OK, passed 100 tests.
  10950. 639.65 s [vector] index: OK
  10951. 639.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10952. 639.65 s [vector] safeIndex: OK
  10953. 639.65 s [vector] +++ OK, passed 100 tests.
  10954. 639.65 s [vector] head: OK
  10955. 639.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10956. 639.65 s [vector] last: OK
  10957. 639.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10958. 639.66 s [vector] unsafeIndex: OK
  10959. 639.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10960. 639.66 s [vector] unsafeHead: OK
  10961. 639.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10962. 639.66 s [vector] unsafeLast: OK
  10963. 639.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10964. 639.66 s [vector] slice: OK
  10965. 639.66 s [vector] +++ OK, passed 100 tests.
  10966. 639.66 s [vector] init: OK
  10967. 639.66 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10968. 639.66 s [vector] tail: OK
  10969. 639.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10970. 639.66 s [vector] take: OK
  10971. 639.66 s [vector] +++ OK, passed 100 tests.
  10972. 639.66 s [vector] drop: OK
  10973. 639.66 s [vector] +++ OK, passed 100 tests.
  10974. 639.66 s [vector] splitAt: OK
  10975. 639.66 s [vector] +++ OK, passed 100 tests.
  10976. 639.66 s [vector] empty: OK
  10977. 639.66 s [vector] +++ OK, passed 1 test.
  10978. 639.66 s [vector] singleton: OK
  10979. 639.67 s [vector] +++ OK, passed 100 tests.
  10980. 639.67 s [vector] replicate: OK
  10981. 639.67 s [vector] +++ OK, passed 100 tests.
  10982. 639.67 s [vector] generate: OK
  10983. 639.67 s [vector] +++ OK, passed 100 tests.
  10984. 639.70 s [vector] iterateN: OK
  10985. 639.70 s [vector] +++ OK, passed 100 tests.
  10986. 639.70 s [vector] iterateNM: OK (0.02s)
  10987. 639.70 s [vector] +++ OK, passed 100 tests.
  10988. 639.74 s [vector] generateM: OK (0.03s)
  10989. 639.74 s [vector] +++ OK, passed 100 tests.
  10990. 639.76 s [vector] replicateM: OK (0.03s)
  10991. 639.76 s [vector] +++ OK, passed 100 tests.
  10992. 639.76 s [vector] create: OK
  10993. 639.76 s [vector] +++ OK, passed 100 tests.
  10994. 639.76 s [vector] createT: OK
  10995. 639.76 s [vector] +++ OK, passed 100 tests.
  10996. 639.76 s [vector] unfoldr: OK
  10997. 639.76 s [vector] +++ OK, passed 100 tests.
  10998. 639.76 s [vector] unfoldrN: OK
  10999. 639.76 s [vector] +++ OK, passed 100 tests.
  11000. 639.76 s [vector] unfoldrExactN: OK
  11001. 639.76 s [vector] +++ OK, passed 100 tests.
  11002. 639.78 s [vector] unfoldrM: OK
  11003. 639.78 s [vector] +++ OK, passed 100 tests.
  11004. 639.79 s [vector] unfoldrNM: OK
  11005. 639.79 s [vector] +++ OK, passed 100 tests.
  11006. 639.80 s [vector] unfoldrExactNM: OK (0.02s)
  11007. 639.80 s [vector] +++ OK, passed 100 tests.
  11008. 639.80 s [vector] constructN: OK
  11009. 639.80 s [vector] +++ OK, passed 100 tests.
  11010. 639.80 s [vector] constructrN: OK
  11011. 639.81 s [vector] +++ OK, passed 100 tests.
  11012. 639.81 s [vector] cons: OK
  11013. 639.81 s [vector] +++ OK, passed 100 tests.
  11014. 639.81 s [vector] snoc: OK
  11015. 639.81 s [vector] +++ OK, passed 100 tests.
  11016. 639.83 s [vector] append: OK
  11017. 639.83 s [vector] +++ OK, passed 100 tests.
  11018. 639.84 s [vector] concat: OK (0.02s)
  11019. 639.84 s [vector] +++ OK, passed 100 tests.
  11020. 639.84 s [vector] force: OK
  11021. 639.84 s [vector] +++ OK, passed 100 tests.
  11022. 639.84 s [vector] upd: OK
  11023. 639.84 s [vector] +++ OK, passed 100 tests.
  11024. 639.84 s [vector] accum: OK
  11025. 639.84 s [vector] +++ OK, passed 100 tests.
  11026. 639.84 s [vector] reverse: OK
  11027. 639.84 s [vector] +++ OK, passed 100 tests.
  11028. 639.84 s [vector] backpermute: OK
  11029. 639.85 s [vector] +++ OK, passed 100 tests.
  11030. 639.85 s [vector] map: OK
  11031. 639.86 s [vector] +++ OK, passed 100 tests.
  11032. 639.86 s [vector] imap: OK
  11033. 639.86 s [vector] +++ OK, passed 100 tests.
  11034. 639.86 s [vector] concatMap: OK
  11035. 639.86 s [vector] +++ OK, passed 100 tests.
  11036. 639.87 s [vector] mapM: OK
  11037. 639.87 s [vector] +++ OK, passed 100 tests.
  11038. 639.88 s [vector] mapM_: OK (0.02s)
  11039. 639.88 s [vector] +++ OK, passed 100 tests.
  11040. 639.88 s [vector] forM: OK
  11041. 639.88 s [vector] +++ OK, passed 100 tests.
  11042. 639.90 s [vector] forM_: OK (0.01s)
  11043. 639.91 s [vector] +++ OK, passed 100 tests.
  11044. 639.91 s [vector] imapM: OK
  11045. 639.91 s [vector] +++ OK, passed 100 tests.
  11046. 639.92 s [vector] imapM_: OK (0.02s)
  11047. 639.92 s [vector] +++ OK, passed 100 tests.
  11048. 639.92 s [vector] zipWith: OK
  11049. 639.93 s [vector] +++ OK, passed 100 tests.
  11050. 639.93 s [vector] zipWith3: OK
  11051. 639.93 s [vector] +++ OK, passed 100 tests.
  11052. 639.93 s [vector] izipWith: OK
  11053. 639.93 s [vector] +++ OK, passed 100 tests.
  11054. 639.94 s [vector] izipWith3: OK
  11055. 639.94 s [vector] +++ OK, passed 100 tests.
  11056. 639.94 s [vector] izipWithM: OK
  11057. 639.96 s [vector] +++ OK, passed 100 tests.
  11058. 639.96 s [vector] izipWithM_: OK (0.01s)
  11059. 639.96 s [vector] +++ OK, passed 100 tests.
  11060. 639.96 s [vector] zipWithM: OK
  11061. 639.96 s [vector] +++ OK, passed 100 tests.
  11062. 639.98 s [vector] zipWithM_: OK (0.01s)
  11063. 639.98 s [vector] +++ OK, passed 100 tests.
  11064. 639.98 s [vector] filter: OK
  11065. 639.98 s [vector] +++ OK, passed 100 tests.
  11066. 639.98 s [vector] ifilter: OK
  11067. 639.98 s [vector] +++ OK, passed 100 tests.
  11068. 640.01 s [vector] filterM: OK (0.03s)
  11069. 640.01 s [vector] +++ OK, passed 100 tests.
  11070. 640.01 s [vector] uniq: OK
  11071. 640.01 s [vector] +++ OK, passed 100 tests.
  11072. 640.01 s [vector] mapMaybe: OK
  11073. 640.01 s [vector] +++ OK, passed 100 tests.
  11074. 640.01 s [vector] imapMaybe: OK
  11075. 640.01 s [vector] +++ OK, passed 100 tests.
  11076. 640.01 s [vector] takeWhile: OK
  11077. 640.01 s [vector] +++ OK, passed 100 tests.
  11078. 640.01 s [vector] dropWhile: OK
  11079. 640.01 s [vector] +++ OK, passed 100 tests.
  11080. 640.01 s [vector] partition: OK
  11081. 640.02 s [vector] +++ OK, passed 100 tests.
  11082. 640.02 s [vector] partitionWith: OK
  11083. 640.02 s [vector] +++ OK, passed 100 tests.
  11084. 640.02 s [vector] span: OK
  11085. 640.02 s [vector] +++ OK, passed 100 tests.
  11086. 640.02 s [vector] break: OK
  11087. 640.02 s [vector] +++ OK, passed 100 tests.
  11088. 640.02 s [vector] spanR: OK
  11089. 640.02 s [vector] +++ OK, passed 100 tests.
  11090. 640.02 s [vector] breakR: OK
  11091. 640.03 s [vector] +++ OK, passed 100 tests.
  11092. 640.03 s [vector] groupBy: OK
  11093. 640.03 s [vector] +++ OK, passed 100 tests.
  11094. 640.03 s [vector] elem: OK
  11095. 640.03 s [vector] +++ OK, passed 100 tests.
  11096. 640.03 s [vector] notElem: OK
  11097. 640.03 s [vector] +++ OK, passed 100 tests.
  11098. 640.03 s [vector] find: OK
  11099. 640.03 s [vector] +++ OK, passed 100 tests.
  11100. 640.03 s [vector] findIndex: OK
  11101. 640.03 s [vector] +++ OK, passed 100 tests.
  11102. 640.03 s [vector] findIndexR: OK
  11103. 640.04 s [vector] +++ OK, passed 100 tests.
  11104. 640.04 s [vector] findIndices: OK
  11105. 640.04 s [vector] +++ OK, passed 100 tests.
  11106. 640.04 s [vector] elemIndex: OK
  11107. 640.04 s [vector] +++ OK, passed 100 tests.
  11108. 640.04 s [vector] elemIndices: OK
  11109. 640.04 s [vector] +++ OK, passed 100 tests.
  11110. 640.04 s [vector] foldl: OK
  11111. 640.04 s [vector] +++ OK, passed 100 tests.
  11112. 640.04 s [vector] foldl1: OK
  11113. 640.04 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11114. 640.04 s [vector] foldl': OK
  11115. 640.04 s [vector] +++ OK, passed 100 tests.
  11116. 640.04 s [vector] foldl1': OK
  11117. 640.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11118. 640.05 s [vector] foldr: OK
  11119. 640.05 s [vector] +++ OK, passed 100 tests.
  11120. 640.05 s [vector] foldr1: OK
  11121. 640.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11122. 640.05 s [vector] foldr': OK
  11123. 640.05 s [vector] +++ OK, passed 100 tests.
  11124. 640.05 s [vector] foldr1': OK
  11125. 640.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11126. 640.05 s [vector] ifoldl: OK
  11127. 640.06 s [vector] +++ OK, passed 100 tests.
  11128. 640.06 s [vector] ifoldl': OK
  11129. 640.06 s [vector] +++ OK, passed 100 tests.
  11130. 640.06 s [vector] ifoldr: OK
  11131. 640.06 s [vector] +++ OK, passed 100 tests.
  11132. 640.06 s [vector] ifoldr': OK
  11133. 640.07 s [vector] +++ OK, passed 100 tests.
  11134. 640.07 s [vector] ifoldM: OK
  11135. 640.07 s [vector] +++ OK, passed 100 tests.
  11136. 640.08 s [vector] ifoldM': OK
  11137. 640.08 s [vector] +++ OK, passed 100 tests.
  11138. 640.10 s [vector] ifoldM_: OK (0.02s)
  11139. 640.10 s [vector] +++ OK, passed 100 tests.
  11140. 640.11 s [vector] ifoldM'_: OK (0.02s)
  11141. 640.11 s [vector] +++ OK, passed 100 tests.
  11142. 640.11 s [vector] all: OK
  11143. 640.11 s [vector] +++ OK, passed 100 tests.
  11144. 640.11 s [vector] any: OK
  11145. 640.11 s [vector] +++ OK, passed 100 tests.
  11146. 640.11 s [vector] prescanl: OK
  11147. 640.11 s [vector] +++ OK, passed 100 tests.
  11148. 640.11 s [vector] prescanl': OK
  11149. 640.12 s [vector] +++ OK, passed 100 tests.
  11150. 640.12 s [vector] postscanl: OK
  11151. 640.12 s [vector] +++ OK, passed 100 tests.
  11152. 640.12 s [vector] postscanl': OK
  11153. 640.12 s [vector] +++ OK, passed 100 tests.
  11154. 640.12 s [vector] scanl: OK
  11155. 640.13 s [vector] +++ OK, passed 100 tests.
  11156. 640.13 s [vector] scanl': OK
  11157. 640.13 s [vector] +++ OK, passed 100 tests.
  11158. 640.13 s [vector] scanl1: OK
  11159. 640.13 s [vector] +++ OK, passed 100 tests.
  11160. 640.13 s [vector] scanl1': OK
  11161. 640.13 s [vector] +++ OK, passed 100 tests.
  11162. 640.14 s [vector] iscanl: OK
  11163. 640.14 s [vector] +++ OK, passed 100 tests.
  11164. 640.14 s [vector] iscanl': OK
  11165. 640.14 s [vector] +++ OK, passed 100 tests.
  11166. 640.14 s [vector] prescanr: OK
  11167. 640.14 s [vector] +++ OK, passed 100 tests.
  11168. 640.15 s [vector] prescanr': OK
  11169. 640.15 s [vector] +++ OK, passed 100 tests.
  11170. 640.15 s [vector] postscanr: OK
  11171. 640.15 s [vector] +++ OK, passed 100 tests.
  11172. 640.15 s [vector] postscanr': OK
  11173. 640.15 s [vector] +++ OK, passed 100 tests.
  11174. 640.15 s [vector] scanr: OK
  11175. 640.16 s [vector] +++ OK, passed 100 tests.
  11176. 640.16 s [vector] scanr': OK
  11177. 640.16 s [vector] +++ OK, passed 100 tests.
  11178. 640.16 s [vector] scanr1: OK
  11179. 640.16 s [vector] +++ OK, passed 100 tests.
  11180. 640.16 s [vector] scanr1': OK
  11181. 640.16 s [vector] +++ OK, passed 100 tests.
  11182. 640.16 s [vector] iscanr: OK
  11183. 640.17 s [vector] +++ OK, passed 100 tests.
  11184. 640.17 s [vector] iscanr': OK
  11185. 640.17 s [vector] +++ OK, passed 100 tests.
  11186. 640.17 s [vector] mut_read: OK
  11187. 640.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11188. 640.18 s [vector] mut_write: OK
  11189. 640.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11190. 640.19 s [vector] mut_modify: OK
  11191. 640.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11192. 640.19 s [vector] mut_generate: OK
  11193. 640.19 s [vector] +++ OK, passed 100 tests.
  11194. 640.22 s [vector] mut_generateM: OK (0.02s)
  11195. 640.22 s [vector] +++ OK, passed 100 tests.
  11196. 640.24 s [vector] mut_mapM_: OK (0.02s)
  11197. 640.24 s [vector] +++ OK, passed 100 tests.
  11198. 640.24 s [vector] mut_imapM_: OK (0.01s)
  11199. 640.24 s [vector] +++ OK, passed 100 tests.
  11200. 640.26 s [vector] mut_forM_: OK (0.01s)
  11201. 640.26 s [vector] +++ OK, passed 100 tests.
  11202. 640.26 s [vector] mut_iforM_: OK (0.01s)
  11203. 640.26 s [vector] +++ OK, passed 100 tests.
  11204. 640.26 s [vector] mut_foldr: OK
  11205. 640.27 s [vector] +++ OK, passed 100 tests.
  11206. 640.27 s [vector] mut_foldr': OK
  11207. 640.27 s [vector] +++ OK, passed 100 tests.
  11208. 640.27 s [vector] mut_foldl: OK
  11209. 640.27 s [vector] +++ OK, passed 100 tests.
  11210. 640.27 s [vector] mut_foldl': OK
  11211. 640.28 s [vector] +++ OK, passed 100 tests.
  11212. 640.28 s [vector] mut_ifoldr: OK
  11213. 640.28 s [vector] +++ OK, passed 100 tests.
  11214. 640.28 s [vector] mut_ifoldr': OK
  11215. 640.28 s [vector] +++ OK, passed 100 tests.
  11216. 640.28 s [vector] mut_ifoldl: OK
  11217. 640.28 s [vector] +++ OK, passed 100 tests.
  11218. 640.28 s [vector] mut_ifoldl': OK
  11219. 640.28 s [vector] +++ OK, passed 100 tests.
  11220. 640.28 s [vector] mut_foldM: OK
  11221. 640.29 s [vector] +++ OK, passed 100 tests.
  11222. 640.29 s [vector] mut_foldM': OK
  11223. 640.29 s [vector] +++ OK, passed 100 tests.
  11224. 640.29 s [vector] mut_foldrM: OK
  11225. 640.29 s [vector] +++ OK, passed 100 tests.
  11226. 640.29 s [vector] mut_foldrM': OK
  11227. 640.30 s [vector] +++ OK, passed 100 tests.
  11228. 640.30 s [vector] mut_ifoldM: OK
  11229. 640.30 s [vector] +++ OK, passed 100 tests.
  11230. 640.30 s [vector] mut_ifoldM': OK
  11231. 640.30 s [vector] +++ OK, passed 100 tests.
  11232. 640.30 s [vector] mut_ifoldrM: OK
  11233. 640.30 s [vector] +++ OK, passed 100 tests.
  11234. 640.30 s [vector] mut_ifoldrM': OK
  11235. 640.30 s [vector] +++ OK, passed 100 tests.
  11236. 640.30 s [vector] compare: OK
  11237. 640.31 s [vector] +++ OK, passed 100 tests.
  11238. 640.31 s [vector] maximum: OK
  11239. 640.31 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11240. 640.31 s [vector] minimum: OK
  11241. 640.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11242. 640.31 s [vector] minIndex: OK
  11243. 640.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11244. 640.31 s [vector] maxIndex: OK
  11245. 640.31 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11246. 640.31 s [vector] maximumBy: OK
  11247. 640.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11248. 640.31 s [vector] minimumBy: OK
  11249. 640.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11250. 640.31 s [vector] maximumOn: OK
  11251. 640.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11252. 640.31 s [vector] minimumOn: OK
  11253. 640.31 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11254. 640.31 s [vector] maxIndexBy: OK
  11255. 640.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11256. 640.32 s [vector] minIndexBy: OK
  11257. 640.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11258. 640.32 s [vector] ListFirstMaxIndexWins: OK
  11259. 640.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11260. 640.32 s [vector] FalseListFirstMaxIndexWins: OK
  11261. 640.32 s [vector] +++ OK, failed as expected. (after 1 test):
  11262. 640.32 s [vector] Exception:
  11263. 640.32 s [vector] Prelude.foldr1: empty list
  11264. 640.32 s [vector] CallStack (from HasCallStack):
  11265. 640.32 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11266. 640.32 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11267. 640.32 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11268. 640.32 s [vector] []
  11269. 640.32 s [vector] zip: OK
  11270. 640.32 s [vector] +++ OK, passed 100 tests.
  11271. 640.32 s [vector] zip3: OK
  11272. 640.32 s [vector] +++ OK, passed 100 tests.
  11273. 640.32 s [vector] unzip: OK
  11274. 640.32 s [vector] +++ OK, passed 100 tests.
  11275. 640.33 s [vector] unzip3: OK
  11276. 640.33 s [vector] +++ OK, passed 100 tests.
  11277. 640.33 s [vector] indexed: OK
  11278. 640.33 s [vector] +++ OK, passed 100 tests.
  11279. 640.33 s [vector] update: OK
  11280. 640.33 s [vector] +++ OK, passed 100 tests.
  11281. 640.34 s [vector] mempty: OK
  11282. 640.34 s [vector] +++ OK, passed 1 test.
  11283. 640.34 s [vector] mappend: OK
  11284. 640.34 s [vector] +++ OK, passed 100 tests.
  11285. 640.37 s [vector] mconcat: OK (0.03s)
  11286. 640.37 s [vector] +++ OK, passed 100 tests.
  11287. 640.37 s [vector] glength: OK
  11288. 640.37 s [vector] +++ OK, passed 100 tests.
  11289. 640.37 s [vector] and: OK
  11290. 640.37 s [vector] +++ OK, passed 100 tests.
  11291. 640.37 s [vector] or: OK
  11292. 640.37 s [vector] +++ OK, passed 100 tests.
  11293. 640.37 s [vector] (Int)
  11294. 640.37 s [vector] fromList.toList == id: OK
  11295. 640.37 s [vector] +++ OK, passed 100 tests.
  11296. 640.37 s [vector] toList.fromList == id: OK
  11297. 640.37 s [vector] +++ OK, passed 100 tests.
  11298. 640.37 s [vector] unstream.stream == id: OK
  11299. 640.37 s [vector] +++ OK, passed 100 tests.
  11300. 640.37 s [vector] stream.unstream == id: OK
  11301. 640.37 s [vector] +++ OK, passed 100 tests.
  11302. 640.37 s [vector] eq: OK
  11303. 640.37 s [vector] +++ OK, passed 100 tests.
  11304. 640.37 s [vector] length: OK
  11305. 640.37 s [vector] +++ OK, passed 100 tests.
  11306. 640.37 s [vector] null: OK
  11307. 640.37 s [vector] +++ OK, passed 100 tests.
  11308. 640.37 s [vector] index: OK
  11309. 640.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11310. 640.38 s [vector] safeIndex: OK
  11311. 640.38 s [vector] +++ OK, passed 100 tests.
  11312. 640.38 s [vector] head: OK
  11313. 640.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11314. 640.38 s [vector] last: OK
  11315. 640.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11316. 640.38 s [vector] unsafeIndex: OK
  11317. 640.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11318. 640.38 s [vector] unsafeHead: OK
  11319. 640.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11320. 640.38 s [vector] unsafeLast: OK
  11321. 640.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11322. 640.38 s [vector] slice: OK
  11323. 640.38 s [vector] +++ OK, passed 100 tests.
  11324. 640.38 s [vector] init: OK
  11325. 640.38 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11326. 640.38 s [vector] tail: OK
  11327. 640.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11328. 640.39 s [vector] take: OK
  11329. 640.39 s [vector] +++ OK, passed 100 tests.
  11330. 640.39 s [vector] drop: OK
  11331. 640.39 s [vector] +++ OK, passed 100 tests.
  11332. 640.39 s [vector] splitAt: OK
  11333. 640.39 s [vector] +++ OK, passed 100 tests.
  11334. 640.39 s [vector] empty: OK
  11335. 640.39 s [vector] +++ OK, passed 1 test.
  11336. 640.39 s [vector] singleton: OK
  11337. 640.39 s [vector] +++ OK, passed 100 tests.
  11338. 640.39 s [vector] replicate: OK
  11339. 640.39 s [vector] +++ OK, passed 100 tests.
  11340. 640.39 s [vector] generate: OK
  11341. 640.39 s [vector] +++ OK, passed 100 tests.
  11342. 640.39 s [vector] iterateN: OK
  11343. 640.40 s [vector] +++ OK, passed 100 tests.
  11344. 640.44 s [vector] iterateNM: OK (0.02s)
  11345. 640.44 s [vector] +++ OK, passed 100 tests.
  11346. 640.48 s [vector] generateM: OK (0.06s)
  11347. 640.48 s [vector] +++ OK, passed 100 tests.
  11348. 640.51 s [vector] replicateM: OK (0.04s)
  11349. 640.51 s [vector] +++ OK, passed 100 tests.
  11350. 640.51 s [vector] create: OK
  11351. 640.51 s [vector] +++ OK, passed 100 tests.
  11352. 640.52 s [vector] createT: OK
  11353. 640.52 s [vector] +++ OK, passed 100 tests.
  11354. 640.52 s [vector] unfoldr: OK
  11355. 640.52 s [vector] +++ OK, passed 100 tests.
  11356. 640.52 s [vector] unfoldrN: OK
  11357. 640.52 s [vector] +++ OK, passed 100 tests.
  11358. 640.52 s [vector] unfoldrExactN: OK
  11359. 640.52 s [vector] +++ OK, passed 100 tests.
  11360. 640.52 s [vector] unfoldrM: OK
  11361. 640.53 s [vector] +++ OK, passed 100 tests.
  11362. 640.54 s [vector] unfoldrNM: OK
  11363. 640.54 s [vector] +++ OK, passed 100 tests.
  11364. 640.56 s [vector] unfoldrExactNM: OK (0.03s)
  11365. 640.56 s [vector] +++ OK, passed 100 tests.
  11366. 640.56 s [vector] constructN: OK
  11367. 640.57 s [vector] +++ OK, passed 100 tests.
  11368. 640.57 s [vector] constructrN: OK
  11369. 640.57 s [vector] +++ OK, passed 100 tests.
  11370. 640.57 s [vector] cons: OK
  11371. 640.58 s [vector] +++ OK, passed 100 tests.
  11372. 640.58 s [vector] snoc: OK
  11373. 640.58 s [vector] +++ OK, passed 100 tests.
  11374. 640.58 s [vector] append: OK
  11375. 640.58 s [vector] +++ OK, passed 100 tests.
  11376. 640.60 s [vector] concat: OK (0.03s)
  11377. 640.60 s [vector] +++ OK, passed 100 tests.
  11378. 640.60 s [vector] force: OK
  11379. 640.61 s [vector] +++ OK, passed 100 tests.
  11380. 640.61 s [vector] upd: OK
  11381. 640.61 s [vector] +++ OK, passed 100 tests.
  11382. 640.61 s [vector] accum: OK
  11383. 640.61 s [vector] +++ OK, passed 100 tests.
  11384. 640.61 s [vector] reverse: OK
  11385. 640.61 s [vector] +++ OK, passed 100 tests.
  11386. 640.62 s [vector] backpermute: OK
  11387. 640.62 s [vector] +++ OK, passed 100 tests.
  11388. 640.62 s [vector] map: OK
  11389. 640.62 s [vector] +++ OK, passed 100 tests.
  11390. 640.62 s [vector] imap: OK
  11391. 640.63 s [vector] +++ OK, passed 100 tests.
  11392. 640.63 s [vector] concatMap: OK
  11393. 640.63 s [vector] +++ OK, passed 100 tests.
  11394. 640.63 s [vector] mapM: OK
  11395. 640.64 s [vector] +++ OK, passed 100 tests.
  11396. 640.66 s [vector] mapM_: OK (0.02s)
  11397. 640.66 s [vector] +++ OK, passed 100 tests.
  11398. 640.66 s [vector] forM: OK
  11399. 640.66 s [vector] +++ OK, passed 100 tests.
  11400. 640.68 s [vector] forM_: OK (0.02s)
  11401. 640.68 s [vector] +++ OK, passed 100 tests.
  11402. 640.68 s [vector] imapM: OK
  11403. 640.70 s [vector] +++ OK, passed 100 tests.
  11404. 640.71 s [vector] imapM_: OK (0.03s)
  11405. 640.71 s [vector] +++ OK, passed 100 tests.
  11406. 640.71 s [vector] zipWith: OK
  11407. 640.72 s [vector] +++ OK, passed 100 tests.
  11408. 640.72 s [vector] zipWith3: OK
  11409. 640.72 s [vector] +++ OK, passed 100 tests.
  11410. 640.74 s [vector] izipWith: OK
  11411. 640.74 s [vector] +++ OK, passed 100 tests.
  11412. 640.75 s [vector] izipWith3: OK (0.02s)
  11413. 640.75 s [vector] +++ OK, passed 100 tests.
  11414. 640.77 s [vector] izipWithM: OK
  11415. 640.77 s [vector] +++ OK, passed 100 tests.
  11416. 640.78 s [vector] izipWithM_: OK (0.03s)
  11417. 640.78 s [vector] +++ OK, passed 100 tests.
  11418. 640.78 s [vector] zipWithM: OK
  11419. 640.79 s [vector] +++ OK, passed 100 tests.
  11420. 640.80 s [vector] zipWithM_: OK (0.02s)
  11421. 640.80 s [vector] +++ OK, passed 100 tests.
  11422. 640.80 s [vector] filter: OK
  11423. 640.81 s [vector] +++ OK, passed 100 tests.
  11424. 640.81 s [vector] ifilter: OK
  11425. 640.81 s [vector] +++ OK, passed 100 tests.
  11426. 640.84 s [vector] filterM: OK (0.04s)
  11427. 640.84 s [vector] +++ OK, passed 100 tests.
  11428. 640.84 s [vector] uniq: OK
  11429. 640.84 s [vector] +++ OK, passed 100 tests.
  11430. 640.85 s [vector] mapMaybe: OK
  11431. 640.85 s [vector] +++ OK, passed 100 tests.
  11432. 640.85 s [vector] imapMaybe: OK
  11433. 640.85 s [vector] +++ OK, passed 100 tests.
  11434. 640.85 s [vector] takeWhile: OK
  11435. 640.85 s [vector] +++ OK, passed 100 tests.
  11436. 640.85 s [vector] dropWhile: OK
  11437. 640.86 s [vector] +++ OK, passed 100 tests.
  11438. 640.86 s [vector] partition: OK
  11439. 640.86 s [vector] +++ OK, passed 100 tests.
  11440. 640.86 s [vector] partitionWith: OK
  11441. 640.86 s [vector] +++ OK, passed 100 tests.
  11442. 640.86 s [vector] span: OK
  11443. 640.87 s [vector] +++ OK, passed 100 tests.
  11444. 640.87 s [vector] break: OK
  11445. 640.87 s [vector] +++ OK, passed 100 tests.
  11446. 640.87 s [vector] spanR: OK
  11447. 640.87 s [vector] +++ OK, passed 100 tests.
  11448. 640.87 s [vector] breakR: OK
  11449. 640.87 s [vector] +++ OK, passed 100 tests.
  11450. 640.87 s [vector] groupBy: OK
  11451. 640.87 s [vector] +++ OK, passed 100 tests.
  11452. 640.87 s [vector] elem: OK
  11453. 640.87 s [vector] +++ OK, passed 100 tests.
  11454. 640.87 s [vector] notElem: OK
  11455. 640.87 s [vector] +++ OK, passed 100 tests.
  11456. 640.87 s [vector] find: OK
  11457. 640.88 s [vector] +++ OK, passed 100 tests.
  11458. 640.88 s [vector] findIndex: OK
  11459. 640.88 s [vector] +++ OK, passed 100 tests.
  11460. 640.88 s [vector] findIndexR: OK
  11461. 640.88 s [vector] +++ OK, passed 100 tests.
  11462. 640.88 s [vector] findIndices: OK
  11463. 640.88 s [vector] +++ OK, passed 100 tests.
  11464. 640.88 s [vector] elemIndex: OK
  11465. 640.88 s [vector] +++ OK, passed 100 tests.
  11466. 640.88 s [vector] elemIndices: OK
  11467. 640.89 s [vector] +++ OK, passed 100 tests.
  11468. 640.89 s [vector] foldl: OK
  11469. 640.89 s [vector] +++ OK, passed 100 tests.
  11470. 640.89 s [vector] foldl1: OK
  11471. 640.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11472. 640.90 s [vector] foldl': OK
  11473. 640.90 s [vector] +++ OK, passed 100 tests.
  11474. 640.90 s [vector] foldl1': OK
  11475. 640.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11476. 640.91 s [vector] foldr: OK
  11477. 640.91 s [vector] +++ OK, passed 100 tests.
  11478. 640.91 s [vector] foldr1: OK
  11479. 640.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11480. 640.91 s [vector] foldr': OK
  11481. 640.91 s [vector] +++ OK, passed 100 tests.
  11482. 640.91 s [vector] foldr1': OK
  11483. 640.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11484. 640.94 s [vector] ifoldl: OK
  11485. 640.94 s [vector] +++ OK, passed 100 tests.
  11486. 640.94 s [vector] ifoldl': OK
  11487. 640.94 s [vector] +++ OK, passed 100 tests.
  11488. 640.94 s [vector] ifoldr: OK
  11489. 640.94 s [vector] +++ OK, passed 100 tests.
  11490. 640.94 s [vector] ifoldr': OK
  11491. 640.94 s [vector] +++ OK, passed 100 tests.
  11492. 640.94 s [vector] ifoldM: OK
  11493. 640.94 s [vector] +++ OK, passed 100 tests.
  11494. 640.94 s [vector] ifoldM': OK
  11495. 640.95 s [vector] +++ OK, passed 100 tests.
  11496. 640.97 s [vector] ifoldM_: OK (0.02s)
  11497. 640.97 s [vector] +++ OK, passed 100 tests.
  11498. 640.99 s [vector] ifoldM'_: OK (0.03s)
  11499. 640.99 s [vector] +++ OK, passed 100 tests.
  11500. 640.99 s [vector] all: OK
  11501. 640.99 s [vector] +++ OK, passed 100 tests.
  11502. 640.99 s [vector] any: OK
  11503. 641.00 s [vector] +++ OK, passed 100 tests.
  11504. 641.00 s [vector] prescanl: OK
  11505. 641.00 s [vector] +++ OK, passed 100 tests.
  11506. 641.01 s [vector] prescanl': OK
  11507. 641.01 s [vector] +++ OK, passed 100 tests.
  11508. 641.01 s [vector] postscanl: OK
  11509. 641.01 s [vector] +++ OK, passed 100 tests.
  11510. 641.01 s [vector] postscanl': OK
  11511. 641.01 s [vector] +++ OK, passed 100 tests.
  11512. 641.02 s [vector] scanl: OK
  11513. 641.02 s [vector] +++ OK, passed 100 tests.
  11514. 641.02 s [vector] scanl': OK
  11515. 641.02 s [vector] +++ OK, passed 100 tests.
  11516. 641.03 s [vector] scanl1: OK
  11517. 641.03 s [vector] +++ OK, passed 100 tests.
  11518. 641.03 s [vector] scanl1': OK
  11519. 641.03 s [vector] +++ OK, passed 100 tests.
  11520. 641.04 s [vector] iscanl: OK
  11521. 641.04 s [vector] +++ OK, passed 100 tests.
  11522. 641.04 s [vector] iscanl': OK
  11523. 641.04 s [vector] +++ OK, passed 100 tests.
  11524. 641.04 s [vector] prescanr: OK
  11525. 641.05 s [vector] +++ OK, passed 100 tests.
  11526. 641.05 s [vector] prescanr': OK
  11527. 641.05 s [vector] +++ OK, passed 100 tests.
  11528. 641.05 s [vector] postscanr: OK
  11529. 641.06 s [vector] +++ OK, passed 100 tests.
  11530. 641.06 s [vector] postscanr': OK
  11531. 641.06 s [vector] +++ OK, passed 100 tests.
  11532. 641.07 s [vector] scanr: OK
  11533. 641.07 s [vector] +++ OK, passed 100 tests.
  11534. 641.07 s [vector] scanr': OK
  11535. 641.07 s [vector] +++ OK, passed 100 tests.
  11536. 641.07 s [vector] scanr1: OK
  11537. 641.07 s [vector] +++ OK, passed 100 tests.
  11538. 641.08 s [vector] scanr1': OK
  11539. 641.08 s [vector] +++ OK, passed 100 tests.
  11540. 641.08 s [vector] iscanr: OK
  11541. 641.08 s [vector] +++ OK, passed 100 tests.
  11542. 641.08 s [vector] iscanr': OK
  11543. 641.08 s [vector] +++ OK, passed 100 tests.
  11544. 641.08 s [vector] mut_read: OK
  11545. 641.09 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11546. 641.09 s [vector] mut_write: OK
  11547. 641.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11548. 641.09 s [vector] mut_modify: OK
  11549. 641.09 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11550. 641.09 s [vector] mut_generate: OK
  11551. 641.11 s [vector] +++ OK, passed 100 tests.
  11552. 641.11 s [vector] mut_generateM: OK (0.01s)
  11553. 641.11 s [vector] +++ OK, passed 100 tests.
  11554. 641.13 s [vector] mut_mapM_: OK (0.02s)
  11555. 641.13 s [vector] +++ OK, passed 100 tests.
  11556. 641.15 s [vector] mut_imapM_: OK (0.02s)
  11557. 641.15 s [vector] +++ OK, passed 100 tests.
  11558. 641.17 s [vector] mut_forM_: OK (0.02s)
  11559. 641.17 s [vector] +++ OK, passed 100 tests.
  11560. 641.19 s [vector] mut_iforM_: OK (0.02s)
  11561. 641.19 s [vector] +++ OK, passed 100 tests.
  11562. 641.20 s [vector] mut_foldr: OK
  11563. 641.21 s [vector] +++ OK, passed 100 tests.
  11564. 641.21 s [vector] mut_foldr': OK (0.01s)
  11565. 641.21 s [vector] +++ OK, passed 100 tests.
  11566. 641.23 s [vector] mut_foldl: OK (0.01s)
  11567. 641.23 s [vector] +++ OK, passed 100 tests.
  11568. 641.24 s [vector] mut_foldl': OK (0.01s)
  11569. 641.24 s [vector] +++ OK, passed 100 tests.
  11570. 641.26 s [vector] mut_ifoldr: OK (0.01s)
  11571. 641.26 s [vector] +++ OK, passed 100 tests.
  11572. 641.26 s [vector] mut_ifoldr': OK (0.01s)
  11573. 641.26 s [vector] +++ OK, passed 100 tests.
  11574. 641.26 s [vector] mut_ifoldl: OK
  11575. 641.27 s [vector] +++ OK, passed 100 tests.
  11576. 641.27 s [vector] mut_ifoldl': OK
  11577. 641.27 s [vector] +++ OK, passed 100 tests.
  11578. 641.27 s [vector] mut_foldM: OK
  11579. 641.27 s [vector] +++ OK, passed 100 tests.
  11580. 641.28 s [vector] mut_foldM': OK
  11581. 641.28 s [vector] +++ OK, passed 100 tests.
  11582. 641.29 s [vector] mut_foldrM: OK
  11583. 641.29 s [vector] +++ OK, passed 100 tests.
  11584. 641.29 s [vector] mut_foldrM': OK
  11585. 641.29 s [vector] +++ OK, passed 100 tests.
  11586. 641.30 s [vector] mut_ifoldM: OK
  11587. 641.30 s [vector] +++ OK, passed 100 tests.
  11588. 641.30 s [vector] mut_ifoldM': OK
  11589. 641.30 s [vector] +++ OK, passed 100 tests.
  11590. 641.31 s [vector] mut_ifoldrM: OK
  11591. 641.31 s [vector] +++ OK, passed 100 tests.
  11592. 641.31 s [vector] mut_ifoldrM': OK
  11593. 641.31 s [vector] +++ OK, passed 100 tests.
  11594. 641.31 s [vector] compare: OK
  11595. 641.31 s [vector] +++ OK, passed 100 tests.
  11596. 641.31 s [vector] maximum: OK
  11597. 641.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11598. 641.31 s [vector] minimum: OK
  11599. 641.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11600. 641.32 s [vector] minIndex: OK
  11601. 641.32 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11602. 641.32 s [vector] maxIndex: OK
  11603. 641.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11604. 641.32 s [vector] maximumBy: OK
  11605. 641.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11606. 641.32 s [vector] minimumBy: OK
  11607. 641.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11608. 641.32 s [vector] maximumOn: OK
  11609. 641.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11610. 641.32 s [vector] minimumOn: OK
  11611. 641.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11612. 641.32 s [vector] maxIndexBy: OK
  11613. 641.32 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11614. 641.32 s [vector] minIndexBy: OK
  11615. 641.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11616. 641.32 s [vector] ListFirstMaxIndexWins: OK
  11617. 641.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11618. 641.32 s [vector] FalseListFirstMaxIndexWins: OK
  11619. 641.32 s [vector] +++ OK, failed as expected. (after 1 test):
  11620. 641.32 s [vector] Exception:
  11621. 641.32 s [vector] Prelude.foldr1: empty list
  11622. 641.32 s [vector] CallStack (from HasCallStack):
  11623. 641.32 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11624. 641.32 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11625. 641.32 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11626. 641.33 s [vector] []
  11627. 641.33 s [vector] zip: OK
  11628. 641.33 s [vector] +++ OK, passed 100 tests.
  11629. 641.33 s [vector] zip3: OK
  11630. 641.33 s [vector] +++ OK, passed 100 tests.
  11631. 641.33 s [vector] unzip: OK
  11632. 641.33 s [vector] +++ OK, passed 100 tests.
  11633. 641.34 s [vector] unzip3: OK
  11634. 641.34 s [vector] +++ OK, passed 100 tests.
  11635. 641.34 s [vector] indexed: OK
  11636. 641.34 s [vector] +++ OK, passed 100 tests.
  11637. 641.34 s [vector] update: OK
  11638. 641.34 s [vector] +++ OK, passed 100 tests.
  11639. 641.34 s [vector] mempty: OK
  11640. 641.34 s [vector] +++ OK, passed 1 test.
  11641. 641.34 s [vector] mappend: OK
  11642. 641.35 s [vector] +++ OK, passed 100 tests.
  11643. 641.37 s [vector] mconcat: OK (0.03s)
  11644. 641.61 s [vector] +++ OK, passed 100 tests.
  11645. 641.61 s [vector] glength: OK
  11646. 641.61 s [vector] +++ OK, passed 100 tests.
  11647. 641.61 s [vector] sum: OK
  11648. 641.61 s [vector] +++ OK, passed 100 tests.
  11649. 641.61 s [vector] product: OK
  11650. 641.61 s [vector] +++ OK, passed 100 tests.
  11651. 641.61 s [vector] enumFromN: OK
  11652. 641.61 s [vector] +++ OK, passed 100 tests.
  11653. 641.61 s [vector] enumFromThenN: OK
  11654. 641.61 s [vector] +++ OK, passed 100 tests.
  11655. 641.61 s [vector] enumFromTo: OK
  11656. 641.61 s [vector] +++ OK, passed 100 tests.
  11657. 641.61 s [vector] enumFromThenTo: OK
  11658. 641.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11659. 641.61 s [vector] (Float)
  11660. 641.61 s [vector] fromList.toList == id: OK
  11661. 641.61 s [vector] +++ OK, passed 100 tests.
  11662. 641.61 s [vector] toList.fromList == id: OK
  11663. 641.61 s [vector] +++ OK, passed 100 tests.
  11664. 641.61 s [vector] unstream.stream == id: OK
  11665. 641.61 s [vector] +++ OK, passed 100 tests.
  11666. 641.61 s [vector] stream.unstream == id: OK
  11667. 641.61 s [vector] +++ OK, passed 100 tests.
  11668. 641.61 s [vector] eq: OK
  11669. 641.61 s [vector] +++ OK, passed 100 tests.
  11670. 641.61 s [vector] length: OK
  11671. 641.61 s [vector] +++ OK, passed 100 tests.
  11672. 641.61 s [vector] null: OK
  11673. 641.61 s [vector] +++ OK, passed 100 tests.
  11674. 641.61 s [vector] index: OK
  11675. 641.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11676. 641.61 s [vector] safeIndex: OK
  11677. 641.61 s [vector] +++ OK, passed 100 tests.
  11678. 641.61 s [vector] head: OK
  11679. 641.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11680. 641.61 s [vector] last: OK
  11681. 641.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11682. 641.62 s [vector] unsafeIndex: OK
  11683. 641.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11684. 641.62 s [vector] unsafeHead: OK
  11685. 641.62 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11686. 641.62 s [vector] unsafeLast: OK
  11687. 641.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11688. 641.62 s [vector] slice: OK
  11689. 641.62 s [vector] +++ OK, passed 100 tests.
  11690. 641.62 s [vector] init: OK
  11691. 641.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11692. 641.62 s [vector] tail: OK
  11693. 641.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11694. 641.62 s [vector] take: OK
  11695. 641.62 s [vector] +++ OK, passed 100 tests.
  11696. 641.62 s [vector] drop: OK
  11697. 641.62 s [vector] +++ OK, passed 100 tests.
  11698. 641.62 s [vector] splitAt: OK
  11699. 641.62 s [vector] +++ OK, passed 100 tests.
  11700. 641.62 s [vector] empty: OK
  11701. 641.62 s [vector] +++ OK, passed 1 test.
  11702. 641.62 s [vector] singleton: OK
  11703. 641.62 s [vector] +++ OK, passed 100 tests.
  11704. 641.62 s [vector] replicate: OK
  11705. 641.62 s [vector] +++ OK, passed 100 tests.
  11706. 641.62 s [vector] generate: OK
  11707. 641.62 s [vector] +++ OK, passed 100 tests.
  11708. 641.62 s [vector] iterateN: OK
  11709. 641.62 s [vector] +++ OK, passed 100 tests.
  11710. 641.62 s [vector] iterateNM: OK (0.04s)
  11711. 641.62 s [vector] +++ OK, passed 100 tests.
  11712. 641.62 s [vector] generateM: OK (0.04s)
  11713. 641.62 s [vector] +++ OK, passed 100 tests.
  11714. 641.62 s [vector] replicateM: OK (0.02s)
  11715. 641.62 s [vector] +++ OK, passed 100 tests.
  11716. 641.62 s [vector] create: OK
  11717. 641.62 s [vector] +++ OK, passed 100 tests.
  11718. 641.62 s [vector] createT: OK
  11719. 641.62 s [vector] +++ OK, passed 100 tests.
  11720. 641.62 s [vector] unfoldr: OK
  11721. 641.62 s [vector] +++ OK, passed 100 tests.
  11722. 641.62 s [vector] unfoldrN: OK
  11723. 641.62 s [vector] +++ OK, passed 100 tests.
  11724. 641.62 s [vector] unfoldrExactN: OK
  11725. 641.62 s [vector] +++ OK, passed 100 tests.
  11726. 641.62 s [vector] unfoldrM: OK
  11727. 641.62 s [vector] +++ OK, passed 100 tests.
  11728. 641.62 s [vector] unfoldrNM: OK
  11729. 641.62 s [vector] +++ OK, passed 100 tests.
  11730. 641.62 s [vector] unfoldrExactNM: OK (0.02s)
  11731. 641.62 s [vector] +++ OK, passed 100 tests.
  11732. 641.62 s [vector] constructN: OK (0.01s)
  11733. 641.62 s [vector] +++ OK, passed 100 tests.
  11734. 641.62 s [vector] constructrN: OK (0.02s)
  11735. 641.62 s [vector] +++ OK, passed 100 tests.
  11736. 641.62 s [vector] cons: OK
  11737. 641.62 s [vector] +++ OK, passed 100 tests.
  11738. 641.62 s [vector] snoc: OK
  11739. 641.62 s [vector] +++ OK, passed 100 tests.
  11740. 641.62 s [vector] append: OK
  11741. 641.62 s [vector] +++ OK, passed 100 tests.
  11742. 641.63 s [vector] concat: OK (0.04s)
  11743. 641.63 s [vector] +++ OK, passed 100 tests.
  11744. 641.63 s [vector] force: OK
  11745. 641.64 s [vector] +++ OK, passed 100 tests.
  11746. 641.64 s [vector] upd: OK
  11747. 641.65 s [vector] +++ OK, passed 100 tests.
  11748. 641.65 s [vector] accum: OK (0.01s)
  11749. 641.65 s [vector] +++ OK, passed 100 tests.
  11750. 641.65 s [vector] reverse: OK
  11751. 641.65 s [vector] +++ OK, passed 100 tests.
  11752. 641.65 s [vector] backpermute: OK
  11753. 641.66 s [vector] +++ OK, passed 100 tests.
  11754. 641.67 s [vector] map: OK
  11755. 641.67 s [vector] +++ OK, passed 100 tests.
  11756. 641.67 s [vector] imap: OK
  11757. 641.67 s [vector] +++ OK, passed 100 tests.
  11758. 641.68 s [vector] concatMap: OK
  11759. 641.68 s [vector] +++ OK, passed 100 tests.
  11760. 641.69 s [vector] mapM: OK
  11761. 641.69 s [vector] +++ OK, passed 100 tests.
  11762. 641.75 s [vector] mapM_: OK (0.06s)
  11763. 641.75 s [vector] +++ OK, passed 100 tests.
  11764. 641.77 s [vector] forM: OK
  11765. 641.77 s [vector] +++ OK, passed 100 tests.
  11766. 641.81 s [vector] forM_: OK (0.05s)
  11767. 641.81 s [vector] +++ OK, passed 100 tests.
  11768. 641.83 s [vector] imapM: OK
  11769. 641.83 s [vector] +++ OK, passed 100 tests.
  11770. 641.87 s [vector] imapM_: OK (0.05s)
  11771. 641.87 s [vector] +++ OK, passed 100 tests.
  11772. 641.87 s [vector] zipWith: OK
  11773. 641.89 s [vector] +++ OK, passed 100 tests.
  11774. 641.89 s [vector] zipWith3: OK (0.01s)
  11775. 641.89 s [vector] +++ OK, passed 100 tests.
  11776. 641.90 s [vector] izipWith: OK (0.01s)
  11777. 641.90 s [vector] +++ OK, passed 100 tests.
  11778. 641.91 s [vector] izipWith3: OK
  11779. 641.93 s [vector] +++ OK, passed 100 tests.
  11780. 641.95 s [vector] izipWithM: OK (0.02s)
  11781. 641.95 s [vector] +++ OK, passed 100 tests.
  11782. 642.00 s [vector] izipWithM_: OK (0.06s)
  11783. 642.00 s [vector] +++ OK, passed 100 tests.
  11784. 642.03 s [vector] zipWithM: OK (0.01s)
  11785. 642.03 s [vector] +++ OK, passed 100 tests.
  11786. 642.08 s [vector] zipWithM_: OK (0.07s)
  11787. 642.08 s [vector] +++ OK, passed 100 tests.
  11788. 642.09 s [vector] filter: OK
  11789. 642.09 s [vector] +++ OK, passed 100 tests.
  11790. 642.09 s [vector] ifilter: OK
  11791. 642.09 s [vector] +++ OK, passed 100 tests.
  11792. 642.17 s [vector] filterM: OK (0.08s)
  11793. 642.17 s [vector] +++ OK, passed 100 tests.
  11794. 642.17 s [vector] uniq: OK
  11795. 642.18 s [vector] +++ OK, passed 100 tests.
  11796. 642.18 s [vector] mapMaybe: OK
  11797. 642.19 s [vector] +++ OK, passed 100 tests.
  11798. 642.19 s [vector] imapMaybe: OK (0.01s)
  11799. 642.19 s [vector] +++ OK, passed 100 tests.
  11800. 642.20 s [vector] takeWhile: OK
  11801. 642.20 s [vector] +++ OK, passed 100 tests.
  11802. 642.20 s [vector] dropWhile: OK
  11803. 642.20 s [vector] +++ OK, passed 100 tests.
  11804. 642.21 s [vector] partition: OK
  11805. 642.21 s [vector] +++ OK, passed 100 tests.
  11806. 642.21 s [vector] partitionWith: OK
  11807. 642.22 s [vector] +++ OK, passed 100 tests.
  11808. 642.22 s [vector] span: OK
  11809. 642.22 s [vector] +++ OK, passed 100 tests.
  11810. 642.22 s [vector] break: OK
  11811. 642.22 s [vector] +++ OK, passed 100 tests.
  11812. 642.22 s [vector] spanR: OK
  11813. 642.22 s [vector] +++ OK, passed 100 tests.
  11814. 642.23 s [vector] breakR: OK
  11815. 642.23 s [vector] +++ OK, passed 100 tests.
  11816. 642.24 s [vector] groupBy: OK (0.01s)
  11817. 642.24 s [vector] +++ OK, passed 100 tests.
  11818. 642.24 s [vector] elem: OK
  11819. 642.24 s [vector] +++ OK, passed 100 tests.
  11820. 642.24 s [vector] notElem: OK
  11821. 642.24 s [vector] +++ OK, passed 100 tests.
  11822. 642.25 s [vector] find: OK
  11823. 642.25 s [vector] +++ OK, passed 100 tests.
  11824. 642.25 s [vector] findIndex: OK
  11825. 642.25 s [vector] +++ OK, passed 100 tests.
  11826. 642.25 s [vector] findIndexR: OK
  11827. 642.25 s [vector] +++ OK, passed 100 tests.
  11828. 642.26 s [vector] findIndices: OK
  11829. 642.26 s [vector] +++ OK, passed 100 tests.
  11830. 642.26 s [vector] elemIndex: OK
  11831. 642.26 s [vector] +++ OK, passed 100 tests.
  11832. 642.26 s [vector] elemIndices: OK
  11833. 642.27 s [vector] +++ OK, passed 100 tests.
  11834. 642.29 s [vector] foldl: OK (0.01s)
  11835. 642.29 s [vector] +++ OK, passed 100 tests.
  11836. 642.29 s [vector] foldl1: OK (0.02s)
  11837. 642.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11838. 642.31 s [vector] foldl': OK (0.01s)
  11839. 642.31 s [vector] +++ OK, passed 100 tests.
  11840. 642.33 s [vector] foldl1': OK (0.01s)
  11841. 642.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11842. 642.33 s [vector] foldr: OK (0.01s)
  11843. 642.33 s [vector] +++ OK, passed 100 tests.
  11844. 642.35 s [vector] foldr1: OK (0.01s)
  11845. 642.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11846. 642.36 s [vector] foldr': OK (0.01s)
  11847. 642.36 s [vector] +++ OK, passed 100 tests.
  11848. 642.37 s [vector] foldr1': OK (0.01s)
  11849. 642.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11850. 642.39 s [vector] ifoldl: OK (0.01s)
  11851. 642.39 s [vector] +++ OK, passed 100 tests.
  11852. 642.41 s [vector] ifoldl': OK (0.02s)
  11853. 642.41 s [vector] +++ OK, passed 100 tests.
  11854. 642.41 s [vector] ifoldr: OK (0.01s)
  11855. 642.41 s [vector] +++ OK, passed 100 tests.
  11856. 642.44 s [vector] ifoldr': OK (0.01s)
  11857. 642.44 s [vector] +++ OK, passed 100 tests.
  11858. 642.45 s [vector] ifoldM: OK (0.01s)
  11859. 642.45 s [vector] +++ OK, passed 100 tests.
  11860. 642.45 s [vector] ifoldM': OK (0.01s)
  11861. 642.45 s [vector] +++ OK, passed 100 tests.
  11862. 642.51 s [vector] ifoldM_: OK (0.05s)
  11863. 642.51 s [vector] +++ OK, passed 100 tests.
  11864. 642.54 s [vector] ifoldM'_: OK (0.05s)
  11865. 642.54 s [vector] +++ OK, passed 100 tests.
  11866. 642.55 s [vector] all: OK
  11867. 642.55 s [vector] +++ OK, passed 100 tests.
  11868. 642.55 s [vector] any: OK
  11869. 642.55 s [vector] +++ OK, passed 100 tests.
  11870. 642.57 s [vector] prescanl: OK (0.01s)
  11871. 642.57 s [vector] +++ OK, passed 100 tests.
  11872. 642.59 s [vector] prescanl': OK (0.01s)
  11873. 642.59 s [vector] +++ OK, passed 100 tests.
  11874. 642.59 s [vector] postscanl: OK (0.01s)
  11875. 642.59 s [vector] +++ OK, passed 100 tests.
  11876. 642.61 s [vector] postscanl': OK (0.02s)
  11877. 642.61 s [vector] +++ OK, passed 100 tests.
  11878. 642.63 s [vector] scanl: OK (0.02s)
  11879. 642.63 s [vector] +++ OK, passed 100 tests.
  11880. 642.65 s [vector] scanl': OK (0.01s)
  11881. 642.65 s [vector] +++ OK, passed 100 tests.
  11882. 642.65 s [vector] scanl1: OK (0.01s)
  11883. 642.65 s [vector] +++ OK, passed 100 tests.
  11884. 642.67 s [vector] scanl1': OK (0.01s)
  11885. 642.67 s [vector] +++ OK, passed 100 tests.
  11886. 642.70 s [vector] iscanl: OK (0.02s)
  11887. 642.70 s [vector] +++ OK, passed 100 tests.
  11888. 642.70 s [vector] iscanl': OK (0.02s)
  11889. 642.70 s [vector] +++ OK, passed 100 tests.
  11890. 642.72 s [vector] prescanr: OK (0.02s)
  11891. 642.72 s [vector] +++ OK, passed 100 tests.
  11892. 642.73 s [vector] prescanr': OK (0.01s)
  11893. 642.73 s [vector] +++ OK, passed 100 tests.
  11894. 642.75 s [vector] postscanr: OK (0.01s)
  11895. 642.75 s [vector] +++ OK, passed 100 tests.
  11896. 642.76 s [vector] postscanr': OK (0.01s)
  11897. 642.76 s [vector] +++ OK, passed 100 tests.
  11898. 642.78 s [vector] scanr: OK (0.01s)
  11899. 642.78 s [vector] +++ OK, passed 100 tests.
  11900. 642.79 s [vector] scanr': OK (0.01s)
  11901. 642.79 s [vector] +++ OK, passed 100 tests.
  11902. 642.79 s [vector] scanr1: OK (0.01s)
  11903. 642.79 s [vector] +++ OK, passed 100 tests.
  11904. 642.82 s [vector] scanr1': OK (0.01s)
  11905. 642.82 s [vector] +++ OK, passed 100 tests.
  11906. 642.83 s [vector] iscanr: OK (0.01s)
  11907. 642.83 s [vector] +++ OK, passed 100 tests.
  11908. 642.83 s [vector] iscanr': OK (0.01s)
  11909. 642.83 s [vector] +++ OK, passed 100 tests.
  11910. 642.83 s [vector] mut_read: OK
  11911. 642.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11912. 642.84 s [vector] mut_write: OK
  11913. 642.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11914. 642.84 s [vector] mut_modify: OK
  11915. 642.84 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11916. 642.85 s [vector] mut_generate: OK
  11917. 642.85 s [vector] +++ OK, passed 100 tests.
  11918. 642.89 s [vector] mut_generateM: OK (0.04s)
  11919. 642.89 s [vector] +++ OK, passed 100 tests.
  11920. 642.95 s [vector] mut_mapM_: OK (0.06s)
  11921. 642.95 s [vector] +++ OK, passed 100 tests.
  11922. 643.01 s [vector] mut_imapM_: OK (0.06s)
  11923. 643.01 s [vector] +++ OK, passed 100 tests.
  11924. 643.07 s [vector] mut_forM_: OK (0.06s)
  11925. 643.07 s [vector] +++ OK, passed 100 tests.
  11926. 643.11 s [vector] mut_iforM_: OK (0.05s)
  11927. 643.11 s [vector] +++ OK, passed 100 tests.
  11928. 643.13 s [vector] mut_foldr: OK (0.01s)
  11929. 643.13 s [vector] +++ OK, passed 100 tests.
  11930. 643.15 s [vector] mut_foldr': OK (0.01s)
  11931. 643.15 s [vector] +++ OK, passed 100 tests.
  11932. 643.15 s [vector] mut_foldl: OK (0.01s)
  11933. 643.15 s [vector] +++ OK, passed 100 tests.
  11934. 643.17 s [vector] mut_foldl': OK (0.01s)
  11935. 643.17 s [vector] +++ OK, passed 100 tests.
  11936. 643.19 s [vector] mut_ifoldr: OK (0.02s)
  11937. 643.19 s [vector] +++ OK, passed 100 tests.
  11938. 643.21 s [vector] mut_ifoldr': OK (0.02s)
  11939. 643.21 s [vector] +++ OK, passed 100 tests.
  11940. 643.21 s [vector] mut_ifoldl: OK (0.01s)
  11941. 643.21 s [vector] +++ OK, passed 100 tests.
  11942. 643.23 s [vector] mut_ifoldl': OK (0.02s)
  11943. 643.23 s [vector] +++ OK, passed 100 tests.
  11944. 643.25 s [vector] mut_foldM: OK (0.01s)
  11945. 643.25 s [vector] +++ OK, passed 100 tests.
  11946. 643.25 s [vector] mut_foldM': OK (0.02s)
  11947. 643.25 s [vector] +++ OK, passed 100 tests.
  11948. 643.29 s [vector] mut_foldrM: OK (0.01s)
  11949. 643.29 s [vector] +++ OK, passed 100 tests.
  11950. 643.34 s [vector] mut_foldrM': OK (0.04s)
  11951. 643.34 s [vector] +++ OK, passed 100 tests.
  11952. 643.35 s [vector] mut_ifoldM: OK (0.03s)
  11953. 643.35 s [vector] +++ OK, passed 100 tests.
  11954. 643.37 s [vector] mut_ifoldM': OK (0.01s)
  11955. 643.37 s [vector] +++ OK, passed 100 tests.
  11956. 643.38 s [vector] mut_ifoldrM: OK (0.01s)
  11957. 643.38 s [vector] +++ OK, passed 100 tests.
  11958. 643.39 s [vector] mut_ifoldrM': OK
  11959. 643.39 s [vector] +++ OK, passed 100 tests.
  11960. 643.39 s [vector] compare: OK
  11961. 643.39 s [vector] +++ OK, passed 100 tests.
  11962. 643.40 s [vector] maximum: OK
  11963. 643.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11964. 643.40 s [vector] minimum: OK
  11965. 643.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11966. 643.40 s [vector] minIndex: OK
  11967. 643.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11968. 643.40 s [vector] maxIndex: OK
  11969. 643.40 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11970. 643.40 s [vector] maximumBy: OK
  11971. 643.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11972. 643.40 s [vector] minimumBy: OK
  11973. 643.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11974. 643.40 s [vector] maximumOn: OK
  11975. 643.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11976. 643.41 s [vector] minimumOn: OK
  11977. 643.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11978. 643.41 s [vector] maxIndexBy: OK
  11979. 643.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11980. 643.41 s [vector] minIndexBy: OK
  11981. 643.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11982. 643.41 s [vector] ListFirstMaxIndexWins: OK
  11983. 643.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11984. 643.41 s [vector] FalseListFirstMaxIndexWins: OK
  11985. 643.41 s [vector] +++ OK, failed as expected. (after 1 test):
  11986. 643.41 s [vector] Exception:
  11987. 643.41 s [vector] Prelude.foldr1: empty list
  11988. 643.41 s [vector] CallStack (from HasCallStack):
  11989. 643.41 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11990. 643.41 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11991. 643.41 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11992. 643.41 s [vector] []
  11993. 643.42 s [vector] zip: OK
  11994. 643.42 s [vector] +++ OK, passed 100 tests.
  11995. 643.42 s [vector] zip3: OK
  11996. 643.42 s [vector] +++ OK, passed 100 tests.
  11997. 643.43 s [vector] unzip: OK
  11998. 643.43 s [vector] +++ OK, passed 100 tests.
  11999. 643.43 s [vector] unzip3: OK
  12000. 643.43 s [vector] +++ OK, passed 100 tests.
  12001. 643.43 s [vector] indexed: OK
  12002. 643.43 s [vector] +++ OK, passed 100 tests.
  12003. 643.43 s [vector] update: OK
  12004. 643.43 s [vector] +++ OK, passed 100 tests.
  12005. 643.44 s [vector] mempty: OK
  12006. 643.44 s [vector] +++ OK, passed 1 test.
  12007. 643.45 s [vector] mappend: OK
  12008. 643.45 s [vector] +++ OK, passed 100 tests.
  12009. 643.48 s [vector] mconcat: OK (0.04s)
  12010. 643.48 s [vector] +++ OK, passed 100 tests.
  12011. 643.48 s [vector] glength: OK
  12012. 643.48 s [vector] +++ OK, passed 100 tests.
  12013. 643.48 s [vector] sum: OK
  12014. 643.48 s [vector] +++ OK, passed 100 tests.
  12015. 643.48 s [vector] product: OK
  12016. 643.48 s [vector] +++ OK, passed 100 tests.
  12017. 643.48 s [vector] enumFromN: OK
  12018. 643.48 s [vector] +++ OK, passed 100 tests.
  12019. 643.48 s [vector] enumFromThenN: OK
  12020. 643.48 s [vector] +++ OK, passed 100 tests.
  12021. 643.48 s [vector] enumFromTo: OK
  12022. 643.48 s [vector] +++ OK, passed 100 tests.
  12023. 643.49 s [vector] enumFromThenTo: OK
  12024. 643.49 s [vector] +++ OK, passed 100 tests.
  12025. 643.49 s [vector] (Double)
  12026. 643.49 s [vector] fromList.toList == id: OK
  12027. 643.49 s [vector] +++ OK, passed 100 tests.
  12028. 643.49 s [vector] toList.fromList == id: OK
  12029. 643.49 s [vector] +++ OK, passed 100 tests.
  12030. 643.49 s [vector] unstream.stream == id: OK
  12031. 643.49 s [vector] +++ OK, passed 100 tests.
  12032. 643.49 s [vector] stream.unstream == id: OK
  12033. 643.49 s [vector] +++ OK, passed 100 tests.
  12034. 643.49 s [vector] eq: OK
  12035. 643.49 s [vector] +++ OK, passed 100 tests.
  12036. 643.49 s [vector] length: OK
  12037. 643.49 s [vector] +++ OK, passed 100 tests.
  12038. 643.49 s [vector] null: OK
  12039. 643.49 s [vector] +++ OK, passed 100 tests.
  12040. 643.50 s [vector] index: OK
  12041. 643.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12042. 643.50 s [vector] safeIndex: OK
  12043. 643.50 s [vector] +++ OK, passed 100 tests.
  12044. 643.50 s [vector] head: OK
  12045. 643.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12046. 643.50 s [vector] last: OK
  12047. 643.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12048. 643.50 s [vector] unsafeIndex: OK
  12049. 643.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12050. 643.50 s [vector] unsafeHead: OK
  12051. 643.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12052. 643.50 s [vector] unsafeLast: OK
  12053. 643.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12054. 643.50 s [vector] slice: OK
  12055. 643.50 s [vector] +++ OK, passed 100 tests.
  12056. 643.51 s [vector] init: OK
  12057. 643.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12058. 643.51 s [vector] tail: OK
  12059. 643.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12060. 643.51 s [vector] take: OK
  12061. 643.51 s [vector] +++ OK, passed 100 tests.
  12062. 643.51 s [vector] drop: OK
  12063. 643.51 s [vector] +++ OK, passed 100 tests.
  12064. 643.51 s [vector] splitAt: OK
  12065. 643.51 s [vector] +++ OK, passed 100 tests.
  12066. 643.51 s [vector] empty: OK
  12067. 643.51 s [vector] +++ OK, passed 1 test.
  12068. 643.51 s [vector] singleton: OK
  12069. 643.52 s [vector] +++ OK, passed 100 tests.
  12070. 643.52 s [vector] replicate: OK
  12071. 643.52 s [vector] +++ OK, passed 100 tests.
  12072. 643.52 s [vector] generate: OK
  12073. 643.52 s [vector] +++ OK, passed 100 tests.
  12074. 643.53 s [vector] iterateN: OK
  12075. 643.53 s [vector] +++ OK, passed 100 tests.
  12076. 643.55 s [vector] iterateNM: OK (0.03s)
  12077. 643.55 s [vector] +++ OK, passed 100 tests.
  12078. 643.61 s [vector] generateM: OK (0.05s)
  12079. 643.61 s [vector] +++ OK, passed 100 tests.
  12080. 643.61 s [vector] replicateM: OK (0.01s)
  12081. 643.61 s [vector] +++ OK, passed 100 tests.
  12082. 643.61 s [vector] create: OK
  12083. 643.61 s [vector] +++ OK, passed 100 tests.
  12084. 643.61 s [vector] createT: OK
  12085. 643.61 s [vector] +++ OK, passed 100 tests.
  12086. 643.62 s [vector] unfoldr: OK
  12087. 643.62 s [vector] +++ OK, passed 100 tests.
  12088. 643.62 s [vector] unfoldrN: OK
  12089. 643.62 s [vector] +++ OK, passed 100 tests.
  12090. 643.62 s [vector] unfoldrExactN: OK
  12091. 643.62 s [vector] +++ OK, passed 100 tests.
  12092. 643.63 s [vector] unfoldrM: OK
  12093. 643.63 s [vector] +++ OK, passed 100 tests.
  12094. 643.67 s [vector] unfoldrNM: OK
  12095. 643.67 s [vector] +++ OK, passed 100 tests.
  12096. 643.69 s [vector] unfoldrExactNM: OK (0.05s)
  12097. 643.69 s [vector] +++ OK, passed 100 tests.
  12098. 643.71 s [vector] constructN: OK (0.03s)
  12099. 643.71 s [vector] +++ OK, passed 100 tests.
  12100. 643.74 s [vector] constructrN: OK (0.04s)
  12101. 643.74 s [vector] +++ OK, passed 100 tests.
  12102. 643.74 s [vector] cons: OK
  12103. 643.74 s [vector] +++ OK, passed 100 tests.
  12104. 643.74 s [vector] snoc: OK
  12105. 643.75 s [vector] +++ OK, passed 100 tests.
  12106. 643.75 s [vector] append: OK
  12107. 643.75 s [vector] +++ OK, passed 100 tests.
  12108. 643.79 s [vector] concat: OK (0.04s)
  12109. 643.79 s [vector] +++ OK, passed 100 tests.
  12110. 643.80 s [vector] force: OK
  12111. 643.80 s [vector] +++ OK, passed 100 tests.
  12112. 643.80 s [vector] upd: OK
  12113. 643.81 s [vector] +++ OK, passed 100 tests.
  12114. 643.82 s [vector] accum: OK (0.02s)
  12115. 643.82 s [vector] +++ OK, passed 100 tests.
  12116. 643.83 s [vector] reverse: OK
  12117. 643.83 s [vector] +++ OK, passed 100 tests.
  12118. 643.83 s [vector] backpermute: OK
  12119. 643.83 s [vector] +++ OK, passed 100 tests.
  12120. 643.84 s [vector] map: OK (0.02s)
  12121. 643.84 s [vector] +++ OK, passed 100 tests.
  12122. 643.87 s [vector] imap: OK
  12123. 643.87 s [vector] +++ OK, passed 100 tests.
  12124. 643.89 s [vector] concatMap: OK (0.02s)
  12125. 643.89 s [vector] +++ OK, passed 100 tests.
  12126. 643.89 s [vector] mapM: OK (0.01s)
  12127. 643.89 s [vector] +++ OK, passed 100 tests.
  12128. 643.97 s [vector] mapM_: OK (0.07s)
  12129. 643.97 s [vector] +++ OK, passed 100 tests.
  12130. 643.99 s [vector] forM: OK (0.02s)
  12131. 643.99 s [vector] +++ OK, passed 100 tests.
  12132. 644.05 s [vector] forM_: OK (0.07s)
  12133. 644.05 s [vector] +++ OK, passed 100 tests.
  12134. 644.07 s [vector] imapM: OK (0.02s)
  12135. 644.07 s [vector] +++ OK, passed 100 tests.
  12136. 644.13 s [vector] imapM_: OK (0.07s)
  12137. 644.13 s [vector] +++ OK, passed 100 tests.
  12138. 644.15 s [vector] zipWith: OK (0.02s)
  12139. 644.15 s [vector] +++ OK, passed 100 tests.
  12140. 644.19 s [vector] zipWith3: OK (0.02s)
  12141. 644.19 s [vector] +++ OK, passed 100 tests.
  12142. 644.19 s [vector] izipWith: OK (0.02s)
  12143. 644.19 s [vector] +++ OK, passed 100 tests.
  12144. 644.23 s [vector] izipWith3: OK (0.03s)
  12145. 644.23 s [vector] +++ OK, passed 100 tests.
  12146. 644.25 s [vector] izipWithM: OK (0.02s)
  12147. 644.25 s [vector] +++ OK, passed 100 tests.
  12148. 644.31 s [vector] izipWithM_: OK (0.07s)
  12149. 644.31 s [vector] +++ OK, passed 100 tests.
  12150. 644.33 s [vector] zipWithM: OK (0.02s)
  12151. 644.33 s [vector] +++ OK, passed 100 tests.
  12152. 644.40 s [vector] zipWithM_: OK (0.07s)
  12153. 644.40 s [vector] +++ OK, passed 100 tests.
  12154. 644.41 s [vector] filter: OK
  12155. 644.43 s [vector] +++ OK, passed 100 tests.
  12156. 644.43 s [vector] ifilter: OK (0.02s)
  12157. 644.43 s [vector] +++ OK, passed 100 tests.
  12158. 644.57 s [vector] filterM: OK (0.13s)
  12159. 644.57 s [vector] +++ OK, passed 100 tests.
  12160. 644.57 s [vector] uniq: OK
  12161. 644.57 s [vector] +++ OK, passed 100 tests.
  12162. 644.59 s [vector] mapMaybe: OK (0.02s)
  12163. 644.59 s [vector] +++ OK, passed 100 tests.
  12164. 644.61 s [vector] imapMaybe: OK (0.02s)
  12165. 644.61 s [vector] +++ OK, passed 100 tests.
  12166. 644.61 s [vector] takeWhile: OK
  12167. 644.61 s [vector] +++ OK, passed 100 tests.
  12168. 644.63 s [vector] dropWhile: OK
  12169. 644.63 s [vector] +++ OK, passed 100 tests.
  12170. 644.63 s [vector] partition: OK (0.01s)
  12171. 644.63 s [vector] +++ OK, passed 100 tests.
  12172. 644.65 s [vector] partitionWith: OK (0.02s)
  12173. 644.65 s [vector] +++ OK, passed 100 tests.
  12174. 644.65 s [vector] span: OK
  12175. 644.65 s [vector] +++ OK, passed 100 tests.
  12176. 644.65 s [vector] break: OK
  12177. 644.66 s [vector] +++ OK, passed 100 tests.
  12178. 644.66 s [vector] spanR: OK
  12179. 644.66 s [vector] +++ OK, passed 100 tests.
  12180. 644.66 s [vector] breakR: OK
  12181. 644.67 s [vector] +++ OK, passed 100 tests.
  12182. 644.68 s [vector] groupBy: OK (0.02s)
  12183. 644.68 s [vector] +++ OK, passed 100 tests.
  12184. 644.68 s [vector] elem: OK
  12185. 644.68 s [vector] +++ OK, passed 100 tests.
  12186. 644.69 s [vector] notElem: OK
  12187. 644.69 s [vector] +++ OK, passed 100 tests.
  12188. 644.69 s [vector] find: OK
  12189. 644.69 s [vector] +++ OK, passed 100 tests.
  12190. 644.69 s [vector] findIndex: OK
  12191. 644.69 s [vector] +++ OK, passed 100 tests.
  12192. 644.70 s [vector] findIndexR: OK
  12193. 644.70 s [vector] +++ OK, passed 100 tests.
  12194. 644.70 s [vector] findIndices: OK (0.01s)
  12195. 644.70 s [vector] +++ OK, passed 100 tests.
  12196. 644.71 s [vector] elemIndex: OK
  12197. 644.71 s [vector] +++ OK, passed 100 tests.
  12198. 644.71 s [vector] elemIndices: OK
  12199. 644.71 s [vector] +++ OK, passed 100 tests.
  12200. 644.75 s [vector] foldl: OK (0.03s)
  12201. 644.75 s [vector] +++ OK, passed 100 tests.
  12202. 644.77 s [vector] foldl1: OK (0.03s)
  12203. 644.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12204. 644.81 s [vector] foldl': OK (0.03s)
  12205. 644.81 s [vector] +++ OK, passed 100 tests.
  12206. 644.83 s [vector] foldl1': OK (0.03s)
  12207. 644.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12208. 644.87 s [vector] foldr: OK (0.03s)
  12209. 644.87 s [vector] +++ OK, passed 100 tests.
  12210. 644.89 s [vector] foldr1: OK (0.03s)
  12211. 644.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12212. 644.91 s [vector] foldr': OK (0.02s)
  12213. 644.91 s [vector] +++ OK, passed 100 tests.
  12214. 644.95 s [vector] foldr1': OK (0.03s)
  12215. 644.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12216. 644.97 s [vector] ifoldl: OK (0.03s)
  12217. 644.97 s [vector] +++ OK, passed 100 tests.
  12218. 644.99 s [vector] ifoldl': OK (0.03s)
  12219. 644.99 s [vector] +++ OK, passed 100 tests.
  12220. 645.01 s [vector] ifoldr: OK (0.03s)
  12221. 645.01 s [vector] +++ OK, passed 100 tests.
  12222. 645.06 s [vector] ifoldr': OK (0.02s)
  12223. 645.06 s [vector] +++ OK, passed 100 tests.
  12224. 645.08 s [vector] ifoldM: OK (0.03s)
  12225. 645.08 s [vector] +++ OK, passed 100 tests.
  12226. 645.11 s [vector] ifoldM': OK (0.03s)
  12227. 645.11 s [vector] +++ OK, passed 100 tests.
  12228. 645.18 s [vector] ifoldM_: OK (0.06s)
  12229. 645.18 s [vector] +++ OK, passed 100 tests.
  12230. 645.23 s [vector] ifoldM'_: OK (0.06s)
  12231. 645.23 s [vector] +++ OK, passed 100 tests.
  12232. 645.23 s [vector] all: OK
  12233. 645.23 s [vector] +++ OK, passed 100 tests.
  12234. 645.24 s [vector] any: OK
  12235. 645.24 s [vector] +++ OK, passed 100 tests.
  12236. 645.26 s [vector] prescanl: OK (0.03s)
  12237. 645.26 s [vector] +++ OK, passed 100 tests.
  12238. 645.30 s [vector] prescanl': OK (0.03s)
  12239. 645.30 s [vector] +++ OK, passed 100 tests.
  12240. 645.32 s [vector] postscanl: OK (0.03s)
  12241. 645.32 s [vector] +++ OK, passed 100 tests.
  12242. 645.36 s [vector] postscanl': OK (0.03s)
  12243. 645.36 s [vector] +++ OK, passed 100 tests.
  12244. 645.39 s [vector] scanl: OK (0.03s)
  12245. 645.39 s [vector] +++ OK, passed 100 tests.
  12246. 645.42 s [vector] scanl': OK (0.03s)
  12247. 645.42 s [vector] +++ OK, passed 100 tests.
  12248. 645.44 s [vector] scanl1: OK (0.03s)
  12249. 645.44 s [vector] +++ OK, passed 100 tests.
  12250. 645.45 s [vector] scanl1': OK (0.03s)
  12251. 645.45 s [vector] +++ OK, passed 100 tests.
  12252. 645.50 s [vector] iscanl: OK (0.02s)
  12253. 645.50 s [vector] +++ OK, passed 100 tests.
  12254. 645.52 s [vector] iscanl': OK (0.02s)
  12255. 645.52 s [vector] +++ OK, passed 100 tests.
  12256. 645.54 s [vector] prescanr: OK (0.03s)
  12257. 645.54 s [vector] +++ OK, passed 100 tests.
  12258. 645.56 s [vector] prescanr': OK (0.02s)
  12259. 645.56 s [vector] +++ OK, passed 100 tests.
  12260. 645.58 s [vector] postscanr: OK (0.02s)
  12261. 645.58 s [vector] +++ OK, passed 100 tests.
  12262. 645.62 s [vector] postscanr': OK (0.03s)
  12263. 645.62 s [vector] +++ OK, passed 100 tests.
  12264. 645.64 s [vector] scanr: OK (0.03s)
  12265. 645.64 s [vector] +++ OK, passed 100 tests.
  12266. 645.68 s [vector] scanr': OK (0.03s)
  12267. 645.68 s [vector] +++ OK, passed 100 tests.
  12268. 645.70 s [vector] scanr1: OK (0.03s)
  12269. 645.70 s [vector] +++ OK, passed 100 tests.
  12270. 645.72 s [vector] scanr1': OK (0.02s)
  12271. 645.72 s [vector] +++ OK, passed 100 tests.
  12272. 645.74 s [vector] iscanr: OK (0.03s)
  12273. 645.74 s [vector] +++ OK, passed 100 tests.
  12274. 645.77 s [vector] iscanr': OK (0.03s)
  12275. 645.77 s [vector] +++ OK, passed 100 tests.
  12276. 645.77 s [vector] mut_read: OK
  12277. 645.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12278. 645.77 s [vector] mut_write: OK
  12279. 645.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12280. 645.77 s [vector] mut_modify: OK
  12281. 645.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12282. 645.78 s [vector] mut_generate: OK
  12283. 645.78 s [vector] +++ OK, passed 100 tests.
  12284. 645.84 s [vector] mut_generateM: OK (0.05s)
  12285. 645.84 s [vector] +++ OK, passed 100 tests.
  12286. 645.92 s [vector] mut_mapM_: OK (0.09s)
  12287. 645.92 s [vector] +++ OK, passed 100 tests.
  12288. 646.00 s [vector] mut_imapM_: OK (0.08s)
  12289. 646.00 s [vector] +++ OK, passed 100 tests.
  12290. 646.08 s [vector] mut_forM_: OK (0.07s)
  12291. 646.08 s [vector] +++ OK, passed 100 tests.
  12292. 646.16 s [vector] mut_iforM_: OK (0.09s)
  12293. 646.16 s [vector] +++ OK, passed 100 tests.
  12294. 646.18 s [vector] mut_foldr: OK (0.02s)
  12295. 646.18 s [vector] +++ OK, passed 100 tests.
  12296. 646.20 s [vector] mut_foldr': OK (0.03s)
  12297. 646.20 s [vector] +++ OK, passed 100 tests.
  12298. 646.25 s [vector] mut_foldl: OK (0.03s)
  12299. 646.25 s [vector] +++ OK, passed 100 tests.
  12300. 646.27 s [vector] mut_foldl': OK (0.03s)
  12301. 646.27 s [vector] +++ OK, passed 100 tests.
  12302. 646.29 s [vector] mut_ifoldr: OK (0.03s)
  12303. 646.29 s [vector] +++ OK, passed 100 tests.
  12304. 646.32 s [vector] mut_ifoldr': OK (0.03s)
  12305. 646.33 s [vector] +++ OK, passed 100 tests.
  12306. 646.34 s [vector] mut_ifoldl: OK (0.03s)
  12307. 646.35 s [vector] +++ OK, passed 100 tests.
  12308. 646.38 s [vector] mut_ifoldl': OK (0.03s)
  12309. 646.50 s [vector] +++ OK, passed 100 tests.
  12310. 646.50 s [vector] mut_foldM: OK (0.03s)
  12311. 646.50 s [vector] +++ OK, passed 100 tests.
  12312. 646.50 s [vector] mut_foldM': OK (0.03s)
  12313. 646.50 s [vector] +++ OK, passed 100 tests.
  12314. 646.50 s [vector] mut_foldrM: OK (0.03s)
  12315. 646.50 s [vector] +++ OK, passed 100 tests.
  12316. 646.50 s [vector] mut_foldrM': OK (0.03s)
  12317. 646.50 s [vector] +++ OK, passed 100 tests.
  12318. 646.50 s [vector] mut_ifoldM: OK (0.02s)
  12319. 646.51 s [vector] +++ OK, passed 100 tests.
  12320. 646.54 s [vector] mut_ifoldM': OK (0.03s)
  12321. 646.54 s [vector] +++ OK, passed 100 tests.
  12322. 646.56 s [vector] mut_ifoldrM: OK (0.02s)
  12323. 646.56 s [vector] +++ OK, passed 100 tests.
  12324. 646.57 s [vector] mut_ifoldrM': OK (0.02s)
  12325. 646.57 s [vector] +++ OK, passed 100 tests.
  12326. 646.57 s [vector] compare: OK
  12327. 646.58 s [vector] +++ OK, passed 100 tests.
  12328. 646.58 s [vector] maximum: OK
  12329. 646.58 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12330. 646.58 s [vector] minimum: OK
  12331. 646.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12332. 646.58 s [vector] minIndex: OK
  12333. 646.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12334. 646.58 s [vector] maxIndex: OK
  12335. 646.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12336. 646.58 s [vector] maximumBy: OK
  12337. 646.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12338. 646.59 s [vector] minimumBy: OK
  12339. 646.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12340. 646.59 s [vector] maximumOn: OK
  12341. 646.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12342. 646.59 s [vector] minimumOn: OK
  12343. 646.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12344. 646.59 s [vector] maxIndexBy: OK
  12345. 646.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12346. 646.59 s [vector] minIndexBy: OK
  12347. 646.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12348. 646.59 s [vector] ListFirstMaxIndexWins: OK
  12349. 646.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12350. 646.60 s [vector] FalseListFirstMaxIndexWins: OK
  12351. 646.60 s [vector] +++ OK, failed as expected. (after 1 test):
  12352. 646.60 s [vector] Exception:
  12353. 646.60 s [vector] Prelude.foldr1: empty list
  12354. 646.60 s [vector] CallStack (from HasCallStack):
  12355. 646.60 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12356. 646.60 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12357. 646.60 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12358. 646.60 s [vector] []
  12359. 646.60 s [vector] zip: OK
  12360. 646.60 s [vector] +++ OK, passed 100 tests.
  12361. 646.60 s [vector] zip3: OK
  12362. 646.60 s [vector] +++ OK, passed 100 tests.
  12363. 646.61 s [vector] unzip: OK
  12364. 646.61 s [vector] +++ OK, passed 100 tests.
  12365. 646.61 s [vector] unzip3: OK
  12366. 646.61 s [vector] +++ OK, passed 100 tests.
  12367. 646.61 s [vector] indexed: OK
  12368. 646.62 s [vector] +++ OK, passed 100 tests.
  12369. 646.62 s [vector] update: OK
  12370. 646.62 s [vector] +++ OK, passed 100 tests.
  12371. 646.62 s [vector] mempty: OK
  12372. 646.62 s [vector] +++ OK, passed 1 test.
  12373. 646.74 s [vector] mappend: OK
  12374. 646.74 s [vector] +++ OK, passed 100 tests.
  12375. 646.74 s [vector] mconcat: OK (0.05s)
  12376. 646.74 s [vector] +++ OK, passed 100 tests.
  12377. 646.74 s [vector] glength: OK
  12378. 646.74 s [vector] +++ OK, passed 100 tests.
  12379. 646.74 s [vector] sum: OK
  12380. 646.74 s [vector] +++ OK, passed 100 tests.
  12381. 646.74 s [vector] product: OK
  12382. 646.74 s [vector] +++ OK, passed 100 tests.
  12383. 646.74 s [vector] enumFromN: OK
  12384. 646.74 s [vector] +++ OK, passed 100 tests.
  12385. 646.74 s [vector] enumFromThenN: OK
  12386. 646.74 s [vector] +++ OK, passed 100 tests.
  12387. 646.74 s [vector] enumFromTo: OK
  12388. 646.74 s [vector] +++ OK, passed 100 tests.
  12389. 646.74 s [vector] enumFromThenTo: OK
  12390. 646.74 s [vector] +++ OK, passed 100 tests.
  12391. 646.74 s [vector] (Int,Bool)
  12392. 646.74 s [vector] fromList.toList == id: OK
  12393. 646.74 s [vector] +++ OK, passed 100 tests.
  12394. 646.74 s [vector] toList.fromList == id: OK
  12395. 646.74 s [vector] +++ OK, passed 100 tests.
  12396. 646.74 s [vector] unstream.stream == id: OK
  12397. 646.74 s [vector] +++ OK, passed 100 tests.
  12398. 646.74 s [vector] stream.unstream == id: OK
  12399. 646.74 s [vector] +++ OK, passed 100 tests.
  12400. 646.74 s [vector] eq: OK
  12401. 646.74 s [vector] +++ OK, passed 100 tests.
  12402. 646.74 s [vector] length: OK
  12403. 646.74 s [vector] +++ OK, passed 100 tests.
  12404. 646.74 s [vector] null: OK
  12405. 646.74 s [vector] +++ OK, passed 100 tests.
  12406. 646.75 s [vector] index: OK
  12407. 646.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12408. 646.75 s [vector] safeIndex: OK
  12409. 646.75 s [vector] +++ OK, passed 100 tests.
  12410. 646.75 s [vector] head: OK
  12411. 646.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12412. 646.75 s [vector] last: OK
  12413. 646.75 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12414. 646.75 s [vector] unsafeIndex: OK
  12415. 646.75 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12416. 646.75 s [vector] unsafeHead: OK
  12417. 646.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12418. 646.75 s [vector] unsafeLast: OK
  12419. 646.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12420. 646.75 s [vector] slice: OK
  12421. 646.75 s [vector] +++ OK, passed 100 tests.
  12422. 646.75 s [vector] init: OK
  12423. 646.75 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12424. 646.75 s [vector] tail: OK
  12425. 646.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12426. 646.75 s [vector] take: OK
  12427. 646.75 s [vector] +++ OK, passed 100 tests.
  12428. 646.75 s [vector] drop: OK
  12429. 646.75 s [vector] +++ OK, passed 100 tests.
  12430. 646.75 s [vector] splitAt: OK
  12431. 646.75 s [vector] +++ OK, passed 100 tests.
  12432. 646.75 s [vector] empty: OK
  12433. 646.75 s [vector] +++ OK, passed 1 test.
  12434. 646.75 s [vector] singleton: OK
  12435. 646.75 s [vector] +++ OK, passed 100 tests.
  12436. 646.75 s [vector] replicate: OK
  12437. 646.75 s [vector] +++ OK, passed 100 tests.
  12438. 646.75 s [vector] generate: OK
  12439. 646.75 s [vector] +++ OK, passed 100 tests.
  12440. 646.75 s [vector] iterateN: OK
  12441. 646.75 s [vector] +++ OK, passed 100 tests.
  12442. 646.83 s [vector] iterateNM: OK (0.07s)
  12443. 646.83 s [vector] +++ OK, passed 100 tests.
  12444. 646.93 s [vector] generateM: OK (0.11s)
  12445. 646.93 s [vector] +++ OK, passed 100 tests.
  12446. 646.97 s [vector] replicateM: OK (0.04s)
  12447. 646.97 s [vector] +++ OK, passed 100 tests.
  12448. 646.97 s [vector] create: OK
  12449. 646.97 s [vector] +++ OK, passed 100 tests.
  12450. 646.97 s [vector] createT: OK
  12451. 646.97 s [vector] +++ OK, passed 100 tests.
  12452. 646.97 s [vector] unfoldr: OK
  12453. 646.97 s [vector] +++ OK, passed 100 tests.
  12454. 646.97 s [vector] unfoldrN: OK
  12455. 646.98 s [vector] +++ OK, passed 100 tests.
  12456. 646.98 s [vector] unfoldrExactN: OK
  12457. 646.98 s [vector] +++ OK, passed 100 tests.
  12458. 646.98 s [vector] unfoldrM: OK
  12459. 646.98 s [vector] +++ OK, passed 100 tests.
  12460. 646.99 s [vector] unfoldrNM: OK
  12461. 646.99 s [vector] +++ OK, passed 100 tests.
  12462. 647.05 s [vector] unfoldrExactNM: OK (0.05s)
  12463. 647.05 s [vector] +++ OK, passed 100 tests.
  12464. 647.05 s [vector] constructN: OK (0.01s)
  12465. 647.05 s [vector] +++ OK, passed 100 tests.
  12466. 647.06 s [vector] constructrN: OK (0.01s)
  12467. 647.06 s [vector] +++ OK, passed 100 tests.
  12468. 647.07 s [vector] cons: OK
  12469. 647.07 s [vector] +++ OK, passed 100 tests.
  12470. 647.07 s [vector] snoc: OK
  12471. 647.07 s [vector] +++ OK, passed 100 tests.
  12472. 647.08 s [vector] append: OK
  12473. 647.08 s [vector] +++ OK, passed 100 tests.
  12474. 647.14 s [vector] concat: OK (0.05s)
  12475. 647.14 s [vector] +++ OK, passed 100 tests.
  12476. 647.15 s [vector] force: OK
  12477. 647.15 s [vector] +++ OK, passed 100 tests.
  12478. 647.15 s [vector] upd: OK
  12479. 647.15 s [vector] +++ OK, passed 100 tests.
  12480. 647.16 s [vector] accum: OK (0.01s)
  12481. 647.17 s [vector] +++ OK, passed 100 tests.
  12482. 647.17 s [vector] reverse: OK
  12483. 647.17 s [vector] +++ OK, passed 100 tests.
  12484. 647.18 s [vector] backpermute: OK
  12485. 647.18 s [vector] +++ OK, passed 100 tests.
  12486. 647.18 s [vector] map: OK
  12487. 647.18 s [vector] +++ OK, passed 100 tests.
  12488. 647.18 s [vector] imap: OK
  12489. 647.19 s [vector] +++ OK, passed 100 tests.
  12490. 647.20 s [vector] concatMap: OK
  12491. 647.20 s [vector] +++ OK, passed 100 tests.
  12492. 647.20 s [vector] mapM: OK
  12493. 647.20 s [vector] +++ OK, passed 100 tests.
  12494. 647.25 s [vector] mapM_: OK (0.05s)
  12495. 647.25 s [vector] +++ OK, passed 100 tests.
  12496. 647.25 s [vector] forM: OK
  12497. 647.27 s [vector] +++ OK, passed 100 tests.
  12498. 647.30 s [vector] forM_: OK (0.04s)
  12499. 647.31 s [vector] +++ OK, passed 100 tests.
  12500. 647.31 s [vector] imapM: OK
  12501. 647.31 s [vector] +++ OK, passed 100 tests.
  12502. 647.35 s [vector] imapM_: OK (0.04s)
  12503. 647.35 s [vector] +++ OK, passed 100 tests.
  12504. 647.35 s [vector] zipWith: OK
  12505. 647.35 s [vector] +++ OK, passed 100 tests.
  12506. 647.36 s [vector] zipWith3: OK
  12507. 647.36 s [vector] +++ OK, passed 100 tests.
  12508. 647.37 s [vector] izipWith: OK
  12509. 647.37 s [vector] +++ OK, passed 100 tests.
  12510. 647.37 s [vector] izipWith3: OK
  12511. 647.39 s [vector] +++ OK, passed 100 tests.
  12512. 647.39 s [vector] izipWithM: OK
  12513. 647.39 s [vector] +++ OK, passed 100 tests.
  12514. 647.41 s [vector] izipWithM_: OK (0.03s)
  12515. 647.41 s [vector] +++ OK, passed 100 tests.
  12516. 647.43 s [vector] zipWithM: OK
  12517. 647.43 s [vector] +++ OK, passed 100 tests.
  12518. 647.45 s [vector] zipWithM_: OK (0.03s)
  12519. 647.46 s [vector] +++ OK, passed 100 tests.
  12520. 647.46 s [vector] filter: OK
  12521. 647.46 s [vector] +++ OK, passed 100 tests.
  12522. 647.46 s [vector] ifilter: OK
  12523. 647.46 s [vector] +++ OK, passed 100 tests.
  12524. 647.52 s [vector] filterM: OK (0.06s)
  12525. 647.52 s [vector] +++ OK, passed 100 tests.
  12526. 647.52 s [vector] uniq: OK
  12527. 647.52 s [vector] +++ OK, passed 100 tests.
  12528. 647.52 s [vector] mapMaybe: OK
  12529. 647.53 s [vector] +++ OK, passed 100 tests.
  12530. 647.53 s [vector] imapMaybe: OK
  12531. 647.53 s [vector] +++ OK, passed 100 tests.
  12532. 647.54 s [vector] takeWhile: OK
  12533. 647.54 s [vector] +++ OK, passed 100 tests.
  12534. 647.54 s [vector] dropWhile: OK
  12535. 647.54 s [vector] +++ OK, passed 100 tests.
  12536. 647.54 s [vector] partition: OK
  12537. 647.54 s [vector] +++ OK, passed 100 tests.
  12538. 647.55 s [vector] partitionWith: OK
  12539. 647.55 s [vector] +++ OK, passed 100 tests.
  12540. 647.55 s [vector] span: OK
  12541. 647.55 s [vector] +++ OK, passed 100 tests.
  12542. 647.56 s [vector] break: OK
  12543. 647.56 s [vector] +++ OK, passed 100 tests.
  12544. 647.56 s [vector] spanR: OK
  12545. 647.56 s [vector] +++ OK, passed 100 tests.
  12546. 647.56 s [vector] breakR: OK
  12547. 647.56 s [vector] +++ OK, passed 100 tests.
  12548. 647.57 s [vector] groupBy: OK
  12549. 647.59 s [vector] +++ OK, passed 100 tests.
  12550. 647.60 s [vector] elem: OK
  12551. 647.60 s [vector] +++ OK, passed 100 tests.
  12552. 647.60 s [vector] notElem: OK
  12553. 647.60 s [vector] +++ OK, passed 100 tests.
  12554. 647.60 s [vector] find: OK
  12555. 647.60 s [vector] +++ OK, passed 100 tests.
  12556. 647.60 s [vector] findIndex: OK
  12557. 647.60 s [vector] +++ OK, passed 100 tests.
  12558. 647.60 s [vector] findIndexR: OK
  12559. 647.60 s [vector] +++ OK, passed 100 tests.
  12560. 647.60 s [vector] findIndices: OK
  12561. 647.60 s [vector] +++ OK, passed 100 tests.
  12562. 647.60 s [vector] elemIndex: OK
  12563. 647.60 s [vector] +++ OK, passed 100 tests.
  12564. 647.60 s [vector] elemIndices: OK
  12565. 647.60 s [vector] +++ OK, passed 100 tests.
  12566. 647.61 s [vector] foldl: OK
  12567. 647.61 s [vector] +++ OK, passed 100 tests.
  12568. 647.63 s [vector] foldl1: OK
  12569. 647.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12570. 647.63 s [vector] foldl': OK
  12571. 647.63 s [vector] +++ OK, passed 100 tests.
  12572. 647.63 s [vector] foldl1': OK
  12573. 647.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12574. 647.63 s [vector] foldr: OK
  12575. 647.64 s [vector] +++ OK, passed 100 tests.
  12576. 647.64 s [vector] foldr1: OK
  12577. 647.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12578. 647.64 s [vector] foldr': OK
  12579. 647.64 s [vector] +++ OK, passed 100 tests.
  12580. 647.65 s [vector] foldr1': OK
  12581. 647.65 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12582. 647.66 s [vector] ifoldl: OK
  12583. 647.66 s [vector] +++ OK, passed 100 tests.
  12584. 647.66 s [vector] ifoldl': OK
  12585. 647.66 s [vector] +++ OK, passed 100 tests.
  12586. 647.67 s [vector] ifoldr: OK
  12587. 647.67 s [vector] +++ OK, passed 100 tests.
  12588. 647.68 s [vector] ifoldr': OK
  12589. 647.68 s [vector] +++ OK, passed 100 tests.
  12590. 647.68 s [vector] ifoldM: OK
  12591. 647.70 s [vector] +++ OK, passed 100 tests.
  12592. 647.71 s [vector] ifoldM': OK
  12593. 647.71 s [vector] +++ OK, passed 100 tests.
  12594. 647.75 s [vector] ifoldM_: OK (0.05s)
  12595. 647.75 s [vector] +++ OK, passed 100 tests.
  12596. 647.78 s [vector] ifoldM'_: OK (0.04s)
  12597. 647.78 s [vector] +++ OK, passed 100 tests.
  12598. 647.78 s [vector] all: OK
  12599. 647.78 s [vector] +++ OK, passed 100 tests.
  12600. 647.78 s [vector] any: OK
  12601. 647.79 s [vector] +++ OK, passed 100 tests.
  12602. 647.79 s [vector] prescanl: OK
  12603. 647.80 s [vector] +++ OK, passed 100 tests.
  12604. 647.80 s [vector] prescanl': OK
  12605. 647.80 s [vector] +++ OK, passed 100 tests.
  12606. 647.81 s [vector] postscanl: OK
  12607. 647.81 s [vector] +++ OK, passed 100 tests.
  12608. 647.83 s [vector] postscanl': OK
  12609. 647.83 s [vector] +++ OK, passed 100 tests.
  12610. 647.83 s [vector] scanl: OK
  12611. 647.83 s [vector] +++ OK, passed 100 tests.
  12612. 647.85 s [vector] scanl': OK (0.01s)
  12613. 647.85 s [vector] +++ OK, passed 100 tests.
  12614. 647.85 s [vector] scanl1: OK (0.01s)
  12615. 647.85 s [vector] +++ OK, passed 100 tests.
  12616. 647.87 s [vector] scanl1': OK (0.01s)
  12617. 647.87 s [vector] +++ OK, passed 100 tests.
  12618. 647.87 s [vector] iscanl: OK (0.01s)
  12619. 647.87 s [vector] +++ OK, passed 100 tests.
  12620. 647.89 s [vector] iscanl': OK (0.01s)
  12621. 647.89 s [vector] +++ OK, passed 100 tests.
  12622. 647.89 s [vector] prescanr: OK
  12623. 647.89 s [vector] +++ OK, passed 100 tests.
  12624. 647.91 s [vector] prescanr': OK
  12625. 647.92 s [vector] +++ OK, passed 100 tests.
  12626. 647.93 s [vector] postscanr: OK (0.02s)
  12627. 647.93 s [vector] +++ OK, passed 100 tests.
  12628. 647.93 s [vector] postscanr': OK (0.01s)
  12629. 647.93 s [vector] +++ OK, passed 100 tests.
  12630. 647.95 s [vector] scanr: OK
  12631. 647.95 s [vector] +++ OK, passed 100 tests.
  12632. 647.95 s [vector] scanr': OK
  12633. 647.95 s [vector] +++ OK, passed 100 tests.
  12634. 647.96 s [vector] scanr1: OK
  12635. 647.96 s [vector] +++ OK, passed 100 tests.
  12636. 647.96 s [vector] scanr1': OK
  12637. 647.99 s [vector] +++ OK, passed 100 tests.
  12638. 648.01 s [vector] iscanr: OK (0.03s)
  12639. 648.01 s [vector] +++ OK, passed 100 tests.
  12640. 648.01 s [vector] iscanr': OK
  12641. 648.01 s [vector] +++ OK, passed 100 tests.
  12642. 648.01 s [vector] mut_read: OK
  12643. 648.01 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12644. 648.02 s [vector] mut_write: OK
  12645. 648.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12646. 648.02 s [vector] mut_modify: OK
  12647. 648.02 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12648. 648.03 s [vector] mut_generate: OK
  12649. 648.03 s [vector] +++ OK, passed 100 tests.
  12650. 648.05 s [vector] mut_generateM: OK (0.02s)
  12651. 648.05 s [vector] +++ OK, passed 100 tests.
  12652. 648.09 s [vector] mut_mapM_: OK (0.04s)
  12653. 648.09 s [vector] +++ OK, passed 100 tests.
  12654. 648.15 s [vector] mut_imapM_: OK (0.05s)
  12655. 648.15 s [vector] +++ OK, passed 100 tests.
  12656. 648.19 s [vector] mut_forM_: OK (0.04s)
  12657. 648.19 s [vector] +++ OK, passed 100 tests.
  12658. 648.23 s [vector] mut_iforM_: OK (0.05s)
  12659. 648.23 s [vector] +++ OK, passed 100 tests.
  12660. 648.23 s [vector] mut_foldr: OK
  12661. 648.23 s [vector] +++ OK, passed 100 tests.
  12662. 648.23 s [vector] mut_foldr': OK
  12663. 648.24 s [vector] +++ OK, passed 100 tests.
  12664. 648.24 s [vector] mut_foldl: OK
  12665. 648.24 s [vector] +++ OK, passed 100 tests.
  12666. 648.24 s [vector] mut_foldl': OK
  12667. 648.25 s [vector] +++ OK, passed 100 tests.
  12668. 648.26 s [vector] mut_ifoldr: OK
  12669. 648.26 s [vector] +++ OK, passed 100 tests.
  12670. 648.26 s [vector] mut_ifoldr': OK
  12671. 648.26 s [vector] +++ OK, passed 100 tests.
  12672. 648.27 s [vector] mut_ifoldl: OK
  12673. 648.27 s [vector] +++ OK, passed 100 tests.
  12674. 648.28 s [vector] mut_ifoldl': OK
  12675. 648.28 s [vector] +++ OK, passed 100 tests.
  12676. 648.28 s [vector] mut_foldM: OK
  12677. 648.28 s [vector] +++ OK, passed 100 tests.
  12678. 648.29 s [vector] mut_foldM': OK
  12679. 648.29 s [vector] +++ OK, passed 100 tests.
  12680. 648.30 s [vector] mut_foldrM: OK
  12681. 648.30 s [vector] +++ OK, passed 100 tests.
  12682. 648.30 s [vector] mut_foldrM': OK
  12683. 648.30 s [vector] +++ OK, passed 100 tests.
  12684. 648.31 s [vector] mut_ifoldM: OK
  12685. 648.31 s [vector] +++ OK, passed 100 tests.
  12686. 648.32 s [vector] mut_ifoldM': OK
  12687. 648.32 s [vector] +++ OK, passed 100 tests.
  12688. 648.32 s [vector] mut_ifoldrM: OK
  12689. 648.32 s [vector] +++ OK, passed 100 tests.
  12690. 648.33 s [vector] mut_ifoldrM': OK
  12691. 648.33 s [vector] +++ OK, passed 100 tests.
  12692. 648.33 s [vector] compare: OK
  12693. 648.33 s [vector] +++ OK, passed 100 tests.
  12694. 648.33 s [vector] maximum: OK
  12695. 648.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12696. 648.33 s [vector] minimum: OK
  12697. 648.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12698. 648.34 s [vector] minIndex: OK
  12699. 648.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12700. 648.34 s [vector] maxIndex: OK
  12701. 648.34 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12702. 648.34 s [vector] maximumBy: OK
  12703. 648.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12704. 648.34 s [vector] minimumBy: OK
  12705. 648.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12706. 648.34 s [vector] maximumOn: OK
  12707. 648.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12708. 648.34 s [vector] minimumOn: OK
  12709. 648.34 s [vector] +++ OK, passed 100 tests; 24 discarded.
  12710. 648.34 s [vector] maxIndexBy: OK
  12711. 648.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12712. 648.35 s [vector] minIndexBy: OK
  12713. 648.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12714. 648.35 s [vector] ListFirstMaxIndexWins: OK
  12715. 648.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12716. 648.35 s [vector] FalseListFirstMaxIndexWins: OK
  12717. 648.35 s [vector] +++ OK, failed as expected. (after 1 test):
  12718. 648.35 s [vector] Exception:
  12719. 648.35 s [vector] Prelude.foldr1: empty list
  12720. 648.35 s [vector] CallStack (from HasCallStack):
  12721. 648.35 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12722. 648.35 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12723. 648.35 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12724. 648.35 s [vector] []
  12725. 648.36 s [vector] zip: OK
  12726. 648.36 s [vector] +++ OK, passed 100 tests.
  12727. 648.36 s [vector] zip3: OK
  12728. 648.36 s [vector] +++ OK, passed 100 tests.
  12729. 648.37 s [vector] unzip: OK
  12730. 648.37 s [vector] +++ OK, passed 100 tests.
  12731. 648.37 s [vector] unzip3: OK
  12732. 648.37 s [vector] +++ OK, passed 100 tests.
  12733. 648.37 s [vector] indexed: OK
  12734. 648.38 s [vector] +++ OK, passed 100 tests.
  12735. 648.38 s [vector] update: OK
  12736. 648.38 s [vector] +++ OK, passed 100 tests.
  12737. 648.38 s [vector] mempty: OK
  12738. 648.38 s [vector] +++ OK, passed 1 test.
  12739. 648.39 s [vector] mappend: OK
  12740. 648.39 s [vector] +++ OK, passed 100 tests.
  12741. 648.45 s [vector] mconcat: OK (0.06s)
  12742. 648.45 s [vector] +++ OK, passed 100 tests.
  12743. 648.45 s [vector] glength: OK
  12744. 648.45 s [vector] +++ OK, passed 100 tests.
  12745. 648.45 s [vector] (Int,Bool,Int)
  12746. 648.45 s [vector] fromList.toList == id: OK
  12747. 648.45 s [vector] +++ OK, passed 100 tests.
  12748. 648.45 s [vector] toList.fromList == id: OK
  12749. 648.46 s [vector] +++ OK, passed 100 tests.
  12750. 648.46 s [vector] unstream.stream == id: OK
  12751. 648.46 s [vector] +++ OK, passed 100 tests.
  12752. 648.46 s [vector] stream.unstream == id: OK
  12753. 648.46 s [vector] +++ OK, passed 100 tests.
  12754. 648.46 s [vector] eq: OK
  12755. 648.47 s [vector] +++ OK, passed 100 tests.
  12756. 648.47 s [vector] length: OK
  12757. 648.47 s [vector] +++ OK, passed 100 tests.
  12758. 648.47 s [vector] null: OK
  12759. 648.47 s [vector] +++ OK, passed 100 tests.
  12760. 648.47 s [vector] index: OK
  12761. 648.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12762. 648.47 s [vector] safeIndex: OK
  12763. 648.47 s [vector] +++ OK, passed 100 tests.
  12764. 648.47 s [vector] head: OK
  12765. 648.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12766. 648.47 s [vector] last: OK
  12767. 648.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12768. 648.48 s [vector] unsafeIndex: OK
  12769. 648.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12770. 648.48 s [vector] unsafeHead: OK
  12771. 648.48 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12772. 648.48 s [vector] unsafeLast: OK
  12773. 648.48 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12774. 648.48 s [vector] slice: OK
  12775. 648.48 s [vector] +++ OK, passed 100 tests.
  12776. 648.48 s [vector] init: OK
  12777. 648.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12778. 648.49 s [vector] tail: OK
  12779. 648.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12780. 648.49 s [vector] take: OK
  12781. 648.49 s [vector] +++ OK, passed 100 tests.
  12782. 648.49 s [vector] drop: OK
  12783. 648.50 s [vector] +++ OK, passed 100 tests.
  12784. 648.50 s [vector] splitAt: OK
  12785. 648.50 s [vector] +++ OK, passed 100 tests.
  12786. 648.50 s [vector] empty: OK
  12787. 648.50 s [vector] +++ OK, passed 1 test.
  12788. 648.50 s [vector] singleton: OK
  12789. 648.50 s [vector] +++ OK, passed 100 tests.
  12790. 648.50 s [vector] replicate: OK
  12791. 648.50 s [vector] +++ OK, passed 100 tests.
  12792. 648.50 s [vector] generate: OK
  12793. 648.50 s [vector] +++ OK, passed 100 tests.
  12794. 648.50 s [vector] iterateN: OK
  12795. 648.51 s [vector] +++ OK, passed 100 tests.
  12796. 648.53 s [vector] iterateNM: OK (0.02s)
  12797. 648.53 s [vector] +++ OK, passed 100 tests.
  12798. 648.59 s [vector] generateM: OK (0.06s)
  12799. 648.59 s [vector] +++ OK, passed 100 tests.
  12800. 648.61 s [vector] replicateM: OK (0.02s)
  12801. 648.61 s [vector] +++ OK, passed 100 tests.
  12802. 648.61 s [vector] create: OK
  12803. 648.61 s [vector] +++ OK, passed 100 tests.
  12804. 648.61 s [vector] createT: OK
  12805. 648.61 s [vector] +++ OK, passed 100 tests.
  12806. 648.61 s [vector] unfoldr: OK
  12807. 648.61 s [vector] +++ OK, passed 100 tests.
  12808. 648.61 s [vector] unfoldrN: OK
  12809. 648.62 s [vector] +++ OK, passed 100 tests.
  12810. 648.62 s [vector] unfoldrExactN: OK
  12811. 648.62 s [vector] +++ OK, passed 100 tests.
  12812. 648.62 s [vector] unfoldrM: OK
  12813. 648.62 s [vector] +++ OK, passed 100 tests.
  12814. 648.63 s [vector] unfoldrNM: OK
  12815. 648.63 s [vector] +++ OK, passed 100 tests.
  12816. 648.70 s [vector] unfoldrExactNM: OK (0.05s)
  12817. 648.70 s [vector] +++ OK, passed 100 tests.
  12818. 648.70 s [vector] constructN: OK (0.01s)
  12819. 648.70 s [vector] +++ OK, passed 100 tests.
  12820. 648.71 s [vector] constructrN: OK (0.01s)
  12821. 648.71 s [vector] +++ OK, passed 100 tests.
  12822. 648.71 s [vector] cons: OK
  12823. 648.71 s [vector] +++ OK, passed 100 tests.
  12824. 648.71 s [vector] snoc: OK
  12825. 648.72 s [vector] +++ OK, passed 100 tests.
  12826. 648.72 s [vector] append: OK
  12827. 648.72 s [vector] +++ OK, passed 100 tests.
  12828. 648.81 s [vector] concat: OK (0.09s)
  12829. 648.81 s [vector] +++ OK, passed 100 tests.
  12830. 648.81 s [vector] force: OK
  12831. 648.82 s [vector] +++ OK, passed 100 tests.
  12832. 648.82 s [vector] upd: OK
  12833. 648.83 s [vector] +++ OK, passed 100 tests.
  12834. 648.84 s [vector] accum: OK (0.01s)
  12835. 648.84 s [vector] +++ OK, passed 100 tests.
  12836. 648.84 s [vector] reverse: OK
  12837. 648.84 s [vector] +++ OK, passed 100 tests.
  12838. 648.85 s [vector] backpermute: OK
  12839. 648.85 s [vector] +++ OK, passed 100 tests.
  12840. 648.86 s [vector] map: OK (0.01s)
  12841. 648.86 s [vector] +++ OK, passed 100 tests.
  12842. 648.87 s [vector] imap: OK
  12843. 648.87 s [vector] +++ OK, passed 100 tests.
  12844. 648.89 s [vector] concatMap: OK (0.01s)
  12845. 648.89 s [vector] +++ OK, passed 100 tests.
  12846. 648.89 s [vector] mapM: OK
  12847. 648.89 s [vector] +++ OK, passed 100 tests.
  12848. 648.95 s [vector] mapM_: OK (0.06s)
  12849. 648.95 s [vector] +++ OK, passed 100 tests.
  12850. 648.97 s [vector] forM: OK
  12851. 648.97 s [vector] +++ OK, passed 100 tests.
  12852. 649.03 s [vector] forM_: OK (0.07s)
  12853. 649.03 s [vector] +++ OK, passed 100 tests.
  12854. 649.05 s [vector] imapM: OK (0.01s)
  12855. 649.05 s [vector] +++ OK, passed 100 tests.
  12856. 649.13 s [vector] imapM_: OK (0.08s)
  12857. 649.13 s [vector] +++ OK, passed 100 tests.
  12858. 649.14 s [vector] zipWith: OK (0.01s)
  12859. 649.15 s [vector] +++ OK, passed 100 tests.
  12860. 649.15 s [vector] zipWith3: OK (0.01s)
  12861. 649.15 s [vector] +++ OK, passed 100 tests.
  12862. 649.17 s [vector] izipWith: OK (0.01s)
  12863. 649.17 s [vector] +++ OK, passed 100 tests.
  12864. 649.17 s [vector] izipWith3: OK (0.01s)
  12865. 649.17 s [vector] +++ OK, passed 100 tests.
  12866. 649.19 s [vector] izipWithM: OK (0.01s)
  12867. 649.19 s [vector] +++ OK, passed 100 tests.
  12868. 649.24 s [vector] izipWithM_: OK (0.05s)
  12869. 649.24 s [vector] +++ OK, passed 100 tests.
  12870. 649.24 s [vector] zipWithM: OK (0.01s)
  12871. 649.25 s [vector] +++ OK, passed 100 tests.
  12872. 649.29 s [vector] zipWithM_: OK (0.05s)
  12873. 649.29 s [vector] +++ OK, passed 100 tests.
  12874. 649.30 s [vector] filter: OK
  12875. 649.31 s [vector] +++ OK, passed 100 tests.
  12876. 649.31 s [vector] ifilter: OK
  12877. 649.33 s [vector] +++ OK, passed 100 tests.
  12878. 649.42 s [vector] filterM: OK (0.10s)
  12879. 649.42 s [vector] +++ OK, passed 100 tests.
  12880. 649.42 s [vector] uniq: OK
  12881. 649.42 s [vector] +++ OK, passed 100 tests.
  12882. 649.45 s [vector] mapMaybe: OK (0.02s)
  12883. 649.45 s [vector] +++ OK, passed 100 tests.
  12884. 649.45 s [vector] imapMaybe: OK (0.01s)
  12885. 649.45 s [vector] +++ OK, passed 100 tests.
  12886. 649.46 s [vector] takeWhile: OK
  12887. 649.46 s [vector] +++ OK, passed 100 tests.
  12888. 649.46 s [vector] dropWhile: OK
  12889. 649.46 s [vector] +++ OK, passed 100 tests.
  12890. 649.46 s [vector] partition: OK
  12891. 649.46 s [vector] +++ OK, passed 100 tests.
  12892. 649.47 s [vector] partitionWith: OK
  12893. 649.48 s [vector] +++ OK, passed 100 tests.
  12894. 649.48 s [vector] span: OK
  12895. 649.48 s [vector] +++ OK, passed 100 tests.
  12896. 649.48 s [vector] break: OK
  12897. 649.48 s [vector] +++ OK, passed 100 tests.
  12898. 649.49 s [vector] spanR: OK
  12899. 649.49 s [vector] +++ OK, passed 100 tests.
  12900. 649.49 s [vector] breakR: OK
  12901. 649.49 s [vector] +++ OK, passed 100 tests.
  12902. 649.50 s [vector] groupBy: OK
  12903. 649.50 s [vector] +++ OK, passed 100 tests.
  12904. 649.50 s [vector] elem: OK
  12905. 649.50 s [vector] +++ OK, passed 100 tests.
  12906. 649.50 s [vector] notElem: OK
  12907. 649.51 s [vector] +++ OK, passed 100 tests.
  12908. 649.51 s [vector] find: OK
  12909. 649.51 s [vector] +++ OK, passed 100 tests.
  12910. 649.51 s [vector] findIndex: OK
  12911. 649.51 s [vector] +++ OK, passed 100 tests.
  12912. 649.51 s [vector] findIndexR: OK
  12913. 649.51 s [vector] +++ OK, passed 100 tests.
  12914. 649.51 s [vector] findIndices: OK
  12915. 649.52 s [vector] +++ OK, passed 100 tests.
  12916. 649.52 s [vector] elemIndex: OK
  12917. 649.52 s [vector] +++ OK, passed 100 tests.
  12918. 649.52 s [vector] elemIndices: OK
  12919. 649.53 s [vector] +++ OK, passed 100 tests.
  12920. 649.53 s [vector] foldl: OK
  12921. 649.53 s [vector] +++ OK, passed 100 tests.
  12922. 649.55 s [vector] foldl1: OK
  12923. 649.55 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12924. 649.55 s [vector] foldl': OK (0.01s)
  12925. 649.55 s [vector] +++ OK, passed 100 tests.
  12926. 649.57 s [vector] foldl1': OK (0.01s)
  12927. 649.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12928. 649.58 s [vector] foldr: OK (0.01s)
  12929. 649.58 s [vector] +++ OK, passed 100 tests.
  12930. 649.58 s [vector] foldr1: OK (0.01s)
  12931. 649.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12932. 649.60 s [vector] foldr': OK
  12933. 649.60 s [vector] +++ OK, passed 100 tests.
  12934. 649.60 s [vector] foldr1': OK
  12935. 649.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12936. 649.61 s [vector] ifoldl: OK
  12937. 649.61 s [vector] +++ OK, passed 100 tests.
  12938. 649.63 s [vector] ifoldl': OK (0.01s)
  12939. 649.63 s [vector] +++ OK, passed 100 tests.
  12940. 649.64 s [vector] ifoldr: OK (0.01s)
  12941. 649.65 s [vector] +++ OK, passed 100 tests.
  12942. 649.65 s [vector] ifoldr': OK (0.01s)
  12943. 649.65 s [vector] +++ OK, passed 100 tests.
  12944. 649.66 s [vector] ifoldM: OK (0.01s)
  12945. 649.66 s [vector] +++ OK, passed 100 tests.
  12946. 649.67 s [vector] ifoldM': OK
  12947. 649.67 s [vector] +++ OK, passed 100 tests.
  12948. 649.75 s [vector] ifoldM_: OK (0.07s)
  12949. 649.75 s [vector] +++ OK, passed 100 tests.
  12950. 649.80 s [vector] ifoldM'_: OK (0.07s)
  12951. 649.80 s [vector] +++ OK, passed 100 tests.
  12952. 649.81 s [vector] all: OK
  12953. 649.81 s [vector] +++ OK, passed 100 tests.
  12954. 649.81 s [vector] any: OK
  12955. 649.81 s [vector] +++ OK, passed 100 tests.
  12956. 649.83 s [vector] prescanl: OK (0.01s)
  12957. 649.83 s [vector] +++ OK, passed 100 tests.
  12958. 649.85 s [vector] prescanl': OK (0.01s)
  12959. 649.85 s [vector] +++ OK, passed 100 tests.
  12960. 649.85 s [vector] postscanl: OK (0.01s)
  12961. 649.85 s [vector] +++ OK, passed 100 tests.
  12962. 649.87 s [vector] postscanl': OK (0.01s)
  12963. 649.87 s [vector] +++ OK, passed 100 tests.
  12964. 649.89 s [vector] scanl: OK (0.02s)
  12965. 649.89 s [vector] +++ OK, passed 100 tests.
  12966. 649.89 s [vector] scanl': OK (0.01s)
  12967. 649.89 s [vector] +++ OK, passed 100 tests.
  12968. 649.91 s [vector] scanl1: OK (0.01s)
  12969. 649.91 s [vector] +++ OK, passed 100 tests.
  12970. 649.93 s [vector] scanl1': OK (0.01s)
  12971. 649.93 s [vector] +++ OK, passed 100 tests.
  12972. 649.93 s [vector] iscanl: OK (0.01s)
  12973. 649.93 s [vector] +++ OK, passed 100 tests.
  12974. 649.94 s [vector] iscanl': OK (0.01s)
  12975. 649.94 s [vector] +++ OK, passed 100 tests.
  12976. 649.95 s [vector] prescanr: OK
  12977. 649.95 s [vector] +++ OK, passed 100 tests.
  12978. 649.97 s [vector] prescanr': OK (0.01s)
  12979. 649.97 s [vector] +++ OK, passed 100 tests.
  12980. 649.99 s [vector] postscanr: OK
  12981. 649.99 s [vector] +++ OK, passed 100 tests.
  12982. 650.01 s [vector] postscanr': OK (0.01s)
  12983. 650.01 s [vector] +++ OK, passed 100 tests.
  12984. 650.01 s [vector] scanr: OK (0.01s)
  12985. 650.01 s [vector] +++ OK, passed 100 tests.
  12986. 650.03 s [vector] scanr': OK (0.02s)
  12987. 650.03 s [vector] +++ OK, passed 100 tests.
  12988. 650.05 s [vector] scanr1: OK (0.01s)
  12989. 650.05 s [vector] +++ OK, passed 100 tests.
  12990. 650.05 s [vector] scanr1': OK (0.01s)
  12991. 650.05 s [vector] +++ OK, passed 100 tests.
  12992. 650.07 s [vector] iscanr: OK (0.01s)
  12993. 650.07 s [vector] +++ OK, passed 100 tests.
  12994. 650.08 s [vector] iscanr': OK (0.01s)
  12995. 650.08 s [vector] +++ OK, passed 100 tests.
  12996. 650.08 s [vector] mut_read: OK
  12997. 650.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12998. 650.08 s [vector] mut_write: OK
  12999. 650.09 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13000. 650.09 s [vector] mut_modify: OK
  13001. 650.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13002. 650.09 s [vector] mut_generate: OK
  13003. 650.09 s [vector] +++ OK, passed 100 tests.
  13004. 650.19 s [vector] mut_generateM: OK (0.10s)
  13005. 650.19 s [vector] +++ OK, passed 100 tests.
  13006. 650.27 s [vector] mut_mapM_: OK (0.08s)
  13007. 650.27 s [vector] +++ OK, passed 100 tests.
  13008. 650.35 s [vector] mut_imapM_: OK (0.08s)
  13009. 650.35 s [vector] +++ OK, passed 100 tests.
  13010. 650.42 s [vector] mut_forM_: OK (0.07s)
  13011. 650.42 s [vector] +++ OK, passed 100 tests.
  13012. 650.47 s [vector] mut_iforM_: OK (0.07s)
  13013. 650.47 s [vector] +++ OK, passed 100 tests.
  13014. 650.49 s [vector] mut_foldr: OK
  13015. 650.49 s [vector] +++ OK, passed 100 tests.
  13016. 650.50 s [vector] mut_foldr': OK
  13017. 650.51 s [vector] +++ OK, passed 100 tests.
  13018. 650.51 s [vector] mut_foldl: OK (0.01s)
  13019. 650.51 s [vector] +++ OK, passed 100 tests.
  13020. 650.53 s [vector] mut_foldl': OK (0.01s)
  13021. 650.53 s [vector] +++ OK, passed 100 tests.
  13022. 650.54 s [vector] mut_ifoldr: OK (0.01s)
  13023. 650.54 s [vector] +++ OK, passed 100 tests.
  13024. 650.54 s [vector] mut_ifoldr': OK
  13025. 650.54 s [vector] +++ OK, passed 100 tests.
  13026. 650.56 s [vector] mut_ifoldl: OK
  13027. 650.56 s [vector] +++ OK, passed 100 tests.
  13028. 650.57 s [vector] mut_ifoldl': OK (0.01s)
  13029. 650.57 s [vector] +++ OK, passed 100 tests.
  13030. 650.57 s [vector] mut_foldM: OK
  13031. 650.57 s [vector] +++ OK, passed 100 tests.
  13032. 650.59 s [vector] mut_foldM': OK
  13033. 650.59 s [vector] +++ OK, passed 100 tests.
  13034. 650.59 s [vector] mut_foldrM: OK
  13035. 650.59 s [vector] +++ OK, passed 100 tests.
  13036. 650.60 s [vector] mut_foldrM': OK
  13037. 650.60 s [vector] +++ OK, passed 100 tests.
  13038. 650.61 s [vector] mut_ifoldM: OK (0.01s)
  13039. 650.61 s [vector] +++ OK, passed 100 tests.
  13040. 650.63 s [vector] mut_ifoldM': OK (0.01s)
  13041. 650.63 s [vector] +++ OK, passed 100 tests.
  13042. 650.63 s [vector] mut_ifoldrM: OK (0.01s)
  13043. 650.63 s [vector] +++ OK, passed 100 tests.
  13044. 650.64 s [vector] mut_ifoldrM': OK (0.01s)
  13045. 650.64 s [vector] +++ OK, passed 100 tests.
  13046. 650.65 s [vector] compare: OK
  13047. 650.65 s [vector] +++ OK, passed 100 tests.
  13048. 650.65 s [vector] maximum: OK
  13049. 650.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13050. 650.65 s [vector] minimum: OK
  13051. 650.65 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13052. 650.65 s [vector] minIndex: OK
  13053. 650.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13054. 650.66 s [vector] maxIndex: OK
  13055. 650.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13056. 650.66 s [vector] maximumBy: OK
  13057. 650.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13058. 650.66 s [vector] minimumBy: OK
  13059. 650.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13060. 650.66 s [vector] maximumOn: OK
  13061. 650.66 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13062. 650.67 s [vector] minimumOn: OK
  13063. 650.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13064. 650.67 s [vector] maxIndexBy: OK
  13065. 650.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13066. 650.67 s [vector] minIndexBy: OK
  13067. 650.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13068. 650.67 s [vector] ListFirstMaxIndexWins: OK
  13069. 650.67 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13070. 650.67 s [vector] FalseListFirstMaxIndexWins: OK
  13071. 650.68 s [vector] +++ OK, failed as expected. (after 1 test):
  13072. 650.68 s [vector] Exception:
  13073. 650.68 s [vector] Prelude.foldr1: empty list
  13074. 650.68 s [vector] CallStack (from HasCallStack):
  13075. 650.68 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13076. 650.68 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13077. 650.68 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13078. 650.68 s [vector] []
  13079. 650.68 s [vector] zip: OK
  13080. 650.68 s [vector] +++ OK, passed 100 tests.
  13081. 650.69 s [vector] zip3: OK
  13082. 650.69 s [vector] +++ OK, passed 100 tests.
  13083. 650.69 s [vector] unzip: OK
  13084. 650.69 s [vector] +++ OK, passed 100 tests.
  13085. 650.70 s [vector] unzip3: OK
  13086. 650.70 s [vector] +++ OK, passed 100 tests.
  13087. 650.70 s [vector] indexed: OK
  13088. 650.71 s [vector] +++ OK, passed 100 tests.
  13089. 650.71 s [vector] update: OK
  13090. 650.71 s [vector] +++ OK, passed 100 tests.
  13091. 650.71 s [vector] mempty: OK
  13092. 650.71 s [vector] +++ OK, passed 1 test.
  13093. 650.72 s [vector] mappend: OK
  13094. 650.73 s [vector] +++ OK, passed 100 tests.
  13095. 650.82 s [vector] mconcat: OK (0.10s)
  13096. 650.82 s [vector] +++ OK, passed 100 tests.
  13097. 650.82 s [vector] glength: OK
  13098. 650.82 s [vector] +++ OK, passed 100 tests.
  13099. 650.82 s [vector] unstream
  13100. 650.82 s [vector] unstream == vunstream (exact): OK
  13101. 650.82 s [vector] +++ OK, passed 100 tests.
  13102. 650.82 s [vector] unstream == vunstream (unknown): OK
  13103. 650.82 s [vector] +++ OK, passed 100 tests.
  13104. 650.82 s [vector] unstreamR ~= vunstream (exact): OK
  13105. 650.82 s [vector] +++ OK, passed 100 tests.
  13106. 650.82 s [vector] unstreamR ~= vunstream (unknown): OK
  13107. 650.82 s [vector] +++ OK, passed 100 tests.
  13108. 650.82 s [vector] Data.Vector.Storable.Vector Alignment
  13109. 650.82 s [vector] Aligned Double: OK
  13110. 650.82 s [vector] Aligned Int: OK
  13111. 650.82 s [vector] Regression tests
  13112. 650.82 s [vector] enumFromTo crash #188
  13113. 650.82 s [vector] Word8: OK
  13114. 650.82 s [vector] Word16: OK
  13115. 650.82 s [vector] Word32: OK
  13116. 650.82 s [vector] Word64: OK
  13117. 650.82 s [vector] Word: OK
  13118. 650.82 s [vector] Int8: OK
  13119. 650.82 s [vector] Int16: OK
  13120. 650.82 s [vector] Int32: OK
  13121. 650.82 s [vector] Int64: OK
  13122. 650.82 s [vector] Int: OK
  13123. 650.82 s [vector] Char: OK
  13124. 650.82 s [vector] Negative tests
  13125. 650.82 s [vector] slice out of bounds #257
  13126. 650.82 s [vector] Boxed
  13127. 650.82 s [vector] Negative ix: OK
  13128. 650.82 s [vector] Negative size: OK
  13129. 650.82 s [vector] Negative ix and size: OK
  13130. 650.82 s [vector] Too large ix: OK
  13131. 650.82 s [vector] Too large size: OK
  13132. 650.82 s [vector] Too large ix and size: OK
  13133. 650.82 s [vector] Overflow: OK
  13134. 650.82 s [vector] OutOfMemory: OK
  13135. 650.83 s [vector] Primitive
  13136. 650.83 s [vector] Negative ix: OK
  13137. 650.83 s [vector] Negative size: OK
  13138. 650.83 s [vector] Negative ix and size: OK
  13139. 650.83 s [vector] Too large ix: OK
  13140. 650.83 s [vector] Too large size: OK
  13141. 650.83 s [vector] Too large ix and size: OK
  13142. 650.83 s [vector] Overflow: OK
  13143. 650.83 s [vector] OutOfMemory: OK
  13144. 650.83 s [vector] Storable
  13145. 650.83 s [vector] Negative ix: OK
  13146. 650.83 s [vector] Negative size: OK
  13147. 650.83 s [vector] Negative ix and size: OK
  13148. 650.83 s [vector] Too large ix: OK
  13149. 650.83 s [vector] Too large size: OK
  13150. 650.83 s [vector] Too large ix and size: OK
  13151. 650.83 s [vector] Overflow: OK
  13152. 650.83 s [vector] OutOfMemory: OK
  13153. 650.83 s [vector] Unboxed
  13154. 650.83 s [vector] Negative ix: OK
  13155. 650.83 s [vector] Negative size: OK
  13156. 650.83 s [vector] Negative ix and size: OK
  13157. 650.83 s [vector] Too large ix: OK
  13158. 650.83 s [vector] Too large size: OK
  13159. 650.83 s [vector] Too large ix and size: OK
  13160. 650.83 s [vector] Overflow: OK
  13161. 650.83 s [vector] OutOfMemory: OK
  13162. 650.83 s [vector] take #282
  13163. 650.83 s [vector] Boxed: OK
  13164. 650.83 s [vector] Primitive: OK
  13165. 650.83 s [vector] Storable: OK
  13166. 650.83 s [vector] Unboxed: OK
  13167. 650.83 s [vector] Data.Vector
  13168. 650.83 s [vector] MonadFix: OK
  13169. 650.83 s [vector] toFromArray: OK
  13170. 650.83 s [vector] toFromArraySlice: OK
  13171. 650.83 s [vector] toFromArraySliceUnsafe: OK
  13172. 650.83 s [vector] toFromMutableArray: OK
  13173. 650.83 s [vector] Data.Vector.Mutable (Move): OK
  13174. 650.83 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13175. 650.83 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  13176. 650.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13177. 650.83 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  13178. 650.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13179. 650.83 s [vector] Data.Vector.Storable.Mutable (Move): OK
  13180. 650.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13181. 650.85 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
  13182. 650.87 s [vector] +++ OK, passed 1 test.
  13183. 650.87 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.03s)
  13184. 650.88 s [vector] +++ OK, passed 1 test.
  13185. 650.88 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  13186. 650.88 s [vector] +++ OK, passed 100 tests.
  13187. 650.88 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  13188. 650.88 s [vector] +++ OK, passed 100 tests.
  13189. 650.88 s [vector]
  13190. 650.88 s [vector] All 2808 tests passed (26.29s)
  13191. 650.89 s [vector] Test suite vector-tests-O2: PASS
  13192. 650.89 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  13193. 650.89 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  13194. 650.91 s [vector] checkPhase completed in 59 seconds
  13195. 650.91 s [vector] Phase: haddockPhase
  13196. 650.93 s [vector] Phase: installPhase
  13197. 651.14 s [vector] Installing library in /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  13198. 652.68 s [vector] Installing internal library benchmarks-O2 in /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/vector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2
  13199. 653.41 s [vector] Phase: fixupPhase
  13200. 653.50 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0
  13201. 653.54 s [vector] shrinking /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSvector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0-ghc9.10.1.so
  13202. 653.61 s [vector] shrinking /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSvector-0.13.2.0-FXNWpCGA7t9EDHWGianmr-benchmarks-O2-ghc9.10.1.so
  13203. 653.63 s [vector] checking for references to /build/ in /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0...
  13204. 653.75 s [vector] patching script interpreter paths in /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0
  13205. 653.77 s [vector] stripping (with command strip and flags -S -p) in /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0/lib
  13206. 656.20 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0
  13207. 657.71 s [vector:post-build] Pushing 1 paths (93 are already present) using zstd to cache sellout ⏳
  13208. 657.71 s [vector:post-build]
  13209. 658.09 s [vector:post-build] Pushing /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0 (58.19 MiB)
  13210. 660.89 s [vector:post-build]
  13211. 660.89 s [vector:post-build] All done.
  13212. 661.11 s [vector:post-build] Uploading to the NixCI cache: /nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0
  13213. 661.79 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13214. 661.91 s [vector:post-build] copying 1 paths...
  13215. 661.91 s [vector:post-build] copying path '/nix/store/hyqmx62gcq346laizn5izj6kcka3sza6-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  13216. 693.72 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13217. 694.09 s [vector:post-build] copying 4 paths...
  13218. 694.10 s [vector:post-build] copying path '/nix/store/s5kalgmvd0gvn20yh9mxi951llkgmcg7-vector-stream-0.1.0.1.drv' to 'https://cache.nix-ci.com'...
  13219. 694.10 s [vector:post-build] copying path '/nix/store/6i545axivmg3pdici06nvqwdr7gyz3g2-inspection-testing-0.5.0.3.drv' to 'https://cache.nix-ci.com'...
  13220. 694.32 s [vector:post-build] copying path '/nix/store/a607ixsc288vvk6x07hc1mg7b1jqz2h7-tasty-inspection-testing-0.2.1.drv' to 'https://cache.nix-ci.com'...
  13221. 694.50 s [vector:post-build] copying path '/nix/store/9sdcph0ixy8mnwgybcgqawcy6bdqrkzc-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  13222. 694.94 s Progress: 5 of 15 built, 155 of 155 downloaded from cache
  13223. 695.11 s Building /nix/store/9jx63sm45m4n77jl36vn2h1wsq9fmw90-nothunks-0.3.0.0.drv
  13224. 695.47 s [nothunks] Phase: setupCompilerEnvironmentPhase
  13225. 695.48 s [nothunks] Build with /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1.
  13226. 696.22 s [nothunks] Phase: unpackPhase
  13227. 696.25 s [nothunks] unpacking source archive /nix/store/wzdyx5j9ylkjc475kaylxv5w38vhyy44-nothunks-0.3.0.0.tar.gz
  13228. 696.26 s [nothunks] source root is nothunks-0.3.0.0
  13229. 696.29 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.0.0/test/Test/NoThunks/Class.hs"
  13230. 696.30 s [nothunks] Phase: patchPhase
  13231. 696.31 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.0.0/revision/1.cabal.
  13232. 696.32 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  13233. 696.39 s [nothunks] Phase: compileBuildDriverPhase
  13234. 696.40 s [nothunks] setupCompileFlags: -package-db=/build/tmp.k6pqZiuWkP/setup-package.conf.d -threaded
  13235. 696.65 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.k6pqZiuWkP/Main.o )
  13236. 696.94 s [nothunks] [2 of 2] Linking Setup
  13237. 700.08 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  13238. 700.10 s [nothunks] Phase: configurePhase
  13239. 700.12 s [nothunks] configureFlags: --verbose --prefix=/nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ss6m511v9hw3shij71jmqmkv3wna4a7i-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0 --with-gcc=gcc --package-db=/build/tmp.k6pqZiuWkP/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  13240. 700.15 s [nothunks] Using Parsec parser
  13241. 700.15 s [nothunks] Configuring nothunks-0.3.0.0...
  13242. 701.30 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  13243. 702.03 s [nothunks] Dependency base: using base-4.20.0.0
  13244. 702.03 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.1.0
  13245. 702.03 s [nothunks] Dependency containers: using containers-0.7
  13246. 702.03 s [nothunks] Dependency ghc-heap: using ghc-heap-9.10.1
  13247. 702.03 s [nothunks] Dependency stm: using stm-2.5.3.1
  13248. 702.03 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.1
  13249. 702.03 s [nothunks] Dependency time: using time-1.12.2
  13250. 702.03 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  13251. 702.03 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.2: using wherefrom-compat-0.1.1.1
  13252. 702.03 s [nothunks] Dependency base: using base-4.20.0.0
  13253. 702.03 s [nothunks] Dependency containers: using containers-0.7
  13254. 702.03 s [nothunks] Dependency ghc-prim: using ghc-prim-0.11.0
  13255. 702.03 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  13256. 702.03 s [nothunks] Dependency nothunks: using nothunks-0.3.0.0
  13257. 702.03 s [nothunks] Dependency random: using random-1.2.1.3
  13258. 702.03 s [nothunks] Dependency stm: using stm-2.5.3.1
  13259. 702.03 s [nothunks] Dependency tasty: using tasty-1.5.3
  13260. 702.03 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  13261. 702.03 s [nothunks] Source component graph:
  13262. 702.03 s [nothunks] component lib
  13263. 702.03 s [nothunks] component test:nothunks-test dependency lib
  13264. 702.03 s [nothunks] Configured component graph:
  13265. 702.03 s [nothunks] component nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13266. 702.03 s [nothunks] include base-4.20.0.0-d8e2
  13267. 702.03 s [nothunks] include bytestring-0.12.1.0-05ed
  13268. 702.03 s [nothunks] include containers-0.7-4cd1
  13269. 702.03 s [nothunks] include ghc-heap-9.10.1-5e8c
  13270. 702.03 s [nothunks] include stm-2.5.3.1-a30b
  13271. 702.03 s [nothunks] include text-2.1.1-f47e
  13272. 702.03 s [nothunks] include time-1.12.2-a16e
  13273. 702.03 s [nothunks] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  13274. 702.03 s [nothunks] include wherefrom-compat-0.1.1.1-61CCd77cRNaHmAqS6SQy7E
  13275. 702.03 s [nothunks] component nothunks-0.3.0.0-9t2136mcgHLHhe8CEqUNDO-nothunks-test
  13276. 702.03 s [nothunks] include base-4.20.0.0-d8e2
  13277. 702.03 s [nothunks] include containers-0.7-4cd1
  13278. 702.03 s [nothunks] include ghc-prim-0.11.0-46d5
  13279. 702.03 s [nothunks] include hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  13280. 702.03 s [nothunks] include nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13281. 702.03 s [nothunks] include random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  13282. 702.03 s [nothunks] include stm-2.5.3.1-a30b
  13283. 702.03 s [nothunks] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  13284. 702.03 s [nothunks] include tasty-hedgehog-1.4.0.2-9cULFT4laRxCV2oIR1pDOu
  13285. 702.03 s [nothunks] Linked component graph:
  13286. 702.03 s [nothunks] unit nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13287. 702.03 s [nothunks] include base-4.20.0.0-d8e2
  13288. 702.03 s [nothunks] include bytestring-0.12.1.0-05ed
  13289. 702.03 s [nothunks] include containers-0.7-4cd1
  13290. 702.03 s [nothunks] include ghc-heap-9.10.1-5e8c
  13291. 702.03 s [nothunks] include stm-2.5.3.1-a30b
  13292. 702.03 s [nothunks] include text-2.1.1-f47e
  13293. 702.03 s [nothunks] include time-1.12.2-a16e
  13294. 702.03 s [nothunks] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  13295. 702.03 s [nothunks] include wherefrom-compat-0.1.1.1-61CCd77cRNaHmAqS6SQy7E
  13296. 702.03 s [nothunks] NoThunks.Class=nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d:NoThunks.Class
  13297. 702.03 s [nothunks] unit nothunks-0.3.0.0-9t2136mcgHLHhe8CEqUNDO-nothunks-test
  13298. 702.03 s [nothunks] include base-4.20.0.0-d8e2
  13299. 702.03 s [nothunks] include containers-0.7-4cd1
  13300. 702.03 s [nothunks] include ghc-prim-0.11.0-46d5
  13301. 702.03 s [nothunks] include hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  13302. 702.03 s [nothunks] include nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13303. 702.03 s [nothunks] include random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  13304. 702.03 s [nothunks] include stm-2.5.3.1-a30b
  13305. 702.03 s [nothunks] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  13306. 702.03 s [nothunks] include tasty-hedgehog-1.4.0.2-9cULFT4laRxCV2oIR1pDOu
  13307. 702.03 s [nothunks] Ready component graph:
  13308. 702.03 s [nothunks] definite nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13309. 702.03 s [nothunks] depends base-4.20.0.0-d8e2
  13310. 702.03 s [nothunks] depends bytestring-0.12.1.0-05ed
  13311. 702.03 s [nothunks] depends containers-0.7-4cd1
  13312. 702.03 s [nothunks] depends ghc-heap-9.10.1-5e8c
  13313. 702.03 s [nothunks] depends stm-2.5.3.1-a30b
  13314. 702.03 s [nothunks] depends text-2.1.1-f47e
  13315. 702.03 s [nothunks] depends time-1.12.2-a16e
  13316. 702.03 s [nothunks] depends vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  13317. 702.03 s [nothunks] depends wherefrom-compat-0.1.1.1-61CCd77cRNaHmAqS6SQy7E
  13318. 702.03 s [nothunks] definite nothunks-0.3.0.0-9t2136mcgHLHhe8CEqUNDO-nothunks-test
  13319. 702.03 s [nothunks] depends base-4.20.0.0-d8e2
  13320. 702.03 s [nothunks] depends containers-0.7-4cd1
  13321. 702.03 s [nothunks] depends ghc-prim-0.11.0-46d5
  13322. 702.03 s [nothunks] depends hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  13323. 702.03 s [nothunks] depends nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13324. 702.03 s [nothunks] depends random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  13325. 702.03 s [nothunks] depends stm-2.5.3.1-a30b
  13326. 702.03 s [nothunks] depends tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  13327. 702.03 s [nothunks] depends tasty-hedgehog-1.4.0.2-9cULFT4laRxCV2oIR1pDOu
  13328. 702.03 s [nothunks] Using Cabal-3.12.0.0 compiled by ghc-9.10
  13329. 702.03 s [nothunks] Using compiler: ghc-9.10.1
  13330. 702.03 s [nothunks] Using install prefix:
  13331. 702.03 s [nothunks] /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0
  13332. 702.03 s [nothunks] Executables installed in:
  13333. 702.03 s [nothunks] /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0/bin
  13334. 702.03 s [nothunks] Libraries installed in:
  13335. 702.03 s [nothunks] /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13336. 702.03 s [nothunks] Dynamic Libraries installed in:
  13337. 702.03 s [nothunks] /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5
  13338. 702.03 s [nothunks] Private executables installed in:
  13339. 702.04 s [nothunks] /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0/libexec/x86_64-linux-ghc-9.10.1-c9f5/nothunks-0.3.0.0
  13340. 702.04 s [nothunks] Data files installed in:
  13341. 702.04 s [nothunks] /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0/share/x86_64-linux-ghc-9.10.1-c9f5/nothunks-0.3.0.0
  13342. 702.04 s [nothunks] Documentation installed in:
  13343. 702.04 s [nothunks] /nix/store/ss6m511v9hw3shij71jmqmkv3wna4a7i-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0
  13344. 702.04 s [nothunks] Configuration files installed in:
  13345. 702.04 s [nothunks] /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0/etc
  13346. 702.04 s [nothunks] No alex found
  13347. 702.04 s [nothunks] Using ar found on system at:
  13348. 702.04 s [nothunks] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  13349. 702.04 s [nothunks] No c2hs found
  13350. 702.04 s [nothunks] No cpphs found
  13351. 702.04 s [nothunks] No doctest found
  13352. 702.04 s [nothunks] Using gcc version 14.3.0 given by user at:
  13353. 702.04 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  13354. 702.04 s [nothunks] Using ghc version 9.10.1 found on system at:
  13355. 702.04 s [nothunks] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc
  13356. 702.04 s [nothunks] Using ghc-pkg version 9.10.1 found on system at:
  13357. 702.04 s [nothunks] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc-pkg-9.10.1
  13358. 702.04 s [nothunks] No ghcjs found
  13359. 702.04 s [nothunks] No ghcjs-pkg found
  13360. 702.04 s [nothunks] No greencard found
  13361. 702.04 s [nothunks] Using haddock version 2.28.0 found on system at:
  13362. 702.04 s [nothunks] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/haddock-ghc-9.10.1
  13363. 702.04 s [nothunks] No happy found
  13364. 702.04 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  13365. 702.04 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  13366. 702.04 s [nothunks] No hmake found
  13367. 702.04 s [nothunks] Using hpc version 0.69 found on system at:
  13368. 702.04 s [nothunks] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hpc-ghc-9.10.1
  13369. 702.04 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  13370. 702.04 s [nothunks] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hsc2hs-ghc-9.10.1
  13371. 702.04 s [nothunks] Using hscolour version 1.25 found on system at:
  13372. 702.04 s [nothunks] /nix/store/c0gbcvjjvqzy92m9ycv6zcqiczs6bvyw-hscolour-1.25/bin/HsColour
  13373. 702.04 s [nothunks] No jhc found
  13374. 702.04 s [nothunks] Using ld found on system at:
  13375. 702.04 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  13376. 702.04 s [nothunks] No pkg-config found
  13377. 702.04 s [nothunks] Using runghc version 9.10.1 found on system at:
  13378. 702.04 s [nothunks] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/runghc-9.10.1
  13379. 702.04 s [nothunks] Using strip version 2.44 found on system at:
  13380. 702.04 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  13381. 702.04 s [nothunks] Using tar found on system at:
  13382. 702.04 s [nothunks] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  13383. 702.04 s [nothunks] No uhc found
  13384. 702.47 s [nothunks] Phase: buildPhase
  13385. 702.70 s [nothunks] Preprocessing library for nothunks-0.3.0.0...
  13386. 702.70 s [nothunks] Building library for nothunks-0.3.0.0...
  13387. 702.98 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  13388. 708.96 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  13389. 716.21 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0...
  13390. 716.21 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.0.0...
  13391. 716.48 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 )
  13392. 721.18 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  13393. 721.96 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  13394. 723.77 s [nothunks] Phase: checkPhase
  13395. 724.29 s [nothunks] Running 1 test suites...
  13396. 724.29 s [nothunks] Test suite nothunks-test: RUNNING...
  13397. 724.30 s [nothunks] Tests
  13398. 724.30 s [nothunks] NoThunks.Class
  13399. 724.30 s [nothunks] Sanity
  13400. 724.30 s [nothunks] IntNotNF: OK
  13401. 724.30 s [nothunks] ✓ <interactive> passed 1 test.
  13402. 724.30 s [nothunks] IntIsNF: OK
  13403. 724.30 s [nothunks] ✓ <interactive> passed 1 test.
  13404. 724.30 s [nothunks] Pair: OK
  13405. 724.30 s [nothunks] ✓ <interactive> passed 1 test.
  13406. 724.30 s [nothunks] Sum: OK
  13407. 724.30 s [nothunks] ✓ <interactive> passed 1 test.
  13408. 724.30 s [nothunks] Fn: OK
  13409. 724.30 s [nothunks] ✓ <interactive> passed 1 test.
  13410. 724.30 s [nothunks] IO: OK
  13411. 724.30 s [nothunks] ✓ <interactive> passed 1 test.
  13412. 724.30 s [nothunks] InspectHeap
  13413. 724.32 s [nothunks] Int: OK (0.02s)
  13414. 724.32 s [nothunks] ✓ <interactive> passed 1000 tests.
  13415. 724.32 s [nothunks] Just ["Int"] 49% █████████▋··········
  13416. 724.32 s [nothunks] Nothing 51% ██████████▎·········
  13417. 724.34 s [nothunks] IntInt: OK (0.02s)
  13418. 724.34 s [nothunks] ✓ <interactive> passed 1000 tests.
  13419. 724.34 s [nothunks] Just ["Int","Tuple2"] 38% ███████▌············
  13420. 724.34 s [nothunks] Just ["Tuple2"] 49% █████████▊··········
  13421. 724.34 s [nothunks] Nothing 13% ██▌·················
  13422. 724.36 s [nothunks] SumInt: OK (0.02s)
  13423. 724.36 s [nothunks] ✓ <interactive> passed 1000 tests.
  13424. 724.36 s [nothunks] Just ["Either"] 33% ██████▌·············
  13425. 724.36 s [nothunks] Just ["Int","Either"] 33% ██████▌·············
  13426. 724.36 s [nothunks] Nothing 35% ██████▉·············
  13427. 724.38 s [nothunks] ListInt: OK (0.02s)
  13428. 724.38 s [nothunks] ✓ <interactive> passed 1000 tests.
  13429. 724.38 s [nothunks] Just ["Int","List"] 22% ████▎···············
  13430. 724.38 s [nothunks] Just ["List"] 43% ████████▌···········
  13431. 724.38 s [nothunks] Nothing 35% ███████·············
  13432. 724.41 s [nothunks] IntListInt: OK (0.03s)
  13433. 724.41 s [nothunks] ✓ <interactive> passed 1000 tests.
  13434. 724.41 s [nothunks] Just ["Int","List","Tuple2"] 5% █···················
  13435. 724.41 s [nothunks] Just ["Int","Tuple2"] 22% ████▍···············
  13436. 724.41 s [nothunks] Just ["List","Tuple2"] 12% ██▎·················
  13437. 724.41 s [nothunks] Just ["Tuple2"] 54% ██████████▋·········
  13438. 724.41 s [nothunks] Nothing 8% █▌··················
  13439. 724.45 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  13440. 724.46 s [nothunks] after 11 tests and 1 shrink.
  13441. 724.46 s [nothunks] shrink path: 11:c
  13442. 724.46 s [nothunks] Just ["Int","Seq"] 27% █████▍··············
  13443. 724.46 s [nothunks] Nothing 64% ████████████▋·······
  13444. 724.46 s [nothunks]
  13445. 724.46 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  13446. 724.46 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  13447. 724.46 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  13448. 724.46 s [nothunks] 168 ┃ -> Proxy a
  13449. 724.46 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  13450. 724.46 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  13451. 724.46 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  13452. 724.46 s [nothunks] 172 ┃ -> Property
  13453. 724.46 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  13454. 724.46 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  13455. 724.46 s [nothunks] ┃ │ Wrap
  13456. 724.46 s [nothunks] ┃ │ { unwrap =
  13457. 724.46 s [nothunks] ┃ │ SeqEnqueue
  13458. 724.46 s [nothunks] ┃ │ (IntValue 0)
  13459. 724.46 s [nothunks] ┃ │ (SeqEnqueue
  13460. 724.46 s [nothunks] ┃ │ (IntValue 0)
  13461. 724.46 s [nothunks] ┃ │ (SeqEnqueue
  13462. 724.46 s [nothunks] ┃ │ (IntValue 0)
  13463. 724.46 s [nothunks] ┃ │ (SeqEnqueue
  13464. 724.46 s [nothunks] ┃ │ (IntValue 0)
  13465. 724.46 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  13466. 724.46 s [nothunks] ┃ │ }
  13467. 724.46 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  13468. 724.46 s [nothunks] 176 ┃ fromModel m $ \a -> do
  13469. 724.46 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  13470. 724.46 s [nothunks] ┃ │ IsNF
  13471. 724.46 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  13472. 724.46 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  13473. 724.46 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13474. 724.46 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  13475. 724.46 s [nothunks] ┃ │ - Just
  13476. 724.46 s [nothunks] ┃ │ - ThunkInfo
  13477. 724.46 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  13478. 724.46 s [nothunks] ┃ │ + Nothing
  13479. 724.46 s [nothunks]
  13480. 724.46 s [nothunks] This failure can be reproduced by running:
  13481. 724.46 s [nothunks] > recheckAt (Seed 6001412704049772980 13607600489333394103) "11:c" EXPECTED FAILURE
  13482. 724.46 s [nothunks]
  13483. 724.46 s [nothunks] OK (0.04s)
  13484. 724.46 s [nothunks] ✓ <interactive> passed 1 test.
  13485. 724.46 s [nothunks] Model
  13486. 724.48 s [nothunks] Int: OK (0.02s)
  13487. 724.48 s [nothunks] ✓ <interactive> passed 1000 tests.
  13488. 724.48 s [nothunks] Just ["Int"] 50% █████████▉··········
  13489. 724.48 s [nothunks] Nothing 50% ██████████··········
  13490. 724.49 s [nothunks] IntInt: OK (0.02s)
  13491. 724.49 s [nothunks] ✓ <interactive> passed 1000 tests.
  13492. 724.50 s [nothunks] Just ["Int","Tuple2"] 39% ███████▊············
  13493. 724.50 s [nothunks] Just ["Tuple2"] 48% █████████▋··········
  13494. 724.50 s [nothunks] Nothing 13% ██▌·················
  13495. 724.51 s [nothunks] SumInt: OK
  13496. 724.51 s [nothunks] ✓ <interactive> passed 1000 tests.
  13497. 724.52 s [nothunks] Just ["Either"] 32% ██████▍·············
  13498. 724.52 s [nothunks] Just ["Int","Either"] 33% ██████▋·············
  13499. 724.52 s [nothunks] Nothing 34% ██████▊·············
  13500. 724.54 s [nothunks] ListInt: OK (0.02s)
  13501. 724.54 s [nothunks] ✓ <interactive> passed 1000 tests.
  13502. 724.54 s [nothunks] Just ["Int","List"] 23% ████▌···············
  13503. 724.54 s [nothunks] Just ["List"] 46% █████████···········
  13504. 724.54 s [nothunks] Nothing 32% ██████▎·············
  13505. 724.58 s [nothunks] IntListInt: OK (0.03s)
  13506. 724.58 s [nothunks] ✓ <interactive> passed 1000 tests.
  13507. 724.58 s [nothunks] Just ["Int","List","Tuple2"] 5% ▉···················
  13508. 724.58 s [nothunks] Just ["Int","Tuple2"] 22% ████▎···············
  13509. 724.58 s [nothunks] Just ["List","Tuple2"] 11% ██▏·················
  13510. 724.58 s [nothunks] Just ["Tuple2"] 54% ██████████▋·········
  13511. 724.58 s [nothunks] Nothing 9% █▊··················
  13512. 724.66 s [nothunks] SeqInt: OK (0.08s)
  13513. 724.66 s [nothunks] ✓ <interactive> passed 1000 tests.
  13514. 724.66 s [nothunks] Just ["Int","Seq"] 44% ████████▊···········
  13515. 724.66 s [nothunks] Nothing 56% ███████████▏········
  13516. 724.68 s [nothunks] AllowThunksIn: OK (0.03s)
  13517. 724.68 s [nothunks] ✓ <interactive> passed 1000 tests.
  13518. 724.68 s [nothunks] Just ["Int","field2","Record"] 24% ████▉···············
  13519. 724.68 s [nothunks] Just ["Record"] 50% █████████▉··········
  13520. 724.68 s [nothunks] Nothing 26% █████▏··············
  13521. 724.70 s [nothunks] Fn: OK (0.01s)
  13522. 724.70 s [nothunks] ✓ <interactive> passed 1000 tests.
  13523. 724.70 s [nothunks] Just ["->"] 24% ████▋···············
  13524. 724.70 s [nothunks] Nothing 76% ███████████████▎····
  13525. 724.72 s [nothunks] IO: OK (0.01s)
  13526. 724.72 s [nothunks] ✓ <interactive> passed 1000 tests.
  13527. 724.72 s [nothunks] Just ["IO"] 25% ████▉···············
  13528. 724.72 s [nothunks] Nothing 75% ███████████████·····
  13529. 724.72 s [nothunks] ThunkFreeFn: OK (0.01s)
  13530. 724.72 s [nothunks] ✓ <interactive> passed 1000 tests.
  13531. 724.72 s [nothunks] Just ["->"] 26% █████▏··············
  13532. 724.72 s [nothunks] Just ["...","->"] 36% ███████▏············
  13533. 724.72 s [nothunks] Nothing 38% ███████▌············
  13534. 724.73 s [nothunks] ThunkFreeIO: OK (0.02s)
  13535. 724.73 s [nothunks] ✓ <interactive> passed 1000 tests.
  13536. 724.74 s [nothunks] Just ["...","IO"] 37% ███████▍············
  13537. 724.74 s [nothunks] Just ["IO"] 27% █████▍··············
  13538. 724.74 s [nothunks] Nothing 36% ███████▏············
  13539. 724.74 s [nothunks] MutableVars
  13540. 724.74 s [nothunks] IORef
  13541. 724.74 s [nothunks] NotNF: OK
  13542. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13543. 724.74 s [nothunks] NF: OK
  13544. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13545. 724.74 s [nothunks] NotNFPure: OK
  13546. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13547. 724.74 s [nothunks] NFPure: OK
  13548. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13549. 724.74 s [nothunks] NotNFAtomically: OK
  13550. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13551. 724.74 s [nothunks] NFAtomically: OK
  13552. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13553. 724.74 s [nothunks] MVar
  13554. 724.74 s [nothunks] NotNF: OK
  13555. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13556. 724.74 s [nothunks] NF: OK
  13557. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13558. 724.74 s [nothunks] NotNFPure: OK
  13559. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13560. 724.74 s [nothunks] NFPure: OK
  13561. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13562. 724.74 s [nothunks] NotNFAtomically: OK
  13563. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13564. 724.74 s [nothunks] NFAtomically: OK
  13565. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13566. 724.74 s [nothunks] TVar
  13567. 724.74 s [nothunks] NotNF: OK
  13568. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13569. 724.74 s [nothunks] NF: OK
  13570. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13571. 724.74 s [nothunks] NotNFPure: OK
  13572. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13573. 724.74 s [nothunks] NFPure: OK
  13574. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13575. 724.74 s [nothunks] NotNFAtomically: OK
  13576. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13577. 724.74 s [nothunks] NFAtomically: OK
  13578. 724.74 s [nothunks] ✓ <interactive> passed 1 test.
  13579. 724.74 s [nothunks]
  13580. 724.74 s [nothunks] All 41 tests passed (0.44s)
  13581. 724.74 s [nothunks] Test suite nothunks-test: PASS
  13582. 724.74 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.0.0-nothunks-test.log
  13583. 724.74 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  13584. 724.75 s [nothunks] Phase: haddockPhase
  13585. 725.07 s [nothunks] Preprocessing library for nothunks-0.3.0.0...
  13586. 725.07 s [nothunks] Running Haddock on library for nothunks-0.3.0.0...
  13587. 725.07 s [nothunks] Warning: The documentation for the following packages are not installed. No
  13588. 725.07 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  13589. 725.57 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  13590. 727.23 s [nothunks] Haddock coverage:
  13591. 727.23 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  13592. 727.26 s [nothunks] * at src/NoThunks/Class.hs:334:48
  13593. 727.26 s [nothunks] * at src/NoThunks/Class.hs:334:1
  13594. 727.26 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13595. 727.26 s [nothunks] by specifying the type/value namespace explicitly.
  13596. 727.26 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  13597. 727.26 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  13598. 727.26 s [nothunks] * at src/NoThunks/Class.hs:353:25
  13599. 727.26 s [nothunks] * at src/NoThunks/Class.hs:353:1
  13600. 727.26 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13601. 727.26 s [nothunks] by specifying the type/value namespace explicitly.
  13602. 727.26 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  13603. 727.26 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  13604. 727.26 s [nothunks] * at src/NoThunks/Class.hs:358:47
  13605. 727.26 s [nothunks] * at src/NoThunks/Class.hs:358:1
  13606. 727.26 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13607. 727.26 s [nothunks] by specifying the type/value namespace explicitly.
  13608. 727.26 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  13609. 727.26 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  13610. 727.26 s [nothunks] * at src/NoThunks/Class.hs:308:27
  13611. 727.26 s [nothunks] * at src/NoThunks/Class.hs:308:1
  13612. 727.26 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13613. 727.26 s [nothunks] by specifying the type/value namespace explicitly.
  13614. 727.26 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  13615. 727.26 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  13616. 727.26 s [nothunks] * at src/NoThunks/Class.hs:230:18
  13617. 727.26 s [nothunks] * at src/NoThunks/Class.hs:230:1
  13618. 727.26 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13619. 727.26 s [nothunks] by specifying the type/value namespace explicitly.
  13620. 727.26 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  13621. 727.26 s [nothunks] Warning: 'GHC' is out of scope.
  13622. 727.26 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  13623. 727.26 s [nothunks] Warning: 'a' is out of scope.
  13624. 727.26 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  13625. 727.26 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  13626. 727.26 s [nothunks] Missing documentation for:
  13627. 727.26 s [nothunks] Module header
  13628. 728.21 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  13629. 728.21 s [nothunks] - Data.Vector.Vector
  13630. 728.21 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  13631. 728.21 s [nothunks] - NoThunks.Class.HasFields
  13632. 728.21 s [nothunks] - NoThunks.Class.Elem
  13633. 728.21 s [nothunks] - NoThunks.Class.GShowTypeOf
  13634. 728.21 s [nothunks] - NoThunks.Class.GWRecordField
  13635. 728.21 s [nothunks] - NoThunks.Class.checkContainsThunks
  13636. 735.75 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  13637. 735.76 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  13638. 735.86 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0...
  13639. 735.87 s [nothunks] Phase: installPhase
  13640. 736.08 s [nothunks] Installing library in /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13641. 736.47 s [nothunks] Phase: fixupPhase
  13642. 736.50 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0
  13643. 736.50 s [nothunks] shrinking /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSnothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d-ghc9.10.1.so
  13644. 736.51 s [nothunks] checking for references to /build/ in /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0...
  13645. 736.52 s [nothunks] patching script interpreter paths in /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0
  13646. 736.53 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0/lib
  13647. 736.62 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/ss6m511v9hw3shij71jmqmkv3wna4a7i-nothunks-0.3.0.0-doc
  13648. 736.63 s [nothunks] checking for references to /build/ in /nix/store/ss6m511v9hw3shij71jmqmkv3wna4a7i-nothunks-0.3.0.0-doc...
  13649. 736.64 s [nothunks] patching script interpreter paths in /nix/store/ss6m511v9hw3shij71jmqmkv3wna4a7i-nothunks-0.3.0.0-doc
  13650. 736.82 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0 /nix/store/ss6m511v9hw3shij71jmqmkv3wna4a7i-nothunks-0.3.0.0-doc
  13651. 737.55 s [nothunks:post-build] Pushing 2 paths (96 are already present) using zstd to cache sellout ⏳
  13652. 737.55 s [nothunks:post-build]
  13653. 737.90 s [nothunks:post-build] Pushing /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0 (2.88 MiB)
  13654. 738.03 s [nothunks:post-build] Pushing /nix/store/ss6m511v9hw3shij71jmqmkv3wna4a7i-nothunks-0.3.0.0-doc (838.37 KiB)
  13655. 739.05 s [nothunks:post-build]
  13656. 739.05 s [nothunks:post-build] All done.
  13657. 739.10 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0 /nix/store/ss6m511v9hw3shij71jmqmkv3wna4a7i-nothunks-0.3.0.0-doc
  13658. 739.22 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13659. 739.41 s [nothunks:post-build] copying 2 paths...
  13660. 739.41 s [nothunks:post-build] copying path '/nix/store/ss6m511v9hw3shij71jmqmkv3wna4a7i-nothunks-0.3.0.0-doc' to 'https://cache.nix-ci.com'...
  13661. 739.80 s [nothunks:post-build] copying path '/nix/store/b6p9wn6z6mzmrgh8nqz6wggvjfrvdqah-nothunks-0.3.0.0' to 'https://cache.nix-ci.com'...
  13662. 741.23 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13663. 741.55 s [nothunks:post-build] copying 3 paths...
  13664. 741.55 s [nothunks:post-build] copying path '/nix/store/p9jajs4wa0c4x28r362my1ggdiix87rx-tasty-hedgehog-1.4.0.2.drv' to 'https://cache.nix-ci.com'...
  13665. 741.55 s [nothunks:post-build] copying path '/nix/store/zylaz33qkhmz9pi6mfz2czq35xwx0v6x-wherefrom-compat-0.1.1.1.drv' to 'https://cache.nix-ci.com'...
  13666. 741.73 s [nothunks:post-build] copying path '/nix/store/9jx63sm45m4n77jl36vn2h1wsq9fmw90-nothunks-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
  13667. 741.95 s Progress: 6 of 15 built, 155 of 155 downloaded from cache
  13668. 742.05 s Building /nix/store/263dcr8r6inph4x2vcp2zs5mm0p3mp8b-unordered-containers-0.2.20.drv
  13669. 742.27 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  13670. 742.28 s [unordered-containers] Build with /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1.
  13671. 742.74 s [unordered-containers] Phase: unpackPhase
  13672. 742.74 s [unordered-containers] unpacking source archive /nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz
  13673. 742.76 s [unordered-containers] source root is unordered-containers-0.2.20
  13674. 742.78 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20/unordered-containers.cabal"
  13675. 742.79 s [unordered-containers] Phase: patchPhase
  13676. 742.79 s [unordered-containers] Replace Cabal file with edited version from mirror://hackage/unordered-containers-0.2.20/revision/4.cabal.
  13677. 742.80 s [unordered-containers] Phase: compileBuildDriverPhase
  13678. 742.81 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.kkwdm6UTe1/setup-package.conf.d -threaded
  13679. 742.94 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.kkwdm6UTe1/Main.o )
  13680. 743.08 s [unordered-containers] [2 of 2] Linking Setup
  13681. 745.84 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  13682. 745.87 s [unordered-containers] Phase: configurePhase
  13683. 745.88 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ikm9q3ix8yghkm2f3qbhiw66n8apcrnl-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20 --with-gcc=gcc --package-db=/build/tmp.kkwdm6UTe1/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  13684. 745.89 s [unordered-containers] Using Parsec parser
  13685. 745.89 s [unordered-containers] Configuring unordered-containers-0.2.20...
  13686. 746.53 s [unordered-containers] Flags chosen: debug=False
  13687. 747.01 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.20.0.0
  13688. 747.01 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.0.0
  13689. 747.01 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
  13690. 747.01 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.22.0.0
  13691. 747.01 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.15
  13692. 747.01 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  13693. 747.01 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.14.3
  13694. 747.01 s [unordered-containers] Dependency base: using base-4.20.0.0
  13695. 747.01 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  13696. 747.01 s [unordered-containers] Dependency hashable: using hashable-1.4.7.0
  13697. 747.01 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.0.0
  13698. 747.01 s [unordered-containers] Dependency random: using random-1.2.1.3
  13699. 747.01 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  13700. 747.01 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  13701. 747.01 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11
  13702. 747.01 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20
  13703. 747.01 s [unordered-containers] Source component graph:
  13704. 747.01 s [unordered-containers] component lib
  13705. 747.01 s [unordered-containers] component test:unordered-containers-tests dependency lib
  13706. 747.01 s [unordered-containers] Configured component graph:
  13707. 747.01 s [unordered-containers] component unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  13708. 747.01 s [unordered-containers] include base-4.20.0.0-d8e2
  13709. 747.01 s [unordered-containers] include deepseq-1.5.0.0-e78d
  13710. 747.01 s [unordered-containers] include hashable-1.4.7.0-GEjBqeVTk9fFXLWZuCuCl0
  13711. 747.01 s [unordered-containers] include template-haskell-2.22.0.0-5f29
  13712. 747.01 s [unordered-containers] component unordered-containers-0.2.20-I75iIa2M1ecLo41jK5W48B-unordered-containers-tests
  13713. 747.01 s [unordered-containers] include ChasingBottoms-1.3.1.15-AwmlwFsZvMBHxdjA0Eqxqw
  13714. 747.01 s [unordered-containers] include HUnit-1.6.2.0-580GnyyT1I67k8FYP5IjnF
  13715. 747.01 s [unordered-containers] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  13716. 747.01 s [unordered-containers] include base-4.20.0.0-d8e2
  13717. 747.01 s [unordered-containers] include containers-0.7-4cd1
  13718. 747.01 s [unordered-containers] include hashable-1.4.7.0-GEjBqeVTk9fFXLWZuCuCl0
  13719. 747.02 s [unordered-containers] include nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13720. 747.02 s [unordered-containers] include random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  13721. 747.02 s [unordered-containers] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  13722. 747.02 s [unordered-containers] include tasty-hunit-0.10.2-KYicHyB7xyiGpoiECfGyrz
  13723. 747.02 s [unordered-containers] include tasty-quickcheck-0.11-IoWMNeRe4fVBeUSir8EfUO
  13724. 747.02 s [unordered-containers] include unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  13725. 747.02 s [unordered-containers] Linked component graph:
  13726. 747.02 s [unordered-containers] unit unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  13727. 747.02 s [unordered-containers] include base-4.20.0.0-d8e2
  13728. 747.02 s [unordered-containers] include deepseq-1.5.0.0-e78d
  13729. 747.02 s [unordered-containers] include hashable-1.4.7.0-GEjBqeVTk9fFXLWZuCuCl0
  13730. 747.02 s [unordered-containers] include template-haskell-2.22.0.0-5f29
  13731. 747.02 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde:Data.HashSet.Internal
  13732. 747.02 s [unordered-containers] unit unordered-containers-0.2.20-I75iIa2M1ecLo41jK5W48B-unordered-containers-tests
  13733. 747.02 s [unordered-containers] include ChasingBottoms-1.3.1.15-AwmlwFsZvMBHxdjA0Eqxqw
  13734. 747.02 s [unordered-containers] include HUnit-1.6.2.0-580GnyyT1I67k8FYP5IjnF
  13735. 747.02 s [unordered-containers] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  13736. 747.02 s [unordered-containers] include base-4.20.0.0-d8e2
  13737. 747.02 s [unordered-containers] include containers-0.7-4cd1
  13738. 747.02 s [unordered-containers] include hashable-1.4.7.0-GEjBqeVTk9fFXLWZuCuCl0
  13739. 747.02 s [unordered-containers] include nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13740. 747.02 s [unordered-containers] include random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  13741. 747.02 s [unordered-containers] include tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  13742. 747.02 s [unordered-containers] include tasty-hunit-0.10.2-KYicHyB7xyiGpoiECfGyrz
  13743. 747.02 s [unordered-containers] include tasty-quickcheck-0.11-IoWMNeRe4fVBeUSir8EfUO
  13744. 747.02 s [unordered-containers] include unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  13745. 747.02 s [unordered-containers] Ready component graph:
  13746. 747.02 s [unordered-containers] definite unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  13747. 747.02 s [unordered-containers] depends base-4.20.0.0-d8e2
  13748. 747.02 s [unordered-containers] depends deepseq-1.5.0.0-e78d
  13749. 747.02 s [unordered-containers] depends hashable-1.4.7.0-GEjBqeVTk9fFXLWZuCuCl0
  13750. 747.02 s [unordered-containers] depends template-haskell-2.22.0.0-5f29
  13751. 747.02 s [unordered-containers] definite unordered-containers-0.2.20-I75iIa2M1ecLo41jK5W48B-unordered-containers-tests
  13752. 747.02 s [unordered-containers] depends ChasingBottoms-1.3.1.15-AwmlwFsZvMBHxdjA0Eqxqw
  13753. 747.02 s [unordered-containers] depends HUnit-1.6.2.0-580GnyyT1I67k8FYP5IjnF
  13754. 747.02 s [unordered-containers] depends QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  13755. 747.02 s [unordered-containers] depends base-4.20.0.0-d8e2
  13756. 747.02 s [unordered-containers] depends containers-0.7-4cd1
  13757. 747.02 s [unordered-containers] depends hashable-1.4.7.0-GEjBqeVTk9fFXLWZuCuCl0
  13758. 747.02 s [unordered-containers] depends nothunks-0.3.0.0-BHzNRcgBo0qC9WBPT5GG4d
  13759. 747.02 s [unordered-containers] depends random-1.2.1.3-A4Mewjwckzn4QTKAjeloG
  13760. 747.02 s [unordered-containers] depends tasty-1.5.3-EOtPaTS4RPm68xkjlbwFz4
  13761. 747.02 s [unordered-containers] depends tasty-hunit-0.10.2-KYicHyB7xyiGpoiECfGyrz
  13762. 747.02 s [unordered-containers] depends tasty-quickcheck-0.11-IoWMNeRe4fVBeUSir8EfUO
  13763. 747.02 s [unordered-containers] depends unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  13764. 747.02 s [unordered-containers] Using Cabal-3.12.0.0 compiled by ghc-9.10
  13765. 747.02 s [unordered-containers] Using compiler: ghc-9.10.1
  13766. 747.02 s [unordered-containers] Using install prefix:
  13767. 747.02 s [unordered-containers] /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20
  13768. 747.02 s [unordered-containers] Executables installed in:
  13769. 747.02 s [unordered-containers] /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20/bin
  13770. 747.02 s [unordered-containers] Libraries installed in:
  13771. 747.02 s [unordered-containers] /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  13772. 747.02 s [unordered-containers] Dynamic Libraries installed in:
  13773. 747.02 s [unordered-containers] /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5
  13774. 747.02 s [unordered-containers] Private executables installed in:
  13775. 747.02 s [unordered-containers] /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20/libexec/x86_64-linux-ghc-9.10.1-c9f5/unordered-containers-0.2.20
  13776. 747.02 s [unordered-containers] Data files installed in:
  13777. 747.02 s [unordered-containers] /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20/share/x86_64-linux-ghc-9.10.1-c9f5/unordered-containers-0.2.20
  13778. 747.02 s [unordered-containers] Documentation installed in:
  13779. 747.02 s [unordered-containers] /nix/store/ikm9q3ix8yghkm2f3qbhiw66n8apcrnl-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20
  13780. 747.02 s [unordered-containers] Configuration files installed in:
  13781. 747.02 s [unordered-containers] /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20/etc
  13782. 747.02 s [unordered-containers] No alex found
  13783. 747.02 s [unordered-containers] Using ar found on system at:
  13784. 747.02 s [unordered-containers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  13785. 747.02 s [unordered-containers] No c2hs found
  13786. 747.02 s [unordered-containers] No cpphs found
  13787. 747.02 s [unordered-containers] No doctest found
  13788. 747.02 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  13789. 747.02 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  13790. 747.02 s [unordered-containers] Using ghc version 9.10.1 found on system at:
  13791. 747.02 s [unordered-containers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc
  13792. 747.02 s [unordered-containers] Using ghc-pkg version 9.10.1 found on system at:
  13793. 747.02 s [unordered-containers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc-pkg-9.10.1
  13794. 747.02 s [unordered-containers] No ghcjs found
  13795. 747.02 s [unordered-containers] No ghcjs-pkg found
  13796. 747.02 s [unordered-containers] No greencard found
  13797. 747.02 s [unordered-containers] Using haddock version 2.28.0 found on system at:
  13798. 747.02 s [unordered-containers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/haddock-ghc-9.10.1
  13799. 747.02 s [unordered-containers] No happy found
  13800. 747.02 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  13801. 747.02 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  13802. 747.02 s [unordered-containers] No hmake found
  13803. 747.02 s [unordered-containers] Using hpc version 0.69 found on system at:
  13804. 747.02 s [unordered-containers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hpc-ghc-9.10.1
  13805. 747.02 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  13806. 747.02 s [unordered-containers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hsc2hs-ghc-9.10.1
  13807. 747.02 s [unordered-containers] Using hscolour version 1.25 found on system at:
  13808. 747.02 s [unordered-containers] /nix/store/c0gbcvjjvqzy92m9ycv6zcqiczs6bvyw-hscolour-1.25/bin/HsColour
  13809. 747.02 s [unordered-containers] No jhc found
  13810. 747.02 s [unordered-containers] Using ld found on system at:
  13811. 747.02 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  13812. 747.02 s [unordered-containers] No pkg-config found
  13813. 747.02 s [unordered-containers] Using runghc version 9.10.1 found on system at:
  13814. 747.02 s [unordered-containers] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/runghc-9.10.1
  13815. 747.02 s [unordered-containers] Using strip version 2.44 found on system at:
  13816. 747.02 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  13817. 747.02 s [unordered-containers] Using tar found on system at:
  13818. 747.02 s [unordered-containers] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  13819. 747.02 s [unordered-containers] No uhc found
  13820. 747.28 s [unordered-containers] Phase: buildPhase
  13821. 747.40 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20...
  13822. 747.40 s [unordered-containers] Building library for unordered-containers-0.2.20...
  13823. 747.56 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  13824. 747.56 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  13825. 747.56 s [unordered-containers] |
  13826. 747.56 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  13827. 747.56 s [unordered-containers] | ^^^^^^^^^^
  13828. 747.56 s [unordered-containers]
  13829. 747.92 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 )
  13830. 748.25 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  13831. 748.25 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  13832. 748.25 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  13833. 748.25 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  13834. 748.25 s [unordered-containers] |
  13835. 748.25 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  13836. 748.25 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13837. 748.25 s [unordered-containers]
  13838. 749.21 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 )
  13839. 749.22 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 )
  13840. 760.65 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 )
  13841. 761.21 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 )
  13842. 764.48 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 )
  13843. 764.48 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  13844. 764.48 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 )
  13845. 764.52 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 )
  13846. 765.01 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  13847. 765.01 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  13848. 765.01 s [unordered-containers] |
  13849. 765.01 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  13850. 765.01 s [unordered-containers] | ^^^^^^^^^^
  13851. 765.01 s [unordered-containers]
  13852. 765.53 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  13853. 765.99 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  13854. 766.01 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  13855. 766.01 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  13856. 766.01 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  13857. 766.01 s [unordered-containers] |
  13858. 766.01 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  13859. 766.01 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13860. 766.01 s [unordered-containers]
  13861. 767.40 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  13862. 767.41 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  13863. 786.16 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  13864. 788.26 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  13865. 794.11 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  13866. 794.11 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  13867. 794.13 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  13868. 794.39 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  13869. 797.02 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20...
  13870. 797.03 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20...
  13871. 797.47 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 )
  13872. 798.78 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  13873. 798.78 s [unordered-containers] tests/Regressions.hs:91:16: warning: [GHC-63394] [-Wx-partial]
  13874. 798.78 s [unordered-containers] In the use of ‘head’
  13875. 798.78 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  13876. 798.78 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"."
  13877. 798.78 s [unordered-containers] |
  13878. 798.78 s [unordered-containers] 91 | k = head keys
  13879. 798.78 s [unordered-containers] | ^^^^
  13880. 798.78 s [unordered-containers]
  13881. 808.37 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 )
  13882. 808.38 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  13883. 808.38 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  13884. 808.38 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  13885. 808.38 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  13886. 808.38 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  13887. 808.38 s [unordered-containers] |
  13888. 808.39 s [unordered-containers] 7 | import Data.Foldable (foldl')
  13889. 808.39 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13890. 808.39 s [unordered-containers]
  13891. 808.39 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 )
  13892. 808.66 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 )
  13893. 825.76 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 )
  13894. 825.77 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  13895. 825.80 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  13896. 826.95 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  13897. 829.23 s [unordered-containers] buildPhase completed in 1 minutes 22 seconds
  13898. 829.23 s [unordered-containers] Phase: checkPhase
  13899. 830.31 s [unordered-containers] Running 1 test suites...
  13900. 830.31 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  13901. 830.40 s [unordered-containers] All
  13902. 830.48 s [unordered-containers] Properties
  13903. 830.56 s [unordered-containers] Data.HashMap.Lazy
  13904. 830.57 s [unordered-containers] instances
  13905. 830.57 s [unordered-containers] Eq
  13906. 830.57 s [unordered-containers] ==: OK (0.06s)
  13907. 830.57 s [unordered-containers] +++ OK, passed 100 tests.
  13908. 830.57 s [unordered-containers] /=: OK (0.07s)
  13909. 830.57 s [unordered-containers] +++ OK, passed 100 tests.
  13910. 830.57 s [unordered-containers] Ord
  13911. 830.57 s [unordered-containers] compare reflexive: OK (0.09s)
  13912. 830.57 s [unordered-containers] +++ OK, passed 100 tests.
  13913. 830.57 s [unordered-containers] compare transitive: OK (0.19s)
  13914. 830.57 s [unordered-containers] +++ OK, passed 100 tests.
  13915. 830.57 s [unordered-containers] compare antisymmetric: OK (0.12s)
  13916. 830.57 s [unordered-containers] +++ OK, passed 100 tests.
  13917. 830.57 s [unordered-containers] Ord => Eq: OK (0.08s)
  13918. 830.57 s [unordered-containers] +++ OK, passed 100 tests.
  13919. 831.99 s [unordered-containers] Read/Show: OK (1.58s)
  13920. 831.99 s [unordered-containers] +++ OK, passed 100 tests.
  13921. 832.02 s [unordered-containers] Functor: OK (0.29s)
  13922. 832.02 s [unordered-containers] +++ OK, passed 100 tests.
  13923. 832.02 s [unordered-containers] Foldable: OK (0.20s)
  13924. 832.02 s [unordered-containers] +++ OK, passed 100 tests.
  13925. 832.02 s [unordered-containers] Bifoldable
  13926. 832.02 s [unordered-containers] bifoldMap: OK (0.05s)
  13927. 832.02 s [unordered-containers] +++ OK, passed 100 tests.
  13928. 832.02 s [unordered-containers] bifoldr: OK (0.11s)
  13929. 832.02 s [unordered-containers] +++ OK, passed 100 tests.
  13930. 832.02 s [unordered-containers] bifoldl: OK (0.04s)
  13931. 832.02 s [unordered-containers] +++ OK, passed 100 tests.
  13932. 832.02 s [unordered-containers] Hashable: OK (0.15s)
  13933. 832.02 s [unordered-containers] +++ OK, passed 100 tests.
  13934. 832.02 s [unordered-containers] empty
  13935. 832.03 s [unordered-containers] valid: OK
  13936. 832.03 s [unordered-containers] +++ OK, passed 1 test.
  13937. 832.03 s [unordered-containers] singleton
  13938. 832.03 s [unordered-containers] valid: OK
  13939. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13940. 832.03 s [unordered-containers] size: OK (0.04s)
  13941. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13942. 832.03 s [unordered-containers] member: OK (0.05s)
  13943. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13944. 832.03 s [unordered-containers] lookup: OK (0.05s)
  13945. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13946. 832.03 s [unordered-containers] !?: OK (0.07s)
  13947. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13948. 832.03 s [unordered-containers] insert
  13949. 832.03 s [unordered-containers] model: OK (0.14s)
  13950. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13951. 832.03 s [unordered-containers] valid: OK (0.12s)
  13952. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13953. 832.03 s [unordered-containers] insertWith
  13954. 832.03 s [unordered-containers] insertWith: OK (0.03s)
  13955. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13956. 832.03 s [unordered-containers] valid: OK (0.02s)
  13957. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13958. 832.03 s [unordered-containers] delete
  13959. 832.03 s [unordered-containers] model: OK (0.08s)
  13960. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13961. 832.03 s [unordered-containers] valid: OK (0.02s)
  13962. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13963. 832.03 s [unordered-containers] adjust
  13964. 832.03 s [unordered-containers] model: OK (0.09s)
  13965. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13966. 832.03 s [unordered-containers] valid: OK (0.14s)
  13967. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13968. 832.03 s [unordered-containers] update
  13969. 832.03 s [unordered-containers] model: OK (0.16s)
  13970. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13971. 832.03 s [unordered-containers] valid: OK (0.05s)
  13972. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13973. 832.03 s [unordered-containers] alter
  13974. 832.03 s [unordered-containers] model: OK (0.03s)
  13975. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13976. 832.03 s [unordered-containers] valid: OK (0.10s)
  13977. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13978. 832.03 s [unordered-containers] alterF
  13979. 832.03 s [unordered-containers] model
  13980. 832.03 s [unordered-containers] []: OK (0.77s)
  13981. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13982. 832.03 s [unordered-containers] adjust: OK (0.05s)
  13983. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13984. 832.03 s [unordered-containers] insert: OK (0.08s)
  13985. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13986. 832.03 s [unordered-containers] insertWith: OK (0.04s)
  13987. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13988. 832.03 s [unordered-containers] delete: OK (0.10s)
  13989. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13990. 832.03 s [unordered-containers] lookup: OK (0.05s)
  13991. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13992. 832.03 s [unordered-containers] valid: OK (0.13s)
  13993. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13994. 832.03 s [unordered-containers] isSubmapOf
  13995. 832.03 s [unordered-containers] model: OK (0.08s)
  13996. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13997. 832.03 s [unordered-containers] m ⊆ m: OK (0.03s)
  13998. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  13999. 832.03 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.25s)
  14000. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  14001. 832.03 s [unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.07s)
  14002. 832.03 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  14003. 832.03 s [unordered-containers] m1\m2 ⊆ m1: OK (0.19s)
  14004. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  14005. 832.03 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.09s)
  14006. 832.03 s [unordered-containers] +++ OK, passed 100 tests; 147 discarded.
  14007. 832.03 s [unordered-containers] delete k m ⊆ m: OK (0.04s)
  14008. 832.03 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  14009. 832.03 s [unordered-containers] m ⊈ delete k m : OK (0.18s)
  14010. 832.03 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  14011. 832.03 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.08s)
  14012. 832.03 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  14013. 832.03 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.08s)
  14014. 832.03 s [unordered-containers] +++ OK, passed 100 tests; 11 discarded.
  14015. 832.03 s [unordered-containers] union
  14016. 832.03 s [unordered-containers] model: OK (0.17s)
  14017. 832.03 s [unordered-containers] +++ OK, passed 100 tests.
  14018. 832.03 s [unordered-containers] valid: OK (0.04s)
  14019. 832.04 s [unordered-containers] +++ OK, passed 100 tests.
  14020. 832.04 s [unordered-containers] unionWith
  14021. 832.04 s [unordered-containers] model: OK (0.36s)
  14022. 832.04 s [unordered-containers] +++ OK, passed 100 tests.
  14023. 832.04 s [unordered-containers] valid: OK (0.27s)
  14024. 832.04 s [unordered-containers] +++ OK, passed 100 tests.
  14025. 832.04 s [unordered-containers] unionWithKey
  14026. 832.04 s [unordered-containers] model: OK (0.43s)
  14027. 832.04 s [unordered-containers] +++ OK, passed 100 tests.
  14028. 832.04 s [unordered-containers] valid: OK (0.10s)
  14029. 832.04 s [unordered-containers] +++ OK, passed 100 tests.
  14030. 832.04 s [unordered-containers] unions
  14031. 838.12 s [unordered-containers] model: OK (7.47s)
  14032. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14033. 838.14 s [unordered-containers] valid: OK (2.79s)
  14034. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14035. 838.14 s [unordered-containers] difference
  14036. 838.14 s [unordered-containers] model: OK (0.28s)
  14037. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14038. 838.14 s [unordered-containers] valid: OK (0.03s)
  14039. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14040. 838.14 s [unordered-containers] differenceWith
  14041. 838.14 s [unordered-containers] model: OK (0.16s)
  14042. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14043. 838.14 s [unordered-containers] valid: OK (0.05s)
  14044. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14045. 838.14 s [unordered-containers] intersection
  14046. 838.14 s [unordered-containers] model: OK (0.07s)
  14047. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14048. 838.14 s [unordered-containers] valid: OK (0.08s)
  14049. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14050. 838.14 s [unordered-containers] intersectionWith
  14051. 838.14 s [unordered-containers] model: OK (0.27s)
  14052. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14053. 838.14 s [unordered-containers] valid: OK (0.17s)
  14054. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14055. 838.14 s [unordered-containers] intersectionWithKey
  14056. 838.14 s [unordered-containers] model: OK (0.51s)
  14057. 838.14 s [unordered-containers] +++ OK, passed 100 tests.
  14058. 838.14 s [unordered-containers] valid: OK (0.08s)
  14059. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14060. 838.15 s [unordered-containers] compose
  14061. 838.15 s [unordered-containers] valid: OK (0.06s)
  14062. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14063. 838.15 s [unordered-containers] map
  14064. 838.15 s [unordered-containers] model: OK (0.47s)
  14065. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14066. 838.15 s [unordered-containers] valid: OK (0.08s)
  14067. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14068. 838.15 s [unordered-containers] traverseWithKey
  14069. 838.15 s [unordered-containers] model: OK (1.51s)
  14070. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14071. 838.15 s [unordered-containers] valid: OK (0.10s)
  14072. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14073. 838.15 s [unordered-containers] mapKeys
  14074. 838.15 s [unordered-containers] model: OK (0.11s)
  14075. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14076. 838.15 s [unordered-containers] valid: OK (2.75s)
  14077. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14078. 838.15 s [unordered-containers] foldr: OK (0.10s)
  14079. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14080. 838.15 s [unordered-containers] foldl: OK (0.13s)
  14081. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14082. 838.15 s [unordered-containers] foldrWithKey: OK (0.05s)
  14083. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14084. 838.15 s [unordered-containers] foldlWithKey: OK (0.08s)
  14085. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14086. 838.15 s [unordered-containers] foldrWithKey': OK (0.08s)
  14087. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14088. 838.15 s [unordered-containers] foldlWithKey': OK (0.09s)
  14089. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14090. 838.15 s [unordered-containers] foldl': OK (0.18s)
  14091. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14092. 838.15 s [unordered-containers] foldr': OK (0.08s)
  14093. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14094. 838.15 s [unordered-containers] foldMapWithKey: OK (0.15s)
  14095. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14096. 838.15 s [unordered-containers] filter
  14097. 838.15 s [unordered-containers] model: OK (0.62s)
  14098. 838.15 s [unordered-containers] +++ OK, passed 100 tests.
  14099. 838.16 s [unordered-containers] valid: OK (0.49s)
  14100. 838.16 s [unordered-containers] +++ OK, passed 100 tests.
  14101. 838.16 s [unordered-containers] filterWithKey
  14102. 840.34 s [unordered-containers] model: OK (9.30s)
  14103. 840.34 s [unordered-containers] +++ OK, passed 100 tests.
  14104. 840.34 s [unordered-containers] valid: OK (4.40s)
  14105. 840.34 s [unordered-containers] +++ OK, passed 100 tests.
  14106. 840.34 s [unordered-containers] mapMaybe
  14107. 840.34 s [unordered-containers] model: OK (0.58s)
  14108. 840.34 s [unordered-containers] +++ OK, passed 100 tests.
  14109. 840.34 s [unordered-containers] valid: OK (0.12s)
  14110. 840.34 s [unordered-containers] +++ OK, passed 100 tests.
  14111. 840.34 s [unordered-containers] mapMaybeWithKey
  14112. 840.80 s [unordered-containers] model: OK (9.65s)
  14113. 840.80 s [unordered-containers] +++ OK, passed 100 tests.
  14114. 840.80 s [unordered-containers] valid: OK (5.95s)
  14115. 840.81 s [unordered-containers] +++ OK, passed 100 tests.
  14116. 840.82 s [unordered-containers] elems: OK (0.07s)
  14117. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14118. 840.82 s [unordered-containers] keys: OK (0.09s)
  14119. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14120. 840.82 s [unordered-containers] fromList
  14121. 840.82 s [unordered-containers] model: OK (0.08s)
  14122. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14123. 840.82 s [unordered-containers] valid: OK (0.05s)
  14124. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14125. 840.82 s [unordered-containers] fromListWith
  14126. 840.82 s [unordered-containers] model: OK (0.13s)
  14127. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14128. 840.82 s [unordered-containers] valid: OK (0.13s)
  14129. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14130. 840.82 s [unordered-containers] fromListWithKey
  14131. 840.82 s [unordered-containers] model: OK (0.25s)
  14132. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14133. 840.82 s [unordered-containers] valid: OK (0.13s)
  14134. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14135. 840.82 s [unordered-containers] toList: OK (0.06s)
  14136. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14137. 840.82 s [unordered-containers] Data.HashMap.Strict
  14138. 840.82 s [unordered-containers] instances
  14139. 840.82 s [unordered-containers] Eq
  14140. 840.82 s [unordered-containers] ==: OK (0.21s)
  14141. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14142. 840.82 s [unordered-containers] /=: OK (0.23s)
  14143. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14144. 840.82 s [unordered-containers] Ord
  14145. 840.82 s [unordered-containers] compare reflexive: OK (0.04s)
  14146. 840.82 s [unordered-containers] +++ OK, passed 100 tests.
  14147. 840.84 s [unordered-containers] compare transitive: OK (0.20s)
  14148. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14149. 840.84 s [unordered-containers] compare antisymmetric: OK (0.08s)
  14150. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14151. 840.84 s [unordered-containers] Ord => Eq: OK (0.10s)
  14152. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14153. 840.84 s [unordered-containers] Read/Show: OK (1.53s)
  14154. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14155. 840.84 s [unordered-containers] Functor: OK (0.56s)
  14156. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14157. 840.84 s [unordered-containers] Foldable: OK (0.12s)
  14158. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14159. 840.84 s [unordered-containers] Bifoldable
  14160. 840.84 s [unordered-containers] bifoldMap: OK (0.07s)
  14161. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14162. 840.84 s [unordered-containers] bifoldr: OK (0.07s)
  14163. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14164. 840.84 s [unordered-containers] bifoldl: OK (0.10s)
  14165. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14166. 840.84 s [unordered-containers] Hashable: OK (0.15s)
  14167. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14168. 840.84 s [unordered-containers] empty
  14169. 840.84 s [unordered-containers] valid: OK (0.03s)
  14170. 840.84 s [unordered-containers] +++ OK, passed 1 test.
  14171. 840.84 s [unordered-containers] singleton
  14172. 840.84 s [unordered-containers] valid: OK
  14173. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14174. 840.84 s [unordered-containers] size: OK (0.03s)
  14175. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14176. 840.84 s [unordered-containers] member: OK (0.22s)
  14177. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14178. 840.84 s [unordered-containers] lookup: OK (0.32s)
  14179. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14180. 840.84 s [unordered-containers] !?: OK (0.08s)
  14181. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14182. 840.84 s [unordered-containers] insert
  14183. 840.84 s [unordered-containers] model: OK (0.10s)
  14184. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14185. 840.84 s [unordered-containers] valid: OK (0.09s)
  14186. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14187. 840.84 s [unordered-containers] insertWith
  14188. 840.84 s [unordered-containers] insertWith: OK (0.10s)
  14189. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14190. 840.84 s [unordered-containers] valid: OK (0.08s)
  14191. 840.84 s [unordered-containers] +++ OK, passed 100 tests.
  14192. 840.85 s [unordered-containers] delete
  14193. 840.85 s [unordered-containers] model: OK (0.06s)
  14194. 840.85 s [unordered-containers] +++ OK, passed 100 tests.
  14195. 840.85 s [unordered-containers] valid: OK (0.06s)
  14196. 840.85 s [unordered-containers] +++ OK, passed 100 tests.
  14197. 840.85 s [unordered-containers] adjust
  14198. 840.85 s [unordered-containers] model: OK (0.17s)
  14199. 840.85 s [unordered-containers] +++ OK, passed 100 tests.
  14200. 840.85 s [unordered-containers] valid: OK (0.10s)
  14201. 840.85 s [unordered-containers] +++ OK, passed 100 tests.
  14202. 840.85 s [unordered-containers] update
  14203. 840.85 s [unordered-containers] model: OK (0.08s)
  14204. 840.85 s [unordered-containers] +++ OK, passed 100 tests.
  14205. 840.86 s [unordered-containers] valid: OK (0.05s)
  14206. 840.86 s [unordered-containers] +++ OK, passed 100 tests.
  14207. 840.86 s [unordered-containers] alter
  14208. 840.87 s [unordered-containers] model: OK (0.17s)
  14209. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14210. 840.87 s [unordered-containers] valid: OK (0.27s)
  14211. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14212. 840.87 s [unordered-containers] alterF
  14213. 840.87 s [unordered-containers] model
  14214. 840.87 s [unordered-containers] []: OK (1.04s)
  14215. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14216. 840.87 s [unordered-containers] adjust: OK (0.19s)
  14217. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14218. 840.87 s [unordered-containers] insert: OK (0.27s)
  14219. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14220. 840.87 s [unordered-containers] insertWith: OK (0.15s)
  14221. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14222. 840.87 s [unordered-containers] delete: OK (0.05s)
  14223. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14224. 840.87 s [unordered-containers] lookup: OK (0.12s)
  14225. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14226. 840.87 s [unordered-containers] valid: OK (0.17s)
  14227. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14228. 840.87 s [unordered-containers] isSubmapOf
  14229. 840.87 s [unordered-containers] model: OK (0.30s)
  14230. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14231. 840.87 s [unordered-containers] m ⊆ m: OK (0.07s)
  14232. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14233. 840.87 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.15s)
  14234. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14235. 840.87 s [unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.14s)
  14236. 840.87 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  14237. 840.87 s [unordered-containers] m1\m2 ⊆ m1: OK (0.27s)
  14238. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14239. 840.87 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.19s)
  14240. 840.87 s [unordered-containers] +++ OK, passed 100 tests; 182 discarded.
  14241. 840.87 s [unordered-containers] delete k m ⊆ m: OK (0.10s)
  14242. 840.87 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  14243. 840.87 s [unordered-containers] m ⊈ delete k m : OK (0.04s)
  14244. 840.87 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  14245. 840.87 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.09s)
  14246. 840.87 s [unordered-containers] +++ OK, passed 100 tests; 8 discarded.
  14247. 840.87 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.15s)
  14248. 840.87 s [unordered-containers] +++ OK, passed 100 tests; 8 discarded.
  14249. 840.87 s [unordered-containers] union
  14250. 840.87 s [unordered-containers] model: OK (0.16s)
  14251. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14252. 840.87 s [unordered-containers] valid: OK (0.13s)
  14253. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14254. 840.87 s [unordered-containers] unionWith
  14255. 840.87 s [unordered-containers] model: OK (0.61s)
  14256. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14257. 840.87 s [unordered-containers] valid: OK (0.40s)
  14258. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14259. 840.87 s [unordered-containers] unionWithKey
  14260. 840.87 s [unordered-containers] model: OK (0.32s)
  14261. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14262. 840.87 s [unordered-containers] valid: OK (0.46s)
  14263. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14264. 840.87 s [unordered-containers] unions
  14265. 840.87 s [unordered-containers] model: OK (6.56s)
  14266. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14267. 840.87 s [unordered-containers] valid: OK (3.76s)
  14268. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14269. 840.87 s [unordered-containers] difference
  14270. 840.87 s [unordered-containers] model: OK (0.19s)
  14271. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14272. 840.87 s [unordered-containers] valid: OK (0.19s)
  14273. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14274. 840.87 s [unordered-containers] differenceWith
  14275. 840.87 s [unordered-containers] model: OK (0.34s)
  14276. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14277. 840.87 s [unordered-containers] valid: OK (0.31s)
  14278. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14279. 840.87 s [unordered-containers] intersection
  14280. 840.87 s [unordered-containers] model: OK (0.26s)
  14281. 840.87 s [unordered-containers] +++ OK, passed 100 tests.
  14282. 840.88 s [unordered-containers] valid: OK (0.25s)
  14283. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14284. 840.88 s [unordered-containers] intersectionWith
  14285. 840.88 s [unordered-containers] model: OK (0.22s)
  14286. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14287. 840.88 s [unordered-containers] valid: OK (0.21s)
  14288. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14289. 840.88 s [unordered-containers] intersectionWithKey
  14290. 840.88 s [unordered-containers] model: OK (0.68s)
  14291. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14292. 840.88 s [unordered-containers] valid: OK (0.17s)
  14293. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14294. 840.88 s [unordered-containers] compose
  14295. 840.88 s [unordered-containers] valid: OK (0.13s)
  14296. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14297. 840.88 s [unordered-containers] map
  14298. 840.88 s [unordered-containers] model: OK (0.54s)
  14299. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14300. 840.88 s [unordered-containers] valid: OK (0.30s)
  14301. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14302. 840.88 s [unordered-containers] traverseWithKey
  14303. 840.88 s [unordered-containers] model: OK (0.88s)
  14304. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14305. 840.88 s [unordered-containers] valid: OK (0.11s)
  14306. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14307. 840.88 s [unordered-containers] mapKeys
  14308. 840.88 s [unordered-containers] model: OK (0.11s)
  14309. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14310. 840.88 s [unordered-containers] valid: OK (4.68s)
  14311. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14312. 840.88 s [unordered-containers] foldr: OK (0.12s)
  14313. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14314. 840.88 s [unordered-containers] foldl: OK (0.14s)
  14315. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14316. 840.88 s [unordered-containers] foldrWithKey: OK (0.10s)
  14317. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14318. 840.88 s [unordered-containers] foldlWithKey: OK (0.09s)
  14319. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14320. 840.88 s [unordered-containers] foldrWithKey': OK (0.14s)
  14321. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14322. 840.88 s [unordered-containers] foldlWithKey': OK (0.14s)
  14323. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14324. 840.88 s [unordered-containers] foldl': OK (0.08s)
  14325. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14326. 840.88 s [unordered-containers] foldr': OK (0.06s)
  14327. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14328. 840.88 s [unordered-containers] foldMapWithKey: OK (0.19s)
  14329. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14330. 840.88 s [unordered-containers] filter
  14331. 840.88 s [unordered-containers] model: OK (0.53s)
  14332. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14333. 840.88 s [unordered-containers] valid: OK (0.29s)
  14334. 840.88 s [unordered-containers] +++ OK, passed 100 tests.
  14335. 840.88 s [unordered-containers] filterWithKey
  14336. 841.63 s [unordered-containers] model: OK (7.90s)
  14337. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14338. 841.63 s [unordered-containers] valid: OK (6.27s)
  14339. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14340. 841.63 s [unordered-containers] mapMaybe
  14341. 841.63 s [unordered-containers] model: OK (0.63s)
  14342. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14343. 841.63 s [unordered-containers] valid: OK (0.48s)
  14344. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14345. 841.63 s [unordered-containers] mapMaybeWithKey
  14346. 841.63 s [unordered-containers] model: OK (7.74s)
  14347. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14348. 841.63 s [unordered-containers] valid: OK (6.15s)
  14349. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14350. 841.63 s [unordered-containers] elems: OK (0.14s)
  14351. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14352. 841.63 s [unordered-containers] keys: OK (0.16s)
  14353. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14354. 841.63 s [unordered-containers] fromList
  14355. 841.63 s [unordered-containers] model: OK (0.13s)
  14356. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14357. 841.63 s [unordered-containers] valid: OK (0.10s)
  14358. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14359. 841.63 s [unordered-containers] fromListWith
  14360. 841.63 s [unordered-containers] model: OK (0.07s)
  14361. 841.63 s [unordered-containers] +++ OK, passed 100 tests.
  14362. 841.63 s [unordered-containers] valid: OK (0.21s)
  14363. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14364. 841.64 s [unordered-containers] fromListWithKey
  14365. 841.64 s [unordered-containers] model: OK (0.26s)
  14366. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14367. 841.64 s [unordered-containers] valid: OK (0.20s)
  14368. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14369. 841.64 s [unordered-containers] toList: OK (0.16s)
  14370. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14371. 841.64 s [unordered-containers] Data.HashSet
  14372. 841.64 s [unordered-containers] instances
  14373. 841.64 s [unordered-containers] Eq
  14374. 841.64 s [unordered-containers] ==: OK (0.11s)
  14375. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14376. 841.64 s [unordered-containers] == permutations: OK (0.18s)
  14377. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14378. 841.64 s [unordered-containers] /=: OK (0.12s)
  14379. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14380. 841.64 s [unordered-containers] Ord
  14381. 841.64 s [unordered-containers] compare reflexive: OK (0.09s)
  14382. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14383. 841.64 s [unordered-containers] compare transitive: OK (0.22s)
  14384. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14385. 841.64 s [unordered-containers] compare antisymmetric: OK (0.13s)
  14386. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14387. 841.64 s [unordered-containers] Ord => Eq: OK (0.22s)
  14388. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14389. 841.64 s [unordered-containers] Read/Show: OK (1.71s)
  14390. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14391. 841.64 s [unordered-containers] Foldable: OK (0.15s)
  14392. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14393. 841.64 s [unordered-containers] Hashable: OK (0.17s)
  14394. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14395. 841.64 s [unordered-containers] size: OK (0.07s)
  14396. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14397. 841.64 s [unordered-containers] member: OK (0.06s)
  14398. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14399. 841.64 s [unordered-containers] insert: OK (0.16s)
  14400. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14401. 841.64 s [unordered-containers] delete: OK (0.10s)
  14402. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14403. 841.64 s [unordered-containers] union: OK (0.24s)
  14404. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14405. 841.64 s [unordered-containers] map: OK (5.75s)
  14406. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14407. 841.64 s [unordered-containers] foldr: OK (0.10s)
  14408. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14409. 841.64 s [unordered-containers] foldl': OK (0.20s)
  14410. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14411. 841.64 s [unordered-containers] filter: OK (5.44s)
  14412. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14413. 841.64 s [unordered-containers] toList: OK (0.20s)
  14414. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14415. 841.64 s [unordered-containers] Data.HashMap.Internal.List
  14416. 841.64 s [unordered-containers] isPermutationBy: OK (0.08s)
  14417. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14418. 841.64 s [unordered-containers] isPermutationBy of different length: OK (0.03s)
  14419. 841.64 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  14420. 841.64 s [unordered-containers] pUnorderedCompare: OK (0.33s)
  14421. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14422. 841.64 s [unordered-containers] modelUnorderedCompare
  14423. 841.64 s [unordered-containers] reflexive: OK (0.03s)
  14424. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14425. 841.64 s [unordered-containers] anti-symmetric: OK (0.03s)
  14426. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14427. 841.64 s [unordered-containers] transitive: OK (0.22s)
  14428. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14429. 841.64 s [unordered-containers] Regression tests
  14430. 841.64 s [unordered-containers] issue32: OK
  14431. 841.64 s [unordered-containers] issue39a: OK
  14432. 841.64 s [unordered-containers] issue39b: OK (0.05s)
  14433. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14434. 841.64 s [unordered-containers] issue254 lazy: OK (0.03s)
  14435. 841.64 s [unordered-containers] issue254 strict: OK (0.10s)
  14436. 841.64 s [unordered-containers] issue379
  14437. 841.64 s [unordered-containers] Lazy.unionWith: OK (0.08s)
  14438. 841.64 s [unordered-containers] union: OK
  14439. 841.64 s [unordered-containers] Strict.unionWith: OK
  14440. 841.64 s [unordered-containers] Strict.unionWithKey: OK
  14441. 841.64 s [unordered-containers] issue381
  14442. 841.64 s [unordered-containers] mapMaybe: OK
  14443. 841.64 s [unordered-containers] mapMaybeWithKey: OK
  14444. 841.64 s [unordered-containers] issue382: OK (0.02s)
  14445. 841.64 s [unordered-containers] issue383: OK (0.04s)
  14446. 841.64 s [unordered-containers] issue420: OK
  14447. 841.64 s [unordered-containers] Strictness
  14448. 841.64 s [unordered-containers] HashMap.Strict
  14449. 841.64 s [unordered-containers] singleton is key-strict: OK (0.03s)
  14450. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14451. 841.64 s [unordered-containers] singleton is value-strict: OK
  14452. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14453. 841.64 s [unordered-containers] member is key-strict: OK
  14454. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14455. 841.64 s [unordered-containers] lookup is key-strict: OK
  14456. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14457. 841.64 s [unordered-containers] lookupDefault is key-strict: OK
  14458. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14459. 841.64 s [unordered-containers] findWithDefault is key-strict: OK (0.03s)
  14460. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14461. 841.64 s [unordered-containers] ! is key-strict: OK
  14462. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14463. 841.64 s [unordered-containers] delete is key-strict: OK
  14464. 841.64 s [unordered-containers] +++ OK, passed 100 tests.
  14465. 841.64 s [unordered-containers] adjust is key-strict: OK (0.02s)
  14466. 841.65 s [unordered-containers] +++ OK, passed 100 tests.
  14467. 841.65 s [unordered-containers] adjust is value-strict: OK (0.07s)
  14468. 841.65 s [unordered-containers] +++ OK, passed 100 tests.
  14469. 841.65 s [unordered-containers] insert is key-strict: OK (0.02s)
  14470. 841.65 s [unordered-containers] +++ OK, passed 100 tests.
  14471. 841.65 s [unordered-containers] insert is value-strict: OK
  14472. 841.65 s [unordered-containers] +++ OK, passed 100 tests.
  14473. 841.65 s [unordered-containers] insertWith is key-strict: OK (0.08s)
  14474. 841.65 s [unordered-containers] +++ OK, passed 100 tests.
  14475. 841.65 s [unordered-containers] insertWith is value-strict: OK (0.05s)
  14476. 841.65 s [unordered-containers] +++ OK, passed 100 tests.
  14477. 841.65 s [unordered-containers] fromList is key-strict: OK
  14478. 841.65 s [unordered-containers] +++ OK, passed 1 test.
  14479. 841.65 s [unordered-containers] fromList is value-strict: OK
  14480. 841.65 s [unordered-containers] +++ OK, passed 100 tests.
  14481. 841.65 s [unordered-containers] fromListWith is key-strict: OK
  14482. 841.65 s [unordered-containers] +++ OK, passed 100 tests.
  14483. 841.65 s [unordered-containers] fromListWith is value-strict: OK (0.10s)
  14484. 841.65 s [unordered-containers] +++ OK, passed 100 tests.
  14485. 841.65 s [unordered-containers]
  14486. 841.65 s [unordered-containers] All 256 tests passed (11.28s)
  14487. 841.68 s [unordered-containers] Test suite unordered-containers-tests: PASS
  14488. 841.68 s [unordered-containers] Test suite logged to:
  14489. 841.68 s [unordered-containers] dist/test/unordered-containers-0.2.20-unordered-containers-tests.log
  14490. 841.68 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  14491. 841.70 s [unordered-containers] Phase: haddockPhase
  14492. 842.11 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20...
  14493. 842.12 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20...
  14494. 842.64 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14495. 842.64 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14496. 842.64 s [unordered-containers] |
  14497. 842.64 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14498. 842.64 s [unordered-containers] | ^^^^^^^^^^
  14499. 842.64 s [unordered-containers]
  14500. 843.11 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  14501. 843.90 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14502. 843.95 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14503. 843.95 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14504. 843.95 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14505. 843.95 s [unordered-containers] |
  14506. 843.95 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14507. 843.95 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14508. 843.95 s [unordered-containers]
  14509. 843.95 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  14510. 843.97 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  14511. 846.50 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  14512. 846.62 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  14513. 847.28 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  14514. 847.52 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  14515. 847.53 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  14516. 847.54 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  14517. 847.55 s [unordered-containers] Haddock coverage:
  14518. 847.56 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  14519. 847.56 s [unordered-containers] Missing documentation for:
  14520. 847.56 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  14521. 847.56 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  14522. 847.56 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  14523. 847.56 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  14524. 847.56 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  14525. 847.56 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  14526. 847.56 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  14527. 847.56 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  14528. 847.56 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  14529. 847.56 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  14530. 847.56 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  14531. 847.56 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  14532. 847.56 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  14533. 847.56 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  14534. 847.56 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  14535. 847.56 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  14536. 847.56 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  14537. 847.56 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  14538. 847.56 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  14539. 847.56 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  14540. 847.56 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  14541. 847.56 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  14542. 847.56 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  14543. 847.56 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  14544. 847.56 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  14545. 847.56 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  14546. 847.56 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  14547. 847.56 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  14548. 847.56 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  14549. 847.56 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  14550. 847.56 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  14551. 847.56 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  14552. 847.56 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  14553. 847.56 s [unordered-containers] Missing documentation for:
  14554. 847.56 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  14555. 847.56 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  14556. 847.56 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  14557. 847.56 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  14558. 847.56 s [unordered-containers] * at Data/HashMap/Internal.hs:225:7
  14559. 847.56 s [unordered-containers] * at Data/HashMap/Internal.hs:185:1
  14560. 847.56 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14561. 847.56 s [unordered-containers] by specifying the type/value namespace explicitly.
  14562. 847.56 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:185:1
  14563. 847.57 s [unordered-containers] Warning: 'at' is out of scope.
  14564. 847.57 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14565. 847.61 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  14566. 847.61 s [unordered-containers] Missing documentation for:
  14567. 847.61 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:185)
  14568. 847.61 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1855)
  14569. 847.61 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2368)
  14570. 847.61 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:511)
  14571. 847.61 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:495)
  14572. 847.62 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:678)
  14573. 847.62 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:657)
  14574. 847.62 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:660)
  14575. 847.62 s [unordered-containers] insert' (Data/HashMap/Internal.hs:806)
  14576. 847.62 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1124)
  14577. 847.62 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:848)
  14578. 847.62 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:883)
  14579. 847.64 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  14580. 847.64 s [unordered-containers] Missing documentation for:
  14581. 847.64 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  14582. 847.64 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  14583. 847.64 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  14584. 847.65 s [unordered-containers] Warning: 'lookup' is out of scope.
  14585. 847.65 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14586. 847.66 s [unordered-containers] Warning: 'at' is out of scope.
  14587. 847.66 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14588. 847.67 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  14589. 847.68 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14590. 847.68 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14591. 847.68 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14592. 847.68 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14593. 847.68 s [unordered-containers] by specifying the type/value namespace explicitly.
  14594. 847.68 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14595. 847.69 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  14596. 847.69 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14597. 847.69 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14598. 847.69 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14599. 847.69 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14600. 847.69 s [unordered-containers] by specifying the type/value namespace explicitly.
  14601. 847.69 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14602. 847.69 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  14603. 847.70 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  14604. 847.70 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  14605. 848.39 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  14606. 848.39 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14607. 848.42 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  14608. 848.42 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14609. 848.42 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  14610. 848.42 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  14611. 848.43 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  14612. 848.43 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  14613. 848.45 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  14614. 848.45 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14615. 848.47 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  14616. 848.47 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14617. 863.62 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  14618. 863.63 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  14619. 863.74 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20...
  14620. 863.76 s [unordered-containers] Phase: installPhase
  14621. 863.95 s [unordered-containers] Installing library in /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  14622. 865.01 s [unordered-containers] Phase: fixupPhase
  14623. 865.13 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20
  14624. 865.14 s [unordered-containers] shrinking /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSunordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde-ghc9.10.1.so
  14625. 865.16 s [unordered-containers] checking for references to /build/ in /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20...
  14626. 865.21 s [unordered-containers] patching script interpreter paths in /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20
  14627. 865.22 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20/lib
  14628. 865.48 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/ikm9q3ix8yghkm2f3qbhiw66n8apcrnl-unordered-containers-0.2.20-doc
  14629. 865.49 s [unordered-containers] checking for references to /build/ in /nix/store/ikm9q3ix8yghkm2f3qbhiw66n8apcrnl-unordered-containers-0.2.20-doc...
  14630. 865.51 s [unordered-containers] patching script interpreter paths in /nix/store/ikm9q3ix8yghkm2f3qbhiw66n8apcrnl-unordered-containers-0.2.20-doc
  14631. 865.79 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20 /nix/store/ikm9q3ix8yghkm2f3qbhiw66n8apcrnl-unordered-containers-0.2.20-doc
  14632. 866.90 s [unordered-containers:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  14633. 866.90 s [unordered-containers:post-build]
  14634. 867.26 s [unordered-containers:post-build] Pushing /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20 (9.28 MiB)
  14635. 867.35 s [unordered-containers:post-build] Pushing /nix/store/ikm9q3ix8yghkm2f3qbhiw66n8apcrnl-unordered-containers-0.2.20-doc (4.46 MiB)
  14636. 868.53 s [unordered-containers:post-build]
  14637. 868.53 s [unordered-containers:post-build] All done.
  14638. 868.76 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20 /nix/store/ikm9q3ix8yghkm2f3qbhiw66n8apcrnl-unordered-containers-0.2.20-doc
  14639. 869.24 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14640. 869.76 s [unordered-containers:post-build] copying 2 paths...
  14641. 869.76 s [unordered-containers:post-build] copying path '/nix/store/ikm9q3ix8yghkm2f3qbhiw66n8apcrnl-unordered-containers-0.2.20-doc' to 'https://cache.nix-ci.com'...
  14642. 871.00 s [unordered-containers:post-build] copying path '/nix/store/33dgc2ad1y2ybkb571rskj0dvbyzzbzd-unordered-containers-0.2.20' to 'https://cache.nix-ci.com'...
  14643. 876.60 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14644. 876.99 s [unordered-containers:post-build] copying 2 paths...
  14645. 877.00 s [unordered-containers:post-build] copying path '/nix/store/ki41hjyx1883j0mf9nhhp5rwqlk0m8sl-ChasingBottoms-1.3.1.15.drv' to 'https://cache.nix-ci.com'...
  14646. 877.27 s [unordered-containers:post-build] copying path '/nix/store/263dcr8r6inph4x2vcp2zs5mm0p3mp8b-unordered-containers-0.2.20.drv' to 'https://cache.nix-ci.com'...
  14647. 877.80 s Progress: 7 of 15 built, 155 of 155 downloaded from cache
  14648. 878.02 s Building /nix/store/gq7y1gjayd3d5a95bdb5zznll55xy8d2-quickcheck-instances-0.3.32.drv
  14649. 878.38 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  14650. 878.40 s [quickcheck-instances] Build with /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1.
  14651. 879.23 s [quickcheck-instances] Phase: unpackPhase
  14652. 879.26 s [quickcheck-instances] unpacking source archive /nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz
  14653. 879.29 s [quickcheck-instances] source root is quickcheck-instances-0.3.32
  14654. 879.32 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.32/test/Tests.hs"
  14655. 879.34 s [quickcheck-instances] Phase: patchPhase
  14656. 879.39 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.32/revision/1.cabal.
  14657. 879.42 s [quickcheck-instances] Phase: compileBuildDriverPhase
  14658. 879.43 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.MXIaW0nfoo/setup-package.conf.d -threaded
  14659. 879.60 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.MXIaW0nfoo/Main.o )
  14660. 879.81 s [quickcheck-instances] [2 of 2] Linking Setup
  14661. 883.35 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  14662. 883.39 s [quickcheck-instances] Phase: configurePhase
  14663. 883.40 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/5l8narbfbxqzyk4a3m8jwzhiy51w5pkj-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32 --with-gcc=gcc --package-db=/build/tmp.MXIaW0nfoo/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  14664. 883.46 s [quickcheck-instances] Using Parsec parser
  14665. 883.46 s [quickcheck-instances] Configuring quickcheck-instances-0.3.32...
  14666. 885.93 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  14667. 885.93 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.15.1: using QuickCheck-2.14.3
  14668. 885.93 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.7.0
  14669. 885.93 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.20.0.0
  14670. 885.93 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.1.0
  14671. 885.93 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  14672. 885.93 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  14673. 885.93 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  14674. 885.93 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
  14675. 885.93 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  14676. 885.93 s [quickcheck-instances] integer-logarithms-1.0.4
  14677. 885.93 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  14678. 885.93 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  14679. 885.93 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  14680. 885.93 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.1
  14681. 885.93 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  14682. 885.93 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.8
  14683. 885.93 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.1
  14684. 885.93 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  14685. 885.93 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  14686. 885.93 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.7
  14687. 885.93 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.1
  14688. 885.93 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  14689. 885.93 s [quickcheck-instances] unordered-containers-0.2.20
  14690. 885.93 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  14691. 885.93 s [quickcheck-instances] Dependency vector >=0.13.1.0 && <0.14: using vector-0.13.2.0
  14692. 885.93 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.14.3
  14693. 885.93 s [quickcheck-instances] Dependency base: using base-4.20.0.0
  14694. 885.93 s [quickcheck-instances] Dependency containers: using containers-0.7
  14695. 885.93 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  14696. 885.93 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.32
  14697. 885.93 s [quickcheck-instances] Dependency tagged: using tagged-0.8.8
  14698. 885.93 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  14699. 885.93 s [quickcheck-instances] Source component graph:
  14700. 885.93 s [quickcheck-instances] component lib
  14701. 885.93 s [quickcheck-instances] component test:self-test dependency lib
  14702. 885.93 s [quickcheck-instances] Configured component graph:
  14703. 885.93 s [quickcheck-instances] component quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  14704. 885.93 s [quickcheck-instances] include OneTuple-0.4.2-1OHE9uagWT2T9r0wh1R02
  14705. 885.93 s [quickcheck-instances] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  14706. 885.93 s [quickcheck-instances] include array-0.5.7.0-78f3
  14707. 885.93 s [quickcheck-instances] include base-4.20.0.0-d8e2
  14708. 885.93 s [quickcheck-instances] include bytestring-0.12.1.0-05ed
  14709. 885.93 s [quickcheck-instances] include case-insensitive-1.2.1.0-2mCfuXNTdsVDc0R4HtawwI
  14710. 885.93 s [quickcheck-instances] include containers-0.7-4cd1
  14711. 885.93 s [quickcheck-instances] include data-fix-0.3.4-BJHrJYAHl41D7DCsbDnuKV
  14712. 885.93 s [quickcheck-instances] include hashable-1.4.7.0-GEjBqeVTk9fFXLWZuCuCl0
  14713. 885.93 s [quickcheck-instances] include integer-logarithms-1.0.4-IBRvjH3JNZKK0ceKQCpW8T
  14714. 885.93 s [quickcheck-instances] include old-time-1.1.0.4-30FrloRmNXc5w44EPMtl0F
  14715. 885.93 s [quickcheck-instances] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  14716. 885.93 s [quickcheck-instances] include scientific-0.3.8.0-Irep2pOchz8zdCmrLNpHs
  14717. 885.93 s [quickcheck-instances] include splitmix-0.1.1-2fAAhGIhTVcD98TpsAK1zl
  14718. 885.93 s [quickcheck-instances] include strict-0.5.1-70zSHaNjeEJA3jdFoBdw6W
  14719. 885.93 s [quickcheck-instances] include tagged-0.8.8-DoA327JvV6VCRPnc85T2NS
  14720. 885.93 s [quickcheck-instances] include text-2.1.1-f47e
  14721. 885.93 s [quickcheck-instances] include text-short-0.1.6-HGHc4h1G5Os4GcQg672yUb
  14722. 885.93 s [quickcheck-instances] include these-1.2.1-6FN8c3RTw6KhazplKvIFT
  14723. 885.93 s [quickcheck-instances] include time-compat-1.9.7-L0Wq2xyUoI6F8BkTZ5frph
  14724. 885.93 s [quickcheck-instances] include transformers-0.6.1.1-3641
  14725. 885.93 s [quickcheck-instances] include unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  14726. 885.93 s [quickcheck-instances] include uuid-types-1.0.6-DCo8FI24kSD2IlTV36QNNV
  14727. 885.93 s [quickcheck-instances] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  14728. 885.94 s [quickcheck-instances] component quickcheck-instances-0.3.32-E5FTMEUy3HWCu80IcYLg9I-self-test
  14729. 885.94 s [quickcheck-instances] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  14730. 885.94 s [quickcheck-instances] include base-4.20.0.0-d8e2
  14731. 885.94 s [quickcheck-instances] include containers-0.7-4cd1
  14732. 885.94 s [quickcheck-instances] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  14733. 885.94 s [quickcheck-instances] include quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  14734. 885.94 s [quickcheck-instances] include tagged-0.8.8-DoA327JvV6VCRPnc85T2NS
  14735. 885.94 s [quickcheck-instances] include uuid-types-1.0.6-DCo8FI24kSD2IlTV36QNNV
  14736. 885.94 s [quickcheck-instances] Linked component graph:
  14737. 885.94 s [quickcheck-instances] unit quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  14738. 885.94 s [quickcheck-instances] include OneTuple-0.4.2-1OHE9uagWT2T9r0wh1R02
  14739. 885.94 s [quickcheck-instances] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  14740. 885.94 s [quickcheck-instances] include array-0.5.7.0-78f3
  14741. 885.94 s [quickcheck-instances] include base-4.20.0.0-d8e2
  14742. 885.94 s [quickcheck-instances] include bytestring-0.12.1.0-05ed
  14743. 885.94 s [quickcheck-instances] include case-insensitive-1.2.1.0-2mCfuXNTdsVDc0R4HtawwI
  14744. 885.94 s [quickcheck-instances] include containers-0.7-4cd1
  14745. 885.94 s [quickcheck-instances] include data-fix-0.3.4-BJHrJYAHl41D7DCsbDnuKV
  14746. 885.94 s [quickcheck-instances] include hashable-1.4.7.0-GEjBqeVTk9fFXLWZuCuCl0
  14747. 885.94 s [quickcheck-instances] include integer-logarithms-1.0.4-IBRvjH3JNZKK0ceKQCpW8T
  14748. 885.94 s [quickcheck-instances] include old-time-1.1.0.4-30FrloRmNXc5w44EPMtl0F
  14749. 885.94 s [quickcheck-instances] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  14750. 885.94 s [quickcheck-instances] include scientific-0.3.8.0-Irep2pOchz8zdCmrLNpHs
  14751. 885.94 s [quickcheck-instances] include splitmix-0.1.1-2fAAhGIhTVcD98TpsAK1zl
  14752. 885.94 s [quickcheck-instances] include strict-0.5.1-70zSHaNjeEJA3jdFoBdw6W
  14753. 885.94 s [quickcheck-instances] include tagged-0.8.8-DoA327JvV6VCRPnc85T2NS
  14754. 885.94 s [quickcheck-instances] include text-2.1.1-f47e
  14755. 885.94 s [quickcheck-instances] include text-short-0.1.6-HGHc4h1G5Os4GcQg672yUb
  14756. 885.94 s [quickcheck-instances] include these-1.2.1-6FN8c3RTw6KhazplKvIFT
  14757. 885.94 s [quickcheck-instances] include time-compat-1.9.7-L0Wq2xyUoI6F8BkTZ5frph
  14758. 885.94 s [quickcheck-instances] include transformers-0.6.1.1-3641
  14759. 885.94 s [quickcheck-instances] include unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  14760. 885.94 s [quickcheck-instances] include uuid-types-1.0.6-DCo8FI24kSD2IlTV36QNNV
  14761. 885.94 s [quickcheck-instances] include vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  14762. 885.94 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32:Test.QuickCheck.Instances.Void
  14763. 885.94 s [quickcheck-instances] unit quickcheck-instances-0.3.32-E5FTMEUy3HWCu80IcYLg9I-self-test
  14764. 885.94 s [quickcheck-instances] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  14765. 885.94 s [quickcheck-instances] include base-4.20.0.0-d8e2
  14766. 886.01 s [quickcheck-instances] include containers-0.7-4cd1
  14767. 886.01 s [quickcheck-instances] include primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  14768. 886.01 s [quickcheck-instances] include quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  14769. 886.01 s [quickcheck-instances] include tagged-0.8.8-DoA327JvV6VCRPnc85T2NS
  14770. 886.01 s [quickcheck-instances] include uuid-types-1.0.6-DCo8FI24kSD2IlTV36QNNV
  14771. 886.01 s [quickcheck-instances] Ready component graph:
  14772. 886.01 s [quickcheck-instances] definite quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  14773. 886.01 s [quickcheck-instances] depends OneTuple-0.4.2-1OHE9uagWT2T9r0wh1R02
  14774. 886.01 s [quickcheck-instances] depends QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  14775. 886.01 s [quickcheck-instances] depends array-0.5.7.0-78f3
  14776. 886.01 s [quickcheck-instances] depends base-4.20.0.0-d8e2
  14777. 886.01 s [quickcheck-instances] depends bytestring-0.12.1.0-05ed
  14778. 886.01 s [quickcheck-instances] depends case-insensitive-1.2.1.0-2mCfuXNTdsVDc0R4HtawwI
  14779. 886.01 s [quickcheck-instances] depends containers-0.7-4cd1
  14780. 886.01 s [quickcheck-instances] depends data-fix-0.3.4-BJHrJYAHl41D7DCsbDnuKV
  14781. 886.01 s [quickcheck-instances] depends hashable-1.4.7.0-GEjBqeVTk9fFXLWZuCuCl0
  14782. 886.01 s [quickcheck-instances] depends integer-logarithms-1.0.4-IBRvjH3JNZKK0ceKQCpW8T
  14783. 886.01 s [quickcheck-instances] depends old-time-1.1.0.4-30FrloRmNXc5w44EPMtl0F
  14784. 886.01 s [quickcheck-instances] depends primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  14785. 886.01 s [quickcheck-instances] depends scientific-0.3.8.0-Irep2pOchz8zdCmrLNpHs
  14786. 886.01 s [quickcheck-instances] depends splitmix-0.1.1-2fAAhGIhTVcD98TpsAK1zl
  14787. 886.01 s [quickcheck-instances] depends strict-0.5.1-70zSHaNjeEJA3jdFoBdw6W
  14788. 886.01 s [quickcheck-instances] depends tagged-0.8.8-DoA327JvV6VCRPnc85T2NS
  14789. 886.01 s [quickcheck-instances] depends text-2.1.1-f47e
  14790. 886.01 s [quickcheck-instances] depends text-short-0.1.6-HGHc4h1G5Os4GcQg672yUb
  14791. 886.01 s [quickcheck-instances] depends these-1.2.1-6FN8c3RTw6KhazplKvIFT
  14792. 886.01 s [quickcheck-instances] depends time-compat-1.9.7-L0Wq2xyUoI6F8BkTZ5frph
  14793. 886.01 s [quickcheck-instances] depends transformers-0.6.1.1-3641
  14794. 886.01 s [quickcheck-instances] depends unordered-containers-0.2.20-3pn1xOgcpceNSsDUbhFde
  14795. 886.01 s [quickcheck-instances] depends uuid-types-1.0.6-DCo8FI24kSD2IlTV36QNNV
  14796. 886.01 s [quickcheck-instances] depends vector-0.13.2.0-GGHtQqNxgxw4o0MKBX8ct0
  14797. 886.01 s [quickcheck-instances] definite quickcheck-instances-0.3.32-E5FTMEUy3HWCu80IcYLg9I-self-test
  14798. 886.01 s [quickcheck-instances] depends QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  14799. 886.01 s [quickcheck-instances] depends base-4.20.0.0-d8e2
  14800. 886.01 s [quickcheck-instances] depends containers-0.7-4cd1
  14801. 886.01 s [quickcheck-instances] depends primitive-0.9.1.0-3DHohHWz4cV1doWQ4dqWn8
  14802. 886.01 s [quickcheck-instances] depends quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  14803. 886.01 s [quickcheck-instances] depends tagged-0.8.8-DoA327JvV6VCRPnc85T2NS
  14804. 886.01 s [quickcheck-instances] depends uuid-types-1.0.6-DCo8FI24kSD2IlTV36QNNV
  14805. 886.01 s [quickcheck-instances] Using Cabal-3.12.0.0 compiled by ghc-9.10
  14806. 886.01 s [quickcheck-instances] Using compiler: ghc-9.10.1
  14807. 886.01 s [quickcheck-instances] Using install prefix:
  14808. 886.01 s [quickcheck-instances] /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32
  14809. 886.01 s [quickcheck-instances] Executables installed in:
  14810. 886.01 s [quickcheck-instances] /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32/bin
  14811. 886.01 s [quickcheck-instances] Libraries installed in:
  14812. 886.01 s [quickcheck-instances] /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  14813. 886.01 s [quickcheck-instances] Dynamic Libraries installed in:
  14814. 886.01 s [quickcheck-instances] /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5
  14815. 886.01 s [quickcheck-instances] Private executables installed in:
  14816. 886.01 s [quickcheck-instances] /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32/libexec/x86_64-linux-ghc-9.10.1-c9f5/quickcheck-instances-0.3.32
  14817. 886.01 s [quickcheck-instances] Data files installed in:
  14818. 886.01 s [quickcheck-instances] /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32/share/x86_64-linux-ghc-9.10.1-c9f5/quickcheck-instances-0.3.32
  14819. 886.01 s [quickcheck-instances] Documentation installed in:
  14820. 886.01 s [quickcheck-instances] /nix/store/5l8narbfbxqzyk4a3m8jwzhiy51w5pkj-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32
  14821. 886.01 s [quickcheck-instances] Configuration files installed in:
  14822. 886.01 s [quickcheck-instances] /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32/etc
  14823. 886.01 s [quickcheck-instances] No alex found
  14824. 886.01 s [quickcheck-instances] Using ar found on system at:
  14825. 886.01 s [quickcheck-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  14826. 886.01 s [quickcheck-instances] No c2hs found
  14827. 886.01 s [quickcheck-instances] No cpphs found
  14828. 886.01 s [quickcheck-instances] No doctest found
  14829. 886.01 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  14830. 886.01 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  14831. 886.01 s [quickcheck-instances] Using ghc version 9.10.1 found on system at:
  14832. 886.01 s [quickcheck-instances] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc
  14833. 886.01 s [quickcheck-instances] Using ghc-pkg version 9.10.1 found on system at:
  14834. 886.01 s [quickcheck-instances] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc-pkg-9.10.1
  14835. 886.01 s [quickcheck-instances] No ghcjs found
  14836. 886.01 s [quickcheck-instances] No ghcjs-pkg found
  14837. 886.01 s [quickcheck-instances] No greencard found
  14838. 886.02 s [quickcheck-instances] Using haddock version 2.28.0 found on system at:
  14839. 886.02 s [quickcheck-instances] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/haddock-ghc-9.10.1
  14840. 886.02 s [quickcheck-instances] No happy found
  14841. 886.02 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  14842. 886.02 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14843. 886.02 s [quickcheck-instances] No hmake found
  14844. 886.02 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  14845. 886.02 s [quickcheck-instances] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hpc-ghc-9.10.1
  14846. 886.02 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  14847. 886.02 s [quickcheck-instances] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hsc2hs-ghc-9.10.1
  14848. 886.02 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  14849. 886.02 s [quickcheck-instances] /nix/store/c0gbcvjjvqzy92m9ycv6zcqiczs6bvyw-hscolour-1.25/bin/HsColour
  14850. 886.02 s [quickcheck-instances] No jhc found
  14851. 886.02 s [quickcheck-instances] Using ld found on system at:
  14852. 886.02 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  14853. 886.02 s [quickcheck-instances] No pkg-config found
  14854. 886.02 s [quickcheck-instances] Using runghc version 9.10.1 found on system at:
  14855. 886.02 s [quickcheck-instances] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/runghc-9.10.1
  14856. 886.02 s [quickcheck-instances] Using strip version 2.44 found on system at:
  14857. 886.02 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  14858. 886.02 s [quickcheck-instances] Using tar found on system at:
  14859. 886.02 s [quickcheck-instances] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  14860. 886.02 s [quickcheck-instances] No uhc found
  14861. 886.82 s [quickcheck-instances] Phase: buildPhase
  14862. 887.13 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32...
  14863. 887.21 s [quickcheck-instances] Building library for quickcheck-instances-0.3.32...
  14864. 887.54 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 )
  14865. 888.11 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 )
  14866. 888.20 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 )
  14867. 891.21 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 )
  14868. 891.25 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 )
  14869. 893.51 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 )
  14870. 893.51 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 )
  14871. 893.51 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 )
  14872. 893.51 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 )
  14873. 893.51 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 )
  14874. 893.51 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 )
  14875. 893.51 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 )
  14876. 893.51 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 )
  14877. 893.51 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 )
  14878. 893.51 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 )
  14879. 894.88 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 )
  14880. 894.88 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 )
  14881. 894.88 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 )
  14882. 894.88 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 )
  14883. 894.89 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 )
  14884. 896.11 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 )
  14885. 896.11 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 )
  14886. 896.11 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 )
  14887. 896.11 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 )
  14888. 896.11 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 )
  14889. 896.11 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 )
  14890. 897.40 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 )
  14891. 898.23 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 )
  14892. 898.48 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 )
  14893. 902.09 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 )
  14894. 904.53 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 )
  14895. 904.54 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 )
  14896. 905.29 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 )
  14897. 905.29 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 )
  14898. 905.29 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 )
  14899. 905.29 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 )
  14900. 905.29 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 )
  14901. 905.29 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 )
  14902. 905.29 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 )
  14903. 905.29 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 )
  14904. 905.29 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 )
  14905. 905.30 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 )
  14906. 905.69 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 )
  14907. 905.69 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 )
  14908. 905.69 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 )
  14909. 905.69 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 )
  14910. 906.24 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 )
  14911. 906.24 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 )
  14912. 906.24 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 )
  14913. 906.24 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 )
  14914. 906.30 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 )
  14915. 906.30 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  14916. 910.36 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32...
  14917. 910.36 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.32...
  14918. 910.56 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  14919. 911.40 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  14920. 913.24 s [quickcheck-instances] Phase: checkPhase
  14921. 913.92 s [quickcheck-instances] Running 1 test suites...
  14922. 913.92 s [quickcheck-instances] Test suite self-test: RUNNING...
  14923. 913.94 s [quickcheck-instances] +++ OK, passed 100 tests.
  14924. 913.94 s [quickcheck-instances] +++ OK, passed 100 tests.
  14925. 913.94 s [quickcheck-instances] +++ OK, passed 100 tests.
  14926. 913.94 s [quickcheck-instances] +++ OK, passed 100 tests.
  14927. 913.94 s [quickcheck-instances] +++ OK, passed 100 tests.
  14928. 913.94 s [quickcheck-instances] Test suite self-test: PASS
  14929. 913.94 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.32-self-test.log
  14930. 913.94 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  14931. 913.96 s [quickcheck-instances] Phase: haddockPhase
  14932. 914.23 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32...
  14933. 914.27 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.32...
  14934. 914.28 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  14935. 914.28 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  14936. 915.12 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  14937. 915.14 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  14938. 915.19 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  14939. 915.49 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  14940. 915.58 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  14941. 915.65 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  14942. 915.70 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  14943. 915.72 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  14944. 915.74 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  14945. 915.83 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  14946. 915.97 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  14947. 915.98 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  14948. 916.00 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  14949. 916.28 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  14950. 916.30 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  14951. 916.43 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  14952. 916.55 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  14953. 916.58 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  14954. 916.59 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  14955. 916.66 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  14956. 916.90 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  14957. 917.10 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  14958. 917.14 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  14959. 917.19 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  14960. 917.62 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  14961. 917.63 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  14962. 917.64 s [quickcheck-instances] Haddock coverage:
  14963. 917.64 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  14964. 917.64 s [quickcheck-instances] Missing documentation for:
  14965. 917.64 s [quickcheck-instances] Module header
  14966. 917.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  14967. 917.65 s [quickcheck-instances] Missing documentation for:
  14968. 917.65 s [quickcheck-instances] Module header
  14969. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  14970. 917.66 s [quickcheck-instances] Missing documentation for:
  14971. 917.66 s [quickcheck-instances] Module header
  14972. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  14973. 917.66 s [quickcheck-instances] Missing documentation for:
  14974. 917.66 s [quickcheck-instances] Module header
  14975. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  14976. 917.66 s [quickcheck-instances] Missing documentation for:
  14977. 917.66 s [quickcheck-instances] Module header
  14978. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  14979. 917.66 s [quickcheck-instances] Missing documentation for:
  14980. 917.66 s [quickcheck-instances] Module header
  14981. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  14982. 917.66 s [quickcheck-instances] Missing documentation for:
  14983. 917.66 s [quickcheck-instances] Module header
  14984. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  14985. 917.66 s [quickcheck-instances] Missing documentation for:
  14986. 917.66 s [quickcheck-instances] Module header
  14987. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  14988. 917.66 s [quickcheck-instances] Missing documentation for:
  14989. 917.66 s [quickcheck-instances] Module header
  14990. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  14991. 917.66 s [quickcheck-instances] Missing documentation for:
  14992. 917.66 s [quickcheck-instances] Module header
  14993. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  14994. 917.66 s [quickcheck-instances] Missing documentation for:
  14995. 917.66 s [quickcheck-instances] Module header
  14996. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  14997. 917.66 s [quickcheck-instances] Missing documentation for:
  14998. 917.66 s [quickcheck-instances] Module header
  14999. 917.66 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  15000. 917.66 s [quickcheck-instances] Missing documentation for:
  15001. 917.66 s [quickcheck-instances] Module header
  15002. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  15003. 917.67 s [quickcheck-instances] Missing documentation for:
  15004. 917.67 s [quickcheck-instances] Module header
  15005. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  15006. 917.67 s [quickcheck-instances] Missing documentation for:
  15007. 917.67 s [quickcheck-instances] Module header
  15008. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  15009. 917.67 s [quickcheck-instances] Missing documentation for:
  15010. 917.67 s [quickcheck-instances] Module header
  15011. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  15012. 917.67 s [quickcheck-instances] Missing documentation for:
  15013. 917.67 s [quickcheck-instances] Module header
  15014. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  15015. 917.67 s [quickcheck-instances] Missing documentation for:
  15016. 917.67 s [quickcheck-instances] Module header
  15017. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  15018. 917.67 s [quickcheck-instances] Missing documentation for:
  15019. 917.67 s [quickcheck-instances] Module header
  15020. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  15021. 917.67 s [quickcheck-instances] Missing documentation for:
  15022. 917.67 s [quickcheck-instances] Module header
  15023. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  15024. 917.67 s [quickcheck-instances] Missing documentation for:
  15025. 917.67 s [quickcheck-instances] Module header
  15026. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  15027. 917.67 s [quickcheck-instances] Missing documentation for:
  15028. 917.67 s [quickcheck-instances] Module header
  15029. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  15030. 917.67 s [quickcheck-instances] Missing documentation for:
  15031. 917.67 s [quickcheck-instances] Module header
  15032. 917.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  15033. 917.67 s [quickcheck-instances] Missing documentation for:
  15034. 917.67 s [quickcheck-instances] Module header
  15035. 917.67 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  15036. 919.83 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  15037. 919.83 s [quickcheck-instances] - Data.Vector.Vector
  15038. 919.83 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  15039. 919.83 s [quickcheck-instances] - Data.Vector.Storable.Vector
  15040. 919.83 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  15041. 919.83 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  15042. 933.51 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  15043. 933.53 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  15044. 933.72 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32...
  15045. 933.74 s [quickcheck-instances] Phase: installPhase
  15046. 933.91 s [quickcheck-instances] Installing library in /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  15047. 935.21 s [quickcheck-instances] Phase: fixupPhase
  15048. 935.29 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32
  15049. 935.30 s [quickcheck-instances] shrinking /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSquickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32-ghc9.10.1.so
  15050. 935.40 s [quickcheck-instances] checking for references to /build/ in /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32...
  15051. 935.46 s [quickcheck-instances] patching script interpreter paths in /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32
  15052. 935.47 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32/lib
  15053. 935.91 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/5l8narbfbxqzyk4a3m8jwzhiy51w5pkj-quickcheck-instances-0.3.32-doc
  15054. 935.94 s [quickcheck-instances] checking for references to /build/ in /nix/store/5l8narbfbxqzyk4a3m8jwzhiy51w5pkj-quickcheck-instances-0.3.32-doc...
  15055. 935.99 s [quickcheck-instances] patching script interpreter paths in /nix/store/5l8narbfbxqzyk4a3m8jwzhiy51w5pkj-quickcheck-instances-0.3.32-doc
  15056. 936.38 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/5l8narbfbxqzyk4a3m8jwzhiy51w5pkj-quickcheck-instances-0.3.32-doc /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32
  15057. 937.18 s [quickcheck-instances:post-build] Nothing to push - all store paths are already on Cachix.
  15058. 937.27 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/5l8narbfbxqzyk4a3m8jwzhiy51w5pkj-quickcheck-instances-0.3.32-doc /nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32
  15059. 937.62 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15060. 937.84 s [quickcheck-instances:post-build] copying 1 paths...
  15061. 937.84 s [quickcheck-instances:post-build] copying path '/nix/store/b9yf4zgwc05apc21zb5778dw4mviprza-quickcheck-instances-0.3.32' to 'https://cache.nix-ci.com'...
  15062. 940.38 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15063. 940.57 s [quickcheck-instances:post-build] copying 0 paths...
  15064. 940.71 s Progress: 8 of 15 built, 155 of 155 downloaded from cache
  15065. 940.80 s Building /nix/store/9yjgj3w9s8scafy0qshypwnrmp4z9zra-extra-1.7.16.drv
  15066. 940.96 s [extra] Phase: setupCompilerEnvironmentPhase
  15067. 940.97 s [extra] Build with /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1.
  15068. 941.30 s [extra] Phase: unpackPhase
  15069. 941.32 s [extra] unpacking source archive /nix/store/zap07ayqyv48lfcxp4yva8sylcvy2knk-extra-1.7.16.tar.gz
  15070. 941.34 s [extra] source root is extra-1.7.16
  15071. 941.36 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.7.16/test/TestUtil.hs"
  15072. 941.38 s [extra] Phase: patchPhase
  15073. 941.39 s [extra] Replace Cabal file with edited version from mirror://hackage/extra-1.7.16/revision/1.cabal.
  15074. 941.40 s [extra] Phase: compileBuildDriverPhase
  15075. 941.40 s [extra] setupCompileFlags: -package-db=/build/tmp.dpD5LKFHif/setup-package.conf.d -threaded
  15076. 941.50 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.dpD5LKFHif/Main.o )
  15077. 941.61 s [extra] [2 of 2] Linking Setup
  15078. 943.80 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  15079. 943.82 s [extra] Phase: configurePhase
  15080. 943.83 s [extra] configureFlags: --verbose --prefix=/nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/76mdglzvnsc3ihjpswqmm61p33rk1jy7-extra-1.7.16-doc/share/doc/extra-1.7.16 --with-gcc=gcc --package-db=/build/tmp.dpD5LKFHif/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  15081. 943.86 s [extra] Using Parsec parser
  15082. 943.86 s [extra] Configuring extra-1.7.16...
  15083. 945.06 s [extra] Dependency base >=4.9 && <4.21: using base-4.20.0.0
  15084. 945.06 s [extra] Dependency clock >=0.7: using clock-0.8.4
  15085. 945.06 s [extra] Dependency directory: using directory-1.3.8.3
  15086. 945.06 s [extra] Dependency filepath: using filepath-1.5.2.0
  15087. 945.06 s [extra] Dependency process: using process-1.6.19.0
  15088. 945.06 s [extra] Dependency time: using time-1.12.2
  15089. 945.06 s [extra] Dependency unix: using unix-2.8.5.1
  15090. 945.06 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.14.3
  15091. 945.06 s [extra] Dependency base >=4 && <5: using base-4.20.0.0
  15092. 945.06 s [extra] Dependency directory: using directory-1.3.8.3
  15093. 945.06 s [extra] Dependency extra: using extra-1.7.16
  15094. 945.06 s [extra] Dependency filepath: using filepath-1.5.2.0
  15095. 945.06 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.32
  15096. 945.06 s [extra] Dependency unix: using unix-2.8.5.1
  15097. 945.06 s [extra] Source component graph:
  15098. 945.06 s [extra] component lib
  15099. 945.06 s [extra] component test:extra-test dependency lib
  15100. 945.06 s [extra] Configured component graph:
  15101. 945.06 s [extra] component extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  15102. 945.06 s [extra] include base-4.20.0.0-d8e2
  15103. 945.06 s [extra] include clock-0.8.4-BHWQZGGlEMuHI6WgL8twCz
  15104. 945.06 s [extra] include directory-1.3.8.3-678a
  15105. 945.06 s [extra] include filepath-1.5.2.0-058d
  15106. 945.06 s [extra] include process-1.6.19.0-9629
  15107. 945.06 s [extra] include time-1.12.2-a16e
  15108. 945.06 s [extra] include unix-2.8.5.1-2416
  15109. 945.06 s [extra] component extra-1.7.16-3pFqBw4v5UdEb1LtIQSxRP-extra-test
  15110. 945.06 s [extra] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  15111. 945.06 s [extra] include base-4.20.0.0-d8e2
  15112. 945.06 s [extra] include directory-1.3.8.3-678a
  15113. 945.06 s [extra] include extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  15114. 945.06 s [extra] include filepath-1.5.2.0-058d
  15115. 945.06 s [extra] include quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  15116. 945.06 s [extra] include unix-2.8.5.1-2416
  15117. 945.06 s [extra] Linked component graph:
  15118. 945.06 s [extra] unit extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  15119. 945.06 s [extra] include base-4.20.0.0-d8e2
  15120. 945.06 s [extra] include clock-0.8.4-BHWQZGGlEMuHI6WgL8twCz
  15121. 945.06 s [extra] include directory-1.3.8.3-678a
  15122. 945.06 s [extra] include filepath-1.5.2.0-058d
  15123. 945.06 s [extra] include process-1.6.19.0-9629
  15124. 945.06 s [extra] include time-1.12.2-a16e
  15125. 945.06 s [extra] include unix-2.8.5.1-2416
  15126. 945.06 s [extra] Control.Concurrent.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Control.Exception.Extra,Control.Monad.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Control.Monad.Extra,Data.Either.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Data.Either.Extra,Data.Foldable.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Data.Foldable.Extra,Data.IORef.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Data.IORef.Extra,Data.List.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Data.Typeable.Extra,Data.Version.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Data.Version.Extra,Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Extra,Numeric.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Numeric.Extra,System.Directory.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:System.Directory.Extra,System.Environment.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:System.Environment.Extra,System.IO.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:System.IO.Extra,System.Info.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:System.Info.Extra,System.Process.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:System.Process.Extra,System.Time.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:System.Time.Extra,Text.Read.Extra=extra-1.7.16-HtxlmSOYOkREEzHwSbWygl:Text.Read.Extra
  15127. 945.06 s [extra] unit extra-1.7.16-3pFqBw4v5UdEb1LtIQSxRP-extra-test
  15128. 945.06 s [extra] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  15129. 945.06 s [extra] include base-4.20.0.0-d8e2
  15130. 945.06 s [extra] include directory-1.3.8.3-678a
  15131. 945.06 s [extra] include extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  15132. 945.06 s [extra] include filepath-1.5.2.0-058d
  15133. 945.06 s [extra] include quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  15134. 945.06 s [extra] include unix-2.8.5.1-2416
  15135. 945.06 s [extra] Ready component graph:
  15136. 945.06 s [extra] definite extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  15137. 945.06 s [extra] depends base-4.20.0.0-d8e2
  15138. 945.06 s [extra] depends clock-0.8.4-BHWQZGGlEMuHI6WgL8twCz
  15139. 945.06 s [extra] depends directory-1.3.8.3-678a
  15140. 945.06 s [extra] depends filepath-1.5.2.0-058d
  15141. 945.06 s [extra] depends process-1.6.19.0-9629
  15142. 945.06 s [extra] depends time-1.12.2-a16e
  15143. 945.06 s [extra] depends unix-2.8.5.1-2416
  15144. 945.06 s [extra] definite extra-1.7.16-3pFqBw4v5UdEb1LtIQSxRP-extra-test
  15145. 945.06 s [extra] depends QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  15146. 945.06 s [extra] depends base-4.20.0.0-d8e2
  15147. 945.06 s [extra] depends directory-1.3.8.3-678a
  15148. 945.06 s [extra] depends extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  15149. 945.06 s [extra] depends filepath-1.5.2.0-058d
  15150. 945.06 s [extra] depends quickcheck-instances-0.3.32-EMXsowHypLZgZhPNKBo32
  15151. 945.06 s [extra] depends unix-2.8.5.1-2416
  15152. 945.06 s [extra] Using Cabal-3.12.0.0 compiled by ghc-9.10
  15153. 945.06 s [extra] Using compiler: ghc-9.10.1
  15154. 945.06 s [extra] Using install prefix: /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16
  15155. 945.06 s [extra] Executables installed in:
  15156. 945.06 s [extra] /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16/bin
  15157. 945.06 s [extra] Libraries installed in:
  15158. 945.06 s [extra] /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  15159. 945.06 s [extra] Dynamic Libraries installed in:
  15160. 945.06 s [extra] /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5
  15161. 945.06 s [extra] Private executables installed in:
  15162. 945.06 s [extra] /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16/libexec/x86_64-linux-ghc-9.10.1-c9f5/extra-1.7.16
  15163. 945.06 s [extra] Data files installed in:
  15164. 945.06 s [extra] /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16/share/x86_64-linux-ghc-9.10.1-c9f5/extra-1.7.16
  15165. 945.06 s [extra] Documentation installed in:
  15166. 945.06 s [extra] /nix/store/76mdglzvnsc3ihjpswqmm61p33rk1jy7-extra-1.7.16-doc/share/doc/extra-1.7.16
  15167. 945.06 s [extra] Configuration files installed in:
  15168. 945.06 s [extra] /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16/etc
  15169. 945.06 s [extra] No alex found
  15170. 945.06 s [extra] Using ar found on system at:
  15171. 945.06 s [extra] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  15172. 945.06 s [extra] No c2hs found
  15173. 945.06 s [extra] No cpphs found
  15174. 945.06 s [extra] No doctest found
  15175. 945.06 s [extra] Using gcc version 14.3.0 given by user at:
  15176. 945.06 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  15177. 945.06 s [extra] Using ghc version 9.10.1 found on system at:
  15178. 945.06 s [extra] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc
  15179. 945.06 s [extra] Using ghc-pkg version 9.10.1 found on system at:
  15180. 945.06 s [extra] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc-pkg-9.10.1
  15181. 945.06 s [extra] No ghcjs found
  15182. 945.06 s [extra] No ghcjs-pkg found
  15183. 945.06 s [extra] No greencard found
  15184. 945.06 s [extra] Using haddock version 2.28.0 found on system at:
  15185. 945.06 s [extra] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/haddock-ghc-9.10.1
  15186. 945.06 s [extra] No happy found
  15187. 945.06 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  15188. 945.06 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15189. 945.06 s [extra] No hmake found
  15190. 945.06 s [extra] Using hpc version 0.69 found on system at:
  15191. 945.06 s [extra] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hpc-ghc-9.10.1
  15192. 945.06 s [extra] Using hsc2hs version 0.68.10 found on system at:
  15193. 945.06 s [extra] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hsc2hs-ghc-9.10.1
  15194. 945.06 s [extra] Using hscolour version 1.25 found on system at:
  15195. 945.06 s [extra] /nix/store/c0gbcvjjvqzy92m9ycv6zcqiczs6bvyw-hscolour-1.25/bin/HsColour
  15196. 945.06 s [extra] No jhc found
  15197. 945.06 s [extra] Using ld found on system at:
  15198. 945.07 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  15199. 945.07 s [extra] No pkg-config found
  15200. 945.07 s [extra] Using runghc version 9.10.1 found on system at:
  15201. 945.07 s [extra] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/runghc-9.10.1
  15202. 945.07 s [extra] Using strip version 2.44 found on system at:
  15203. 945.07 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  15204. 945.07 s [extra] Using tar found on system at:
  15205. 945.07 s [extra] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  15206. 945.07 s [extra] No uhc found
  15207. 945.25 s [extra] Phase: buildPhase
  15208. 945.42 s [extra] Preprocessing library for extra-1.7.16...
  15209. 945.43 s [extra] Building library for extra-1.7.16...
  15210. 945.88 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 )
  15211. 946.31 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 )
  15212. 946.34 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 )
  15213. 946.41 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 )
  15214. 946.41 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  15215. 946.41 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  15216. 946.41 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 )
  15217. 948.21 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 )
  15218. 948.48 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 )
  15219. 948.62 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 )
  15220. 948.62 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 )
  15221. 948.62 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 )
  15222. 949.03 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 )
  15223. 949.25 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 )
  15224. 950.02 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 )
  15225. 950.02 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 )
  15226. 950.03 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 )
  15227. 950.36 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 )
  15228. 950.36 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 )
  15229. 950.54 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 )
  15230. 950.54 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  15231. 950.77 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 )
  15232. 952.22 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  15233. 953.48 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  15234. 953.98 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  15235. 954.23 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  15236. 954.23 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  15237. 954.23 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  15238. 954.23 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  15239. 956.67 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  15240. 957.68 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  15241. 957.68 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  15242. 957.68 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  15243. 958.08 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  15244. 958.78 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  15245. 959.14 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  15246. 960.36 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  15247. 960.36 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  15248. 960.36 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  15249. 961.12 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  15250. 961.12 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  15251. 961.52 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  15252. 961.53 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  15253. 961.94 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  15254. 964.24 s [extra] Preprocessing test suite 'extra-test' for extra-1.7.16...
  15255. 964.24 s [extra] Building test suite 'extra-test' for extra-1.7.16...
  15256. 964.38 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  15257. 965.55 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  15258. 969.84 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  15259. 969.85 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  15260. 970.57 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  15261. 972.24 s [extra] Phase: checkPhase
  15262. 972.88 s [extra] Running 1 test suites...
  15263. 972.88 s [extra] Test suite extra-test: RUNNING...
  15264. 972.90 s [extra] withTempFile
  15265. 972.90 s [extra] +++ OK, passed 1 test.
  15266. 972.90 s [extra] captureOutput
  15267. 972.90 s [extra] +++ OK, passed 1 test.
  15268. 972.90 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  15269. 972.95 s [extra] +++ OK, passed 100 tests.
  15270. 972.95 s [extra] \(x :: IO Int) -> join (once x) == x
  15271. 972.99 s [extra] +++ OK, passed 100 tests.
  15272. 972.99 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  15273. 973.04 s [extra] +++ OK, passed 100 tests.
  15274. 973.04 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  15275. 973.10 s [extra] +++ OK, passed 100 tests.
  15276. 973.10 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  15277. 973.15 s [extra] +++ OK, passed 100 tests.
  15278. 973.15 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  15279. 973.19 s [extra] +++ OK, passed 100 tests.
  15280. 973.19 s [extra] stringException "test" == pure "test"
  15281. 973.19 s [extra] +++ OK, passed 1 test.
  15282. 973.20 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  15283. 973.20 s [extra] +++ OK, passed 1 test.
  15284. 973.20 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  15285. 973.20 s [extra] +++ OK, passed 1 test.
  15286. 973.20 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  15287. 973.20 s [extra] +++ OK, passed 1 test.
  15288. 973.21 s [extra] ignore (print 1) == print 1
  15289. 973.21 s [extra] +++ OK, passed 1 test.
  15290. 973.21 s [extra] ignore (fail "die") == pure ()
  15291. 973.21 s [extra] +++ OK, passed 1 test.
  15292. 973.21 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  15293. 973.21 s [extra] +++ OK, passed 1 test.
  15294. 973.21 s [extra] seq (errorIO "foo") (print 1) == print 1
  15295. 973.21 s [extra] +++ OK, passed 1 test.
  15296. 973.21 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  15297. 973.21 s [extra] +++ OK, passed 1 test.
  15298. 973.21 s [extra] seq (assertIO False) (print 1) == print 1
  15299. 973.21 s [extra] +++ OK, passed 1 test.
  15300. 973.21 s [extra] retry 1 (print "x") == print "x"
  15301. 973.21 s [extra] +++ OK, passed 1 test.
  15302. 973.24 s [extra] retry 3 (fail "die") == fail "die"
  15303. 973.24 s [extra] +++ OK, passed 1 test.
  15304. 973.24 s [extra] whenJust Nothing print == pure ()
  15305. 973.24 s [extra] +++ OK, passed 1 test.
  15306. 973.24 s [extra] whenJust (Just 1) print == print 1
  15307. 973.24 s [extra] +++ OK, passed 1 test.
  15308. 973.24 s [extra] pureIf @Maybe True 5 == Just 5
  15309. 973.24 s [extra] +++ OK, passed 1 test.
  15310. 973.24 s [extra] pureIf @Maybe False 5 == Nothing
  15311. 973.24 s [extra] +++ OK, passed 1 test.
  15312. 973.24 s [extra] pureIf @[] True 5 == [5]
  15313. 973.24 s [extra] +++ OK, passed 1 test.
  15314. 973.24 s [extra] pureIf @[] False 5 == []
  15315. 973.24 s [extra] +++ OK, passed 1 test.
  15316. 973.24 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  15317. 973.24 s [extra] +++ OK, passed 1 test.
  15318. 973.24 s [extra] whenMaybe False (print 1) == pure Nothing
  15319. 973.24 s [extra] +++ OK, passed 1 test.
  15320. 973.24 s [extra] \(x :: Maybe ()) -> unit x == x
  15321. 973.24 s [extra] +++ OK, passed 100 tests.
  15322. 973.24 s [extra] fold1M (\x y -> Just x) [] == undefined
  15323. 973.24 s [extra] +++ OK, passed 1 test.
  15324. 973.24 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  15325. 973.24 s [extra] +++ OK, passed 1 test.
  15326. 973.24 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  15327. 973.24 s [extra] +++ OK, passed 1 test.
  15328. 973.24 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  15329. 973.24 s [extra] +++ OK, passed 1 test.
  15330. 973.24 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  15331. 973.24 s [extra] +++ OK, passed 1 test.
  15332. 973.24 s [extra] Just True ||^ undefined == Just True
  15333. 973.24 s [extra] +++ OK, passed 1 test.
  15334. 973.24 s [extra] Just False ||^ Just True == Just True
  15335. 973.24 s [extra] +++ OK, passed 1 test.
  15336. 973.24 s [extra] Just False ||^ Just False == Just False
  15337. 973.24 s [extra] +++ OK, passed 1 test.
  15338. 973.24 s [extra] Just False &&^ undefined == Just False
  15339. 973.24 s [extra] +++ OK, passed 1 test.
  15340. 973.24 s [extra] Just True &&^ Just True == Just True
  15341. 973.24 s [extra] +++ OK, passed 1 test.
  15342. 973.24 s [extra] Just True &&^ Just False == Just False
  15343. 973.24 s [extra] +++ OK, passed 1 test.
  15344. 973.24 s [extra] anyM Just [False,True ,undefined] == Just True
  15345. 973.24 s [extra] +++ OK, passed 1 test.
  15346. 973.24 s [extra] anyM Just [False,False,undefined] == undefined
  15347. 973.24 s [extra] +++ OK, passed 1 test.
  15348. 973.24 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15349. 973.24 s [extra] +++ OK, passed 100 tests.
  15350. 973.24 s [extra] allM Just [True,False,undefined] == Just False
  15351. 973.24 s [extra] +++ OK, passed 1 test.
  15352. 973.24 s [extra] allM Just [True,True ,undefined] == undefined
  15353. 973.24 s [extra] +++ OK, passed 1 test.
  15354. 973.24 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15355. 973.24 s [extra] +++ OK, passed 100 tests.
  15356. 973.24 s [extra] orM [Just False,Just True ,undefined] == Just True
  15357. 973.24 s [extra] +++ OK, passed 1 test.
  15358. 973.24 s [extra] orM [Just False,Just False,undefined] == undefined
  15359. 973.24 s [extra] +++ OK, passed 1 test.
  15360. 973.24 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  15361. 973.24 s [extra] +++ OK, passed 100 tests.
  15362. 973.25 s [extra] andM [Just True,Just False,undefined] == Just False
  15363. 973.25 s [extra] +++ OK, passed 1 test.
  15364. 973.25 s [extra] andM [Just True,Just True ,undefined] == undefined
  15365. 973.25 s [extra] +++ OK, passed 1 test.
  15366. 973.25 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  15367. 973.25 s [extra] +++ OK, passed 100 tests.
  15368. 973.25 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  15369. 973.25 s [extra] +++ OK, passed 1 test.
  15370. 973.25 s [extra] findM (Just . isUpper) "test" == Just Nothing
  15371. 973.25 s [extra] +++ OK, passed 1 test.
  15372. 973.25 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  15373. 973.25 s [extra] +++ OK, passed 1 test.
  15374. 973.25 s [extra] fromLeft 1 (Left 3) == 3
  15375. 973.25 s [extra] +++ OK, passed 1 test.
  15376. 973.25 s [extra] fromLeft 1 (Right "foo") == 1
  15377. 973.25 s [extra] +++ OK, passed 1 test.
  15378. 973.25 s [extra] fromRight 1 (Right 3) == 3
  15379. 973.25 s [extra] +++ OK, passed 1 test.
  15380. 973.25 s [extra] fromRight 1 (Left "foo") == 1
  15381. 973.25 s [extra] +++ OK, passed 1 test.
  15382. 973.25 s [extra] \x -> fromLeft' (Left x) == x
  15383. 973.25 s [extra] +++ OK, passed 100 tests.
  15384. 973.25 s [extra] \x -> fromLeft' (Right x) == undefined
  15385. 973.25 s [extra] +++ OK, passed 100 tests.
  15386. 973.25 s [extra] \x -> fromRight' (Right x) == x
  15387. 973.25 s [extra] +++ OK, passed 100 tests.
  15388. 973.25 s [extra] \x -> fromRight' (Left x) == undefined
  15389. 973.26 s [extra] +++ OK, passed 100 tests.
  15390. 973.26 s [extra] \x -> fromEither (Left x ) == x
  15391. 973.26 s [extra] +++ OK, passed 100 tests.
  15392. 973.26 s [extra] \x -> fromEither (Right x) == x
  15393. 973.26 s [extra] +++ OK, passed 100 tests.
  15394. 973.26 s [extra] \a b -> maybeToEither a (Just b) == Right b
  15395. 973.26 s [extra] +++ OK, passed 100 tests.
  15396. 973.26 s [extra] \a -> maybeToEither a Nothing == Left a
  15397. 973.26 s [extra] +++ OK, passed 100 tests.
  15398. 973.26 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  15399. 973.26 s [extra] +++ OK, passed 100 tests.
  15400. 973.26 s [extra] \x -> eitherToMaybe (Right x) == Just x
  15401. 973.26 s [extra] +++ OK, passed 100 tests.
  15402. 973.26 s [extra] mapLeft show (Left 1) == Left "1"
  15403. 973.26 s [extra] +++ OK, passed 1 test.
  15404. 973.26 s [extra] mapLeft show (Right True) == Right True
  15405. 973.26 s [extra] +++ OK, passed 1 test.
  15406. 973.26 s [extra] mapRight show (Left 1) == Left 1
  15407. 973.26 s [extra] +++ OK, passed 1 test.
  15408. 973.26 s [extra] mapRight show (Right True) == Right "True"
  15409. 973.26 s [extra] +++ OK, passed 1 test.
  15410. 973.26 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  15411. 973.28 s [extra] +++ OK, passed 100 tests.
  15412. 973.28 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  15413. 973.28 s [extra] +++ OK, passed 100 tests.
  15414. 973.29 s [extra] \xs -> repeatedly line1 xs == lines xs
  15415. 973.29 s [extra] +++ OK, passed 100 tests.
  15416. 973.29 s [extra] disjoint [1,2,3] [4,5] == True
  15417. 973.29 s [extra] +++ OK, passed 1 test.
  15418. 973.29 s [extra] disjoint [1,2,3] [4,1] == False
  15419. 973.29 s [extra] +++ OK, passed 1 test.
  15420. 973.29 s [extra] disjointOrd [1,2,3] [4,5] == True
  15421. 973.29 s [extra] +++ OK, passed 1 test.
  15422. 973.29 s [extra] disjointOrd [1,2,3] [4,1] == False
  15423. 973.29 s [extra] +++ OK, passed 1 test.
  15424. 973.29 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  15425. 973.29 s [extra] +++ OK, passed 1 test.
  15426. 973.29 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  15427. 973.29 s [extra] +++ OK, passed 1 test.
  15428. 973.29 s [extra] anySame [1,1,2] == True
  15429. 973.29 s [extra] +++ OK, passed 1 test.
  15430. 973.29 s [extra] anySame [1,2,3] == False
  15431. 973.29 s [extra] +++ OK, passed 1 test.
  15432. 973.29 s [extra] anySame (1:2:1:undefined) == True
  15433. 973.29 s [extra] +++ OK, passed 1 test.
  15434. 973.29 s [extra] anySame [] == False
  15435. 973.29 s [extra] +++ OK, passed 1 test.
  15436. 973.29 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  15437. 973.29 s [extra] +++ OK, passed 100 tests.
  15438. 973.29 s [extra] allSame [1,1,2] == False
  15439. 973.29 s [extra] +++ OK, passed 1 test.
  15440. 973.29 s [extra] allSame [1,1,1] == True
  15441. 973.29 s [extra] +++ OK, passed 1 test.
  15442. 973.29 s [extra] allSame [1] == True
  15443. 973.30 s [extra] +++ OK, passed 1 test.
  15444. 973.30 s [extra] allSame [] == True
  15445. 973.30 s [extra] +++ OK, passed 1 test.
  15446. 973.30 s [extra] allSame (1:1:2:undefined) == False
  15447. 973.30 s [extra] +++ OK, passed 1 test.
  15448. 973.30 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  15449. 973.30 s [extra] +++ OK, passed 100 tests.
  15450. 973.30 s [extra] headDef 1 [] == 1
  15451. 973.30 s [extra] +++ OK, passed 1 test.
  15452. 973.30 s [extra] headDef 1 [2,3,4] == 2
  15453. 973.30 s [extra] +++ OK, passed 1 test.
  15454. 973.30 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  15455. 973.30 s [extra] +++ OK, passed 100 tests.
  15456. 973.30 s [extra] lastDef 1 [] == 1
  15457. 973.30 s [extra] +++ OK, passed 1 test.
  15458. 973.30 s [extra] lastDef 1 [2,3,4] == 4
  15459. 973.30 s [extra] +++ OK, passed 1 test.
  15460. 973.30 s [extra] \x xs -> lastDef x xs == last (x:xs)
  15461. 973.31 s [extra] +++ OK, passed 100 tests.
  15462. 973.31 s [extra] [2,3,4] !? 1 == Just 3
  15463. 973.31 s [extra] +++ OK, passed 1 test.
  15464. 973.31 s [extra] [2,3,4] !? (-1) == Nothing
  15465. 973.31 s [extra] +++ OK, passed 1 test.
  15466. 973.31 s [extra] [] !? 0 == Nothing
  15467. 973.31 s [extra] +++ OK, passed 1 test.
  15468. 973.31 s [extra] notNull [] == False
  15469. 973.31 s [extra] +++ OK, passed 1 test.
  15470. 973.31 s [extra] notNull [1] == True
  15471. 973.31 s [extra] +++ OK, passed 1 test.
  15472. 973.31 s [extra] \xs -> notNull xs == not (null xs)
  15473. 973.31 s [extra] +++ OK, passed 100 tests.
  15474. 973.31 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  15475. 973.31 s [extra] +++ OK, passed 1 test.
  15476. 973.31 s [extra] list 1 (\v _ -> v - 2) [] == 1
  15477. 973.31 s [extra] +++ OK, passed 1 test.
  15478. 973.31 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  15479. 973.31 s [extra] +++ OK, passed 100 tests.
  15480. 973.31 s [extra] unsnoc "test" == Just ("tes",'t')
  15481. 973.31 s [extra] +++ OK, passed 1 test.
  15482. 973.31 s [extra] unsnoc "" == Nothing
  15483. 973.31 s [extra] +++ OK, passed 1 test.
  15484. 973.31 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  15485. 973.31 s [extra] +++ OK, passed 100 tests.
  15486. 973.32 s [extra] cons 't' "est" == "test"
  15487. 973.32 s [extra] +++ OK, passed 1 test.
  15488. 973.32 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  15489. 973.32 s [extra] +++ OK, passed 100 tests.
  15490. 973.32 s [extra] snoc "tes" 't' == "test"
  15491. 973.32 s [extra] +++ OK, passed 1 test.
  15492. 973.32 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  15493. 973.32 s [extra] +++ OK, passed 100 tests.
  15494. 973.32 s [extra] enumerate == [False, True]
  15495. 973.32 s [extra] +++ OK, passed 1 test.
  15496. 973.32 s [extra] takeEnd 3 "hello" == "llo"
  15497. 973.32 s [extra] +++ OK, passed 1 test.
  15498. 973.32 s [extra] takeEnd 5 "bye" == "bye"
  15499. 973.32 s [extra] +++ OK, passed 1 test.
  15500. 973.32 s [extra] takeEnd (-1) "bye" == ""
  15501. 973.32 s [extra] +++ OK, passed 1 test.
  15502. 973.32 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  15503. 973.33 s [extra] +++ OK, passed 100 tests.
  15504. 973.33 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  15505. 973.33 s [extra] +++ OK, passed 100 tests.
  15506. 973.33 s [extra] dropEnd 3 "hello" == "he"
  15507. 973.33 s [extra] +++ OK, passed 1 test.
  15508. 973.33 s [extra] dropEnd 5 "bye" == ""
  15509. 973.33 s [extra] +++ OK, passed 1 test.
  15510. 973.33 s [extra] dropEnd (-1) "bye" == "bye"
  15511. 973.33 s [extra] +++ OK, passed 1 test.
  15512. 973.33 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  15513. 973.33 s [extra] +++ OK, passed 100 tests.
  15514. 973.33 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  15515. 973.33 s [extra] +++ OK, passed 100 tests.
  15516. 973.33 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  15517. 973.33 s [extra] +++ OK, passed 100 tests.
  15518. 973.33 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  15519. 973.33 s [extra] +++ OK, passed 1 test.
  15520. 973.33 s [extra] splitAtEnd 3 "he" == ("", "he")
  15521. 973.33 s [extra] +++ OK, passed 1 test.
  15522. 973.34 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  15523. 973.34 s [extra] +++ OK, passed 100 tests.
  15524. 973.34 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  15525. 973.34 s [extra] +++ OK, passed 100 tests.
  15526. 973.34 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  15527. 973.34 s [extra] +++ OK, passed 100 tests.
  15528. 973.34 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  15529. 973.34 s [extra] +++ OK, passed 1 test.
  15530. 973.34 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  15531. 973.35 s [extra] +++ OK, passed 100 tests.
  15532. 973.35 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  15533. 973.35 s [extra] +++ OK, passed 1 test.
  15534. 973.35 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  15535. 973.35 s [extra] +++ OK, passed 1 test.
  15536. 973.35 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  15537. 973.35 s [extra] +++ OK, passed 1 test.
  15538. 973.35 s [extra] trim " hello " == "hello"
  15539. 973.35 s [extra] +++ OK, passed 1 test.
  15540. 973.35 s [extra] trimStart " hello " == "hello "
  15541. 973.35 s [extra] +++ OK, passed 1 test.
  15542. 973.35 s [extra] trimEnd " hello " == " hello"
  15543. 973.35 s [extra] +++ OK, passed 1 test.
  15544. 973.35 s [extra] \s -> trim s == trimEnd (trimStart s)
  15545. 973.35 s [extra] +++ OK, passed 100 tests.
  15546. 973.35 s [extra] lower "This is A TEST" == "this is a test"
  15547. 973.35 s [extra] +++ OK, passed 1 test.
  15548. 973.35 s [extra] lower "" == ""
  15549. 973.35 s [extra] +++ OK, passed 1 test.
  15550. 973.35 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  15551. 973.35 s [extra] +++ OK, passed 1 test.
  15552. 973.35 s [extra] upper "" == ""
  15553. 973.35 s [extra] +++ OK, passed 1 test.
  15554. 973.35 s [extra] word1 "" == ("", "")
  15555. 973.35 s [extra] +++ OK, passed 1 test.
  15556. 973.35 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  15557. 973.35 s [extra] +++ OK, passed 1 test.
  15558. 973.35 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  15559. 973.35 s [extra] +++ OK, passed 1 test.
  15560. 973.36 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  15561. 973.36 s [extra] +++ OK, passed 100 tests.
  15562. 973.36 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  15563. 973.36 s [extra] +++ OK, passed 100 tests.
  15564. 973.36 s [extra] line1 "" == ("", "")
  15565. 973.36 s [extra] +++ OK, passed 1 test.
  15566. 973.36 s [extra] line1 "test" == ("test","")
  15567. 973.36 s [extra] +++ OK, passed 1 test.
  15568. 973.36 s [extra] line1 "test\n" == ("test","")
  15569. 973.36 s [extra] +++ OK, passed 1 test.
  15570. 973.36 s [extra] line1 "test\nrest" == ("test","rest")
  15571. 973.36 s [extra] +++ OK, passed 1 test.
  15572. 973.36 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  15573. 973.36 s [extra] +++ OK, passed 1 test.
  15574. 973.36 s [extra] escapeHTML "this is a test" == "this is a test"
  15575. 973.36 s [extra] +++ OK, passed 1 test.
  15576. 973.36 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  15577. 973.36 s [extra] +++ OK, passed 1 test.
  15578. 973.36 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  15579. 973.36 s [extra] +++ OK, passed 1 test.
  15580. 973.36 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  15581. 973.36 s [extra] +++ OK, passed 100 tests.
  15582. 973.37 s [extra] escapeJSON "this is a test" == "this is a test"
  15583. 973.37 s [extra] +++ OK, passed 1 test.
  15584. 973.37 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  15585. 973.37 s [extra] +++ OK, passed 1 test.
  15586. 973.37 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  15587. 973.37 s [extra] +++ OK, passed 1 test.
  15588. 973.37 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  15589. 973.37 s [extra] +++ OK, passed 100 tests.
  15590. 973.37 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  15591. 973.37 s [extra] +++ OK, passed 1 test.
  15592. 973.37 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  15593. 973.37 s [extra] +++ OK, passed 1 test.
  15594. 973.37 s [extra] maximumOn id [] == undefined
  15595. 973.38 s [extra] +++ OK, passed 1 test.
  15596. 973.38 s [extra] maximumOn length ["test","extra","a"] == "extra"
  15597. 973.38 s [extra] +++ OK, passed 1 test.
  15598. 973.38 s [extra] minimumOn id [] == undefined
  15599. 973.38 s [extra] +++ OK, passed 1 test.
  15600. 973.38 s [extra] minimumOn length ["test","extra","a"] == "a"
  15601. 973.38 s [extra] +++ OK, passed 1 test.
  15602. 973.38 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  15603. 973.38 s [extra] +++ OK, passed 1 test.
  15604. 973.38 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  15605. 973.38 s [extra] +++ OK, passed 100 tests.
  15606. 973.38 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  15607. 973.39 s [extra] +++ OK, passed 100 tests.
  15608. 973.39 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15609. 973.39 s [extra] +++ OK, passed 1 test.
  15610. 973.39 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15611. 973.39 s [extra] +++ OK, passed 1 test.
  15612. 973.39 s [extra] sum' [1, 2, 3] == 6
  15613. 973.39 s [extra] +++ OK, passed 1 test.
  15614. 973.39 s [extra] sumOn' read ["1", "2", "3"] == 6
  15615. 973.39 s [extra] +++ OK, passed 1 test.
  15616. 973.39 s [extra] product' [1, 2, 4] == 8
  15617. 973.39 s [extra] +++ OK, passed 1 test.
  15618. 973.39 s [extra] productOn' read ["1", "2", "4"] == 8
  15619. 973.39 s [extra] +++ OK, passed 1 test.
  15620. 973.39 s [extra] merge "ace" "bd" == "abcde"
  15621. 973.39 s [extra] +++ OK, passed 1 test.
  15622. 973.39 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  15623. 973.39 s [extra] +++ OK, passed 100 tests.
  15624. 973.39 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  15625. 973.39 s [extra] +++ OK, passed 1 test.
  15626. 973.39 s [extra] replace "el" "e" "Hello" == "Helo"
  15627. 973.39 s [extra] +++ OK, passed 1 test.
  15628. 973.40 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  15629. 973.40 s [extra] +++ OK, passed 1 test.
  15630. 973.40 s [extra] replace "" "x" "" == "x"
  15631. 973.40 s [extra] +++ OK, passed 1 test.
  15632. 973.40 s [extra] \xs ys -> replace xs xs ys == ys
  15633. 973.40 s [extra] +++ OK, passed 100 tests.
  15634. 973.40 s [extra] breakEnd isLower "youRE" == ("you","RE")
  15635. 973.40 s [extra] +++ OK, passed 1 test.
  15636. 973.40 s [extra] breakEnd isLower "youre" == ("youre","")
  15637. 973.40 s [extra] +++ OK, passed 1 test.
  15638. 973.40 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  15639. 973.40 s [extra] +++ OK, passed 1 test.
  15640. 973.40 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  15641. 973.40 s [extra] +++ OK, passed 100 tests.
  15642. 973.40 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  15643. 973.41 s [extra] +++ OK, passed 1 test.
  15644. 973.41 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  15645. 973.41 s [extra] +++ OK, passed 1 test.
  15646. 973.41 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  15647. 973.41 s [extra] +++ OK, passed 100 tests.
  15648. 973.41 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  15649. 973.41 s [extra] +++ OK, passed 100 tests.
  15650. 973.41 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  15651. 973.41 s [extra] +++ OK, passed 1 test.
  15652. 973.41 s [extra] \s -> wordsBy isSpace s == words s
  15653. 973.41 s [extra] +++ OK, passed 100 tests.
  15654. 973.41 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  15655. 973.41 s [extra] +++ OK, passed 1 test.
  15656. 973.41 s [extra] \s -> linesBy (== '\n') s == lines s
  15657. 973.41 s [extra] +++ OK, passed 100 tests.
  15658. 973.42 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  15659. 973.42 s [extra] +++ OK, passed 1 test.
  15660. 973.42 s [extra] firstJust id [Nothing,Just 3] == Just 3
  15661. 973.42 s [extra] +++ OK, passed 1 test.
  15662. 973.42 s [extra] firstJust id [Nothing,Nothing] == Nothing
  15663. 973.42 s [extra] +++ OK, passed 1 test.
  15664. 973.42 s [extra] drop1 "" == ""
  15665. 973.42 s [extra] +++ OK, passed 1 test.
  15666. 973.42 s [extra] drop1 "test" == "est"
  15667. 973.42 s [extra] +++ OK, passed 1 test.
  15668. 973.42 s [extra] \xs -> drop 1 xs == drop1 xs
  15669. 973.42 s [extra] +++ OK, passed 100 tests.
  15670. 973.42 s [extra] dropEnd1 "" == ""
  15671. 973.42 s [extra] +++ OK, passed 1 test.
  15672. 973.42 s [extra] dropEnd1 "test" == "tes"
  15673. 973.42 s [extra] +++ OK, passed 1 test.
  15674. 973.42 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  15675. 973.42 s [extra] +++ OK, passed 100 tests.
  15676. 973.42 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  15677. 973.42 s [extra] +++ OK, passed 1 test.
  15678. 973.42 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  15679. 973.44 s [extra] +++ OK, passed 100 tests.
  15680. 973.44 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  15681. 973.44 s [extra] +++ OK, passed 1 test.
  15682. 973.44 s [extra] breakOn "/" "foobar" == ("foobar", "")
  15683. 973.44 s [extra] +++ OK, passed 1 test.
  15684. 973.44 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  15685. 973.45 s [extra] +++ OK, passed 100 tests.
  15686. 973.45 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  15687. 973.45 s [extra] +++ OK, passed 1 test.
  15688. 973.45 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  15689. 973.45 s [extra] +++ OK, passed 1 test.
  15690. 973.45 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  15691. 973.45 s [extra] +++ OK, passed 1 test.
  15692. 973.45 s [extra] splitOn "x" "x" == ["",""]
  15693. 973.45 s [extra] +++ OK, passed 1 test.
  15694. 973.45 s [extra] splitOn "x" "" == [""]
  15695. 973.45 s [extra] +++ OK, passed 1 test.
  15696. 973.45 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  15697. 973.45 s [extra] +++ OK, passed 100 tests; 15 discarded.
  15698. 973.45 s [extra] \c x -> splitOn [c] x == split (==c) x
  15699. 973.45 s [extra] +++ OK, passed 100 tests.
  15700. 973.45 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  15701. 973.45 s [extra] +++ OK, passed 1 test.
  15702. 973.45 s [extra] split (== 'a') "" == [""]
  15703. 973.45 s [extra] +++ OK, passed 1 test.
  15704. 973.45 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  15705. 973.45 s [extra] +++ OK, passed 1 test.
  15706. 973.45 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  15707. 973.45 s [extra] +++ OK, passed 1 test.
  15708. 973.45 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  15709. 973.45 s [extra] +++ OK, passed 1 test.
  15710. 973.45 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  15711. 973.45 s [extra] +++ OK, passed 1 test.
  15712. 973.45 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  15713. 973.45 s [extra] +++ OK, passed 1 test.
  15714. 973.45 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  15715. 973.45 s [extra] +++ OK, passed 1 test.
  15716. 973.45 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  15717. 973.45 s [extra] +++ OK, passed 1 test.
  15718. 973.46 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  15719. 973.46 s [extra] +++ OK, passed 1 test.
  15720. 973.46 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  15721. 973.46 s [extra] +++ OK, passed 1 test.
  15722. 973.46 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  15723. 973.46 s [extra] +++ OK, passed 1 test.
  15724. 973.46 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  15725. 973.46 s [extra] +++ OK, passed 1 test.
  15726. 973.46 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  15727. 973.46 s [extra] +++ OK, passed 1 test.
  15728. 973.46 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  15729. 973.46 s [extra] +++ OK, passed 1 test.
  15730. 973.46 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  15731. 973.46 s [extra] +++ OK, passed 1 test.
  15732. 973.46 s [extra] stripSuffix "" "baz" == Just "baz"
  15733. 973.46 s [extra] +++ OK, passed 1 test.
  15734. 973.46 s [extra] stripSuffix "foo" "quux" == Nothing
  15735. 973.46 s [extra] +++ OK, passed 1 test.
  15736. 973.46 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  15737. 973.46 s [extra] +++ OK, passed 1 test.
  15738. 973.46 s [extra] stripInfix "/" "foobar" == Nothing
  15739. 973.46 s [extra] +++ OK, passed 1 test.
  15740. 973.46 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  15741. 973.46 s [extra] +++ OK, passed 1 test.
  15742. 973.46 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  15743. 973.46 s [extra] +++ OK, passed 1 test.
  15744. 973.46 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  15745. 973.46 s [extra] +++ OK, passed 1 test.
  15746. 973.46 s [extra] chunksOf 8 "" == []
  15747. 973.46 s [extra] +++ OK, passed 1 test.
  15748. 973.46 s [extra] chunksOf 0 "test" == undefined
  15749. 973.46 s [extra] +++ OK, passed 1 test.
  15750. 973.46 s [extra] nubSort "this is a test" == " aehist"
  15751. 973.47 s [extra] +++ OK, passed 1 test.
  15752. 973.47 s [extra] \xs -> nubSort xs == nub (sort xs)
  15753. 973.47 s [extra] +++ OK, passed 100 tests.
  15754. 973.47 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  15755. 973.47 s [extra] +++ OK, passed 1 test.
  15756. 973.47 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  15757. 973.47 s [extra] +++ OK, passed 1 test.
  15758. 973.47 s [extra] nubOrd "this is a test" == "this ae"
  15759. 973.47 s [extra] +++ OK, passed 1 test.
  15760. 973.47 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  15761. 973.47 s [extra] +++ OK, passed 1 test.
  15762. 973.47 s [extra] \xs -> nubOrd xs == nub xs
  15763. 973.47 s [extra] +++ OK, passed 100 tests.
  15764. 973.47 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  15765. 973.47 s [extra] +++ OK, passed 1 test.
  15766. 973.47 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  15767. 973.47 s [extra] +++ OK, passed 1 test.
  15768. 973.47 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  15769. 973.47 s [extra] +++ OK, passed 1 test.
  15770. 973.47 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  15771. 973.47 s [extra] +++ OK, passed 1 test.
  15772. 973.47 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  15773. 973.47 s [extra] +++ OK, passed 1 test.
  15774. 973.47 s [extra] compareLength [1,2,3] 1 == GT
  15775. 973.47 s [extra] +++ OK, passed 1 test.
  15776. 973.47 s [extra] compareLength [1,2] 2 == EQ
  15777. 973.48 s [extra] +++ OK, passed 1 test.
  15778. 973.48 s [extra] \(xs :: [Int]) n -> compareLength xs n == compare (length xs) n
  15779. 973.48 s [extra] +++ OK, passed 100 tests.
  15780. 973.48 s [extra] compareLength (1:2:3:undefined) 2 == GT
  15781. 973.48 s [extra] +++ OK, passed 1 test.
  15782. 973.48 s [extra] comparingLength [1,2,3] [False] == GT
  15783. 973.48 s [extra] +++ OK, passed 1 test.
  15784. 973.48 s [extra] comparingLength [1,2] "ab" == EQ
  15785. 973.48 s [extra] +++ OK, passed 1 test.
  15786. 973.48 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  15787. 973.48 s [extra] +++ OK, passed 100 tests.
  15788. 973.48 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  15789. 973.48 s [extra] +++ OK, passed 1 test.
  15790. 973.48 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  15791. 973.48 s [extra] +++ OK, passed 1 test.
  15792. 973.48 s [extra] mwhen True "test" == "test"
  15793. 973.48 s [extra] +++ OK, passed 1 test.
  15794. 973.48 s [extra] mwhen False "test" == ""
  15795. 973.48 s [extra] +++ OK, passed 1 test.
  15796. 973.48 s [extra] first succ (1,"test") == (2,"test")
  15797. 973.48 s [extra] +++ OK, passed 1 test.
  15798. 973.48 s [extra] second reverse (1,"test") == (1,"tset")
  15799. 973.48 s [extra] +++ OK, passed 1 test.
  15800. 973.48 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  15801. 973.48 s [extra] +++ OK, passed 1 test.
  15802. 973.48 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  15803. 973.48 s [extra] +++ OK, passed 1 test.
  15804. 973.48 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  15805. 973.48 s [extra] +++ OK, passed 1 test.
  15806. 973.48 s [extra] (succ &&& pred) 1 == (2,0)
  15807. 973.48 s [extra] +++ OK, passed 1 test.
  15808. 973.48 s [extra] dupe 12 == (12, 12)
  15809. 973.48 s [extra] +++ OK, passed 1 test.
  15810. 973.48 s [extra] both succ (1,2) == (2,3)
  15811. 973.48 s [extra] +++ OK, passed 1 test.
  15812. 973.48 s [extra] first3 succ (1,1,1) == (2,1,1)
  15813. 973.48 s [extra] +++ OK, passed 1 test.
  15814. 973.48 s [extra] second3 succ (1,1,1) == (1,2,1)
  15815. 973.48 s [extra] +++ OK, passed 1 test.
  15816. 973.48 s [extra] third3 succ (1,1,1) == (1,1,2)
  15817. 973.48 s [extra] +++ OK, passed 1 test.
  15818. 973.48 s [extra] \x -> readVersion (showVersion x) == x
  15819. 973.49 s [extra] +++ OK, passed 100 tests.
  15820. 973.49 s [extra] readVersion "hello" == undefined
  15821. 973.49 s [extra] +++ OK, passed 1 test.
  15822. 973.49 s [extra] showDP 4 pi == "3.1416"
  15823. 973.49 s [extra] +++ OK, passed 1 test.
  15824. 973.49 s [extra] showDP 0 pi == "3"
  15825. 973.49 s [extra] +++ OK, passed 1 test.
  15826. 973.49 s [extra] showDP 2 3 == "3.00"
  15827. 973.49 s [extra] +++ OK, passed 1 test.
  15828. 973.49 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  15829. 973.49 s [extra] +++ OK, passed 1 test.
  15830. 973.49 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  15831. 973.49 s [extra] +++ OK, passed 1 test.
  15832. 973.49 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  15833. 973.49 s [extra] +++ OK, passed 1 test.
  15834. 973.49 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  15835. 973.49 s [extra] +++ OK, passed 1 test.
  15836. 973.49 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  15837. 973.49 s [extra] +++ OK, passed 1 test.
  15838. 973.49 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  15839. 973.49 s [extra] +++ OK, passed 1 test.
  15840. 973.49 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  15841. 973.49 s [extra] +++ OK, passed 1 test.
  15842. 973.49 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  15843. 973.49 s [extra] +++ OK, passed 1 test.
  15844. 973.49 s [extra] isWindows == (os == "mingw32")
  15845. 973.49 s [extra] +++ OK, passed 1 test.
  15846. 973.49 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  15847. 973.53 s [extra] +++ OK, passed 100 tests.
  15848. 973.53 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  15849. 973.58 s [extra] +++ OK, passed 100 tests.
  15850. 973.58 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  15851. 973.74 s [extra] +++ OK, passed 100 tests.
  15852. 973.74 s [extra] captureOutput (print 1) == pure ("1\n",())
  15853. 973.74 s [extra] +++ OK, passed 1 test.
  15854. 973.74 s [extra] withTempFile doesFileExist == pure True
  15855. 973.74 s [extra] +++ OK, passed 1 test.
  15856. 973.74 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  15857. 973.74 s [extra] +++ OK, passed 1 test.
  15858. 973.74 s [extra] withTempFile readFile' == pure ""
  15859. 973.74 s [extra] +++ OK, passed 1 test.
  15860. 973.74 s [extra] withTempDir doesDirectoryExist == pure True
  15861. 973.74 s [extra] +++ OK, passed 1 test.
  15862. 973.74 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  15863. 973.74 s [extra] +++ OK, passed 1 test.
  15864. 973.74 s [extra] withTempDir listFiles == pure []
  15865. 973.74 s [extra] +++ OK, passed 1 test.
  15866. 973.74 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  15867. 973.74 s [extra] +++ OK, passed 1 test.
  15868. 973.74 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  15869. 973.74 s [extra] +++ OK, passed 1 test.
  15870. 973.74 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  15871. 973.74 s [extra] +++ OK, passed 1 test.
  15872. 973.74 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  15873. 973.74 s [extra] +++ OK, passed 1 test.
  15874. 973.74 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  15875. 973.74 s [extra] +++ OK, passed 1 test.
  15876. 973.74 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  15877. 973.74 s [extra] +++ OK, passed 1 test.
  15878. 973.74 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  15879. 974.75 s [extra] +++ OK, passed 1 test.
  15880. 974.75 s [extra] timeout (-3) (print 1) == pure Nothing
  15881. 974.75 s [extra] +++ OK, passed 1 test.
  15882. 974.75 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  15883. 974.76 s [extra] +++ OK, passed 1 test.
  15884. 974.76 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  15885. 974.85 s [extra] 0.100584326
  15886. 974.85 s [extra] +++ OK, passed 1 test.
  15887. 974.85 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  15888. 974.96 s [extra] +++ OK, passed 1 test.
  15889. 975.04 s [extra] showDuration 3.435 == "3.44s"
  15890. 975.04 s [extra] +++ OK, passed 1 test.
  15891. 975.04 s [extra] showDuration 623.8 == "10m24s"
  15892. 975.04 s [extra] +++ OK, passed 1 test.
  15893. 975.04 s [extra] showDuration 62003.8 == "17h13m"
  15894. 975.04 s [extra] +++ OK, passed 1 test.
  15895. 975.04 s [extra] showDuration 1e8 == "27777h47m"
  15896. 975.04 s [extra] +++ OK, passed 1 test.
  15897. 975.04 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  15898. 975.04 s [extra] +++ OK, passed 1 test.
  15899. 975.04 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  15900. 975.97 s [extra] +++ OK, passed 1 test.
  15901. 975.97 s [extra] Extra export
  15902. 975.97 s [extra] +++ OK, passed 1 test.
  15903. 975.97 s [extra] withTempFile
  15904. 975.99 s [extra] ....done
  15905. 975.99 s [extra] withTempDir
  15906. 976.03 s [extra] ....done
  15907. 976.03 s [extra] retry
  15908. 976.03 s [extra] +++ OK, passed 1 test.
  15909. 976.03 s [extra] barrier
  15910. 976.03 s [extra] Success (323 tests)
  15911. 976.06 s [extra] Test suite extra-test: PASS
  15912. 976.06 s [extra] Test suite logged to: dist/test/extra-1.7.16-extra-test.log
  15913. 976.06 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  15914. 976.08 s [extra] Phase: haddockPhase
  15915. 976.51 s [extra] Preprocessing library for extra-1.7.16...
  15916. 976.53 s [extra] Running Haddock on library for extra-1.7.16...
  15917. 977.63 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  15918. 977.76 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  15919. 977.76 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  15920. 977.83 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  15921. 977.84 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  15922. 977.88 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  15923. 977.89 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  15924. 978.37 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  15925. 978.38 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  15926. 978.42 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  15927. 978.44 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  15928. 978.51 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  15929. 978.77 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  15930. 978.81 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  15931. 978.93 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  15932. 979.01 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  15933. 979.02 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  15934. 979.21 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  15935. 979.22 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  15936. 979.26 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  15937. 979.33 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  15938. 979.72 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  15939. 979.73 s [extra] Haddock coverage:
  15940. 979.74 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  15941. 979.74 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  15942. 979.75 s [extra] Warning: 'Arrow' is out of scope.
  15943. 979.75 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15944. 979.75 s [extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
  15945. 979.75 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  15946. 979.76 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  15947. 979.76 s [extra] Warning: '(:)' is out of scope.
  15948. 979.76 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15949. 979.77 s [extra] Warning: 'unzip' is ambiguous. It is defined
  15950. 979.77 s [extra] * in ‘GHC.Internal.Data.Functor’
  15951. 979.77 s [extra] * in ‘GHC.Internal.List’
  15952. 979.77 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15953. 979.77 s [extra] by specifying the type/value namespace explicitly.
  15954. 979.77 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  15955. 979.78 s [extra] Warning: 'firstJustM' is out of scope.
  15956. 979.78 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15957. 979.79 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  15958. 979.79 s [extra] Warning: 'Version' is ambiguous. It is defined
  15959. 979.79 s [extra] * in ‘GHC.Internal.Data.Version’
  15960. 979.79 s [extra] * in ‘GHC.Internal.Data.Version’
  15961. 979.79 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15962. 979.79 s [extra] by specifying the type/value namespace explicitly.
  15963. 979.79 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  15964. 979.79 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  15965. 979.81 s [extra] 100% ( 22 / 22) in 'Data.List.NonEmpty.Extra'
  15966. 979.81 s [extra] Warning: 'fromJust' is out of scope.
  15967. 979.81 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15968. 979.81 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  15969. 979.82 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  15970. 979.82 s [extra] * in ‘GHC.Internal.Exception’
  15971. 979.82 s [extra] * in ‘GHC.Internal.Exception’
  15972. 979.82 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15973. 979.82 s [extra] by specifying the type/value namespace explicitly.
  15974. 979.82 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  15975. 979.82 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  15976. 979.82 s [extra] * in ‘GHC.Internal.IO.Exception’
  15977. 979.82 s [extra] * in ‘GHC.Internal.IO.Exception’
  15978. 979.82 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15979. 979.82 s [extra] by specifying the type/value namespace explicitly.
  15980. 979.82 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  15981. 979.82 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  15982. 979.82 s [extra] * in ‘GHC.Internal.Exception.Type’
  15983. 979.82 s [extra] * in ‘GHC.Internal.Exception.Type’
  15984. 979.82 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15985. 979.82 s [extra] by specifying the type/value namespace explicitly.
  15986. 979.82 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  15987. 979.82 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  15988. 979.83 s [extra] Warning: 'partition' is out of scope.
  15989. 979.83 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15990. 979.83 s [extra] Warning: 'mconcatMap' is out of scope.
  15991. 979.83 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15992. 979.83 s [extra] Warning: 'find' is out of scope.
  15993. 979.83 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15994. 979.84 s [extra] 100% ( 38 / 38) in 'Control.Monad.Extra'
  15995. 979.84 s [extra] 92% ( 12 / 13) in 'Data.Foldable.Extra'
  15996. 979.84 s [extra] Missing documentation for:
  15997. 979.84 s [extra] Module header
  15998. 979.84 s [extra] Warning: 'Lock' is ambiguous. It is defined
  15999. 979.84 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  16000. 979.84 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  16001. 979.84 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16002. 979.84 s [extra] by specifying the type/value namespace explicitly.
  16003. 979.84 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  16004. 979.84 s [extra] Warning: 'Var' is ambiguous. It is defined
  16005. 979.84 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  16006. 979.84 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  16007. 979.84 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16008. 979.84 s [extra] by specifying the type/value namespace explicitly.
  16009. 979.84 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  16010. 979.84 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  16011. 979.84 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  16012. 979.84 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  16013. 979.84 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16014. 979.84 s [extra] by specifying the type/value namespace explicitly.
  16015. 979.84 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  16016. 979.85 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  16017. 979.85 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  16018. 979.85 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  16019. 979.86 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  16020. 979.87 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  16021. 979.87 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  16022. 979.87 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  16023. 979.88 s [extra] 100% (268 /268) in 'Extra'
  16024. 979.88 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  16025. 980.56 s [extra] Warning: Data.Tuple.Extra: could not find link destinations for:
  16026. 980.56 s [extra] - GHC.Internal.Generics.Rep1_Solo
  16027. 980.56 s [extra] - GHC.Internal.Generics.Rep_Solo
  16028. 991.55 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  16029. 991.73 s [extra] Preprocessing test suite 'extra-test' for extra-1.7.16...
  16030. 991.75 s [extra] Phase: installPhase
  16031. 992.06 s [extra] Installing library in /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  16032. 993.52 s [extra] Phase: fixupPhase
  16033. 993.65 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16
  16034. 993.67 s [extra] shrinking /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSextra-1.7.16-HtxlmSOYOkREEzHwSbWygl-ghc9.10.1.so
  16035. 993.68 s [extra] checking for references to /build/ in /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16...
  16036. 993.74 s [extra] patching script interpreter paths in /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16
  16037. 993.75 s [extra] stripping (with command strip and flags -S -p) in /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16/lib
  16038. 994.57 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/76mdglzvnsc3ihjpswqmm61p33rk1jy7-extra-1.7.16-doc
  16039. 994.61 s [extra] checking for references to /build/ in /nix/store/76mdglzvnsc3ihjpswqmm61p33rk1jy7-extra-1.7.16-doc...
  16040. 994.64 s [extra] patching script interpreter paths in /nix/store/76mdglzvnsc3ihjpswqmm61p33rk1jy7-extra-1.7.16-doc
  16041. 995.08 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/76mdglzvnsc3ihjpswqmm61p33rk1jy7-extra-1.7.16-doc /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16
  16042. 996.15 s [extra:post-build] Nothing to push - all store paths are already on Cachix.
  16043. 996.39 s [extra:post-build] Uploading to the NixCI cache: /nix/store/76mdglzvnsc3ihjpswqmm61p33rk1jy7-extra-1.7.16-doc /nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16
  16044. 996.86 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16045. 997.14 s [extra:post-build] copying 1 paths...
  16046. 997.17 s [extra:post-build] copying path '/nix/store/agf17x04v25yx718p1h93m96rjvff60w-extra-1.7.16' to 'https://cache.nix-ci.com'...
  16047. 1000.60 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16048. 1000.99 s [extra:post-build] copying 0 paths...
  16049. 1001.21 s Progress: 9 of 15 built, 155 of 155 downloaded from cache
  16050. 1001.34 s Building /nix/store/0bqmmvrdx7s2rbnk370pv5akckpwxpdc-algebraic-graphs-0.7.drv
  16051. 1001.63 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  16052. 1001.66 s [algebraic-graphs] Build with /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1.
  16053. 1002.22 s [algebraic-graphs] Phase: unpackPhase
  16054. 1002.23 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  16055. 1002.26 s [algebraic-graphs] source root is algebraic-graphs-0.7
  16056. 1002.29 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  16057. 1002.31 s [algebraic-graphs] Phase: patchPhase
  16058. 1002.33 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  16059. 1002.36 s [algebraic-graphs] Phase: compileBuildDriverPhase
  16060. 1002.38 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.Xcc1nhpETo/setup-package.conf.d -threaded
  16061. 1002.60 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.Xcc1nhpETo/Main.o )
  16062. 1002.81 s [algebraic-graphs] [2 of 2] Linking Setup
  16063. 1006.41 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  16064. 1006.45 s [algebraic-graphs] Phase: configurePhase
  16065. 1006.46 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/lq5jvc9ayfhbqzrmvndwj05z2hm1x6cj-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.Xcc1nhpETo/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/lib
  16066. 1006.50 s [algebraic-graphs] Using Parsec parser
  16067. 1006.50 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  16068. 1008.56 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.7.0
  16069. 1008.58 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.0.0
  16070. 1008.58 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  16071. 1008.58 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  16072. 1008.58 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  16073. 1008.58 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.14.3
  16074. 1008.58 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  16075. 1008.58 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.7.0
  16076. 1008.58 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.0.0
  16077. 1008.58 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  16078. 1008.58 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  16079. 1008.58 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.7.16
  16080. 1008.58 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.6: using
  16081. 1008.58 s [algebraic-graphs] inspection-testing-0.5.0.3
  16082. 1008.58 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  16083. 1008.58 s [algebraic-graphs] Source component graph:
  16084. 1008.58 s [algebraic-graphs] component lib
  16085. 1008.58 s [algebraic-graphs] component test:main dependency lib
  16086. 1008.58 s [algebraic-graphs] Configured component graph:
  16087. 1008.58 s [algebraic-graphs] component algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  16088. 1008.58 s [algebraic-graphs] include array-0.5.7.0-78f3
  16089. 1008.58 s [algebraic-graphs] include base-4.20.0.0-d8e2
  16090. 1008.58 s [algebraic-graphs] include containers-0.7-4cd1
  16091. 1008.58 s [algebraic-graphs] include deepseq-1.5.0.0-e78d
  16092. 1008.58 s [algebraic-graphs] include transformers-0.6.1.1-3641
  16093. 1008.58 s [algebraic-graphs] component algebraic-graphs-0.7-ZYkk2hry4M3K51Qy8WPm0-main
  16094. 1008.58 s [algebraic-graphs] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  16095. 1008.58 s [algebraic-graphs] include algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  16096. 1008.58 s [algebraic-graphs] include array-0.5.7.0-78f3
  16097. 1008.58 s [algebraic-graphs] include base-4.20.0.0-d8e2
  16098. 1008.58 s [algebraic-graphs] include containers-0.7-4cd1
  16099. 1008.58 s [algebraic-graphs] include deepseq-1.5.0.0-e78d
  16100. 1008.58 s [algebraic-graphs] include extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  16101. 1008.58 s [algebraic-graphs] include inspection-testing-0.5.0.3-5o4kBEt8exo71Akhwvk3Kr
  16102. 1008.58 s [algebraic-graphs] include transformers-0.6.1.1-3641
  16103. 1008.58 s [algebraic-graphs] Linked component graph:
  16104. 1008.58 s [algebraic-graphs] unit algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  16105. 1008.58 s [algebraic-graphs] include array-0.5.7.0-78f3
  16106. 1008.58 s [algebraic-graphs] include base-4.20.0.0-d8e2
  16107. 1008.58 s [algebraic-graphs] include containers-0.7-4cd1
  16108. 1008.58 s [algebraic-graphs] include deepseq-1.5.0.0-e78d
  16109. 1008.58 s [algebraic-graphs] include transformers-0.6.1.1-3641
  16110. 1008.58 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W:Data.Graph.Typed
  16111. 1008.59 s [algebraic-graphs] unit algebraic-graphs-0.7-ZYkk2hry4M3K51Qy8WPm0-main
  16112. 1008.59 s [algebraic-graphs] include QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  16113. 1008.59 s [algebraic-graphs] include algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  16114. 1008.59 s [algebraic-graphs] include array-0.5.7.0-78f3
  16115. 1008.59 s [algebraic-graphs] include base-4.20.0.0-d8e2
  16116. 1008.59 s [algebraic-graphs] include containers-0.7-4cd1
  16117. 1008.59 s [algebraic-graphs] include deepseq-1.5.0.0-e78d
  16118. 1008.59 s [algebraic-graphs] include extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  16119. 1008.59 s [algebraic-graphs] include inspection-testing-0.5.0.3-5o4kBEt8exo71Akhwvk3Kr
  16120. 1008.59 s [algebraic-graphs] include transformers-0.6.1.1-3641
  16121. 1008.59 s [algebraic-graphs] Ready component graph:
  16122. 1008.59 s [algebraic-graphs] definite algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  16123. 1008.59 s [algebraic-graphs] depends array-0.5.7.0-78f3
  16124. 1008.59 s [algebraic-graphs] depends base-4.20.0.0-d8e2
  16125. 1008.59 s [algebraic-graphs] depends containers-0.7-4cd1
  16126. 1008.59 s [algebraic-graphs] depends deepseq-1.5.0.0-e78d
  16127. 1008.59 s [algebraic-graphs] depends transformers-0.6.1.1-3641
  16128. 1008.59 s [algebraic-graphs] definite algebraic-graphs-0.7-ZYkk2hry4M3K51Qy8WPm0-main
  16129. 1008.59 s [algebraic-graphs] depends QuickCheck-2.14.3-2uWELCOV1VF22cqeVQwZIK
  16130. 1008.59 s [algebraic-graphs] depends algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  16131. 1008.59 s [algebraic-graphs] depends array-0.5.7.0-78f3
  16132. 1008.59 s [algebraic-graphs] depends base-4.20.0.0-d8e2
  16133. 1008.59 s [algebraic-graphs] depends containers-0.7-4cd1
  16134. 1008.59 s [algebraic-graphs] depends deepseq-1.5.0.0-e78d
  16135. 1008.59 s [algebraic-graphs] depends extra-1.7.16-HtxlmSOYOkREEzHwSbWygl
  16136. 1008.59 s [algebraic-graphs] depends inspection-testing-0.5.0.3-5o4kBEt8exo71Akhwvk3Kr
  16137. 1008.59 s [algebraic-graphs] depends transformers-0.6.1.1-3641
  16138. 1008.59 s [algebraic-graphs] Using Cabal-3.12.0.0 compiled by ghc-9.10
  16139. 1008.59 s [algebraic-graphs] Using compiler: ghc-9.10.1
  16140. 1008.59 s [algebraic-graphs] Using install prefix:
  16141. 1008.59 s [algebraic-graphs] /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7
  16142. 1008.59 s [algebraic-graphs] Executables installed in:
  16143. 1008.59 s [algebraic-graphs] /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/bin
  16144. 1008.59 s [algebraic-graphs] Libraries installed in:
  16145. 1008.59 s [algebraic-graphs] /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  16146. 1008.59 s [algebraic-graphs] Dynamic Libraries installed in:
  16147. 1008.59 s [algebraic-graphs] /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5
  16148. 1008.59 s [algebraic-graphs] Private executables installed in:
  16149. 1008.59 s [algebraic-graphs] /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.10.1-c9f5/algebraic-graphs-0.7
  16150. 1008.59 s [algebraic-graphs] Data files installed in:
  16151. 1008.59 s [algebraic-graphs] /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.10.1-c9f5/algebraic-graphs-0.7
  16152. 1008.59 s [algebraic-graphs] Documentation installed in:
  16153. 1008.59 s [algebraic-graphs] /nix/store/lq5jvc9ayfhbqzrmvndwj05z2hm1x6cj-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  16154. 1008.59 s [algebraic-graphs] Configuration files installed in:
  16155. 1008.59 s [algebraic-graphs] /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/etc
  16156. 1008.59 s [algebraic-graphs] No alex found
  16157. 1008.59 s [algebraic-graphs] Using ar found on system at:
  16158. 1008.59 s [algebraic-graphs] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  16159. 1008.59 s [algebraic-graphs] No c2hs found
  16160. 1008.59 s [algebraic-graphs] No cpphs found
  16161. 1008.59 s [algebraic-graphs] No doctest found
  16162. 1008.59 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  16163. 1008.59 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  16164. 1008.59 s [algebraic-graphs] Using ghc version 9.10.1 found on system at:
  16165. 1008.59 s [algebraic-graphs] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc
  16166. 1008.59 s [algebraic-graphs] Using ghc-pkg version 9.10.1 found on system at:
  16167. 1008.59 s [algebraic-graphs] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc-pkg-9.10.1
  16168. 1008.59 s [algebraic-graphs] No ghcjs found
  16169. 1008.59 s [algebraic-graphs] No ghcjs-pkg found
  16170. 1008.59 s [algebraic-graphs] No greencard found
  16171. 1008.59 s [algebraic-graphs] Using haddock version 2.28.0 found on system at:
  16172. 1008.59 s [algebraic-graphs] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/haddock-ghc-9.10.1
  16173. 1008.59 s [algebraic-graphs] No happy found
  16174. 1008.59 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  16175. 1008.59 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16176. 1008.59 s [algebraic-graphs] No hmake found
  16177. 1008.59 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  16178. 1008.62 s [algebraic-graphs] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hpc-ghc-9.10.1
  16179. 1008.62 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  16180. 1008.62 s [algebraic-graphs] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hsc2hs-ghc-9.10.1
  16181. 1008.62 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  16182. 1008.62 s [algebraic-graphs] /nix/store/c0gbcvjjvqzy92m9ycv6zcqiczs6bvyw-hscolour-1.25/bin/HsColour
  16183. 1008.62 s [algebraic-graphs] No jhc found
  16184. 1008.62 s [algebraic-graphs] Using ld found on system at:
  16185. 1008.62 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  16186. 1008.62 s [algebraic-graphs] No pkg-config found
  16187. 1008.62 s [algebraic-graphs] Using runghc version 9.10.1 found on system at:
  16188. 1008.62 s [algebraic-graphs] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/runghc-9.10.1
  16189. 1008.62 s [algebraic-graphs] Using strip version 2.44 found on system at:
  16190. 1008.62 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  16191. 1008.62 s [algebraic-graphs] Using tar found on system at:
  16192. 1008.62 s [algebraic-graphs] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  16193. 1008.62 s [algebraic-graphs] No uhc found
  16194. 1009.08 s [algebraic-graphs] Phase: buildPhase
  16195. 1009.48 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  16196. 1009.50 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  16197. 1009.80 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 )
  16198. 1014.32 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 )
  16199. 1017.97 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 )
  16200. 1019.75 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 )
  16201. 1019.76 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  16202. 1023.10 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 )
  16203. 1023.74 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 )
  16204. 1025.99 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 )
  16205. 1029.47 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 )
  16206. 1029.47 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 )
  16207. 1029.48 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 )
  16208. 1029.48 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16209. 1029.48 s [algebraic-graphs] In the use of ‘head’
  16210. 1029.48 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16211. 1029.48 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"."
  16212. 1029.48 s [algebraic-graphs] |
  16213. 1029.48 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16214. 1029.48 s [algebraic-graphs] | ^^^^
  16215. 1029.48 s [algebraic-graphs]
  16216. 1029.48 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16217. 1029.48 s [algebraic-graphs] In the use of ‘tail’
  16218. 1029.48 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16219. 1029.48 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"."
  16220. 1029.48 s [algebraic-graphs] |
  16221. 1029.48 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16222. 1029.48 s [algebraic-graphs] | ^^^^
  16223. 1029.48 s [algebraic-graphs]
  16224. 1029.48 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16225. 1029.48 s [algebraic-graphs] In the use of ‘head’
  16226. 1029.48 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16227. 1029.48 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"."
  16228. 1029.48 s [algebraic-graphs] |
  16229. 1029.48 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16230. 1029.48 s [algebraic-graphs] | ^^^^
  16231. 1029.48 s [algebraic-graphs]
  16232. 1029.48 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16233. 1029.48 s [algebraic-graphs] In the use of ‘tail’
  16234. 1029.48 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16235. 1029.48 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"."
  16236. 1029.48 s [algebraic-graphs] |
  16237. 1029.48 s [algebraic-graphs] 397 | bnd' = tail bnd
  16238. 1029.48 s [algebraic-graphs] | ^^^^
  16239. 1029.48 s [algebraic-graphs]
  16240. 1029.48 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 )
  16241. 1029.48 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 )
  16242. 1029.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16243. 1029.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16244. 1029.48 s [algebraic-graphs] will become an error in a future GHC release.
  16245. 1029.48 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16246. 1029.48 s [algebraic-graphs] |
  16247. 1029.48 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16248. 1029.48 s [algebraic-graphs] | ^
  16249. 1029.48 s [algebraic-graphs]
  16250. 1029.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16251. 1029.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16252. 1029.48 s [algebraic-graphs] will become an error in a future GHC release.
  16253. 1029.48 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16254. 1029.48 s [algebraic-graphs] |
  16255. 1029.48 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16256. 1029.48 s [algebraic-graphs] | ^
  16257. 1029.48 s [algebraic-graphs]
  16258. 1029.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16259. 1029.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16260. 1029.48 s [algebraic-graphs] will become an error in a future GHC release.
  16261. 1029.48 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16262. 1029.48 s [algebraic-graphs] |
  16263. 1029.48 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16264. 1029.48 s [algebraic-graphs] | ^
  16265. 1029.48 s [algebraic-graphs]
  16266. 1029.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16267. 1029.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16268. 1029.48 s [algebraic-graphs] will become an error in a future GHC release.
  16269. 1029.48 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16270. 1029.48 s [algebraic-graphs] |
  16271. 1029.48 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16272. 1029.48 s [algebraic-graphs] | ^
  16273. 1029.48 s [algebraic-graphs]
  16274. 1029.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16275. 1029.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16276. 1029.48 s [algebraic-graphs] will become an error in a future GHC release.
  16277. 1029.48 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16278. 1029.48 s [algebraic-graphs] |
  16279. 1029.48 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16280. 1029.48 s [algebraic-graphs] | ^
  16281. 1029.48 s [algebraic-graphs]
  16282. 1029.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16283. 1029.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16284. 1029.48 s [algebraic-graphs] will become an error in a future GHC release.
  16285. 1029.48 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16286. 1029.48 s [algebraic-graphs] |
  16287. 1029.48 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16288. 1029.48 s [algebraic-graphs] | ^
  16289. 1029.48 s [algebraic-graphs]
  16290. 1029.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16291. 1029.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16292. 1029.48 s [algebraic-graphs] will become an error in a future GHC release.
  16293. 1029.48 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16294. 1029.48 s [algebraic-graphs] |
  16295. 1029.48 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16296. 1029.48 s [algebraic-graphs] | ^
  16297. 1029.48 s [algebraic-graphs]
  16298. 1029.48 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 )
  16299. 1030.06 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 )
  16300. 1031.48 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 )
  16301. 1031.50 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 )
  16302. 1031.50 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 )
  16303. 1031.55 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 )
  16304. 1031.96 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 )
  16305. 1033.01 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 )
  16306. 1033.01 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16307. 1033.01 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16308. 1033.01 s [algebraic-graphs] will become an error in a future GHC release.
  16309. 1033.01 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16310. 1033.01 s [algebraic-graphs] |
  16311. 1033.01 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16312. 1033.01 s [algebraic-graphs] | ^
  16313. 1033.01 s [algebraic-graphs]
  16314. 1033.01 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 )
  16315. 1033.01 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16316. 1033.01 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16317. 1033.02 s [algebraic-graphs] will become an error in a future GHC release.
  16318. 1033.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16319. 1033.02 s [algebraic-graphs] |
  16320. 1033.02 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16321. 1033.02 s [algebraic-graphs] | ^
  16322. 1033.02 s [algebraic-graphs]
  16323. 1033.02 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16324. 1033.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16325. 1033.02 s [algebraic-graphs] will become an error in a future GHC release.
  16326. 1033.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16327. 1033.02 s [algebraic-graphs] |
  16328. 1033.02 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16329. 1033.02 s [algebraic-graphs] | ^
  16330. 1033.02 s [algebraic-graphs]
  16331. 1033.02 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 )
  16332. 1033.02 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 )
  16333. 1033.49 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 )
  16334. 1033.85 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 )
  16335. 1034.05 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 )
  16336. 1034.05 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 )
  16337. 1034.12 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 )
  16338. 1034.88 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  16339. 1038.49 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  16340. 1043.34 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 )
  16341. 1045.22 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  16342. 1045.22 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  16343. 1048.86 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 )
  16344. 1050.13 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 )
  16345. 1051.80 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 )
  16346. 1054.93 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  16347. 1054.93 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 )
  16348. 1054.93 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 )
  16349. 1054.93 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16350. 1054.93 s [algebraic-graphs] In the use of ‘head’
  16351. 1054.93 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16352. 1054.93 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"."
  16353. 1054.93 s [algebraic-graphs] |
  16354. 1054.93 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16355. 1054.93 s [algebraic-graphs] | ^^^^
  16356. 1054.93 s [algebraic-graphs]
  16357. 1054.93 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16358. 1054.93 s [algebraic-graphs] In the use of ‘tail’
  16359. 1054.93 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16360. 1054.93 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"."
  16361. 1054.93 s [algebraic-graphs] |
  16362. 1054.93 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16363. 1054.94 s [algebraic-graphs] | ^^^^
  16364. 1054.94 s [algebraic-graphs]
  16365. 1054.94 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16366. 1054.94 s [algebraic-graphs] In the use of ‘head’
  16367. 1054.94 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16368. 1054.94 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"."
  16369. 1054.94 s [algebraic-graphs] |
  16370. 1054.94 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16371. 1054.94 s [algebraic-graphs] | ^^^^
  16372. 1054.94 s [algebraic-graphs]
  16373. 1054.94 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16374. 1054.94 s [algebraic-graphs] In the use of ‘tail’
  16375. 1054.94 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16376. 1054.94 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"."
  16377. 1054.94 s [algebraic-graphs] |
  16378. 1054.94 s [algebraic-graphs] 397 | bnd' = tail bnd
  16379. 1054.94 s [algebraic-graphs] | ^^^^
  16380. 1054.94 s [algebraic-graphs]
  16381. 1054.94 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 )
  16382. 1054.94 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  16383. 1054.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16384. 1054.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16385. 1054.94 s [algebraic-graphs] will become an error in a future GHC release.
  16386. 1054.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16387. 1054.94 s [algebraic-graphs] |
  16388. 1054.94 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16389. 1054.94 s [algebraic-graphs] | ^
  16390. 1054.94 s [algebraic-graphs]
  16391. 1054.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16392. 1054.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16393. 1054.94 s [algebraic-graphs] will become an error in a future GHC release.
  16394. 1054.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16395. 1054.94 s [algebraic-graphs] |
  16396. 1054.94 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16397. 1054.94 s [algebraic-graphs] | ^
  16398. 1054.94 s [algebraic-graphs]
  16399. 1054.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16400. 1054.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16401. 1054.94 s [algebraic-graphs] will become an error in a future GHC release.
  16402. 1054.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16403. 1054.94 s [algebraic-graphs] |
  16404. 1054.94 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16405. 1054.94 s [algebraic-graphs] | ^
  16406. 1054.94 s [algebraic-graphs]
  16407. 1054.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16408. 1054.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16409. 1054.94 s [algebraic-graphs] will become an error in a future GHC release.
  16410. 1054.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16411. 1054.94 s [algebraic-graphs] |
  16412. 1054.94 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16413. 1054.94 s [algebraic-graphs] | ^
  16414. 1054.94 s [algebraic-graphs]
  16415. 1054.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16416. 1054.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16417. 1054.94 s [algebraic-graphs] will become an error in a future GHC release.
  16418. 1054.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16419. 1054.94 s [algebraic-graphs] |
  16420. 1054.94 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16421. 1054.94 s [algebraic-graphs] | ^
  16422. 1054.94 s [algebraic-graphs]
  16423. 1054.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16424. 1054.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16425. 1054.94 s [algebraic-graphs] will become an error in a future GHC release.
  16426. 1054.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16427. 1054.94 s [algebraic-graphs] |
  16428. 1054.94 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16429. 1054.94 s [algebraic-graphs] | ^
  16430. 1054.94 s [algebraic-graphs]
  16431. 1054.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16432. 1054.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16433. 1054.94 s [algebraic-graphs] will become an error in a future GHC release.
  16434. 1054.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16435. 1054.94 s [algebraic-graphs] |
  16436. 1054.94 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16437. 1054.94 s [algebraic-graphs] | ^
  16438. 1054.94 s [algebraic-graphs]
  16439. 1054.94 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  16440. 1055.73 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 )
  16441. 1057.02 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  16442. 1057.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 )
  16443. 1057.06 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  16444. 1059.05 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 )
  16445. 1060.40 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 )
  16446. 1060.83 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  16447. 1060.83 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16448. 1060.83 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16449. 1060.83 s [algebraic-graphs] will become an error in a future GHC release.
  16450. 1060.83 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16451. 1060.83 s [algebraic-graphs] |
  16452. 1060.84 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16453. 1060.84 s [algebraic-graphs] | ^
  16454. 1060.84 s [algebraic-graphs]
  16455. 1060.85 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 )
  16456. 1060.85 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16457. 1060.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16458. 1060.85 s [algebraic-graphs] will become an error in a future GHC release.
  16459. 1060.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16460. 1060.85 s [algebraic-graphs] |
  16461. 1060.85 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16462. 1060.85 s [algebraic-graphs] | ^
  16463. 1060.85 s [algebraic-graphs]
  16464. 1060.85 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16465. 1060.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16466. 1060.85 s [algebraic-graphs] will become an error in a future GHC release.
  16467. 1060.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16468. 1060.85 s [algebraic-graphs] |
  16469. 1060.85 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16470. 1060.85 s [algebraic-graphs] | ^
  16471. 1060.85 s [algebraic-graphs]
  16472. 1060.85 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  16473. 1060.85 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  16474. 1060.85 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 )
  16475. 1061.32 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 )
  16476. 1061.39 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 )
  16477. 1061.51 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 )
  16478. 1061.51 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  16479. 1064.21 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  16480. 1064.23 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  16481. 1064.56 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 )
  16482. 1068.53 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 )
  16483. 1078.87 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 )
  16484. 1078.88 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 )
  16485. 1080.01 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 )
  16486. 1085.35 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 )
  16487. 1085.37 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 )
  16488. 1085.37 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 )
  16489. 1093.95 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 )
  16490. 1094.76 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 )
  16491. 1094.77 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 )
  16492. 1096.83 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 )
  16493. 1096.83 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 )
  16494. 1096.83 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 )
  16495. 1099.14 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 )
  16496. 1099.16 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 )
  16497. 1099.16 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 )
  16498. 1099.16 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 )
  16499. 1099.16 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 )
  16500. 1099.16 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 )
  16501. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  16502. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  16503. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  16504. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  16505. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  16506. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  16507. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  16508. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  16509. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  16510. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  16511. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  16512. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  16513. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16514. 1099.16 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  16515. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  16516. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  16517. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  16518. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  16519. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  16520. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  16521. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  16522. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  16523. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  16524. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16525. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  16526. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16527. 1099.17 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  16528. 1099.18 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  16529. 1099.18 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  16530. 1099.18 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  16531. 1099.18 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  16532. 1099.18 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  16533. 1099.19 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  16534. 1099.19 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  16535. 1099.19 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  16536. 1099.19 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  16537. 1099.19 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  16538. 1099.19 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16539. 1099.19 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  16540. 1099.19 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  16541. 1099.20 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16542. 1099.20 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  16543. 1099.20 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  16544. 1099.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  16545. 1099.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  16546. 1099.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  16547. 1099.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  16548. 1099.26 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16549. 1099.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  16550. 1099.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  16551. 1099.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  16552. 1099.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  16553. 1099.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  16554. 1099.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  16555. 1099.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  16556. 1099.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  16557. 1099.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  16558. 1099.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  16559. 1099.28 s [algebraic-graphs] inspection testing successful
  16560. 1099.28 s [algebraic-graphs] expected successes: 58
  16561. 1099.28 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 )
  16562. 1099.28 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 )
  16563. 1099.28 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 )
  16564. 1101.37 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  16565. 1103.73 s [algebraic-graphs] buildPhase completed in 1 minutes 35 seconds
  16566. 1103.73 s [algebraic-graphs] Phase: checkPhase
  16567. 1104.43 s [algebraic-graphs] Running 1 test suites...
  16568. 1104.43 s [algebraic-graphs] Test suite main: RUNNING...
  16569. 1130.14 s [algebraic-graphs]
  16570. 1130.14 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  16571. 1130.16 s [algebraic-graphs] OK: show empty == "empty"
  16572. 1130.16 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  16573. 1130.16 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  16574. 1130.16 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  16575. 1130.16 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  16576. 1130.16 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  16577. 1130.16 s [algebraic-graphs]
  16578. 1130.16 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  16579. 1130.16 s [algebraic-graphs] OK: fromAcyclic empty == empty
  16580. 1130.16 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  16581. 1130.16 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  16582. 1130.16 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  16583. 1130.16 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  16584. 1130.16 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  16585. 1130.16 s [algebraic-graphs]
  16586. 1130.16 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  16587. 1130.16 s [algebraic-graphs] OK: isEmpty empty == True
  16588. 1130.16 s [algebraic-graphs] OK: hasVertex x empty == False
  16589. 1130.16 s [algebraic-graphs] OK: vertexCount empty == 0
  16590. 1130.16 s [algebraic-graphs] OK: edgeCount empty == 0
  16591. 1130.16 s [algebraic-graphs]
  16592. 1130.16 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  16593. 1130.16 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16594. 1130.16 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16595. 1130.16 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16596. 1130.16 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16597. 1130.16 s [algebraic-graphs]
  16598. 1130.16 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  16599. 1130.16 s [algebraic-graphs] OK: vertices [] == empty
  16600. 1130.16 s [algebraic-graphs] OK: vertices [x] == vertex x
  16601. 1130.16 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  16602. 1130.16 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  16603. 1130.16 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16604. 1130.16 s [algebraic-graphs]
  16605. 1130.16 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  16606. 1130.16 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  16607. 1130.16 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  16608. 1130.16 s [algebraic-graphs]
  16609. 1130.16 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  16610. 1130.16 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  16611. 1130.16 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  16612. 1130.16 s [algebraic-graphs]
  16613. 1130.16 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  16614. 1130.16 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  16615. 1130.16 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  16616. 1130.16 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  16617. 1130.16 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  16618. 1130.17 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  16619. 1130.17 s [algebraic-graphs]
  16620. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  16621. 1130.17 s [algebraic-graphs] OK: isEmpty empty == True
  16622. 1130.17 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16623. 1130.17 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  16624. 1130.17 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  16625. 1130.17 s [algebraic-graphs]
  16626. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  16627. 1130.17 s [algebraic-graphs] OK: hasVertex x empty == False
  16628. 1130.17 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16629. 1130.17 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  16630. 1130.17 s [algebraic-graphs]
  16631. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  16632. 1130.17 s [algebraic-graphs] OK: hasEdge x y empty == False
  16633. 1130.17 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  16634. 1130.17 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  16635. 1130.17 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  16636. 1130.17 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  16637. 1130.17 s [algebraic-graphs]
  16638. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  16639. 1130.17 s [algebraic-graphs] OK: vertexCount empty == 0
  16640. 1130.17 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16641. 1130.17 s [algebraic-graphs] OK: vertexCount == length . vertexList
  16642. 1130.17 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  16643. 1130.17 s [algebraic-graphs]
  16644. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  16645. 1130.17 s [algebraic-graphs] OK: edgeCount empty == 0
  16646. 1130.17 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16647. 1130.17 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  16648. 1130.17 s [algebraic-graphs] OK: edgeCount == length . edgeList
  16649. 1130.17 s [algebraic-graphs]
  16650. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  16651. 1130.17 s [algebraic-graphs] OK: vertexList empty == []
  16652. 1130.17 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  16653. 1130.17 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  16654. 1130.17 s [algebraic-graphs]
  16655. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  16656. 1130.17 s [algebraic-graphs] OK: edgeList empty == []
  16657. 1130.17 s [algebraic-graphs] OK: edgeList (vertex x) == []
  16658. 1130.17 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  16659. 1130.17 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  16660. 1130.17 s [algebraic-graphs]
  16661. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  16662. 1130.17 s [algebraic-graphs] OK: adjacencyList empty == []
  16663. 1130.17 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  16664. 1130.17 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  16665. 1130.17 s [algebraic-graphs]
  16666. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  16667. 1130.17 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  16668. 1130.17 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  16669. 1130.17 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16670. 1130.17 s [algebraic-graphs]
  16671. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  16672. 1130.17 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  16673. 1130.17 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  16674. 1130.17 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  16675. 1130.17 s [algebraic-graphs]
  16676. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  16677. 1130.17 s [algebraic-graphs] OK: preSet x empty == Set.empty
  16678. 1130.17 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  16679. 1130.17 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  16680. 1130.17 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  16681. 1130.17 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  16682. 1130.17 s [algebraic-graphs]
  16683. 1130.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  16684. 1130.17 s [algebraic-graphs] OK: postSet x empty == Set.empty
  16685. 1130.18 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  16686. 1130.18 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  16687. 1130.18 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  16688. 1130.18 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  16689. 1130.18 s [algebraic-graphs]
  16690. 1130.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  16691. 1130.18 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  16692. 1130.18 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  16693. 1130.18 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  16694. 1130.18 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  16695. 1130.18 s [algebraic-graphs]
  16696. 1130.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  16697. 1130.18 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  16698. 1130.18 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  16699. 1130.18 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  16700. 1130.18 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  16701. 1130.18 s [algebraic-graphs]
  16702. 1130.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  16703. 1130.18 s [algebraic-graphs] OK: transpose empty == empty
  16704. 1130.18 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  16705. 1130.18 s [algebraic-graphs] OK: transpose . transpose == id
  16706. 1130.19 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  16707. 1130.19 s [algebraic-graphs]
  16708. 1130.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  16709. 1130.19 s [algebraic-graphs] OK: induce (const True ) x == x
  16710. 1130.19 s [algebraic-graphs] OK: induce (const False) x == empty
  16711. 1130.19 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  16712. 1130.19 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  16713. 1130.19 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  16714. 1130.19 s [algebraic-graphs]
  16715. 1130.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  16716. 1130.19 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  16717. 1130.19 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  16718. 1130.19 s [algebraic-graphs]
  16719. 1130.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  16720. 1130.19 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  16721. 1130.19 s [algebraic-graphs]
  16722. 1130.19 s [algebraic-graphs] OK: box x y ~~ box y x
  16723. 1130.19 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  16724. 1130.19 s [algebraic-graphs] OK: box x empty ~~ empty
  16725. 1130.19 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  16726. 1130.19 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  16727. 1130.19 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  16728. 1130.19 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  16729. 1130.19 s [algebraic-graphs]
  16730. 1130.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  16731. 1130.19 s [algebraic-graphs] OK: transitiveClosure empty == empty
  16732. 1130.19 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  16733. 1130.19 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  16734. 1130.19 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  16735. 1130.19 s [algebraic-graphs]
  16736. 1130.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  16737. 1130.19 s [algebraic-graphs] OK: topSort empty == []
  16738. 1130.19 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  16739. 1130.19 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  16740. 1130.19 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  16741. 1130.19 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  16742. 1130.19 s [algebraic-graphs]
  16743. 1130.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  16744. 1130.19 s [algebraic-graphs] OK: scc empty == empty
  16745. 1130.19 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  16746. 1130.19 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  16747. 1130.19 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  16748. 1130.19 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  16749. 1130.19 s [algebraic-graphs]
  16750. 1130.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  16751. 1130.19 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  16752. 1130.19 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  16753. 1130.19 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  16754. 1130.19 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  16755. 1130.19 s [algebraic-graphs]
  16756. 1130.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  16757. 1130.19 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  16758. 1130.19 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  16759. 1130.19 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  16760. 1130.19 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  16761. 1130.19 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  16762. 1130.19 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  16763. 1141.14 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  16764. 1141.14 s [algebraic-graphs]
  16765. 1141.14 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  16766. 1141.16 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  16767. 1141.16 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  16768. 1141.16 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  16769. 1141.16 s [algebraic-graphs]
  16770. 1141.16 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  16771. 1141.16 s [algebraic-graphs] OK: Arbitrary
  16772. 1141.16 s [algebraic-graphs] OK: empty
  16773. 1141.16 s [algebraic-graphs] OK: vertex
  16774. 1141.16 s [algebraic-graphs] OK: vertices
  16775. 1141.16 s [algebraic-graphs] OK: union
  16776. 1141.16 s [algebraic-graphs] OK: join
  16777. 1141.16 s [algebraic-graphs] OK: transpose
  16778. 1141.16 s [algebraic-graphs] OK: box
  16779. 1141.16 s [algebraic-graphs] OK: transitiveClosure
  16780. 1141.16 s [algebraic-graphs] OK: scc
  16781. 1141.16 s [algebraic-graphs] OK: toAcyclic
  16782. 1141.16 s [algebraic-graphs] OK: toAcyclicOrd
  16783. 1141.16 s [algebraic-graphs]
  16784. 1141.16 s [algebraic-graphs] ============ AdjacencyIntMap ============
  16785. 1141.16 s [algebraic-graphs] OK: Axioms of graphs
  16786. 1141.16 s [algebraic-graphs]
  16787. 1141.16 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  16788. 1141.17 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  16789. 1141.17 s [algebraic-graphs]
  16790. 1141.17 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  16791. 1141.17 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  16792. 1141.17 s [algebraic-graphs]
  16793. 1141.17 s [algebraic-graphs] OK: consistent empty == True
  16794. 1141.17 s [algebraic-graphs] OK: consistent (vertex x) == True
  16795. 1141.17 s [algebraic-graphs] OK: consistent (overlay x y) == True
  16796. 1141.17 s [algebraic-graphs] OK: consistent (connect x y) == True
  16797. 1141.17 s [algebraic-graphs] OK: consistent (edge x y) == True
  16798. 1141.17 s [algebraic-graphs] OK: consistent (edges xs) == True
  16799. 1141.17 s [algebraic-graphs] OK: consistent (stars xs) == True
  16800. 1141.17 s [algebraic-graphs]
  16801. 1141.17 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  16802. 1141.17 s [algebraic-graphs] OK: show (empty ) == "empty"
  16803. 1141.17 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  16804. 1141.17 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  16805. 1141.17 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  16806. 1141.17 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  16807. 1141.17 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  16808. 1141.17 s [algebraic-graphs]
  16809. 1141.17 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  16810. 1141.17 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  16811. 1141.17 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  16812. 1141.17 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  16813. 1141.17 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  16814. 1141.17 s [algebraic-graphs]
  16815. 1141.17 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  16816. 1141.17 s [algebraic-graphs] OK: vertex 1 < vertex 2
  16817. 1141.17 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  16818. 1141.17 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  16819. 1141.18 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  16820. 1141.18 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  16821. 1141.18 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  16822. 1141.18 s [algebraic-graphs] OK: x <= x + y
  16823. 1141.18 s [algebraic-graphs] OK: x + y <= x * y
  16824. 1141.18 s [algebraic-graphs]
  16825. 1141.18 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  16826. 1141.18 s [algebraic-graphs] OK: isEmpty empty == True
  16827. 1141.18 s [algebraic-graphs] OK: hasVertex x empty == False
  16828. 1141.18 s [algebraic-graphs] OK: vertexCount empty == 0
  16829. 1141.18 s [algebraic-graphs] OK: edgeCount empty == 0
  16830. 1141.18 s [algebraic-graphs]
  16831. 1141.18 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  16832. 1141.18 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16833. 1141.18 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16834. 1141.18 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16835. 1141.18 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16836. 1141.18 s [algebraic-graphs]
  16837. 1141.18 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  16838. 1141.18 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  16839. 1141.18 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  16840. 1141.19 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  16841. 1141.19 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  16842. 1141.19 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  16843. 1141.19 s [algebraic-graphs]
  16844. 1141.19 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  16845. 1141.19 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  16846. 1141.19 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  16847. 1141.19 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  16848. 1141.19 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  16849. 1141.19 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  16850. 1141.19 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  16851. 1141.19 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  16852. 1141.19 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  16853. 1141.19 s [algebraic-graphs]
  16854. 1141.19 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  16855. 1141.19 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  16856. 1141.19 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  16857. 1141.19 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  16858. 1141.19 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  16859. 1141.19 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  16860. 1141.19 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  16861. 1141.19 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  16862. 1141.19 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  16863. 1141.19 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  16864. 1141.19 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  16865. 1141.19 s [algebraic-graphs]
  16866. 1141.19 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  16867. 1141.19 s [algebraic-graphs] OK: vertices [] == empty
  16868. 1141.19 s [algebraic-graphs] OK: vertices [x] == vertex x
  16869. 1141.19 s [algebraic-graphs] OK: vertices == overlays . map vertex
  16870. 1141.19 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  16871. 1141.19 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  16872. 1141.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16873. 1141.19 s [algebraic-graphs]
  16874. 1141.19 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  16875. 1141.19 s [algebraic-graphs] OK: edges [] == empty
  16876. 1141.19 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  16877. 1141.19 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  16878. 1141.19 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  16879. 1141.19 s [algebraic-graphs]
  16880. 1141.19 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  16881. 1141.19 s [algebraic-graphs] OK: overlays [] == empty
  16882. 1141.19 s [algebraic-graphs] OK: overlays [x] == x
  16883. 1141.19 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  16884. 1141.19 s [algebraic-graphs] OK: overlays == foldr overlay empty
  16885. 1141.19 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  16886. 1141.19 s [algebraic-graphs]
  16887. 1141.19 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  16888. 1141.19 s [algebraic-graphs] OK: connects [] == empty
  16889. 1141.19 s [algebraic-graphs] OK: connects [x] == x
  16890. 1141.19 s [algebraic-graphs] OK: connects [x,y] == connect x y
  16891. 1141.19 s [algebraic-graphs] OK: connects == foldr connect empty
  16892. 1141.19 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  16893. 1141.19 s [algebraic-graphs]
  16894. 1141.19 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  16895. 1141.19 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  16896. 1141.19 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  16897. 1141.19 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  16898. 1141.19 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  16899. 1141.19 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  16900. 1141.19 s [algebraic-graphs]
  16901. 1141.20 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  16902. 1141.20 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  16903. 1141.20 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  16904. 1141.20 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  16905. 1141.20 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  16906. 1141.20 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  16907. 1141.20 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  16908. 1141.20 s [algebraic-graphs]
  16909. 1141.20 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  16910. 1141.20 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  16911. 1141.20 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  16912. 1141.20 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  16913. 1141.20 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  16914. 1141.20 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  16915. 1141.20 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  16916. 1141.20 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  16917. 1141.20 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  16918. 1141.20 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  16919. 1141.20 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  16920. 1141.20 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  16921. 1141.20 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  16922. 1141.20 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  16923. 1141.20 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  16924. 1141.20 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  16925. 1141.20 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  16926. 1141.20 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  16927. 1141.20 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  16928. 1141.20 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  16929. 1141.20 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  16930. 1141.20 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  16931. 1141.20 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  16932. 1141.20 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  16933. 1141.20 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  16934. 1141.20 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  16935. 1141.20 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  16936. 1141.20 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  16937. 1141.20 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  16938. 1141.20 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  16939. 1141.20 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  16940. 1141.20 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  16941. 1141.20 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  16942. 1141.20 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  16943. 1141.20 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  16944. 1142.51 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  16945. 1142.51 s [algebraic-graphs]
  16946. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  16947. 1142.51 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  16948. 1142.51 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  16949. 1142.51 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  16950. 1142.51 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  16951. 1142.51 s [algebraic-graphs]
  16952. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  16953. 1142.51 s [algebraic-graphs] OK: isEmpty empty == True
  16954. 1142.51 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  16955. 1142.51 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16956. 1142.51 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  16957. 1142.51 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  16958. 1142.51 s [algebraic-graphs]
  16959. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  16960. 1142.51 s [algebraic-graphs] OK: hasVertex x empty == False
  16961. 1142.51 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16962. 1142.51 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  16963. 1142.51 s [algebraic-graphs]
  16964. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  16965. 1142.51 s [algebraic-graphs] OK: hasEdge x y empty == False
  16966. 1142.51 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  16967. 1142.51 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  16968. 1142.51 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  16969. 1142.51 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  16970. 1142.51 s [algebraic-graphs]
  16971. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  16972. 1142.51 s [algebraic-graphs] OK: vertexCount empty == 0
  16973. 1142.51 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16974. 1142.51 s [algebraic-graphs] OK: vertexCount == length . vertexList
  16975. 1142.51 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  16976. 1142.51 s [algebraic-graphs]
  16977. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  16978. 1142.51 s [algebraic-graphs] OK: edgeCount empty == 0
  16979. 1142.51 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16980. 1142.51 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  16981. 1142.51 s [algebraic-graphs] OK: edgeCount == length . edgeList
  16982. 1142.51 s [algebraic-graphs]
  16983. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  16984. 1142.51 s [algebraic-graphs] OK: vertexList empty == []
  16985. 1142.51 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  16986. 1142.51 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  16987. 1142.51 s [algebraic-graphs]
  16988. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  16989. 1142.51 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  16990. 1142.51 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  16991. 1142.51 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16992. 1142.51 s [algebraic-graphs]
  16993. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  16994. 1142.51 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  16995. 1142.51 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  16996. 1142.51 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  16997. 1142.51 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  16998. 1142.51 s [algebraic-graphs]
  16999. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  17000. 1142.51 s [algebraic-graphs] OK: edgeList empty == []
  17001. 1142.51 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17002. 1142.51 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17003. 1142.51 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17004. 1142.51 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17005. 1142.51 s [algebraic-graphs]
  17006. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  17007. 1142.51 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17008. 1142.51 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17009. 1142.51 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17010. 1142.51 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17011. 1142.51 s [algebraic-graphs]
  17012. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  17013. 1142.51 s [algebraic-graphs] OK: adjacencyList empty == []
  17014. 1142.51 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17015. 1142.51 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17016. 1142.51 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17017. 1142.51 s [algebraic-graphs]
  17018. 1142.51 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  17019. 1142.52 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17020. 1142.52 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17021. 1142.52 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17022. 1142.52 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17023. 1142.52 s [algebraic-graphs]
  17024. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  17025. 1142.52 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17026. 1142.52 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17027. 1142.52 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17028. 1142.52 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17029. 1142.52 s [algebraic-graphs]
  17030. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  17031. 1142.52 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17032. 1142.52 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17033. 1142.52 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17034. 1142.52 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17035. 1142.52 s [algebraic-graphs]
  17036. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  17037. 1142.52 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17038. 1142.52 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17039. 1142.52 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17040. 1142.52 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17041. 1142.52 s [algebraic-graphs]
  17042. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  17043. 1142.52 s [algebraic-graphs] OK: path [] == empty
  17044. 1142.52 s [algebraic-graphs] OK: path [x] == vertex x
  17045. 1142.52 s [algebraic-graphs] OK: path [x,y] == edge x y
  17046. 1142.52 s [algebraic-graphs]
  17047. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  17048. 1142.52 s [algebraic-graphs] OK: circuit [] == empty
  17049. 1142.52 s [algebraic-graphs] OK: circuit [x] == edge x x
  17050. 1142.52 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17051. 1142.52 s [algebraic-graphs]
  17052. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  17053. 1142.52 s [algebraic-graphs] OK: clique [] == empty
  17054. 1142.52 s [algebraic-graphs] OK: clique [x] == vertex x
  17055. 1142.52 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17056. 1142.52 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17057. 1142.52 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17058. 1142.52 s [algebraic-graphs]
  17059. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  17060. 1142.52 s [algebraic-graphs] OK: biclique [] [] == empty
  17061. 1142.52 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17062. 1142.52 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17063. 1142.52 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17064. 1142.52 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17065. 1142.52 s [algebraic-graphs]
  17066. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  17067. 1142.52 s [algebraic-graphs] OK: star x [] == vertex x
  17068. 1142.52 s [algebraic-graphs] OK: star x [y] == edge x y
  17069. 1142.52 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17070. 1142.52 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17071. 1142.52 s [algebraic-graphs]
  17072. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  17073. 1142.52 s [algebraic-graphs] OK: stars [] == empty
  17074. 1142.52 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17075. 1142.52 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17076. 1142.52 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17077. 1142.52 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17078. 1142.52 s [algebraic-graphs] OK: stars . adjacencyList == id
  17079. 1142.52 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17080. 1142.52 s [algebraic-graphs]
  17081. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  17082. 1142.52 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17083. 1142.52 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17084. 1142.52 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17085. 1142.52 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  17086. 1142.52 s [algebraic-graphs]
  17087. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  17088. 1142.52 s [algebraic-graphs] OK: forest [] == empty
  17089. 1142.52 s [algebraic-graphs] OK: forest [x] == tree x
  17090. 1142.52 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17091. 1142.52 s [algebraic-graphs] OK: forest == overlays . map tree
  17092. 1142.52 s [algebraic-graphs]
  17093. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  17094. 1142.52 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17095. 1142.52 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17096. 1142.52 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17097. 1142.52 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17098. 1142.52 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17099. 1142.52 s [algebraic-graphs]
  17100. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  17101. 1142.52 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17102. 1142.52 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17103. 1142.52 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17104. 1142.52 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17105. 1142.52 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17106. 1142.52 s [algebraic-graphs]
  17107. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  17108. 1142.52 s [algebraic-graphs] OK: replaceVertex x x == id
  17109. 1142.52 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17110. 1142.52 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17111. 1142.52 s [algebraic-graphs]
  17112. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  17113. 1142.52 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17114. 1142.52 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17115. 1142.52 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17116. 1142.52 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17117. 1142.52 s [algebraic-graphs]
  17118. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  17119. 1142.52 s [algebraic-graphs] OK: transpose empty == empty
  17120. 1142.52 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17121. 1142.52 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17122. 1142.52 s [algebraic-graphs] OK: transpose . transpose == id
  17123. 1142.52 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17124. 1142.52 s [algebraic-graphs]
  17125. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  17126. 1142.52 s [algebraic-graphs] OK: gmap f empty == empty
  17127. 1142.52 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17128. 1142.52 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17129. 1142.52 s [algebraic-graphs] OK: gmap id == id
  17130. 1142.52 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17131. 1142.52 s [algebraic-graphs]
  17132. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  17133. 1142.52 s [algebraic-graphs] OK: induce (const True ) x == x
  17134. 1142.52 s [algebraic-graphs] OK: induce (const False) x == empty
  17135. 1142.52 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17136. 1142.52 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17137. 1142.52 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17138. 1142.52 s [algebraic-graphs]
  17139. 1142.52 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  17140. 1142.52 s [algebraic-graphs] OK: compose empty x == empty
  17141. 1142.52 s [algebraic-graphs] OK: compose x empty == empty
  17142. 1142.52 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17143. 1142.52 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17144. 1142.52 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17145. 1142.52 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17146. 1142.89 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17147. 1142.89 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17148. 1142.89 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17149. 1142.89 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17150. 1142.89 s [algebraic-graphs]
  17151. 1142.89 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  17152. 1142.89 s [algebraic-graphs] OK: closure empty == empty
  17153. 1142.89 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  17154. 1142.89 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  17155. 1142.89 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17156. 1142.89 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  17157. 1142.89 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  17158. 1142.89 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  17159. 1142.89 s [algebraic-graphs] OK: closure . closure == closure
  17160. 1142.89 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  17161. 1142.89 s [algebraic-graphs]
  17162. 1142.89 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  17163. 1142.89 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  17164. 1142.89 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  17165. 1142.89 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  17166. 1142.89 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17167. 1142.89 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  17168. 1142.89 s [algebraic-graphs]
  17169. 1142.89 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  17170. 1142.89 s [algebraic-graphs] OK: symmetricClosure empty == empty
  17171. 1142.89 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  17172. 1142.89 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  17173. 1142.89 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  17174. 1142.89 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  17175. 1142.89 s [algebraic-graphs]
  17176. 1142.89 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  17177. 1142.89 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17178. 1142.89 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17179. 1142.89 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  17180. 1142.89 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  17181. 1142.89 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17182. 1142.89 s [algebraic-graphs]
  17183. 1142.89 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  17184. 1142.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  17185. 1142.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  17186. 1142.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  17187. 1142.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  17188. 1142.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  17189. 1142.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  17190. 1142.89 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  17191. 1142.89 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  17192. 1142.89 s [algebraic-graphs] OK: bfsForest x [] == []
  17193. 1142.89 s [algebraic-graphs] OK: bfsForest empty vs == []
  17194. 1142.89 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17195. 1142.89 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  17196. 1142.89 s [algebraic-graphs]
  17197. 1142.89 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  17198. 1142.89 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  17199. 1142.89 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  17200. 1142.89 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  17201. 1142.89 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  17202. 1142.89 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  17203. 1142.89 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  17204. 1142.89 s [algebraic-graphs] OK: bfs empty vs == []
  17205. 1142.89 s [algebraic-graphs] OK: bfs x [] == []
  17206. 1142.89 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  17207. 1142.89 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  17208. 1142.89 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  17209. 1142.89 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  17210. 1142.89 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  17211. 1142.89 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  17212. 1142.89 s [algebraic-graphs]
  17213. 1142.89 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  17214. 1142.89 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  17215. 1142.89 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  17216. 1142.89 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  17217. 1142.89 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  17218. 1142.89 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  17219. 1142.89 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  17220. 1142.89 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  17221. 1142.89 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  17222. 1142.89 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  17223. 1142.89 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  17224. 1142.89 s [algebraic-graphs]
  17225. 1142.89 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  17226. 1142.89 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  17227. 1142.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  17228. 1142.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  17229. 1142.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  17230. 1142.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  17231. 1142.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  17232. 1142.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  17233. 1142.89 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  17234. 1142.89 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  17235. 1142.89 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  17236. 1142.89 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  17237. 1142.89 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17238. 1142.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  17239. 1142.89 s [algebraic-graphs]
  17240. 1142.89 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17241. 1142.89 s [algebraic-graphs] OK: dfs empty vs == []
  17242. 1142.89 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  17243. 1142.90 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  17244. 1142.90 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  17245. 1142.90 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  17246. 1142.90 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  17247. 1142.90 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  17248. 1142.90 s [algebraic-graphs] OK: dfs x [] == []
  17249. 1142.90 s [algebraic-graphs]
  17250. 1142.90 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  17251. 1142.90 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  17252. 1142.90 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  17253. 1142.90 s [algebraic-graphs]
  17254. 1142.90 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17255. 1142.90 s [algebraic-graphs] OK: reachable empty x == []
  17256. 1142.90 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  17257. 1142.90 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  17258. 1142.90 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  17259. 1142.90 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  17260. 1142.90 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  17261. 1142.90 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  17262. 1142.90 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  17263. 1142.90 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  17264. 1142.90 s [algebraic-graphs]
  17265. 1142.90 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  17266. 1142.90 s [algebraic-graphs]
  17267. 1142.90 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  17268. 1142.90 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  17269. 1142.90 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  17270. 1142.90 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  17271. 1142.90 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  17272. 1142.90 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  17273. 1142.90 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  17274. 1142.90 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  17275. 1142.90 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  17276. 1142.90 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  17277. 1142.90 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  17278. 1142.90 s [algebraic-graphs]
  17279. 1142.90 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  17280. 1142.90 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  17281. 1142.90 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  17282. 1142.90 s [algebraic-graphs] OK: isAcyclic . circuit == null
  17283. 1142.90 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  17284. 1142.90 s [algebraic-graphs]
  17285. 1142.90 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  17286. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  17287. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  17288. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  17289. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  17290. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  17291. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  17292. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  17293. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  17294. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  17295. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  17296. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  17297. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  17298. 1142.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  17299. 1150.57 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  17300. 1150.57 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  17301. 1150.58 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  17302. 1150.58 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  17303. 1150.58 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  17304. 1150.58 s [algebraic-graphs]
  17305. 1150.58 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  17306. 1150.58 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  17307. 1150.58 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  17308. 1150.58 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  17309. 1150.58 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  17310. 1150.58 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  17311. 1150.58 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  17312. 1150.58 s [algebraic-graphs]
  17313. 1150.58 s [algebraic-graphs] ============ AdjacencyMap ============
  17314. 1150.58 s [algebraic-graphs] OK: Axioms of graphs
  17315. 1150.58 s [algebraic-graphs]
  17316. 1150.58 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  17317. 1150.58 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17318. 1150.58 s [algebraic-graphs]
  17319. 1150.58 s [algebraic-graphs] OK: consistent empty == True
  17320. 1150.58 s [algebraic-graphs] OK: consistent (vertex x) == True
  17321. 1150.58 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17322. 1150.58 s [algebraic-graphs] OK: consistent (connect x y) == True
  17323. 1150.58 s [algebraic-graphs] OK: consistent (edge x y) == True
  17324. 1150.58 s [algebraic-graphs] OK: consistent (edges xs) == True
  17325. 1150.58 s [algebraic-graphs] OK: consistent (stars xs) == True
  17326. 1150.58 s [algebraic-graphs]
  17327. 1150.58 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  17328. 1150.58 s [algebraic-graphs] OK: show (empty ) == "empty"
  17329. 1150.58 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17330. 1150.58 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17331. 1150.58 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17332. 1150.58 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17333. 1150.58 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17334. 1150.58 s [algebraic-graphs]
  17335. 1150.58 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17336. 1150.58 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17337. 1150.58 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17338. 1150.58 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17339. 1150.58 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17340. 1150.58 s [algebraic-graphs]
  17341. 1150.58 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  17342. 1150.59 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17343. 1150.59 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17344. 1150.59 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17345. 1150.59 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17346. 1150.59 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17347. 1150.59 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17348. 1150.59 s [algebraic-graphs] OK: x <= x + y
  17349. 1150.59 s [algebraic-graphs] OK: x + y <= x * y
  17350. 1150.59 s [algebraic-graphs]
  17351. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  17352. 1150.59 s [algebraic-graphs] OK: isEmpty empty == True
  17353. 1150.59 s [algebraic-graphs] OK: hasVertex x empty == False
  17354. 1150.59 s [algebraic-graphs] OK: vertexCount empty == 0
  17355. 1150.59 s [algebraic-graphs] OK: edgeCount empty == 0
  17356. 1150.59 s [algebraic-graphs]
  17357. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  17358. 1150.59 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17359. 1150.59 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17360. 1150.59 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17361. 1150.59 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17362. 1150.59 s [algebraic-graphs]
  17363. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  17364. 1150.59 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17365. 1150.59 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17366. 1150.59 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17367. 1150.59 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17368. 1150.59 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17369. 1150.59 s [algebraic-graphs]
  17370. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  17371. 1150.59 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17372. 1150.59 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17373. 1150.59 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17374. 1150.59 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17375. 1150.59 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17376. 1150.59 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17377. 1150.59 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17378. 1150.59 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17379. 1150.59 s [algebraic-graphs]
  17380. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  17381. 1150.59 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17382. 1150.59 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17383. 1150.59 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17384. 1150.59 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17385. 1150.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17386. 1150.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17387. 1150.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17388. 1150.59 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17389. 1150.59 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17390. 1150.59 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17391. 1150.59 s [algebraic-graphs]
  17392. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  17393. 1150.59 s [algebraic-graphs] OK: vertices [] == empty
  17394. 1150.59 s [algebraic-graphs] OK: vertices [x] == vertex x
  17395. 1150.59 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17396. 1150.59 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17397. 1150.59 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17398. 1150.59 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17399. 1150.59 s [algebraic-graphs]
  17400. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  17401. 1150.59 s [algebraic-graphs] OK: edges [] == empty
  17402. 1150.59 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17403. 1150.59 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17404. 1150.59 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17405. 1150.59 s [algebraic-graphs]
  17406. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  17407. 1150.59 s [algebraic-graphs] OK: overlays [] == empty
  17408. 1150.59 s [algebraic-graphs] OK: overlays [x] == x
  17409. 1150.59 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17410. 1150.59 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17411. 1150.59 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17412. 1150.59 s [algebraic-graphs]
  17413. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  17414. 1150.59 s [algebraic-graphs] OK: connects [] == empty
  17415. 1150.59 s [algebraic-graphs] OK: connects [x] == x
  17416. 1150.59 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17417. 1150.59 s [algebraic-graphs] OK: connects == foldr connect empty
  17418. 1150.59 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17419. 1150.59 s [algebraic-graphs]
  17420. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  17421. 1150.59 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  17422. 1150.59 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  17423. 1150.59 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  17424. 1150.59 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  17425. 1150.59 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  17426. 1150.59 s [algebraic-graphs]
  17427. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  17428. 1150.59 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17429. 1150.59 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17430. 1150.59 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17431. 1150.59 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17432. 1150.59 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17433. 1150.59 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17434. 1150.59 s [algebraic-graphs]
  17435. 1150.59 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  17436. 1150.59 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17437. 1150.59 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17438. 1150.59 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17439. 1150.59 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17440. 1150.59 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17441. 1150.59 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17442. 1150.59 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17443. 1150.59 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17444. 1150.59 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17445. 1150.59 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17446. 1150.59 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17447. 1150.59 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17448. 1150.59 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17449. 1150.59 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17450. 1150.59 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17451. 1150.59 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17452. 1150.59 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17453. 1150.59 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17454. 1150.59 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17455. 1150.59 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17456. 1150.59 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17457. 1150.59 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17458. 1150.60 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17459. 1150.60 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17460. 1150.60 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17461. 1150.60 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17462. 1150.60 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17463. 1150.60 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17464. 1150.60 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17465. 1150.60 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17466. 1150.60 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17467. 1150.60 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17468. 1150.60 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17469. 1153.71 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17470. 1153.71 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17471. 1153.71 s [algebraic-graphs]
  17472. 1153.71 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  17473. 1153.71 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17474. 1153.71 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17475. 1153.71 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17476. 1153.71 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17477. 1153.71 s [algebraic-graphs]
  17478. 1153.71 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  17479. 1153.71 s [algebraic-graphs] OK: isEmpty empty == True
  17480. 1153.71 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17481. 1153.71 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17482. 1153.71 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17483. 1153.71 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17484. 1153.71 s [algebraic-graphs]
  17485. 1153.71 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  17486. 1153.71 s [algebraic-graphs] OK: hasVertex x empty == False
  17487. 1153.71 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17488. 1153.71 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17489. 1153.71 s [algebraic-graphs]
  17490. 1153.71 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  17491. 1153.71 s [algebraic-graphs] OK: hasEdge x y empty == False
  17492. 1153.71 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17493. 1153.71 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17494. 1153.71 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17495. 1153.71 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17496. 1153.71 s [algebraic-graphs]
  17497. 1153.71 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  17498. 1153.71 s [algebraic-graphs] OK: vertexCount empty == 0
  17499. 1153.71 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17500. 1153.71 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17501. 1153.71 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17502. 1153.71 s [algebraic-graphs]
  17503. 1153.71 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  17504. 1153.71 s [algebraic-graphs] OK: edgeCount empty == 0
  17505. 1153.71 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17506. 1153.71 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17507. 1153.71 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17508. 1153.71 s [algebraic-graphs]
  17509. 1153.71 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  17510. 1153.71 s [algebraic-graphs] OK: vertexList empty == []
  17511. 1153.71 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17512. 1153.71 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17513. 1153.71 s [algebraic-graphs]
  17514. 1153.71 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  17515. 1153.72 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17516. 1153.72 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17517. 1153.72 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17518. 1153.72 s [algebraic-graphs]
  17519. 1153.72 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  17520. 1153.72 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17521. 1153.72 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17522. 1153.72 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17523. 1153.72 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17524. 1153.72 s [algebraic-graphs]
  17525. 1153.72 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  17526. 1153.72 s [algebraic-graphs] OK: edgeList empty == []
  17527. 1153.72 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17528. 1153.72 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17529. 1153.72 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17530. 1153.72 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17531. 1153.72 s [algebraic-graphs]
  17532. 1153.72 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  17533. 1153.72 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17534. 1153.72 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17535. 1153.72 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17536. 1153.72 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17537. 1153.72 s [algebraic-graphs]
  17538. 1153.72 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  17539. 1153.72 s [algebraic-graphs] OK: adjacencyList empty == []
  17540. 1153.72 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17541. 1153.72 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17542. 1153.72 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17543. 1153.72 s [algebraic-graphs]
  17544. 1153.72 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  17545. 1153.72 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17546. 1153.72 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17547. 1153.72 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17548. 1153.72 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17549. 1153.72 s [algebraic-graphs]
  17550. 1153.72 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  17551. 1153.72 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17552. 1153.72 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17553. 1153.72 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17554. 1153.72 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17555. 1153.72 s [algebraic-graphs]
  17556. 1153.72 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  17557. 1153.72 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17558. 1153.72 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17559. 1153.72 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17560. 1153.72 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17561. 1153.72 s [algebraic-graphs]
  17562. 1153.72 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  17563. 1153.72 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17564. 1153.72 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17565. 1153.72 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17566. 1153.72 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17567. 1153.72 s [algebraic-graphs]
  17568. 1153.72 s [algebraic-graphs] ============ AdjacencyMap.path ============
  17569. 1153.72 s [algebraic-graphs] OK: path [] == empty
  17570. 1153.72 s [algebraic-graphs] OK: path [x] == vertex x
  17571. 1153.72 s [algebraic-graphs] OK: path [x,y] == edge x y
  17572. 1153.72 s [algebraic-graphs]
  17573. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  17574. 1153.73 s [algebraic-graphs] OK: circuit [] == empty
  17575. 1153.73 s [algebraic-graphs] OK: circuit [x] == edge x x
  17576. 1153.73 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17577. 1153.73 s [algebraic-graphs]
  17578. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  17579. 1153.73 s [algebraic-graphs] OK: clique [] == empty
  17580. 1153.73 s [algebraic-graphs] OK: clique [x] == vertex x
  17581. 1153.73 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17582. 1153.73 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17583. 1153.73 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17584. 1153.73 s [algebraic-graphs]
  17585. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  17586. 1153.73 s [algebraic-graphs] OK: biclique [] [] == empty
  17587. 1153.73 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17588. 1153.73 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17589. 1153.73 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17590. 1153.73 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17591. 1153.73 s [algebraic-graphs]
  17592. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.star ============
  17593. 1153.73 s [algebraic-graphs] OK: star x [] == vertex x
  17594. 1153.73 s [algebraic-graphs] OK: star x [y] == edge x y
  17595. 1153.73 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17596. 1153.73 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17597. 1153.73 s [algebraic-graphs]
  17598. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  17599. 1153.73 s [algebraic-graphs] OK: stars [] == empty
  17600. 1153.73 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17601. 1153.73 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17602. 1153.73 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17603. 1153.73 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17604. 1153.73 s [algebraic-graphs] OK: stars . adjacencyList == id
  17605. 1153.73 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17606. 1153.73 s [algebraic-graphs]
  17607. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  17608. 1153.73 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17609. 1153.73 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17610. 1153.73 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17611. 1153.73 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  17612. 1153.73 s [algebraic-graphs]
  17613. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  17614. 1153.73 s [algebraic-graphs] OK: forest [] == empty
  17615. 1153.73 s [algebraic-graphs] OK: forest [x] == tree x
  17616. 1153.73 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17617. 1153.73 s [algebraic-graphs] OK: forest == overlays . map tree
  17618. 1153.73 s [algebraic-graphs]
  17619. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  17620. 1153.73 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17621. 1153.73 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17622. 1153.73 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17623. 1153.73 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17624. 1153.73 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17625. 1153.73 s [algebraic-graphs]
  17626. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  17627. 1153.73 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17628. 1153.73 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17629. 1153.73 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17630. 1153.73 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17631. 1153.73 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17632. 1153.73 s [algebraic-graphs]
  17633. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  17634. 1153.73 s [algebraic-graphs] OK: replaceVertex x x == id
  17635. 1153.73 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17636. 1153.73 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17637. 1153.73 s [algebraic-graphs]
  17638. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  17639. 1153.73 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17640. 1153.73 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17641. 1153.73 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17642. 1153.73 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17643. 1153.73 s [algebraic-graphs]
  17644. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  17645. 1153.73 s [algebraic-graphs] OK: transpose empty == empty
  17646. 1153.73 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17647. 1153.73 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17648. 1153.73 s [algebraic-graphs] OK: transpose . transpose == id
  17649. 1153.73 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17650. 1153.73 s [algebraic-graphs]
  17651. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  17652. 1153.73 s [algebraic-graphs] OK: gmap f empty == empty
  17653. 1153.73 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17654. 1153.73 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17655. 1153.73 s [algebraic-graphs] OK: gmap id == id
  17656. 1153.73 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17657. 1153.73 s [algebraic-graphs]
  17658. 1153.73 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  17659. 1153.73 s [algebraic-graphs] OK: induce (const True ) x == x
  17660. 1153.73 s [algebraic-graphs] OK: induce (const False) x == empty
  17661. 1153.73 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17662. 1153.73 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17663. 1153.73 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17664. 1153.74 s [algebraic-graphs]
  17665. 1153.74 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  17666. 1153.74 s [algebraic-graphs] OK: compose empty x == empty
  17667. 1153.74 s [algebraic-graphs] OK: compose x empty == empty
  17668. 1153.74 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17669. 1153.74 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17670. 1153.74 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17671. 1153.74 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17672. 1161.90 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17673. 1161.90 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17674. 1161.91 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17675. 1161.91 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17676. 1161.92 s [algebraic-graphs]
  17677. 1161.92 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  17678. 1161.92 s [algebraic-graphs] OK: closure empty == empty
  17679. 1161.92 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  17680. 1161.92 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  17681. 1161.92 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17682. 1161.92 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  17683. 1161.92 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  17684. 1161.92 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  17685. 1161.92 s [algebraic-graphs] OK: closure . closure == closure
  17686. 1161.92 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  17687. 1161.92 s [algebraic-graphs]
  17688. 1161.92 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  17689. 1161.92 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  17690. 1161.92 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  17691. 1161.92 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  17692. 1161.92 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17693. 1161.92 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  17694. 1161.92 s [algebraic-graphs]
  17695. 1161.92 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  17696. 1161.92 s [algebraic-graphs] OK: symmetricClosure empty == empty
  17697. 1161.92 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  17698. 1161.92 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  17699. 1161.92 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  17700. 1161.92 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  17701. 1161.92 s [algebraic-graphs]
  17702. 1161.92 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  17703. 1161.92 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17704. 1161.92 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17705. 1161.92 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  17706. 1161.92 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  17707. 1161.92 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17708. 1161.92 s [algebraic-graphs]
  17709. 1161.92 s [algebraic-graphs] ============ AdjacencyMap.box ============
  17710. 1161.92 s [algebraic-graphs] OK: box x y ~~ box y x
  17711. 1161.92 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  17712. 1161.92 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  17713. 1161.92 s [algebraic-graphs] OK: box x empty ~~ empty
  17714. 1161.92 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  17715. 1161.92 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  17716. 1161.92 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  17717. 1161.92 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  17718. 1161.92 s [algebraic-graphs]
  17719. 1161.92 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  17720. 1161.92 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  17721. 1161.92 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  17722. 1161.92 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  17723. 1161.92 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  17724. 1161.92 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  17725. 1161.92 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  17726. 1161.92 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  17727. 1161.92 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  17728. 1161.92 s [algebraic-graphs] OK: bfsForest x [] == []
  17729. 1161.92 s [algebraic-graphs] OK: bfsForest empty vs == []
  17730. 1161.92 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17731. 1161.92 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  17732. 1161.92 s [algebraic-graphs]
  17733. 1161.92 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  17734. 1161.92 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  17735. 1161.92 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  17736. 1161.92 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  17737. 1161.92 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  17738. 1161.92 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  17739. 1161.92 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  17740. 1161.92 s [algebraic-graphs] OK: bfs empty vs == []
  17741. 1161.92 s [algebraic-graphs] OK: bfs x [] == []
  17742. 1161.92 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  17743. 1161.92 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  17744. 1161.92 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  17745. 1161.92 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  17746. 1161.92 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  17747. 1161.92 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  17748. 1161.92 s [algebraic-graphs]
  17749. 1161.92 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  17750. 1161.93 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  17751. 1161.93 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  17752. 1161.93 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  17753. 1161.93 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  17754. 1161.93 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  17755. 1161.93 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  17756. 1161.93 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  17757. 1161.93 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  17758. 1161.93 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  17759. 1161.93 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  17760. 1161.93 s [algebraic-graphs]
  17761. 1161.93 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  17762. 1161.93 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  17763. 1161.93 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  17764. 1161.93 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  17765. 1161.93 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  17766. 1161.93 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  17767. 1161.93 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  17768. 1161.93 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  17769. 1161.93 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  17770. 1161.93 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  17771. 1161.93 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  17772. 1161.93 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  17773. 1161.93 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17774. 1161.93 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  17775. 1161.93 s [algebraic-graphs]
  17776. 1161.93 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  17777. 1161.93 s [algebraic-graphs] OK: dfs empty vs == []
  17778. 1161.93 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  17779. 1161.93 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  17780. 1161.93 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  17781. 1161.93 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  17782. 1161.93 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  17783. 1161.93 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  17784. 1161.93 s [algebraic-graphs] OK: dfs x [] == []
  17785. 1161.93 s [algebraic-graphs]
  17786. 1161.93 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  17787. 1161.93 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  17788. 1161.93 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  17789. 1161.93 s [algebraic-graphs]
  17790. 1161.93 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  17791. 1161.93 s [algebraic-graphs] OK: reachable empty x == []
  17792. 1161.93 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  17793. 1161.93 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  17794. 1161.93 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  17795. 1161.93 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  17796. 1161.93 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  17797. 1161.93 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  17798. 1161.93 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  17799. 1161.93 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  17800. 1161.93 s [algebraic-graphs]
  17801. 1161.93 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  17802. 1161.93 s [algebraic-graphs]
  17803. 1161.93 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  17804. 1161.93 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  17805. 1161.93 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  17806. 1161.93 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  17807. 1161.93 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  17808. 1161.93 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  17809. 1161.93 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  17810. 1161.93 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  17811. 1161.93 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  17812. 1161.93 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  17813. 1161.93 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  17814. 1161.93 s [algebraic-graphs]
  17815. 1161.93 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  17816. 1161.93 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  17817. 1161.93 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  17818. 1161.93 s [algebraic-graphs] OK: isAcyclic . circuit == null
  17819. 1161.93 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  17820. 1161.93 s [algebraic-graphs]
  17821. 1161.93 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  17822. 1161.93 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  17823. 1161.93 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  17824. 1161.93 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  17825. 1161.93 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  17826. 1161.93 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  17827. 1161.93 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  17828. 1161.93 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  17829. 1176.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  17830. 1176.83 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  17831. 1176.85 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  17832. 1176.85 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  17833. 1176.85 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  17834. 1176.85 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  17835. 1176.85 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  17836. 1176.85 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  17837. 1176.85 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  17838. 1176.85 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  17839. 1176.85 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  17840. 1176.85 s [algebraic-graphs]
  17841. 1176.85 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  17842. 1176.85 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  17843. 1176.85 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  17844. 1176.86 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  17845. 1176.86 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  17846. 1176.86 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  17847. 1176.86 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  17848. 1176.86 s [algebraic-graphs]
  17849. 1176.86 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  17850. 1176.86 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17851. 1176.86 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  17852. 1176.86 s [algebraic-graphs] OK: induceJust . gmap Just == id
  17853. 1176.86 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  17854. 1176.86 s [algebraic-graphs]
  17855. 1176.86 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  17856. 1176.86 s [algebraic-graphs] OK: scc empty == empty
  17857. 1176.86 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  17858. 1176.86 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  17859. 1176.86 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  17860. 1176.86 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  17861. 1176.86 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  17862. 1176.86 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  17863. 1176.86 s [algebraic-graphs] OK: isAcyclic . scc == const True
  17864. 1176.86 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  17865. 1176.87 s [algebraic-graphs] OK: scc g == KL.scc g
  17866. 1176.87 s [algebraic-graphs]
  17867. 1176.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  17868. 1176.87 s [algebraic-graphs] OK: 0 == rightVertex 0
  17869. 1176.87 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  17870. 1176.87 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  17871. 1176.87 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  17872. 1176.87 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  17873. 1176.87 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  17874. 1176.87 s [algebraic-graphs]
  17875. 1176.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  17876. 1176.87 s [algebraic-graphs] OK: show empty == "empty"
  17877. 1176.87 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  17878. 1176.87 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  17879. 1176.87 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  17880. 1176.87 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  17881. 1176.87 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  17882. 1176.87 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  17883. 1176.87 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  17884. 1176.87 s [algebraic-graphs]
  17885. 1176.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  17886. 1176.87 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  17887. 1176.87 s [algebraic-graphs]
  17888. 1176.87 s [algebraic-graphs] OK: x + y == y + x
  17889. 1176.88 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  17890. 1176.88 s [algebraic-graphs] OK: x * empty == x
  17891. 1176.88 s [algebraic-graphs] OK: empty * x == x
  17892. 1176.88 s [algebraic-graphs] OK: x * y == y * x
  17893. 1176.88 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  17894. 1176.88 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  17895. 1176.88 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  17896. 1176.88 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  17897. 1176.88 s [algebraic-graphs] OK: x + empty == x
  17898. 1176.88 s [algebraic-graphs] OK: empty + x == x
  17899. 1176.88 s [algebraic-graphs] OK: x + x == x
  17900. 1176.88 s [algebraic-graphs] OK: x * y + x + y == x * y
  17901. 1176.88 s [algebraic-graphs] OK: x * x * x == x * x
  17902. 1176.88 s [algebraic-graphs]
  17903. 1176.88 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  17904. 1176.88 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  17905. 1176.88 s [algebraic-graphs]
  17906. 1176.88 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  17907. 1176.88 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  17908. 1176.88 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  17909. 1176.88 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  17910. 1176.88 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  17911. 1176.88 s [algebraic-graphs]
  17912. 1176.88 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  17913. 1176.88 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  17914. 1176.88 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  17915. 1176.88 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  17916. 1176.88 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  17917. 1176.88 s [algebraic-graphs]
  17918. 1176.88 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  17919. 1176.88 s [algebraic-graphs] OK: isEmpty empty == True
  17920. 1176.88 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  17921. 1176.88 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  17922. 1176.88 s [algebraic-graphs] OK: hasVertex x empty == False
  17923. 1176.88 s [algebraic-graphs]
  17924. 1176.88 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  17925. 1176.88 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  17926. 1176.88 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  17927. 1176.88 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  17928. 1176.88 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  17929. 1176.88 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  17930. 1176.88 s [algebraic-graphs]
  17931. 1176.88 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  17932. 1176.88 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  17933. 1176.88 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  17934. 1176.88 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  17935. 1176.88 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  17936. 1176.88 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  17937. 1176.88 s [algebraic-graphs]
  17938. 1176.88 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  17939. 1176.88 s [algebraic-graphs] OK: vertex . Left == leftVertex
  17940. 1176.88 s [algebraic-graphs] OK: vertex . Right == rightVertex
  17941. 1176.88 s [algebraic-graphs]
  17942. 1176.88 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  17943. 1176.88 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  17944. 1176.88 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  17945. 1176.88 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  17946. 1176.88 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17947. 1176.88 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  17948. 1176.88 s [algebraic-graphs]
  17949. 1176.88 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  17950. 1176.88 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17951. 1176.88 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17952. 1176.89 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17953. 1176.89 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17954. 1176.89 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17955. 1176.89 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17956. 1176.89 s [algebraic-graphs]
  17957. 1176.89 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  17958. 1176.89 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  17959. 1176.89 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  17960. 1176.89 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  17961. 1176.89 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  17962. 1176.89 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  17963. 1176.89 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17964. 1176.89 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17965. 1176.89 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17966. 1176.89 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17967. 1176.89 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17968. 1176.89 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  17969. 1176.89 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  17970. 1176.89 s [algebraic-graphs]
  17971. 1176.89 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  17972. 1176.89 s [algebraic-graphs] OK: vertices [] [] == empty
  17973. 1176.89 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  17974. 1176.89 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  17975. 1176.89 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  17976. 1176.89 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  17977. 1176.89 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  17978. 1176.89 s [algebraic-graphs]
  17979. 1176.89 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  17980. 1176.89 s [algebraic-graphs] OK: edges [] == empty
  17981. 1176.89 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17982. 1176.89 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17983. 1176.89 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  17984. 1176.89 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17985. 1176.89 s [algebraic-graphs]
  17986. 1176.89 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  17987. 1176.89 s [algebraic-graphs] OK: overlays [] == empty
  17988. 1176.89 s [algebraic-graphs] OK: overlays [x] == x
  17989. 1176.89 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17990. 1176.89 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17991. 1176.89 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17992. 1176.89 s [algebraic-graphs]
  17993. 1176.89 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  17994. 1176.89 s [algebraic-graphs] OK: connects [] == empty
  17995. 1176.89 s [algebraic-graphs] OK: connects [x] == x
  17996. 1176.89 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17997. 1176.89 s [algebraic-graphs] OK: connects == foldr connect empty
  17998. 1176.89 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17999. 1176.89 s [algebraic-graphs]
  18000. 1176.89 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  18001. 1181.40 s [algebraic-graphs] OK: swap empty == empty
  18002. 1181.40 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  18003. 1181.40 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  18004. 1181.40 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  18005. 1181.40 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  18006. 1181.40 s [algebraic-graphs] OK: swap . swap == id
  18007. 1181.40 s [algebraic-graphs]
  18008. 1181.40 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  18009. 1181.40 s [algebraic-graphs] OK: toBipartite empty == empty
  18010. 1181.40 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  18011. 1181.40 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  18012. 1181.40 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  18013. 1181.40 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  18014. 1181.40 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  18015. 1181.40 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  18016. 1181.40 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  18017. 1181.40 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  18018. 1181.40 s [algebraic-graphs]
  18019. 1181.40 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  18020. 1181.40 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  18021. 1181.40 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  18022. 1181.40 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  18023. 1181.40 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  18024. 1181.40 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  18025. 1181.40 s [algebraic-graphs]
  18026. 1181.40 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  18027. 1181.40 s [algebraic-graphs] OK: fromBipartite empty == empty
  18028. 1181.40 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  18029. 1181.41 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  18030. 1181.41 s [algebraic-graphs]
  18031. 1181.41 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  18032. 1181.41 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  18033. 1181.41 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  18034. 1181.41 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  18035. 1181.41 s [algebraic-graphs]
  18036. 1181.41 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  18037. 1181.41 s [algebraic-graphs] OK: isEmpty empty == True
  18038. 1181.41 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18039. 1181.41 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18040. 1181.41 s [algebraic-graphs] OK: isEmpty == (==) empty
  18041. 1181.41 s [algebraic-graphs]
  18042. 1181.41 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  18043. 1181.41 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  18044. 1181.41 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18045. 1181.41 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18046. 1181.41 s [algebraic-graphs]
  18047. 1181.41 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  18048. 1181.41 s [algebraic-graphs] OK: hasRightVertex x empty == False
  18049. 1181.41 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18050. 1181.41 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18051. 1181.41 s [algebraic-graphs]
  18052. 1181.41 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  18053. 1181.41 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  18054. 1181.41 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  18055. 1181.41 s [algebraic-graphs]
  18056. 1181.41 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  18057. 1181.41 s [algebraic-graphs] OK: hasEdge x y empty == False
  18058. 1181.41 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18059. 1181.41 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18060. 1181.41 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18061. 1181.41 s [algebraic-graphs]
  18062. 1181.41 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  18063. 1181.41 s [algebraic-graphs] OK: leftVertexCount empty == 0
  18064. 1181.41 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  18065. 1181.41 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  18066. 1181.41 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  18067. 1181.41 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  18068. 1181.41 s [algebraic-graphs]
  18069. 1181.41 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  18070. 1181.41 s [algebraic-graphs] OK: rightVertexCount empty == 0
  18071. 1181.41 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  18072. 1181.42 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  18073. 1181.42 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  18074. 1181.42 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  18075. 1181.42 s [algebraic-graphs]
  18076. 1181.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  18077. 1181.42 s [algebraic-graphs] OK: vertexCount empty == 0
  18078. 1181.42 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18079. 1181.42 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  18080. 1181.42 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  18081. 1181.42 s [algebraic-graphs]
  18082. 1181.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  18083. 1181.42 s [algebraic-graphs] OK: edgeCount empty == 0
  18084. 1181.42 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18085. 1181.42 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18086. 1181.42 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18087. 1181.42 s [algebraic-graphs]
  18088. 1181.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  18089. 1181.42 s [algebraic-graphs] OK: leftVertexList empty == []
  18090. 1181.42 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  18091. 1181.42 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  18092. 1181.42 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  18093. 1181.42 s [algebraic-graphs]
  18094. 1181.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  18095. 1181.42 s [algebraic-graphs] OK: rightVertexList empty == []
  18096. 1181.42 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  18097. 1181.42 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  18098. 1181.42 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  18099. 1181.42 s [algebraic-graphs]
  18100. 1181.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  18101. 1181.42 s [algebraic-graphs] OK: vertexList empty == []
  18102. 1181.42 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18103. 1181.42 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  18104. 1181.42 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  18105. 1181.42 s [algebraic-graphs]
  18106. 1181.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  18107. 1181.42 s [algebraic-graphs] OK: edgeList empty == []
  18108. 1181.42 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18109. 1181.42 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18110. 1181.42 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18111. 1181.42 s [algebraic-graphs]
  18112. 1181.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  18113. 1181.42 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  18114. 1181.42 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  18115. 1181.42 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  18116. 1181.42 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  18117. 1181.43 s [algebraic-graphs]
  18118. 1181.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  18119. 1181.43 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  18120. 1181.43 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  18121. 1181.43 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  18122. 1181.43 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  18123. 1181.43 s [algebraic-graphs]
  18124. 1181.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  18125. 1181.43 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18126. 1181.43 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18127. 1181.43 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  18128. 1181.43 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  18129. 1181.43 s [algebraic-graphs]
  18130. 1181.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  18131. 1181.43 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18132. 1181.43 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18133. 1181.43 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18134. 1181.43 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18135. 1181.43 s [algebraic-graphs]
  18136. 1181.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  18137. 1181.43 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  18138. 1181.43 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  18139. 1181.43 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  18140. 1181.43 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  18141. 1181.43 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  18142. 1181.43 s [algebraic-graphs]
  18143. 1181.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  18144. 1181.43 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  18145. 1181.43 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  18146. 1181.43 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  18147. 1181.43 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  18148. 1181.43 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  18149. 1181.43 s [algebraic-graphs]
  18150. 1181.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  18151. 1181.43 s [algebraic-graphs] OK: evenList [] == Nil
  18152. 1181.43 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  18153. 1181.43 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  18154. 1181.43 s [algebraic-graphs]
  18155. 1181.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  18156. 1181.43 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  18157. 1181.43 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  18158. 1181.43 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  18159. 1181.43 s [algebraic-graphs]
  18160. 1181.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  18161. 1181.43 s [algebraic-graphs] OK: path Nil == empty
  18162. 1181.43 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  18163. 1181.43 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  18164. 1181.43 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  18165. 1181.43 s [algebraic-graphs]
  18166. 1181.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  18167. 1181.43 s [algebraic-graphs] OK: circuit [] == empty
  18168. 1181.44 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  18169. 1181.44 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  18170. 1181.44 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  18171. 1181.44 s [algebraic-graphs]
  18172. 1181.44 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  18173. 1181.44 s [algebraic-graphs] OK: biclique [] [] == empty
  18174. 1181.44 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  18175. 1181.44 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  18176. 1181.44 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  18177. 1181.44 s [algebraic-graphs]
  18178. 1181.44 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  18179. 1181.44 s [algebraic-graphs] OK: star x [] == leftVertex x
  18180. 1181.44 s [algebraic-graphs] OK: star x [y] == edge x y
  18181. 1181.44 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18182. 1181.44 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  18183. 1181.44 s [algebraic-graphs]
  18184. 1181.44 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  18185. 1181.44 s [algebraic-graphs] OK: stars [] == empty
  18186. 1181.44 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  18187. 1181.44 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18188. 1181.44 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18189. 1237.66 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18190. 1237.67 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18191. 1237.67 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18192. 1237.67 s [algebraic-graphs]
  18193. 1237.67 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  18194. 1237.67 s [algebraic-graphs] OK: mesh xs [] == empty
  18195. 1237.67 s [algebraic-graphs] OK: mesh [] ys == empty
  18196. 1237.67 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  18197. 1237.67 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  18198. 1237.67 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  18199. 1237.67 s [algebraic-graphs]
  18200. 1237.67 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  18201. 1237.67 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  18202. 1237.67 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  18203. 1237.67 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  18204. 1237.67 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  18205. 1237.67 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  18206. 1237.67 s [algebraic-graphs]
  18207. 1237.67 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  18208. 1237.67 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  18209. 1237.67 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  18210. 1237.67 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  18211. 1237.67 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  18212. 1237.67 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  18213. 1237.67 s [algebraic-graphs]
  18214. 1237.67 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  18215. 1237.67 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  18216. 1237.67 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18217. 1237.67 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  18218. 1237.67 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  18219. 1237.68 s [algebraic-graphs]
  18220. 1237.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  18221. 1237.68 s [algebraic-graphs] OK: bimap f g empty == empty
  18222. 1237.68 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  18223. 1237.68 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  18224. 1237.68 s [algebraic-graphs] OK: bimap id id == id
  18225. 1237.68 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  18226. 1237.68 s [algebraic-graphs]
  18227. 1237.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  18228. 1237.68 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  18229. 1237.68 s [algebraic-graphs]
  18230. 1237.68 s [algebraic-graphs] OK: box x y ~~ box y x
  18231. 1237.68 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18232. 1237.68 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18233. 1237.68 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  18234. 1237.68 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  18235. 1237.68 s [algebraic-graphs] OK: box x empty ~~ empty
  18236. 1237.68 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  18237. 1237.68 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18238. 1237.68 s [algebraic-graphs]
  18239. 1237.68 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  18240. 1237.68 s [algebraic-graphs]
  18241. 1237.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  18242. 1237.68 s [algebraic-graphs] OK: consistent empty == True
  18243. 1237.68 s [algebraic-graphs] OK: consistent (vertex x) == True
  18244. 1237.68 s [algebraic-graphs] OK: consistent (edge x y) == True
  18245. 1237.68 s [algebraic-graphs] OK: consistent (edges x) == True
  18246. 1237.68 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  18247. 1237.68 s [algebraic-graphs] OK: consistent (swap x) == True
  18248. 1237.68 s [algebraic-graphs] OK: consistent (circuit xs) == True
  18249. 1237.68 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  18250. 1237.68 s [algebraic-graphs]
  18251. 1237.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  18252. 1237.68 s [algebraic-graphs] OK: detectParts empty == Right empty
  18253. 1237.68 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  18254. 1237.68 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  18255. 1237.68 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  18256. 1237.68 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  18257. 1237.68 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  18258. 1237.68 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  18259. 1237.68 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  18260. 1237.68 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  18261. 1237.68 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  18262. 1237.68 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  18263. 1237.68 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  18264. 1237.68 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  18265. 1237.68 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  18266. 1237.68 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  18267. 1237.68 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  18268. 1237.68 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  18269. 1237.68 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  18270. 1237.68 s [algebraic-graphs]
  18271. 1237.68 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  18272. 1237.68 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  18273. 1237.68 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  18274. 1237.68 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  18275. 1237.68 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  18276. 1237.68 s [algebraic-graphs]
  18277. 1237.68 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18278. 1237.68 s [algebraic-graphs] OK: show (matching []) == "matching []"
  18279. 1237.68 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  18280. 1237.68 s [algebraic-graphs]
  18281. 1237.68 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18282. 1237.68 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  18283. 1237.68 s [algebraic-graphs]
  18284. 1237.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  18285. 1237.68 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  18286. 1237.69 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  18287. 1237.69 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  18288. 1237.69 s [algebraic-graphs]
  18289. 1237.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  18290. 1237.69 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  18291. 1237.69 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  18292. 1237.69 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  18293. 1237.69 s [algebraic-graphs]
  18294. 1237.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  18295. 1237.69 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  18296. 1237.69 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  18297. 1237.69 s [algebraic-graphs]
  18298. 1237.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  18299. 1237.69 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  18300. 1237.69 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  18301. 1237.69 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  18302. 1237.69 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  18303. 1237.69 s [algebraic-graphs]
  18304. 1237.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  18305. 1237.69 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  18306. 1237.69 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  18307. 1237.69 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  18308. 1237.69 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  18309. 1237.69 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  18310. 1237.69 s [algebraic-graphs]
  18311. 1237.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  18312. 1237.69 s [algebraic-graphs] OK: maxMatching empty == matching []
  18313. 1237.69 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  18314. 1237.69 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  18315. 1237.69 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  18316. 1237.69 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  18317. 1237.69 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18318. 1237.69 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  18319. 1237.69 s [algebraic-graphs]
  18320. 1237.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  18321. 1237.69 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  18322. 1237.69 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18323. 1237.69 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  18324. 1237.69 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  18325. 1237.69 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  18326. 1237.69 s [algebraic-graphs]
  18327. 1237.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  18328. 1237.69 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  18329. 1245.05 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  18330. 1245.05 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  18331. 1245.10 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  18332. 1245.10 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18333. 1245.10 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  18334. 1245.10 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  18335. 1245.10 s [algebraic-graphs]
  18336. 1245.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  18337. 1245.10 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  18338. 1245.10 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18339. 1245.10 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  18340. 1245.10 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  18341. 1245.10 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  18342. 1245.10 s [algebraic-graphs]
  18343. 1245.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  18344. 1245.10 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  18345. 1245.10 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  18346. 1245.10 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  18347. 1245.10 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  18348. 1245.10 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  18349. 1245.10 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  18350. 1245.10 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  18351. 1245.10 s [algebraic-graphs]
  18352. 1245.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  18353. 1245.10 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  18354. 1245.10 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  18355. 1245.10 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  18356. 1245.10 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  18357. 1245.11 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  18358. 1245.11 s [algebraic-graphs]
  18359. 1245.11 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  18360. 1245.11 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  18361. 1245.11 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  18362. 1245.11 s [algebraic-graphs]
  18363. 1245.11 s [algebraic-graphs] ============ Export.Eq ============
  18364. 1245.11 s [algebraic-graphs] OK: mempty /= literal ""
  18365. 1245.11 s [algebraic-graphs]
  18366. 1245.11 s [algebraic-graphs] ============ Export.Ord ============
  18367. 1245.11 s [algebraic-graphs] OK: mempty < literal ""
  18368. 1245.11 s [algebraic-graphs]
  18369. 1245.11 s [algebraic-graphs] ============ Export.isEmpty ============
  18370. 1245.11 s [algebraic-graphs] OK: isEmpty mempty == True
  18371. 1245.11 s [algebraic-graphs] OK: isEmpty (literal "") == False
  18372. 1245.11 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  18373. 1245.11 s [algebraic-graphs]
  18374. 1245.11 s [algebraic-graphs] ============ Export.literal ============
  18375. 1245.11 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  18376. 1245.11 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  18377. 1245.11 s [algebraic-graphs] OK: render . literal == id
  18378. 1245.11 s [algebraic-graphs]
  18379. 1245.11 s [algebraic-graphs] ============ Export.render ============
  18380. 1245.11 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  18381. 1245.11 s [algebraic-graphs] OK: render mempty == mempty
  18382. 1245.11 s [algebraic-graphs]
  18383. 1245.11 s [algebraic-graphs] ============ Export.<+> ============
  18384. 1245.11 s [algebraic-graphs] OK: x <+> mempty == x
  18385. 1245.11 s [algebraic-graphs] OK: mempty <+> x == x
  18386. 1245.11 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  18387. 1245.12 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  18388. 1245.12 s [algebraic-graphs]
  18389. 1245.12 s [algebraic-graphs] ============ Export.brackets ============
  18390. 1245.12 s [algebraic-graphs] OK: brackets "i" == "[i]"
  18391. 1245.12 s [algebraic-graphs] OK: brackets mempty == "[]"
  18392. 1245.12 s [algebraic-graphs]
  18393. 1245.12 s [algebraic-graphs] ============ Export.doubleQuotes ============
  18394. 1245.12 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  18395. 1245.12 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  18396. 1245.12 s [algebraic-graphs]
  18397. 1245.12 s [algebraic-graphs] ============ Export.indent ============
  18398. 1245.12 s [algebraic-graphs] OK: indent 0 == id
  18399. 1245.12 s [algebraic-graphs] OK: indent 1 mempty == " "
  18400. 1245.12 s [algebraic-graphs]
  18401. 1245.12 s [algebraic-graphs] ============ Export.unlines ============
  18402. 1245.12 s [algebraic-graphs] OK: unlines [] == mempty
  18403. 1245.12 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  18404. 1245.12 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  18405. 1245.12 s [algebraic-graphs]
  18406. 1245.12 s [algebraic-graphs] ============ Export.export ============
  18407. 1245.12 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  18408. 1245.12 s [algebraic-graphs]
  18409. 1245.12 s [algebraic-graphs] ============ Export.Dot.export ============
  18410. 1245.12 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18411. 1245.12 s [algebraic-graphs]
  18412. 1245.12 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  18413. 1245.12 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18414. 1245.12 s [algebraic-graphs]
  18415. 1245.12 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  18416. 1245.12 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  18417. 1245.12 s [algebraic-graphs]
  18418. 1245.12 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  18419. 1245.12 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  18420. 1245.12 s [algebraic-graphs]
  18421. 1245.12 s [algebraic-graphs] ============ Graph ============
  18422. 1245.12 s [algebraic-graphs] OK: Axioms of graphs
  18423. 1245.12 s [algebraic-graphs] OK: Theorems of graphs
  18424. 1245.12 s [algebraic-graphs]
  18425. 1245.12 s [algebraic-graphs] ============ Graph.Ord ============
  18426. 1245.13 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18427. 1245.13 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18428. 1245.13 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18429. 1245.13 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18430. 1245.13 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18431. 1245.13 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18432. 1245.13 s [algebraic-graphs] OK: x <= x + y
  18433. 1245.13 s [algebraic-graphs] OK: x + y <= x * y
  18434. 1245.13 s [algebraic-graphs]
  18435. 1245.13 s [algebraic-graphs] ============ Graph.empty ============
  18436. 1245.13 s [algebraic-graphs] OK: isEmpty empty == True
  18437. 1245.13 s [algebraic-graphs] OK: hasVertex x empty == False
  18438. 1245.13 s [algebraic-graphs] OK: vertexCount empty == 0
  18439. 1245.13 s [algebraic-graphs] OK: edgeCount empty == 0
  18440. 1245.13 s [algebraic-graphs]
  18441. 1245.13 s [algebraic-graphs] ============ Graph.vertex ============
  18442. 1245.13 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18443. 1245.13 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18444. 1245.13 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18445. 1245.13 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18446. 1245.13 s [algebraic-graphs]
  18447. 1245.13 s [algebraic-graphs] ============ Graph.edge ============
  18448. 1245.13 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18449. 1245.13 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18450. 1245.13 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18451. 1245.13 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18452. 1245.13 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18453. 1245.13 s [algebraic-graphs]
  18454. 1245.13 s [algebraic-graphs] ============ Graph.overlay ============
  18455. 1245.13 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18456. 1245.13 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18457. 1245.13 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18458. 1245.13 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18459. 1245.13 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18460. 1245.13 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18461. 1245.13 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18462. 1245.13 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18463. 1245.13 s [algebraic-graphs]
  18464. 1245.13 s [algebraic-graphs] ============ Graph.connect ============
  18465. 1245.13 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18466. 1245.13 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18467. 1245.13 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18468. 1245.13 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18469. 1245.13 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18470. 1245.14 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18471. 1245.14 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18472. 1245.14 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18473. 1245.14 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18474. 1245.14 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18475. 1245.14 s [algebraic-graphs]
  18476. 1245.14 s [algebraic-graphs] ============ Graph.vertices ============
  18477. 1245.14 s [algebraic-graphs] OK: vertices [] == empty
  18478. 1245.14 s [algebraic-graphs] OK: vertices [x] == vertex x
  18479. 1245.14 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18480. 1245.15 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18481. 1245.15 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18482. 1245.15 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18483. 1245.15 s [algebraic-graphs]
  18484. 1245.15 s [algebraic-graphs] ============ Graph.edges ============
  18485. 1245.16 s [algebraic-graphs] OK: edges [] == empty
  18486. 1245.16 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18487. 1245.16 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18488. 1245.16 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18489. 1245.16 s [algebraic-graphs]
  18490. 1245.16 s [algebraic-graphs] ============ Graph.overlays ============
  18491. 1245.16 s [algebraic-graphs] OK: overlays [] == empty
  18492. 1245.16 s [algebraic-graphs] OK: overlays [x] == x
  18493. 1245.16 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18494. 1245.16 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18495. 1245.16 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18496. 1245.16 s [algebraic-graphs]
  18497. 1245.16 s [algebraic-graphs] ============ Graph.connects ============
  18498. 1245.16 s [algebraic-graphs] OK: connects [] == empty
  18499. 1245.16 s [algebraic-graphs] OK: connects [x] == x
  18500. 1245.16 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18501. 1245.16 s [algebraic-graphs] OK: connects == foldr connect empty
  18502. 1245.16 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18503. 1245.16 s [algebraic-graphs]
  18504. 1245.16 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  18505. 1245.16 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18506. 1245.16 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18507. 1245.16 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18508. 1245.16 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18509. 1245.16 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  18510. 1245.16 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18511. 1245.16 s [algebraic-graphs]
  18512. 1245.16 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  18513. 1245.16 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  18514. 1245.16 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  18515. 1245.16 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  18516. 1245.16 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  18517. 1245.16 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  18518. 1245.16 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  18519. 1245.16 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  18520. 1245.16 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  18521. 1245.16 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  18522. 1246.79 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  18523. 1246.79 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  18524. 1246.79 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  18525. 1246.79 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  18526. 1246.79 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  18527. 1246.79 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  18528. 1246.79 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  18529. 1246.79 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  18530. 1246.79 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  18531. 1246.79 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  18532. 1246.79 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  18533. 1246.79 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  18534. 1246.79 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  18535. 1246.79 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  18536. 1246.79 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  18537. 1246.79 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  18538. 1246.79 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  18539. 1246.79 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  18540. 1246.79 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  18541. 1246.79 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18542. 1246.79 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  18543. 1246.79 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  18544. 1246.79 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  18545. 1246.79 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  18546. 1246.79 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  18547. 1246.79 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18548. 1246.79 s [algebraic-graphs]
  18549. 1246.79 s [algebraic-graphs] ============ Graph.foldg ============
  18550. 1246.79 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  18551. 1246.80 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  18552. 1246.80 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  18553. 1246.80 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  18554. 1246.80 s [algebraic-graphs]
  18555. 1246.80 s [algebraic-graphs] ============ Graph.isEmpty ============
  18556. 1246.80 s [algebraic-graphs] OK: isEmpty empty == True
  18557. 1246.80 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18558. 1246.80 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18559. 1246.80 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18560. 1246.80 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  18561. 1246.80 s [algebraic-graphs]
  18562. 1246.80 s [algebraic-graphs] ============ Graph.hasVertex ============
  18563. 1246.80 s [algebraic-graphs] OK: hasVertex x empty == False
  18564. 1246.80 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18565. 1246.80 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18566. 1246.80 s [algebraic-graphs]
  18567. 1246.80 s [algebraic-graphs] ============ Graph.hasEdge ============
  18568. 1246.80 s [algebraic-graphs] OK: hasEdge x y empty == False
  18569. 1246.80 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18570. 1246.80 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18571. 1246.80 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18572. 1246.80 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18573. 1246.80 s [algebraic-graphs]
  18574. 1246.80 s [algebraic-graphs] ============ Graph.vertexCount ============
  18575. 1246.80 s [algebraic-graphs] OK: vertexCount empty == 0
  18576. 1246.80 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18577. 1246.80 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18578. 1246.80 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18579. 1246.80 s [algebraic-graphs]
  18580. 1246.80 s [algebraic-graphs] ============ Graph.edgeCount ============
  18581. 1246.80 s [algebraic-graphs] OK: edgeCount empty == 0
  18582. 1246.80 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18583. 1246.80 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18584. 1246.80 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18585. 1246.80 s [algebraic-graphs]
  18586. 1246.80 s [algebraic-graphs] ============ Graph.vertexList ============
  18587. 1246.80 s [algebraic-graphs] OK: vertexList empty == []
  18588. 1246.80 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18589. 1246.80 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18590. 1246.80 s [algebraic-graphs]
  18591. 1246.80 s [algebraic-graphs] ============ Graph.vertexSet ============
  18592. 1246.80 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18593. 1246.80 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18594. 1246.80 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18595. 1246.80 s [algebraic-graphs]
  18596. 1246.80 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  18597. 1246.80 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  18598. 1246.80 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18599. 1246.80 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18600. 1246.80 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18601. 1246.80 s [algebraic-graphs]
  18602. 1246.80 s [algebraic-graphs] ============ Graph.edgeList ============
  18603. 1246.80 s [algebraic-graphs] OK: edgeList empty == []
  18604. 1246.80 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18605. 1246.80 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18606. 1246.80 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18607. 1246.80 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18608. 1246.80 s [algebraic-graphs]
  18609. 1246.80 s [algebraic-graphs] ============ Graph.edgeSet ============
  18610. 1246.80 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18611. 1246.80 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18612. 1246.80 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18613. 1246.80 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18614. 1246.80 s [algebraic-graphs]
  18615. 1246.80 s [algebraic-graphs] ============ Graph.adjacencyList ============
  18616. 1246.80 s [algebraic-graphs] OK: adjacencyList empty == []
  18617. 1246.80 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  18618. 1246.80 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  18619. 1246.80 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  18620. 1246.80 s [algebraic-graphs]
  18621. 1246.80 s [algebraic-graphs] ============ Graph.preSet ============
  18622. 1246.80 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18623. 1246.81 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18624. 1246.81 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18625. 1246.81 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18626. 1246.81 s [algebraic-graphs]
  18627. 1246.81 s [algebraic-graphs] ============ Graph.preIntSet ============
  18628. 1246.81 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18629. 1246.81 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18630. 1246.81 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18631. 1246.81 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18632. 1246.81 s [algebraic-graphs]
  18633. 1246.81 s [algebraic-graphs] ============ Graph.postSet ============
  18634. 1246.81 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18635. 1246.81 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18636. 1246.81 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18637. 1246.81 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18638. 1246.81 s [algebraic-graphs]
  18639. 1246.81 s [algebraic-graphs] ============ Graph.postIntSet ============
  18640. 1246.81 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18641. 1246.81 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18642. 1246.81 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18643. 1246.81 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18644. 1246.81 s [algebraic-graphs]
  18645. 1246.81 s [algebraic-graphs] ============ Graph.size ============
  18646. 1246.81 s [algebraic-graphs] OK: size empty == 1
  18647. 1246.81 s [algebraic-graphs] OK: size (vertex x) == 1
  18648. 1246.81 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  18649. 1246.81 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  18650. 1246.81 s [algebraic-graphs] OK: size x >= 1
  18651. 1246.81 s [algebraic-graphs] OK: size x >= vertexCount x
  18652. 1246.81 s [algebraic-graphs]
  18653. 1246.81 s [algebraic-graphs] ============ Graph.path ============
  18654. 1246.81 s [algebraic-graphs] OK: path [] == empty
  18655. 1246.81 s [algebraic-graphs] OK: path [x] == vertex x
  18656. 1246.81 s [algebraic-graphs] OK: path [x,y] == edge x y
  18657. 1246.81 s [algebraic-graphs]
  18658. 1246.81 s [algebraic-graphs] ============ Graph.circuit ============
  18659. 1246.81 s [algebraic-graphs] OK: circuit [] == empty
  18660. 1246.81 s [algebraic-graphs] OK: circuit [x] == edge x x
  18661. 1246.81 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18662. 1246.81 s [algebraic-graphs]
  18663. 1246.81 s [algebraic-graphs] ============ Graph.clique ============
  18664. 1246.81 s [algebraic-graphs] OK: clique [] == empty
  18665. 1246.81 s [algebraic-graphs] OK: clique [x] == vertex x
  18666. 1246.81 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18667. 1246.81 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18668. 1246.81 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18669. 1246.81 s [algebraic-graphs]
  18670. 1246.81 s [algebraic-graphs] ============ Graph.biclique ============
  18671. 1246.81 s [algebraic-graphs] OK: biclique [] [] == empty
  18672. 1246.81 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18673. 1246.81 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18674. 1246.81 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18675. 1246.81 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18676. 1246.81 s [algebraic-graphs]
  18677. 1246.81 s [algebraic-graphs] ============ Graph.star ============
  18678. 1246.81 s [algebraic-graphs] OK: star x [] == vertex x
  18679. 1246.81 s [algebraic-graphs] OK: star x [y] == edge x y
  18680. 1246.81 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18681. 1246.81 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  18682. 1246.81 s [algebraic-graphs]
  18683. 1246.81 s [algebraic-graphs] ============ Graph.stars ============
  18684. 1246.81 s [algebraic-graphs] OK: stars [] == empty
  18685. 1246.81 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  18686. 1246.81 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18687. 1246.81 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18688. 1246.81 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18689. 1246.81 s [algebraic-graphs] OK: stars . adjacencyList == id
  18690. 1246.81 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18691. 1246.81 s [algebraic-graphs]
  18692. 1246.81 s [algebraic-graphs] ============ Graph.tree ============
  18693. 1246.81 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18694. 1246.81 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  18695. 1246.81 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18696. 1246.81 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  18697. 1246.81 s [algebraic-graphs]
  18698. 1246.81 s [algebraic-graphs] ============ Graph.forest ============
  18699. 1246.81 s [algebraic-graphs] OK: forest [] == empty
  18700. 1246.81 s [algebraic-graphs] OK: forest [x] == tree x
  18701. 1246.81 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  18702. 1246.81 s [algebraic-graphs] OK: forest == overlays . map tree
  18703. 1246.81 s [algebraic-graphs]
  18704. 1246.81 s [algebraic-graphs] ============ Graph.removeVertex ============
  18705. 1256.09 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18706. 1256.09 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18707. 1256.09 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  18708. 1256.10 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  18709. 1256.10 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18710. 1256.11 s [algebraic-graphs]
  18711. 1256.11 s [algebraic-graphs] ============ Graph.removeEdge ============
  18712. 1256.11 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  18713. 1256.11 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18714. 1256.11 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18715. 1256.11 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18716. 1256.11 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18717. 1256.11 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  18718. 1256.11 s [algebraic-graphs]
  18719. 1256.11 s [algebraic-graphs] ============ Graph.replaceVertex ============
  18720. 1256.11 s [algebraic-graphs] OK: replaceVertex x x == id
  18721. 1256.11 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18722. 1256.11 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18723. 1256.11 s [algebraic-graphs]
  18724. 1256.11 s [algebraic-graphs] ============ Graph.mergeVertices ============
  18725. 1256.11 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18726. 1256.11 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18727. 1256.11 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18728. 1256.11 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18729. 1256.11 s [algebraic-graphs]
  18730. 1256.11 s [algebraic-graphs] ============ Graph.transpose ============
  18731. 1256.11 s [algebraic-graphs] OK: transpose empty == empty
  18732. 1256.11 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18733. 1256.11 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18734. 1256.11 s [algebraic-graphs] OK: transpose . transpose == id
  18735. 1256.11 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18736. 1256.11 s [algebraic-graphs]
  18737. 1256.11 s [algebraic-graphs] ============ Graph.gmap ============
  18738. 1256.11 s [algebraic-graphs] OK: gmap f empty == empty
  18739. 1256.11 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18740. 1256.11 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18741. 1256.11 s [algebraic-graphs] OK: gmap id == id
  18742. 1256.11 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18743. 1256.11 s [algebraic-graphs]
  18744. 1256.11 s [algebraic-graphs] ============ Graph.induce ============
  18745. 1256.11 s [algebraic-graphs] OK: induce (const True ) x == x
  18746. 1256.11 s [algebraic-graphs] OK: induce (const False) x == empty
  18747. 1256.11 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18748. 1256.11 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18749. 1256.11 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18750. 1256.11 s [algebraic-graphs]
  18751. 1256.11 s [algebraic-graphs] ============ Graph.induceJust ============
  18752. 1256.11 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18753. 1256.11 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18754. 1256.11 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18755. 1256.12 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18756. 1256.12 s [algebraic-graphs]
  18757. 1256.12 s [algebraic-graphs] ============ Graph.compose ============
  18758. 1256.12 s [algebraic-graphs] OK: compose empty x == empty
  18759. 1256.12 s [algebraic-graphs] OK: compose x empty == empty
  18760. 1256.12 s [algebraic-graphs] OK: compose (vertex x) y == empty
  18761. 1256.12 s [algebraic-graphs] OK: compose x (vertex y) == empty
  18762. 1256.12 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  18763. 1256.12 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  18764. 1256.12 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  18765. 1256.12 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  18766. 1256.12 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  18767. 1256.12 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  18768. 1256.12 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  18769. 1256.12 s [algebraic-graphs]
  18770. 1256.12 s [algebraic-graphs] ============ Graph.(===) ============
  18771. 1256.12 s [algebraic-graphs] OK: x === x == True
  18772. 1256.12 s [algebraic-graphs] OK: x === x + empty == False
  18773. 1256.12 s [algebraic-graphs] OK: x + y === x + y == True
  18774. 1256.12 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  18775. 1256.12 s [algebraic-graphs] OK: x + y === x * y == False
  18776. 1256.12 s [algebraic-graphs]
  18777. 1256.12 s [algebraic-graphs] ============ Graph.mesh ============
  18778. 1256.12 s [algebraic-graphs] OK: mesh xs [] == empty
  18779. 1256.12 s [algebraic-graphs] OK: mesh [] ys == empty
  18780. 1256.12 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  18781. 1256.12 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  18782. 1256.12 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  18783. 1256.12 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  18784. 1256.12 s [algebraic-graphs]
  18785. 1256.12 s [algebraic-graphs] ============ Graph.torus ============
  18786. 1256.12 s [algebraic-graphs] OK: torus xs [] == empty
  18787. 1256.12 s [algebraic-graphs] OK: torus [] ys == empty
  18788. 1256.12 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  18789. 1256.12 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  18790. 1256.12 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  18791. 1256.12 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  18792. 1256.12 s [algebraic-graphs]
  18793. 1256.12 s [algebraic-graphs] ============ Graph.deBruijn ============
  18794. 1256.12 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  18795. 1256.13 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  18796. 1256.13 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  18797. 1256.13 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  18798. 1256.13 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  18799. 1256.13 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  18800. 1256.13 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  18801. 1256.13 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  18802. 1256.13 s [algebraic-graphs]
  18803. 1256.13 s [algebraic-graphs] ============ Graph.splitVertex ============
  18804. 1256.13 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  18805. 1256.13 s [algebraic-graphs] OK: splitVertex x [x] == id
  18806. 1256.13 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  18807. 1256.13 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  18808. 1256.13 s [algebraic-graphs]
  18809. 1256.13 s [algebraic-graphs] ============ Graph.bind ============
  18810. 1256.13 s [algebraic-graphs] OK: bind empty f == empty
  18811. 1256.13 s [algebraic-graphs] OK: bind (vertex x) f == f x
  18812. 1256.13 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  18813. 1256.13 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  18814. 1256.13 s [algebraic-graphs] OK: bind x (const empty) == empty
  18815. 1256.13 s [algebraic-graphs] OK: bind x vertex == x
  18816. 1256.13 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  18817. 1256.13 s [algebraic-graphs]
  18818. 1256.13 s [algebraic-graphs] ============ Graph.simplify ============
  18819. 1256.13 s [algebraic-graphs] OK: simplify == id
  18820. 1256.13 s [algebraic-graphs] OK: size (simplify x) <= size x
  18821. 1256.13 s [algebraic-graphs]
  18822. 1256.13 s [algebraic-graphs] ============ Graph.box ============
  18823. 1256.13 s [algebraic-graphs] OK: box x y ~~ box y x
  18824. 1256.13 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  18825. 1256.13 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  18826. 1256.13 s [algebraic-graphs] OK: box x empty ~~ empty
  18827. 1256.13 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18828. 1256.13 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18829. 1256.13 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  18830. 1256.13 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18831. 1256.13 s [algebraic-graphs]
  18832. 1256.13 s [algebraic-graphs] ============ Graph.sparsify ============
  18833. 1256.13 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  18834. 1256.13 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  18835. 1256.13 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  18836. 1256.14 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  18837. 1256.14 s [algebraic-graphs]
  18838. 1256.14 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  18839. 1256.14 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  18840. 1256.14 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  18841. 1256.14 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  18842. 1256.14 s [algebraic-graphs]
  18843. 1256.14 s [algebraic-graphs] ============ Graph.context ============
  18844. 1256.14 s [algebraic-graphs] OK: context (const False) x == Nothing
  18845. 1256.14 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  18846. 1256.14 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  18847. 1256.14 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  18848. 1256.14 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  18849. 1256.14 s [algebraic-graphs]
  18850. 1256.14 s [algebraic-graphs] ============ Graph.buildg ============
  18851. 1256.14 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  18852. 1256.14 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  18853. 1256.14 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
  18854. 1256.14 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
  18855. 1256.14 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  18856. 1256.14 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  18857. 1256.14 s [algebraic-graphs]
  18858. 1256.14 s [algebraic-graphs] ============ Internal.List ============
  18859. 1256.14 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  18860. 1256.14 s [algebraic-graphs]
  18861. 1256.14 s [algebraic-graphs] ============ Graph.Label ============
  18862. 1256.14 s [algebraic-graphs]
  18863. 1256.14 s [algebraic-graphs] ============ Any: instances ============
  18864. 1256.14 s [algebraic-graphs] OK: Semiring
  18865. 1256.14 s [algebraic-graphs] OK: StarSemiring
  18866. 1256.14 s [algebraic-graphs] OK: Dioid
  18867. 1256.14 s [algebraic-graphs]
  18868. 1256.14 s [algebraic-graphs] ============ Distance Int: instances ============
  18869. 1256.14 s [algebraic-graphs] OK: Semiring
  18870. 1256.14 s [algebraic-graphs] OK: StarSemiring
  18871. 1256.14 s [algebraic-graphs] OK: Dioid
  18872. 1256.14 s [algebraic-graphs]
  18873. 1256.14 s [algebraic-graphs] ============ Capacity Int: instances ============
  18874. 1256.14 s [algebraic-graphs] OK: Semiring
  18875. 1256.14 s [algebraic-graphs] OK: StarSemiring
  18876. 1256.14 s [algebraic-graphs] OK: Dioid
  18877. 1256.14 s [algebraic-graphs]
  18878. 1256.14 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  18879. 1256.14 s [algebraic-graphs] OK: LeftNearRing
  18880. 1256.14 s [algebraic-graphs]
  18881. 1256.14 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  18882. 1256.14 s [algebraic-graphs] OK: Semiring
  18883. 1256.14 s [algebraic-graphs] OK: Dioid
  18884. 1256.14 s [algebraic-graphs]
  18885. 1256.14 s [algebraic-graphs] ============ Count Int: instances ============
  18886. 1256.14 s [algebraic-graphs] OK: Semiring
  18887. 1256.14 s [algebraic-graphs] OK: StarSemiring
  18888. 1256.14 s [algebraic-graphs]
  18889. 1256.14 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  18890. 1256.14 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  18891. 1256.14 s [algebraic-graphs] OK: empty
  18892. 1256.14 s [algebraic-graphs] OK: vertex
  18893. 1256.14 s [algebraic-graphs] OK: edge
  18894. 1256.14 s [algebraic-graphs] OK: overlay
  18895. 1256.14 s [algebraic-graphs] OK: connect
  18896. 1256.14 s [algebraic-graphs] OK: vertices
  18897. 1256.14 s [algebraic-graphs] OK: edges
  18898. 1256.14 s [algebraic-graphs] OK: overlays
  18899. 1256.14 s [algebraic-graphs] OK: fromAdjacencyMaps
  18900. 1256.14 s [algebraic-graphs] OK: removeVertex
  18901. 1256.14 s [algebraic-graphs] OK: removeEdge
  18902. 1256.14 s [algebraic-graphs] OK: replaceVertex
  18903. 1256.14 s [algebraic-graphs] OK: replaceEdge
  18904. 1256.14 s [algebraic-graphs] OK: transpose
  18905. 1256.14 s [algebraic-graphs] OK: gmap
  18906. 1256.14 s [algebraic-graphs] OK: emap
  18907. 1256.14 s [algebraic-graphs] OK: induce
  18908. 1256.14 s [algebraic-graphs] OK: closure
  18909. 1256.14 s [algebraic-graphs] OK: reflexiveClosure
  18910. 1256.14 s [algebraic-graphs] OK: symmetricClosure
  18911. 1256.14 s [algebraic-graphs] OK: transitiveClosure
  18912. 1256.14 s [algebraic-graphs]
  18913. 1256.14 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  18914. 1256.14 s [algebraic-graphs] OK: isEmpty empty == True
  18915. 1256.14 s [algebraic-graphs] OK: hasVertex x empty == False
  18916. 1256.14 s [algebraic-graphs] OK: vertexCount empty == 0
  18917. 1256.14 s [algebraic-graphs] OK: edgeCount empty == 0
  18918. 1256.14 s [algebraic-graphs]
  18919. 1256.14 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  18920. 1256.14 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18921. 1256.14 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18922. 1256.14 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18923. 1256.14 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18924. 1256.14 s [algebraic-graphs]
  18925. 1262.13 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  18926. 1262.18 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  18927. 1262.18 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  18928. 1262.18 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  18929. 1262.18 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  18930. 1262.18 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  18931. 1262.18 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  18932. 1262.18 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  18933. 1262.18 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  18934. 1262.18 s [algebraic-graphs]
  18935. 1262.18 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  18936. 1262.18 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18937. 1262.18 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18938. 1262.18 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18939. 1262.18 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18940. 1262.18 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18941. 1262.18 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18942. 1262.18 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18943. 1262.18 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18944. 1262.18 s [algebraic-graphs]
  18945. 1262.18 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  18946. 1262.18 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  18947. 1262.18 s [algebraic-graphs]
  18948. 1262.18 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  18949. 1262.18 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  18950. 1262.18 s [algebraic-graphs]
  18951. 1262.18 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  18952. 1262.19 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  18953. 1262.19 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  18954. 1262.19 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  18955. 1262.19 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  18956. 1262.19 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18957. 1262.19 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  18958. 1262.19 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  18959. 1262.19 s [algebraic-graphs]
  18960. 1262.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  18961. 1262.19 s [algebraic-graphs] OK: vertices [] == empty
  18962. 1262.19 s [algebraic-graphs] OK: vertices [x] == vertex x
  18963. 1262.19 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18964. 1262.19 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18965. 1262.19 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18966. 1262.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18967. 1262.19 s [algebraic-graphs]
  18968. 1262.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  18969. 1262.19 s [algebraic-graphs] OK: edges [] == empty
  18970. 1262.19 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  18971. 1262.19 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  18972. 1262.19 s [algebraic-graphs]
  18973. 1262.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  18974. 1262.19 s [algebraic-graphs] OK: overlays [] == empty
  18975. 1262.19 s [algebraic-graphs] OK: overlays [x] == x
  18976. 1262.19 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18977. 1262.19 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18978. 1262.19 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18979. 1262.19 s [algebraic-graphs]
  18980. 1262.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  18981. 1262.19 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  18982. 1262.19 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  18983. 1262.19 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  18984. 1262.19 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  18985. 1262.19 s [algebraic-graphs]
  18986. 1262.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  18987. 1262.20 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18988. 1262.20 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18989. 1262.20 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18990. 1262.20 s [algebraic-graphs]
  18991. 1262.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  18992. 1262.20 s [algebraic-graphs] OK: isEmpty empty == True
  18993. 1262.20 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18994. 1262.20 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18995. 1262.20 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18996. 1262.20 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  18997. 1262.20 s [algebraic-graphs]
  18998. 1262.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  18999. 1262.20 s [algebraic-graphs] OK: hasVertex x empty == False
  19000. 1262.20 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19001. 1262.20 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19002. 1262.20 s [algebraic-graphs]
  19003. 1262.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  19004. 1262.20 s [algebraic-graphs] OK: hasEdge x y empty == False
  19005. 1262.20 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19006. 1262.20 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19007. 1262.20 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19008. 1262.20 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19009. 1262.20 s [algebraic-graphs]
  19010. 1262.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  19011. 1262.20 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19012. 1262.20 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19013. 1262.20 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19014. 1262.20 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19015. 1262.20 s [algebraic-graphs]
  19016. 1262.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  19017. 1262.20 s [algebraic-graphs] OK: vertexCount empty == 0
  19018. 1262.20 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19019. 1262.20 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19020. 1262.21 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19021. 1262.21 s [algebraic-graphs]
  19022. 1262.21 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  19023. 1262.21 s [algebraic-graphs] OK: edgeCount empty == 0
  19024. 1262.21 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19025. 1262.21 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19026. 1262.21 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19027. 1262.21 s [algebraic-graphs]
  19028. 1262.21 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  19029. 1262.21 s [algebraic-graphs] OK: vertexList empty == []
  19030. 1262.21 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19031. 1262.21 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19032. 1262.21 s [algebraic-graphs]
  19033. 1262.21 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  19034. 1262.21 s [algebraic-graphs] OK: edgeList empty == []
  19035. 1262.21 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19036. 1262.21 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19037. 1262.21 s [algebraic-graphs]
  19038. 1262.21 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  19039. 1262.21 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19040. 1262.21 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19041. 1262.21 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19042. 1262.21 s [algebraic-graphs]
  19043. 1262.21 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  19044. 1262.21 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19045. 1262.21 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19046. 1262.21 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19047. 1262.21 s [algebraic-graphs]
  19048. 1262.21 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  19049. 1262.21 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19050. 1262.21 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19051. 1262.21 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19052. 1262.21 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19053. 1262.21 s [algebraic-graphs]
  19054. 1262.21 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  19055. 1262.21 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19056. 1262.21 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19057. 1262.21 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19058. 1262.21 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19059. 1262.21 s [algebraic-graphs]
  19060. 1262.21 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  19061. 1262.21 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  19062. 1262.21 s [algebraic-graphs]
  19063. 1262.21 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  19064. 1262.21 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19065. 1262.21 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19066. 1262.21 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19067. 1262.21 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19068. 1262.21 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19069. 1262.21 s [algebraic-graphs]
  19070. 1262.21 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  19071. 1262.21 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19072. 1262.21 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19073. 1262.21 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19074. 1262.21 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19075. 1262.21 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19076. 1262.22 s [algebraic-graphs]
  19077. 1262.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  19078. 1262.22 s [algebraic-graphs] OK: replaceVertex x x == id
  19079. 1262.22 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19080. 1262.22 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  19081. 1262.22 s [algebraic-graphs]
  19082. 1262.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  19083. 1262.22 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19084. 1262.22 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19085. 1262.22 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19086. 1262.22 s [algebraic-graphs]
  19087. 1262.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  19088. 1262.22 s [algebraic-graphs] OK: transpose empty == empty
  19089. 1262.22 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19090. 1262.22 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19091. 1262.22 s [algebraic-graphs] OK: transpose . transpose == id
  19092. 1262.22 s [algebraic-graphs]
  19093. 1262.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  19094. 1262.22 s [algebraic-graphs] OK: gmap f empty == empty
  19095. 1262.22 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19096. 1262.22 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  19097. 1262.22 s [algebraic-graphs] OK: gmap id == id
  19098. 1262.22 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19099. 1262.22 s [algebraic-graphs]
  19100. 1262.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  19101. 1262.22 s [algebraic-graphs] OK: emap h empty == empty
  19102. 1262.22 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19103. 1262.22 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19104. 1262.22 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19105. 1262.22 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19106. 1262.22 s [algebraic-graphs] OK: emap id == id
  19107. 1262.22 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19108. 1262.22 s [algebraic-graphs]
  19109. 1262.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  19110. 1262.22 s [algebraic-graphs] OK: induce (const True ) x == x
  19111. 1262.22 s [algebraic-graphs] OK: induce (const False) x == empty
  19112. 1262.22 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19113. 1262.22 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19114. 1262.22 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19115. 1262.22 s [algebraic-graphs]
  19116. 1262.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  19117. 1264.65 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19118. 1264.65 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19119. 1264.65 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19120. 1264.65 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19121. 1264.65 s [algebraic-graphs]
  19122. 1264.65 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  19123. 1264.65 s [algebraic-graphs] OK: closure empty == empty
  19124. 1264.65 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19125. 1264.65 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19126. 1264.65 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19127. 1264.65 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19128. 1264.65 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19129. 1264.65 s [algebraic-graphs] OK: closure . closure == closure
  19130. 1264.65 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19131. 1264.65 s [algebraic-graphs]
  19132. 1264.66 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  19133. 1264.66 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19134. 1264.66 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19135. 1264.66 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19136. 1264.66 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19137. 1264.66 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19138. 1264.66 s [algebraic-graphs]
  19139. 1264.66 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  19140. 1264.66 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19141. 1264.66 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19142. 1264.66 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19143. 1264.66 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19144. 1264.66 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19145. 1264.66 s [algebraic-graphs]
  19146. 1264.66 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  19147. 1264.66 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19148. 1264.66 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19149. 1264.66 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19150. 1264.66 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19151. 1264.66 s [algebraic-graphs]
  19152. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  19153. 1264.66 s [algebraic-graphs] OK: isEmpty empty == True
  19154. 1264.66 s [algebraic-graphs] OK: hasVertex x empty == False
  19155. 1264.66 s [algebraic-graphs] OK: vertexCount empty == 0
  19156. 1264.66 s [algebraic-graphs] OK: edgeCount empty == 0
  19157. 1264.66 s [algebraic-graphs]
  19158. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  19159. 1264.66 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19160. 1264.66 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19161. 1264.66 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19162. 1264.66 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19163. 1264.66 s [algebraic-graphs]
  19164. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  19165. 1264.66 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19166. 1264.66 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19167. 1264.66 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19168. 1264.66 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19169. 1264.66 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19170. 1264.66 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19171. 1264.66 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19172. 1264.66 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19173. 1264.66 s [algebraic-graphs]
  19174. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  19175. 1264.66 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19176. 1264.66 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19177. 1264.66 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19178. 1264.66 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19179. 1264.66 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19180. 1264.66 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19181. 1264.66 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19182. 1264.66 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19183. 1264.66 s [algebraic-graphs]
  19184. 1264.66 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19185. 1264.66 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19186. 1264.66 s [algebraic-graphs]
  19187. 1264.66 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19188. 1264.66 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19189. 1264.66 s [algebraic-graphs]
  19190. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  19191. 1264.66 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19192. 1264.66 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19193. 1264.66 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19194. 1264.66 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19195. 1264.66 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19196. 1264.66 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19197. 1264.66 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19198. 1264.66 s [algebraic-graphs]
  19199. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  19200. 1264.66 s [algebraic-graphs] OK: vertices [] == empty
  19201. 1264.66 s [algebraic-graphs] OK: vertices [x] == vertex x
  19202. 1264.66 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19203. 1264.66 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19204. 1264.66 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19205. 1264.66 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19206. 1264.66 s [algebraic-graphs]
  19207. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  19208. 1264.66 s [algebraic-graphs] OK: edges [] == empty
  19209. 1264.66 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19210. 1264.66 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19211. 1264.66 s [algebraic-graphs]
  19212. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  19213. 1264.66 s [algebraic-graphs] OK: overlays [] == empty
  19214. 1264.66 s [algebraic-graphs] OK: overlays [x] == x
  19215. 1264.66 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19216. 1264.66 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19217. 1264.66 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19218. 1264.66 s [algebraic-graphs]
  19219. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  19220. 1264.66 s [algebraic-graphs] OK: foldg empty vertex connect == id
  19221. 1264.66 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  19222. 1264.66 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  19223. 1264.66 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  19224. 1264.66 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  19225. 1264.66 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  19226. 1264.66 s [algebraic-graphs]
  19227. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  19228. 1264.66 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  19229. 1264.66 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  19230. 1264.66 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  19231. 1264.66 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  19232. 1264.66 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  19233. 1264.66 s [algebraic-graphs]
  19234. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  19235. 1264.66 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19236. 1264.66 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19237. 1264.66 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19238. 1264.66 s [algebraic-graphs]
  19239. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  19240. 1264.66 s [algebraic-graphs] OK: isEmpty empty == True
  19241. 1264.66 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19242. 1264.66 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19243. 1264.66 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19244. 1264.66 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19245. 1264.66 s [algebraic-graphs]
  19246. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.size ============
  19247. 1264.66 s [algebraic-graphs] OK: size empty == 1
  19248. 1264.66 s [algebraic-graphs] OK: size (vertex x) == 1
  19249. 1264.66 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19250. 1264.66 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19251. 1264.66 s [algebraic-graphs] OK: size x >= 1
  19252. 1264.66 s [algebraic-graphs] OK: size x >= vertexCount x
  19253. 1264.66 s [algebraic-graphs]
  19254. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  19255. 1264.66 s [algebraic-graphs] OK: hasVertex x empty == False
  19256. 1264.66 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19257. 1264.66 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19258. 1264.66 s [algebraic-graphs]
  19259. 1264.66 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  19260. 1264.67 s [algebraic-graphs] OK: hasEdge x y empty == False
  19261. 1264.67 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19262. 1264.67 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19263. 1264.67 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19264. 1264.67 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19265. 1264.67 s [algebraic-graphs]
  19266. 1264.67 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  19267. 1264.67 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19268. 1264.67 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19269. 1264.67 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19270. 1264.67 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19271. 1264.67 s [algebraic-graphs]
  19272. 1264.67 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  19273. 1264.67 s [algebraic-graphs] OK: vertexCount empty == 0
  19274. 1264.67 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19275. 1264.67 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19276. 1264.67 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19277. 1264.67 s [algebraic-graphs]
  19278. 1264.67 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  19279. 1264.67 s [algebraic-graphs] OK: edgeCount empty == 0
  19280. 1264.67 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19281. 1264.67 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19282. 1264.67 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19283. 1264.67 s [algebraic-graphs]
  19284. 1264.67 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  19285. 1264.67 s [algebraic-graphs] OK: vertexList empty == []
  19286. 1264.67 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19287. 1264.67 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19288. 1264.67 s [algebraic-graphs]
  19289. 1264.67 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  19290. 1264.67 s [algebraic-graphs] OK: edgeList empty == []
  19291. 1264.67 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19292. 1264.67 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19293. 1264.67 s [algebraic-graphs]
  19294. 1264.67 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  19295. 1264.67 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19296. 1264.67 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19297. 1264.67 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19298. 1264.67 s [algebraic-graphs]
  19299. 1264.67 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  19300. 1264.67 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19301. 1264.67 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19302. 1264.67 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19303. 1264.67 s [algebraic-graphs]
  19304. 1264.67 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  19305. 1264.67 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19306. 1264.67 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19307. 1270.35 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19308. 1270.37 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19309. 1270.37 s [algebraic-graphs]
  19310. 1270.37 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  19311. 1270.37 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19312. 1270.37 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19313. 1270.37 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19314. 1270.37 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19315. 1270.37 s [algebraic-graphs]
  19316. 1270.37 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  19317. 1270.37 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19318. 1270.37 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19319. 1270.37 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19320. 1270.37 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19321. 1270.37 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19322. 1270.37 s [algebraic-graphs]
  19323. 1270.37 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  19324. 1270.37 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19325. 1270.37 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19326. 1270.37 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19327. 1270.37 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19328. 1270.37 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19329. 1270.37 s [algebraic-graphs]
  19330. 1270.37 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  19331. 1270.37 s [algebraic-graphs] OK: replaceVertex x x == id
  19332. 1270.37 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19333. 1270.37 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  19334. 1270.37 s [algebraic-graphs]
  19335. 1270.37 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  19336. 1270.37 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19337. 1270.37 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19338. 1270.37 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19339. 1270.37 s [algebraic-graphs]
  19340. 1270.37 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  19341. 1270.37 s [algebraic-graphs] OK: transpose empty == empty
  19342. 1270.37 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19343. 1270.37 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19344. 1270.37 s [algebraic-graphs] OK: transpose . transpose == id
  19345. 1270.37 s [algebraic-graphs]
  19346. 1270.37 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  19347. 1270.37 s [algebraic-graphs] OK: fmap f empty == empty
  19348. 1270.37 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  19349. 1270.37 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  19350. 1270.37 s [algebraic-graphs] OK: fmap id == id
  19351. 1270.37 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19352. 1270.37 s [algebraic-graphs]
  19353. 1270.37 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  19354. 1270.37 s [algebraic-graphs] OK: emap h empty == empty
  19355. 1270.37 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19356. 1270.37 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19357. 1270.37 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19358. 1270.37 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19359. 1270.37 s [algebraic-graphs] OK: emap id == id
  19360. 1270.37 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19361. 1270.37 s [algebraic-graphs]
  19362. 1270.37 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  19363. 1270.37 s [algebraic-graphs] OK: induce (const True ) x == x
  19364. 1270.37 s [algebraic-graphs] OK: induce (const False) x == empty
  19365. 1270.37 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19366. 1270.37 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19367. 1270.37 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19368. 1270.37 s [algebraic-graphs]
  19369. 1270.37 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  19370. 1270.37 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19371. 1270.37 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19372. 1270.37 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19373. 1270.37 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19374. 1270.37 s [algebraic-graphs]
  19375. 1270.38 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  19376. 1270.38 s [algebraic-graphs] OK: closure empty == empty
  19377. 1270.38 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19378. 1270.38 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19379. 1270.38 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19380. 1270.38 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19381. 1270.38 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19382. 1270.38 s [algebraic-graphs] OK: closure . closure == closure
  19383. 1270.38 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19384. 1270.38 s [algebraic-graphs]
  19385. 1270.38 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  19386. 1270.38 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19387. 1270.38 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19388. 1270.38 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19389. 1270.38 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19390. 1270.38 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19391. 1270.38 s [algebraic-graphs]
  19392. 1270.38 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  19393. 1270.38 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19394. 1270.38 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19395. 1270.38 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19396. 1270.38 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19397. 1270.38 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19398. 1270.38 s [algebraic-graphs]
  19399. 1270.38 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  19400. 1270.38 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19401. 1270.38 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19402. 1270.38 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19403. 1270.38 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19404. 1270.38 s [algebraic-graphs]
  19405. 1270.38 s [algebraic-graphs] ============ Labelled.Graph.context ============
  19406. 1270.38 s [algebraic-graphs] OK: context (const False) x == Nothing
  19407. 1270.38 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  19408. 1270.38 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  19409. 1270.38 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  19410. 1270.38 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  19411. 1270.38 s [algebraic-graphs]
  19412. 1270.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  19413. 1270.38 s [algebraic-graphs] OK: Axioms of non-empty graphs
  19414. 1270.38 s [algebraic-graphs] OK: Theorems of non-empty graphs
  19415. 1270.38 s [algebraic-graphs]
  19416. 1270.38 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  19417. 1270.38 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19418. 1270.38 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19419. 1270.38 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19420. 1270.38 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19421. 1270.38 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19422. 1270.38 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19423. 1270.38 s [algebraic-graphs] OK: x <= x + y
  19424. 1270.38 s [algebraic-graphs] OK: x + y <= x * y
  19425. 1270.38 s [algebraic-graphs]
  19426. 1270.38 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  19427. 1270.38 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  19428. 1270.38 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  19429. 1270.38 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  19430. 1270.38 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  19431. 1270.38 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  19432. 1270.38 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  19433. 1270.38 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  19434. 1270.38 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  19435. 1270.38 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  19436. 1270.38 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  19437. 1270.38 s [algebraic-graphs]
  19438. 1270.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  19439. 1270.38 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  19440. 1270.38 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  19441. 1270.38 s [algebraic-graphs]
  19442. 1270.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  19443. 1270.38 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  19444. 1270.38 s [algebraic-graphs]
  19445. 1270.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  19446. 1270.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19447. 1270.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19448. 1270.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19449. 1270.38 s [algebraic-graphs]
  19450. 1270.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  19451. 1270.38 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19452. 1270.38 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19453. 1270.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19454. 1270.38 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19455. 1270.38 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19456. 1270.38 s [algebraic-graphs]
  19457. 1270.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  19458. 1270.38 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19459. 1270.38 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19460. 1270.38 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19461. 1270.38 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19462. 1270.38 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19463. 1270.39 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19464. 1270.39 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19465. 1270.39 s [algebraic-graphs]
  19466. 1270.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  19467. 1270.39 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19468. 1270.39 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19469. 1270.39 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19470. 1270.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19471. 1270.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19472. 1270.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19473. 1270.39 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19474. 1270.39 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19475. 1270.39 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19476. 1270.39 s [algebraic-graphs]
  19477. 1270.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  19478. 1270.39 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  19479. 1270.39 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  19480. 1270.39 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  19481. 1270.39 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19482. 1270.39 s [algebraic-graphs]
  19483. 1270.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  19484. 1270.39 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  19485. 1270.39 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  19486. 1270.39 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  19487. 1270.39 s [algebraic-graphs]
  19488. 1274.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  19489. 1274.94 s [algebraic-graphs] OK: overlays1 [x] == x
  19490. 1274.94 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  19491. 1274.94 s [algebraic-graphs]
  19492. 1274.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  19493. 1274.94 s [algebraic-graphs] OK: connects1 [x] == x
  19494. 1274.94 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  19495. 1274.94 s [algebraic-graphs]
  19496. 1274.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  19497. 1274.94 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19498. 1274.94 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19499. 1274.94 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  19500. 1274.94 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19501. 1274.94 s [algebraic-graphs]
  19502. 1274.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  19503. 1274.94 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19504. 1274.94 s [algebraic-graphs]
  19505. 1274.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  19506. 1274.94 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19507. 1274.94 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19508. 1274.94 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19509. 1274.94 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19510. 1274.94 s [algebraic-graphs]
  19511. 1274.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  19512. 1274.94 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19513. 1274.94 s [algebraic-graphs] OK: vertexCount x >= 1
  19514. 1274.94 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  19515. 1274.94 s [algebraic-graphs]
  19516. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  19517. 1274.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19518. 1274.95 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19519. 1274.95 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19520. 1274.95 s [algebraic-graphs]
  19521. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  19522. 1274.95 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  19523. 1274.95 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  19524. 1274.95 s [algebraic-graphs]
  19525. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  19526. 1274.95 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19527. 1274.95 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19528. 1274.95 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19529. 1274.95 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  19530. 1274.95 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19531. 1274.95 s [algebraic-graphs]
  19532. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  19533. 1274.95 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19534. 1274.95 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19535. 1274.95 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  19536. 1274.95 s [algebraic-graphs]
  19537. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  19538. 1274.95 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19539. 1274.95 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19540. 1274.95 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  19541. 1274.95 s [algebraic-graphs]
  19542. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  19543. 1274.95 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19544. 1274.95 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19545. 1274.95 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19546. 1274.95 s [algebraic-graphs]
  19547. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  19548. 1274.95 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19549. 1274.95 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19550. 1274.95 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19551. 1274.95 s [algebraic-graphs]
  19552. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  19553. 1274.95 s [algebraic-graphs] OK: path1 [x] == vertex x
  19554. 1274.95 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  19555. 1274.95 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  19556. 1274.95 s [algebraic-graphs]
  19557. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  19558. 1274.95 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  19559. 1274.95 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  19560. 1274.95 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  19561. 1274.95 s [algebraic-graphs]
  19562. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  19563. 1274.95 s [algebraic-graphs] OK: clique1 [x] == vertex x
  19564. 1274.95 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  19565. 1274.95 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  19566. 1274.95 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  19567. 1274.95 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  19568. 1274.95 s [algebraic-graphs]
  19569. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  19570. 1274.95 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19571. 1274.95 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  19572. 1274.95 s [algebraic-graphs]
  19573. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  19574. 1274.95 s [algebraic-graphs] OK: star x [] == vertex x
  19575. 1274.95 s [algebraic-graphs] OK: star x [y] == edge x y
  19576. 1274.95 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  19577. 1274.95 s [algebraic-graphs]
  19578. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  19579. 1274.95 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  19580. 1274.95 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  19581. 1274.95 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  19582. 1274.95 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  19583. 1274.95 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  19584. 1274.95 s [algebraic-graphs]
  19585. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  19586. 1274.95 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19587. 1274.95 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  19588. 1274.95 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19589. 1274.95 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  19590. 1274.95 s [algebraic-graphs]
  19591. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  19592. 1274.95 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  19593. 1274.95 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  19594. 1274.95 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  19595. 1274.95 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  19596. 1274.95 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  19597. 1274.95 s [algebraic-graphs]
  19598. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  19599. 1274.95 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  19600. 1274.95 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19601. 1274.95 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19602. 1274.95 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19603. 1274.95 s [algebraic-graphs]
  19604. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  19605. 1274.95 s [algebraic-graphs] OK: replaceVertex x x == id
  19606. 1274.95 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19607. 1274.95 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19608. 1274.95 s [algebraic-graphs]
  19609. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  19610. 1274.95 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19611. 1274.95 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19612. 1274.95 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19613. 1274.95 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19614. 1274.95 s [algebraic-graphs]
  19615. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  19616. 1274.95 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19617. 1274.95 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19618. 1274.95 s [algebraic-graphs] OK: transpose . transpose == id
  19619. 1274.95 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19620. 1274.95 s [algebraic-graphs]
  19621. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  19622. 1274.95 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19623. 1274.95 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19624. 1274.95 s [algebraic-graphs] OK: gmap id == id
  19625. 1274.95 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19626. 1274.95 s [algebraic-graphs]
  19627. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  19628. 1274.95 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  19629. 1274.95 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  19630. 1274.95 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  19631. 1274.95 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  19632. 1274.95 s [algebraic-graphs]
  19633. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  19634. 1274.95 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  19635. 1274.95 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  19636. 1274.95 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  19637. 1274.95 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  19638. 1274.95 s [algebraic-graphs]
  19639. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  19640. 1274.95 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  19641. 1274.95 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  19642. 1274.95 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  19643. 1274.95 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  19644. 1274.95 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19645. 1274.95 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19646. 1274.95 s [algebraic-graphs] OK: closure . closure == closure
  19647. 1274.95 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19648. 1274.95 s [algebraic-graphs]
  19649. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  19650. 1274.95 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  19651. 1274.95 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  19652. 1274.95 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  19653. 1274.95 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19654. 1274.95 s [algebraic-graphs]
  19655. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  19656. 1274.95 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19657. 1274.95 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  19658. 1274.95 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19659. 1274.95 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19660. 1274.95 s [algebraic-graphs]
  19661. 1274.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  19662. 1274.95 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19663. 1274.96 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  19664. 1274.96 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  19665. 1274.96 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19666. 1274.96 s [algebraic-graphs]
  19667. 1274.96 s [algebraic-graphs] ============ NonEmpty.Graph.============
  19668. 1274.96 s [algebraic-graphs] OK: Axioms of non-empty graphs
  19669. 1274.96 s [algebraic-graphs] OK: Theorems of non-empty graphs
  19670. 1274.96 s [algebraic-graphs]
  19671. 1274.96 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  19672. 1274.96 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19673. 1274.96 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19674. 1274.96 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19675. 1274.96 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19676. 1274.96 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19677. 1274.96 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19678. 1274.96 s [algebraic-graphs] OK: x <= x + y
  19679. 1274.96 s [algebraic-graphs] OK: x + y <= x * y
  19680. 1274.96 s [algebraic-graphs]
  19681. 1274.96 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  19682. 1274.96 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  19683. 1274.96 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  19684. 1274.96 s [algebraic-graphs] OK: fmap id == id
  19685. 1274.96 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19686. 1274.96 s [algebraic-graphs]
  19687. 1274.96 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  19688. 1274.96 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  19689. 1277.62 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  19690. 1277.62 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  19691. 1277.65 s [algebraic-graphs] OK: (x >>= vertex) == x
  19692. 1277.65 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  19693. 1277.65 s [algebraic-graphs]
  19694. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  19695. 1277.66 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  19696. 1277.66 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  19697. 1277.66 s [algebraic-graphs]
  19698. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  19699. 1277.66 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19700. 1277.66 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19701. 1277.66 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19702. 1277.66 s [algebraic-graphs] OK: size (vertex x) == 1
  19703. 1277.66 s [algebraic-graphs]
  19704. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  19705. 1277.66 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19706. 1277.66 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19707. 1277.66 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19708. 1277.66 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19709. 1277.66 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19710. 1277.66 s [algebraic-graphs]
  19711. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  19712. 1277.66 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19713. 1277.66 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19714. 1277.66 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19715. 1277.66 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19716. 1277.66 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19717. 1277.66 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19718. 1277.66 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19719. 1277.66 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19720. 1277.66 s [algebraic-graphs]
  19721. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  19722. 1277.66 s [algebraic-graphs] OK: overlay1 empty x == x
  19723. 1277.66 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  19724. 1277.66 s [algebraic-graphs]
  19725. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  19726. 1277.66 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19727. 1277.66 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19728. 1277.66 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19729. 1277.66 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19730. 1277.66 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19731. 1277.66 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19732. 1277.66 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19733. 1277.66 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19734. 1277.66 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19735. 1277.66 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19736. 1277.66 s [algebraic-graphs]
  19737. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  19738. 1277.66 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  19739. 1277.66 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  19740. 1277.66 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  19741. 1277.66 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19742. 1277.66 s [algebraic-graphs]
  19743. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  19744. 1277.66 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  19745. 1277.66 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  19746. 1277.66 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  19747. 1277.66 s [algebraic-graphs]
  19748. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  19749. 1277.66 s [algebraic-graphs] OK: overlays1 [x] == x
  19750. 1277.66 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  19751. 1277.66 s [algebraic-graphs]
  19752. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  19753. 1277.66 s [algebraic-graphs] OK: connects1 [x] == x
  19754. 1277.66 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  19755. 1277.66 s [algebraic-graphs]
  19756. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  19757. 1277.66 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  19758. 1277.66 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  19759. 1277.66 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  19760. 1277.66 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  19761. 1277.66 s [algebraic-graphs]
  19762. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  19763. 1277.66 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19764. 1277.66 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19765. 1277.66 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  19766. 1277.66 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19767. 1277.66 s [algebraic-graphs]
  19768. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  19769. 1277.66 s [algebraic-graphs] OK: x === x == True
  19770. 1277.66 s [algebraic-graphs] OK: x + y === x + y == True
  19771. 1277.66 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  19772. 1277.66 s [algebraic-graphs] OK: x + y === x * y == False
  19773. 1277.66 s [algebraic-graphs]
  19774. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  19775. 1277.66 s [algebraic-graphs] OK: size (vertex x) == 1
  19776. 1277.66 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19777. 1277.66 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19778. 1277.66 s [algebraic-graphs] OK: size x >= 1
  19779. 1277.66 s [algebraic-graphs] OK: size x >= vertexCount x
  19780. 1277.66 s [algebraic-graphs]
  19781. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  19782. 1277.66 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19783. 1277.66 s [algebraic-graphs]
  19784. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  19785. 1277.66 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19786. 1277.66 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19787. 1277.66 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19788. 1277.66 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19789. 1277.66 s [algebraic-graphs]
  19790. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  19791. 1277.66 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19792. 1277.66 s [algebraic-graphs] OK: vertexCount x >= 1
  19793. 1277.66 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  19794. 1277.66 s [algebraic-graphs]
  19795. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  19796. 1277.66 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19797. 1277.66 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19798. 1277.66 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19799. 1277.66 s [algebraic-graphs]
  19800. 1277.66 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  19801. 1277.66 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  19802. 1277.66 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  19803. 1277.66 s [algebraic-graphs]
  19804. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  19805. 1277.67 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19806. 1277.67 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19807. 1277.67 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19808. 1277.67 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  19809. 1277.67 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19810. 1277.67 s [algebraic-graphs]
  19811. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  19812. 1277.67 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19813. 1277.67 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19814. 1277.67 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  19815. 1277.67 s [algebraic-graphs]
  19816. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  19817. 1277.67 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19818. 1277.67 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19819. 1277.67 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  19820. 1277.67 s [algebraic-graphs]
  19821. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  19822. 1277.67 s [algebraic-graphs] OK: path1 [x] == vertex x
  19823. 1277.67 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  19824. 1277.67 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  19825. 1277.67 s [algebraic-graphs]
  19826. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  19827. 1277.67 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  19828. 1277.67 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  19829. 1277.67 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  19830. 1277.67 s [algebraic-graphs]
  19831. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  19832. 1277.67 s [algebraic-graphs] OK: clique1 [x] == vertex x
  19833. 1277.67 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  19834. 1277.67 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  19835. 1277.67 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  19836. 1277.67 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  19837. 1277.67 s [algebraic-graphs]
  19838. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  19839. 1277.67 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19840. 1277.67 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  19841. 1277.67 s [algebraic-graphs]
  19842. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  19843. 1277.67 s [algebraic-graphs] OK: star x [] == vertex x
  19844. 1277.67 s [algebraic-graphs] OK: star x [y] == edge x y
  19845. 1277.67 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  19846. 1277.67 s [algebraic-graphs]
  19847. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  19848. 1277.67 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  19849. 1277.67 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  19850. 1277.67 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  19851. 1277.67 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  19852. 1277.67 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  19853. 1277.67 s [algebraic-graphs]
  19854. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  19855. 1277.67 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19856. 1277.67 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  19857. 1277.67 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19858. 1277.67 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  19859. 1277.67 s [algebraic-graphs]
  19860. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  19861. 1277.67 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  19862. 1277.67 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  19863. 1277.67 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  19864. 1277.67 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  19865. 1277.67 s [algebraic-graphs]
  19866. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  19867. 1277.67 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  19868. 1277.67 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  19869. 1277.67 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  19870. 1277.67 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  19871. 1277.67 s [algebraic-graphs]
  19872. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  19873. 1277.67 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  19874. 1277.67 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  19875. 1277.67 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  19876. 1277.67 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  19877. 1277.67 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  19878. 1277.67 s [algebraic-graphs]
  19879. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  19880. 1277.67 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  19881. 1277.67 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19882. 1277.67 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19883. 1277.67 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19884. 1277.67 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  19885. 1277.67 s [algebraic-graphs]
  19886. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  19887. 1277.67 s [algebraic-graphs] OK: replaceVertex x x == id
  19888. 1277.67 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19889. 1277.67 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19890. 1277.67 s [algebraic-graphs]
  19891. 1277.67 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  19892. 1277.67 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19893. 1288.56 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19894. 1288.56 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19895. 1288.61 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19896. 1288.61 s [algebraic-graphs]
  19897. 1288.61 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  19898. 1288.61 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  19899. 1288.61 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  19900. 1288.61 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  19901. 1288.61 s [algebraic-graphs]
  19902. 1288.61 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  19903. 1288.61 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19904. 1288.61 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19905. 1288.61 s [algebraic-graphs] OK: transpose . transpose == id
  19906. 1288.61 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19907. 1288.61 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19908. 1288.61 s [algebraic-graphs]
  19909. 1288.61 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  19910. 1288.61 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  19911. 1288.61 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  19912. 1288.61 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  19913. 1288.61 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  19914. 1288.61 s [algebraic-graphs]
  19915. 1288.62 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  19916. 1288.62 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  19917. 1288.62 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  19918. 1288.62 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  19919. 1288.62 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  19920. 1288.62 s [algebraic-graphs]
  19921. 1288.62 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  19922. 1288.62 s [algebraic-graphs] OK: simplify == id
  19923. 1288.62 s [algebraic-graphs] OK: size (simplify x) <= size x
  19924. 1288.62 s [algebraic-graphs] OK: simplify 1 === 1
  19925. 1288.62 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  19926. 1288.62 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  19927. 1288.62 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  19928. 1288.62 s [algebraic-graphs]
  19929. 1288.62 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  19930. 1288.62 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  19931. 1288.62 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  19932. 1288.62 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  19933. 1288.62 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  19934. 1288.62 s [algebraic-graphs]
  19935. 1288.62 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  19936. 1288.62 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  19937. 1288.62 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  19938. 1288.62 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  19939. 1288.62 s [algebraic-graphs]
  19940. 1288.62 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  19941. 1288.62 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  19942. 1288.62 s [algebraic-graphs] OK: box x y ~~ box y x
  19943. 1288.62 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  19944. 1288.62 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19945. 1288.62 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19946. 1288.62 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19947. 1288.62 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19948. 1288.62 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19949. 1288.62 s [algebraic-graphs]
  19950. 1288.62 s [algebraic-graphs] ============ Relation ============
  19951. 1288.62 s [algebraic-graphs] OK: Axioms of graphs
  19952. 1288.62 s [algebraic-graphs]
  19953. 1288.62 s [algebraic-graphs] ============ Relation.consistent ============
  19954. 1288.62 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  19955. 1288.62 s [algebraic-graphs]
  19956. 1288.62 s [algebraic-graphs] OK: consistent empty == True
  19957. 1288.62 s [algebraic-graphs] OK: consistent (vertex x) == True
  19958. 1288.62 s [algebraic-graphs] OK: consistent (overlay x y) == True
  19959. 1288.62 s [algebraic-graphs] OK: consistent (connect x y) == True
  19960. 1288.62 s [algebraic-graphs] OK: consistent (edge x y) == True
  19961. 1288.62 s [algebraic-graphs] OK: consistent (edges xs) == True
  19962. 1288.62 s [algebraic-graphs] OK: consistent (stars xs) == True
  19963. 1288.62 s [algebraic-graphs]
  19964. 1288.62 s [algebraic-graphs] ============ Relation.Show ============
  19965. 1288.62 s [algebraic-graphs] OK: show (empty ) == "empty"
  19966. 1288.62 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  19967. 1288.62 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  19968. 1288.62 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  19969. 1288.62 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  19970. 1288.62 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  19971. 1288.62 s [algebraic-graphs]
  19972. 1288.62 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  19973. 1288.62 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  19974. 1288.62 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  19975. 1288.62 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  19976. 1288.62 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  19977. 1288.62 s [algebraic-graphs]
  19978. 1288.62 s [algebraic-graphs] ============ Relation.Ord ============
  19979. 1288.62 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19980. 1288.62 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19981. 1288.62 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19982. 1288.62 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19983. 1288.62 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19984. 1288.62 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19985. 1288.62 s [algebraic-graphs] OK: x <= x + y
  19986. 1288.62 s [algebraic-graphs] OK: x + y <= x * y
  19987. 1288.62 s [algebraic-graphs]
  19988. 1288.62 s [algebraic-graphs] ============ Relation.empty ============
  19989. 1288.62 s [algebraic-graphs] OK: isEmpty empty == True
  19990. 1288.62 s [algebraic-graphs] OK: hasVertex x empty == False
  19991. 1288.62 s [algebraic-graphs] OK: vertexCount empty == 0
  19992. 1288.62 s [algebraic-graphs] OK: edgeCount empty == 0
  19993. 1288.62 s [algebraic-graphs]
  19994. 1288.62 s [algebraic-graphs] ============ Relation.vertex ============
  19995. 1288.62 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19996. 1288.62 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19997. 1288.62 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19998. 1288.62 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19999. 1288.62 s [algebraic-graphs]
  20000. 1288.62 s [algebraic-graphs] ============ Relation.edge ============
  20001. 1288.62 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20002. 1288.62 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20003. 1288.62 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20004. 1288.62 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20005. 1288.62 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20006. 1288.62 s [algebraic-graphs]
  20007. 1288.62 s [algebraic-graphs] ============ Relation.overlay ============
  20008. 1288.62 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20009. 1288.62 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20010. 1288.62 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20011. 1288.62 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20012. 1288.62 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20013. 1288.62 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20014. 1288.62 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20015. 1288.62 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20016. 1288.62 s [algebraic-graphs]
  20017. 1288.62 s [algebraic-graphs] ============ Relation.connect ============
  20018. 1288.62 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20019. 1288.62 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20020. 1288.62 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20021. 1288.62 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20022. 1288.62 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20023. 1288.62 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20024. 1288.62 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20025. 1288.62 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20026. 1288.62 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20027. 1288.62 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20028. 1288.62 s [algebraic-graphs]
  20029. 1288.62 s [algebraic-graphs] ============ Relation.vertices ============
  20030. 1288.62 s [algebraic-graphs] OK: vertices [] == empty
  20031. 1288.62 s [algebraic-graphs] OK: vertices [x] == vertex x
  20032. 1288.62 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20033. 1288.62 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20034. 1288.62 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20035. 1288.62 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20036. 1288.62 s [algebraic-graphs]
  20037. 1288.62 s [algebraic-graphs] ============ Relation.edges ============
  20038. 1288.62 s [algebraic-graphs] OK: edges [] == empty
  20039. 1288.62 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20040. 1288.62 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20041. 1288.62 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20042. 1288.62 s [algebraic-graphs]
  20043. 1288.62 s [algebraic-graphs] ============ Relation.overlays ============
  20044. 1288.62 s [algebraic-graphs] OK: overlays [] == empty
  20045. 1288.62 s [algebraic-graphs] OK: overlays [x] == x
  20046. 1288.62 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20047. 1288.62 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20048. 1288.62 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20049. 1288.62 s [algebraic-graphs]
  20050. 1288.62 s [algebraic-graphs] ============ Relation.connects ============
  20051. 1288.62 s [algebraic-graphs] OK: connects [] == empty
  20052. 1288.62 s [algebraic-graphs] OK: connects [x] == x
  20053. 1288.62 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20054. 1288.62 s [algebraic-graphs] OK: connects == foldr connect empty
  20055. 1288.62 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20056. 1288.62 s [algebraic-graphs]
  20057. 1288.62 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  20058. 1288.62 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20059. 1288.62 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20060. 1288.62 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20061. 1288.62 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20062. 1288.62 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20063. 1288.62 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20064. 1288.62 s [algebraic-graphs]
  20065. 1288.62 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  20066. 1288.62 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20067. 1288.62 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20068. 1288.62 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20069. 1288.62 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20070. 1288.62 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20071. 1288.62 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20072. 1288.62 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20073. 1288.62 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20074. 1288.62 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20075. 1288.62 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20076. 1288.62 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20077. 1288.62 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20078. 1288.62 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20079. 1288.62 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20080. 1288.62 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20081. 1288.62 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20082. 1288.62 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20083. 1292.67 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20084. 1292.67 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20085. 1292.67 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20086. 1292.67 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20087. 1292.67 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20088. 1292.67 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20089. 1292.67 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20090. 1292.67 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20091. 1292.67 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20092. 1292.67 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20093. 1292.67 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20094. 1292.67 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20095. 1292.67 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20096. 1292.67 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20097. 1292.67 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20098. 1292.67 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20099. 1292.67 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20100. 1292.67 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20101. 1292.67 s [algebraic-graphs]
  20102. 1292.67 s [algebraic-graphs] ============ Relation.foldg ============
  20103. 1292.67 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20104. 1292.67 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20105. 1292.67 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20106. 1292.67 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20107. 1292.67 s [algebraic-graphs]
  20108. 1292.67 s [algebraic-graphs] ============ Relation.isEmpty ============
  20109. 1292.67 s [algebraic-graphs] OK: isEmpty empty == True
  20110. 1292.67 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20111. 1292.67 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20112. 1292.67 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20113. 1292.67 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20114. 1292.67 s [algebraic-graphs]
  20115. 1292.67 s [algebraic-graphs] ============ Relation.hasVertex ============
  20116. 1292.67 s [algebraic-graphs] OK: hasVertex x empty == False
  20117. 1292.67 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20118. 1292.67 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20119. 1292.67 s [algebraic-graphs]
  20120. 1292.67 s [algebraic-graphs] ============ Relation.hasEdge ============
  20121. 1292.67 s [algebraic-graphs] OK: hasEdge x y empty == False
  20122. 1292.67 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20123. 1292.67 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20124. 1292.67 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20125. 1292.67 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20126. 1292.67 s [algebraic-graphs]
  20127. 1292.67 s [algebraic-graphs] ============ Relation.vertexCount ============
  20128. 1292.67 s [algebraic-graphs] OK: vertexCount empty == 0
  20129. 1292.67 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20130. 1292.67 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20131. 1292.67 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20132. 1292.67 s [algebraic-graphs]
  20133. 1292.67 s [algebraic-graphs] ============ Relation.edgeCount ============
  20134. 1292.67 s [algebraic-graphs] OK: edgeCount empty == 0
  20135. 1292.67 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20136. 1292.67 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20137. 1292.67 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20138. 1292.67 s [algebraic-graphs]
  20139. 1292.67 s [algebraic-graphs] ============ Relation.vertexList ============
  20140. 1292.67 s [algebraic-graphs] OK: vertexList empty == []
  20141. 1292.67 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20142. 1292.67 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20143. 1292.67 s [algebraic-graphs]
  20144. 1292.67 s [algebraic-graphs] ============ Relation.vertexSet ============
  20145. 1292.67 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20146. 1292.67 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20147. 1292.67 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20148. 1292.67 s [algebraic-graphs]
  20149. 1292.67 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  20150. 1292.67 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20151. 1292.67 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20152. 1292.67 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20153. 1292.67 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20154. 1292.67 s [algebraic-graphs]
  20155. 1292.67 s [algebraic-graphs] ============ Relation.edgeList ============
  20156. 1292.67 s [algebraic-graphs] OK: edgeList empty == []
  20157. 1292.68 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20158. 1292.68 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20159. 1292.68 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20160. 1292.68 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20161. 1292.68 s [algebraic-graphs]
  20162. 1292.68 s [algebraic-graphs] ============ Relation.edgeSet ============
  20163. 1292.68 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20164. 1292.68 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20165. 1292.68 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20166. 1292.68 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20167. 1292.68 s [algebraic-graphs]
  20168. 1292.68 s [algebraic-graphs] ============ Relation.adjacencyList ============
  20169. 1292.68 s [algebraic-graphs] OK: adjacencyList empty == []
  20170. 1292.68 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20171. 1292.68 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20172. 1292.68 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20173. 1292.68 s [algebraic-graphs]
  20174. 1292.68 s [algebraic-graphs] ============ Relation.preSet ============
  20175. 1292.68 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20176. 1292.68 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20177. 1292.68 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20178. 1292.68 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20179. 1292.68 s [algebraic-graphs]
  20180. 1292.68 s [algebraic-graphs] ============ Relation.preIntSet ============
  20181. 1292.68 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20182. 1292.68 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20183. 1292.68 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20184. 1292.68 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20185. 1292.68 s [algebraic-graphs]
  20186. 1292.68 s [algebraic-graphs] ============ Relation.postSet ============
  20187. 1292.68 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20188. 1292.68 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20189. 1292.68 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20190. 1292.68 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20191. 1292.68 s [algebraic-graphs]
  20192. 1292.68 s [algebraic-graphs] ============ Relation.postIntSet ============
  20193. 1292.68 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20194. 1292.68 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20195. 1292.68 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20196. 1292.68 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20197. 1292.68 s [algebraic-graphs]
  20198. 1292.68 s [algebraic-graphs] ============ Relation.path ============
  20199. 1292.68 s [algebraic-graphs] OK: path [] == empty
  20200. 1292.68 s [algebraic-graphs] OK: path [x] == vertex x
  20201. 1292.68 s [algebraic-graphs] OK: path [x,y] == edge x y
  20202. 1292.68 s [algebraic-graphs]
  20203. 1292.68 s [algebraic-graphs] ============ Relation.circuit ============
  20204. 1292.68 s [algebraic-graphs] OK: circuit [] == empty
  20205. 1292.68 s [algebraic-graphs] OK: circuit [x] == edge x x
  20206. 1292.68 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20207. 1292.68 s [algebraic-graphs]
  20208. 1292.68 s [algebraic-graphs] ============ Relation.clique ============
  20209. 1292.68 s [algebraic-graphs] OK: clique [] == empty
  20210. 1292.68 s [algebraic-graphs] OK: clique [x] == vertex x
  20211. 1292.68 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20212. 1292.68 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20213. 1292.68 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20214. 1292.68 s [algebraic-graphs]
  20215. 1292.68 s [algebraic-graphs] ============ Relation.biclique ============
  20216. 1292.68 s [algebraic-graphs] OK: biclique [] [] == empty
  20217. 1292.68 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20218. 1292.68 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20219. 1292.68 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20220. 1292.68 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20221. 1292.68 s [algebraic-graphs]
  20222. 1292.68 s [algebraic-graphs] ============ Relation.star ============
  20223. 1292.68 s [algebraic-graphs] OK: star x [] == vertex x
  20224. 1292.68 s [algebraic-graphs] OK: star x [y] == edge x y
  20225. 1292.68 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20226. 1292.68 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20227. 1292.68 s [algebraic-graphs]
  20228. 1292.68 s [algebraic-graphs] ============ Relation.stars ============
  20229. 1292.68 s [algebraic-graphs] OK: stars [] == empty
  20230. 1292.68 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20231. 1292.68 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20232. 1292.68 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20233. 1292.68 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20234. 1292.68 s [algebraic-graphs] OK: stars . adjacencyList == id
  20235. 1292.68 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20236. 1292.68 s [algebraic-graphs]
  20237. 1292.68 s [algebraic-graphs] ============ Relation.tree ============
  20238. 1292.68 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20239. 1292.68 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20240. 1292.68 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20241. 1292.68 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20242. 1292.68 s [algebraic-graphs]
  20243. 1292.68 s [algebraic-graphs] ============ Relation.forest ============
  20244. 1292.68 s [algebraic-graphs] OK: forest [] == empty
  20245. 1292.68 s [algebraic-graphs] OK: forest [x] == tree x
  20246. 1292.68 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20247. 1292.68 s [algebraic-graphs] OK: forest == overlays . map tree
  20248. 1292.68 s [algebraic-graphs]
  20249. 1292.68 s [algebraic-graphs] ============ Relation.removeVertex ============
  20250. 1292.68 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20251. 1292.68 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20252. 1292.68 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20253. 1292.68 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20254. 1292.68 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20255. 1292.68 s [algebraic-graphs]
  20256. 1292.68 s [algebraic-graphs] ============ Relation.removeEdge ============
  20257. 1292.68 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20258. 1292.68 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20259. 1292.68 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20260. 1292.68 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20261. 1292.68 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20262. 1292.68 s [algebraic-graphs]
  20263. 1292.68 s [algebraic-graphs] ============ Relation.replaceVertex ============
  20264. 1292.68 s [algebraic-graphs] OK: replaceVertex x x == id
  20265. 1292.68 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20266. 1292.68 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20267. 1292.68 s [algebraic-graphs]
  20268. 1292.68 s [algebraic-graphs] ============ Relation.mergeVertices ============
  20269. 1292.68 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20270. 1326.61 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20271. 1326.61 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20272. 1326.63 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20273. 1326.63 s [algebraic-graphs]
  20274. 1326.63 s [algebraic-graphs] ============ Relation.transpose ============
  20275. 1326.63 s [algebraic-graphs] OK: transpose empty == empty
  20276. 1326.63 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20277. 1326.63 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20278. 1326.64 s [algebraic-graphs] OK: transpose . transpose == id
  20279. 1326.64 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20280. 1326.64 s [algebraic-graphs]
  20281. 1326.64 s [algebraic-graphs] ============ Relation.gmap ============
  20282. 1326.64 s [algebraic-graphs] OK: gmap f empty == empty
  20283. 1326.64 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20284. 1326.64 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20285. 1326.64 s [algebraic-graphs] OK: gmap id == id
  20286. 1326.64 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20287. 1326.64 s [algebraic-graphs]
  20288. 1326.64 s [algebraic-graphs] ============ Relation.induce ============
  20289. 1326.64 s [algebraic-graphs] OK: induce (const True ) x == x
  20290. 1326.64 s [algebraic-graphs] OK: induce (const False) x == empty
  20291. 1326.64 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20292. 1326.64 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20293. 1326.64 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20294. 1326.64 s [algebraic-graphs]
  20295. 1326.64 s [algebraic-graphs] ============ Relation.compose ============
  20296. 1326.64 s [algebraic-graphs] OK: compose empty x == empty
  20297. 1326.64 s [algebraic-graphs] OK: compose x empty == empty
  20298. 1326.64 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20299. 1326.64 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20300. 1326.64 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20301. 1326.64 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20302. 1326.64 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20303. 1326.64 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20304. 1326.64 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20305. 1326.64 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20306. 1326.64 s [algebraic-graphs]
  20307. 1326.64 s [algebraic-graphs] ============ Relation.closure ============
  20308. 1326.64 s [algebraic-graphs] OK: closure empty == empty
  20309. 1326.64 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20310. 1326.64 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20311. 1326.64 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20312. 1326.64 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20313. 1326.64 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20314. 1326.64 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20315. 1326.64 s [algebraic-graphs] OK: closure . closure == closure
  20316. 1326.64 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20317. 1326.64 s [algebraic-graphs]
  20318. 1326.64 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  20319. 1326.64 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20320. 1326.64 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20321. 1326.64 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20322. 1326.64 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20323. 1326.64 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20324. 1326.64 s [algebraic-graphs]
  20325. 1326.64 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  20326. 1326.64 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20327. 1326.64 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20328. 1326.64 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20329. 1326.64 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20330. 1326.64 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20331. 1326.64 s [algebraic-graphs]
  20332. 1326.64 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  20333. 1326.64 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20334. 1326.64 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20335. 1326.64 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20336. 1326.64 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20337. 1326.64 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20338. 1326.64 s [algebraic-graphs]
  20339. 1326.64 s [algebraic-graphs] ============ Relation.induceJust ============
  20340. 1326.64 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20341. 1326.64 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20342. 1326.64 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20343. 1326.64 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20344. 1326.64 s [algebraic-graphs]
  20345. 1326.64 s [algebraic-graphs] ============ ReflexiveRelation ============
  20346. 1326.64 s [algebraic-graphs] OK: Axioms of reflexive graphs
  20347. 1326.64 s [algebraic-graphs]
  20348. 1326.64 s [algebraic-graphs] ============ TransitiveRelation ============
  20349. 1326.64 s [algebraic-graphs] OK: Axioms of transitive graphs
  20350. 1326.64 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  20351. 1326.64 s [algebraic-graphs]
  20352. 1326.64 s [algebraic-graphs] ============ PreorderRelation ============
  20353. 1326.64 s [algebraic-graphs] OK: Axioms of preorder graphs
  20354. 1326.64 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  20355. 1326.64 s [algebraic-graphs]
  20356. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation ============
  20357. 1326.64 s [algebraic-graphs] OK: Axioms of undirected graphs
  20358. 1326.64 s [algebraic-graphs]
  20359. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  20360. 1326.64 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20361. 1326.64 s [algebraic-graphs]
  20362. 1326.64 s [algebraic-graphs] OK: consistent empty == True
  20363. 1326.64 s [algebraic-graphs] OK: consistent (vertex x) == True
  20364. 1326.64 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20365. 1326.64 s [algebraic-graphs] OK: consistent (connect x y) == True
  20366. 1326.64 s [algebraic-graphs] OK: consistent (edge x y) == True
  20367. 1326.64 s [algebraic-graphs] OK: consistent (edges xs) == True
  20368. 1326.64 s [algebraic-graphs] OK: consistent (stars xs) == True
  20369. 1326.64 s [algebraic-graphs]
  20370. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  20371. 1326.64 s [algebraic-graphs] OK: show (empty ) == "empty"
  20372. 1326.64 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20373. 1326.64 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20374. 1326.64 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20375. 1326.64 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20376. 1326.64 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20377. 1326.64 s [algebraic-graphs]
  20378. 1326.64 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20379. 1326.64 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20380. 1326.64 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20381. 1326.64 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20382. 1326.64 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20383. 1326.64 s [algebraic-graphs]
  20384. 1326.64 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  20385. 1326.64 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  20386. 1326.64 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  20387. 1326.64 s [algebraic-graphs]
  20388. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  20389. 1326.64 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  20390. 1326.64 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  20391. 1326.64 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  20392. 1326.64 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  20393. 1326.64 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  20394. 1326.64 s [algebraic-graphs]
  20395. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  20396. 1326.64 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  20397. 1326.64 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  20398. 1326.64 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  20399. 1326.64 s [algebraic-graphs]
  20400. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  20401. 1326.64 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20402. 1326.64 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20403. 1326.64 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20404. 1326.64 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20405. 1326.64 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20406. 1326.64 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  20407. 1326.64 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  20408. 1326.64 s [algebraic-graphs] OK: x <= x + y
  20409. 1326.64 s [algebraic-graphs] OK: x + y <= x * y
  20410. 1326.64 s [algebraic-graphs]
  20411. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  20412. 1326.64 s [algebraic-graphs] OK: isEmpty empty == True
  20413. 1326.64 s [algebraic-graphs] OK: hasVertex x empty == False
  20414. 1326.64 s [algebraic-graphs] OK: vertexCount empty == 0
  20415. 1326.64 s [algebraic-graphs] OK: edgeCount empty == 0
  20416. 1326.64 s [algebraic-graphs]
  20417. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  20418. 1326.64 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20419. 1326.64 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20420. 1326.64 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20421. 1326.64 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20422. 1326.64 s [algebraic-graphs]
  20423. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  20424. 1326.64 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20425. 1326.64 s [algebraic-graphs] OK: edge x y == edge y x
  20426. 1326.64 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  20427. 1326.64 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20428. 1326.64 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20429. 1326.64 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20430. 1326.64 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20431. 1326.64 s [algebraic-graphs]
  20432. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  20433. 1326.64 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20434. 1326.64 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20435. 1326.64 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20436. 1326.64 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20437. 1326.64 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20438. 1326.64 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20439. 1326.64 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20440. 1326.64 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20441. 1326.64 s [algebraic-graphs]
  20442. 1326.64 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  20443. 1326.64 s [algebraic-graphs] OK: connect x y == connect y x
  20444. 1326.64 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20445. 1326.64 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20446. 1326.64 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20447. 1326.64 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20448. 1326.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20449. 1326.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20450. 1326.65 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  20451. 1326.65 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20452. 1326.65 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20453. 1326.65 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20454. 1326.65 s [algebraic-graphs]
  20455. 1326.65 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  20456. 1326.65 s [algebraic-graphs] OK: vertices [] == empty
  20457. 1326.65 s [algebraic-graphs] OK: vertices [x] == vertex x
  20458. 1326.65 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20459. 1326.65 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20460. 1326.65 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20461. 1326.65 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20462. 1326.65 s [algebraic-graphs]
  20463. 1326.65 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  20464. 1326.65 s [algebraic-graphs] OK: edges [] == empty
  20465. 1326.65 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20466. 1326.65 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  20467. 1326.65 s [algebraic-graphs]
  20468. 1326.65 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  20469. 1326.65 s [algebraic-graphs] OK: overlays [] == empty
  20470. 1351.67 s [algebraic-graphs] OK: overlays [x] == x
  20471. 1351.69 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20472. 1351.69 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20473. 1351.69 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20474. 1351.69 s [algebraic-graphs]
  20475. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  20476. 1351.69 s [algebraic-graphs] OK: connects [] == empty
  20477. 1351.69 s [algebraic-graphs] OK: connects [x] == x
  20478. 1351.69 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20479. 1351.69 s [algebraic-graphs] OK: connects == foldr connect empty
  20480. 1351.69 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20481. 1351.69 s [algebraic-graphs] OK: connects == connects . reverse
  20482. 1351.69 s [algebraic-graphs]
  20483. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  20484. 1351.69 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20485. 1351.69 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20486. 1351.69 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20487. 1351.69 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20488. 1351.69 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20489. 1351.69 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20490. 1351.69 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  20491. 1351.69 s [algebraic-graphs]
  20492. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  20493. 1351.69 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20494. 1351.69 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20495. 1351.69 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20496. 1351.69 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20497. 1351.69 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20498. 1351.69 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20499. 1351.69 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20500. 1351.69 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20501. 1351.69 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20502. 1351.69 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20503. 1351.69 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20504. 1351.69 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20505. 1351.69 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20506. 1351.69 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20507. 1351.69 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20508. 1351.69 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20509. 1351.69 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20510. 1351.69 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20511. 1351.69 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20512. 1351.69 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20513. 1351.69 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20514. 1351.69 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20515. 1351.69 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20516. 1351.69 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20517. 1351.69 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20518. 1351.69 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20519. 1351.69 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20520. 1351.69 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20521. 1351.69 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20522. 1351.69 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20523. 1351.69 s [algebraic-graphs]
  20524. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  20525. 1351.69 s [algebraic-graphs] OK: isEmpty empty == True
  20526. 1351.69 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20527. 1351.69 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20528. 1351.69 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20529. 1351.69 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20530. 1351.69 s [algebraic-graphs]
  20531. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  20532. 1351.69 s [algebraic-graphs] OK: hasVertex x empty == False
  20533. 1351.69 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20534. 1351.69 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20535. 1351.69 s [algebraic-graphs]
  20536. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  20537. 1351.69 s [algebraic-graphs] OK: hasEdge x y empty == False
  20538. 1351.69 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20539. 1351.69 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20540. 1351.69 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  20541. 1351.69 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20542. 1351.69 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  20543. 1351.69 s [algebraic-graphs]
  20544. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  20545. 1351.69 s [algebraic-graphs] OK: vertexCount empty == 0
  20546. 1351.69 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20547. 1351.69 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20548. 1351.69 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20549. 1351.69 s [algebraic-graphs]
  20550. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  20551. 1351.69 s [algebraic-graphs] OK: edgeCount empty == 0
  20552. 1351.69 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20553. 1351.69 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20554. 1351.69 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20555. 1351.69 s [algebraic-graphs]
  20556. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  20557. 1351.69 s [algebraic-graphs] OK: vertexList empty == []
  20558. 1351.69 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20559. 1351.69 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20560. 1351.69 s [algebraic-graphs]
  20561. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  20562. 1351.69 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20563. 1351.69 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20564. 1351.69 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20565. 1351.69 s [algebraic-graphs]
  20566. 1351.69 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  20567. 1351.69 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20568. 1351.70 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20569. 1351.70 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20570. 1351.70 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20571. 1351.70 s [algebraic-graphs]
  20572. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  20573. 1351.70 s [algebraic-graphs] OK: edgeList empty == []
  20574. 1351.70 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20575. 1351.70 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  20576. 1351.70 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  20577. 1351.70 s [algebraic-graphs]
  20578. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  20579. 1351.70 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20580. 1351.70 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20581. 1351.70 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  20582. 1351.70 s [algebraic-graphs]
  20583. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  20584. 1351.70 s [algebraic-graphs] OK: adjacencyList empty == []
  20585. 1351.70 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20586. 1351.70 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  20587. 1351.70 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  20588. 1351.70 s [algebraic-graphs]
  20589. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  20590. 1351.70 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  20591. 1351.70 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  20592. 1351.70 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  20593. 1351.70 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  20594. 1351.70 s [algebraic-graphs]
  20595. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  20596. 1351.70 s [algebraic-graphs] OK: path [] == empty
  20597. 1351.70 s [algebraic-graphs] OK: path [x] == vertex x
  20598. 1351.70 s [algebraic-graphs] OK: path [x,y] == edge x y
  20599. 1351.70 s [algebraic-graphs] OK: path == path . reverse
  20600. 1351.70 s [algebraic-graphs]
  20601. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  20602. 1351.70 s [algebraic-graphs] OK: circuit [] == empty
  20603. 1351.70 s [algebraic-graphs] OK: circuit [x] == edge x x
  20604. 1351.70 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20605. 1351.70 s [algebraic-graphs] OK: circuit == circuit . reverse
  20606. 1351.70 s [algebraic-graphs]
  20607. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  20608. 1351.70 s [algebraic-graphs] OK: clique [] == empty
  20609. 1351.70 s [algebraic-graphs] OK: clique [x] == vertex x
  20610. 1351.70 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20611. 1351.70 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20612. 1351.70 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20613. 1351.70 s [algebraic-graphs] OK: clique == clique . reverse
  20614. 1351.70 s [algebraic-graphs]
  20615. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  20616. 1351.70 s [algebraic-graphs] OK: biclique [] [] == empty
  20617. 1351.70 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20618. 1351.70 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20619. 1351.70 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20620. 1351.70 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20621. 1351.70 s [algebraic-graphs]
  20622. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  20623. 1351.70 s [algebraic-graphs] OK: star x [] == vertex x
  20624. 1351.70 s [algebraic-graphs] OK: star x [y] == edge x y
  20625. 1351.70 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20626. 1351.70 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20627. 1351.70 s [algebraic-graphs]
  20628. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  20629. 1351.70 s [algebraic-graphs] OK: stars [] == empty
  20630. 1351.70 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20631. 1351.70 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20632. 1351.70 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20633. 1351.70 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20634. 1351.70 s [algebraic-graphs] OK: stars . adjacencyList == id
  20635. 1351.70 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20636. 1351.70 s [algebraic-graphs]
  20637. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  20638. 1351.70 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20639. 1351.70 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20640. 1351.70 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20641. 1351.70 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20642. 1351.70 s [algebraic-graphs]
  20643. 1351.70 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  20644. 1351.70 s [algebraic-graphs] OK: forest [] == empty
  20645. 1361.24 s [algebraic-graphs] OK: forest [x] == tree x
  20646. 1361.24 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20647. 1361.25 s [algebraic-graphs] OK: forest == overlays . map tree
  20648. 1361.25 s [algebraic-graphs]
  20649. 1361.25 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  20650. 1361.25 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20651. 1361.25 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20652. 1361.25 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20653. 1361.25 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20654. 1361.25 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20655. 1361.25 s [algebraic-graphs]
  20656. 1361.25 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  20657. 1361.25 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20658. 1361.25 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20659. 1361.25 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20660. 1361.25 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20661. 1361.25 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20662. 1361.25 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  20663. 1361.25 s [algebraic-graphs]
  20664. 1361.25 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  20665. 1361.25 s [algebraic-graphs] OK: replaceVertex x x == id
  20666. 1361.25 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20667. 1361.25 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20668. 1361.25 s [algebraic-graphs]
  20669. 1361.25 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  20670. 1361.25 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20671. 1361.25 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20672. 1361.25 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20673. 1361.25 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20674. 1361.25 s [algebraic-graphs]
  20675. 1361.25 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  20676. 1361.25 s [algebraic-graphs] OK: gmap f empty == empty
  20677. 1361.25 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20678. 1361.25 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20679. 1361.25 s [algebraic-graphs] OK: gmap id == id
  20680. 1361.25 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20681. 1361.25 s [algebraic-graphs]
  20682. 1361.25 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  20683. 1361.25 s [algebraic-graphs] OK: induce (const True ) x == x
  20684. 1361.25 s [algebraic-graphs] OK: induce (const False) x == empty
  20685. 1361.25 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20686. 1361.25 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20687. 1361.25 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20688. 1361.25 s [algebraic-graphs]
  20689. 1361.25 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  20690. 1361.25 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20691. 1361.25 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20692. 1361.25 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20693. 1361.25 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20694. 1361.25 s [algebraic-graphs]
  20695. 1361.25 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  20696. 1361.25 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  20697. 1361.25 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  20698. 1361.25 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  20699. 1361.25 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  20700. 1361.25 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  20701. 1361.25 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  20702. 1361.25 s [algebraic-graphs]
  20703. 1361.25 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  20704. 1361.25 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  20705. 1361.25 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  20706. 1361.25 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  20707. 1361.25 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  20708. 1361.25 s [algebraic-graphs]
  20709. 1361.25 s [algebraic-graphs] ============ Typed ============
  20710. 1361.25 s [algebraic-graphs]
  20711. 1361.25 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  20712. 1361.25 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  20713. 1361.25 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  20714. 1361.25 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  20715. 1361.25 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  20716. 1361.25 s [algebraic-graphs]
  20717. 1361.25 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  20718. 1361.25 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  20719. 1361.25 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  20720. 1361.25 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  20721. 1361.25 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  20722. 1361.25 s [algebraic-graphs]
  20723. 1361.25 s [algebraic-graphs] ============ Typed.dfsForest ============
  20724. 1361.25 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  20725. 1361.25 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  20726. 1361.25 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  20727. 1361.25 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  20728. 1361.25 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  20729. 1361.25 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  20730. 1361.25 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  20731. 1361.25 s [algebraic-graphs]
  20732. 1361.25 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  20733. 1361.25 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  20734. 1361.25 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  20735. 1361.25 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  20736. 1361.25 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  20737. 1361.25 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  20738. 1361.25 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  20739. 1361.25 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  20740. 1361.25 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  20741. 1361.25 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  20742. 1361.25 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  20743. 1361.25 s [algebraic-graphs]
  20744. 1361.25 s [algebraic-graphs] ============ Typed.dfs ============
  20745. 1361.25 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  20746. 1361.25 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  20747. 1361.25 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  20748. 1361.25 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  20749. 1361.25 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  20750. 1361.25 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  20751. 1361.25 s [algebraic-graphs] OK: dfs % x $ [] == []
  20752. 1361.25 s [algebraic-graphs]
  20753. 1361.25 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  20754. 1361.25 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  20755. 1361.25 s [algebraic-graphs]
  20756. 1361.25 s [algebraic-graphs] ============ Typed.topSort ============
  20757. 1361.25 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  20758. 1361.25 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  20759. 1361.25 s [algebraic-graphs]
  20760. 1361.25 s [algebraic-graphs] ============ Graph.Undirected ============
  20761. 1361.25 s [algebraic-graphs] OK: Axioms of undirected graphs
  20762. 1361.25 s [algebraic-graphs]
  20763. 1361.25 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  20764. 1361.25 s [algebraic-graphs] OK: show (empty ) == "empty"
  20765. 1361.25 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20766. 1361.25 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20767. 1361.25 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20768. 1361.25 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20769. 1361.25 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20770. 1361.25 s [algebraic-graphs]
  20771. 1361.25 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20772. 1361.25 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20773. 1361.25 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20774. 1361.25 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20775. 1361.25 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20776. 1361.25 s [algebraic-graphs]
  20777. 1361.25 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  20778. 1361.25 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  20779. 1361.25 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  20780. 1361.25 s [algebraic-graphs]
  20781. 1361.25 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  20782. 1361.25 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  20783. 1361.25 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  20784. 1361.25 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  20785. 1361.25 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  20786. 1361.25 s [algebraic-graphs]
  20787. 1361.25 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  20788. 1361.25 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  20789. 1361.25 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  20790. 1361.25 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  20791. 1361.25 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  20792. 1361.25 s [algebraic-graphs]
  20793. 1361.25 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  20794. 1361.25 s [algebraic-graphs] OK: complement empty == empty
  20795. 1361.25 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  20796. 1361.25 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  20797. 1361.25 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  20798. 1361.25 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  20799. 1361.25 s [algebraic-graphs] OK: complement . complement == id
  20800. 1361.25 s [algebraic-graphs]
  20801. 1361.25 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  20802. 1361.25 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20803. 1361.25 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20804. 1361.25 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20805. 1361.25 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20806. 1361.25 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20807. 1361.25 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  20808. 1361.25 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  20809. 1361.25 s [algebraic-graphs] OK: x <= x + y
  20810. 1361.25 s [algebraic-graphs] OK: x + y <= x * y
  20811. 1361.25 s [algebraic-graphs]
  20812. 1361.25 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  20813. 1361.25 s [algebraic-graphs] OK: isEmpty empty == True
  20814. 1361.25 s [algebraic-graphs] OK: hasVertex x empty == False
  20815. 1361.25 s [algebraic-graphs] OK: vertexCount empty == 0
  20816. 1361.25 s [algebraic-graphs] OK: edgeCount empty == 0
  20817. 1361.25 s [algebraic-graphs]
  20818. 1361.25 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  20819. 1361.25 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20820. 1361.26 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20821. 1361.26 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20822. 1361.26 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20823. 1361.26 s [algebraic-graphs]
  20824. 1361.26 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  20825. 1361.26 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20826. 1361.26 s [algebraic-graphs] OK: edge x y == edge y x
  20827. 1378.43 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  20828. 1378.43 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20829. 1378.43 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20830. 1378.44 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20831. 1378.44 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20832. 1378.44 s [algebraic-graphs]
  20833. 1378.44 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  20834. 1378.44 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20835. 1378.44 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20836. 1378.44 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20837. 1378.44 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20838. 1378.44 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20839. 1378.44 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20840. 1378.44 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20841. 1378.44 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20842. 1378.44 s [algebraic-graphs]
  20843. 1378.44 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  20844. 1378.44 s [algebraic-graphs] OK: connect x y == connect y x
  20845. 1378.44 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20846. 1378.45 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20847. 1378.45 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20848. 1378.45 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20849. 1378.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20850. 1378.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20851. 1378.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  20852. 1378.45 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20853. 1378.45 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20854. 1378.45 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20855. 1378.45 s [algebraic-graphs]
  20856. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  20857. 1378.45 s [algebraic-graphs] OK: vertices [] == empty
  20858. 1378.45 s [algebraic-graphs] OK: vertices [x] == vertex x
  20859. 1378.45 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20860. 1378.45 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20861. 1378.45 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20862. 1378.45 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20863. 1378.45 s [algebraic-graphs]
  20864. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  20865. 1378.45 s [algebraic-graphs] OK: edges [] == empty
  20866. 1378.45 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20867. 1378.45 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  20868. 1378.45 s [algebraic-graphs]
  20869. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  20870. 1378.45 s [algebraic-graphs] OK: overlays [] == empty
  20871. 1378.45 s [algebraic-graphs] OK: overlays [x] == x
  20872. 1378.45 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20873. 1378.45 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20874. 1378.45 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20875. 1378.45 s [algebraic-graphs]
  20876. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  20877. 1378.45 s [algebraic-graphs] OK: connects [] == empty
  20878. 1378.45 s [algebraic-graphs] OK: connects [x] == x
  20879. 1378.45 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20880. 1378.45 s [algebraic-graphs] OK: connects == foldr connect empty
  20881. 1378.45 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20882. 1378.45 s [algebraic-graphs] OK: connects == connects . reverse
  20883. 1378.45 s [algebraic-graphs]
  20884. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  20885. 1378.45 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20886. 1378.45 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20887. 1378.45 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20888. 1378.45 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20889. 1378.45 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20890. 1378.45 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20891. 1378.45 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  20892. 1378.45 s [algebraic-graphs]
  20893. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.path ============
  20894. 1378.45 s [algebraic-graphs] OK: path [] == empty
  20895. 1378.45 s [algebraic-graphs] OK: path [x] == vertex x
  20896. 1378.45 s [algebraic-graphs] OK: path [x,y] == edge x y
  20897. 1378.45 s [algebraic-graphs] OK: path == path . reverse
  20898. 1378.45 s [algebraic-graphs]
  20899. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  20900. 1378.45 s [algebraic-graphs] OK: circuit [] == empty
  20901. 1378.45 s [algebraic-graphs] OK: circuit [x] == edge x x
  20902. 1378.45 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20903. 1378.45 s [algebraic-graphs] OK: circuit == circuit . reverse
  20904. 1378.45 s [algebraic-graphs]
  20905. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  20906. 1378.45 s [algebraic-graphs] OK: clique [] == empty
  20907. 1378.45 s [algebraic-graphs] OK: clique [x] == vertex x
  20908. 1378.45 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20909. 1378.45 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20910. 1378.45 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20911. 1378.45 s [algebraic-graphs] OK: clique == clique . reverse
  20912. 1378.45 s [algebraic-graphs]
  20913. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  20914. 1378.45 s [algebraic-graphs] OK: biclique [] [] == empty
  20915. 1378.45 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20916. 1378.45 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20917. 1378.45 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20918. 1378.45 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20919. 1378.45 s [algebraic-graphs]
  20920. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.star ============
  20921. 1378.45 s [algebraic-graphs] OK: star x [] == vertex x
  20922. 1378.45 s [algebraic-graphs] OK: star x [y] == edge x y
  20923. 1378.45 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20924. 1378.45 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20925. 1378.45 s [algebraic-graphs]
  20926. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  20927. 1378.45 s [algebraic-graphs] OK: stars [] == empty
  20928. 1378.45 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20929. 1378.45 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20930. 1378.45 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20931. 1378.45 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20932. 1378.45 s [algebraic-graphs] OK: stars . adjacencyList == id
  20933. 1378.45 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20934. 1378.45 s [algebraic-graphs]
  20935. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  20936. 1378.45 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20937. 1378.45 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20938. 1378.45 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20939. 1378.45 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20940. 1378.45 s [algebraic-graphs]
  20941. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  20942. 1378.45 s [algebraic-graphs] OK: forest [] == empty
  20943. 1378.45 s [algebraic-graphs] OK: forest [x] == tree x
  20944. 1378.45 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20945. 1378.45 s [algebraic-graphs] OK: forest == overlays . map tree
  20946. 1378.45 s [algebraic-graphs]
  20947. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  20948. 1378.45 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20949. 1378.45 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20950. 1378.45 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20951. 1378.45 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20952. 1378.45 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20953. 1378.45 s [algebraic-graphs]
  20954. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  20955. 1378.45 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20956. 1378.45 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20957. 1378.45 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20958. 1378.45 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20959. 1378.45 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20960. 1378.45 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  20961. 1378.45 s [algebraic-graphs]
  20962. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  20963. 1378.45 s [algebraic-graphs] OK: replaceVertex x x == id
  20964. 1378.45 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20965. 1378.45 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20966. 1378.45 s [algebraic-graphs]
  20967. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  20968. 1378.45 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20969. 1378.45 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20970. 1378.45 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20971. 1378.45 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20972. 1378.45 s [algebraic-graphs]
  20973. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  20974. 1378.45 s [algebraic-graphs] OK: gmap f empty == empty
  20975. 1378.45 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20976. 1378.45 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20977. 1378.45 s [algebraic-graphs] OK: gmap id == id
  20978. 1378.45 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20979. 1378.45 s [algebraic-graphs]
  20980. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  20981. 1378.45 s [algebraic-graphs] OK: induce (const True ) x == x
  20982. 1378.45 s [algebraic-graphs] OK: induce (const False) x == empty
  20983. 1378.45 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20984. 1378.45 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20985. 1378.45 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20986. 1378.45 s [algebraic-graphs]
  20987. 1378.45 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  20988. 1378.45 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20989. 1378.45 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20990. 1378.45 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20991. 1378.45 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20992. 1378.45 s [algebraic-graphs] Test suite main: PASS
  20993. 1378.45 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  20994. 1378.45 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  20995. 1378.45 s [algebraic-graphs] checkPhase completed in 4 minutes 35 seconds
  20996. 1378.46 s [algebraic-graphs] Phase: haddockPhase
  20997. 1378.77 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  20998. 1378.78 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  20999. 1379.20 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  21000. 1379.71 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  21001. 1379.85 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  21002. 1380.08 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  21003. 1380.17 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  21004. 1380.53 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  21005. 1380.76 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  21006. 1381.03 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  21007. 1381.76 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  21008. 1382.07 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  21009. 1382.25 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  21010. 1382.42 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  21011. 1382.42 s [algebraic-graphs] In the use of ‘head’
  21012. 1382.42 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21013. 1382.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"."
  21014. 1382.42 s [algebraic-graphs] |
  21015. 1382.42 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  21016. 1382.42 s [algebraic-graphs] | ^^^^
  21017. 1382.42 s [algebraic-graphs]
  21018. 1382.42 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  21019. 1382.42 s [algebraic-graphs] In the use of ‘tail’
  21020. 1382.42 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21021. 1382.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"."
  21022. 1382.42 s [algebraic-graphs] |
  21023. 1382.42 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  21024. 1382.42 s [algebraic-graphs] | ^^^^
  21025. 1382.42 s [algebraic-graphs]
  21026. 1382.42 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  21027. 1382.42 s [algebraic-graphs] In the use of ‘head’
  21028. 1382.42 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21029. 1382.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"."
  21030. 1382.42 s [algebraic-graphs] |
  21031. 1382.43 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  21032. 1382.43 s [algebraic-graphs] | ^^^^
  21033. 1382.43 s [algebraic-graphs]
  21034. 1382.43 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  21035. 1382.43 s [algebraic-graphs] In the use of ‘tail’
  21036. 1382.43 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21037. 1382.43 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"."
  21038. 1382.43 s [algebraic-graphs] |
  21039. 1382.43 s [algebraic-graphs] 397 | bnd' = tail bnd
  21040. 1382.43 s [algebraic-graphs] | ^^^^
  21041. 1382.43 s [algebraic-graphs]
  21042. 1382.43 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  21043. 1382.50 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  21044. 1382.63 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21045. 1382.63 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21046. 1382.63 s [algebraic-graphs] will become an error in a future GHC release.
  21047. 1382.63 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21048. 1382.63 s [algebraic-graphs] |
  21049. 1382.63 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  21050. 1382.63 s [algebraic-graphs] | ^
  21051. 1382.63 s [algebraic-graphs]
  21052. 1382.63 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21053. 1382.63 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21054. 1382.63 s [algebraic-graphs] will become an error in a future GHC release.
  21055. 1382.63 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21056. 1382.63 s [algebraic-graphs] |
  21057. 1382.63 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21058. 1382.63 s [algebraic-graphs] | ^
  21059. 1382.63 s [algebraic-graphs]
  21060. 1382.63 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21061. 1382.63 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21062. 1382.63 s [algebraic-graphs] will become an error in a future GHC release.
  21063. 1382.63 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21064. 1382.63 s [algebraic-graphs] |
  21065. 1382.63 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21066. 1382.63 s [algebraic-graphs] | ^
  21067. 1382.63 s [algebraic-graphs]
  21068. 1382.63 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21069. 1382.63 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21070. 1382.63 s [algebraic-graphs] will become an error in a future GHC release.
  21071. 1382.63 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21072. 1382.63 s [algebraic-graphs] |
  21073. 1382.63 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21074. 1382.63 s [algebraic-graphs] | ^
  21075. 1382.63 s [algebraic-graphs]
  21076. 1382.63 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21077. 1382.63 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21078. 1382.63 s [algebraic-graphs] will become an error in a future GHC release.
  21079. 1382.63 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21080. 1382.63 s [algebraic-graphs] |
  21081. 1382.63 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21082. 1382.63 s [algebraic-graphs] | ^
  21083. 1382.63 s [algebraic-graphs]
  21084. 1382.63 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21085. 1382.63 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21086. 1382.63 s [algebraic-graphs] will become an error in a future GHC release.
  21087. 1382.63 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21088. 1382.63 s [algebraic-graphs] |
  21089. 1382.63 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21090. 1382.63 s [algebraic-graphs] | ^
  21091. 1382.63 s [algebraic-graphs]
  21092. 1382.63 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21093. 1382.63 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21094. 1382.63 s [algebraic-graphs] will become an error in a future GHC release.
  21095. 1382.63 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21096. 1382.63 s [algebraic-graphs] |
  21097. 1382.63 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21098. 1382.64 s [algebraic-graphs] | ^
  21099. 1382.64 s [algebraic-graphs]
  21100. 1382.64 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  21101. 1382.86 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  21102. 1382.96 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  21103. 1383.16 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  21104. 1383.50 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  21105. 1383.72 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  21106. 1383.73 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  21107. 1383.77 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  21108. 1383.82 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21109. 1383.82 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21110. 1383.82 s [algebraic-graphs] will become an error in a future GHC release.
  21111. 1383.82 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21112. 1383.82 s [algebraic-graphs] |
  21113. 1383.82 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  21114. 1383.82 s [algebraic-graphs] | ^
  21115. 1383.82 s [algebraic-graphs]
  21116. 1383.82 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  21117. 1383.87 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21118. 1383.87 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21119. 1383.87 s [algebraic-graphs] will become an error in a future GHC release.
  21120. 1383.87 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21121. 1383.87 s [algebraic-graphs] |
  21122. 1383.87 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  21123. 1383.87 s [algebraic-graphs] | ^
  21124. 1383.87 s [algebraic-graphs]
  21125. 1383.87 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21126. 1383.87 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21127. 1383.87 s [algebraic-graphs] will become an error in a future GHC release.
  21128. 1383.87 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21129. 1383.87 s [algebraic-graphs] |
  21130. 1383.88 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  21131. 1383.88 s [algebraic-graphs] | ^
  21132. 1383.88 s [algebraic-graphs]
  21133. 1383.88 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  21134. 1384.00 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  21135. 1384.20 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  21136. 1384.22 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  21137. 1384.24 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  21138. 1384.26 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  21139. 1384.29 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  21140. 1384.32 s [algebraic-graphs] Haddock coverage:
  21141. 1384.33 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21142. 1384.33 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21143. 1384.33 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21144. 1384.33 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21145. 1384.33 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21146. 1384.33 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21147. 1384.33 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21148. 1384.35 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  21149. 1384.36 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21150. 1384.36 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21151. 1384.36 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  21152. 1384.36 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21153. 1384.36 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21154. 1384.36 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21155. 1384.36 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21156. 1384.37 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  21157. 1384.39 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21158. 1384.39 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21159. 1384.39 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21160. 1384.39 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21161. 1384.39 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  21162. 1384.39 s [algebraic-graphs] Missing documentation for:
  21163. 1384.39 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  21164. 1384.39 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  21165. 1384.39 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  21166. 1384.39 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  21167. 1384.39 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21168. 1384.39 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21169. 1384.39 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  21170. 1384.39 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  21171. 1384.39 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21172. 1384.39 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  21173. 1384.39 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21174. 1384.39 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  21175. 1384.39 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  21176. 1384.39 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21177. 1384.39 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21178. 1384.39 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  21179. 1384.41 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21180. 1384.41 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  21181. 1384.41 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21182. 1384.41 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21183. 1384.41 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21184. 1384.41 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  21185. 1384.42 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  21186. 1384.43 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  21187. 1384.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21188. 1384.43 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  21189. 1384.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21190. 1384.43 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  21191. 1384.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21192. 1384.43 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  21193. 1384.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21194. 1384.43 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21195. 1384.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21196. 1384.44 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  21197. 1384.44 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21198. 1384.44 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21199. 1384.44 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21200. 1384.44 s [algebraic-graphs] Warning: 'box' is out of scope.
  21201. 1384.44 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21202. 1384.44 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  21203. 1384.44 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21204. 1384.45 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  21205. 1384.45 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21206. 1384.45 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21207. 1384.45 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21208. 1384.45 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21209. 1384.45 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21210. 1384.45 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21211. 1384.45 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21212. 1384.45 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21213. 1384.45 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21214. 1384.46 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  21215. 1384.46 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21216. 1384.46 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  21217. 1384.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21218. 1384.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21219. 1384.47 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21220. 1384.47 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  21221. 1384.48 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  21222. 1384.48 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21223. 1384.48 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  21224. 1384.48 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  21225. 1384.48 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21226. 1384.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21227. 1384.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21228. 1384.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21229. 1384.48 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21230. 1384.48 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21231. 1384.48 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21232. 1384.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21233. 1384.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21234. 1384.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21235. 1384.49 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  21236. 1384.49 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  21237. 1384.49 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  21238. 1384.49 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  21239. 1384.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21240. 1384.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21241. 1384.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  21242. 1384.49 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  21243. 1384.49 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  21244. 1384.49 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  21245. 1384.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21246. 1384.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21247. 1384.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  21248. 1384.49 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  21249. 1384.49 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  21250. 1384.49 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  21251. 1384.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21252. 1384.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21253. 1384.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  21254. 1384.49 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  21255. 1384.49 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  21256. 1384.49 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  21257. 1384.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21258. 1384.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21259. 1384.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  21260. 1384.49 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  21261. 1384.49 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  21262. 1384.49 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  21263. 1384.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21264. 1384.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21265. 1384.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  21266. 1384.49 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  21267. 1384.50 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  21268. 1384.50 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  21269. 1384.50 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21270. 1384.50 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21271. 1384.50 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21272. 1384.50 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21273. 1384.50 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21274. 1384.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21275. 1384.50 s [algebraic-graphs] Warning: 'empty' is out of scope.
  21276. 1384.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21277. 1384.50 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21278. 1384.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21279. 1384.50 s [algebraic-graphs] Warning: 'edges' is out of scope.
  21280. 1384.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21281. 1384.50 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21282. 1384.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21283. 1384.51 s [algebraic-graphs] Warning: 'stars' is out of scope.
  21284. 1384.51 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21285. 1384.51 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  21286. 1384.52 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21287. 1384.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21288. 1384.52 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21289. 1384.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21290. 1384.52 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21291. 1384.52 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21292. 1384.52 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21293. 1384.52 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21294. 1384.52 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21295. 1384.53 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21296. 1384.53 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  21297. 1384.53 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  21298. 1384.53 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21299. 1384.53 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21300. 1384.53 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21301. 1384.53 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21302. 1384.53 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  21303. 1384.53 s [algebraic-graphs] Missing documentation for:
  21304. 1384.53 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  21305. 1384.53 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21306. 1384.53 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  21307. 1384.53 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21308. 1384.53 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21309. 1384.53 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21310. 1384.53 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21311. 1384.53 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21312. 1384.53 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  21313. 1384.53 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21314. 1384.53 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21315. 1384.53 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21316. 1384.53 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21317. 1384.53 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21318. 1384.53 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  21319. 1384.53 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21320. 1384.53 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21321. 1384.53 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21322. 1384.53 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21323. 1384.53 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21324. 1384.53 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  21325. 1384.53 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21326. 1384.53 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21327. 1384.53 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21328. 1384.53 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21329. 1384.54 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  21330. 1384.54 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  21331. 1384.54 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21332. 1384.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21333. 1384.55 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21334. 1384.55 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21335. 1384.55 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  21336. 1384.55 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  21337. 1384.55 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  21338. 1384.55 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  21339. 1384.55 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21340. 1384.55 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21341. 1384.55 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  21342. 1384.56 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  21343. 1384.56 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  21344. 1384.56 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  21345. 1384.56 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  21346. 1384.56 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21347. 1384.56 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21348. 1384.56 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  21349. 1384.57 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21350. 1384.57 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  21351. 1384.57 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21352. 1384.57 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21353. 1384.57 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21354. 1384.57 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  21355. 1384.57 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  21356. 1384.57 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21357. 1384.58 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  21358. 1384.58 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21359. 1384.58 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  21360. 1384.58 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21361. 1384.58 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21362. 1384.58 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21363. 1384.58 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21364. 1384.58 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21365. 1384.58 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  21366. 1384.58 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21367. 1384.58 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21368. 1384.58 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21369. 1384.58 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21370. 1384.59 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21371. 1384.59 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21372. 1384.59 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21373. 1384.59 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21374. 1384.59 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21375. 1384.59 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21376. 1384.60 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  21377. 1384.61 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21378. 1384.61 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21379. 1384.62 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  21380. 1384.63 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21381. 1384.63 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21382. 1384.63 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21383. 1384.63 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21384. 1384.63 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21385. 1384.63 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21386. 1384.63 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  21387. 1384.63 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  21388. 1384.63 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21389. 1384.63 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21390. 1384.63 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21391. 1384.63 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21392. 1384.64 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  21393. 1384.64 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21394. 1384.64 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  21395. 1384.64 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  21396. 1384.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21397. 1384.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21398. 1384.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  21399. 1384.64 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21400. 1384.64 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  21401. 1384.64 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21402. 1384.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21403. 1384.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21404. 1384.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  21405. 1384.65 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  21406. 1384.65 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  21407. 1384.65 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  21408. 1384.65 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21409. 1384.65 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21410. 1384.65 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  21411. 1384.66 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  21412. 1384.66 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  21413. 1384.66 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  21414. 1384.66 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  21415. 1384.66 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  21416. 1384.66 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  21417. 1384.66 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21418. 1384.66 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21419. 1384.66 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  21420. 1384.67 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  21421. 1384.67 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  21422. 1384.67 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  21423. 1384.67 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  21424. 1384.67 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21425. 1384.67 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21426. 1384.67 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  21427. 1384.67 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  21428. 1384.67 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21429. 1384.67 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  21430. 1384.68 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21431. 1384.68 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  21432. 1384.68 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21433. 1384.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21434. 1384.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21435. 1384.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  21436. 1384.69 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  21437. 1384.70 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  21438. 1384.70 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  21439. 1384.70 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  21440. 1384.70 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  21441. 1384.70 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21442. 1384.70 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21443. 1384.70 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  21444. 1384.70 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  21445. 1384.70 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21446. 1384.70 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  21447. 1384.70 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  21448. 1384.70 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  21449. 1384.70 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  21450. 1384.70 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21451. 1384.70 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21452. 1384.70 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  21453. 1384.70 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  21454. 1384.70 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21455. 1384.70 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  21456. 1384.70 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  21457. 1384.70 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  21458. 1384.70 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  21459. 1384.71 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21460. 1384.71 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21461. 1384.71 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  21462. 1384.71 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  21463. 1384.71 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21464. 1384.71 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  21465. 1384.71 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  21466. 1384.71 s [algebraic-graphs] Missing documentation for:
  21467. 1384.71 s [algebraic-graphs] Module header
  21468. 1384.71 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  21469. 1384.71 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  21470. 1384.71 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  21471. 1384.71 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  21472. 1384.71 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  21473. 1384.71 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  21474. 1384.71 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  21475. 1384.71 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  21476. 1384.71 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  21477. 1384.71 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  21478. 1384.71 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21479. 1384.71 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21480. 1384.71 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  21481. 1384.71 s [algebraic-graphs] Warning: 'array' is out of scope.
  21482. 1384.71 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21483. 1384.72 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  21484. 1384.72 s [algebraic-graphs] Missing documentation for:
  21485. 1384.72 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  21486. 1385.14 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  21487. 1385.14 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  21488. 1385.14 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  21489. 1385.14 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  21490. 1385.15 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  21491. 1385.15 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  21492. 1385.15 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  21493. 1385.15 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  21494. 1385.16 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  21495. 1385.16 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  21496. 1385.17 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  21497. 1385.17 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  21498. 1385.17 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  21499. 1385.17 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  21500. 1385.18 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  21501. 1385.18 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  21502. 1385.18 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  21503. 1385.18 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  21504. 1385.19 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  21505. 1385.19 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  21506. 1385.19 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  21507. 1385.19 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  21508. 1385.19 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  21509. 1385.20 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  21510. 1385.20 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  21511. 1385.20 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  21512. 1385.22 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  21513. 1385.22 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  21514. 1385.22 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  21515. 1385.22 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  21516. 1385.22 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  21517. 1385.22 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  21518. 1385.22 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  21519. 1385.22 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  21520. 1385.22 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  21521. 1385.22 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  21522. 1385.22 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  21523. 1385.22 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  21524. 1385.22 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  21525. 1385.23 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  21526. 1385.23 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  21527. 1385.23 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  21528. 1385.24 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  21529. 1385.24 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  21530. 1385.25 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  21531. 1385.25 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  21532. 1385.25 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  21533. 1385.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  21534. 1385.25 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  21535. 1385.25 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  21536. 1385.26 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  21537. 1385.26 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  21538. 1385.27 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  21539. 1385.27 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  21540. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  21541. 1385.27 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  21542. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  21543. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  21544. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  21545. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  21546. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  21547. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  21548. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  21549. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  21550. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  21551. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  21552. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  21553. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  21554. 1385.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  21555. 1385.27 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  21556. 1385.27 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  21557. 1385.27 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  21558. 1385.27 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  21559. 1385.27 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  21560. 1385.27 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  21561. 1385.27 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  21562. 1385.27 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  21563. 1385.27 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  21564. 1385.27 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  21565. 1385.27 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  21566. 1385.27 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  21567. 1393.71 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  21568. 1393.72 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  21569. 1393.82 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  21570. 1393.82 s [algebraic-graphs] Phase: installPhase
  21571. 1393.95 s [algebraic-graphs] Installing library in /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  21572. 1395.74 s [algebraic-graphs] Phase: fixupPhase
  21573. 1395.85 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7
  21574. 1395.89 s [algebraic-graphs] shrinking /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSalgebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W-ghc9.10.1.so
  21575. 1395.93 s [algebraic-graphs] checking for references to /build/ in /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7...
  21576. 1395.99 s [algebraic-graphs] patching script interpreter paths in /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7
  21577. 1396.00 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/lib
  21578. 1396.78 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/lq5jvc9ayfhbqzrmvndwj05z2hm1x6cj-algebraic-graphs-0.7-doc
  21579. 1396.82 s [algebraic-graphs] checking for references to /build/ in /nix/store/lq5jvc9ayfhbqzrmvndwj05z2hm1x6cj-algebraic-graphs-0.7-doc...
  21580. 1396.86 s [algebraic-graphs] patching script interpreter paths in /nix/store/lq5jvc9ayfhbqzrmvndwj05z2hm1x6cj-algebraic-graphs-0.7-doc
  21581. 1397.34 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7 /nix/store/lq5jvc9ayfhbqzrmvndwj05z2hm1x6cj-algebraic-graphs-0.7-doc
  21582. 1398.85 s [algebraic-graphs:post-build] Nothing to push - all store paths are already on Cachix.
  21583. 1399.10 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7 /nix/store/lq5jvc9ayfhbqzrmvndwj05z2hm1x6cj-algebraic-graphs-0.7-doc
  21584. 1399.76 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21585. 1399.97 s [algebraic-graphs:post-build] copying 1 paths...
  21586. 1399.97 s [algebraic-graphs:post-build] copying path '/nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  21587. 1411.82 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21588. 1411.98 s [algebraic-graphs:post-build] copying 0 paths...
  21589. 1412.26 s Progress: 10 of 15 built, 155 of 155 downloaded from cache
  21590. 1412.53 s Building /nix/store/03d4ikca28a9qrfbq5l8kgvggwjqfvwq-algebraic-graph-duoids-0.0.1.0.drv
  21591. 1412.71 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  21592. 1412.72 s [algebraic-graph-duoids] Build with /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1.
  21593. 1413.26 s [algebraic-graph-duoids] Phase: unpackPhase
  21594. 1413.28 s [algebraic-graph-duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./algebraic-graphs
  21595. 1413.30 s [algebraic-graph-duoids] source root is algebraic-graphs
  21596. 1413.34 s [algebraic-graph-duoids] Phase: patchPhase
  21597. 1413.36 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  21598. 1413.37 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.rsKxKT1OXW/setup-package.conf.d -threaded
  21599. 1413.50 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.rsKxKT1OXW/Main.o )
  21600. 1413.61 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  21601. 1415.54 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  21602. 1415.55 s [algebraic-graph-duoids] Phase: configurePhase
  21603. 1415.56 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/177gj3jxawda4sfnmicgxd2rng17nlrw-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.rsKxKT1OXW/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/lib
  21604. 1415.57 s [algebraic-graph-duoids] Using Parsec parser
  21605. 1415.57 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  21606. 1416.18 s [algebraic-graph-duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  21607. 1416.72 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  21608. 1416.72 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  21609. 1416.72 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.20.0.0
  21610. 1416.72 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  21611. 1416.72 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  21612. 1416.72 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  21613. 1416.72 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  21614. 1416.72 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.20.0.0
  21615. 1416.72 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  21616. 1416.72 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  21617. 1416.72 s [algebraic-graph-duoids] hedgehog-1.5
  21618. 1416.72 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  21619. 1416.72 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  21620. 1416.72 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.20.0.0
  21621. 1416.72 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  21622. 1416.72 s [algebraic-graph-duoids] <0.25: using doctest-0.22.6
  21623. 1416.72 s [algebraic-graph-duoids] Source component graph:
  21624. 1416.72 s [algebraic-graph-duoids] component lib
  21625. 1416.72 s [algebraic-graph-duoids] component test:doctests dependency lib
  21626. 1416.72 s [algebraic-graph-duoids] component test:laws dependency lib
  21627. 1416.72 s [algebraic-graph-duoids] Configured component graph:
  21628. 1416.72 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21629. 1416.72 s [algebraic-graph-duoids] include algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  21630. 1416.72 s [algebraic-graph-duoids] include base-4.20.0.0-d8e2
  21631. 1416.72 s [algebraic-graph-duoids] include duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  21632. 1416.72 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-31LLjrEzvj7DhdKmrzOYux-doctests
  21633. 1416.72 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21634. 1416.72 s [algebraic-graph-duoids] include base-4.20.0.0-d8e2
  21635. 1416.72 s [algebraic-graph-duoids] include doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  21636. 1416.72 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-5nr45lqmaoGKKZhtXykudW-laws
  21637. 1416.72 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21638. 1416.72 s [algebraic-graph-duoids] include algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  21639. 1416.72 s [algebraic-graph-duoids] include base-4.20.0.0-d8e2
  21640. 1416.72 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  21641. 1416.72 s [algebraic-graph-duoids] include hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  21642. 1416.72 s [algebraic-graph-duoids] Linked component graph:
  21643. 1416.72 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21644. 1416.72 s [algebraic-graph-duoids] include algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  21645. 1416.72 s [algebraic-graph-duoids] include base-4.20.0.0-d8e2
  21646. 1416.72 s [algebraic-graph-duoids] include duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  21647. 1416.72 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI:Algebra.Graph.Duoid.Orphans
  21648. 1416.72 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-31LLjrEzvj7DhdKmrzOYux-doctests
  21649. 1416.72 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21650. 1416.72 s [algebraic-graph-duoids] include base-4.20.0.0-d8e2
  21651. 1416.72 s [algebraic-graph-duoids] include doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  21652. 1416.72 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-5nr45lqmaoGKKZhtXykudW-laws
  21653. 1416.72 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21654. 1416.72 s [algebraic-graph-duoids] include algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  21655. 1416.72 s [algebraic-graph-duoids] include base-4.20.0.0-d8e2
  21656. 1416.72 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  21657. 1416.72 s [algebraic-graph-duoids] include hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  21658. 1416.72 s [algebraic-graph-duoids] Ready component graph:
  21659. 1416.72 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21660. 1416.72 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  21661. 1416.72 s [algebraic-graph-duoids] depends base-4.20.0.0-d8e2
  21662. 1416.72 s [algebraic-graph-duoids] depends duoids-0.0.1.0-8obtTNiNrGCDKola4aJJJN
  21663. 1416.72 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-5nr45lqmaoGKKZhtXykudW-laws
  21664. 1416.72 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21665. 1416.72 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-AAPM0aMUT3IJEc898B7g5W
  21666. 1416.72 s [algebraic-graph-duoids] depends base-4.20.0.0-d8e2
  21667. 1416.72 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-7B9QziXFJ9xIJaSL1hRQCc
  21668. 1416.72 s [algebraic-graph-duoids] depends hedgehog-1.5-G7VpTWf9AsCJwoohauE3aa
  21669. 1416.72 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-31LLjrEzvj7DhdKmrzOYux-doctests
  21670. 1416.73 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21671. 1416.73 s [algebraic-graph-duoids] depends base-4.20.0.0-d8e2
  21672. 1416.73 s [algebraic-graph-duoids] depends doctest-0.22.6-HR3UVJoTDZTENaQZ1quT8w
  21673. 1416.73 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  21674. 1416.73 s [algebraic-graph-duoids] Using compiler: ghc-9.10.1
  21675. 1416.73 s [algebraic-graph-duoids] Using install prefix:
  21676. 1416.73 s [algebraic-graph-duoids] /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0
  21677. 1416.73 s [algebraic-graph-duoids] Executables installed in:
  21678. 1416.73 s [algebraic-graph-duoids] /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/bin
  21679. 1416.73 s [algebraic-graph-duoids] Libraries installed in:
  21680. 1416.73 s [algebraic-graph-duoids] /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21681. 1416.73 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  21682. 1416.73 s [algebraic-graph-duoids] /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5
  21683. 1416.73 s [algebraic-graph-duoids] Private executables installed in:
  21684. 1416.73 s [algebraic-graph-duoids] /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.1-c9f5/algebraic-graph-duoids-0.0.1.0
  21685. 1416.73 s [algebraic-graph-duoids] Data files installed in:
  21686. 1416.73 s [algebraic-graph-duoids] /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.1-c9f5/algebraic-graph-duoids-0.0.1.0
  21687. 1416.73 s [algebraic-graph-duoids] Documentation installed in:
  21688. 1416.73 s [algebraic-graph-duoids] /nix/store/177gj3jxawda4sfnmicgxd2rng17nlrw-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  21689. 1416.73 s [algebraic-graph-duoids] Configuration files installed in:
  21690. 1416.73 s [algebraic-graph-duoids] /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/etc
  21691. 1416.73 s [algebraic-graph-duoids] No alex found
  21692. 1416.73 s [algebraic-graph-duoids] Using ar found on system at:
  21693. 1416.73 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  21694. 1416.73 s [algebraic-graph-duoids] No c2hs found
  21695. 1416.73 s [algebraic-graph-duoids] No cpphs found
  21696. 1416.73 s [algebraic-graph-duoids] Using doctest version 0.22.6 found on system at:
  21697. 1416.73 s [algebraic-graph-duoids] /nix/store/2cb590hnnq4abkx6yb17l1iych2yf7bc-doctest-0.22.6/bin/doctest
  21698. 1416.73 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  21699. 1416.73 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  21700. 1416.73 s [algebraic-graph-duoids] Using ghc version 9.10.1 found on system at:
  21701. 1416.73 s [algebraic-graph-duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc
  21702. 1416.73 s [algebraic-graph-duoids] Using ghc-pkg version 9.10.1 found on system at:
  21703. 1416.73 s [algebraic-graph-duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/ghc-pkg-9.10.1
  21704. 1416.73 s [algebraic-graph-duoids] No ghcjs found
  21705. 1416.73 s [algebraic-graph-duoids] No ghcjs-pkg found
  21706. 1416.73 s [algebraic-graph-duoids] No greencard found
  21707. 1416.73 s [algebraic-graph-duoids] Using haddock version 2.28.0 found on system at:
  21708. 1416.73 s [algebraic-graph-duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/haddock-ghc-9.10.1
  21709. 1416.73 s [algebraic-graph-duoids] No happy found
  21710. 1416.73 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  21711. 1416.73 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  21712. 1416.73 s [algebraic-graph-duoids] No hmake found
  21713. 1416.73 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  21714. 1416.73 s [algebraic-graph-duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hpc-ghc-9.10.1
  21715. 1416.73 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  21716. 1416.73 s [algebraic-graph-duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/hsc2hs-ghc-9.10.1
  21717. 1416.73 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  21718. 1416.73 s [algebraic-graph-duoids] /nix/store/c0gbcvjjvqzy92m9ycv6zcqiczs6bvyw-hscolour-1.25/bin/HsColour
  21719. 1416.73 s [algebraic-graph-duoids] No jhc found
  21720. 1416.73 s [algebraic-graph-duoids] Using ld found on system at:
  21721. 1416.73 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  21722. 1416.73 s [algebraic-graph-duoids] No pkg-config found
  21723. 1416.73 s [algebraic-graph-duoids] Using runghc version 9.10.1 found on system at:
  21724. 1416.73 s [algebraic-graph-duoids] /nix/store/fzz7jxvkkn907krypgd70azfqcgw7jp5-ghc-9.10.1/bin/runghc-9.10.1
  21725. 1416.73 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  21726. 1416.73 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  21727. 1416.73 s [algebraic-graph-duoids] Using tar found on system at:
  21728. 1416.73 s [algebraic-graph-duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  21729. 1416.73 s [algebraic-graph-duoids] No uhc found
  21730. 1417.05 s [algebraic-graph-duoids] Phase: buildPhase
  21731. 1417.41 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  21732. 1417.46 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  21733. 1417.56 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 )
  21734. 1417.66 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 )
  21735. 1419.12 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  21736. 1419.48 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 )
  21737. 1422.64 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  21738. 1422.64 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  21739. 1422.78 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  21740. 1423.48 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  21741. 1424.78 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  21742. 1424.78 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  21743. 1425.01 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 )
  21744. 1426.01 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  21745. 1426.54 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  21746. 1433.30 s [algebraic-graph-duoids] Phase: checkPhase
  21747. 1433.88 s [algebraic-graph-duoids] Running 2 test suites...
  21748. 1433.88 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  21749. 1433.90 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  21750. 1433.91 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  21751. 1433.92 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  21752. 1433.92 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  21753. 1433.92 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  21754. 1433.92 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  21755. 1433.92 s [algebraic-graph-duoids] ✓ 5 succeeded.
  21756. 1433.92 s [algebraic-graph-duoids] Test suite laws: PASS
  21757. 1433.93 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  21758. 1433.93 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  21759. 1435.08 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  21760. 1435.17 s [algebraic-graph-duoids] Test suite doctests: PASS
  21761. 1435.17 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  21762. 1435.17 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  21763. 1435.20 s [algebraic-graph-duoids] Phase: haddockPhase
  21764. 1435.71 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  21765. 1435.71 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  21766. 1436.60 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
  21767. 1436.64 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
  21768. 1436.88 s [algebraic-graph-duoids] Haddock coverage:
  21769. 1436.88 s [algebraic-graph-duoids] 20% ( 1 / 5) in 'Algebra.Graph.Duoid'
  21770. 1436.88 s [algebraic-graph-duoids] Missing documentation for:
  21771. 1436.88 s [algebraic-graph-duoids] parEmptyGraph (src/Algebra/Graph/Duoid.hs:24)
  21772. 1436.88 s [algebraic-graph-duoids] seqEmptyGraph (src/Algebra/Graph/Duoid.hs:27)
  21773. 1436.88 s [algebraic-graph-duoids] parGraph (src/Algebra/Graph/Duoid.hs:30)
  21774. 1436.88 s [algebraic-graph-duoids] seqGraph (src/Algebra/Graph/Duoid.hs:33)
  21775. 1436.88 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  21776. 1443.94 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  21777. 1443.94 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  21778. 1444.04 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  21779. 1444.04 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  21780. 1444.06 s [algebraic-graph-duoids] Phase: installPhase
  21781. 1444.27 s [algebraic-graph-duoids] Installing library in /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/algebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI
  21782. 1444.84 s [algebraic-graph-duoids] Phase: fixupPhase
  21783. 1444.95 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0
  21784. 1444.96 s [algebraic-graph-duoids] shrinking /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.1/lib/x86_64-linux-ghc-9.10.1-c9f5/libHSalgebraic-graph-duoids-0.0.1.0-GmwqmcJAkZo7nm4QEs3TNI-ghc9.10.1.so
  21785. 1444.97 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0...
  21786. 1445.02 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0
  21787. 1445.03 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/lib
  21788. 1445.29 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/177gj3jxawda4sfnmicgxd2rng17nlrw-algebraic-graph-duoids-0.0.1.0-doc
  21789. 1445.31 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/177gj3jxawda4sfnmicgxd2rng17nlrw-algebraic-graph-duoids-0.0.1.0-doc...
  21790. 1445.33 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/177gj3jxawda4sfnmicgxd2rng17nlrw-algebraic-graph-duoids-0.0.1.0-doc
  21791. 1446.21 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/177gj3jxawda4sfnmicgxd2rng17nlrw-algebraic-graph-duoids-0.0.1.0-doc /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0
  21792. 1447.56 s [algebraic-graph-duoids:post-build] Pushing 3 paths (69 are already present) using zstd to cache sellout ⏳
  21793. 1447.56 s [algebraic-graph-duoids:post-build]
  21794. 1447.98 s [algebraic-graph-duoids:post-build] Pushing /nix/store/177gj3jxawda4sfnmicgxd2rng17nlrw-algebraic-graph-duoids-0.0.1.0-doc (528.05 KiB)
  21795. 1448.26 s [algebraic-graph-duoids:post-build] Pushing /nix/store/5i17rngglby671bra0ns7nr01v1c0340-binutils-2.44-lib (2.86 MiB)
  21796. 1448.26 s [algebraic-graph-duoids:post-build] Pushing /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0 (1.19 MiB)
  21797. 1449.40 s [algebraic-graph-duoids:post-build]
  21798. 1449.40 s [algebraic-graph-duoids:post-build] All done.
  21799. 1449.66 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/177gj3jxawda4sfnmicgxd2rng17nlrw-algebraic-graph-duoids-0.0.1.0-doc /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0
  21800. 1450.29 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21801. 1450.55 s [algebraic-graph-duoids:post-build] copying 2 paths...
  21802. 1450.55 s [algebraic-graph-duoids:post-build] copying path '/nix/store/177gj3jxawda4sfnmicgxd2rng17nlrw-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  21803. 1450.93 s [algebraic-graph-duoids:post-build] copying path '/nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  21804. 1452.31 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21805. 1452.94 s [algebraic-graph-duoids:post-build] copying 1 paths...
  21806. 1452.94 s [algebraic-graph-duoids:post-build] copying path '/nix/store/03d4ikca28a9qrfbq5l8kgvggwjqfvwq-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  21807. 1453.26 s Progress: 11 of 15 built, 155 of 155 downloaded from cache
  21808. 1453.36 s Building /nix/store/b4v4wq219rkjibwwqvn37vpv6m4hv8i8-ghc-9.10.1-with-packages.drv
  21809. 1453.46 s [ghc-9.10.1-with-packages] /nix/store/nfq4ln7wnj4msd03hn9nxyvz2ly0m73z-duoidal-transformers-0.0.1.0/nix-support:
  21810. 1453.46 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21811. 1453.47 s [ghc-9.10.1-with-packages] /nix/store/kr5zb9ii4kdiqv515f8h76l2rx6h57c2-duoids-hedgehog-0.0.1.0/nix-support:
  21812. 1453.47 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21813. 1453.48 s [ghc-9.10.1-with-packages] /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/nix-support:
  21814. 1453.48 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21815. 1453.48 s [ghc-9.10.1-with-packages] /nix/store/ik07gfib6m68f28jzk4p8yvyjnw7xmby-algebraic-graphs-0.7/nix-support:
  21816. 1453.48 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21817. 1453.49 s [ghc-9.10.1-with-packages] /nix/store/7qidk99w72crc8z5j6f4p74kx276sgj0-hedgehog-1.5/nix-support:
  21818. 1453.49 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21819. 1453.51 s [ghc-9.10.1-with-packages] /nix/store/7qidk99w72crc8z5j6f4p74kx276sgj0-hedgehog-1.5/nix-support:
  21820. 1453.51 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21821. 1453.52 s [ghc-9.10.1-with-packages] /nix/store/h0ykgdjcqlfvh1wn79x85wqw3gh546p4-ansi-terminal-1.1.2/nix-support:
  21822. 1453.52 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21823. 1453.52 s [ghc-9.10.1-with-packages] /nix/store/h0ykgdjcqlfvh1wn79x85wqw3gh546p4-ansi-terminal-1.1.2/nix-support:
  21824. 1453.52 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21825. 1453.53 s [ghc-9.10.1-with-packages] /nix/store/zcz3kjbalgr50jdw7nn03w7z682fjv6v-async-2.2.5/nix-support:
  21826. 1453.53 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21827. 1453.53 s [ghc-9.10.1-with-packages] /nix/store/zcz3kjbalgr50jdw7nn03w7z682fjv6v-async-2.2.5/nix-support:
  21828. 1453.53 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21829. 1453.55 s [ghc-9.10.1-with-packages] /nix/store/39jf1iva2mwr4391hxi1rmypmbrnc2ck-barbies-2.1.1.0/nix-support:
  21830. 1453.55 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21831. 1453.55 s [ghc-9.10.1-with-packages] /nix/store/39jf1iva2mwr4391hxi1rmypmbrnc2ck-barbies-2.1.1.0/nix-support:
  21832. 1453.55 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21833. 1453.56 s [ghc-9.10.1-with-packages] /nix/store/whq28rq9al7rp7ji21g097fimkqjfns3-concurrent-output-1.10.21/nix-support:
  21834. 1453.56 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21835. 1453.56 s [ghc-9.10.1-with-packages] /nix/store/whq28rq9al7rp7ji21g097fimkqjfns3-concurrent-output-1.10.21/nix-support:
  21836. 1453.56 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21837. 1453.58 s [ghc-9.10.1-with-packages] /nix/store/k73g4xas4had12s3kifnzaw849jksis3-lifted-async-0.10.2.7/nix-support:
  21838. 1453.58 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21839. 1453.59 s [ghc-9.10.1-with-packages] /nix/store/k73g4xas4had12s3kifnzaw849jksis3-lifted-async-0.10.2.7/nix-support:
  21840. 1453.59 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21841. 1453.60 s [ghc-9.10.1-with-packages] /nix/store/4ns9fyrq612h4i71qln0vz63mjc0klf1-mmorph-1.2.0/nix-support:
  21842. 1453.60 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21843. 1453.60 s [ghc-9.10.1-with-packages] /nix/store/4ns9fyrq612h4i71qln0vz63mjc0klf1-mmorph-1.2.0/nix-support:
  21844. 1453.60 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21845. 1453.61 s [ghc-9.10.1-with-packages] /nix/store/55q9qjdy9a2f3v9qkbgyfymzl8jv1j45-monad-control-1.0.3.1/nix-support:
  21846. 1453.61 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21847. 1453.61 s [ghc-9.10.1-with-packages] /nix/store/55q9qjdy9a2f3v9qkbgyfymzl8jv1j45-monad-control-1.0.3.1/nix-support:
  21848. 1453.61 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21849. 1453.62 s [ghc-9.10.1-with-packages] /nix/store/80jgrv3fi6lv8lvkxqsy7dngqibrl2pl-pretty-show-1.10/nix-support:
  21850. 1453.62 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21851. 1453.62 s [ghc-9.10.1-with-packages] /nix/store/80jgrv3fi6lv8lvkxqsy7dngqibrl2pl-pretty-show-1.10/nix-support:
  21852. 1453.62 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21853. 1453.63 s [ghc-9.10.1-with-packages] /nix/store/7jwqnaq1b8xd99g0hbfm8da6sp4nwhk6-primitive-0.9.1.0/nix-support:
  21854. 1453.63 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21855. 1453.63 s [ghc-9.10.1-with-packages] /nix/store/7jwqnaq1b8xd99g0hbfm8da6sp4nwhk6-primitive-0.9.1.0/nix-support:
  21856. 1453.63 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21857. 1453.64 s [ghc-9.10.1-with-packages] /nix/store/qs8m72qc11px76cafzs1g4xfdgfj1r0v-random-1.2.1.3/nix-support:
  21858. 1453.64 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21859. 1453.64 s [ghc-9.10.1-with-packages] /nix/store/qs8m72qc11px76cafzs1g4xfdgfj1r0v-random-1.2.1.3/nix-support:
  21860. 1453.64 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21861. 1453.64 s [ghc-9.10.1-with-packages] /nix/store/dgwpa65i0rag3shwqjrjj2y7fz590pzb-resourcet-1.3.0/nix-support:
  21862. 1453.64 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21863. 1453.68 s [ghc-9.10.1-with-packages] /nix/store/dgwpa65i0rag3shwqjrjj2y7fz590pzb-resourcet-1.3.0/nix-support:
  21864. 1453.68 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21865. 1453.69 s [ghc-9.10.1-with-packages] /nix/store/w48i3nmvkggzayjdrkk3hy55hix89004-safe-exceptions-0.1.7.4/nix-support:
  21866. 1453.69 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21867. 1453.69 s [ghc-9.10.1-with-packages] /nix/store/w48i3nmvkggzayjdrkk3hy55hix89004-safe-exceptions-0.1.7.4/nix-support:
  21868. 1453.69 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21869. 1453.70 s [ghc-9.10.1-with-packages] /nix/store/5ka7l66dgxc9vakyhfcid13fxcsamd01-transformers-base-0.4.6/nix-support:
  21870. 1453.70 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21871. 1453.71 s [ghc-9.10.1-with-packages] /nix/store/5ka7l66dgxc9vakyhfcid13fxcsamd01-transformers-base-0.4.6/nix-support:
  21872. 1453.71 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21873. 1453.72 s [ghc-9.10.1-with-packages] /nix/store/xrw6nxh1w6yggz98838qgbmd7x6rk22y-wl-pprint-annotated-0.1.0.1/nix-support:
  21874. 1453.72 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21875. 1453.73 s [ghc-9.10.1-with-packages] /nix/store/xrw6nxh1w6yggz98838qgbmd7x6rk22y-wl-pprint-annotated-0.1.0.1/nix-support:
  21876. 1453.73 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21877. 1453.73 s [ghc-9.10.1-with-packages] /nix/store/c38lskzzvwl25g7f7im6hr8jxh4xpi7p-ansi-terminal-types-1.1/nix-support:
  21878. 1453.73 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21879. 1453.74 s [ghc-9.10.1-with-packages] /nix/store/c38lskzzvwl25g7f7im6hr8jxh4xpi7p-ansi-terminal-types-1.1/nix-support:
  21880. 1453.74 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21881. 1453.77 s [ghc-9.10.1-with-packages] /nix/store/q91r3c043pfcxw543gkm6f86w6pqy94h-hashable-1.4.7.0/nix-support:
  21882. 1453.77 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21883. 1453.77 s [ghc-9.10.1-with-packages] /nix/store/q91r3c043pfcxw543gkm6f86w6pqy94h-hashable-1.4.7.0/nix-support:
  21884. 1453.77 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21885. 1453.78 s [ghc-9.10.1-with-packages] /nix/store/65wpgp9y9m9gqfkazsz7vwlz5dhxyllw-distributive-0.6.2.1/nix-support:
  21886. 1453.78 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21887. 1453.79 s [ghc-9.10.1-with-packages] /nix/store/65wpgp9y9m9gqfkazsz7vwlz5dhxyllw-distributive-0.6.2.1/nix-support:
  21888. 1453.79 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21889. 1453.82 s [ghc-9.10.1-with-packages] /nix/store/fgg7r9vhfkp2lihymslz124569dcg8z1-constraints-0.14.2/nix-support:
  21890. 1453.82 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21891. 1453.82 s [ghc-9.10.1-with-packages] /nix/store/fgg7r9vhfkp2lihymslz124569dcg8z1-constraints-0.14.2/nix-support:
  21892. 1453.82 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21893. 1453.83 s [ghc-9.10.1-with-packages] /nix/store/mdk4bzh727v2lq9qm3bkkxlx4blnhz8f-lifted-base-0.2.3.12/nix-support:
  21894. 1453.83 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21895. 1453.84 s [ghc-9.10.1-with-packages] /nix/store/mdk4bzh727v2lq9qm3bkkxlx4blnhz8f-lifted-base-0.2.3.12/nix-support:
  21896. 1453.84 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21897. 1453.84 s [ghc-9.10.1-with-packages] /nix/store/27xwrfajp40al1v0q9l4l1ndjidcwpx2-transformers-compat-0.7.2/nix-support:
  21898. 1453.84 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21899. 1453.85 s [ghc-9.10.1-with-packages] /nix/store/27xwrfajp40al1v0q9l4l1ndjidcwpx2-transformers-compat-0.7.2/nix-support:
  21900. 1453.85 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21901. 1453.87 s [ghc-9.10.1-with-packages] /nix/store/43hwd63lscl1vm4dac76w50qkcdlh2m7-splitmix-0.1.1/nix-support:
  21902. 1453.87 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21903. 1453.88 s [ghc-9.10.1-with-packages] /nix/store/43hwd63lscl1vm4dac76w50qkcdlh2m7-splitmix-0.1.1/nix-support:
  21904. 1453.88 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21905. 1453.89 s [ghc-9.10.1-with-packages] /nix/store/52bg4hrpp4mkndr47h3adgps9y5zczms-unliftio-core-0.2.1.0/nix-support:
  21906. 1453.89 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21907. 1453.90 s [ghc-9.10.1-with-packages] /nix/store/52bg4hrpp4mkndr47h3adgps9y5zczms-unliftio-core-0.2.1.0/nix-support:
  21908. 1453.90 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21909. 1453.91 s [ghc-9.10.1-with-packages] /nix/store/5nqxakmpk4shlyjpqp2362mydjy3zhhs-base-orphans-0.9.3/nix-support:
  21910. 1453.91 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21911. 1453.92 s [ghc-9.10.1-with-packages] /nix/store/5nqxakmpk4shlyjpqp2362mydjy3zhhs-base-orphans-0.9.3/nix-support:
  21912. 1453.92 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21913. 1453.92 s [ghc-9.10.1-with-packages] /nix/store/faklbxjjd9rdmc9v63fvmpwizw5dnn27-tagged-0.8.8/nix-support:
  21914. 1453.92 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21915. 1453.93 s [ghc-9.10.1-with-packages] /nix/store/faklbxjjd9rdmc9v63fvmpwizw5dnn27-tagged-0.8.8/nix-support:
  21916. 1453.93 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21917. 1453.94 s [ghc-9.10.1-with-packages] /nix/store/cws8f3ga2b07l92xi46frcclk9vqk1na-boring-0.2.2/nix-support:
  21918. 1453.94 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21919. 1453.94 s [ghc-9.10.1-with-packages] /nix/store/cws8f3ga2b07l92xi46frcclk9vqk1na-boring-0.2.2/nix-support:
  21920. 1453.94 s [ghc-9.10.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/7y15lpail0g6kx61wi23776xpl855437-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21921. 1454.85 s [ghc-9.10.1-with-packages] Warning: include-dirs: /nix/store/jc9bac0w3csvmws2q7gr2z13y8n7q0wl-ghc-9.10.1-with-packages/lib/ghc-9.10.1/lib/../lib/x86_64-linux-ghc-9.10.1/directory-1.3.8.3-678a/include doesn't exist or isn't a directory
  21922. 1456.20 s [ghc-9.10.1-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/jc9bac0w3csvmws2q7gr2z13y8n7q0wl-ghc-9.10.1-with-packages
  21923. 1457.45 s [ghc-9.10.1-with-packages:post-build] Pushing 1 paths (138 are already present) using zstd to cache sellout ⏳
  21924. 1457.45 s [ghc-9.10.1-with-packages:post-build]
  21925. 1457.81 s [ghc-9.10.1-with-packages:post-build] Pushing /nix/store/jc9bac0w3csvmws2q7gr2z13y8n7q0wl-ghc-9.10.1-with-packages (4.91 MiB)
  21926. 1460.43 s [ghc-9.10.1-with-packages:post-build]
  21927. 1460.44 s [ghc-9.10.1-with-packages:post-build] All done.
  21928. 1460.60 s [ghc-9.10.1-with-packages:post-build] Uploading to the NixCI cache: /nix/store/jc9bac0w3csvmws2q7gr2z13y8n7q0wl-ghc-9.10.1-with-packages
  21929. 1461.12 s [ghc-9.10.1-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21930. 1461.42 s [ghc-9.10.1-with-packages:post-build] copying 1 paths...
  21931. 1461.42 s [ghc-9.10.1-with-packages:post-build] copying path '/nix/store/jc9bac0w3csvmws2q7gr2z13y8n7q0wl-ghc-9.10.1-with-packages' to 'https://cache.nix-ci.com'...
  21932. 1463.64 s [ghc-9.10.1-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21933. 1464.49 s [ghc-9.10.1-with-packages:post-build] copying 1 paths...
  21934. 1464.49 s [ghc-9.10.1-with-packages:post-build] copying path '/nix/store/b4v4wq219rkjibwwqvn37vpv6m4hv8i8-ghc-9.10.1-with-packages.drv' to 'https://cache.nix-ci.com'...
  21935. 1464.98 s Progress: 12 of 14 built, 155 of 155 downloaded from cache
  21936. 1465.10 s Building /nix/store/cj4qsp0ci3z3x2j3y7r6y339yfw142mj-all-packages.drv
  21937. 1465.30 s [all-packages] created 3 symlinks in user environment
  21938. 1465.42 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/aq26q58l14zxh1nx8iq3v354n4gyvxav-all-packages
  21939. 1466.57 s [all-packages:post-build] Pushing 1 paths (139 are already present) using zstd to cache sellout ⏳
  21940. 1466.58 s [all-packages:post-build]
  21941. 1466.91 s [all-packages:post-build] Pushing /nix/store/aq26q58l14zxh1nx8iq3v354n4gyvxav-all-packages (872.00 B)
  21942. 1467.87 s [all-packages:post-build]
  21943. 1467.87 s [all-packages:post-build] All done.
  21944. 1467.99 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/aq26q58l14zxh1nx8iq3v354n4gyvxav-all-packages
  21945. 1468.48 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21946. 1468.72 s [all-packages:post-build] copying 1 paths...
  21947. 1468.72 s [all-packages:post-build] copying path '/nix/store/aq26q58l14zxh1nx8iq3v354n4gyvxav-all-packages' to 'https://cache.nix-ci.com'...
  21948. 1469.61 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21949. 1470.08 s [all-packages:post-build] copying 1 paths...
  21950. 1470.08 s [all-packages:post-build] copying path '/nix/store/cj4qsp0ci3z3x2j3y7r6y339yfw142mj-all-packages.drv' to 'https://cache.nix-ci.com'...
  21951. 1470.46 s Progress: 13 of 14 built, 155 of 155 downloaded from cache
  21952. 1470.46 s Progress: 14 of 14 built, 155 of 155 downloaded from cache
  21953. 1470.46 s /nix/store/aq26q58l14zxh1nx8iq3v354n4gyvxav-all-packages
  21954. 1470.67 s Build succeeded.
Tail Raw Logs