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=renovate%2Flock-file-maintenance&rev=aeca24e0ba147679323a49b0d71b1010da9c6629#packages.x86_64-linux.default --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.18 s error (ignored): SQLite database '/var/cache/nix-ci-worker/eval-cache-v6/75545554ca716809336d683ca4f7fb894d97ccd631dcabdda4d447c0175afddf.sqlite' is busy
  15. 0.71 s 'system' has been renamed to/replaced by 'stdenv.hostPlatform.system'
  16. 1.90 s
  17. 2.02 s Building /nix/store/6dazsf6kvq9iwx6a9z35j0xn0dwhii8m-cabal2nix-duoids-hedgehog.drv
  18. 2.11 s [cabal2nix-duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/dvw1ziq2a6ib6hjp5vhq340bw5ya8cfi-cabal2nix-duoids-hedgehog
  19. 2.51 s [cabal2nix-duoids-hedgehog:post-build] Nothing to push - all store paths are already on Cachix.
  20. 2.54 s [cabal2nix-duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/dvw1ziq2a6ib6hjp5vhq340bw5ya8cfi-cabal2nix-duoids-hedgehog
  21. 2.59 s [cabal2nix-duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22. 2.77 s [cabal2nix-duoids-hedgehog:post-build] copying 1 paths...
  23. 2.77 s [cabal2nix-duoids-hedgehog:post-build] copying path '/nix/store/dvw1ziq2a6ib6hjp5vhq340bw5ya8cfi-cabal2nix-duoids-hedgehog' to 'https://cache.nix-ci.com'...
  24. 2.85 s [cabal2nix-duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  25. 2.96 s [cabal2nix-duoids-hedgehog:post-build] copying 0 paths...
  26. 2.98 s Progress: 1 of 2 built
  27. 2.98 s Progress: 2 of 2 built
  28. 3.14 s
  29. 5.45 s Downloading cached colour-2.3.6-data from https://cache.nix-ci.com
  30. 5.46 s Downloading cached pretty-show-1.10-data from https://cache.nix-ci.com
  31. 5.46 s Downloading cached base-orphans-0.9.3-doc from https://cache.nix-ci.com
  32. 5.46 s Downloading cached colour-2.3.6-doc from https://cache.nix-ci.com
  33. 5.46 s Downloading cached erf-2.0.0.0-doc from https://cache.nix-ci.com
  34. 5.46 s Downloading cached hashable-1.5.0.0-doc from https://cache.nix-ci.com
  35. 5.46 s Downloading cached haskell-lexer-1.2.1-doc from https://cache.nix-ci.com
  36. 5.46 s Downloading cached mmorph-1.2.1-doc from https://cache.nix-ci.com
  37. 5.46 s Downloading cached primitive-0.9.1.0-doc from https://cache.nix-ci.com
  38. 5.46 s Downloading cached safe-exceptions-0.1.7.4-doc from https://cache.nix-ci.com
  39. 5.46 s Downloading cached tagged-0.8.9-doc from https://cache.nix-ci.com
  40. 5.46 s Downloading cached terminal-size-0.3.4-doc from https://cache.nix-ci.com
  41. 5.46 s Downloading cached transformers-base-0.4.6-doc from https://cache.nix-ci.com
  42. 5.46 s Downloading cached transformers-compat-0.7.2-doc from https://cache.nix-ci.com
  43. 5.46 s Downloading cached unliftio-core-0.2.1.0-doc from https://cache.nix-ci.com
  44. 5.46 s Downloading cached wl-pprint-annotated-0.1.0.1-doc from https://cache.nix-ci.com
  45. 5.51 s Progress: 0 of 90 built, 1 of 159 downloaded from cache (15 downloading)
  46. 5.51 s Progress: 0 of 90 built, 2 of 159 downloaded from cache (14 downloading)
  47. 5.51 s Progress: 0 of 90 built, 3 of 159 downloaded from cache (13 downloading)
  48. 5.51 s Progress: 0 of 90 built, 4 of 159 downloaded from cache (12 downloading)
  49. 5.51 s Progress: 0 of 90 built, 5 of 159 downloaded from cache (11 downloading)
  50. 5.51 s Progress: 0 of 90 built, 6 of 159 downloaded from cache (10 downloading)
  51. 5.51 s Progress: 0 of 90 built, 7 of 159 downloaded from cache (9 downloading)
  52. 5.51 s Progress: 0 of 90 built, 8 of 159 downloaded from cache (8 downloading)
  53. 5.51 s Progress: 0 of 90 built, 9 of 159 downloaded from cache (7 downloading)
  54. 5.51 s Progress: 0 of 90 built, 10 of 159 downloaded from cache (6 downloading)
  55. 5.51 s Progress: 0 of 90 built, 11 of 159 downloaded from cache (5 downloading)
  56. 5.51 s Progress: 0 of 90 built, 12 of 159 downloaded from cache (4 downloading)
  57. 5.51 s Progress: 0 of 90 built, 13 of 159 downloaded from cache (3 downloading)
  58. 5.51 s Downloading cached Cabal-syntax-3.12.1.0-doc from https://cache.nix-ci.com
  59. 5.51 s Downloading cached OneTuple-0.4.2-doc from https://cache.nix-ci.com
  60. 5.51 s Downloading cached QuickCheck-2.15.0.1-doc from https://cache.nix-ci.com
  61. 5.51 s Downloading cached algebraic-graphs-0.7-allow-inspection-testing from https://cache.nix-ci.com
  62. 5.51 s Downloading cached algebraic-graphs-0.7-r3.cabal from https://cache.nix-ci.com
  63. 5.51 s Downloading cached algebraic-graphs from https://cache.nix-ci.com
  64. 5.51 s Downloading cached assoc-1.1.1-doc from https://cache.nix-ci.com
  65. 5.51 s Downloading cached base-compat-0.14.1-doc from https://cache.nix-ci.com
  66. 5.51 s Downloading cached call-stack-0.4.0-doc from https://cache.nix-ci.com
  67. 5.51 s Downloading cached clock-0.8.4-doc from https://cache.nix-ci.com
  68. 5.51 s Downloading cached doctest from https://cache.nix-ci.com
  69. 5.51 s Downloading cached extra from https://cache.nix-ci.com
  70. 5.51 s Downloading cached ghc-paths-0.1.0.12-doc from https://cache.nix-ci.com
  71. 5.51 s Progress: 0 of 90 built, 14 of 159 downloaded from cache (15 downloading)
  72. 5.51 s Downloading cached ansi-terminal-types-1.1.3-doc from https://cache.nix-ci.com
  73. 5.51 s Progress: 0 of 90 built, 15 of 159 downloaded from cache (15 downloading)
  74. 5.51 s Downloading cached async-2.2.5-doc from https://cache.nix-ci.com
  75. 5.52 s Progress: 0 of 90 built, 16 of 159 downloaded from cache (15 downloading)
  76. 5.52 s Downloading cached base-orphans from https://cache.nix-ci.com
  77. 5.53 s Progress: 0 of 89 built, 17 of 159 downloaded from cache (15 downloading)
  78. 5.53 s Downloading cached boring-0.2.2-doc from https://cache.nix-ci.com
  79. 5.53 s Progress: 0 of 89 built, 18 of 159 downloaded from cache (15 downloading)
  80. 5.53 s Downloading cached OneTuple from https://cache.nix-ci.com
  81. 5.53 s Progress: 0 of 89 built, 19 of 159 downloaded from cache (15 downloading)
  82. 5.53 s Downloading cached case-insensitive-1.2.1.0-doc from https://cache.nix-ci.com
  83. 5.53 s Progress: 0 of 88 built, 20 of 159 downloaded from cache (15 downloading)
  84. 5.53 s Downloading cached colour from https://cache.nix-ci.com
  85. 5.55 s Progress: 0 of 88 built, 21 of 159 downloaded from cache (15 downloading)
  86. 5.55 s Downloading cached assoc from https://cache.nix-ci.com
  87. 5.55 s Progress: 0 of 87 built, 22 of 159 downloaded from cache (15 downloading)
  88. 5.55 s Downloading cached data-fix-0.3.4-doc from https://cache.nix-ci.com
  89. 5.56 s Progress: 0 of 87 built, 23 of 159 downloaded from cache (15 downloading)
  90. 5.56 s Downloading cached clock from https://cache.nix-ci.com
  91. 5.56 s Progress: 0 of 86 built, 24 of 159 downloaded from cache (15 downloading)
  92. 5.56 s Progress: 0 of 86 built, 25 of 159 downloaded from cache (14 downloading)
  93. 5.56 s Progress: 0 of 86 built, 26 of 159 downloaded from cache (13 downloading)
  94. 5.56 s Downloading cached distributive-0.6.2.1-doc from https://cache.nix-ci.com
  95. 5.56 s Downloading cached erf from https://cache.nix-ci.com
  96. 5.56 s Downloading cached hashable from https://cache.nix-ci.com
  97. 5.57 s Progress: 0 of 85 built, 27 of 159 downloaded from cache (15 downloading)
  98. 5.57 s Downloading cached HUnit-1.6.2.0-doc from https://cache.nix-ci.com
  99. 5.57 s Progress: 0 of 85 built, 28 of 159 downloaded from cache (15 downloading)
  100. 5.57 s Progress: 0 of 85 built, 29 of 159 downloaded from cache (14 downloading)
  101. 5.57 s Downloading cached ChasingBottoms-1.3.1.17-doc from https://cache.nix-ci.com
  102. 5.57 s Downloading cached QuickCheck from https://cache.nix-ci.com
  103. 5.57 s Progress: 0 of 85 built, 30 of 159 downloaded from cache (15 downloading)
  104. 5.57 s Downloading cached ansi-terminal-1.1.3-doc from https://cache.nix-ci.com
  105. 5.57 s Progress: 0 of 85 built, 31 of 159 downloaded from cache (15 downloading)
  106. 5.57 s Downloading cached call-stack from https://cache.nix-ci.com
  107. 5.57 s Progress: 0 of 85 built, 32 of 159 downloaded from cache (15 downloading)
  108. 5.57 s Downloading cached constraints-0.14.2-doc from https://cache.nix-ci.com
  109. 5.57 s Progress: 0 of 84 built, 33 of 159 downloaded from cache (15 downloading)
  110. 5.57 s Downloading cached ghc-paths from https://cache.nix-ci.com
  111. 5.57 s Progress: 0 of 83 built, 34 of 159 downloaded from cache (15 downloading)
  112. 5.57 s Downloading cached haskell-lexer from https://cache.nix-ci.com
  113. 5.58 s Progress: 0 of 83 built, 35 of 159 downloaded from cache (15 downloading)
  114. 5.58 s Downloading cached hspec-discover-2.11.14-doc from https://cache.nix-ci.com
  115. 5.59 s Progress: 0 of 83 built, 36 of 159 downloaded from cache (15 downloading)
  116. 5.59 s Downloading cached inspection-testing-0.6.2-doc from https://cache.nix-ci.com
  117. 5.59 s Progress: 0 of 83 built, 37 of 159 downloaded from cache (15 downloading)
  118. 5.59 s Downloading cached base-compat from https://cache.nix-ci.com
  119. 5.60 s Progress: 0 of 83 built, 38 of 159 downloaded from cache (15 downloading)
  120. 5.60 s Downloading cached barbies-2.1.1.0-doc from https://cache.nix-ci.com
  121. 5.60 s Progress: 0 of 82 built, 39 of 159 downloaded from cache (15 downloading)
  122. 5.60 s Downloading cached integer-logarithms-1.0.4-doc from https://cache.nix-ci.com
  123. 5.60 s Progress: 0 of 81 built, 40 of 159 downloaded from cache (15 downloading)
  124. 5.60 s Downloading cached jailbreak-cabal from https://cache.nix-ci.com
  125. 5.61 s Progress: 0 of 80 built, 41 of 159 downloaded from cache (15 downloading)
  126. 5.61 s Downloading cached logging-facade-0.3.1-doc from https://cache.nix-ci.com
  127. 5.61 s Progress: 0 of 80 built, 42 of 159 downloaded from cache (15 downloading)
  128. 5.62 s Downloading cached hspec-expectations-0.8.4-doc from https://cache.nix-ci.com
  129. 5.62 s Progress: 0 of 79 built, 43 of 159 downloaded from cache (15 downloading)
  130. 5.62 s Downloading cached async from https://cache.nix-ci.com
  131. 5.63 s Progress: 0 of 79 built, 44 of 159 downloaded from cache (15 downloading)
  132. 5.63 s Downloading cached HUnit from https://cache.nix-ci.com
  133. 5.64 s Progress: 0 of 79 built, 45 of 159 downloaded from cache (15 downloading)
  134. 5.64 s Downloading cached case-insensitive from https://cache.nix-ci.com
  135. 5.64 s Progress: 0 of 79 built, 46 of 159 downloaded from cache (15 downloading)
  136. 5.64 s Downloading cached data-fix from https://cache.nix-ci.com
  137. 5.64 s Progress: 0 of 79 built, 47 of 159 downloaded from cache (15 downloading)
  138. 5.64 s Downloading cached inspection-testing from https://cache.nix-ci.com
  139. 5.64 s Progress: 0 of 79 built, 48 of 159 downloaded from cache (15 downloading)
  140. 5.64 s Downloading cached integer-logarithms from https://cache.nix-ci.com
  141. 5.66 s Progress: 0 of 79 built, 49 of 159 downloaded from cache (15 downloading)
  142. 5.66 s Downloading cached logging-facade from https://cache.nix-ci.com
  143. 5.67 s Progress: 0 of 79 built, 50 of 159 downloaded from cache (15 downloading)
  144. 5.67 s Downloading cached mockery-0.3.5-doc from https://cache.nix-ci.com
  145. 5.67 s Progress: 0 of 78 built, 51 of 159 downloaded from cache (15 downloading)
  146. 5.67 s Progress: 0 of 77 built, 52 of 159 downloaded from cache (15 downloading)
  147. 5.67 s Downloading cached monad-control-1.0.3.1-doc from https://cache.nix-ci.com
  148. 5.67 s Downloading cached nothunks-0.3.1-r1.cabal from https://cache.nix-ci.com
  149. 5.68 s Progress: 0 of 76 built, 53 of 159 downloaded from cache (15 downloading)
  150. 5.68 s Downloading cached nothunks from https://cache.nix-ci.com
  151. 5.68 s Progress: 0 of 75 built, 54 of 159 downloaded from cache (15 downloading)
  152. 5.68 s Downloading cached old-locale-1.0.0.7-doc from https://cache.nix-ci.com
  153. 5.69 s Progress: 0 of 74 built, 55 of 159 downloaded from cache (15 downloading)
  154. 5.69 s Downloading cached hspec-expectations from https://cache.nix-ci.com
  155. 5.69 s Progress: 0 of 74 built, 56 of 159 downloaded from cache (15 downloading)
  156. 5.69 s Downloading cached pretty-show-1.10-doc from https://cache.nix-ci.com
  157. 5.69 s Progress: 0 of 74 built, 57 of 159 downloaded from cache (15 downloading)
  158. 5.69 s Downloading cached prettyprinter-1.7.1-doc from https://cache.nix-ci.com
  159. 5.69 s Progress: 0 of 73 built, 58 of 159 downloaded from cache (15 downloading)
  160. 5.69 s Downloading cached primitive from https://cache.nix-ci.com
  161. 5.70 s Progress: 0 of 73 built, 59 of 159 downloaded from cache (15 downloading)
  162. 5.70 s Downloading cached lifted-base-0.2.3.12-doc from https://cache.nix-ci.com
  163. 5.70 s Progress: 0 of 73 built, 60 of 159 downloaded from cache (15 downloading)
  164. 5.70 s Downloading cached mockery from https://cache.nix-ci.com
  165. 5.70 s Progress: 0 of 73 built, 61 of 159 downloaded from cache (15 downloading)
  166. 5.70 s Downloading cached old-locale from https://cache.nix-ci.com
  167. 5.70 s Progress: 0 of 73 built, 62 of 159 downloaded from cache (15 downloading)
  168. 5.70 s Downloading cached old-time-1.1.0.4-doc from https://cache.nix-ci.com
  169. 5.70 s Progress: 0 of 72 built, 63 of 159 downloaded from cache (15 downloading)
  170. 5.70 s Downloading cached quickcheck-instances-0.3.33-r1.cabal from https://cache.nix-ci.com
  171. 5.71 s Progress: 0 of 72 built, 64 of 159 downloaded from cache (15 downloading)
  172. 5.71 s Downloading cached hspec-discover from https://cache.nix-ci.com
  173. 5.71 s Progress: 0 of 71 built, 65 of 159 downloaded from cache (15 downloading)
  174. 5.71 s Downloading cached ansi-terminal-types from https://cache.nix-ci.com
  175. 5.72 s Progress: 0 of 70 built, 66 of 159 downloaded from cache (15 downloading)
  176. 5.72 s Downloading cached quickcheck-instances from https://cache.nix-ci.com
  177. 5.72 s Progress: 0 of 70 built, 67 of 159 downloaded from cache (15 downloading)
  178. 5.72 s Downloading cached quickcheck-io-0.2.0-doc from https://cache.nix-ci.com
  179. 5.72 s Progress: 0 of 70 built, 68 of 159 downloaded from cache (15 downloading)
  180. 5.73 s Progress: 0 of 70 built, 69 of 159 downloaded from cache (14 downloading)
  181. 5.73 s Progress: 0 of 70 built, 70 of 159 downloaded from cache (13 downloading)
  182. 5.73 s Downloading cached resourcet-1.3.0-doc from https://cache.nix-ci.com
  183. 5.73 s Downloading cached safe-exceptions from https://cache.nix-ci.com
  184. 5.73 s Downloading cached scientific-0.3.8.0-doc from https://cache.nix-ci.com
  185. 5.73 s Progress: 0 of 67 built, 71 of 159 downloaded from cache (15 downloading)
  186. 5.73 s Downloading cached silently-1.2.5.4-doc from https://cache.nix-ci.com
  187. 5.73 s Progress: 0 of 67 built, 72 of 159 downloaded from cache (15 downloading)
  188. 5.73 s Downloading cached stringbuilder-0.5.1-doc from https://cache.nix-ci.com
  189. 5.73 s Progress: 0 of 67 built, 73 of 159 downloaded from cache (15 downloading)
  190. 5.73 s Downloading cached old-time from https://cache.nix-ci.com
  191. 5.73 s Progress: 0 of 67 built, 74 of 159 downloaded from cache (15 downloading)
  192. 5.73 s Downloading cached lifted-async-0.10.2.7-doc from https://cache.nix-ci.com
  193. 5.74 s Progress: 0 of 67 built, 75 of 159 downloaded from cache (15 downloading)
  194. 5.74 s Downloading cached concurrent-output-1.10.21-doc from https://cache.nix-ci.com
  195. 5.75 s Progress: 0 of 66 built, 76 of 159 downloaded from cache (15 downloading)
  196. 5.75 s Progress: 0 of 66 built, 77 of 159 downloaded from cache (14 downloading)
  197. 5.75 s Downloading cached tagged from https://cache.nix-ci.com
  198. 5.75 s Downloading cached terminal-size from https://cache.nix-ci.com
  199. 5.75 s Progress: 0 of 65 built, 78 of 159 downloaded from cache (15 downloading)
  200. 5.75 s Downloading cached hspec-core-2.11.14-doc from https://cache.nix-ci.com
  201. 5.75 s Progress: 0 of 65 built, 79 of 159 downloaded from cache (15 downloading)
  202. 5.75 s Downloading cached pretty-show from https://cache.nix-ci.com
  203. 5.75 s Progress: 0 of 65 built, 80 of 159 downloaded from cache (15 downloading)
  204. 5.75 s Progress: 0 of 65 built, 81 of 159 downloaded from cache (14 downloading)
  205. 5.76 s Downloading cached prettyprinter from https://cache.nix-ci.com
  206. 5.76 s Downloading cached prettyprinter-ansi-terminal-1.1.3-doc from https://cache.nix-ci.com
  207. 5.76 s Progress: 0 of 65 built, 82 of 159 downloaded from cache (15 downloading)
  208. 5.76 s Downloading cached silently from https://cache.nix-ci.com
  209. 5.76 s Progress: 0 of 65 built, 83 of 159 downloaded from cache (15 downloading)
  210. 5.76 s Downloading cached stringbuilder from https://cache.nix-ci.com
  211. 5.76 s Progress: 0 of 64 built, 84 of 159 downloaded from cache (15 downloading)
  212. 5.76 s Downloading cached ansi-terminal from https://cache.nix-ci.com
  213. 5.77 s Progress: 0 of 63 built, 85 of 159 downloaded from cache (15 downloading)
  214. 5.78 s Downloading cached text-short-0.1.6-doc from https://cache.nix-ci.com
  215. 5.78 s Progress: 0 of 63 built, 86 of 159 downloaded from cache (15 downloading)
  216. 5.78 s Downloading cached tf-random-0.5-doc from https://cache.nix-ci.com
  217. 5.79 s Progress: 0 of 63 built, 87 of 159 downloaded from cache (15 downloading)
  218. 5.79 s Downloading cached hedgehog-1.5-doc from https://cache.nix-ci.com
  219. 5.79 s Progress: 0 of 62 built, 88 of 159 downloaded from cache (15 downloading)
  220. 5.79 s Downloading cached these-1.2.1-doc from https://cache.nix-ci.com
  221. 5.79 s Progress: 0 of 61 built, 89 of 159 downloaded from cache (15 downloading)
  222. 5.79 s Downloading cached time-compat-1.9.8-doc from https://cache.nix-ci.com
  223. 5.80 s Progress: 0 of 60 built, 90 of 159 downloaded from cache (15 downloading)
  224. 5.80 s Downloading cached transformers-compat from https://cache.nix-ci.com
  225. 5.80 s Progress: 0 of 59 built, 91 of 159 downloaded from cache (15 downloading)
  226. 5.80 s Progress: 0 of 59 built, 92 of 159 downloaded from cache (14 downloading)
  227. 5.80 s Downloading cached unliftio-core from https://cache.nix-ci.com
  228. 5.80 s Downloading cached unordered-containers from https://cache.nix-ci.com
  229. 5.80 s Progress: 0 of 57 built, 93 of 159 downloaded from cache (15 downloading)
  230. 5.80 s Downloading cached boring from https://cache.nix-ci.com
  231. 5.81 s Progress: 0 of 57 built, 94 of 159 downloaded from cache (15 downloading)
  232. 5.81 s Downloading cached distributive from https://cache.nix-ci.com
  233. 5.81 s Progress: 0 of 57 built, 95 of 159 downloaded from cache (15 downloading)
  234. 5.81 s Downloading cached optparse-applicative-0.18.1.0-doc from https://cache.nix-ci.com
  235. 5.81 s Progress: 0 of 56 built, 96 of 159 downloaded from cache (15 downloading)
  236. 5.81 s Downloading cached concurrent-output from https://cache.nix-ci.com
  237. 5.82 s Progress: 0 of 55 built, 97 of 159 downloaded from cache (15 downloading)
  238. 5.82 s Downloading cached scientific from https://cache.nix-ci.com
  239. 5.82 s Progress: 0 of 55 built, 98 of 159 downloaded from cache (15 downloading)
  240. 5.82 s Downloading cached hspec-2.11.14-doc from https://cache.nix-ci.com
  241. 5.83 s Progress: 0 of 54 built, 99 of 159 downloaded from cache (15 downloading)
  242. 5.83 s Downloading cached resourcet from https://cache.nix-ci.com
  243. 5.83 s Progress: 0 of 54 built, 100 of 159 downloaded from cache (15 downloading)
  244. 5.83 s Downloading cached strict-0.5.1-doc from https://cache.nix-ci.com
  245. 5.85 s Progress: 0 of 54 built, 101 of 159 downloaded from cache (15 downloading)
  246. 5.85 s Downloading cached tf-random from https://cache.nix-ci.com
  247. 5.85 s Progress: 0 of 53 built, 102 of 159 downloaded from cache (15 downloading)
  248. 5.85 s Downloading cached barbies from https://cache.nix-ci.com
  249. 5.85 s Progress: 0 of 52 built, 103 of 159 downloaded from cache (15 downloading)
  250. 5.85 s Downloading cached constraints from https://cache.nix-ci.com
  251. 5.86 s Progress: 0 of 51 built, 104 of 159 downloaded from cache (15 downloading)
  252. 5.86 s Downloading cached mmorph from https://cache.nix-ci.com
  253. 5.86 s Progress: 0 of 51 built, 105 of 159 downloaded from cache (15 downloading)
  254. 5.86 s Downloading cached these from https://cache.nix-ci.com
  255. 5.86 s Progress: 0 of 50 built, 106 of 159 downloaded from cache (15 downloading)
  256. 5.86 s Downloading cached time-compat from https://cache.nix-ci.com
  257. 5.87 s Progress: 0 of 50 built, 107 of 159 downloaded from cache (15 downloading)
  258. 5.87 s Downloading cached tasty-1.5.3-doc from https://cache.nix-ci.com
  259. 5.87 s Progress: 0 of 49 built, 108 of 159 downloaded from cache (15 downloading)
  260. 5.87 s Downloading cached transformers-base from https://cache.nix-ci.com
  261. 5.88 s Progress: 0 of 48 built, 109 of 159 downloaded from cache (15 downloading)
  262. 5.88 s Downloading cached uuid-types-1.0.6-doc from https://cache.nix-ci.com
  263. 5.88 s Progress: 0 of 47 built, 110 of 159 downloaded from cache (15 downloading)
  264. 5.88 s Downloading cached vector-0.13.2.0-r2.cabal from https://cache.nix-ci.com
  265. 5.88 s Progress: 0 of 47 built, 111 of 159 downloaded from cache (15 downloading)
  266. 5.88 s Downloading cached Cabal-3.12.1.0-doc from https://cache.nix-ci.com
  267. 5.89 s Progress: 0 of 46 built, 112 of 159 downloaded from cache (15 downloading)
  268. 5.89 s Downloading cached Cabal-syntax from https://cache.nix-ci.com
  269. 5.89 s Progress: 0 of 46 built, 113 of 159 downloaded from cache (15 downloading)
  270. 5.89 s Downloading cached vector from https://cache.nix-ci.com
  271. 5.89 s Progress: 0 of 46 built, 114 of 159 downloaded from cache (15 downloading)
  272. 5.89 s Downloading cached prettyprinter-ansi-terminal from https://cache.nix-ci.com
  273. 5.90 s Progress: 0 of 46 built, 115 of 159 downloaded from cache (15 downloading)
  274. 5.90 s Downloading cached text-short from https://cache.nix-ci.com
  275. 5.90 s Progress: 0 of 45 built, 116 of 159 downloaded from cache (15 downloading)
  276. 5.90 s Downloading cached monad-control from https://cache.nix-ci.com
  277. 5.90 s Progress: 0 of 44 built, 117 of 159 downloaded from cache (15 downloading)
  278. 5.90 s Downloading cached vector-stream-0.1.0.1-doc from https://cache.nix-ci.com
  279. 5.90 s Progress: 0 of 43 built, 118 of 159 downloaded from cache (15 downloading)
  280. 5.90 s Downloading cached wherefrom-compat-0.1.1.1-doc from https://cache.nix-ci.com
  281. 5.91 s Progress: 0 of 43 built, 119 of 159 downloaded from cache (15 downloading)
  282. 5.91 s Downloading cached uuid-types from https://cache.nix-ci.com
  283. 5.92 s Progress: 0 of 42 built, 120 of 159 downloaded from cache (15 downloading)
  284. 5.92 s Downloading cached ChasingBottoms from https://cache.nix-ci.com
  285. 5.92 s Progress: 0 of 42 built, 121 of 159 downloaded from cache (15 downloading)
  286. 5.92 s Downloading cached quickcheck-io from https://cache.nix-ci.com
  287. 5.92 s Progress: 0 of 41 built, 122 of 159 downloaded from cache (15 downloading)
  288. 5.92 s Downloading cached wl-pprint-annotated from https://cache.nix-ci.com
  289. 5.92 s Progress: 0 of 40 built, 123 of 159 downloaded from cache (15 downloading)
  290. 5.92 s Downloading cached strict from https://cache.nix-ci.com
  291. 5.93 s Progress: 0 of 39 built, 124 of 159 downloaded from cache (15 downloading)
  292. 5.93 s Downloading cached tasty-hunit-0.10.2-doc from https://cache.nix-ci.com
  293. 5.94 s Progress: 0 of 39 built, 125 of 159 downloaded from cache (15 downloading)
  294. 5.94 s Downloading cached tasty-inspection-testing-0.2.1-doc from https://cache.nix-ci.com
  295. 5.94 s Progress: 0 of 39 built, 126 of 159 downloaded from cache (15 downloading)
  296. 5.94 s Progress: 0 of 39 built, 127 of 159 downloaded from cache (14 downloading)
  297. 5.94 s Downloading cached tasty-quickcheck-0.11.1-doc from https://cache.nix-ci.com
  298. 5.94 s Downloading cached wherefrom-compat from https://cache.nix-ci.com
  299. 5.95 s Progress: 0 of 38 built, 128 of 159 downloaded from cache (15 downloading)
  300. 5.95 s Downloading cached lifted-base from https://cache.nix-ci.com
  301. 5.95 s Progress: 0 of 38 built, 129 of 159 downloaded from cache (15 downloading)
  302. 5.95 s Downloading cached optparse-applicative from https://cache.nix-ci.com
  303. 5.96 s Progress: 0 of 38 built, 130 of 159 downloaded from cache (15 downloading)
  304. 5.96 s Downloading cached tasty-hedgehog-1.4.0.2-doc from https://cache.nix-ci.com
  305. 5.97 s Progress: 0 of 37 built, 131 of 159 downloaded from cache (15 downloading)
  306. 5.98 s Downloading cached vector-stream from https://cache.nix-ci.com
  307. 5.98 s Progress: 0 of 37 built, 132 of 159 downloaded from cache (15 downloading)
  308. 5.99 s Downloading cached hspec-core from https://cache.nix-ci.com
  309. 5.99 s Progress: 0 of 36 built, 133 of 159 downloaded from cache (15 downloading)
  310. 6.00 s Progress: 0 of 35 built, 134 of 159 downloaded from cache (14 downloading)
  311. 6.00 s Progress: 0 of 34 built, 135 of 159 downloaded from cache (13 downloading)
  312. 6.01 s Progress: 0 of 33 built, 136 of 159 downloaded from cache (12 downloading)
  313. 6.01 s Progress: 0 of 32 built, 137 of 159 downloaded from cache (11 downloading)
  314. 6.02 s Progress: 0 of 32 built, 138 of 159 downloaded from cache (10 downloading)
  315. 6.02 s Progress: 0 of 32 built, 139 of 159 downloaded from cache (9 downloading)
  316. 6.02 s Progress: 0 of 32 built, 140 of 159 downloaded from cache (8 downloading)
  317. 6.03 s Downloading cached lifted-async from https://cache.nix-ci.com
  318. 6.03 s Progress: 0 of 31 built, 141 of 159 downloaded from cache (8 downloading)
  319. 6.04 s Progress: 0 of 30 built, 142 of 159 downloaded from cache (7 downloading)
  320. 6.05 s Progress: 0 of 30 built, 143 of 159 downloaded from cache (6 downloading)
  321. 6.06 s Progress: 0 of 29 built, 144 of 159 downloaded from cache (5 downloading)
  322. 6.06 s Progress: 0 of 28 built, 145 of 159 downloaded from cache (4 downloading)
  323. 6.06 s Downloading cached hedgehog from https://cache.nix-ci.com
  324. 6.07 s Progress: 0 of 27 built, 146 of 159 downloaded from cache (4 downloading)
  325. 6.07 s Downloading cached tasty from https://cache.nix-ci.com
  326. 6.11 s Progress: 0 of 27 built, 147 of 159 downloaded from cache (4 downloading)
  327. 6.11 s Downloading cached cabal-doctest-1.0.12-doc from https://cache.nix-ci.com
  328. 6.12 s Progress: 0 of 27 built, 148 of 159 downloaded from cache (4 downloading)
  329. 6.16 s Progress: 0 of 27 built, 149 of 159 downloaded from cache (3 downloading)
  330. 6.16 s Downloading cached hspec from https://cache.nix-ci.com
  331. 6.21 s Progress: 0 of 26 built, 150 of 159 downloaded from cache (3 downloading)
  332. 6.37 s Building /nix/store/jps3wnh8a1dvhxg7gi6hq3v9f50l0gry-doctest-0.24.2.drv
  333. 6.37 s Progress: 0 of 25 built (1 building), 151 of 159 downloaded from cache (2 downloading)
  334. 6.37 s Progress: 0 of 25 built (1 building), 152 of 159 downloaded from cache (1 downloading)
  335. 6.38 s Downloading cached tasty-hedgehog from https://cache.nix-ci.com
  336. 6.38 s Downloading cached tasty-hunit from https://cache.nix-ci.com
  337. 6.38 s Downloading cached tasty-inspection-testing from https://cache.nix-ci.com
  338. 6.38 s Downloading cached tasty-quickcheck from https://cache.nix-ci.com
  339. 6.40 s Progress: 0 of 23 built (1 building), 153 of 159 downloaded from cache (4 downloading)
  340. 6.40 s Progress: 0 of 22 built (1 building), 154 of 159 downloaded from cache (3 downloading)
  341. 6.40 s Progress: 0 of 21 built (1 building), 155 of 159 downloaded from cache (2 downloading)
  342. 6.40 s Progress: 0 of 20 built (1 building), 156 of 159 downloaded from cache (1 downloading)
  343. 6.55 s [doctest] Phase: setupCompilerEnvironmentPhase
  344. 6.56 s [doctest] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  345. 6.78 s Progress: 0 of 19 built (1 building), 157 of 159 downloaded from cache
  346. 6.78 s Downloading cached Cabal from https://cache.nix-ci.com
  347. 6.81 s [doctest] Phase: unpackPhase
  348. 6.81 s [doctest] unpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
  349. 6.83 s [doctest] source root is doctest-0.24.2
  350. 6.84 s [doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
  351. 6.85 s [doctest] Phase: patchPhase
  352. 6.86 s [doctest] Phase: compileBuildDriverPhase
  353. 6.86 s [doctest] setupCompileFlags: -package-db=/build/tmp.gJe8JGLKfA/setup-package.conf.d -threaded
  354. 6.94 s [doctest] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.gJe8JGLKfA/Main.o )
  355. 7.02 s [doctest] [2 of 2] Linking Setup
  356. 7.43 s Progress: 0 of 19 built (1 building), 158 of 159 downloaded from cache
  357. 7.43 s Downloading cached cabal-doctest from https://cache.nix-ci.com
  358. 7.44 s Progress: 0 of 18 built (1 building), 159 of 159 downloaded from cache
  359. 8.69 s [doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  360. 8.71 s [doctest] Phase: configurePhase
  361. 8.71 s [doctest] configureFlags: --verbose --prefix=/nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.gJe8JGLKfA/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  362. 8.73 s [doctest] Using Parsec parser
  363. 8.73 s [doctest] Configuring doctest-0.24.2...
  364. 9.10 s [doctest] Flags chosen: cabal-doctest=False
  365. 9.50 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  366. 9.50 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  367. 9.50 s [doctest] Dependency containers: using containers-0.7
  368. 9.50 s [doctest] Dependency deepseq: using deepseq-1.5.0.0
  369. 9.50 s [doctest] Dependency directory: using directory-1.3.8.5
  370. 9.50 s [doctest] Dependency exceptions: using exceptions-0.10.9
  371. 9.50 s [doctest] Dependency filepath: using filepath-1.5.4.0
  372. 9.50 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.10.3
  373. 9.50 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  374. 9.50 s [doctest] Dependency process: using process-1.6.26.1
  375. 9.50 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  376. 9.50 s [doctest] Dependency temporary: using temporary-1.3
  377. 9.50 s [doctest] Dependency transformers: using transformers-0.6.1.1
  378. 9.50 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  379. 9.50 s [doctest] Dependency doctest: using doctest-0.24.2
  380. 9.50 s [doctest] Dependency HUnit: using HUnit-1.6.2.0
  381. 9.50 s [doctest] Dependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
  382. 9.50 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  383. 9.50 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  384. 9.50 s [doctest] Dependency containers: using containers-0.7
  385. 9.50 s [doctest] Dependency deepseq: using deepseq-1.5.0.0
  386. 9.50 s [doctest] Dependency directory: using directory-1.3.8.5
  387. 9.50 s [doctest] Dependency exceptions: using exceptions-0.10.9
  388. 9.50 s [doctest] Dependency filepath: using filepath-1.5.4.0
  389. 9.50 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.10.3
  390. 9.50 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  391. 9.50 s [doctest] Dependency hspec >=2.3.0: using hspec-2.11.14
  392. 9.50 s [doctest] Dependency hspec-core >=2.3.0: using hspec-core-2.11.14
  393. 9.50 s [doctest] Dependency mockery: using mockery-0.3.5
  394. 9.50 s [doctest] Dependency process: using process-1.6.26.1
  395. 9.50 s [doctest] Dependency silently >=1.2.4: using silently-1.2.5.4
  396. 9.50 s [doctest] Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
  397. 9.50 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  398. 9.50 s [doctest] Dependency temporary: using temporary-1.3
  399. 9.50 s [doctest] Dependency transformers: using transformers-0.6.1.1
  400. 9.50 s [doctest] Source component graph:
  401. 9.50 s [doctest] component test:spec
  402. 9.50 s [doctest] component lib
  403. 9.50 s [doctest] component exe:doctest dependency lib
  404. 9.50 s [doctest] Configured component graph:
  405. 9.50 s [doctest] component doctest-0.24.2-1YXKG5Q5DdM3pnUo2D7x9m-spec
  406. 9.50 s [doctest] include HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  407. 9.50 s [doctest] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  408. 9.50 s [doctest] include base-4.20.2.0-64da
  409. 9.50 s [doctest] include code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  410. 9.50 s [doctest] include containers-0.7-504a
  411. 9.50 s [doctest] include deepseq-1.5.0.0-9a2c
  412. 9.50 s [doctest] include directory-1.3.8.5-c84a
  413. 9.50 s [doctest] include exceptions-0.10.9-1a12
  414. 9.50 s [doctest] include filepath-1.5.4.0-e600
  415. 9.50 s [doctest] include ghc-9.10.3-05f6
  416. 9.50 s [doctest] include ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  417. 9.50 s [doctest] include hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  418. 9.50 s [doctest] include hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  419. 9.50 s [doctest] include mockery-0.3.5-EoPvviUQGlu2sq9REsFLwG
  420. 9.50 s [doctest] include process-1.6.26.1-ccf0
  421. 9.50 s [doctest] include silently-1.2.5.4-EGV9f2Y2wfhJHQ1FyxFMJ5
  422. 9.50 s [doctest] include stringbuilder-0.5.1-7V3tQKTV9qlL9xhSHfYWuU
  423. 9.50 s [doctest] include syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  424. 9.50 s [doctest] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  425. 9.50 s [doctest] include transformers-0.6.1.1-6a26
  426. 9.50 s [doctest] component doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  427. 9.50 s [doctest] include base-4.20.2.0-64da
  428. 9.50 s [doctest] include code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  429. 9.50 s [doctest] include containers-0.7-504a
  430. 9.50 s [doctest] include deepseq-1.5.0.0-9a2c
  431. 9.50 s [doctest] include directory-1.3.8.5-c84a
  432. 9.50 s [doctest] include exceptions-0.10.9-1a12
  433. 9.50 s [doctest] include filepath-1.5.4.0-e600
  434. 9.50 s [doctest] include ghc-9.10.3-05f6
  435. 9.50 s [doctest] include ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  436. 9.50 s [doctest] include process-1.6.26.1-ccf0
  437. 9.50 s [doctest] include syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  438. 9.50 s [doctest] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  439. 9.50 s [doctest] include transformers-0.6.1.1-6a26
  440. 9.50 s [doctest] component doctest-0.24.2-6BMFWQ0ROX5KvSokEgm4W1-doctest
  441. 9.50 s [doctest] include base-4.20.2.0-64da
  442. 9.50 s [doctest] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  443. 9.50 s [doctest] Linked component graph:
  444. 9.50 s [doctest] unit doctest-0.24.2-1YXKG5Q5DdM3pnUo2D7x9m-spec
  445. 9.50 s [doctest] include HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  446. 9.50 s [doctest] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  447. 9.50 s [doctest] include base-4.20.2.0-64da
  448. 9.50 s [doctest] include code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  449. 9.50 s [doctest] include containers-0.7-504a
  450. 9.50 s [doctest] include deepseq-1.5.0.0-9a2c
  451. 9.50 s [doctest] include directory-1.3.8.5-c84a
  452. 9.50 s [doctest] include exceptions-0.10.9-1a12
  453. 9.50 s [doctest] include filepath-1.5.4.0-e600
  454. 9.50 s [doctest] include ghc-9.10.3-05f6
  455. 9.50 s [doctest] include ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  456. 9.50 s [doctest] include hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  457. 9.50 s [doctest] include hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  458. 9.50 s [doctest] include mockery-0.3.5-EoPvviUQGlu2sq9REsFLwG
  459. 9.50 s [doctest] include process-1.6.26.1-ccf0
  460. 9.50 s [doctest] include silently-1.2.5.4-EGV9f2Y2wfhJHQ1FyxFMJ5
  461. 9.50 s [doctest] include stringbuilder-0.5.1-7V3tQKTV9qlL9xhSHfYWuU
  462. 9.50 s [doctest] include syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  463. 9.50 s [doctest] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  464. 9.50 s [doctest] include transformers-0.6.1.1-6a26
  465. 9.50 s [doctest] unit doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  466. 9.50 s [doctest] include base-4.20.2.0-64da
  467. 9.50 s [doctest] include code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  468. 9.50 s [doctest] include containers-0.7-504a
  469. 9.50 s [doctest] include deepseq-1.5.0.0-9a2c
  470. 9.50 s [doctest] include directory-1.3.8.5-c84a
  471. 9.50 s [doctest] include exceptions-0.10.9-1a12
  472. 9.50 s [doctest] include filepath-1.5.4.0-e600
  473. 9.50 s [doctest] include ghc-9.10.3-05f6
  474. 9.50 s [doctest] include ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  475. 9.50 s [doctest] include process-1.6.26.1-ccf0
  476. 9.50 s [doctest] include syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  477. 9.50 s [doctest] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  478. 9.50 s [doctest] include transformers-0.6.1.1-6a26
  479. 9.50 s [doctest] Test.DocTest=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest.Internal.Run
  480. 9.50 s [doctest] unit doctest-0.24.2-6BMFWQ0ROX5KvSokEgm4W1-doctest
  481. 9.50 s [doctest] include base-4.20.2.0-64da
  482. 9.50 s [doctest] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  483. 9.50 s [doctest] Ready component graph:
  484. 9.50 s [doctest] definite doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  485. 9.50 s [doctest] depends base-4.20.2.0-64da
  486. 9.50 s [doctest] depends code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  487. 9.50 s [doctest] depends containers-0.7-504a
  488. 9.50 s [doctest] depends deepseq-1.5.0.0-9a2c
  489. 9.50 s [doctest] depends directory-1.3.8.5-c84a
  490. 9.50 s [doctest] depends exceptions-0.10.9-1a12
  491. 9.50 s [doctest] depends filepath-1.5.4.0-e600
  492. 9.50 s [doctest] depends ghc-9.10.3-05f6
  493. 9.50 s [doctest] depends ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  494. 9.50 s [doctest] depends process-1.6.26.1-ccf0
  495. 9.50 s [doctest] depends syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  496. 9.50 s [doctest] depends temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  497. 9.50 s [doctest] depends transformers-0.6.1.1-6a26
  498. 9.50 s [doctest] definite doctest-0.24.2-6BMFWQ0ROX5KvSokEgm4W1-doctest
  499. 9.50 s [doctest] depends base-4.20.2.0-64da
  500. 9.50 s [doctest] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  501. 9.50 s [doctest] definite doctest-0.24.2-1YXKG5Q5DdM3pnUo2D7x9m-spec
  502. 9.50 s [doctest] depends HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  503. 9.50 s [doctest] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  504. 9.50 s [doctest] depends base-4.20.2.0-64da
  505. 9.50 s [doctest] depends code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  506. 9.50 s [doctest] depends containers-0.7-504a
  507. 9.50 s [doctest] depends deepseq-1.5.0.0-9a2c
  508. 9.50 s [doctest] depends directory-1.3.8.5-c84a
  509. 9.50 s [doctest] depends exceptions-0.10.9-1a12
  510. 9.51 s [doctest] depends filepath-1.5.4.0-e600
  511. 9.51 s [doctest] depends ghc-9.10.3-05f6
  512. 9.51 s [doctest] depends ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  513. 9.51 s [doctest] depends hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  514. 9.51 s [doctest] depends hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  515. 9.51 s [doctest] depends mockery-0.3.5-EoPvviUQGlu2sq9REsFLwG
  516. 9.51 s [doctest] depends process-1.6.26.1-ccf0
  517. 9.51 s [doctest] depends silently-1.2.5.4-EGV9f2Y2wfhJHQ1FyxFMJ5
  518. 9.51 s [doctest] depends stringbuilder-0.5.1-7V3tQKTV9qlL9xhSHfYWuU
  519. 9.51 s [doctest] depends syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  520. 9.51 s [doctest] depends temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  521. 9.51 s [doctest] depends transformers-0.6.1.1-6a26
  522. 9.51 s [doctest] Using Cabal-3.12.1.0 compiled by ghc-9.10
  523. 9.51 s [doctest] Using compiler: ghc-9.10.3
  524. 9.51 s [doctest] Using install prefix:
  525. 9.51 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2
  526. 9.51 s [doctest] Executables installed in:
  527. 9.51 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin
  528. 9.51 s [doctest] Libraries installed in:
  529. 9.51 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  530. 9.51 s [doctest] Dynamic Libraries installed in:
  531. 9.51 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  532. 9.52 s [doctest] Private executables installed in:
  533. 9.52 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/libexec/x86_64-linux-ghc-9.10.3-05f6/doctest-0.24.2
  534. 9.52 s [doctest] Data files installed in:
  535. 9.52 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/share/x86_64-linux-ghc-9.10.3-05f6/doctest-0.24.2
  536. 9.52 s [doctest] Documentation installed in:
  537. 9.52 s [doctest] /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc/share/doc/doctest-0.24.2
  538. 9.52 s [doctest] Configuration files installed in:
  539. 9.52 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/etc
  540. 9.52 s [doctest] No alex found
  541. 9.52 s [doctest] Using ar found on system at:
  542. 9.52 s [doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  543. 9.52 s [doctest] No c2hs found
  544. 9.52 s [doctest] No cpphs found
  545. 9.52 s [doctest] No doctest found
  546. 9.52 s [doctest] Using gcc version 14.3.0 given by user at:
  547. 9.52 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  548. 9.52 s [doctest] Using ghc version 9.10.3 found on system at:
  549. 9.52 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  550. 9.52 s [doctest] Using ghc-pkg version 9.10.3 found on system at:
  551. 9.52 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  552. 9.52 s [doctest] No ghcjs found
  553. 9.52 s [doctest] No ghcjs-pkg found
  554. 9.52 s [doctest] No greencard found
  555. 9.52 s [doctest] Using haddock version 2.31.1 found on system at:
  556. 9.52 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  557. 9.52 s [doctest] No happy found
  558. 9.52 s [doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  559. 9.52 s [doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  560. 9.52 s [doctest] No hmake found
  561. 9.52 s [doctest] Using hpc version 0.69 found on system at:
  562. 9.52 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  563. 9.52 s [doctest] Using hsc2hs version 0.68.10 found on system at:
  564. 9.52 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  565. 9.52 s [doctest] Using hscolour version 1.25 found on system at:
  566. 9.52 s [doctest] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  567. 9.52 s [doctest] No jhc found
  568. 9.52 s [doctest] Using ld found on system at:
  569. 9.52 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  570. 9.52 s [doctest] No pkg-config found
  571. 9.52 s [doctest] Using runghc version 9.10.3 found on system at:
  572. 9.52 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  573. 9.52 s [doctest] Using strip version 2.44 found on system at:
  574. 9.52 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  575. 9.52 s [doctest] Using tar found on system at:
  576. 9.52 s [doctest] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  577. 9.52 s [doctest] No uhc found
  578. 9.82 s [doctest] Phase: buildPhase
  579. 9.95 s [doctest] Preprocessing library for doctest-0.24.2...
  580. 9.96 s [doctest] Building library for doctest-0.24.2...
  581. 10.53 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
  582. 10.75 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
  583. 12.22 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
  584. 12.23 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
  585. 12.23 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
  586. 12.23 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.o, dist/build/Language/Haskell/GhciWrapper.dyn_o )
  587. 12.23 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
  588. 12.23 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
  589. 12.23 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
  590. 12.23 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.o, dist/build/Paths_doctest.dyn_o )
  591. 12.23 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
  592. 12.23 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
  593. 12.23 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
  594. 12.23 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.o, dist/build/Test/DocTest/Internal/Cabal.dyn_o )
  595. 12.23 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.o, dist/build/Test/DocTest/Internal/Location.dyn_o )
  596. 12.23 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  597. 12.23 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
  598. 13.08 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.o, dist/build/Test/DocTest/Internal/Extract.dyn_o )
  599. 13.11 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
  600. 13.42 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.o, dist/build/Test/DocTest/Internal/Parse.dyn_o )
  601. 13.45 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
  602. 13.82 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
  603. 13.82 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
  604. 14.28 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
  605. 14.50 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.o, dist/build/Test/DocTest/Internal/Run.dyn_o )
  606. 14.53 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
  607. 15.80 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.p_o )
  608. 16.31 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
  609. 18.93 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
  610. 18.94 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
  611. 18.94 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
  612. 18.94 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
  613. 18.94 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.p_o )
  614. 18.94 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.p_o )
  615. 18.94 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
  616. 18.94 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
  617. 18.94 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.p_o )
  618. 18.94 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.p_o )
  619. 19.34 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.p_o )
  620. 19.34 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
  621. 19.59 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
  622. 19.59 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.p_o )
  623. 19.59 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.p_o )
  624. 20.20 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
  625. 20.55 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.p_o )
  626. 21.04 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
  627. 21.31 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
  628. 21.98 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.p_o )
  629. 21.99 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.p_o )
  630. 23.54 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.p_o )
  631. 24.31 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
  632. 24.85 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
  633. 33.36 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  634. 33.37 s [doctest] Building executable 'doctest' for doctest-0.24.2...
  635. 33.55 s [doctest] [1 of 2] Compiling Main ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
  636. 34.08 s [doctest] [2 of 2] Compiling Paths_doctest ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
  637. 34.63 s [doctest] [3 of 3] Linking dist/build/doctest/doctest
  638. 44.55 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  639. 44.60 s [doctest] Building test suite 'spec' for doctest-0.24.2...
  640. 46.37 s [doctest] [ 1 of 44] Compiling Imports ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
  641. 46.80 s [doctest] [ 2 of 44] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
  642. 54.51 s [doctest] [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
  643. 54.51 s [doctest] [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
  644. 54.81 s [doctest] [ 5 of 44] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
  645. 54.81 s [doctest] [ 6 of 44] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
  646. 54.81 s [doctest] [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
  647. 56.68 s [doctest] [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
  648. 56.68 s [doctest] [ 9 of 44] Compiling Interpreter ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
  649. 56.68 s [doctest] [10 of 44] Compiling InterpreterSpec ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
  650. 56.68 s [doctest] [11 of 44] Compiling Info ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
  651. 56.68 s [doctest] [12 of 44] Compiling InfoSpec ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
  652. 56.68 s [doctest] [13 of 44] Compiling Cabal ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
  653. 56.68 s [doctest] [14 of 44] Compiling Cabal.PathsSpec ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
  654. 56.68 s [doctest] [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
  655. 56.68 s [doctest] [16 of 44] Compiling Location ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
  656. 56.68 s [doctest] [17 of 44] Compiling LocationSpec ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
  657. 56.68 s [doctest] [18 of 44] Compiling Options ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
  658. 56.68 s [doctest] [19 of 44] Compiling OptionsSpec ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
  659. 56.68 s [doctest] [20 of 44] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
  660. 56.68 s [doctest] [21 of 44] Compiling PackageDBsSpec ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
  661. 56.68 s [doctest] [22 of 44] Compiling Paths_doctest ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
  662. 56.68 s [doctest] [23 of 44] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Cabal.o )
  663. 56.68 s [doctest] [24 of 44] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Location.o )
  664. 56.68 s [doctest] [25 of 44] Compiling Util ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
  665. 56.68 s [doctest] [26 of 44] Compiling Extract ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
  666. 57.01 s [doctest] [27 of 44] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Extract.o )
  667. 57.05 s [doctest] [28 of 44] Compiling Parse ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
  668. 57.84 s [doctest] [29 of 44] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Parse.o )
  669. 58.15 s [doctest] [30 of 44] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
  670. 60.31 s [doctest] [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
  671. 62.01 s [doctest] [32 of 44] Compiling Property ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
  672. 62.01 s [doctest] [33 of 44] Compiling Runner ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
  673. 62.01 s [doctest] [34 of 44] Compiling RunnerSpec ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
  674. 62.41 s [doctest] [35 of 44] Compiling Run ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
  675. 62.65 s [doctest] [36 of 44] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Run.o )
  676. 63.06 s [doctest] [37 of 44] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
  677. 63.17 s [doctest] [38 of 44] Compiling RunSpec ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
  678. 64.55 s [doctest] [39 of 44] Compiling MainSpec ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
  679. 64.74 s [doctest] [40 of 44] Compiling PropertySpec ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
  680. 64.74 s [doctest] [41 of 44] Compiling ParseSpec ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
  681. 64.74 s [doctest] [42 of 44] Compiling ExtractSpec ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
  682. 64.74 s [doctest] [43 of 44] Compiling UtilSpec ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
  683. 64.74 s [doctest] [44 of 44] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  684. 69.79 s [doctest] [45 of 45] Linking dist/build/spec/spec
  685. 82.23 s [doctest] buildPhase completed in 1 minutes 12 seconds
  686. 82.23 s [doctest] Phase: checkPhase
  687. 83.10 s [doctest] Running 1 test suites...
  688. 83.10 s [doctest] Test suite spec: RUNNING...
  689. 83.14 s [doctest]
  690. 83.14 s [doctest] Extract
  691. 83.14 s [doctest] extract
  692. 83.28 s [doctest] extracts documentation for a top-level declaration [✔]
  693. 83.40 s [doctest] extracts documentation from argument list [✔]
  694. 83.46 s [doctest] extracts documentation for a type class function [✔]
  695. 83.55 s [doctest] extracts documentation from the argument list of a type class function [✔]
  696. 83.62 s [doctest] extracts documentation from the module header [✔]
  697. 83.70 s [doctest] extracts documentation from imported modules [✔]
  698. 83.78 s [doctest] extracts documentation from export list [✔]
  699. 83.86 s [doctest] extracts documentation from named chunks [✔]
  700. 83.93 s [doctest] returns docstrings in the same order they appear in the source [✔]
  701. 84.00 s [doctest] extracts $setup code [✔]
  702. 84.06 s [doctest] fails on invalid flags [✔]
  703. 84.06 s [doctest] extract (regression tests)
  704. 84.13 s [doctest] works with infix operators [✔]
  705. 84.18 s [doctest] works with parallel list comprehensions [✔]
  706. 84.25 s [doctest] works with list comprehensions in instance definitions [✔]
  707. 84.32 s [doctest] works with foreign imports [✔]
  708. 84.38 s [doctest] works for rewrite rules [✔]
  709. 84.45 s [doctest] works for rewrite rules with type signatures [✔]
  710. 84.52 s [doctest] strips CR from dos line endings [✔]
  711. 84.62 s [doctest] works with a module that splices in an expression from an other module [✔]
  712. 84.72 s [doctest] works for type families and GHC 7.6.1 [✔]
  713. 84.72 s [doctest] Info
  714. 84.72 s [doctest] formatInfo
  715. 84.97 s [doctest] formats --info output [✔]
  716. 84.97 s [doctest] Interpreter
  717. 84.97 s [doctest] interpreterSupported
  718. 85.12 s [doctest] indicates whether GHCi is supported on current platform [✔]
  719. 85.12 s [doctest] ghcInfo
  720. 85.32 s [doctest] includes "Have interpreter" [✔]
  721. 85.32 s [doctest] safeEval
  722. 86.02 s [doctest] evaluates an expression [✔]
  723. 86.61 s [doctest] returns Left on unterminated multiline command [✔]
  724. 86.61 s [doctest] filterExpression
  725. 86.61 s [doctest] removes :set -XTemplateHaskell [✔]
  726. 86.61 s [doctest] filters -XTemplateHaskell [✔]
  727. 86.61 s [doctest] leaves :set-statement that do not set -XTemplateHaskell alone [✔]
  728. 86.61 s [doctest] Language.Haskell.GhciWrapper
  729. 86.61 s [doctest] evalEcho
  730. 87.22 s [doctest] prints result to stdout [✔]
  731. 87.22 s [doctest] evalWith
  732. 87.22 s [doctest] with PreserveIt
  733. 87.91 s [doctest] preserves it [✔]
  734. 87.94 s [doctest] eval
  735. 88.58 s [doctest] shows literals [✔]
  736. 89.19 s [doctest] shows string literals containing Unicode [✔]
  737. 89.69 s [doctest] evaluates simple expressions [✔]
  738. 90.31 s [doctest] supports let bindings [✔]
  739. 91.00 s [doctest] allows import statements [✔]
  740. 91.43 s [doctest] captures stdout [✔]
  741. 91.97 s [doctest] captures stdout (Unicode) [✔]
  742. 92.65 s [doctest] captures stdout (empty line) [✔]
  743. 93.30 s [doctest] captures stdout (multiple lines) [✔]
  744. 93.87 s [doctest] captures stderr [✔]
  745. 94.38 s [doctest] captures stderr (Unicode) [✔]
  746. 95.01 s [doctest] shows exceptions [✔]
  747. 95.86 s [doctest] shows exceptions (ExitCode) [✔]
  748. 96.62 s [doctest] gives an error message for identifiers that are not in scope [✔]
  749. 96.62 s [doctest] when configVerbose is True
  750. 97.30 s [doctest] prints prompt [✔]
  751. 97.30 s [doctest] with -XOverloadedStrings, -Wall and -Werror
  752. 97.91 s [doctest] does not fail on marker expression (bug fix) [✔]
  753. 97.91 s [doctest] with NoImplicitPrelude
  754. 98.58 s [doctest] works [✔]
  755. 98.58 s [doctest] with a strange String type
  756. 99.22 s [doctest] works [✔]
  757. 99.22 s [doctest] Location
  758. 99.22 s [doctest] toLocation
  759. 99.22 s [doctest] works for a regular SrcSpan [✔]
  760. 99.24 s [doctest] works for a single-line SrcSpan [✔]
  761. 99.24 s [doctest] works for a SrcSpan that corresponds to single point [✔]
  762. 99.24 s [doctest] works for a bad SrcSpan [✔]
  763. 99.24 s [doctest] works for a SrcLoc with bad locations [✔]
  764. 99.24 s [doctest] enumerate
  765. 99.24 s [doctest] replicates UnhelpfulLocation [✔]
  766. 99.24 s [doctest] enumerates Location [✔]
  767. 99.24 s [doctest] Main
  768. 99.24 s [doctest] doctest
  769. 100.09 s [doctest] testSimple [✔]
  770. 101.02 s [doctest] it-variable [✔]
  771. 102.18 s [doctest] it-variable in $setup [✔]
  772. 103.22 s [doctest] failing [✔]
  773. 104.16 s [doctest] skips subsequent examples from the same group if an example fails [✔]
  774. 104.16 s [doctest] without --fail-fast
  775. 105.16 s [doctest] continuous even if some tests fail [✔]
  776. 105.16 s [doctest] with --fail-fast
  777. 106.08 s [doctest] stops after the first failure [✔]
  778. 107.05 s [doctest] stops after failures in $setup [✔]
  779. 108.58 s [doctest] testImport [✔]
  780. 109.77 s [doctest] testCommentLocation [✔]
  781. 110.72 s [doctest] testPutStr [✔]
  782. 111.53 s [doctest] fails on multi-line expressions, introduced with :{ [✔]
  783. 112.36 s [doctest] testBlankline [✔]
  784. 113.46 s [doctest] examples from the same Haddock comment share the same scope [✔]
  785. 114.52 s [doctest] testDocumentationForArguments [✔]
  786. 115.63 s [doctest] template-haskell [✔]
  787. 116.86 s [doctest] handles source files with CRLF line endings [✔]
  788. 117.74 s [doctest] runs $setup before each test group [✔]
  789. 118.50 s [doctest] skips subsequent tests from a module, if $setup fails [✔]
  790. 119.27 s [doctest] ignores trailing whitespace when matching test output [✔]
  791. 119.29 s [doctest] doctest as a runner for QuickCheck properties
  792. 120.37 s [doctest] runs a boolean property [✔]
  793. 121.69 s [doctest] runs an explicitly quantified property [✔]
  794. 122.97 s [doctest] runs an implicitly quantified property [✔]
  795. 124.29 s [doctest] reports a failing property [✔]
  796. 125.67 s [doctest] runs a boolean property with an explicit type signature [✔]
  797. 127.16 s [doctest] runs $setup before each property [✔]
  798. 127.17 s [doctest] doctest (regression tests)
  799. 129.57 s [doctest] bugfixWorkingDirectory [✔]
  800. 130.58 s [doctest] bugfixOutputToStdErr [✔]
  801. 131.72 s [doctest] bugfixImportHierarchical [✔]
  802. 132.86 s [doctest] bugfixMultipleModules [✔]
  803. 135.02 s [doctest] testCPP [✔]
  804. 136.62 s [doctest] template-haskell-bugfix [✔]
  805. 137.51 s [doctest] doesn't clash with user bindings of stdout/stderr [✔]
  806. 138.31 s [doctest] doesn't get confused by doctests using System.IO imports [✔]
  807. 138.31 s [doctest] Options
  808. 138.31 s [doctest] parseOptions
  809. 138.31 s [doctest] strips --optghc [✔]
  810. 138.31 s [doctest] strips --optghc= [✔]
  811. 138.31 s [doctest] with ghc options that are not valid with --interactive
  812. 138.38 s [doctest] returns ProxyToGhc [✔]
  813. 138.38 s [doctest] +++ OK, passed 100 tests.
  814. 138.38 s [doctest] with --interactive
  815. 138.38 s [doctest] disables magic mode [✔]
  816. 138.38 s [doctest] filters out --interactive [✔]
  817. 138.38 s [doctest] accepts --fast [✔]
  818. 138.38 s [doctest] --no-magic
  819. 138.38 s [doctest] without --no-magic
  820. 138.38 s [doctest] enables magic mode [✔]
  821. 138.38 s [doctest] with --no-magic
  822. 138.38 s [doctest] disables magic mode [✔]
  823. 138.38 s [doctest] --fast
  824. 138.38 s [doctest] without --fast
  825. 138.38 s [doctest] disables fast mode [✔]
  826. 138.38 s [doctest] with --fast
  827. 138.38 s [doctest] enables fast mode [✔]
  828. 138.38 s [doctest] --preserve-it
  829. 138.38 s [doctest] without --preserve-it
  830. 138.38 s [doctest] does not preserve the `it` variable [✔]
  831. 138.38 s [doctest] with --preserve-it
  832. 138.39 s [doctest] preserves the `it` variable [✔]
  833. 138.39 s [doctest] --fail-fast
  834. 138.39 s [doctest] without --fail-fast
  835. 138.39 s [doctest] disables fail-fast mode [✔]
  836. 138.39 s [doctest] with --fail-fast
  837. 138.39 s [doctest] enables fail-fast mode [✔]
  838. 138.39 s [doctest] with --help
  839. 138.39 s [doctest] outputs usage information [✔]
  840. 138.39 s [doctest] with --version
  841. 138.39 s [doctest] outputs version information [✔]
  842. 138.39 s [doctest] with --info
  843. 138.53 s [doctest] outputs machine readable version information [✔]
  844. 138.53 s [doctest] --verbose
  845. 138.53 s [doctest] without --verbose
  846. 138.53 s [doctest] is not verbose by default [✔]
  847. 138.53 s [doctest] with --verbose
  848. 138.53 s [doctest] parses verbose option [✔]
  849. 138.53 s [doctest] PackageDBs
  850. 138.53 s [doctest] getPackageDBsFromEnv
  851. 138.53 s [doctest] uses global and user when no env used [✔]
  852. 138.53 s [doctest] respects GHC_PACKAGE_PATH [✔]
  853. 138.53 s [doctest] Parse
  854. 138.53 s [doctest] extractDocTests
  855. 138.58 s [doctest] extracts properties from a module [✔]
  856. 138.69 s [doctest] extracts examples from a module [✔]
  857. 138.80 s [doctest] extracts examples from documentation for non-exported names [✔]
  858. 138.93 s [doctest] extracts multiple examples from a module [✔]
  859. 139.04 s [doctest] returns an empty list, if documentation contains no examples [✔]
  860. 139.15 s [doctest] sets setup code to Nothing, if it does not contain any tests [✔]
  861. 139.26 s [doctest] keeps modules that only contain setup code [✔]
  862. 139.26 s [doctest] parseInteractions (an internal function)
  863. 139.26 s [doctest] parses an interaction [✔]
  864. 139.26 s [doctest] drops whitespace as appropriate [✔]
  865. 139.26 s [doctest] parses an interaction without a result [✔]
  866. 139.26 s [doctest] works with a complex example [✔]
  867. 139.26 s [doctest] attaches location information to parsed interactions [✔]
  868. 139.27 s [doctest] basic multiline [✔]
  869. 139.27 s [doctest] multiline align output [✔]
  870. 139.27 s [doctest] multiline align output with >>> [✔]
  871. 139.27 s [doctest] parses wild cards lines [✔]
  872. 139.27 s [doctest] parses wild card chunks [✔]
  873. 139.27 s [doctest] parseProperties (an internal function)
  874. 139.27 s [doctest] parses a property [✔]
  875. 139.27 s [doctest] mkLineChunks (an internal function)
  876. 139.27 s [doctest] replaces ellipsis with WildCardChunks [✔]
  877. 139.27 s [doctest] doesn't replace fewer than 3 consecutive dots [✔]
  878. 139.27 s [doctest] handles leading and trailing dots [✔]
  879. 139.27 s [doctest] handles leading and trailing ellipsis [✔]
  880. 139.27 s [doctest] Property
  881. 139.27 s [doctest] runProperty
  882. 140.28 s [doctest] reports a failing property [✔]
  883. 141.23 s [doctest] runs a Bool property [✔]
  884. 142.39 s [doctest] runs a Bool property with an explicit type signature [✔]
  885. 143.38 s [doctest] runs an implicitly quantified property [✔]
  886. 144.51 s [doctest] runs an implicitly quantified property even with GHC 7.4 [✔]
  887. 145.64 s [doctest] runs an explicitly quantified property [✔]
  888. 146.81 s [doctest] allows to mix implicit and explicit quantification [✔]
  889. 148.14 s [doctest] reports the value for which a property fails [✔]
  890. 149.30 s [doctest] reports the values for which a property that takes multiple arguments fails [✔]
  891. 150.57 s [doctest] defaults ambiguous type variables to Integer [✔]
  892. 150.57 s [doctest] freeVariables
  893. 151.49 s [doctest] finds a free variables in a term [✔]
  894. 152.45 s [doctest] ignores duplicates [✔]
  895. 153.29 s [doctest] works for terms with multiple names [✔]
  896. 154.00 s [doctest] works for names that contain a prime [✔]
  897. 154.70 s [doctest] works for names that are similar to other names that are in scope [✔]
  898. 154.70 s [doctest] parseNotInScope
  899. 154.70 s [doctest] when error message was produced by GHC 7.4.1
  900. 154.70 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  901. 154.70 s [doctest] ignores duplicates [✔]
  902. 154.70 s [doctest] works for variable names that contain a prime [✔]
  903. 154.70 s [doctest] works for error messages with suggestions [✔]
  904. 154.70 s [doctest] when error message was produced by GHC 8.0.1
  905. 154.70 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  906. 154.70 s [doctest] ignores duplicates [✔]
  907. 154.70 s [doctest] works for variable names that contain a prime [✔]
  908. 154.70 s [doctest] works for error messages with suggestions [✔]
  909. 154.70 s [doctest] Run
  910. 154.70 s [doctest] doctest
  911. 155.96 s [doctest] exits with ExitFailure if at least one test case fails [✔]
  912. 155.96 s [doctest] prints help on --help [✔]
  913. 155.96 s [doctest] prints version on --version [✔]
  914. 157.08 s [doctest] accepts arbitrary GHC options [✔]
  915. 158.40 s [doctest] accepts GHC options with --optghc [✔]
  916. 159.48 s [doctest] prints a deprecation message for --optghc [✔]
  917. 159.62 s [doctest] prints error message on invalid option [✔]
  918. 160.94 s [doctest] interprets GHC response files [✔]
  919. 162.03 s [doctest] prints verbose description of a specification [✔]
  920. 163.40 s [doctest] prints verbose description of a property [✔]
  921. 164.59 s [doctest] prints verbose error [✔]
  922. 165.91 s [doctest] can deal with potentially problematic GHC options [✔]
  923. 165.91 s [doctest] doctestWithResult
  924. 165.91 s [doctest] on parse error
  925. 166.01 s [doctest] aborts with (ExitFailure 1) [✔]
  926. 166.12 s [doctest] prints a useful error message [✔]
  927. 166.12 s [doctest] expandDirs
  928. 166.12 s [doctest] expands a directory [✔]
  929. 166.12 s [doctest] ignores files [✔]
  930. 166.12 s [doctest] ignores random things [✔]
  931. 166.12 s [doctest] Runner
  932. 166.12 s [doctest] report
  933. 166.12 s [doctest] when mode is interactive
  934. 166.12 s [doctest] writes to stderr [✔]
  935. 166.12 s [doctest] when mode is non-interactive
  936. 166.12 s [doctest] writes to stderr [✔]
  937. 166.12 s [doctest] report_
  938. 166.12 s [doctest] when mode is interactive
  939. 166.12 s [doctest] writes transient output to stderr [✔]
  940. 166.12 s [doctest] when mode is non-interactive
  941. 166.12 s [doctest] is ignored [✔]
  942. 166.12 s [doctest] Runner.Example
  943. 166.12 s [doctest] mkResult
  944. 166.38 s [doctest] returns Equal when output matches [✔]
  945. 166.38 s [doctest] +++ OK, passed 100 tests.
  946. 166.39 s [doctest] ignores trailing whitespace [✔]
  947. 166.39 s [doctest] with WildCardLine
  948. 166.39 s [doctest] matches zero lines [✔]
  949. 166.39 s [doctest] matches first zero line [✔]
  950. 166.39 s [doctest] matches final zero line [✔]
  951. 166.39 s [doctest] matches an arbitrary number of lines [✔]
  952. 166.40 s [doctest] matches an arbitrary number of lines (quickcheck) [✔]
  953. 166.40 s [doctest] +++ OK, passed 100 tests.
  954. 166.40 s [doctest] with WildCardChunk
  955. 166.40 s [doctest] matches an arbitrary line chunk [✔]
  956. 166.40 s [doctest] matches an arbitrary line chunk at end [✔]
  957. 166.40 s [doctest] does not match at end [✔]
  958. 166.40 s [doctest] does not match at start [✔]
  959. 166.40 s [doctest] when output does not match
  960. 166.40 s [doctest] constructs failure message [✔]
  961. 166.40 s [doctest] constructs failure message for multi-line output [✔]
  962. 166.40 s [doctest] when any output line contains "unsafe" characters
  963. 166.40 s [doctest] uses show to format output lines [✔]
  964. 166.40 s [doctest] insert caret after last matching character on different lengths [✔]
  965. 166.40 s [doctest] insert caret after mismatching line for multi-line output [✔]
  966. 166.40 s [doctest] insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
  967. 166.40 s [doctest] insert caret after longest match for wildcard [✔]
  968. 166.40 s [doctest] show expanded pattern for long matches [✔]
  969. 166.40 s [doctest] Util
  970. 166.41 s [doctest] convertDosLineEndings
  971. 166.41 s [doctest] converts CRLF to LF [✔]
  972. 166.41 s [doctest] strips a trailing CR [✔]
  973. 166.41 s [doctest] takeWhileEnd
  974. 166.41 s [doctest] returns the longest suffix of elements that satisfy a given predicate [✔]
  975. 166.41 s [doctest]
  976. 166.41 s [doctest] Finished in 83.2658 seconds
  977. 166.41 s [doctest] 198 examples, 0 failures
  978. 166.45 s [doctest] Test suite spec: PASS
  979. 166.45 s [doctest] Test suite logged to: dist/test/doctest-0.24.2-spec.log
  980. 166.46 s [doctest] 1 of 1 test suites (1 of 1 test cases) passed.
  981. 166.47 s [doctest] checkPhase completed in 1 minutes 24 seconds
  982. 166.47 s [doctest] Phase: haddockPhase
  983. 166.90 s [doctest] Preprocessing library for doctest-0.24.2...
  984. 166.93 s [doctest] Running Haddock on library for doctest-0.24.2...
  985. 169.19 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, nothing )
  986. 169.45 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, nothing )
  987. 170.97 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, nothing )
  988. 171.18 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, nothing )
  989. 171.30 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, nothing )
  990. 171.38 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, nothing )
  991. 171.56 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, nothing )
  992. 171.64 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, nothing )
  993. 171.74 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, nothing )
  994. 171.83 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, nothing )
  995. 171.91 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, nothing )
  996. 171.94 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, nothing )
  997. 172.61 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, nothing )
  998. 172.91 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, nothing )
  999. 172.93 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, nothing )
  1000. 172.94 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, nothing )
  1001. 172.95 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, nothing )
  1002. 173.58 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, nothing )
  1003. 173.58 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, nothing )
  1004. 173.79 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, nothing )
  1005. 173.80 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, nothing )
  1006. 173.99 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, nothing )
  1007. 174.05 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, nothing )
  1008. 174.30 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, nothing )
  1009. 174.37 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, nothing )
  1010. 174.37 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, nothing )
  1011. 174.37 s [doctest] Haddock coverage:
  1012. 174.39 s [doctest] Warning: Imports: Could not find documentation for exported module: Imports
  1013. 174.40 s [doctest] 0% ( 0 / 2) in 'Test.DocTest.Internal.Cabal'
  1014. 174.40 s [doctest] Missing documentation for:
  1015. 174.40 s [doctest] Module header
  1016. 174.40 s [doctest] doctest (src/Test/DocTest/Internal/Cabal.hs:10)
  1017. 174.40 s [doctest] 88% ( 8 / 9) in 'Test.DocTest.Internal.Location'
  1018. 174.40 s [doctest] Missing documentation for:
  1019. 174.40 s [doctest] Module header
  1020. 174.40 s [doctest] Warning: 'SomeException' is ambiguous. It is defined
  1021. 174.40 s [doctest] * in ‘GHC.Internal.Exception.Type’
  1022. 174.40 s [doctest] * in ‘GHC.Internal.Exception.Type’
  1023. 174.40 s [doctest] You may be able to disambiguate the identifier by qualifying it or
  1024. 174.40 s [doctest] by specifying the type/value namespace explicitly.
  1025. 174.40 s [doctest] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  1026. 174.40 s [doctest] 66% ( 2 / 3) in 'Test.DocTest.Internal.Extract'
  1027. 174.40 s [doctest] Missing documentation for:
  1028. 174.40 s [doctest] Module header
  1029. 174.40 s [doctest] 22% ( 2 / 9) in 'Test.DocTest.Internal.Parse'
  1030. 174.40 s [doctest] Missing documentation for:
  1031. 174.40 s [doctest] Module header
  1032. 174.40 s [doctest] DocTest (src/Parse.hs:29)
  1033. 174.41 s [doctest] Expression (src/Parse.hs:44)
  1034. 174.41 s [doctest] ExpectedResult (src/Parse.hs:45)
  1035. 174.41 s [doctest] ExpectedLine (src/Parse.hs:38)
  1036. 174.41 s [doctest] LineChunk (src/Parse.hs:32)
  1037. 174.41 s [doctest] parseModules (src/Parse.hs:60)
  1038. 174.41 s [doctest] Warning: 'report_' is out of scope.
  1039. 174.41 s [doctest] If you qualify the identifier, haddock can try to link it anyway.
  1040. 174.41 s [doctest] 15% ( 2 / 13) in 'Test.DocTest.Internal.Run'
  1041. 174.41 s [doctest] Missing documentation for:
  1042. 174.41 s [doctest] Module header
  1043. 174.41 s [doctest] Result (src/Run.hs:139)
  1044. 174.41 s [doctest] Config (src/Options.hs:58)
  1045. 174.41 s [doctest] isSuccess (src/Runner.hs:55)
  1046. 174.41 s [doctest] defaultConfig (src/Options.hs:68)
  1047. 174.41 s [doctest] doctestWithRepl (src/Run.hs:67)
  1048. 174.41 s [doctest] doctestWith (src/Run.hs:137)
  1049. 174.41 s [doctest] formatSummary (src/Runner.hs:58)
  1050. 174.41 s [doctest] evaluateResult (src/Run.hs:142)
  1051. 174.41 s [doctest] doctestWithResult (src/Run.hs:145)
  1052. 174.41 s [doctest] runDocTests (src/Run.hs:155)
  1053. 174.41 s [doctest] 50% ( 1 / 2) in 'Test.DocTest'
  1054. 174.41 s [doctest] Missing documentation for:
  1055. 174.41 s [doctest] Module header
  1056. 210.77 s [doctest] Documentation created: dist/doc/html/doctest/,
  1057. 210.77 s [doctest] dist/doc/html/doctest/doctest.txt
  1058. 210.99 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  1059. 210.99 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  1060. 211.04 s [doctest] haddockPhase completed in 45 seconds
  1061. 211.04 s [doctest] Phase: installPhase
  1062. 211.45 s [doctest] Installing library in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1063. 211.69 s [doctest] Installing executable doctest in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin
  1064. 211.69 s [doctest] Warning: The directory
  1065. 211.69 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin is not in the
  1066. 211.69 s [doctest] system search path.
  1067. 214.22 s [doctest] Phase: fixupPhase
  1068. 214.29 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2
  1069. 214.29 s [doctest] shrinking /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSdoctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8-ghc9.10.3.so
  1070. 214.33 s [doctest] shrinking /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  1071. 214.64 s [doctest] checking for references to /build/ in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2...
  1072. 214.96 s [doctest] patching script interpreter paths in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2
  1073. 214.98 s [doctest] stripping (with command strip and flags -S -p) in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/lib /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin
  1074. 216.02 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc
  1075. 216.04 s [doctest] checking for references to /build/ in /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc...
  1076. 216.11 s [doctest] patching script interpreter paths in /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc
  1077. 216.81 s [doctest:post-build] Uploading to cachix cache "sellout": /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2
  1078. 217.79 s [doctest:post-build] Nothing to push - all store paths are already on Cachix.
  1079. 217.90 s [doctest:post-build] Uploading to the NixCI cache: /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2
  1080. 218.16 s [doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1081. 218.53 s [doctest:post-build] copying 2 paths...
  1082. 218.53 s [doctest:post-build] copying path '/nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc' to 'https://cache.nix-ci.com'...
  1083. 219.10 s [doctest:post-build] copying path '/nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2' to 'https://cache.nix-ci.com'...
  1084. 283.98 s [doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1085. 284.11 s [doctest:post-build] copying 0 paths...
  1086. 284.16 s Progress: 1 of 18 built, 159 of 159 downloaded from cache
  1087. 284.25 s Building /nix/store/6hkrxmy4yj8facxlvn54nrc60rim1h1a-duoids-0.0.1.0.drv
  1088. 284.34 s Building /nix/store/w2gq8i6jvy0bi4cr65w2d8m4sg7l6qnf-vector-0.13.2.0.drv
  1089. 284.44 s [duoids] Phase: setupCompilerEnvironmentPhase
  1090. 284.45 s [duoids] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  1091. 284.56 s [vector] Phase: setupCompilerEnvironmentPhase
  1092. 284.57 s [vector] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  1093. 284.90 s [duoids] Phase: unpackPhase
  1094. 284.92 s [duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./core
  1095. 284.94 s [duoids] source root is core
  1096. 284.97 s [duoids] Phase: patchPhase
  1097. 284.99 s [duoids] Phase: compileBuildDriverPhase
  1098. 285.00 s [duoids] setupCompileFlags: -package-db=/build/tmp.vaxfF3nJDm/setup-package.conf.d -threaded
  1099. 285.06 s [vector] Phase: unpackPhase
  1100. 285.07 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  1101. 285.10 s [vector] source root is vector-0.13.2.0
  1102. 285.13 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  1103. 285.15 s [vector] Phase: patchPhase
  1104. 285.16 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  1105. 285.18 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  1106. 285.19 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.vaxfF3nJDm/Main.o )
  1107. 285.24 s [vector] Phase: compileBuildDriverPhase
  1108. 285.24 s [vector] setupCompileFlags: -package-db=/build/tmp.e8OrKpk6f0/setup-package.conf.d -threaded
  1109. 285.33 s [duoids] [2 of 2] Linking Setup
  1110. 285.39 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.e8OrKpk6f0/Main.o )
  1111. 285.54 s [vector] [2 of 2] Linking Setup
  1112. 288.11 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  1113. 288.13 s [duoids] Phase: configurePhase
  1114. 288.14 s [duoids] configureFlags: --verbose --prefix=/nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.vaxfF3nJDm/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  1115. 288.16 s [duoids] Using Parsec parser
  1116. 288.16 s [duoids] Configuring duoids-0.0.1.0...
  1117. 288.20 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  1118. 288.22 s [vector] Phase: configurePhase
  1119. 288.22 s [vector] configureFlags: --verbose --prefix=/nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.e8OrKpk6f0/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  1120. 288.26 s [vector] Using Parsec parser
  1121. 288.26 s [vector] Configuring vector-0.13.2.0...
  1122. 288.84 s [duoids] Flags chosen: lint=False, noisy-deprecations=True
  1123. 289.16 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  1124. 289.16 s [vector] wall=False
  1125. 289.61 s [duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1126. 289.64 s [duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1127. 289.64 s [duoids] <4.23: using base-4.20.2.0
  1128. 289.64 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1129. 289.64 s [duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1130. 289.64 s [duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1131. 289.64 s [duoids] <4.23: using base-4.20.2.0
  1132. 289.64 s [duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  1133. 289.64 s [duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  1134. 289.64 s [duoids] doctest-0.24.2
  1135. 289.64 s [duoids] Dependency duoids: using duoids-0.0.1.0
  1136. 289.64 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1137. 289.64 s [duoids] Source component graph:
  1138. 289.64 s [duoids] component lib
  1139. 289.64 s [duoids] component test:doctests dependency lib
  1140. 289.64 s [duoids] Configured component graph:
  1141. 289.64 s [duoids] component duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1142. 289.64 s [duoids] include base-4.20.2.0-64da
  1143. 289.64 s [duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1144. 289.64 s [duoids] component duoids-0.0.1.0-EnXTH3qCR9Q7DYYsKRHADF-doctests
  1145. 289.64 s [duoids] include base-4.20.2.0-64da
  1146. 289.64 s [duoids] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1147. 289.64 s [duoids] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1148. 289.64 s [duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1149. 289.64 s [duoids] Linked component graph:
  1150. 289.64 s [duoids] unit duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1151. 289.64 s [duoids] include base-4.20.2.0-64da
  1152. 289.64 s [duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1153. 289.64 s [duoids] Control.Duoidal=duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4:Data.Duoid.Laws
  1154. 289.64 s [duoids] unit duoids-0.0.1.0-EnXTH3qCR9Q7DYYsKRHADF-doctests
  1155. 289.64 s [duoids] include base-4.20.2.0-64da
  1156. 289.64 s [duoids] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1157. 289.64 s [duoids] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1158. 289.64 s [duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1159. 289.64 s [duoids] Ready component graph:
  1160. 289.64 s [duoids] definite duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1161. 289.64 s [duoids] depends base-4.20.2.0-64da
  1162. 289.64 s [duoids] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1163. 289.64 s [duoids] definite duoids-0.0.1.0-EnXTH3qCR9Q7DYYsKRHADF-doctests
  1164. 289.64 s [duoids] depends base-4.20.2.0-64da
  1165. 289.64 s [duoids] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1166. 289.64 s [duoids] depends duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1167. 289.64 s [duoids] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1168. 289.64 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1169. 289.64 s [duoids] Using compiler: ghc-9.10.3
  1170. 289.64 s [duoids] Using install prefix:
  1171. 289.64 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0
  1172. 289.64 s [duoids] Executables installed in:
  1173. 289.64 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/bin
  1174. 289.64 s [duoids] Libraries installed in:
  1175. 289.64 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1176. 289.64 s [duoids] Dynamic Libraries installed in:
  1177. 289.64 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  1178. 289.64 s [duoids] Private executables installed in:
  1179. 289.64 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-05f6/duoids-0.0.1.0
  1180. 289.64 s [duoids] Data files installed in:
  1181. 289.64 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.3-05f6/duoids-0.0.1.0
  1182. 289.64 s [duoids] Documentation installed in:
  1183. 289.64 s [duoids] /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  1184. 289.64 s [duoids] Configuration files installed in:
  1185. 289.64 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/etc
  1186. 289.64 s [duoids] No alex found
  1187. 289.64 s [duoids] Using ar found on system at:
  1188. 289.64 s [duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1189. 289.64 s [duoids] No c2hs found
  1190. 289.64 s [duoids] No cpphs found
  1191. 289.64 s [duoids] Using doctest version 0.24.2 found on system at:
  1192. 289.64 s [duoids] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  1193. 289.64 s [duoids] Using gcc version 14.3.0 given by user at:
  1194. 289.64 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1195. 289.64 s [duoids] Using ghc version 9.10.3 found on system at:
  1196. 289.64 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  1197. 289.64 s [duoids] Using ghc-pkg version 9.10.3 found on system at:
  1198. 289.64 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1199. 289.64 s [duoids] No ghcjs found
  1200. 289.64 s [duoids] No ghcjs-pkg found
  1201. 289.64 s [duoids] No greencard found
  1202. 289.64 s [duoids] Using haddock version 2.31.1 found on system at:
  1203. 289.64 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1204. 289.64 s [duoids] No happy found
  1205. 289.64 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  1206. 289.64 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1207. 289.64 s [duoids] No hmake found
  1208. 289.64 s [duoids] Using hpc version 0.69 found on system at:
  1209. 289.64 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1210. 289.64 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  1211. 289.64 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1212. 289.64 s [duoids] Using hscolour version 1.25 found on system at:
  1213. 289.64 s [duoids] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  1214. 289.64 s [duoids] No jhc found
  1215. 289.64 s [duoids] Using ld found on system at:
  1216. 289.64 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  1217. 289.64 s [duoids] No pkg-config found
  1218. 289.64 s [duoids] Using runghc version 9.10.3 found on system at:
  1219. 289.64 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  1220. 289.64 s [duoids] Using strip version 2.44 found on system at:
  1221. 289.64 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1222. 289.64 s [duoids] Using tar found on system at:
  1223. 289.64 s [duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1224. 289.64 s [duoids] No uhc found
  1225. 289.80 s [vector] Dependency base: using base-4.20.2.0
  1226. 289.80 s [vector] Dependency deepseq: using deepseq-1.5.0.0
  1227. 289.80 s [vector] Dependency primitive: using primitive-0.9.1.0
  1228. 289.80 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  1229. 289.80 s [vector] Dependency base: using base-4.20.2.0
  1230. 289.80 s [vector] Dependency random: using random-1.2.1.3
  1231. 289.80 s [vector] Dependency tasty: using tasty-1.5.3
  1232. 289.80 s [vector] Dependency vector: using vector-0.13.2.0
  1233. 289.80 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  1234. 289.80 s [vector] Dependency base: using base-4.20.2.0
  1235. 289.80 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  1236. 289.80 s [vector] Dependency primitive: using primitive-0.9.1.0
  1237. 289.80 s [vector] Dependency random: using random-1.2.1.3
  1238. 289.80 s [vector] Dependency tasty: using tasty-1.5.3
  1239. 289.80 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  1240. 289.80 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  1241. 289.80 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  1242. 289.80 s [vector] Dependency transformers: using transformers-0.6.1.1
  1243. 289.80 s [vector] Dependency vector: using vector-0.13.2.0
  1244. 289.81 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  1245. 289.81 s [vector] Dependency base: using base-4.20.2.0
  1246. 289.81 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  1247. 289.81 s [vector] Dependency primitive: using primitive-0.9.1.0
  1248. 289.81 s [vector] Dependency random: using random-1.2.1.3
  1249. 289.81 s [vector] Dependency tasty: using tasty-1.5.3
  1250. 289.81 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  1251. 289.81 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  1252. 289.81 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  1253. 289.81 s [vector] Dependency transformers: using transformers-0.6.1.1
  1254. 289.81 s [vector] Dependency vector: using vector-0.13.2.0
  1255. 289.81 s [vector] Dependency base: using base-4.20.2.0
  1256. 289.81 s [vector] Dependency doctest: using doctest-0.24.2
  1257. 289.81 s [vector] Dependency primitive: using primitive-0.9.1.0
  1258. 289.81 s [vector] Dependency vector: using vector-0.13.2.0
  1259. 289.81 s [vector] Dependency base: using base-4.20.2.0
  1260. 289.81 s [vector] Dependency primitive: using primitive-0.9.1.0
  1261. 289.81 s [vector] Dependency tasty: using tasty-1.5.3
  1262. 289.81 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  1263. 289.81 s [vector] Dependency vector: using vector-0.13.2.0
  1264. 289.81 s [vector] Source component graph:
  1265. 289.81 s [vector] component lib
  1266. 289.81 s [vector] component lib:benchmarks-O2 dependency lib
  1267. 289.81 s [vector] component test:vector-doctest dependency lib
  1268. 289.81 s [vector] component test:vector-inspection dependency lib
  1269. 289.81 s [vector] component test:vector-tests-O0 dependency lib
  1270. 289.81 s [vector] component test:vector-tests-O2 dependency lib
  1271. 289.81 s [vector] Configured component graph:
  1272. 289.81 s [vector] component vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1273. 289.81 s [vector] include base-4.20.2.0-64da
  1274. 289.81 s [vector] include deepseq-1.5.0.0-9a2c
  1275. 289.81 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1276. 289.81 s [vector] include vector-stream-0.1.0.1-itT1vUTIBQHCSMVqGEqOG
  1277. 289.81 s [vector] component vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2
  1278. 289.81 s [vector] include base-4.20.2.0-64da
  1279. 289.81 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1280. 289.81 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1281. 289.81 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1282. 289.81 s [vector] component vector-0.13.2.0-EnRUp7R9xm43Cm9n0bdp6H-vector-doctest
  1283. 289.81 s [vector] include base-4.20.2.0-64da
  1284. 289.81 s [vector] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1285. 289.81 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1286. 289.81 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1287. 289.81 s [vector] component vector-0.13.2.0-620zwB5ek2s4PoiwQdsE4k-vector-inspection
  1288. 289.81 s [vector] include base-4.20.2.0-64da
  1289. 289.81 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1290. 289.81 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1291. 289.81 s [vector] include tasty-inspection-testing-0.2.1-1mW6bnKI6ZeJ0lgAunhsnE
  1292. 289.81 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1293. 289.81 s [vector] component vector-0.13.2.0-K8Rhp60DJrJ8B7TnxokOfc-vector-tests-O0
  1294. 289.81 s [vector] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1295. 289.81 s [vector] include base-4.20.2.0-64da
  1296. 289.81 s [vector] include base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1297. 289.81 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1298. 289.81 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1299. 289.81 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1300. 289.81 s [vector] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1301. 289.81 s [vector] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1302. 289.81 s [vector] include template-haskell-2.22.0.0-09e7
  1303. 289.81 s [vector] include transformers-0.6.1.1-6a26
  1304. 289.81 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1305. 289.82 s [vector] component vector-0.13.2.0-9Jfj4Iin60i4uaUUiYjW89-vector-tests-O2
  1306. 289.82 s [vector] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1307. 289.82 s [vector] include base-4.20.2.0-64da
  1308. 289.82 s [vector] include base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1309. 289.82 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1310. 289.82 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1311. 289.82 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1312. 289.82 s [vector] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1313. 289.82 s [vector] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1314. 289.82 s [vector] include template-haskell-2.22.0.0-09e7
  1315. 289.82 s [vector] include transformers-0.6.1.1-6a26
  1316. 289.82 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1317. 289.82 s [vector] Linked component graph:
  1318. 289.82 s [vector] unit vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1319. 289.82 s [vector] include base-4.20.2.0-64da
  1320. 289.82 s [vector] include deepseq-1.5.0.0-9a2c
  1321. 289.82 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1322. 289.82 s [vector] include vector-stream-0.1.0.1-itT1vUTIBQHCSMVqGEqOG
  1323. 289.82 s [vector] Data.Vector=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Unboxed.Mutable
  1324. 289.82 s [vector] unit vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2
  1325. 289.82 s [vector] include base-4.20.2.0-64da
  1326. 289.82 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1327. 289.82 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1328. 289.82 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1329. 289.88 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.TestData.ParenTree
  1330. 289.88 s [vector] unit vector-0.13.2.0-EnRUp7R9xm43Cm9n0bdp6H-vector-doctest
  1331. 289.88 s [vector] include base-4.20.2.0-64da
  1332. 289.88 s [vector] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1333. 289.88 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1334. 289.88 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1335. 289.88 s [vector] unit vector-0.13.2.0-620zwB5ek2s4PoiwQdsE4k-vector-inspection
  1336. 289.88 s [vector] include base-4.20.2.0-64da
  1337. 289.88 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1338. 289.88 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1339. 289.88 s [vector] include tasty-inspection-testing-0.2.1-1mW6bnKI6ZeJ0lgAunhsnE
  1340. 289.88 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1341. 289.88 s [vector] unit vector-0.13.2.0-K8Rhp60DJrJ8B7TnxokOfc-vector-tests-O0
  1342. 289.88 s [vector] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1343. 289.88 s [vector] include base-4.20.2.0-64da
  1344. 289.88 s [vector] include base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1345. 289.89 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1346. 289.89 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1347. 289.89 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1348. 289.89 s [vector] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1349. 289.89 s [vector] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1350. 289.89 s [vector] include template-haskell-2.22.0.0-09e7
  1351. 289.89 s [vector] include transformers-0.6.1.1-6a26
  1352. 289.89 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1353. 289.89 s [vector] unit vector-0.13.2.0-9Jfj4Iin60i4uaUUiYjW89-vector-tests-O2
  1354. 289.89 s [vector] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1355. 289.89 s [vector] include base-4.20.2.0-64da
  1356. 289.89 s [vector] include base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1357. 289.89 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1358. 289.89 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1359. 289.89 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1360. 289.89 s [vector] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1361. 289.89 s [vector] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1362. 289.89 s [vector] include template-haskell-2.22.0.0-09e7
  1363. 289.89 s [vector] include transformers-0.6.1.1-6a26
  1364. 289.89 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1365. 289.89 s [vector] Ready component graph:
  1366. 289.89 s [vector] definite vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1367. 289.89 s [vector] depends base-4.20.2.0-64da
  1368. 289.89 s [vector] depends deepseq-1.5.0.0-9a2c
  1369. 289.89 s [vector] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1370. 289.89 s [vector] depends vector-stream-0.1.0.1-itT1vUTIBQHCSMVqGEqOG
  1371. 289.89 s [vector] definite vector-0.13.2.0-K8Rhp60DJrJ8B7TnxokOfc-vector-tests-O0
  1372. 289.89 s [vector] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1373. 289.89 s [vector] depends base-4.20.2.0-64da
  1374. 289.89 s [vector] depends base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1375. 289.89 s [vector] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1376. 289.89 s [vector] depends random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1377. 289.89 s [vector] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1378. 289.89 s [vector] depends tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1379. 289.89 s [vector] depends tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1380. 289.89 s [vector] depends template-haskell-2.22.0.0-09e7
  1381. 289.89 s [vector] depends transformers-0.6.1.1-6a26
  1382. 289.89 s [vector] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1383. 289.89 s [vector] definite vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2
  1384. 289.89 s [vector] depends base-4.20.2.0-64da
  1385. 289.89 s [vector] depends random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1386. 289.89 s [vector] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1387. 289.89 s [vector] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1388. 289.89 s [vector] definite vector-0.13.2.0-EnRUp7R9xm43Cm9n0bdp6H-vector-doctest
  1389. 289.89 s [vector] depends base-4.20.2.0-64da
  1390. 289.89 s [vector] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1391. 289.89 s [vector] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1392. 289.89 s [vector] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1393. 289.89 s [vector] definite vector-0.13.2.0-9Jfj4Iin60i4uaUUiYjW89-vector-tests-O2
  1394. 289.89 s [vector] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1395. 289.89 s [vector] depends base-4.20.2.0-64da
  1396. 289.89 s [vector] depends base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1397. 289.89 s [vector] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1398. 289.89 s [vector] depends random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1399. 289.89 s [vector] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1400. 289.89 s [vector] depends tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1401. 289.89 s [vector] depends tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1402. 289.89 s [vector] depends template-haskell-2.22.0.0-09e7
  1403. 289.89 s [vector] depends transformers-0.6.1.1-6a26
  1404. 289.89 s [vector] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1405. 289.89 s [vector] definite vector-0.13.2.0-620zwB5ek2s4PoiwQdsE4k-vector-inspection
  1406. 289.89 s [vector] depends base-4.20.2.0-64da
  1407. 289.89 s [vector] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1408. 289.89 s [vector] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1409. 289.89 s [vector] depends tasty-inspection-testing-0.2.1-1mW6bnKI6ZeJ0lgAunhsnE
  1410. 289.89 s [vector] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1411. 289.89 s [vector] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1412. 289.89 s [vector] Using compiler: ghc-9.10.3
  1413. 289.89 s [vector] Using install prefix:
  1414. 289.89 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0
  1415. 289.89 s [vector] Executables installed in:
  1416. 289.89 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/bin
  1417. 289.89 s [vector] Libraries installed in:
  1418. 289.89 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1419. 289.89 s [vector] Dynamic Libraries installed in:
  1420. 289.89 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  1421. 289.89 s [vector] Private executables installed in:
  1422. 289.89 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0
  1423. 289.89 s [vector] Data files installed in:
  1424. 289.89 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/share/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0
  1425. 289.89 s [vector] Documentation installed in:
  1426. 289.89 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0
  1427. 289.90 s [vector] Configuration files installed in:
  1428. 289.90 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/etc
  1429. 289.90 s [vector] No alex found
  1430. 289.90 s [vector] Using ar found on system at:
  1431. 289.90 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1432. 289.90 s [vector] No c2hs found
  1433. 289.90 s [vector] No cpphs found
  1434. 289.90 s [vector] Using doctest version 0.24.2 found on system at:
  1435. 289.90 s [vector] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  1436. 289.90 s [vector] Using gcc version 14.3.0 given by user at:
  1437. 289.90 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1438. 289.90 s [vector] Using ghc version 9.10.3 found on system at:
  1439. 289.90 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  1440. 289.90 s [vector] Using ghc-pkg version 9.10.3 found on system at:
  1441. 289.90 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1442. 289.90 s [vector] No ghcjs found
  1443. 289.90 s [vector] No ghcjs-pkg found
  1444. 289.90 s [vector] No greencard found
  1445. 289.90 s [vector] Using haddock version 2.31.1 found on system at:
  1446. 289.90 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1447. 289.90 s [vector] No happy found
  1448. 289.90 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  1449. 289.90 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1450. 289.90 s [vector] No hmake found
  1451. 289.90 s [vector] Using hpc version 0.69 found on system at:
  1452. 289.90 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1453. 289.90 s [vector] Using hsc2hs version 0.68.10 found on system at:
  1454. 289.90 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1455. 289.90 s [vector] Using hscolour version 1.25 found on system at:
  1456. 289.90 s [vector] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  1457. 289.90 s [vector] No jhc found
  1458. 289.90 s [vector] Using ld found on system at:
  1459. 289.90 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  1460. 289.90 s [vector] No pkg-config found
  1461. 289.90 s [vector] Using runghc version 9.10.3 found on system at:
  1462. 289.90 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  1463. 289.90 s [vector] Using strip version 2.44 found on system at:
  1464. 289.90 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1465. 289.90 s [vector] Using tar found on system at:
  1466. 289.90 s [vector] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1467. 289.90 s [vector] No uhc found
  1468. 290.01 s [duoids] Phase: buildPhase
  1469. 290.17 s [duoids] Preprocessing library for duoids-0.0.1.0...
  1470. 290.17 s [duoids] Building library for duoids-0.0.1.0...
  1471. 290.36 s [vector] Phase: buildPhase
  1472. 290.39 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o )
  1473. 290.53 s [vector] Preprocessing library for vector-0.13.2.0...
  1474. 290.54 s [vector] Building library for vector-0.13.2.0...
  1475. 291.31 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  1476. 291.62 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 )
  1477. 291.79 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 )
  1478. 291.84 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 )
  1479. 292.30 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 )
  1480. 292.30 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 )
  1481. 292.30 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 )
  1482. 292.30 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 )
  1483. 294.71 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  1484. 300.11 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o )
  1485. 300.19 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o )
  1486. 300.19 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o )
  1487. 300.96 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  1488. 302.11 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  1489. 306.14 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  1490. 307.75 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 )
  1491. 312.99 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  1492. 313.49 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  1493. 313.51 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  1494. 317.77 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 )
  1495. 324.27 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  1496. 324.27 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  1497. 324.62 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1498. 325.66 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1499. 327.32 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 )
  1500. 327.48 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  1501. 328.94 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 )
  1502. 340.13 s [duoids] buildPhase completed in 50 seconds
  1503. 340.13 s [duoids] Phase: checkPhase
  1504. 341.51 s [duoids] Running 1 test suites...
  1505. 341.52 s [duoids] Test suite doctests: RUNNING...
  1506. 342.68 s [duoids] on the commandline: warning: [GHC-98887]
  1507. 342.68 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1508. 342.68 s [duoids]
  1509. 342.69 s [duoids] on the commandline: warning: [GHC-98887]
  1510. 342.69 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1511. 342.69 s [duoids]
  1512. 342.69 s [duoids] on the commandline: warning: [GHC-98887]
  1513. 342.69 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1514. 342.69 s [duoids]
  1515. 342.70 s [duoids] on the commandline: warning: [GHC-98887]
  1516. 342.70 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1517. 342.70 s [duoids]
  1518. 342.70 s [duoids] on the commandline: warning: [GHC-98887]
  1519. 342.70 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1520. 342.70 s [duoids]
  1521. 342.70 s [duoids] on the commandline: warning: [GHC-98887]
  1522. 342.70 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1523. 342.70 s [duoids]
  1524. 342.71 s [duoids] on the commandline: warning: [GHC-98887]
  1525. 342.71 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1526. 342.71 s [duoids]
  1527. 342.71 s [duoids] on the commandline: warning: [GHC-98887]
  1528. 342.71 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1529. 342.71 s [duoids]
  1530. 342.72 s [duoids] on the commandline: warning: [GHC-98887]
  1531. 342.72 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1532. 342.72 s [duoids]
  1533. 342.72 s [duoids] on the commandline: warning: [GHC-98887]
  1534. 342.72 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1535. 342.72 s [duoids]
  1536. 346.26 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  1537. 346.39 s [duoids] NameLib Nothing
  1538. 346.39 s [duoids] ----------------------------------------
  1539. 346.41 s [duoids] Test suite doctests: PASS
  1540. 346.41 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  1541. 346.42 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  1542. 346.43 s [duoids] Phase: haddockPhase
  1543. 346.76 s [duoids] Preprocessing library for duoids-0.0.1.0...
  1544. 346.76 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  1545. 348.02 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing )
  1546. 348.63 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing )
  1547. 349.67 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing )
  1548. 351.45 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing )
  1549. 351.47 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing )
  1550. 351.56 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing )
  1551. 351.60 s [duoids] Haddock coverage:
  1552. 351.60 s [duoids] Warning: 'cancel' is out of scope.
  1553. 351.60 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1554. 351.61 s [duoids] Warning: 'Applicative' is out of scope.
  1555. 351.61 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1556. 351.61 s [duoids] Warning: 'Alternative' is out of scope.
  1557. 351.61 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1558. 351.61 s [duoids] Warning: 'Par' is ambiguous. It is defined
  1559. 351.61 s [duoids] * at src/Data/Duoid.hs:62:5
  1560. 351.61 s [duoids] * at src/Data/Duoid.hs:58:1
  1561. 351.61 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1562. 351.61 s [duoids] by specifying the type/value namespace explicitly.
  1563. 351.61 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:58:1
  1564. 351.61 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  1565. 351.61 s [duoids] * at src/Data/Duoid.hs:118:5
  1566. 351.61 s [duoids] * at src/Data/Duoid.hs:114:1
  1567. 351.61 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1568. 351.61 s [duoids] by specifying the type/value namespace explicitly.
  1569. 351.61 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:114:1
  1570. 351.62 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  1571. 351.63 s [duoids] Warning: 'ExceptT' is out of scope.
  1572. 351.63 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1573. 351.63 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  1574. 351.63 s [duoids] * at src/Control/Duoidal.hs:238:5
  1575. 351.63 s [duoids] * at src/Control/Duoidal.hs:234:1
  1576. 351.63 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1577. 351.63 s [duoids] by specifying the type/value namespace explicitly.
  1578. 351.63 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:234:1
  1579. 351.63 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  1580. 351.63 s [duoids] * at src/Control/Duoidal.hs:308:5
  1581. 351.63 s [duoids] * at src/Control/Duoidal.hs:304:1
  1582. 351.63 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1583. 351.63 s [duoids] by specifying the type/value namespace explicitly.
  1584. 351.63 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:304:1
  1585. 351.63 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  1586. 351.63 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1587. 351.63 s [duoids] Warning: 'Validation' is out of scope.
  1588. 351.63 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1589. 351.63 s [duoids] Warning: 'fail' is out of scope.
  1590. 351.63 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1591. 351.63 s [duoids] Warning: 'MonadFail' is out of scope.
  1592. 351.63 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1593. 351.63 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  1594. 351.63 s [duoids] * at src/Control/Duoidal.hs:774:5
  1595. 351.63 s [duoids] * at src/Control/Duoidal.hs:770:1
  1596. 351.63 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1597. 351.63 s [duoids] by specifying the type/value namespace explicitly.
  1598. 351.63 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:770:1
  1599. 351.63 s [duoids] Warning: 'Writer' is out of scope.
  1600. 351.63 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1601. 351.63 s [duoids] Warning: 'Set' is out of scope.
  1602. 351.63 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1603. 351.63 s [duoids] Warning: 'Char' is out of scope.
  1604. 351.63 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1605. 351.65 s [duoids] Warning: 'Const' is ambiguous. It is defined
  1606. 351.65 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  1607. 351.65 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  1608. 351.65 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1609. 351.65 s [duoids] by specifying the type/value namespace explicitly.
  1610. 351.65 s [duoids] Defaulting to the one defined in ‘GHC.Internal.Data.Functor.Const’
  1611. 351.65 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  1612. 351.65 s [duoids] * at src/Control/Duoidal.hs:395:1
  1613. 351.65 s [duoids] * at src/Data/Duoid.hs:183:1
  1614. 351.65 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1615. 351.65 s [duoids] by specifying the type/value namespace explicitly.
  1616. 351.65 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:183:1
  1617. 351.66 s [duoids] 100% ( 60 / 60) in 'Control.Duoidal'
  1618. 351.66 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  1619. 351.66 s [duoids] Warning: 'Normal' is out of scope.
  1620. 351.66 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1621. 351.67 s [duoids] Warning: 'Law' is ambiguous. It is defined
  1622. 351.67 s [duoids] * at src/Data/Duoid/Laws.hs:38:5
  1623. 351.67 s [duoids] * at src/Data/Duoid/Laws.hs:34:1
  1624. 351.67 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1625. 351.67 s [duoids] by specifying the type/value namespace explicitly.
  1626. 351.67 s [duoids] Defaulting to the one defined at src/Data/Duoid/Laws.hs:34:1
  1627. 351.67 s [duoids] 100% ( 12 / 12) in 'Data.Duoid.Laws'
  1628. 351.68 s [duoids] 100% ( 6 / 6) in 'Control.Duoidal.Laws'
  1629. 352.30 s [duoids] Warning: Data.Duoid: could not find link destinations for:
  1630. 352.30 s [duoids] - Data.Duoid.Rep_Comm
  1631. 352.30 s [duoids] - Data.Duoid.Rep1_Comm
  1632. 352.32 s [duoids] - Data.Duoid.Rep_Seq
  1633. 352.32 s [duoids] - Data.Duoid.Rep1_Seq
  1634. 352.32 s [duoids] - Data.Duoid.Rep_Par
  1635. 352.32 s [duoids] - Data.Duoid.Rep1_Par
  1636. 352.35 s [duoids] Warning: Control.Duoidal: could not find link destinations for:
  1637. 352.35 s [duoids] - Control.Duoidal.Rep_Commutative
  1638. 352.35 s [duoids] - Control.Duoidal.Rep1_Commutative
  1639. 352.35 s [duoids] - Control.Duoidal.Rep_Sequential
  1640. 352.35 s [duoids] - Control.Duoidal.Rep1_Sequential
  1641. 352.35 s [duoids] - Control.Duoidal.Rep_Parallel
  1642. 352.35 s [duoids] - Control.Duoidal.Rep1_Parallel
  1643. 352.35 s [duoids] Warning: Data.Duoid.Laws: could not find link destinations for:
  1644. 352.35 s [duoids] - Data.Duoid.Laws.Rep_NormalLaws
  1645. 352.35 s [duoids] - Data.Duoid.Laws.Rep1_NormalLaws
  1646. 352.35 s [duoids] - Data.Duoid.Laws.Rep_Laws
  1647. 352.35 s [duoids] - Data.Duoid.Laws.Rep_Law
  1648. 356.19 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 )
  1649. 356.19 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  1650. 377.03 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 )
  1651. 377.05 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 )
  1652. 377.05 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 )
  1653. 377.05 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 )
  1654. 377.05 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 )
  1655. 378.64 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 )
  1656. 378.64 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 )
  1657. 380.06 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  1658. 380.25 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  1659. 380.28 s [duoids] haddockPhase completed in 34 seconds
  1660. 380.28 s [duoids] Phase: installPhase
  1661. 380.56 s [duoids] Installing library in /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1662. 381.90 s [duoids] Phase: fixupPhase
  1663. 381.97 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0
  1664. 381.97 s [duoids] shrinking /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSduoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4-ghc9.10.3.so
  1665. 381.99 s [duoids] checking for references to /build/ in /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0...
  1666. 382.06 s [duoids] patching script interpreter paths in /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0
  1667. 382.08 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/lib
  1668. 382.48 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc
  1669. 382.50 s [duoids] checking for references to /build/ in /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc...
  1670. 382.55 s [duoids] patching script interpreter paths in /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc
  1671. 382.96 s [duoids:post-build] Uploading to cachix cache "sellout": /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0 /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc
  1672. 383.59 s [duoids:post-build] Nothing to push - all store paths are already on Cachix.
  1673. 383.63 s [duoids:post-build] Uploading to the NixCI cache: /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0 /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc
  1674. 383.72 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1675. 383.75 s [duoids:post-build] copying 2 paths...
  1676. 383.75 s [duoids:post-build] copying path '/nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1677. 384.34 s [duoids:post-build] copying path '/nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  1678. 388.21 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1679. 388.61 s [duoids:post-build] copying 0 paths...
  1680. 388.68 s Progress: 2 of 18 built (1 building), 159 of 159 downloaded from cache
  1681. 388.78 s Building /nix/store/wpals71jdqjq2fbnyagaz6kr6f7gp6m5-duoidal-transformers-0.0.1.0.drv
  1682. 388.88 s Building /nix/store/3jbnk7arvcxgrhycawb0z88850xvvhb7-duoids-hedgehog-0.0.1.0.drv
  1683. 388.94 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  1684. 388.95 s [duoidal-transformers] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  1685. 389.18 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  1686. 389.18 s [duoids-hedgehog] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  1687. 389.44 s [duoidal-transformers] Phase: unpackPhase
  1688. 389.45 s [duoidal-transformers] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./transformers
  1689. 389.46 s [duoidal-transformers] source root is transformers
  1690. 389.48 s [duoidal-transformers] Phase: patchPhase
  1691. 389.49 s [duoidal-transformers] Phase: compileBuildDriverPhase
  1692. 389.50 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.7Rc1px7azP/setup-package.conf.d -threaded
  1693. 389.67 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.7Rc1px7azP/Main.o )
  1694. 389.86 s [duoidal-transformers] [2 of 2] Linking Setup
  1695. 389.87 s [duoids-hedgehog] Phase: unpackPhase
  1696. 389.88 s [duoids-hedgehog] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./hedgehog
  1697. 389.89 s [duoids-hedgehog] source root is hedgehog
  1698. 389.91 s [duoids-hedgehog] Phase: patchPhase
  1699. 389.93 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  1700. 389.94 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.1XvLG5pspo/setup-package.conf.d -threaded
  1701. 390.07 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.1XvLG5pspo/Main.o )
  1702. 390.23 s [duoids-hedgehog] [2 of 2] Linking Setup
  1703. 393.19 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  1704. 393.21 s [duoidal-transformers] Phase: configurePhase
  1705. 393.22 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.7Rc1px7azP/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  1706. 393.25 s [duoidal-transformers] Using Parsec parser
  1707. 393.25 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  1708. 393.80 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  1709. 393.82 s [duoids-hedgehog] Phase: configurePhase
  1710. 393.83 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.1XvLG5pspo/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  1711. 393.85 s [duoids-hedgehog] Using Parsec parser
  1712. 393.85 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  1713. 394.08 s [duoidal-transformers] Flags chosen: lint=False, noisy-deprecations=True
  1714. 394.80 s [duoids-hedgehog] Flags chosen: lint=False, noisy-deprecations=True
  1715. 394.81 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 )
  1716. 394.82 s [duoidal-transformers] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1717. 394.82 s [duoidal-transformers] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1718. 394.82 s [duoidal-transformers] <4.23: using base-4.20.2.0
  1719. 394.82 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  1720. 394.83 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1721. 394.83 s [duoidal-transformers] Dependency transformers >=0.5.6 && <0.6 || >=0.6.1 && <0.7: using
  1722. 394.83 s [duoidal-transformers] transformers-0.6.1.1
  1723. 394.83 s [duoidal-transformers] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1724. 394.83 s [duoidal-transformers] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1725. 394.83 s [duoidal-transformers] <4.23: using base-4.20.2.0
  1726. 394.83 s [duoidal-transformers] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  1727. 394.83 s [duoidal-transformers] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  1728. 394.83 s [duoidal-transformers] doctest-0.24.2
  1729. 394.83 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  1730. 394.83 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1731. 394.83 s [duoidal-transformers] Source component graph:
  1732. 394.83 s [duoidal-transformers] component lib
  1733. 394.83 s [duoidal-transformers] component test:doctests dependency lib
  1734. 394.83 s [duoidal-transformers] Configured component graph:
  1735. 394.83 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1736. 394.83 s [duoidal-transformers] include base-4.20.2.0-64da
  1737. 394.83 s [duoidal-transformers] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1738. 394.83 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1739. 394.83 s [duoidal-transformers] include transformers-0.6.1.1-6a26
  1740. 394.83 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-KhnlJXfsdUG3006wXowqMA-doctests
  1741. 394.83 s [duoidal-transformers] include base-4.20.2.0-64da
  1742. 394.83 s [duoidal-transformers] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1743. 394.83 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1744. 394.83 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1745. 394.83 s [duoidal-transformers] Linked component graph:
  1746. 394.83 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1747. 394.83 s [duoidal-transformers] include base-4.20.2.0-64da
  1748. 394.83 s [duoidal-transformers] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1749. 394.83 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1750. 394.83 s [duoidal-transformers] include transformers-0.6.1.1-6a26
  1751. 394.83 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP:Control.Duoidal.Trans.Orphans
  1752. 394.83 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-KhnlJXfsdUG3006wXowqMA-doctests
  1753. 394.83 s [duoidal-transformers] include base-4.20.2.0-64da
  1754. 394.83 s [duoidal-transformers] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1755. 394.83 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1756. 394.83 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1757. 394.83 s [duoidal-transformers] Ready component graph:
  1758. 394.83 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1759. 394.83 s [duoidal-transformers] depends base-4.20.2.0-64da
  1760. 394.83 s [duoidal-transformers] depends duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1761. 394.83 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1762. 394.83 s [duoidal-transformers] depends transformers-0.6.1.1-6a26
  1763. 394.83 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-KhnlJXfsdUG3006wXowqMA-doctests
  1764. 394.83 s [duoidal-transformers] depends base-4.20.2.0-64da
  1765. 394.83 s [duoidal-transformers] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1766. 394.83 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1767. 394.83 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1768. 394.83 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1769. 394.83 s [duoidal-transformers] Using compiler: ghc-9.10.3
  1770. 394.83 s [duoidal-transformers] Using install prefix:
  1771. 394.83 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0
  1772. 394.83 s [duoidal-transformers] Executables installed in:
  1773. 394.83 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/bin
  1774. 394.83 s [duoidal-transformers] Libraries installed in:
  1775. 394.83 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1776. 394.84 s [duoidal-transformers] Dynamic Libraries installed in:
  1777. 394.84 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  1778. 394.84 s [duoidal-transformers] Private executables installed in:
  1779. 394.84 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-05f6/duoidal-transformers-0.0.1.0
  1780. 394.84 s [duoidal-transformers] Data files installed in:
  1781. 394.84 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.10.3-05f6/duoidal-transformers-0.0.1.0
  1782. 394.84 s [duoidal-transformers] Documentation installed in:
  1783. 394.84 s [duoidal-transformers] /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  1784. 394.84 s [duoidal-transformers] Configuration files installed in:
  1785. 394.84 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/etc
  1786. 394.84 s [duoidal-transformers] No alex found
  1787. 394.84 s [duoidal-transformers] Using ar found on system at:
  1788. 394.84 s [duoidal-transformers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1789. 394.84 s [duoidal-transformers] No c2hs found
  1790. 394.84 s [duoidal-transformers] No cpphs found
  1791. 394.84 s [duoidal-transformers] Using doctest version 0.24.2 found on system at:
  1792. 394.84 s [duoidal-transformers] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  1793. 394.84 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  1794. 394.84 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1795. 394.84 s [duoidal-transformers] Using ghc version 9.10.3 found on system at:
  1796. 394.84 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  1797. 394.84 s [duoidal-transformers] Using ghc-pkg version 9.10.3 found on system at:
  1798. 394.84 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1799. 394.84 s [duoidal-transformers] No ghcjs found
  1800. 394.84 s [duoidal-transformers] No ghcjs-pkg found
  1801. 394.84 s [duoidal-transformers] No greencard found
  1802. 394.84 s [duoidal-transformers] Using haddock version 2.31.1 found on system at:
  1803. 394.84 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1804. 394.84 s [duoidal-transformers] No happy found
  1805. 394.84 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  1806. 394.84 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1807. 394.84 s [duoidal-transformers] No hmake found
  1808. 394.84 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  1809. 394.84 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1810. 394.84 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  1811. 394.84 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1812. 394.84 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  1813. 394.84 s [duoidal-transformers] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  1814. 394.84 s [duoidal-transformers] No jhc found
  1815. 394.84 s [duoidal-transformers] Using ld found on system at:
  1816. 394.84 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  1817. 394.84 s [duoidal-transformers] No pkg-config found
  1818. 394.84 s [duoidal-transformers] Using runghc version 9.10.3 found on system at:
  1819. 394.84 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  1820. 394.84 s [duoidal-transformers] Using strip version 2.44 found on system at:
  1821. 394.84 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1822. 394.84 s [duoidal-transformers] Using tar found on system at:
  1823. 394.84 s [duoidal-transformers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1824. 394.84 s [duoidal-transformers] No uhc found
  1825. 395.25 s [duoidal-transformers] Phase: buildPhase
  1826. 395.44 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1827. 395.44 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  1828. 395.64 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1829. 395.64 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1830. 395.64 s [duoids-hedgehog] <4.23: using base-4.20.2.0
  1831. 395.64 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  1832. 395.64 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1833. 395.64 s [duoids-hedgehog] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  1834. 395.64 s [duoids-hedgehog] hedgehog-1.5
  1835. 395.64 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1836. 395.64 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1837. 395.64 s [duoids-hedgehog] <4.23: using base-4.20.2.0
  1838. 395.64 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  1839. 395.64 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1840. 395.64 s [duoids-hedgehog] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  1841. 395.64 s [duoids-hedgehog] hedgehog-1.5
  1842. 395.64 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1843. 395.64 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1844. 395.64 s [duoids-hedgehog] <4.23: using base-4.20.2.0
  1845. 395.64 s [duoids-hedgehog] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  1846. 395.65 s [duoids-hedgehog] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  1847. 395.65 s [duoids-hedgehog] doctest-0.24.2
  1848. 395.65 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  1849. 395.65 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1850. 395.65 s [duoids-hedgehog] Source component graph:
  1851. 395.65 s [duoids-hedgehog] component lib
  1852. 395.65 s [duoids-hedgehog] component test:doctests dependency lib
  1853. 395.65 s [duoids-hedgehog] component test:laws dependency lib
  1854. 395.65 s [duoids-hedgehog] Configured component graph:
  1855. 395.65 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1856. 395.65 s [duoids-hedgehog] include base-4.20.2.0-64da
  1857. 395.65 s [duoids-hedgehog] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1858. 395.65 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1859. 395.65 s [duoids-hedgehog] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1860. 395.65 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-A0jaxPLmvWY7pKYUuF2Hhr-doctests
  1861. 395.65 s [duoids-hedgehog] include base-4.20.2.0-64da
  1862. 395.65 s [duoids-hedgehog] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1863. 395.65 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1864. 395.65 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1865. 395.65 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-EHzJOZ6IhCAe5LlUCqzGu-laws
  1866. 395.65 s [duoids-hedgehog] include base-4.20.2.0-64da
  1867. 395.65 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1868. 395.65 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1869. 395.65 s [duoids-hedgehog] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1870. 395.65 s [duoids-hedgehog] Linked component graph:
  1871. 395.65 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1872. 395.65 s [duoids-hedgehog] include base-4.20.2.0-64da
  1873. 395.65 s [duoids-hedgehog] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1874. 395.65 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1875. 395.65 s [duoids-hedgehog] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1876. 395.65 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27:Test.Duoidal
  1877. 395.65 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-A0jaxPLmvWY7pKYUuF2Hhr-doctests
  1878. 395.65 s [duoids-hedgehog] include base-4.20.2.0-64da
  1879. 395.65 s [duoids-hedgehog] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1880. 395.65 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1881. 395.65 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1882. 395.65 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-EHzJOZ6IhCAe5LlUCqzGu-laws
  1883. 395.65 s [duoids-hedgehog] include base-4.20.2.0-64da
  1884. 395.65 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1885. 395.65 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1886. 395.65 s [duoids-hedgehog] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1887. 395.65 s [duoids-hedgehog] Ready component graph:
  1888. 395.65 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1889. 395.65 s [duoids-hedgehog] depends base-4.20.2.0-64da
  1890. 395.65 s [duoids-hedgehog] depends duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1891. 395.65 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1892. 395.65 s [duoids-hedgehog] depends hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1893. 395.65 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-EHzJOZ6IhCAe5LlUCqzGu-laws
  1894. 395.65 s [duoids-hedgehog] depends base-4.20.2.0-64da
  1895. 395.65 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1896. 395.65 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1897. 395.65 s [duoids-hedgehog] depends hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1898. 395.65 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-A0jaxPLmvWY7pKYUuF2Hhr-doctests
  1899. 395.65 s [duoids-hedgehog] depends base-4.20.2.0-64da
  1900. 395.65 s [duoids-hedgehog] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1901. 395.65 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1902. 395.65 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1903. 395.65 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1904. 395.65 s [duoids-hedgehog] Using compiler: ghc-9.10.3
  1905. 395.65 s [duoids-hedgehog] Using install prefix:
  1906. 395.65 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0
  1907. 395.65 s [duoids-hedgehog] Executables installed in:
  1908. 395.65 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/bin
  1909. 395.65 s [duoids-hedgehog] Libraries installed in:
  1910. 395.65 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1911. 395.65 s [duoids-hedgehog] Dynamic Libraries installed in:
  1912. 395.66 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  1913. 395.66 s [duoids-hedgehog] Private executables installed in:
  1914. 395.66 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-05f6/duoids-hedgehog-0.0.1.0
  1915. 395.66 s [duoids-hedgehog] Data files installed in:
  1916. 395.66 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.10.3-05f6/duoids-hedgehog-0.0.1.0
  1917. 395.66 s [duoids-hedgehog] Documentation installed in:
  1918. 395.66 s [duoids-hedgehog] /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  1919. 395.66 s [duoids-hedgehog] Configuration files installed in:
  1920. 395.66 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/etc
  1921. 395.66 s [duoids-hedgehog] No alex found
  1922. 395.66 s [duoids-hedgehog] Using ar found on system at:
  1923. 395.66 s [duoids-hedgehog] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1924. 395.66 s [duoids-hedgehog] No c2hs found
  1925. 395.66 s [duoids-hedgehog] No cpphs found
  1926. 395.66 s [duoids-hedgehog] Using doctest version 0.24.2 found on system at:
  1927. 395.66 s [duoids-hedgehog] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  1928. 395.66 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  1929. 395.66 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1930. 395.66 s [duoids-hedgehog] Using ghc version 9.10.3 found on system at:
  1931. 395.66 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  1932. 395.66 s [duoids-hedgehog] Using ghc-pkg version 9.10.3 found on system at:
  1933. 395.66 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1934. 395.66 s [duoids-hedgehog] No ghcjs found
  1935. 395.66 s [duoids-hedgehog] No ghcjs-pkg found
  1936. 395.67 s [duoids-hedgehog] No greencard found
  1937. 395.67 s [duoids-hedgehog] Using haddock version 2.31.1 found on system at:
  1938. 395.67 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1939. 395.67 s [duoids-hedgehog] No happy found
  1940. 395.67 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  1941. 395.67 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1942. 395.67 s [duoids-hedgehog] No hmake found
  1943. 395.67 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  1944. 395.67 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1945. 395.67 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  1946. 395.67 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1947. 395.67 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  1948. 395.67 s [duoids-hedgehog] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  1949. 395.67 s [duoids-hedgehog] No jhc found
  1950. 395.67 s [duoids-hedgehog] Using ld found on system at:
  1951. 395.67 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  1952. 395.67 s [duoids-hedgehog] No pkg-config found
  1953. 395.67 s [duoids-hedgehog] Using runghc version 9.10.3 found on system at:
  1954. 395.67 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  1955. 395.67 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  1956. 395.67 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1957. 395.67 s [duoids-hedgehog] Using tar found on system at:
  1958. 395.67 s [duoids-hedgehog] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1959. 395.67 s [duoids-hedgehog] No uhc found
  1960. 395.72 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 )
  1961. 396.27 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 )
  1962. 396.31 s [duoids-hedgehog] Phase: buildPhase
  1963. 396.50 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1964. 396.50 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  1965. 396.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 )
  1966. 397.35 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 )
  1967. 397.99 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 )
  1968. 398.11 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  1969. 398.56 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  1970. 399.77 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  1971. 406.38 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1972. 406.39 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1973. 406.68 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1974. 407.42 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1975. 408.02 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1976. 408.02 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1977. 408.36 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  1978. 408.63 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 )
  1979. 408.80 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  1980. 410.22 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  1981. 412.32 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1982. 412.33 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1983. 412.55 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1984. 413.34 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1985. 414.68 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  1986. 417.63 s [duoidal-transformers] Phase: checkPhase
  1987. 418.41 s [duoidal-transformers] Running 1 test suites...
  1988. 418.41 s [duoidal-transformers] Test suite doctests: RUNNING...
  1989. 419.04 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1990. 419.04 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1991. 419.04 s [duoidal-transformers]
  1992. 419.05 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1993. 419.05 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1994. 419.05 s [duoidal-transformers]
  1995. 419.05 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1996. 419.05 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1997. 419.05 s [duoidal-transformers]
  1998. 419.74 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1999. 419.84 s [duoidal-transformers] NameLib Nothing
  2000. 419.84 s [duoidal-transformers] ----------------------------------------
  2001. 419.85 s [duoidal-transformers] Test suite doctests: PASS
  2002. 419.85 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  2003. 419.86 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  2004. 419.87 s [duoidal-transformers] Phase: haddockPhase
  2005. 420.22 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  2006. 420.23 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  2007. 421.28 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing )
  2008. 421.71 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing )
  2009. 422.06 s [duoidal-transformers] Haddock coverage:
  2010. 422.06 s [duoidal-transformers] Warning: 'MonadTrans' is out of scope.
  2011. 422.06 s [duoidal-transformers] If you qualify the identifier, haddock can try to link it anyway.
  2012. 422.06 s [duoidal-transformers] 100% ( 3 / 3) in 'Control.Duoidal.Trans.Class'
  2013. 422.06 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  2014. 424.32 s [duoids-hedgehog] Phase: checkPhase
  2015. 425.19 s [duoids-hedgehog] Running 2 test suites...
  2016. 425.19 s [duoids-hedgehog] Test suite laws: RUNNING...
  2017. 425.21 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  2018. 425.21 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2019. 425.21 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2020. 425.21 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2021. 425.21 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2022. 425.21 s [duoids-hedgehog] ✓ 4 succeeded.
  2023. 425.21 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  2024. 425.21 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2025. 425.21 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2026. 425.21 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2027. 425.21 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2028. 425.21 s [duoids-hedgehog] ✓ 4 succeeded.
  2029. 425.21 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  2030. 425.22 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2031. 425.22 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2032. 425.22 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2033. 425.22 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2034. 425.22 s [duoids-hedgehog] ✓ 4 succeeded.
  2035. 425.22 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  2036. 425.22 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2037. 425.22 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2038. 425.22 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2039. 425.22 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2040. 425.22 s [duoids-hedgehog] ✓ 4 succeeded.
  2041. 425.22 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  2042. 425.22 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2043. 425.22 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2044. 425.22 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2045. 425.22 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2046. 425.22 s [duoids-hedgehog] ✓ 4 succeeded.
  2047. 425.22 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  2048. 425.23 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2049. 425.23 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2050. 425.23 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2051. 425.23 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2052. 425.23 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2053. 425.23 s [duoids-hedgehog] ✓ 5 succeeded.
  2054. 425.23 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  2055. 425.23 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2056. 425.23 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2057. 425.23 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2058. 425.23 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2059. 425.23 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2060. 425.23 s [duoids-hedgehog] ✓ 5 succeeded.
  2061. 425.23 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  2062. 425.24 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2063. 425.24 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2064. 425.24 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2065. 425.24 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2066. 425.24 s [duoids-hedgehog] ✓ 4 succeeded.
  2067. 425.24 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  2068. 425.24 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2069. 425.24 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2070. 425.24 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2071. 425.24 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2072. 425.24 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2073. 425.24 s [duoids-hedgehog] ✓ 5 succeeded.
  2074. 425.24 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  2075. 425.24 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2076. 425.24 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2077. 425.24 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2078. 425.24 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2079. 425.24 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2080. 425.24 s [duoids-hedgehog] ✓ 5 succeeded.
  2081. 425.24 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  2082. 425.24 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2083. 425.25 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2084. 425.25 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2085. 425.25 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2086. 425.25 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2087. 425.25 s [duoids-hedgehog] ✓ 5 succeeded.
  2088. 425.25 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  2089. 425.25 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2090. 425.25 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2091. 425.25 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2092. 425.25 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2093. 425.25 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2094. 425.25 s [duoids-hedgehog] ✓ 5 succeeded.
  2095. 425.25 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  2096. 425.25 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2097. 425.25 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2098. 425.25 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2099. 425.25 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2100. 425.25 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2101. 425.25 s [duoids-hedgehog] ✓ 5 succeeded.
  2102. 425.25 s [duoids-hedgehog] Test suite laws: PASS
  2103. 425.26 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  2104. 425.26 s [duoids-hedgehog] Test suite doctests: RUNNING...
  2105. 425.85 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 )
  2106. 426.89 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  2107. 427.01 s [duoids-hedgehog] NameLib Nothing
  2108. 427.01 s [duoids-hedgehog] ----------------------------------------
  2109. 427.02 s [duoids-hedgehog] Test suite doctests: PASS
  2110. 427.02 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  2111. 427.02 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  2112. 427.04 s [duoids-hedgehog] Phase: haddockPhase
  2113. 427.41 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  2114. 427.41 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  2115. 427.41 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 )
  2116. 427.71 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  2117. 427.76 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 )
  2118. 428.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 )
  2119. 428.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 )
  2120. 428.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 )
  2121. 428.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 )
  2122. 428.37 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing )
  2123. 429.41 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing )
  2124. 429.53 s [duoids-hedgehog] Haddock coverage:
  2125. 429.53 s [duoids-hedgehog] 100% ( 3 / 3) in 'Test.Duoid'
  2126. 429.53 s [duoids-hedgehog] 100% ( 2 / 2) in 'Test.Duoidal'
  2127. 439.77 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  2128. 442.26 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  2129. 442.32 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  2130. 442.36 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  2131. 442.37 s [duoidal-transformers] Phase: installPhase
  2132. 442.50 s [duoidal-transformers] Installing library in /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  2133. 442.87 s [duoidal-transformers] Phase: fixupPhase
  2134. 442.90 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0
  2135. 442.90 s [duoidal-transformers] shrinking /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSduoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP-ghc9.10.3.so
  2136. 442.91 s [duoidal-transformers] checking for references to /build/ in /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0...
  2137. 442.93 s [duoidal-transformers] patching script interpreter paths in /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0
  2138. 442.94 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/lib
  2139. 442.98 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc
  2140. 442.99 s [duoidal-transformers] checking for references to /build/ in /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc...
  2141. 443.01 s [duoidal-transformers] patching script interpreter paths in /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc
  2142. 443.24 s [duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0 /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc
  2143. 443.73 s [duoidal-transformers:post-build] Nothing to push - all store paths are already on Cachix.
  2144. 443.77 s [duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0 /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc
  2145. 443.87 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2146. 443.90 s [duoidal-transformers:post-build] copying 2 paths...
  2147. 443.90 s [duoidal-transformers:post-build] copying path '/nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2148. 444.07 s [duoidal-transformers:post-build] copying path '/nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  2149. 444.37 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2150. 444.56 s [duoidal-transformers:post-build] copying 0 paths...
  2151. 444.62 s Progress: 3 of 17 built (2 building), 159 of 159 downloaded from cache
  2152. 444.74 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  2153. 450.06 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  2154. 450.48 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  2155. 450.49 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  2156. 450.63 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  2157. 450.63 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  2158. 450.65 s [duoids-hedgehog] Phase: installPhase
  2159. 450.96 s [duoids-hedgehog] Installing library in /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  2160. 451.25 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  2161. 451.60 s [duoids-hedgehog] Phase: fixupPhase
  2162. 451.64 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0
  2163. 451.65 s [duoids-hedgehog] shrinking /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSduoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27-ghc9.10.3.so
  2164. 451.68 s [duoids-hedgehog] checking for references to /build/ in /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0...
  2165. 451.71 s [duoids-hedgehog] patching script interpreter paths in /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0
  2166. 451.71 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/lib
  2167. 451.79 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc
  2168. 451.81 s [duoids-hedgehog] checking for references to /build/ in /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc...
  2169. 451.83 s [duoids-hedgehog] patching script interpreter paths in /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc
  2170. 452.15 s [duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0 /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc
  2171. 452.86 s [duoids-hedgehog:post-build] Nothing to push - all store paths are already on Cachix.
  2172. 452.90 s [duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0 /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc
  2173. 453.01 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2174. 453.04 s [duoids-hedgehog:post-build] copying 2 paths...
  2175. 453.05 s [duoids-hedgehog:post-build] copying path '/nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2176. 453.32 s [duoids-hedgehog:post-build] copying path '/nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  2177. 453.81 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2178. 453.90 s [duoids-hedgehog:post-build] copying 0 paths...
  2179. 453.94 s Progress: 4 of 16 built (1 building), 159 of 159 downloaded from cache
  2180. 462.89 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  2181. 462.91 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  2182. 474.57 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  2183. 474.58 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  2184. 474.58 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  2185. 474.58 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  2186. 474.58 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  2187. 475.01 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  2188. 475.01 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  2189. 482.55 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  2190. 489.50 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  2191. 499.54 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  2192. 501.99 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  2193. 501.99 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  2194. 502.22 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 )
  2195. 502.51 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 )
  2196. 504.33 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 )
  2197. 504.34 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  2198. 504.34 s [vector] In the use of ‘tail’
  2199. 504.34 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2200. 504.34 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"."
  2201. 504.34 s [vector] |
  2202. 504.34 s [vector] 244 | postscanl f z = tail . scanl f z
  2203. 504.34 s [vector] | ^^^^
  2204. 504.34 s [vector]
  2205. 504.34 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  2206. 504.34 s [vector] In the use of ‘tail’
  2207. 504.34 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2208. 504.34 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"."
  2209. 504.34 s [vector] |
  2210. 504.34 s [vector] 245 | prescanr f z = tail . scanr f z
  2211. 504.34 s [vector] | ^^^^
  2212. 504.34 s [vector]
  2213. 504.34 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 )
  2214. 504.34 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  2215. 504.34 s [vector] In the use of ‘head’
  2216. 504.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2217. 504.34 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"."
  2218. 504.34 s [vector] |
  2219. 504.34 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  2220. 504.34 s [vector] | ^^^^
  2221. 504.34 s [vector]
  2222. 504.34 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  2223. 504.34 s [vector] In the use of ‘head’
  2224. 504.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2225. 504.34 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"."
  2226. 504.34 s [vector] |
  2227. 504.34 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  2228. 504.34 s [vector] | ^^^^
  2229. 504.34 s [vector]
  2230. 504.34 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  2231. 504.34 s [vector] In the use of ‘tail’
  2232. 504.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2233. 504.34 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"."
  2234. 504.34 s [vector] |
  2235. 504.34 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  2236. 504.34 s [vector] | ^^^^
  2237. 504.34 s [vector]
  2238. 504.34 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  2239. 504.34 s [vector] In the use of ‘head’
  2240. 504.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2241. 504.34 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"."
  2242. 504.34 s [vector] |
  2243. 504.34 s [vector] 439 | = V.uniq `eq` (map head . group)
  2244. 504.34 s [vector] | ^^^^
  2245. 504.34 s [vector]
  2246. 506.13 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 )
  2247. 506.33 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 )
  2248. 506.33 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 )
  2249. 506.33 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 )
  2250. 506.33 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 )
  2251. 506.33 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 )
  2252. 506.33 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 )
  2253. 506.33 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  2254. 506.33 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  2255. 506.33 s [vector] |
  2256. 506.33 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  2257. 506.33 s [vector] | ^^^^^^
  2258. 506.33 s [vector]
  2259. 506.33 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  2260. 506.33 s [vector] In the use of ‘head’
  2261. 506.33 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2262. 506.33 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"."
  2263. 506.33 s [vector] |
  2264. 506.33 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  2265. 506.33 s [vector] | ^^^^
  2266. 506.33 s [vector]
  2267. 506.33 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  2268. 506.33 s [vector] In the use of ‘tail’
  2269. 506.33 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2270. 506.33 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"."
  2271. 506.33 s [vector] |
  2272. 506.33 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  2273. 506.33 s [vector] | ^^^^
  2274. 506.33 s [vector]
  2275. 506.33 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 )
  2276. 507.05 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  2277. 509.25 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  2278. 509.26 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  2279. 509.41 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 )
  2280. 511.59 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 )
  2281. 511.61 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 )
  2282. 511.83 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 )
  2283. 511.83 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 )
  2284. 511.83 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 )
  2285. 511.83 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 )
  2286. 511.83 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 )
  2287. 511.83 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 )
  2288. 511.83 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 )
  2289. 511.83 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 )
  2290. 511.83 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 )
  2291. 511.83 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 )
  2292. 511.83 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 )
  2293. 512.13 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 )
  2294. 514.74 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 )
  2295. 514.74 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 )
  2296. 515.10 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 )
  2297. 515.10 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 )
  2298. 515.10 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 )
  2299. 515.10 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 )
  2300. 515.10 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 )
  2301. 515.10 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 )
  2302. 515.10 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 )
  2303. 515.10 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 )
  2304. 515.10 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  2305. 515.10 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 )
  2306. 515.10 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 )
  2307. 516.76 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
  2308. 516.76 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0...
  2309. 516.83 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  2310. 517.22 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  2311. 522.66 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
  2312. 522.67 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0...
  2313. 522.84 s [vector] [ 1 of 12] Compiling Boilerplater ( tests/Boilerplater.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.dyn_o )
  2314. 523.08 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 )
  2315. 534.34 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 )
  2316. 534.37 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  2317. 534.37 s [vector] In the use of ‘tail’
  2318. 534.37 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2319. 534.37 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"."
  2320. 534.37 s [vector] |
  2321. 534.37 s [vector] 244 | postscanl f z = tail . scanl f z
  2322. 534.37 s [vector] | ^^^^
  2323. 534.37 s [vector]
  2324. 534.37 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  2325. 534.37 s [vector] In the use of ‘tail’
  2326. 534.37 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2327. 534.37 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"."
  2328. 534.37 s [vector] |
  2329. 534.37 s [vector] 245 | prescanr f z = tail . scanr f z
  2330. 534.37 s [vector] | ^^^^
  2331. 534.37 s [vector]
  2332. 534.37 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 )
  2333. 534.37 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  2334. 534.37 s [vector] In the use of ‘head’
  2335. 534.37 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2336. 534.37 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"."
  2337. 534.37 s [vector] |
  2338. 534.37 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  2339. 534.37 s [vector] | ^^^^
  2340. 534.37 s [vector]
  2341. 534.37 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  2342. 534.37 s [vector] In the use of ‘head’
  2343. 534.37 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2344. 534.37 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"."
  2345. 534.37 s [vector] |
  2346. 534.37 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  2347. 534.37 s [vector] | ^^^^
  2348. 534.37 s [vector]
  2349. 534.37 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  2350. 534.37 s [vector] In the use of ‘tail’
  2351. 534.37 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2352. 534.37 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"."
  2353. 534.37 s [vector] |
  2354. 534.37 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  2355. 534.37 s [vector] | ^^^^
  2356. 534.37 s [vector]
  2357. 534.37 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  2358. 534.37 s [vector] In the use of ‘head’
  2359. 534.37 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2360. 534.37 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"."
  2361. 534.38 s [vector] |
  2362. 534.38 s [vector] 439 | = V.uniq `eq` (map head . group)
  2363. 534.38 s [vector] | ^^^^
  2364. 534.38 s [vector]
  2365. 549.96 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 )
  2366. 605.31 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 )
  2367. 605.32 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 )
  2368. 605.32 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 )
  2369. 605.32 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 )
  2370. 605.32 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 )
  2371. 605.32 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 )
  2372. 605.32 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  2373. 605.32 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  2374. 605.32 s [vector] |
  2375. 605.33 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  2376. 605.33 s [vector] | ^^^^^^
  2377. 605.33 s [vector]
  2378. 605.33 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  2379. 605.33 s [vector] In the use of ‘head’
  2380. 605.33 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2381. 605.33 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"."
  2382. 605.33 s [vector] |
  2383. 605.33 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  2384. 605.33 s [vector] | ^^^^
  2385. 605.33 s [vector]
  2386. 605.33 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  2387. 605.33 s [vector] In the use of ‘tail’
  2388. 605.33 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2389. 605.33 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"."
  2390. 605.33 s [vector] |
  2391. 605.33 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  2392. 605.33 s [vector] | ^^^^
  2393. 605.33 s [vector]
  2394. 605.33 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 )
  2395. 607.24 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  2396. 610.06 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
  2397. 610.06 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0...
  2398. 610.49 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  2399. 612.07 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 )
  2400. 612.07 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  2401. 614.77 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  2402. 616.20 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  2403. 618.46 s [vector] buildPhase completed in 5 minutes 28 seconds
  2404. 618.46 s [vector] Phase: checkPhase
  2405. 619.15 s [vector] Running 2 test suites...
  2406. 619.15 s [vector] Test suite vector-tests-O0: RUNNING...
  2407. 619.30 s [vector] toplevel
  2408. 619.30 s [vector] Data.Vector.Fusion.Bundle
  2409. 619.30 s [vector] fromList.toList == id: OK
  2410. 619.30 s [vector] +++ OK, passed 100 tests.
  2411. 619.30 s [vector] toList.fromList == id: OK
  2412. 619.30 s [vector] +++ OK, passed 100 tests.
  2413. 619.30 s [vector] eq: OK
  2414. 619.30 s [vector] +++ OK, passed 100 tests.
  2415. 619.30 s [vector] length: OK
  2416. 619.30 s [vector] +++ OK, passed 100 tests.
  2417. 619.30 s [vector] null: OK
  2418. 619.30 s [vector] +++ OK, passed 100 tests.
  2419. 619.30 s [vector] empty: OK
  2420. 619.30 s [vector] +++ OK, passed 100 tests.
  2421. 619.30 s [vector] singleton: OK
  2422. 619.30 s [vector] +++ OK, passed 100 tests.
  2423. 619.30 s [vector] replicate: OK
  2424. 619.30 s [vector] +++ OK, passed 100 tests.
  2425. 619.30 s [vector] cons: OK
  2426. 619.30 s [vector] +++ OK, passed 100 tests.
  2427. 619.30 s [vector] snoc: OK
  2428. 619.30 s [vector] +++ OK, passed 100 tests.
  2429. 619.30 s [vector] append: OK
  2430. 619.30 s [vector] +++ OK, passed 100 tests.
  2431. 619.30 s [vector] head: OK
  2432. 619.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2433. 619.30 s [vector] last: OK
  2434. 619.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2435. 619.30 s [vector] index: OK
  2436. 619.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2437. 619.30 s [vector] extract: OK
  2438. 619.30 s [vector] +++ OK, passed 100 tests.
  2439. 619.30 s [vector] init: OK
  2440. 619.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2441. 619.30 s [vector] tail: OK
  2442. 619.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2443. 619.30 s [vector] take: OK
  2444. 619.30 s [vector] +++ OK, passed 100 tests.
  2445. 619.30 s [vector] drop: OK
  2446. 619.30 s [vector] +++ OK, passed 100 tests.
  2447. 619.31 s [vector] map: OK
  2448. 619.31 s [vector] +++ OK, passed 100 tests.
  2449. 619.31 s [vector] zipWith: OK
  2450. 619.31 s [vector] +++ OK, passed 100 tests.
  2451. 619.31 s [vector] zipWith3: OK (0.02s)
  2452. 619.31 s [vector] +++ OK, passed 100 tests.
  2453. 619.31 s [vector] filter: OK
  2454. 619.31 s [vector] +++ OK, passed 100 tests.
  2455. 619.31 s [vector] takeWhile: OK
  2456. 619.31 s [vector] +++ OK, passed 100 tests.
  2457. 619.31 s [vector] dropWhile: OK
  2458. 619.31 s [vector] +++ OK, passed 100 tests.
  2459. 619.31 s [vector] elem: OK
  2460. 619.31 s [vector] +++ OK, passed 100 tests.
  2461. 619.31 s [vector] notElem: OK
  2462. 619.31 s [vector] +++ OK, passed 100 tests.
  2463. 619.31 s [vector] find: OK
  2464. 619.31 s [vector] +++ OK, passed 100 tests.
  2465. 619.31 s [vector] findIndex: OK
  2466. 619.31 s [vector] +++ OK, passed 100 tests.
  2467. 619.31 s [vector] foldl: OK
  2468. 619.31 s [vector] +++ OK, passed 100 tests.
  2469. 619.31 s [vector] foldl1: OK
  2470. 619.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2471. 619.31 s [vector] foldl': OK
  2472. 619.31 s [vector] +++ OK, passed 100 tests.
  2473. 619.31 s [vector] foldl1': OK
  2474. 619.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2475. 619.31 s [vector] foldr: OK
  2476. 619.31 s [vector] +++ OK, passed 100 tests.
  2477. 619.31 s [vector] foldr1: OK
  2478. 619.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2479. 619.31 s [vector] prescanl: OK
  2480. 619.31 s [vector] +++ OK, passed 100 tests.
  2481. 619.31 s [vector] prescanl': OK (0.01s)
  2482. 619.31 s [vector] +++ OK, passed 100 tests.
  2483. 619.34 s [vector] postscanl: OK (0.02s)
  2484. 619.34 s [vector] +++ OK, passed 100 tests.
  2485. 619.35 s [vector] postscanl': OK
  2486. 619.35 s [vector] +++ OK, passed 100 tests.
  2487. 619.35 s [vector] scanl: OK
  2488. 619.35 s [vector] +++ OK, passed 100 tests.
  2489. 619.35 s [vector] scanl': OK
  2490. 619.35 s [vector] +++ OK, passed 100 tests.
  2491. 619.35 s [vector] scanl1: OK
  2492. 619.35 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2493. 619.36 s [vector] scanl1': OK
  2494. 619.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2495. 619.36 s [vector] concatMap: OK
  2496. 619.36 s [vector] +++ OK, passed 100 tests.
  2497. 619.36 s [vector] unfoldr: OK
  2498. 619.36 s [vector] +++ OK, passed 100 tests.
  2499. 619.36 s [vector] and: OK
  2500. 619.36 s [vector] +++ OK, passed 100 tests.
  2501. 619.36 s [vector] or: OK
  2502. 619.36 s [vector] +++ OK, passed 100 tests.
  2503. 619.36 s [vector] Tests.Vector.Boxed
  2504. 619.36 s [vector] Bool
  2505. 619.37 s [vector] fromList.toList == id: OK
  2506. 619.37 s [vector] +++ OK, passed 100 tests.
  2507. 619.37 s [vector] toList.fromList == id: OK
  2508. 619.37 s [vector] +++ OK, passed 100 tests.
  2509. 619.37 s [vector] unstream.stream == id: OK
  2510. 619.37 s [vector] +++ OK, passed 100 tests.
  2511. 619.37 s [vector] stream.unstream == id: OK
  2512. 619.37 s [vector] +++ OK, passed 100 tests.
  2513. 619.37 s [vector] eq: OK
  2514. 619.37 s [vector] +++ OK, passed 100 tests.
  2515. 619.37 s [vector] length: OK
  2516. 619.37 s [vector] +++ OK, passed 100 tests.
  2517. 619.37 s [vector] null: OK
  2518. 619.37 s [vector] +++ OK, passed 100 tests.
  2519. 619.37 s [vector] index: OK
  2520. 619.37 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2521. 619.37 s [vector] safeIndex: OK
  2522. 619.37 s [vector] +++ OK, passed 100 tests.
  2523. 619.37 s [vector] head: OK
  2524. 619.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2525. 619.38 s [vector] last: OK
  2526. 619.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2527. 619.38 s [vector] unsafeIndex: OK
  2528. 619.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2529. 619.38 s [vector] unsafeHead: OK
  2530. 619.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2531. 619.38 s [vector] unsafeLast: OK
  2532. 619.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2533. 619.38 s [vector] slice: OK
  2534. 619.38 s [vector] +++ OK, passed 100 tests.
  2535. 619.38 s [vector] init: OK
  2536. 619.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2537. 619.39 s [vector] tail: OK
  2538. 619.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2539. 619.39 s [vector] take: OK
  2540. 619.39 s [vector] +++ OK, passed 100 tests.
  2541. 619.39 s [vector] drop: OK
  2542. 619.39 s [vector] +++ OK, passed 100 tests.
  2543. 619.39 s [vector] splitAt: OK
  2544. 619.39 s [vector] +++ OK, passed 100 tests.
  2545. 619.39 s [vector] empty: OK
  2546. 619.39 s [vector] +++ OK, passed 100 tests.
  2547. 619.39 s [vector] singleton: OK
  2548. 619.41 s [vector] +++ OK, passed 100 tests.
  2549. 619.41 s [vector] replicate: OK
  2550. 619.41 s [vector] +++ OK, passed 100 tests.
  2551. 619.41 s [vector] generate: OK
  2552. 619.41 s [vector] +++ OK, passed 100 tests.
  2553. 619.41 s [vector] iterateN: OK
  2554. 619.41 s [vector] +++ OK, passed 100 tests.
  2555. 619.49 s [vector] iterateNM: OK (0.08s)
  2556. 619.49 s [vector] +++ OK, passed 100 tests.
  2557. 619.51 s [vector] generateM: OK (0.02s)
  2558. 619.51 s [vector] +++ OK, passed 100 tests.
  2559. 619.51 s [vector] replicateM: OK (0.02s)
  2560. 619.51 s [vector] +++ OK, passed 100 tests.
  2561. 619.51 s [vector] create: OK
  2562. 619.51 s [vector] +++ OK, passed 100 tests.
  2563. 619.51 s [vector] createT: OK
  2564. 619.51 s [vector] +++ OK, passed 100 tests.
  2565. 619.51 s [vector] unfoldr: OK
  2566. 619.51 s [vector] +++ OK, passed 100 tests.
  2567. 619.51 s [vector] unfoldrN: OK
  2568. 619.51 s [vector] +++ OK, passed 100 tests.
  2569. 619.52 s [vector] unfoldrExactN: OK
  2570. 619.52 s [vector] +++ OK, passed 100 tests.
  2571. 619.52 s [vector] unfoldrM: OK
  2572. 619.52 s [vector] +++ OK, passed 100 tests.
  2573. 619.52 s [vector] unfoldrNM: OK
  2574. 619.53 s [vector] +++ OK, passed 100 tests.
  2575. 619.61 s [vector] unfoldrExactNM: OK (0.08s)
  2576. 619.61 s [vector] +++ OK, passed 100 tests.
  2577. 619.61 s [vector] constructN: OK
  2578. 619.61 s [vector] +++ OK, passed 100 tests.
  2579. 619.61 s [vector] constructrN: OK
  2580. 619.61 s [vector] +++ OK, passed 100 tests.
  2581. 619.61 s [vector] cons: OK
  2582. 619.61 s [vector] +++ OK, passed 100 tests.
  2583. 619.61 s [vector] snoc: OK
  2584. 619.61 s [vector] +++ OK, passed 100 tests.
  2585. 619.63 s [vector] append: OK
  2586. 619.63 s [vector] +++ OK, passed 100 tests.
  2587. 619.63 s [vector] concat: OK (0.01s)
  2588. 619.63 s [vector] +++ OK, passed 100 tests.
  2589. 619.63 s [vector] force: OK
  2590. 619.64 s [vector] +++ OK, passed 100 tests.
  2591. 619.64 s [vector] upd: OK
  2592. 619.64 s [vector] +++ OK, passed 100 tests.
  2593. 619.64 s [vector] accum: OK
  2594. 619.64 s [vector] +++ OK, passed 100 tests.
  2595. 619.64 s [vector] reverse: OK
  2596. 619.64 s [vector] +++ OK, passed 100 tests.
  2597. 619.64 s [vector] backpermute: OK
  2598. 619.64 s [vector] +++ OK, passed 100 tests.
  2599. 619.64 s [vector] map: OK
  2600. 619.64 s [vector] +++ OK, passed 100 tests.
  2601. 619.64 s [vector] imap: OK
  2602. 619.64 s [vector] +++ OK, passed 100 tests.
  2603. 619.65 s [vector] concatMap: OK
  2604. 619.65 s [vector] +++ OK, passed 100 tests.
  2605. 619.65 s [vector] mapM: OK
  2606. 619.65 s [vector] +++ OK, passed 100 tests.
  2607. 619.68 s [vector] mapM_: OK (0.02s)
  2608. 619.69 s [vector] +++ OK, passed 100 tests.
  2609. 619.69 s [vector] forM: OK
  2610. 619.69 s [vector] +++ OK, passed 100 tests.
  2611. 619.70 s [vector] forM_: OK (0.02s)
  2612. 619.70 s [vector] +++ OK, passed 100 tests.
  2613. 619.70 s [vector] imapM: OK
  2614. 619.70 s [vector] +++ OK, passed 100 tests.
  2615. 619.72 s [vector] imapM_: OK (0.02s)
  2616. 619.72 s [vector] +++ OK, passed 100 tests.
  2617. 619.72 s [vector] zipWith: OK
  2618. 619.72 s [vector] +++ OK, passed 100 tests.
  2619. 619.72 s [vector] zipWith3: OK
  2620. 619.72 s [vector] +++ OK, passed 100 tests.
  2621. 619.73 s [vector] izipWith: OK
  2622. 619.73 s [vector] +++ OK, passed 100 tests.
  2623. 619.74 s [vector] izipWith3: OK
  2624. 619.74 s [vector] +++ OK, passed 100 tests.
  2625. 619.75 s [vector] izipWithM: OK
  2626. 619.75 s [vector] +++ OK, passed 100 tests.
  2627. 619.75 s [vector] izipWithM_: OK (0.01s)
  2628. 619.75 s [vector] +++ OK, passed 100 tests.
  2629. 619.75 s [vector] zipWithM: OK
  2630. 619.75 s [vector] +++ OK, passed 100 tests.
  2631. 619.75 s [vector] zipWithM_: OK (0.01s)
  2632. 619.76 s [vector] +++ OK, passed 100 tests.
  2633. 619.77 s [vector] filter: OK
  2634. 619.77 s [vector] +++ OK, passed 100 tests.
  2635. 619.77 s [vector] ifilter: OK
  2636. 619.77 s [vector] +++ OK, passed 100 tests.
  2637. 619.78 s [vector] filterM: OK (0.02s)
  2638. 619.78 s [vector] +++ OK, passed 100 tests.
  2639. 619.78 s [vector] uniq: OK
  2640. 619.78 s [vector] +++ OK, passed 100 tests.
  2641. 619.78 s [vector] mapMaybe: OK
  2642. 619.78 s [vector] +++ OK, passed 100 tests.
  2643. 619.78 s [vector] imapMaybe: OK
  2644. 619.78 s [vector] +++ OK, passed 100 tests.
  2645. 619.78 s [vector] takeWhile: OK
  2646. 619.78 s [vector] +++ OK, passed 100 tests.
  2647. 619.78 s [vector] dropWhile: OK
  2648. 619.78 s [vector] +++ OK, passed 100 tests.
  2649. 619.78 s [vector] partition: OK
  2650. 619.78 s [vector] +++ OK, passed 100 tests.
  2651. 619.78 s [vector] partitionWith: OK
  2652. 619.79 s [vector] +++ OK, passed 100 tests.
  2653. 619.79 s [vector] span: OK
  2654. 619.79 s [vector] +++ OK, passed 100 tests.
  2655. 619.79 s [vector] break: OK
  2656. 619.79 s [vector] +++ OK, passed 100 tests.
  2657. 619.79 s [vector] spanR: OK
  2658. 619.79 s [vector] +++ OK, passed 100 tests.
  2659. 619.79 s [vector] breakR: OK
  2660. 619.79 s [vector] +++ OK, passed 100 tests.
  2661. 619.79 s [vector] groupBy: OK
  2662. 619.79 s [vector] +++ OK, passed 100 tests.
  2663. 619.79 s [vector] elem: OK
  2664. 619.79 s [vector] +++ OK, passed 100 tests.
  2665. 619.79 s [vector] notElem: OK
  2666. 619.79 s [vector] +++ OK, passed 100 tests.
  2667. 619.79 s [vector] find: OK
  2668. 619.79 s [vector] +++ OK, passed 100 tests.
  2669. 619.80 s [vector] findIndex: OK
  2670. 619.80 s [vector] +++ OK, passed 100 tests.
  2671. 619.80 s [vector] findIndexR: OK
  2672. 619.80 s [vector] +++ OK, passed 100 tests.
  2673. 619.80 s [vector] findIndices: OK
  2674. 619.80 s [vector] +++ OK, passed 100 tests.
  2675. 619.80 s [vector] elemIndex: OK
  2676. 619.80 s [vector] +++ OK, passed 100 tests.
  2677. 619.80 s [vector] elemIndices: OK
  2678. 619.80 s [vector] +++ OK, passed 100 tests.
  2679. 619.80 s [vector] foldl: OK
  2680. 619.81 s [vector] +++ OK, passed 100 tests.
  2681. 619.81 s [vector] foldl1: OK
  2682. 619.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2683. 619.81 s [vector] foldl': OK
  2684. 619.81 s [vector] +++ OK, passed 100 tests.
  2685. 619.82 s [vector] foldl1': OK
  2686. 619.82 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2687. 619.83 s [vector] foldr: OK
  2688. 619.83 s [vector] +++ OK, passed 100 tests.
  2689. 619.83 s [vector] foldr1: OK
  2690. 619.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2691. 619.83 s [vector] foldr': OK
  2692. 619.83 s [vector] +++ OK, passed 100 tests.
  2693. 619.84 s [vector] foldr1': OK
  2694. 619.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2695. 619.84 s [vector] ifoldl: OK
  2696. 619.84 s [vector] +++ OK, passed 100 tests.
  2697. 619.85 s [vector] ifoldl': OK
  2698. 619.85 s [vector] +++ OK, passed 100 tests.
  2699. 619.85 s [vector] ifoldr: OK
  2700. 619.85 s [vector] +++ OK, passed 100 tests.
  2701. 619.86 s [vector] ifoldr': OK
  2702. 619.86 s [vector] +++ OK, passed 100 tests.
  2703. 619.86 s [vector] ifoldM: OK
  2704. 619.86 s [vector] +++ OK, passed 100 tests.
  2705. 619.86 s [vector] ifoldM': OK
  2706. 619.86 s [vector] +++ OK, passed 100 tests.
  2707. 619.86 s [vector] ifoldM_: OK (0.02s)
  2708. 619.86 s [vector] +++ OK, passed 100 tests.
  2709. 619.86 s [vector] ifoldM'_: OK (0.02s)
  2710. 619.86 s [vector] +++ OK, passed 100 tests.
  2711. 619.86 s [vector] all: OK
  2712. 619.86 s [vector] +++ OK, passed 100 tests.
  2713. 619.86 s [vector] any: OK
  2714. 619.86 s [vector] +++ OK, passed 100 tests.
  2715. 619.87 s [vector] prescanl: OK
  2716. 619.87 s [vector] +++ OK, passed 100 tests.
  2717. 619.87 s [vector] prescanl': OK
  2718. 619.87 s [vector] +++ OK, passed 100 tests.
  2719. 619.87 s [vector] postscanl: OK
  2720. 619.87 s [vector] +++ OK, passed 100 tests.
  2721. 619.87 s [vector] postscanl': OK
  2722. 619.87 s [vector] +++ OK, passed 100 tests.
  2723. 619.87 s [vector] scanl: OK
  2724. 619.88 s [vector] +++ OK, passed 100 tests.
  2725. 619.89 s [vector] scanl': OK
  2726. 619.89 s [vector] +++ OK, passed 100 tests.
  2727. 619.91 s [vector] scanl1: OK (0.01s)
  2728. 619.91 s [vector] +++ OK, passed 100 tests.
  2729. 619.93 s [vector] scanl1': OK (0.03s)
  2730. 619.93 s [vector] +++ OK, passed 100 tests.
  2731. 619.94 s [vector] iscanl: OK (0.01s)
  2732. 619.94 s [vector] +++ OK, passed 100 tests.
  2733. 619.94 s [vector] iscanl': OK
  2734. 619.94 s [vector] +++ OK, passed 100 tests.
  2735. 619.94 s [vector] prescanr: OK
  2736. 619.94 s [vector] +++ OK, passed 100 tests.
  2737. 619.95 s [vector] prescanr': OK
  2738. 619.95 s [vector] +++ OK, passed 100 tests.
  2739. 619.95 s [vector] postscanr: OK
  2740. 619.95 s [vector] +++ OK, passed 100 tests.
  2741. 619.95 s [vector] postscanr': OK
  2742. 619.95 s [vector] +++ OK, passed 100 tests.
  2743. 619.95 s [vector] scanr: OK
  2744. 619.95 s [vector] +++ OK, passed 100 tests.
  2745. 619.95 s [vector] scanr': OK
  2746. 619.96 s [vector] +++ OK, passed 100 tests.
  2747. 619.96 s [vector] scanr1: OK
  2748. 619.96 s [vector] +++ OK, passed 100 tests.
  2749. 619.97 s [vector] scanr1': OK
  2750. 619.97 s [vector] +++ OK, passed 100 tests.
  2751. 619.97 s [vector] iscanr: OK
  2752. 619.97 s [vector] +++ OK, passed 100 tests.
  2753. 619.97 s [vector] iscanr': OK
  2754. 619.97 s [vector] +++ OK, passed 100 tests.
  2755. 619.97 s [vector] mut_read: OK
  2756. 619.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2757. 619.98 s [vector] mut_write: OK
  2758. 619.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2759. 619.98 s [vector] mut_modify: OK
  2760. 619.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2761. 619.98 s [vector] mut_generate: OK
  2762. 619.98 s [vector] +++ OK, passed 100 tests.
  2763. 619.99 s [vector] mut_generateM: OK
  2764. 620.00 s [vector] +++ OK, passed 100 tests.
  2765. 620.03 s [vector] mut_mapM_: OK (0.02s)
  2766. 620.03 s [vector] +++ OK, passed 100 tests.
  2767. 620.05 s [vector] mut_imapM_: OK (0.03s)
  2768. 620.05 s [vector] +++ OK, passed 100 tests.
  2769. 620.07 s [vector] mut_forM_: OK (0.02s)
  2770. 620.07 s [vector] +++ OK, passed 100 tests.
  2771. 620.09 s [vector] mut_iforM_: OK
  2772. 620.09 s [vector] +++ OK, passed 100 tests.
  2773. 620.09 s [vector] mut_foldr: OK
  2774. 620.09 s [vector] +++ OK, passed 100 tests.
  2775. 620.09 s [vector] mut_foldr': OK
  2776. 620.09 s [vector] +++ OK, passed 100 tests.
  2777. 620.09 s [vector] mut_foldl: OK
  2778. 620.09 s [vector] +++ OK, passed 100 tests.
  2779. 620.09 s [vector] mut_foldl': OK
  2780. 620.09 s [vector] +++ OK, passed 100 tests.
  2781. 620.09 s [vector] mut_ifoldr: OK
  2782. 620.09 s [vector] +++ OK, passed 100 tests.
  2783. 620.10 s [vector] mut_ifoldr': OK
  2784. 620.10 s [vector] +++ OK, passed 100 tests.
  2785. 620.10 s [vector] mut_ifoldl: OK
  2786. 620.10 s [vector] +++ OK, passed 100 tests.
  2787. 620.10 s [vector] mut_ifoldl': OK
  2788. 620.10 s [vector] +++ OK, passed 100 tests.
  2789. 620.11 s [vector] mut_foldM: OK
  2790. 620.11 s [vector] +++ OK, passed 100 tests.
  2791. 620.11 s [vector] mut_foldM': OK
  2792. 620.11 s [vector] +++ OK, passed 100 tests.
  2793. 620.11 s [vector] mut_foldrM: OK
  2794. 620.11 s [vector] +++ OK, passed 100 tests.
  2795. 620.11 s [vector] mut_foldrM': OK
  2796. 620.11 s [vector] +++ OK, passed 100 tests.
  2797. 620.11 s [vector] mut_ifoldM: OK
  2798. 620.11 s [vector] +++ OK, passed 100 tests.
  2799. 620.11 s [vector] mut_ifoldM': OK
  2800. 620.11 s [vector] +++ OK, passed 100 tests.
  2801. 620.12 s [vector] mut_ifoldrM: OK
  2802. 620.12 s [vector] +++ OK, passed 100 tests.
  2803. 620.12 s [vector] mut_ifoldrM': OK
  2804. 620.12 s [vector] +++ OK, passed 100 tests.
  2805. 620.12 s [vector] compare: OK
  2806. 620.12 s [vector] +++ OK, passed 100 tests.
  2807. 620.12 s [vector] maximum: OK
  2808. 620.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2809. 620.12 s [vector] minimum: OK
  2810. 620.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2811. 620.12 s [vector] minIndex: OK
  2812. 620.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2813. 620.12 s [vector] maxIndex: OK
  2814. 620.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2815. 620.12 s [vector] maximumBy: OK
  2816. 620.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2817. 620.12 s [vector] minimumBy: OK
  2818. 620.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2819. 620.12 s [vector] maximumOn: OK
  2820. 620.12 s [vector] +++ OK, passed 100 tests; 23 discarded.
  2821. 620.13 s [vector] minimumOn: OK
  2822. 620.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2823. 620.13 s [vector] maxIndexBy: OK
  2824. 620.13 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2825. 620.13 s [vector] minIndexBy: OK
  2826. 620.13 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2827. 620.13 s [vector] ListFirstMaxIndexWins: OK
  2828. 620.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2829. 620.13 s [vector] FalseListFirstMaxIndexWins: OK
  2830. 620.13 s [vector] +++ OK, failed as expected. (after 1 test):
  2831. 620.13 s [vector] Exception:
  2832. 620.13 s [vector] Prelude.foldr1: empty list
  2833. 620.13 s [vector] CallStack (from HasCallStack):
  2834. 620.13 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  2835. 620.13 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  2836. 620.13 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  2837. 620.13 s [vector] []
  2838. 620.13 s [vector] zip: OK
  2839. 620.13 s [vector] +++ OK, passed 100 tests.
  2840. 620.13 s [vector] zip3: OK
  2841. 620.13 s [vector] +++ OK, passed 100 tests.
  2842. 620.13 s [vector] unzip: OK
  2843. 620.13 s [vector] +++ OK, passed 100 tests.
  2844. 620.13 s [vector] unzip3: OK
  2845. 620.13 s [vector] +++ OK, passed 100 tests.
  2846. 620.13 s [vector] indexed: OK
  2847. 620.13 s [vector] +++ OK, passed 100 tests.
  2848. 620.13 s [vector] update: OK
  2849. 620.14 s [vector] +++ OK, passed 100 tests.
  2850. 620.15 s [vector] concat: OK (0.01s)
  2851. 620.15 s [vector] +++ OK, passed 100 tests.
  2852. 620.15 s [vector] mempty: OK
  2853. 620.15 s [vector] +++ OK, passed 100 tests.
  2854. 620.15 s [vector] mappend: OK
  2855. 620.15 s [vector] +++ OK, passed 100 tests.
  2856. 620.16 s [vector] mconcat: OK (0.01s)
  2857. 620.16 s [vector] +++ OK, passed 100 tests.
  2858. 620.16 s [vector] fmap: OK
  2859. 620.17 s [vector] +++ OK, passed 100 tests.
  2860. 620.17 s [vector] return: OK
  2861. 620.17 s [vector] +++ OK, passed 100 tests.
  2862. 620.18 s [vector] bind: OK (0.01s)
  2863. 620.18 s [vector] +++ OK, passed 100 tests.
  2864. 620.18 s [vector] mzip: OK
  2865. 620.18 s [vector] +++ OK, passed 100 tests.
  2866. 620.18 s [vector] munzip: OK
  2867. 620.18 s [vector] +++ OK, passed 100 tests.
  2868. 620.18 s [vector] applicative_pure: OK
  2869. 620.18 s [vector] +++ OK, passed 100 tests.
  2870. 620.20 s [vector] applicative_appl: OK (0.02s)
  2871. 620.20 s [vector] +++ OK, passed 100 tests.
  2872. 620.20 s [vector] alternative_empty: OK
  2873. 620.20 s [vector] +++ OK, passed 100 tests.
  2874. 620.21 s [vector] alternative_or: OK
  2875. 620.21 s [vector] +++ OK, passed 100 tests.
  2876. 620.24 s [vector] sequence: OK (0.03s)
  2877. 620.24 s [vector] +++ OK, passed 100 tests.
  2878. 620.24 s [vector] sequence_: OK
  2879. 620.24 s [vector] +++ OK, passed 100 tests.
  2880. 620.25 s [vector] glength: OK
  2881. 620.25 s [vector] +++ OK, passed 100 tests.
  2882. 620.25 s [vector] and: OK
  2883. 620.25 s [vector] +++ OK, passed 100 tests.
  2884. 620.25 s [vector] or: OK
  2885. 620.25 s [vector] +++ OK, passed 100 tests.
  2886. 620.25 s [vector] Int
  2887. 620.25 s [vector] fromList.toList == id: OK
  2888. 620.25 s [vector] +++ OK, passed 100 tests.
  2889. 620.25 s [vector] toList.fromList == id: OK
  2890. 620.25 s [vector] +++ OK, passed 100 tests.
  2891. 620.25 s [vector] unstream.stream == id: OK
  2892. 620.25 s [vector] +++ OK, passed 100 tests.
  2893. 620.25 s [vector] stream.unstream == id: OK
  2894. 620.25 s [vector] +++ OK, passed 100 tests.
  2895. 620.25 s [vector] eq: OK
  2896. 620.25 s [vector] +++ OK, passed 100 tests.
  2897. 620.25 s [vector] length: OK
  2898. 620.25 s [vector] +++ OK, passed 100 tests.
  2899. 620.25 s [vector] null: OK
  2900. 620.25 s [vector] +++ OK, passed 100 tests.
  2901. 620.25 s [vector] index: OK
  2902. 620.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2903. 620.25 s [vector] safeIndex: OK
  2904. 620.25 s [vector] +++ OK, passed 100 tests.
  2905. 620.25 s [vector] head: OK
  2906. 620.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2907. 620.25 s [vector] last: OK
  2908. 620.25 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2909. 620.25 s [vector] unsafeIndex: OK
  2910. 620.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2911. 620.25 s [vector] unsafeHead: OK
  2912. 620.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2913. 620.25 s [vector] unsafeLast: OK
  2914. 620.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2915. 620.25 s [vector] slice: OK
  2916. 620.25 s [vector] +++ OK, passed 100 tests.
  2917. 620.25 s [vector] init: OK
  2918. 620.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2919. 620.25 s [vector] tail: OK
  2920. 620.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2921. 620.25 s [vector] take: OK
  2922. 620.25 s [vector] +++ OK, passed 100 tests.
  2923. 620.26 s [vector] drop: OK
  2924. 620.26 s [vector] +++ OK, passed 100 tests.
  2925. 620.26 s [vector] splitAt: OK
  2926. 620.26 s [vector] +++ OK, passed 100 tests.
  2927. 620.26 s [vector] empty: OK
  2928. 620.26 s [vector] +++ OK, passed 100 tests.
  2929. 620.26 s [vector] singleton: OK
  2930. 620.26 s [vector] +++ OK, passed 100 tests.
  2931. 620.26 s [vector] replicate: OK
  2932. 620.26 s [vector] +++ OK, passed 100 tests.
  2933. 620.26 s [vector] generate: OK
  2934. 620.26 s [vector] +++ OK, passed 100 tests.
  2935. 620.27 s [vector] iterateN: OK
  2936. 620.27 s [vector] +++ OK, passed 100 tests.
  2937. 620.37 s [vector] iterateNM: OK (0.10s)
  2938. 620.37 s [vector] +++ OK, passed 100 tests.
  2939. 620.41 s [vector] generateM: OK (0.03s)
  2940. 620.41 s [vector] +++ OK, passed 100 tests.
  2941. 620.41 s [vector] replicateM: OK (0.02s)
  2942. 620.41 s [vector] +++ OK, passed 100 tests.
  2943. 620.41 s [vector] create: OK
  2944. 620.41 s [vector] +++ OK, passed 100 tests.
  2945. 620.41 s [vector] createT: OK
  2946. 620.41 s [vector] +++ OK, passed 100 tests.
  2947. 620.41 s [vector] unfoldr: OK
  2948. 620.41 s [vector] +++ OK, passed 100 tests.
  2949. 620.41 s [vector] unfoldrN: OK
  2950. 620.42 s [vector] +++ OK, passed 100 tests.
  2951. 620.42 s [vector] unfoldrExactN: OK
  2952. 620.42 s [vector] +++ OK, passed 100 tests.
  2953. 620.43 s [vector] unfoldrM: OK
  2954. 620.43 s [vector] +++ OK, passed 100 tests.
  2955. 620.45 s [vector] unfoldrNM: OK
  2956. 620.45 s [vector] +++ OK, passed 100 tests.
  2957. 620.49 s [vector] unfoldrExactNM: OK (0.06s)
  2958. 620.49 s [vector] +++ OK, passed 100 tests.
  2959. 620.50 s [vector] constructN: OK (0.01s)
  2960. 620.51 s [vector] +++ OK, passed 100 tests.
  2961. 620.51 s [vector] constructrN: OK
  2962. 620.51 s [vector] +++ OK, passed 100 tests.
  2963. 620.51 s [vector] cons: OK
  2964. 620.51 s [vector] +++ OK, passed 100 tests.
  2965. 620.51 s [vector] snoc: OK
  2966. 620.51 s [vector] +++ OK, passed 100 tests.
  2967. 620.51 s [vector] append: OK
  2968. 620.51 s [vector] +++ OK, passed 100 tests.
  2969. 620.52 s [vector] concat: OK (0.01s)
  2970. 620.52 s [vector] +++ OK, passed 100 tests.
  2971. 620.52 s [vector] force: OK
  2972. 620.52 s [vector] +++ OK, passed 100 tests.
  2973. 620.52 s [vector] upd: OK
  2974. 620.52 s [vector] +++ OK, passed 100 tests.
  2975. 620.53 s [vector] accum: OK
  2976. 620.53 s [vector] +++ OK, passed 100 tests.
  2977. 620.53 s [vector] reverse: OK
  2978. 620.53 s [vector] +++ OK, passed 100 tests.
  2979. 620.53 s [vector] backpermute: OK
  2980. 620.53 s [vector] +++ OK, passed 100 tests.
  2981. 620.54 s [vector] map: OK
  2982. 620.54 s [vector] +++ OK, passed 100 tests.
  2983. 620.54 s [vector] imap: OK
  2984. 620.54 s [vector] +++ OK, passed 100 tests.
  2985. 620.54 s [vector] concatMap: OK
  2986. 620.54 s [vector] +++ OK, passed 100 tests.
  2987. 620.55 s [vector] mapM: OK
  2988. 620.55 s [vector] +++ OK, passed 100 tests.
  2989. 620.56 s [vector] mapM_: OK (0.02s)
  2990. 620.56 s [vector] +++ OK, passed 100 tests.
  2991. 620.56 s [vector] forM: OK
  2992. 620.56 s [vector] +++ OK, passed 100 tests.
  2993. 620.58 s [vector] forM_: OK (0.02s)
  2994. 620.59 s [vector] +++ OK, passed 100 tests.
  2995. 620.59 s [vector] imapM: OK
  2996. 620.59 s [vector] +++ OK, passed 100 tests.
  2997. 620.61 s [vector] imapM_: OK (0.02s)
  2998. 620.61 s [vector] +++ OK, passed 100 tests.
  2999. 620.61 s [vector] zipWith: OK
  3000. 620.61 s [vector] +++ OK, passed 100 tests.
  3001. 620.61 s [vector] zipWith3: OK
  3002. 620.61 s [vector] +++ OK, passed 100 tests.
  3003. 620.62 s [vector] izipWith: OK
  3004. 620.62 s [vector] +++ OK, passed 100 tests.
  3005. 620.62 s [vector] izipWith3: OK
  3006. 620.62 s [vector] +++ OK, passed 100 tests.
  3007. 620.62 s [vector] izipWithM: OK
  3008. 620.62 s [vector] +++ OK, passed 100 tests.
  3009. 620.64 s [vector] izipWithM_: OK (0.02s)
  3010. 620.65 s [vector] +++ OK, passed 100 tests.
  3011. 620.65 s [vector] zipWithM: OK
  3012. 620.65 s [vector] +++ OK, passed 100 tests.
  3013. 620.67 s [vector] zipWithM_: OK (0.03s)
  3014. 620.67 s [vector] +++ OK, passed 100 tests.
  3015. 620.69 s [vector] filter: OK
  3016. 620.69 s [vector] +++ OK, passed 100 tests.
  3017. 620.69 s [vector] ifilter: OK
  3018. 620.69 s [vector] +++ OK, passed 100 tests.
  3019. 620.71 s [vector] filterM: OK (0.03s)
  3020. 620.71 s [vector] +++ OK, passed 100 tests.
  3021. 620.71 s [vector] uniq: OK
  3022. 620.71 s [vector] +++ OK, passed 100 tests.
  3023. 620.71 s [vector] mapMaybe: OK
  3024. 620.71 s [vector] +++ OK, passed 100 tests.
  3025. 620.72 s [vector] imapMaybe: OK
  3026. 620.72 s [vector] +++ OK, passed 100 tests.
  3027. 620.72 s [vector] takeWhile: OK
  3028. 620.72 s [vector] +++ OK, passed 100 tests.
  3029. 620.72 s [vector] dropWhile: OK
  3030. 620.72 s [vector] +++ OK, passed 100 tests.
  3031. 620.72 s [vector] partition: OK
  3032. 620.72 s [vector] +++ OK, passed 100 tests.
  3033. 620.72 s [vector] partitionWith: OK
  3034. 620.72 s [vector] +++ OK, passed 100 tests.
  3035. 620.72 s [vector] span: OK
  3036. 620.72 s [vector] +++ OK, passed 100 tests.
  3037. 620.72 s [vector] break: OK
  3038. 620.72 s [vector] +++ OK, passed 100 tests.
  3039. 620.72 s [vector] spanR: OK
  3040. 620.72 s [vector] +++ OK, passed 100 tests.
  3041. 620.72 s [vector] breakR: OK
  3042. 620.72 s [vector] +++ OK, passed 100 tests.
  3043. 620.72 s [vector] groupBy: OK
  3044. 620.72 s [vector] +++ OK, passed 100 tests.
  3045. 620.72 s [vector] elem: OK
  3046. 620.73 s [vector] +++ OK, passed 100 tests.
  3047. 620.73 s [vector] notElem: OK
  3048. 620.73 s [vector] +++ OK, passed 100 tests.
  3049. 620.73 s [vector] find: OK
  3050. 620.73 s [vector] +++ OK, passed 100 tests.
  3051. 620.73 s [vector] findIndex: OK
  3052. 620.73 s [vector] +++ OK, passed 100 tests.
  3053. 620.73 s [vector] findIndexR: OK
  3054. 620.73 s [vector] +++ OK, passed 100 tests.
  3055. 620.73 s [vector] findIndices: OK
  3056. 620.73 s [vector] +++ OK, passed 100 tests.
  3057. 620.73 s [vector] elemIndex: OK
  3058. 620.73 s [vector] +++ OK, passed 100 tests.
  3059. 620.73 s [vector] elemIndices: OK
  3060. 620.73 s [vector] +++ OK, passed 100 tests.
  3061. 620.73 s [vector] foldl: OK
  3062. 620.73 s [vector] +++ OK, passed 100 tests.
  3063. 620.73 s [vector] foldl1: OK
  3064. 620.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3065. 620.74 s [vector] foldl': OK
  3066. 620.74 s [vector] +++ OK, passed 100 tests.
  3067. 620.74 s [vector] foldl1': OK
  3068. 620.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3069. 620.74 s [vector] foldr: OK
  3070. 620.75 s [vector] +++ OK, passed 100 tests.
  3071. 620.75 s [vector] foldr1: OK
  3072. 620.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3073. 620.75 s [vector] foldr': OK
  3074. 620.75 s [vector] +++ OK, passed 100 tests.
  3075. 620.76 s [vector] foldr1': OK
  3076. 620.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3077. 620.76 s [vector] ifoldl: OK
  3078. 620.76 s [vector] +++ OK, passed 100 tests.
  3079. 620.76 s [vector] ifoldl': OK
  3080. 620.76 s [vector] +++ OK, passed 100 tests.
  3081. 620.77 s [vector] ifoldr: OK
  3082. 620.77 s [vector] +++ OK, passed 100 tests.
  3083. 620.78 s [vector] ifoldr': OK
  3084. 620.78 s [vector] +++ OK, passed 100 tests.
  3085. 620.79 s [vector] ifoldM: OK
  3086. 620.79 s [vector] +++ OK, passed 100 tests.
  3087. 620.79 s [vector] ifoldM': OK
  3088. 620.79 s [vector] +++ OK, passed 100 tests.
  3089. 620.81 s [vector] ifoldM_: OK (0.02s)
  3090. 620.81 s [vector] +++ OK, passed 100 tests.
  3091. 620.83 s [vector] ifoldM'_: OK (0.02s)
  3092. 620.83 s [vector] +++ OK, passed 100 tests.
  3093. 620.83 s [vector] all: OK
  3094. 620.83 s [vector] +++ OK, passed 100 tests.
  3095. 620.83 s [vector] any: OK
  3096. 620.83 s [vector] +++ OK, passed 100 tests.
  3097. 620.84 s [vector] prescanl: OK
  3098. 620.84 s [vector] +++ OK, passed 100 tests.
  3099. 620.84 s [vector] prescanl': OK
  3100. 620.84 s [vector] +++ OK, passed 100 tests.
  3101. 620.84 s [vector] postscanl: OK
  3102. 620.84 s [vector] +++ OK, passed 100 tests.
  3103. 620.84 s [vector] postscanl': OK
  3104. 620.84 s [vector] +++ OK, passed 100 tests.
  3105. 620.84 s [vector] scanl: OK
  3106. 620.84 s [vector] +++ OK, passed 100 tests.
  3107. 620.84 s [vector] scanl': OK
  3108. 620.84 s [vector] +++ OK, passed 100 tests.
  3109. 620.85 s [vector] scanl1: OK
  3110. 620.85 s [vector] +++ OK, passed 100 tests.
  3111. 620.85 s [vector] scanl1': OK
  3112. 620.86 s [vector] +++ OK, passed 100 tests.
  3113. 620.86 s [vector] iscanl: OK
  3114. 620.86 s [vector] +++ OK, passed 100 tests.
  3115. 620.87 s [vector] iscanl': OK
  3116. 620.87 s [vector] +++ OK, passed 100 tests.
  3117. 620.87 s [vector] prescanr: OK
  3118. 620.87 s [vector] +++ OK, passed 100 tests.
  3119. 620.87 s [vector] prescanr': OK
  3120. 620.87 s [vector] +++ OK, passed 100 tests.
  3121. 620.87 s [vector] postscanr: OK
  3122. 620.87 s [vector] +++ OK, passed 100 tests.
  3123. 620.87 s [vector] postscanr': OK
  3124. 620.87 s [vector] +++ OK, passed 100 tests.
  3125. 620.88 s [vector] scanr: OK
  3126. 620.88 s [vector] +++ OK, passed 100 tests.
  3127. 620.88 s [vector] scanr': OK
  3128. 620.88 s [vector] +++ OK, passed 100 tests.
  3129. 620.88 s [vector] scanr1: OK
  3130. 620.88 s [vector] +++ OK, passed 100 tests.
  3131. 620.88 s [vector] scanr1': OK
  3132. 620.89 s [vector] +++ OK, passed 100 tests.
  3133. 620.89 s [vector] iscanr: OK
  3134. 620.89 s [vector] +++ OK, passed 100 tests.
  3135. 620.89 s [vector] iscanr': OK
  3136. 620.89 s [vector] +++ OK, passed 100 tests.
  3137. 620.89 s [vector] mut_read: OK
  3138. 620.89 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3139. 620.89 s [vector] mut_write: OK
  3140. 620.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3141. 620.89 s [vector] mut_modify: OK
  3142. 620.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3143. 620.89 s [vector] mut_generate: OK
  3144. 620.89 s [vector] +++ OK, passed 100 tests.
  3145. 620.91 s [vector] mut_generateM: OK
  3146. 620.91 s [vector] +++ OK, passed 100 tests.
  3147. 620.93 s [vector] mut_mapM_: OK (0.02s)
  3148. 620.93 s [vector] +++ OK, passed 100 tests.
  3149. 620.95 s [vector] mut_imapM_: OK (0.02s)
  3150. 620.95 s [vector] +++ OK, passed 100 tests.
  3151. 620.97 s [vector] mut_forM_: OK (0.02s)
  3152. 620.97 s [vector] +++ OK, passed 100 tests.
  3153. 620.98 s [vector] mut_iforM_: OK (0.02s)
  3154. 620.98 s [vector] +++ OK, passed 100 tests.
  3155. 620.99 s [vector] mut_foldr: OK
  3156. 620.99 s [vector] +++ OK, passed 100 tests.
  3157. 620.99 s [vector] mut_foldr': OK
  3158. 620.99 s [vector] +++ OK, passed 100 tests.
  3159. 620.99 s [vector] mut_foldl: OK
  3160. 620.99 s [vector] +++ OK, passed 100 tests.
  3161. 620.99 s [vector] mut_foldl': OK
  3162. 620.99 s [vector] +++ OK, passed 100 tests.
  3163. 621.00 s [vector] mut_ifoldr: OK
  3164. 621.01 s [vector] +++ OK, passed 100 tests.
  3165. 621.01 s [vector] mut_ifoldr': OK
  3166. 621.01 s [vector] +++ OK, passed 100 tests.
  3167. 621.01 s [vector] mut_ifoldl: OK
  3168. 621.01 s [vector] +++ OK, passed 100 tests.
  3169. 621.01 s [vector] mut_ifoldl': OK
  3170. 621.01 s [vector] +++ OK, passed 100 tests.
  3171. 621.02 s [vector] mut_foldM: OK
  3172. 621.03 s [vector] +++ OK, passed 100 tests.
  3173. 621.03 s [vector] mut_foldM': OK
  3174. 621.03 s [vector] +++ OK, passed 100 tests.
  3175. 621.04 s [vector] mut_foldrM: OK
  3176. 621.04 s [vector] +++ OK, passed 100 tests.
  3177. 621.04 s [vector] mut_foldrM': OK
  3178. 621.04 s [vector] +++ OK, passed 100 tests.
  3179. 621.05 s [vector] mut_ifoldM: OK
  3180. 621.05 s [vector] +++ OK, passed 100 tests.
  3181. 621.06 s [vector] mut_ifoldM': OK
  3182. 621.06 s [vector] +++ OK, passed 100 tests.
  3183. 621.06 s [vector] mut_ifoldrM: OK
  3184. 621.06 s [vector] +++ OK, passed 100 tests.
  3185. 621.06 s [vector] mut_ifoldrM': OK
  3186. 621.06 s [vector] +++ OK, passed 100 tests.
  3187. 621.07 s [vector] compare: OK
  3188. 621.07 s [vector] +++ OK, passed 100 tests.
  3189. 621.07 s [vector] maximum: OK
  3190. 621.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3191. 621.07 s [vector] minimum: OK
  3192. 621.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3193. 621.07 s [vector] minIndex: OK
  3194. 621.08 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3195. 621.08 s [vector] maxIndex: OK
  3196. 621.08 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3197. 621.08 s [vector] maximumBy: OK
  3198. 621.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3199. 621.08 s [vector] minimumBy: OK
  3200. 621.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3201. 621.08 s [vector] maximumOn: OK
  3202. 621.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3203. 621.09 s [vector] minimumOn: OK
  3204. 621.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3205. 621.09 s [vector] maxIndexBy: OK
  3206. 621.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3207. 621.09 s [vector] minIndexBy: OK
  3208. 621.09 s [vector] +++ OK, passed 100 tests; 23 discarded.
  3209. 621.09 s [vector] ListFirstMaxIndexWins: OK
  3210. 621.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3211. 621.09 s [vector] FalseListFirstMaxIndexWins: OK
  3212. 621.10 s [vector] +++ OK, failed as expected. (after 1 test):
  3213. 621.10 s [vector] Exception:
  3214. 621.10 s [vector] Prelude.foldr1: empty list
  3215. 621.10 s [vector] CallStack (from HasCallStack):
  3216. 621.10 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3217. 621.10 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3218. 621.10 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3219. 621.10 s [vector] []
  3220. 621.10 s [vector] zip: OK
  3221. 621.10 s [vector] +++ OK, passed 100 tests.
  3222. 621.11 s [vector] zip3: OK
  3223. 621.11 s [vector] +++ OK, passed 100 tests.
  3224. 621.12 s [vector] unzip: OK
  3225. 621.12 s [vector] +++ OK, passed 100 tests.
  3226. 621.13 s [vector] unzip3: OK
  3227. 621.13 s [vector] +++ OK, passed 100 tests.
  3228. 621.13 s [vector] indexed: OK
  3229. 621.13 s [vector] +++ OK, passed 100 tests.
  3230. 621.15 s [vector] update: OK
  3231. 621.15 s [vector] +++ OK, passed 100 tests.
  3232. 621.15 s [vector] concat: OK (0.02s)
  3233. 621.15 s [vector] +++ OK, passed 100 tests.
  3234. 621.15 s [vector] mempty: OK
  3235. 621.15 s [vector] +++ OK, passed 100 tests.
  3236. 621.15 s [vector] mappend: OK
  3237. 621.17 s [vector] +++ OK, passed 100 tests.
  3238. 621.19 s [vector] mconcat: OK (0.02s)
  3239. 621.19 s [vector] +++ OK, passed 100 tests.
  3240. 621.19 s [vector] fmap: OK
  3241. 621.19 s [vector] +++ OK, passed 100 tests.
  3242. 621.19 s [vector] return: OK
  3243. 621.19 s [vector] +++ OK, passed 100 tests.
  3244. 621.27 s [vector] bind: OK (0.08s)
  3245. 621.37 s [vector] +++ OK, passed 100 tests.
  3246. 621.37 s [vector] mzip: OK
  3247. 621.37 s [vector] +++ OK, passed 100 tests.
  3248. 621.37 s [vector] munzip: OK
  3249. 621.37 s [vector] +++ OK, passed 100 tests.
  3250. 621.37 s [vector] applicative_pure: OK
  3251. 621.38 s [vector] +++ OK, passed 100 tests.
  3252. 621.38 s [vector] applicative_appl: OK (0.10s)
  3253. 621.38 s [vector] +++ OK, passed 100 tests.
  3254. 621.38 s [vector] alternative_empty: OK
  3255. 621.38 s [vector] +++ OK, passed 100 tests.
  3256. 621.38 s [vector] alternative_or: OK
  3257. 621.38 s [vector] +++ OK, passed 100 tests.
  3258. 621.48 s [vector] sequence: OK (0.08s)
  3259. 621.48 s [vector] +++ OK, passed 100 tests.
  3260. 621.50 s [vector] sequence_: OK (0.03s)
  3261. 621.50 s [vector] +++ OK, passed 100 tests.
  3262. 621.51 s [vector] glength: OK (0.01s)
  3263. 621.51 s [vector] +++ OK, passed 100 tests.
  3264. 621.52 s [vector] sum: OK
  3265. 621.52 s [vector] +++ OK, passed 100 tests.
  3266. 621.52 s [vector] product: OK
  3267. 621.52 s [vector] +++ OK, passed 100 tests.
  3268. 621.53 s [vector] enumFromN: OK
  3269. 621.53 s [vector] +++ OK, passed 100 tests.
  3270. 621.53 s [vector] enumFromThenN: OK
  3271. 621.53 s [vector] +++ OK, passed 100 tests.
  3272. 621.53 s [vector] enumFromTo: OK
  3273. 621.54 s [vector] +++ OK, passed 100 tests.
  3274. 621.54 s [vector] enumFromThenTo: OK
  3275. 621.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3276. 621.54 s [vector] unstream
  3277. 621.56 s [vector] unstream == vunstream (exact): OK (0.01s)
  3278. 621.56 s [vector] +++ OK, passed 100 tests.
  3279. 621.56 s [vector] unstream == vunstream (unknown): OK
  3280. 621.56 s [vector] +++ OK, passed 100 tests.
  3281. 621.58 s [vector] unstreamR ~= vunstream (exact): OK (0.01s)
  3282. 621.58 s [vector] +++ OK, passed 100 tests.
  3283. 621.58 s [vector] unstreamR ~= vunstream (unknown): OK
  3284. 621.58 s [vector] +++ OK, passed 100 tests.
  3285. 621.58 s [vector] Tests.Vector.Primitive
  3286. 621.58 s [vector] Int
  3287. 621.59 s [vector] fromList.toList == id: OK
  3288. 621.59 s [vector] +++ OK, passed 100 tests.
  3289. 621.59 s [vector] toList.fromList == id: OK
  3290. 621.59 s [vector] +++ OK, passed 100 tests.
  3291. 621.59 s [vector] unstream.stream == id: OK
  3292. 621.60 s [vector] +++ OK, passed 100 tests.
  3293. 621.60 s [vector] stream.unstream == id: OK
  3294. 621.61 s [vector] +++ OK, passed 100 tests.
  3295. 621.61 s [vector] eq: OK
  3296. 621.61 s [vector] +++ OK, passed 100 tests.
  3297. 621.61 s [vector] length: OK
  3298. 621.61 s [vector] +++ OK, passed 100 tests.
  3299. 621.61 s [vector] null: OK
  3300. 621.62 s [vector] +++ OK, passed 100 tests.
  3301. 621.62 s [vector] index: OK
  3302. 621.62 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3303. 621.62 s [vector] safeIndex: OK
  3304. 621.63 s [vector] +++ OK, passed 100 tests.
  3305. 621.63 s [vector] head: OK
  3306. 621.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3307. 621.63 s [vector] last: OK
  3308. 621.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3309. 621.64 s [vector] unsafeIndex: OK
  3310. 621.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3311. 621.64 s [vector] unsafeHead: OK
  3312. 621.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3313. 621.64 s [vector] unsafeLast: OK
  3314. 621.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3315. 621.65 s [vector] slice: OK
  3316. 621.65 s [vector] +++ OK, passed 100 tests.
  3317. 621.65 s [vector] init: OK
  3318. 621.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3319. 621.65 s [vector] tail: OK
  3320. 621.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3321. 621.65 s [vector] take: OK
  3322. 621.65 s [vector] +++ OK, passed 100 tests.
  3323. 621.65 s [vector] drop: OK
  3324. 621.66 s [vector] +++ OK, passed 100 tests.
  3325. 621.66 s [vector] splitAt: OK
  3326. 621.66 s [vector] +++ OK, passed 100 tests.
  3327. 621.66 s [vector] empty: OK
  3328. 621.66 s [vector] +++ OK, passed 100 tests.
  3329. 621.66 s [vector] singleton: OK
  3330. 621.66 s [vector] +++ OK, passed 100 tests.
  3331. 621.66 s [vector] replicate: OK
  3332. 621.66 s [vector] +++ OK, passed 100 tests.
  3333. 621.66 s [vector] generate: OK
  3334. 621.66 s [vector] +++ OK, passed 100 tests.
  3335. 621.66 s [vector] iterateN: OK
  3336. 621.68 s [vector] +++ OK, passed 100 tests.
  3337. 621.80 s [vector] iterateNM: OK (0.13s)
  3338. 621.80 s [vector] +++ OK, passed 100 tests.
  3339. 621.86 s [vector] generateM: OK (0.05s)
  3340. 621.86 s [vector] +++ OK, passed 100 tests.
  3341. 621.86 s [vector] replicateM: OK (0.02s)
  3342. 621.86 s [vector] +++ OK, passed 100 tests.
  3343. 621.86 s [vector] create: OK
  3344. 621.86 s [vector] +++ OK, passed 100 tests.
  3345. 621.86 s [vector] createT: OK
  3346. 621.86 s [vector] +++ OK, passed 100 tests.
  3347. 621.86 s [vector] unfoldr: OK
  3348. 621.86 s [vector] +++ OK, passed 100 tests.
  3349. 621.87 s [vector] unfoldrN: OK
  3350. 621.87 s [vector] +++ OK, passed 100 tests.
  3351. 621.87 s [vector] unfoldrExactN: OK
  3352. 621.87 s [vector] +++ OK, passed 100 tests.
  3353. 621.87 s [vector] unfoldrM: OK
  3354. 621.87 s [vector] +++ OK, passed 100 tests.
  3355. 621.88 s [vector] unfoldrNM: OK
  3356. 621.88 s [vector] +++ OK, passed 100 tests.
  3357. 621.99 s [vector] unfoldrExactNM: OK (0.11s)
  3358. 621.99 s [vector] +++ OK, passed 100 tests.
  3359. 622.00 s [vector] constructN: OK
  3360. 622.00 s [vector] +++ OK, passed 100 tests.
  3361. 622.01 s [vector] constructrN: OK
  3362. 622.01 s [vector] +++ OK, passed 100 tests.
  3363. 622.01 s [vector] cons: OK
  3364. 622.01 s [vector] +++ OK, passed 100 tests.
  3365. 622.02 s [vector] snoc: OK
  3366. 622.02 s [vector] +++ OK, passed 100 tests.
  3367. 622.02 s [vector] append: OK
  3368. 622.02 s [vector] +++ OK, passed 100 tests.
  3369. 622.06 s [vector] concat: OK (0.04s)
  3370. 622.06 s [vector] +++ OK, passed 100 tests.
  3371. 622.06 s [vector] force: OK
  3372. 622.06 s [vector] +++ OK, passed 100 tests.
  3373. 622.06 s [vector] upd: OK
  3374. 622.07 s [vector] +++ OK, passed 100 tests.
  3375. 622.08 s [vector] accum: OK (0.01s)
  3376. 622.08 s [vector] +++ OK, passed 100 tests.
  3377. 622.08 s [vector] reverse: OK
  3378. 622.08 s [vector] +++ OK, passed 100 tests.
  3379. 622.08 s [vector] backpermute: OK
  3380. 622.09 s [vector] +++ OK, passed 100 tests.
  3381. 622.10 s [vector] map: OK
  3382. 622.10 s [vector] +++ OK, passed 100 tests.
  3383. 622.10 s [vector] imap: OK
  3384. 622.11 s [vector] +++ OK, passed 100 tests.
  3385. 622.12 s [vector] concatMap: OK
  3386. 622.12 s [vector] +++ OK, passed 100 tests.
  3387. 622.12 s [vector] mapM: OK
  3388. 622.12 s [vector] +++ OK, passed 100 tests.
  3389. 622.18 s [vector] mapM_: OK (0.06s)
  3390. 622.18 s [vector] +++ OK, passed 100 tests.
  3391. 622.20 s [vector] forM: OK
  3392. 622.20 s [vector] +++ OK, passed 100 tests.
  3393. 622.22 s [vector] forM_: OK (0.03s)
  3394. 622.22 s [vector] +++ OK, passed 100 tests.
  3395. 622.22 s [vector] imapM: OK
  3396. 622.22 s [vector] +++ OK, passed 100 tests.
  3397. 622.24 s [vector] imapM_: OK (0.03s)
  3398. 622.24 s [vector] +++ OK, passed 100 tests.
  3399. 622.25 s [vector] zipWith: OK
  3400. 622.25 s [vector] +++ OK, passed 100 tests.
  3401. 622.25 s [vector] zipWith3: OK
  3402. 622.25 s [vector] +++ OK, passed 100 tests.
  3403. 622.25 s [vector] izipWith: OK
  3404. 622.26 s [vector] +++ OK, passed 100 tests.
  3405. 622.26 s [vector] izipWith3: OK
  3406. 622.26 s [vector] +++ OK, passed 100 tests.
  3407. 622.27 s [vector] izipWithM: OK
  3408. 622.28 s [vector] +++ OK, passed 100 tests.
  3409. 622.30 s [vector] izipWithM_: OK (0.03s)
  3410. 622.30 s [vector] +++ OK, passed 100 tests.
  3411. 622.30 s [vector] zipWithM: OK
  3412. 622.30 s [vector] +++ OK, passed 100 tests.
  3413. 622.32 s [vector] zipWithM_: OK (0.02s)
  3414. 622.32 s [vector] +++ OK, passed 100 tests.
  3415. 622.32 s [vector] filter: OK
  3416. 622.32 s [vector] +++ OK, passed 100 tests.
  3417. 622.33 s [vector] ifilter: OK
  3418. 622.34 s [vector] +++ OK, passed 100 tests.
  3419. 622.38 s [vector] filterM: OK (0.05s)
  3420. 622.38 s [vector] +++ OK, passed 100 tests.
  3421. 622.38 s [vector] uniq: OK
  3422. 622.38 s [vector] +++ OK, passed 100 tests.
  3423. 622.38 s [vector] mapMaybe: OK
  3424. 622.39 s [vector] +++ OK, passed 100 tests.
  3425. 622.39 s [vector] imapMaybe: OK
  3426. 622.39 s [vector] +++ OK, passed 100 tests.
  3427. 622.39 s [vector] takeWhile: OK
  3428. 622.39 s [vector] +++ OK, passed 100 tests.
  3429. 622.39 s [vector] dropWhile: OK
  3430. 622.40 s [vector] +++ OK, passed 100 tests.
  3431. 622.40 s [vector] partition: OK
  3432. 622.40 s [vector] +++ OK, passed 100 tests.
  3433. 622.40 s [vector] partitionWith: OK
  3434. 622.40 s [vector] +++ OK, passed 100 tests.
  3435. 622.40 s [vector] span: OK
  3436. 622.41 s [vector] +++ OK, passed 100 tests.
  3437. 622.41 s [vector] break: OK
  3438. 622.41 s [vector] +++ OK, passed 100 tests.
  3439. 622.41 s [vector] spanR: OK
  3440. 622.41 s [vector] +++ OK, passed 100 tests.
  3441. 622.41 s [vector] breakR: OK
  3442. 622.41 s [vector] +++ OK, passed 100 tests.
  3443. 622.41 s [vector] groupBy: OK
  3444. 622.42 s [vector] +++ OK, passed 100 tests.
  3445. 622.42 s [vector] elem: OK
  3446. 622.42 s [vector] +++ OK, passed 100 tests.
  3447. 622.42 s [vector] notElem: OK
  3448. 622.42 s [vector] +++ OK, passed 100 tests.
  3449. 622.42 s [vector] find: OK
  3450. 622.42 s [vector] +++ OK, passed 100 tests.
  3451. 622.42 s [vector] findIndex: OK
  3452. 622.42 s [vector] +++ OK, passed 100 tests.
  3453. 622.42 s [vector] findIndexR: OK
  3454. 622.43 s [vector] +++ OK, passed 100 tests.
  3455. 622.43 s [vector] findIndices: OK
  3456. 622.43 s [vector] +++ OK, passed 100 tests.
  3457. 622.43 s [vector] elemIndex: OK
  3458. 622.43 s [vector] +++ OK, passed 100 tests.
  3459. 622.44 s [vector] elemIndices: OK
  3460. 622.44 s [vector] +++ OK, passed 100 tests.
  3461. 622.44 s [vector] foldl: OK
  3462. 622.44 s [vector] +++ OK, passed 100 tests.
  3463. 622.44 s [vector] foldl1: OK
  3464. 622.44 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3465. 622.45 s [vector] foldl': OK
  3466. 622.45 s [vector] +++ OK, passed 100 tests.
  3467. 622.45 s [vector] foldl1': OK
  3468. 622.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3469. 622.46 s [vector] foldr: OK
  3470. 622.47 s [vector] +++ OK, passed 100 tests.
  3471. 622.47 s [vector] foldr1: OK
  3472. 622.48 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3473. 622.48 s [vector] foldr': OK
  3474. 622.48 s [vector] +++ OK, passed 100 tests.
  3475. 622.48 s [vector] foldr1': OK
  3476. 622.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3477. 622.49 s [vector] ifoldl: OK
  3478. 622.50 s [vector] +++ OK, passed 100 tests.
  3479. 622.51 s [vector] ifoldl': OK (0.01s)
  3480. 622.51 s [vector] +++ OK, passed 100 tests.
  3481. 622.52 s [vector] ifoldr: OK
  3482. 622.52 s [vector] +++ OK, passed 100 tests.
  3483. 622.52 s [vector] ifoldr': OK
  3484. 622.52 s [vector] +++ OK, passed 100 tests.
  3485. 622.53 s [vector] ifoldM: OK
  3486. 622.53 s [vector] +++ OK, passed 100 tests.
  3487. 622.54 s [vector] ifoldM': OK
  3488. 622.54 s [vector] +++ OK, passed 100 tests.
  3489. 622.60 s [vector] ifoldM_: OK (0.05s)
  3490. 622.60 s [vector] +++ OK, passed 100 tests.
  3491. 622.69 s [vector] ifoldM'_: OK (0.10s)
  3492. 622.69 s [vector] +++ OK, passed 100 tests.
  3493. 622.69 s [vector] all: OK
  3494. 622.69 s [vector] +++ OK, passed 100 tests.
  3495. 622.70 s [vector] any: OK
  3496. 622.70 s [vector] +++ OK, passed 100 tests.
  3497. 622.71 s [vector] prescanl: OK
  3498. 622.71 s [vector] +++ OK, passed 100 tests.
  3499. 622.71 s [vector] prescanl': OK (0.01s)
  3500. 622.71 s [vector] +++ OK, passed 100 tests.
  3501. 622.74 s [vector] postscanl: OK
  3502. 622.74 s [vector] +++ OK, passed 100 tests.
  3503. 622.74 s [vector] postscanl': OK (0.01s)
  3504. 622.74 s [vector] +++ OK, passed 100 tests.
  3505. 622.76 s [vector] scanl: OK (0.01s)
  3506. 622.76 s [vector] +++ OK, passed 100 tests.
  3507. 622.77 s [vector] scanl': OK (0.01s)
  3508. 622.77 s [vector] +++ OK, passed 100 tests.
  3509. 622.78 s [vector] scanl1: OK
  3510. 622.79 s [vector] +++ OK, passed 100 tests.
  3511. 622.80 s [vector] scanl1': OK (0.01s)
  3512. 622.80 s [vector] +++ OK, passed 100 tests.
  3513. 622.82 s [vector] iscanl: OK (0.02s)
  3514. 622.82 s [vector] +++ OK, passed 100 tests.
  3515. 622.83 s [vector] iscanl': OK (0.01s)
  3516. 622.83 s [vector] +++ OK, passed 100 tests.
  3517. 622.84 s [vector] prescanr: OK
  3518. 622.84 s [vector] +++ OK, passed 100 tests.
  3519. 622.84 s [vector] prescanr': OK
  3520. 622.84 s [vector] +++ OK, passed 100 tests.
  3521. 622.87 s [vector] postscanr: OK (0.01s)
  3522. 622.87 s [vector] +++ OK, passed 100 tests.
  3523. 622.87 s [vector] postscanr': OK (0.01s)
  3524. 622.87 s [vector] +++ OK, passed 100 tests.
  3525. 622.88 s [vector] scanr: OK (0.01s)
  3526. 622.88 s [vector] +++ OK, passed 100 tests.
  3527. 622.90 s [vector] scanr': OK (0.02s)
  3528. 622.90 s [vector] +++ OK, passed 100 tests.
  3529. 622.92 s [vector] scanr1: OK (0.02s)
  3530. 622.92 s [vector] +++ OK, passed 100 tests.
  3531. 622.92 s [vector] scanr1': OK (0.01s)
  3532. 622.93 s [vector] +++ OK, passed 100 tests.
  3533. 622.95 s [vector] iscanr: OK (0.02s)
  3534. 622.95 s [vector] +++ OK, passed 100 tests.
  3535. 622.96 s [vector] iscanr': OK (0.02s)
  3536. 622.96 s [vector] +++ OK, passed 100 tests.
  3537. 622.98 s [vector] mut_read: OK
  3538. 622.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3539. 622.98 s [vector] mut_write: OK (0.01s)
  3540. 622.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3541. 622.99 s [vector] mut_modify: OK
  3542. 622.99 s [vector] +++ OK, passed 100 tests; 23 discarded.
  3543. 623.01 s [vector] mut_generate: OK
  3544. 623.01 s [vector] +++ OK, passed 100 tests.
  3545. 623.05 s [vector] mut_generateM: OK (0.04s)
  3546. 623.05 s [vector] +++ OK, passed 100 tests.
  3547. 623.07 s [vector] mut_mapM_: OK (0.03s)
  3548. 623.07 s [vector] +++ OK, passed 100 tests.
  3549. 623.11 s [vector] mut_imapM_: OK (0.04s)
  3550. 623.11 s [vector] +++ OK, passed 100 tests.
  3551. 623.15 s [vector] mut_forM_: OK (0.03s)
  3552. 623.15 s [vector] +++ OK, passed 100 tests.
  3553. 623.16 s [vector] mut_iforM_: OK (0.03s)
  3554. 623.16 s [vector] +++ OK, passed 100 tests.
  3555. 623.16 s [vector] mut_foldr: OK
  3556. 623.16 s [vector] +++ OK, passed 100 tests.
  3557. 623.17 s [vector] mut_foldr': OK
  3558. 623.17 s [vector] +++ OK, passed 100 tests.
  3559. 623.17 s [vector] mut_foldl: OK
  3560. 623.17 s [vector] +++ OK, passed 100 tests.
  3561. 623.20 s [vector] mut_foldl': OK
  3562. 623.20 s [vector] +++ OK, passed 100 tests.
  3563. 623.20 s [vector] mut_ifoldr: OK (0.03s)
  3564. 623.20 s [vector] +++ OK, passed 100 tests.
  3565. 623.22 s [vector] mut_ifoldr': OK
  3566. 623.22 s [vector] +++ OK, passed 100 tests.
  3567. 623.22 s [vector] mut_ifoldl: OK
  3568. 623.22 s [vector] +++ OK, passed 100 tests.
  3569. 623.24 s [vector] mut_ifoldl': OK
  3570. 623.24 s [vector] +++ OK, passed 100 tests.
  3571. 623.24 s [vector] mut_foldM: OK (0.01s)
  3572. 623.24 s [vector] +++ OK, passed 100 tests.
  3573. 623.24 s [vector] mut_foldM': OK
  3574. 623.25 s [vector] +++ OK, passed 100 tests.
  3575. 623.25 s [vector] mut_foldrM: OK
  3576. 623.26 s [vector] +++ OK, passed 100 tests.
  3577. 623.26 s [vector] mut_foldrM': OK
  3578. 623.26 s [vector] +++ OK, passed 100 tests.
  3579. 623.28 s [vector] mut_ifoldM: OK (0.01s)
  3580. 623.28 s [vector] +++ OK, passed 100 tests.
  3581. 623.28 s [vector] mut_ifoldM': OK
  3582. 623.28 s [vector] +++ OK, passed 100 tests.
  3583. 623.29 s [vector] mut_ifoldrM: OK
  3584. 623.29 s [vector] +++ OK, passed 100 tests.
  3585. 623.29 s [vector] mut_ifoldrM': OK
  3586. 623.29 s [vector] +++ OK, passed 100 tests.
  3587. 623.29 s [vector] compare: OK
  3588. 623.29 s [vector] +++ OK, passed 100 tests.
  3589. 623.29 s [vector] maximum: OK
  3590. 623.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3591. 623.30 s [vector] minimum: OK
  3592. 623.30 s [vector] +++ OK, passed 100 tests; 23 discarded.
  3593. 623.30 s [vector] minIndex: OK
  3594. 623.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3595. 623.30 s [vector] maxIndex: OK
  3596. 623.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3597. 623.30 s [vector] maximumBy: OK
  3598. 623.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3599. 623.30 s [vector] minimumBy: OK
  3600. 623.30 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3601. 623.30 s [vector] maximumOn: OK
  3602. 623.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3603. 623.30 s [vector] minimumOn: OK
  3604. 623.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3605. 623.30 s [vector] maxIndexBy: OK
  3606. 623.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3607. 623.30 s [vector] minIndexBy: OK
  3608. 623.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3609. 623.30 s [vector] ListFirstMaxIndexWins: OK
  3610. 623.30 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3611. 623.31 s [vector] FalseListFirstMaxIndexWins: OK
  3612. 623.31 s [vector] +++ OK, failed as expected. (after 1 test):
  3613. 623.31 s [vector] Exception:
  3614. 623.31 s [vector] Prelude.foldr1: empty list
  3615. 623.31 s [vector] CallStack (from HasCallStack):
  3616. 623.31 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3617. 623.31 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3618. 623.31 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3619. 623.31 s [vector] []
  3620. 623.31 s [vector] mempty: OK
  3621. 623.31 s [vector] +++ OK, passed 100 tests.
  3622. 623.31 s [vector] mappend: OK
  3623. 623.31 s [vector] +++ OK, passed 100 tests.
  3624. 623.34 s [vector] mconcat: OK
  3625. 623.34 s [vector] +++ OK, passed 100 tests.
  3626. 623.34 s [vector] glength: OK
  3627. 623.34 s [vector] +++ OK, passed 100 tests.
  3628. 623.34 s [vector] sum: OK
  3629. 623.34 s [vector] +++ OK, passed 100 tests.
  3630. 623.34 s [vector] product: OK
  3631. 623.34 s [vector] +++ OK, passed 100 tests.
  3632. 623.34 s [vector] enumFromN: OK
  3633. 623.34 s [vector] +++ OK, passed 100 tests.
  3634. 623.34 s [vector] enumFromThenN: OK
  3635. 623.34 s [vector] +++ OK, passed 100 tests.
  3636. 623.34 s [vector] enumFromTo: OK
  3637. 623.34 s [vector] +++ OK, passed 100 tests.
  3638. 623.34 s [vector] enumFromThenTo: OK
  3639. 623.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3640. 623.34 s [vector] Double
  3641. 623.35 s [vector] fromList.toList == id: OK
  3642. 623.35 s [vector] +++ OK, passed 100 tests.
  3643. 623.35 s [vector] toList.fromList == id: OK
  3644. 623.35 s [vector] +++ OK, passed 100 tests.
  3645. 623.35 s [vector] unstream.stream == id: OK
  3646. 623.35 s [vector] +++ OK, passed 100 tests.
  3647. 623.35 s [vector] stream.unstream == id: OK
  3648. 623.35 s [vector] +++ OK, passed 100 tests.
  3649. 623.35 s [vector] eq: OK
  3650. 623.35 s [vector] +++ OK, passed 100 tests.
  3651. 623.35 s [vector] length: OK
  3652. 623.35 s [vector] +++ OK, passed 100 tests.
  3653. 623.36 s [vector] null: OK
  3654. 623.36 s [vector] +++ OK, passed 100 tests.
  3655. 623.36 s [vector] index: OK
  3656. 623.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3657. 623.36 s [vector] safeIndex: OK
  3658. 623.36 s [vector] +++ OK, passed 100 tests.
  3659. 623.36 s [vector] head: OK
  3660. 623.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3661. 623.36 s [vector] last: OK
  3662. 623.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3663. 623.36 s [vector] unsafeIndex: OK
  3664. 623.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3665. 623.36 s [vector] unsafeHead: OK
  3666. 623.36 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3667. 623.36 s [vector] unsafeLast: OK
  3668. 623.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3669. 623.37 s [vector] slice: OK
  3670. 623.37 s [vector] +++ OK, passed 100 tests.
  3671. 623.37 s [vector] init: OK
  3672. 623.37 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3673. 623.37 s [vector] tail: OK
  3674. 623.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3675. 623.37 s [vector] take: OK
  3676. 623.37 s [vector] +++ OK, passed 100 tests.
  3677. 623.37 s [vector] drop: OK
  3678. 623.37 s [vector] +++ OK, passed 100 tests.
  3679. 623.37 s [vector] splitAt: OK
  3680. 623.37 s [vector] +++ OK, passed 100 tests.
  3681. 623.37 s [vector] empty: OK
  3682. 623.37 s [vector] +++ OK, passed 100 tests.
  3683. 623.37 s [vector] singleton: OK
  3684. 623.37 s [vector] +++ OK, passed 100 tests.
  3685. 623.38 s [vector] replicate: OK
  3686. 623.38 s [vector] +++ OK, passed 100 tests.
  3687. 623.38 s [vector] generate: OK
  3688. 623.38 s [vector] +++ OK, passed 100 tests.
  3689. 623.38 s [vector] iterateN: OK
  3690. 623.40 s [vector] +++ OK, passed 100 tests.
  3691. 623.46 s [vector] iterateNM: OK (0.08s)
  3692. 623.46 s [vector] +++ OK, passed 100 tests.
  3693. 623.50 s [vector] generateM: OK (0.03s)
  3694. 623.50 s [vector] +++ OK, passed 100 tests.
  3695. 623.50 s [vector] replicateM: OK (0.01s)
  3696. 623.50 s [vector] +++ OK, passed 100 tests.
  3697. 623.51 s [vector] create: OK
  3698. 623.51 s [vector] +++ OK, passed 100 tests.
  3699. 623.51 s [vector] createT: OK
  3700. 623.51 s [vector] +++ OK, passed 100 tests.
  3701. 623.51 s [vector] unfoldr: OK
  3702. 623.51 s [vector] +++ OK, passed 100 tests.
  3703. 623.51 s [vector] unfoldrN: OK
  3704. 623.51 s [vector] +++ OK, passed 100 tests.
  3705. 623.51 s [vector] unfoldrExactN: OK
  3706. 623.51 s [vector] +++ OK, passed 100 tests.
  3707. 623.51 s [vector] unfoldrM: OK
  3708. 623.52 s [vector] +++ OK, passed 100 tests.
  3709. 623.52 s [vector] unfoldrNM: OK
  3710. 623.52 s [vector] +++ OK, passed 100 tests.
  3711. 623.64 s [vector] unfoldrExactNM: OK (0.11s)
  3712. 623.64 s [vector] +++ OK, passed 100 tests.
  3713. 623.66 s [vector] constructN: OK (0.03s)
  3714. 623.66 s [vector] +++ OK, passed 100 tests.
  3715. 623.70 s [vector] constructrN: OK (0.04s)
  3716. 623.70 s [vector] +++ OK, passed 100 tests.
  3717. 623.70 s [vector] cons: OK
  3718. 623.70 s [vector] +++ OK, passed 100 tests.
  3719. 623.70 s [vector] snoc: OK
  3720. 623.70 s [vector] +++ OK, passed 100 tests.
  3721. 623.72 s [vector] append: OK
  3722. 623.72 s [vector] +++ OK, passed 100 tests.
  3723. 623.77 s [vector] concat: OK (0.06s)
  3724. 623.77 s [vector] +++ OK, passed 100 tests.
  3725. 623.77 s [vector] force: OK
  3726. 623.77 s [vector] +++ OK, passed 100 tests.
  3727. 623.78 s [vector] upd: OK
  3728. 623.78 s [vector] +++ OK, passed 100 tests.
  3729. 623.81 s [vector] accum: OK (0.03s)
  3730. 623.81 s [vector] +++ OK, passed 100 tests.
  3731. 623.81 s [vector] reverse: OK
  3732. 623.81 s [vector] +++ OK, passed 100 tests.
  3733. 623.81 s [vector] backpermute: OK
  3734. 623.82 s [vector] +++ OK, passed 100 tests.
  3735. 623.83 s [vector] map: OK (0.01s)
  3736. 623.83 s [vector] +++ OK, passed 100 tests.
  3737. 623.85 s [vector] imap: OK
  3738. 623.86 s [vector] +++ OK, passed 100 tests.
  3739. 623.86 s [vector] concatMap: OK (0.02s)
  3740. 623.86 s [vector] +++ OK, passed 100 tests.
  3741. 623.88 s [vector] mapM: OK (0.02s)
  3742. 623.88 s [vector] +++ OK, passed 100 tests.
  3743. 624.02 s [vector] mapM_: OK (0.13s)
  3744. 624.02 s [vector] +++ OK, passed 100 tests.
  3745. 624.04 s [vector] forM: OK (0.01s)
  3746. 624.04 s [vector] +++ OK, passed 100 tests.
  3747. 624.12 s [vector] forM_: OK (0.09s)
  3748. 624.12 s [vector] +++ OK, passed 100 tests.
  3749. 624.14 s [vector] imapM: OK (0.02s)
  3750. 624.14 s [vector] +++ OK, passed 100 tests.
  3751. 624.20 s [vector] imapM_: OK (0.06s)
  3752. 624.20 s [vector] +++ OK, passed 100 tests.
  3753. 624.22 s [vector] zipWith: OK (0.01s)
  3754. 624.22 s [vector] +++ OK, passed 100 tests.
  3755. 624.24 s [vector] zipWith3: OK (0.01s)
  3756. 624.24 s [vector] +++ OK, passed 100 tests.
  3757. 624.24 s [vector] izipWith: OK (0.01s)
  3758. 624.24 s [vector] +++ OK, passed 100 tests.
  3759. 624.26 s [vector] izipWith3: OK (0.02s)
  3760. 624.26 s [vector] +++ OK, passed 100 tests.
  3761. 624.28 s [vector] izipWithM: OK (0.02s)
  3762. 624.28 s [vector] +++ OK, passed 100 tests.
  3763. 624.34 s [vector] izipWithM_: OK (0.05s)
  3764. 624.34 s [vector] +++ OK, passed 100 tests.
  3765. 624.34 s [vector] zipWithM: OK (0.02s)
  3766. 624.34 s [vector] +++ OK, passed 100 tests.
  3767. 624.42 s [vector] zipWithM_: OK (0.06s)
  3768. 624.42 s [vector] +++ OK, passed 100 tests.
  3769. 624.42 s [vector] filter: OK (0.01s)
  3770. 624.42 s [vector] +++ OK, passed 100 tests.
  3771. 624.44 s [vector] ifilter: OK (0.02s)
  3772. 624.44 s [vector] +++ OK, passed 100 tests.
  3773. 624.56 s [vector] filterM: OK (0.12s)
  3774. 624.56 s [vector] +++ OK, passed 100 tests.
  3775. 624.56 s [vector] uniq: OK
  3776. 624.56 s [vector] +++ OK, passed 100 tests.
  3777. 624.58 s [vector] mapMaybe: OK (0.02s)
  3778. 624.58 s [vector] +++ OK, passed 100 tests.
  3779. 624.61 s [vector] imapMaybe: OK (0.02s)
  3780. 624.61 s [vector] +++ OK, passed 100 tests.
  3781. 624.61 s [vector] takeWhile: OK
  3782. 624.61 s [vector] +++ OK, passed 100 tests.
  3783. 624.61 s [vector] dropWhile: OK
  3784. 624.61 s [vector] +++ OK, passed 100 tests.
  3785. 624.64 s [vector] partition: OK
  3786. 624.64 s [vector] +++ OK, passed 100 tests.
  3787. 624.65 s [vector] partitionWith: OK (0.02s)
  3788. 624.65 s [vector] +++ OK, passed 100 tests.
  3789. 624.66 s [vector] span: OK
  3790. 624.66 s [vector] +++ OK, passed 100 tests.
  3791. 624.66 s [vector] break: OK
  3792. 624.66 s [vector] +++ OK, passed 100 tests.
  3793. 624.66 s [vector] spanR: OK
  3794. 624.66 s [vector] +++ OK, passed 100 tests.
  3795. 624.66 s [vector] breakR: OK
  3796. 624.66 s [vector] +++ OK, passed 100 tests.
  3797. 624.68 s [vector] groupBy: OK
  3798. 624.68 s [vector] +++ OK, passed 100 tests.
  3799. 624.68 s [vector] elem: OK
  3800. 624.69 s [vector] +++ OK, passed 100 tests.
  3801. 624.69 s [vector] notElem: OK
  3802. 624.69 s [vector] +++ OK, passed 100 tests.
  3803. 624.69 s [vector] find: OK
  3804. 624.69 s [vector] +++ OK, passed 100 tests.
  3805. 624.69 s [vector] findIndex: OK
  3806. 624.69 s [vector] +++ OK, passed 100 tests.
  3807. 624.70 s [vector] findIndexR: OK
  3808. 624.70 s [vector] +++ OK, passed 100 tests.
  3809. 624.70 s [vector] findIndices: OK
  3810. 624.70 s [vector] +++ OK, passed 100 tests.
  3811. 624.70 s [vector] elemIndex: OK
  3812. 624.70 s [vector] +++ OK, passed 100 tests.
  3813. 624.70 s [vector] elemIndices: OK
  3814. 624.72 s [vector] +++ OK, passed 100 tests.
  3815. 624.72 s [vector] foldl: OK (0.01s)
  3816. 624.72 s [vector] +++ OK, passed 100 tests.
  3817. 624.73 s [vector] foldl1: OK (0.01s)
  3818. 624.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3819. 624.76 s [vector] foldl': OK (0.02s)
  3820. 624.76 s [vector] +++ OK, passed 100 tests.
  3821. 624.78 s [vector] foldl1': OK (0.02s)
  3822. 624.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3823. 624.80 s [vector] foldr: OK (0.02s)
  3824. 624.80 s [vector] +++ OK, passed 100 tests.
  3825. 624.80 s [vector] foldr1: OK (0.01s)
  3826. 624.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3827. 624.82 s [vector] foldr': OK (0.02s)
  3828. 624.82 s [vector] +++ OK, passed 100 tests.
  3829. 624.84 s [vector] foldr1': OK (0.02s)
  3830. 624.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3831. 624.86 s [vector] ifoldl: OK (0.02s)
  3832. 624.86 s [vector] +++ OK, passed 100 tests.
  3833. 624.88 s [vector] ifoldl': OK (0.02s)
  3834. 624.88 s [vector] +++ OK, passed 100 tests.
  3835. 624.90 s [vector] ifoldr: OK (0.01s)
  3836. 624.90 s [vector] +++ OK, passed 100 tests.
  3837. 624.92 s [vector] ifoldr': OK (0.01s)
  3838. 624.92 s [vector] +++ OK, passed 100 tests.
  3839. 624.92 s [vector] ifoldM: OK (0.02s)
  3840. 624.92 s [vector] +++ OK, passed 100 tests.
  3841. 624.94 s [vector] ifoldM': OK (0.02s)
  3842. 624.94 s [vector] +++ OK, passed 100 tests.
  3843. 624.98 s [vector] ifoldM_: OK (0.04s)
  3844. 624.98 s [vector] +++ OK, passed 100 tests.
  3845. 625.02 s [vector] ifoldM'_: OK (0.04s)
  3846. 625.02 s [vector] +++ OK, passed 100 tests.
  3847. 625.02 s [vector] all: OK
  3848. 625.02 s [vector] +++ OK, passed 100 tests.
  3849. 625.02 s [vector] any: OK
  3850. 625.04 s [vector] +++ OK, passed 100 tests.
  3851. 625.06 s [vector] prescanl: OK (0.02s)
  3852. 625.06 s [vector] +++ OK, passed 100 tests.
  3853. 625.08 s [vector] prescanl': OK (0.03s)
  3854. 625.08 s [vector] +++ OK, passed 100 tests.
  3855. 625.10 s [vector] postscanl: OK (0.02s)
  3856. 625.10 s [vector] +++ OK, passed 100 tests.
  3857. 625.13 s [vector] postscanl': OK (0.02s)
  3858. 625.13 s [vector] +++ OK, passed 100 tests.
  3859. 625.16 s [vector] scanl: OK (0.02s)
  3860. 625.16 s [vector] +++ OK, passed 100 tests.
  3861. 625.18 s [vector] scanl': OK (0.02s)
  3862. 625.18 s [vector] +++ OK, passed 100 tests.
  3863. 625.20 s [vector] scanl1: OK (0.02s)
  3864. 625.20 s [vector] +++ OK, passed 100 tests.
  3865. 625.20 s [vector] scanl1': OK (0.01s)
  3866. 625.20 s [vector] +++ OK, passed 100 tests.
  3867. 625.22 s [vector] iscanl: OK (0.02s)
  3868. 625.22 s [vector] +++ OK, passed 100 tests.
  3869. 625.24 s [vector] iscanl': OK (0.02s)
  3870. 625.24 s [vector] +++ OK, passed 100 tests.
  3871. 625.26 s [vector] prescanr: OK (0.02s)
  3872. 625.26 s [vector] +++ OK, passed 100 tests.
  3873. 625.27 s [vector] prescanr': OK (0.02s)
  3874. 625.27 s [vector] +++ OK, passed 100 tests.
  3875. 625.30 s [vector] postscanr: OK (0.02s)
  3876. 625.30 s [vector] +++ OK, passed 100 tests.
  3877. 625.34 s [vector] postscanr': OK (0.03s)
  3878. 625.34 s [vector] +++ OK, passed 100 tests.
  3879. 625.36 s [vector] scanr: OK (0.03s)
  3880. 625.36 s [vector] +++ OK, passed 100 tests.
  3881. 625.40 s [vector] scanr': OK (0.04s)
  3882. 625.40 s [vector] +++ OK, passed 100 tests.
  3883. 625.44 s [vector] scanr1: OK (0.04s)
  3884. 625.44 s [vector] +++ OK, passed 100 tests.
  3885. 625.48 s [vector] scanr1': OK (0.04s)
  3886. 625.48 s [vector] +++ OK, passed 100 tests.
  3887. 625.52 s [vector] iscanr: OK (0.04s)
  3888. 625.52 s [vector] +++ OK, passed 100 tests.
  3889. 625.56 s [vector] iscanr': OK (0.04s)
  3890. 625.56 s [vector] +++ OK, passed 100 tests.
  3891. 625.56 s [vector] mut_read: OK
  3892. 625.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3893. 625.56 s [vector] mut_write: OK
  3894. 625.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3895. 625.57 s [vector] mut_modify: OK
  3896. 625.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3897. 625.57 s [vector] mut_generate: OK
  3898. 625.57 s [vector] +++ OK, passed 100 tests.
  3899. 625.62 s [vector] mut_generateM: OK (0.04s)
  3900. 625.62 s [vector] +++ OK, passed 100 tests.
  3901. 625.69 s [vector] mut_mapM_: OK (0.07s)
  3902. 625.69 s [vector] +++ OK, passed 100 tests.
  3903. 625.78 s [vector] mut_imapM_: OK (0.07s)
  3904. 625.78 s [vector] +++ OK, passed 100 tests.
  3905. 625.84 s [vector] mut_forM_: OK (0.06s)
  3906. 625.85 s [vector] +++ OK, passed 100 tests.
  3907. 625.90 s [vector] mut_iforM_: OK (0.07s)
  3908. 625.90 s [vector] +++ OK, passed 100 tests.
  3909. 625.92 s [vector] mut_foldr: OK (0.03s)
  3910. 625.92 s [vector] +++ OK, passed 100 tests.
  3911. 625.96 s [vector] mut_foldr': OK (0.04s)
  3912. 625.97 s [vector] +++ OK, passed 100 tests.
  3913. 626.01 s [vector] mut_foldl: OK (0.03s)
  3914. 626.01 s [vector] +++ OK, passed 100 tests.
  3915. 626.02 s [vector] mut_foldl': OK (0.03s)
  3916. 626.02 s [vector] +++ OK, passed 100 tests.
  3917. 626.06 s [vector] mut_ifoldr: OK (0.04s)
  3918. 626.06 s [vector] +++ OK, passed 100 tests.
  3919. 626.10 s [vector] mut_ifoldr': OK (0.03s)
  3920. 626.10 s [vector] +++ OK, passed 100 tests.
  3921. 626.12 s [vector] mut_ifoldl: OK (0.03s)
  3922. 626.12 s [vector] +++ OK, passed 100 tests.
  3923. 626.18 s [vector] mut_ifoldl': OK (0.03s)
  3924. 626.18 s [vector] +++ OK, passed 100 tests.
  3925. 626.18 s [vector] mut_foldM: OK (0.02s)
  3926. 626.18 s [vector] +++ OK, passed 100 tests.
  3927. 626.20 s [vector] mut_foldM': OK (0.03s)
  3928. 626.20 s [vector] +++ OK, passed 100 tests.
  3929. 626.22 s [vector] mut_foldrM: OK (0.02s)
  3930. 626.22 s [vector] +++ OK, passed 100 tests.
  3931. 626.23 s [vector] mut_foldrM': OK (0.02s)
  3932. 626.23 s [vector] +++ OK, passed 100 tests.
  3933. 626.28 s [vector] mut_ifoldM: OK (0.02s)
  3934. 626.37 s [vector] +++ OK, passed 100 tests.
  3935. 626.37 s [vector] mut_ifoldM': OK (0.04s)
  3936. 626.37 s [vector] +++ OK, passed 100 tests.
  3937. 626.37 s [vector] mut_ifoldrM: OK (0.03s)
  3938. 626.37 s [vector] +++ OK, passed 100 tests.
  3939. 626.37 s [vector] mut_ifoldrM': OK (0.03s)
  3940. 626.37 s [vector] +++ OK, passed 100 tests.
  3941. 626.37 s [vector] compare: OK
  3942. 626.37 s [vector] +++ OK, passed 100 tests.
  3943. 626.38 s [vector] maximum: OK
  3944. 626.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3945. 626.38 s [vector] minimum: OK
  3946. 626.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3947. 626.38 s [vector] minIndex: OK
  3948. 626.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3949. 626.38 s [vector] maxIndex: OK
  3950. 626.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3951. 626.39 s [vector] maximumBy: OK
  3952. 626.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3953. 626.39 s [vector] minimumBy: OK
  3954. 626.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3955. 626.40 s [vector] maximumOn: OK
  3956. 626.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3957. 626.40 s [vector] minimumOn: OK
  3958. 626.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3959. 626.40 s [vector] maxIndexBy: OK
  3960. 626.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3961. 626.41 s [vector] minIndexBy: OK
  3962. 626.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3963. 626.41 s [vector] ListFirstMaxIndexWins: OK
  3964. 626.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3965. 626.41 s [vector] FalseListFirstMaxIndexWins: OK
  3966. 626.41 s [vector] +++ OK, failed as expected. (after 1 test):
  3967. 626.41 s [vector] Exception:
  3968. 626.41 s [vector] Prelude.foldr1: empty list
  3969. 626.41 s [vector] CallStack (from HasCallStack):
  3970. 626.41 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3971. 626.41 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3972. 626.41 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3973. 626.41 s [vector] []
  3974. 626.42 s [vector] mempty: OK
  3975. 626.42 s [vector] +++ OK, passed 100 tests.
  3976. 626.42 s [vector] mappend: OK
  3977. 626.42 s [vector] +++ OK, passed 100 tests.
  3978. 626.48 s [vector] mconcat: OK (0.07s)
  3979. 626.48 s [vector] +++ OK, passed 100 tests.
  3980. 626.49 s [vector] glength: OK
  3981. 626.49 s [vector] +++ OK, passed 100 tests.
  3982. 626.49 s [vector] sum: OK
  3983. 626.49 s [vector] +++ OK, passed 100 tests.
  3984. 626.49 s [vector] product: OK
  3985. 626.49 s [vector] +++ OK, passed 100 tests.
  3986. 626.49 s [vector] enumFromN: OK
  3987. 626.49 s [vector] +++ OK, passed 100 tests.
  3988. 626.49 s [vector] enumFromThenN: OK
  3989. 626.49 s [vector] +++ OK, passed 100 tests.
  3990. 626.50 s [vector] enumFromTo: OK
  3991. 626.50 s [vector] +++ OK, passed 100 tests.
  3992. 626.50 s [vector] enumFromThenTo: OK
  3993. 626.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3994. 626.51 s [vector] unstream
  3995. 626.51 s [vector] unstream == vunstream (exact): OK
  3996. 626.51 s [vector] +++ OK, passed 100 tests.
  3997. 626.51 s [vector] unstream == vunstream (unknown): OK
  3998. 626.51 s [vector] +++ OK, passed 100 tests.
  3999. 626.51 s [vector] unstreamR ~= vunstream (exact): OK
  4000. 626.51 s [vector] +++ OK, passed 100 tests.
  4001. 626.51 s [vector] unstreamR ~= vunstream (unknown): OK
  4002. 626.51 s [vector] +++ OK, passed 100 tests.
  4003. 626.52 s [vector] Tests.Vector.Storable
  4004. 626.52 s [vector] Data.Vector.Storable.Vector (Int)
  4005. 626.52 s [vector] fromList.toList == id: OK
  4006. 626.52 s [vector] +++ OK, passed 100 tests.
  4007. 626.52 s [vector] toList.fromList == id: OK
  4008. 626.52 s [vector] +++ OK, passed 100 tests.
  4009. 626.52 s [vector] unstream.stream == id: OK
  4010. 626.52 s [vector] +++ OK, passed 100 tests.
  4011. 626.52 s [vector] stream.unstream == id: OK
  4012. 626.52 s [vector] +++ OK, passed 100 tests.
  4013. 626.52 s [vector] eq: OK
  4014. 626.52 s [vector] +++ OK, passed 100 tests.
  4015. 626.52 s [vector] length: OK
  4016. 626.52 s [vector] +++ OK, passed 100 tests.
  4017. 626.52 s [vector] null: OK
  4018. 626.52 s [vector] +++ OK, passed 100 tests.
  4019. 626.53 s [vector] index: OK
  4020. 626.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4021. 626.53 s [vector] safeIndex: OK
  4022. 626.53 s [vector] +++ OK, passed 100 tests.
  4023. 626.53 s [vector] head: OK
  4024. 626.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4025. 626.53 s [vector] last: OK
  4026. 626.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4027. 626.53 s [vector] unsafeIndex: OK
  4028. 626.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4029. 626.53 s [vector] unsafeHead: OK
  4030. 626.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4031. 626.53 s [vector] unsafeLast: OK
  4032. 626.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4033. 626.54 s [vector] slice: OK
  4034. 626.54 s [vector] +++ OK, passed 100 tests.
  4035. 626.54 s [vector] init: OK
  4036. 626.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4037. 626.54 s [vector] tail: OK
  4038. 626.54 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4039. 626.54 s [vector] take: OK
  4040. 626.54 s [vector] +++ OK, passed 100 tests.
  4041. 626.55 s [vector] drop: OK
  4042. 626.55 s [vector] +++ OK, passed 100 tests.
  4043. 626.55 s [vector] splitAt: OK
  4044. 626.55 s [vector] +++ OK, passed 100 tests.
  4045. 626.55 s [vector] empty: OK
  4046. 626.55 s [vector] +++ OK, passed 100 tests.
  4047. 626.55 s [vector] singleton: OK
  4048. 626.55 s [vector] +++ OK, passed 100 tests.
  4049. 626.55 s [vector] replicate: OK
  4050. 626.55 s [vector] +++ OK, passed 100 tests.
  4051. 626.55 s [vector] generate: OK
  4052. 626.55 s [vector] +++ OK, passed 100 tests.
  4053. 626.55 s [vector] iterateN: OK
  4054. 626.56 s [vector] +++ OK, passed 100 tests.
  4055. 626.64 s [vector] iterateNM: OK (0.09s)
  4056. 626.64 s [vector] +++ OK, passed 100 tests.
  4057. 626.68 s [vector] generateM: OK (0.03s)
  4058. 626.68 s [vector] +++ OK, passed 100 tests.
  4059. 626.69 s [vector] replicateM: OK (0.02s)
  4060. 626.69 s [vector] +++ OK, passed 100 tests.
  4061. 626.69 s [vector] create: OK
  4062. 626.69 s [vector] +++ OK, passed 100 tests.
  4063. 626.69 s [vector] createT: OK
  4064. 626.69 s [vector] +++ OK, passed 100 tests.
  4065. 626.69 s [vector] unfoldr: OK
  4066. 626.69 s [vector] +++ OK, passed 100 tests.
  4067. 626.69 s [vector] unfoldrN: OK
  4068. 626.69 s [vector] +++ OK, passed 100 tests.
  4069. 626.69 s [vector] unfoldrExactN: OK
  4070. 626.70 s [vector] +++ OK, passed 100 tests.
  4071. 626.70 s [vector] unfoldrM: OK
  4072. 626.70 s [vector] +++ OK, passed 100 tests.
  4073. 626.72 s [vector] unfoldrNM: OK
  4074. 626.72 s [vector] +++ OK, passed 100 tests.
  4075. 626.94 s [vector] unfoldrExactNM: OK (0.22s)
  4076. 626.94 s [vector] +++ OK, passed 100 tests.
  4077. 626.94 s [vector] constructN: OK
  4078. 626.94 s [vector] +++ OK, passed 100 tests.
  4079. 626.94 s [vector] constructrN: OK
  4080. 626.94 s [vector] +++ OK, passed 100 tests.
  4081. 626.95 s [vector] cons: OK
  4082. 626.95 s [vector] +++ OK, passed 100 tests.
  4083. 626.95 s [vector] snoc: OK
  4084. 626.95 s [vector] +++ OK, passed 100 tests.
  4085. 626.96 s [vector] append: OK
  4086. 626.96 s [vector] +++ OK, passed 100 tests.
  4087. 626.99 s [vector] concat: OK (0.04s)
  4088. 626.99 s [vector] +++ OK, passed 100 tests.
  4089. 626.99 s [vector] force: OK
  4090. 627.00 s [vector] +++ OK, passed 100 tests.
  4091. 627.00 s [vector] upd: OK
  4092. 627.00 s [vector] +++ OK, passed 100 tests.
  4093. 627.01 s [vector] accum: OK
  4094. 627.01 s [vector] +++ OK, passed 100 tests.
  4095. 627.01 s [vector] reverse: OK
  4096. 627.01 s [vector] +++ OK, passed 100 tests.
  4097. 627.02 s [vector] backpermute: OK
  4098. 627.02 s [vector] +++ OK, passed 100 tests.
  4099. 627.02 s [vector] map: OK
  4100. 627.02 s [vector] +++ OK, passed 100 tests.
  4101. 627.03 s [vector] imap: OK
  4102. 627.03 s [vector] +++ OK, passed 100 tests.
  4103. 627.04 s [vector] concatMap: OK
  4104. 627.04 s [vector] +++ OK, passed 100 tests.
  4105. 627.04 s [vector] mapM: OK
  4106. 627.04 s [vector] +++ OK, passed 100 tests.
  4107. 627.08 s [vector] mapM_: OK (0.04s)
  4108. 627.08 s [vector] +++ OK, passed 100 tests.
  4109. 627.08 s [vector] forM: OK
  4110. 627.08 s [vector] +++ OK, passed 100 tests.
  4111. 627.11 s [vector] forM_: OK (0.03s)
  4112. 627.12 s [vector] +++ OK, passed 100 tests.
  4113. 627.12 s [vector] imapM: OK
  4114. 627.12 s [vector] +++ OK, passed 100 tests.
  4115. 627.15 s [vector] imapM_: OK (0.03s)
  4116. 627.15 s [vector] +++ OK, passed 100 tests.
  4117. 627.15 s [vector] zipWith: OK
  4118. 627.15 s [vector] +++ OK, passed 100 tests.
  4119. 627.16 s [vector] zipWith3: OK
  4120. 627.16 s [vector] +++ OK, passed 100 tests.
  4121. 627.17 s [vector] izipWith: OK
  4122. 627.17 s [vector] +++ OK, passed 100 tests.
  4123. 627.17 s [vector] izipWith3: OK
  4124. 627.17 s [vector] +++ OK, passed 100 tests.
  4125. 627.17 s [vector] izipWithM: OK
  4126. 627.17 s [vector] +++ OK, passed 100 tests.
  4127. 627.20 s [vector] izipWithM_: OK (0.02s)
  4128. 627.20 s [vector] +++ OK, passed 100 tests.
  4129. 627.21 s [vector] zipWithM: OK
  4130. 627.22 s [vector] +++ OK, passed 100 tests.
  4131. 627.25 s [vector] zipWithM_: OK (0.04s)
  4132. 627.25 s [vector] +++ OK, passed 100 tests.
  4133. 627.25 s [vector] filter: OK
  4134. 627.25 s [vector] +++ OK, passed 100 tests.
  4135. 627.26 s [vector] ifilter: OK
  4136. 627.26 s [vector] +++ OK, passed 100 tests.
  4137. 627.28 s [vector] filterM: OK (0.03s)
  4138. 627.28 s [vector] +++ OK, passed 100 tests.
  4139. 627.28 s [vector] uniq: OK
  4140. 627.28 s [vector] +++ OK, passed 100 tests.
  4141. 627.29 s [vector] mapMaybe: OK
  4142. 627.29 s [vector] +++ OK, passed 100 tests.
  4143. 627.29 s [vector] imapMaybe: OK
  4144. 627.29 s [vector] +++ OK, passed 100 tests.
  4145. 627.29 s [vector] takeWhile: OK
  4146. 627.29 s [vector] +++ OK, passed 100 tests.
  4147. 627.29 s [vector] dropWhile: OK
  4148. 627.29 s [vector] +++ OK, passed 100 tests.
  4149. 627.29 s [vector] partition: OK
  4150. 627.30 s [vector] +++ OK, passed 100 tests.
  4151. 627.30 s [vector] partitionWith: OK
  4152. 627.30 s [vector] +++ OK, passed 100 tests.
  4153. 627.30 s [vector] span: OK
  4154. 627.30 s [vector] +++ OK, passed 100 tests.
  4155. 627.30 s [vector] break: OK
  4156. 627.31 s [vector] +++ OK, passed 100 tests.
  4157. 627.31 s [vector] spanR: OK
  4158. 627.31 s [vector] +++ OK, passed 100 tests.
  4159. 627.31 s [vector] breakR: OK
  4160. 627.31 s [vector] +++ OK, passed 100 tests.
  4161. 627.31 s [vector] groupBy: OK
  4162. 627.31 s [vector] +++ OK, passed 100 tests.
  4163. 627.31 s [vector] elem: OK
  4164. 627.31 s [vector] +++ OK, passed 100 tests.
  4165. 627.31 s [vector] notElem: OK
  4166. 627.31 s [vector] +++ OK, passed 100 tests.
  4167. 627.31 s [vector] find: OK
  4168. 627.32 s [vector] +++ OK, passed 100 tests.
  4169. 627.32 s [vector] findIndex: OK
  4170. 627.32 s [vector] +++ OK, passed 100 tests.
  4171. 627.32 s [vector] findIndexR: OK
  4172. 627.32 s [vector] +++ OK, passed 100 tests.
  4173. 627.32 s [vector] findIndices: OK
  4174. 627.32 s [vector] +++ OK, passed 100 tests.
  4175. 627.32 s [vector] elemIndex: OK
  4176. 627.32 s [vector] +++ OK, passed 100 tests.
  4177. 627.32 s [vector] elemIndices: OK
  4178. 627.33 s [vector] +++ OK, passed 100 tests.
  4179. 627.33 s [vector] foldl: OK
  4180. 627.33 s [vector] +++ OK, passed 100 tests.
  4181. 627.33 s [vector] foldl1: OK
  4182. 627.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4183. 627.34 s [vector] foldl': OK
  4184. 627.34 s [vector] +++ OK, passed 100 tests.
  4185. 627.34 s [vector] foldl1': OK
  4186. 627.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4187. 627.34 s [vector] foldr: OK
  4188. 627.35 s [vector] +++ OK, passed 100 tests.
  4189. 627.35 s [vector] foldr1: OK
  4190. 627.35 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4191. 627.36 s [vector] foldr': OK
  4192. 627.36 s [vector] +++ OK, passed 100 tests.
  4193. 627.36 s [vector] foldr1': OK
  4194. 627.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4195. 627.37 s [vector] ifoldl: OK
  4196. 627.38 s [vector] +++ OK, passed 100 tests.
  4197. 627.38 s [vector] ifoldl': OK (0.01s)
  4198. 627.39 s [vector] +++ OK, passed 100 tests.
  4199. 627.40 s [vector] ifoldr: OK (0.01s)
  4200. 627.40 s [vector] +++ OK, passed 100 tests.
  4201. 627.40 s [vector] ifoldr': OK (0.01s)
  4202. 627.40 s [vector] +++ OK, passed 100 tests.
  4203. 627.42 s [vector] ifoldM: OK (0.01s)
  4204. 627.42 s [vector] +++ OK, passed 100 tests.
  4205. 627.44 s [vector] ifoldM': OK (0.01s)
  4206. 627.44 s [vector] +++ OK, passed 100 tests.
  4207. 627.51 s [vector] ifoldM_: OK (0.07s)
  4208. 627.51 s [vector] +++ OK, passed 100 tests.
  4209. 627.53 s [vector] ifoldM'_: OK (0.04s)
  4210. 627.53 s [vector] +++ OK, passed 100 tests.
  4211. 627.53 s [vector] all: OK
  4212. 627.53 s [vector] +++ OK, passed 100 tests.
  4213. 627.53 s [vector] any: OK
  4214. 627.54 s [vector] +++ OK, passed 100 tests.
  4215. 627.54 s [vector] prescanl: OK
  4216. 627.54 s [vector] +++ OK, passed 100 tests.
  4217. 627.55 s [vector] prescanl': OK
  4218. 627.55 s [vector] +++ OK, passed 100 tests.
  4219. 627.55 s [vector] postscanl: OK
  4220. 627.56 s [vector] +++ OK, passed 100 tests.
  4221. 627.57 s [vector] postscanl': OK (0.01s)
  4222. 627.57 s [vector] +++ OK, passed 100 tests.
  4223. 627.57 s [vector] scanl: OK
  4224. 627.58 s [vector] +++ OK, passed 100 tests.
  4225. 627.58 s [vector] scanl': OK
  4226. 627.58 s [vector] +++ OK, passed 100 tests.
  4227. 627.59 s [vector] scanl1: OK
  4228. 627.59 s [vector] +++ OK, passed 100 tests.
  4229. 627.59 s [vector] scanl1': OK
  4230. 627.60 s [vector] +++ OK, passed 100 tests.
  4231. 627.60 s [vector] iscanl: OK
  4232. 627.60 s [vector] +++ OK, passed 100 tests.
  4233. 627.60 s [vector] iscanl': OK
  4234. 627.61 s [vector] +++ OK, passed 100 tests.
  4235. 627.61 s [vector] prescanr: OK
  4236. 627.62 s [vector] +++ OK, passed 100 tests.
  4237. 627.62 s [vector] prescanr': OK
  4238. 627.62 s [vector] +++ OK, passed 100 tests.
  4239. 627.62 s [vector] postscanr: OK
  4240. 627.63 s [vector] +++ OK, passed 100 tests.
  4241. 627.64 s [vector] postscanr': OK
  4242. 627.64 s [vector] +++ OK, passed 100 tests.
  4243. 627.64 s [vector] scanr: OK
  4244. 627.64 s [vector] +++ OK, passed 100 tests.
  4245. 627.64 s [vector] scanr': OK
  4246. 627.64 s [vector] +++ OK, passed 100 tests.
  4247. 627.65 s [vector] scanr1: OK
  4248. 627.65 s [vector] +++ OK, passed 100 tests.
  4249. 627.65 s [vector] scanr1': OK
  4250. 627.66 s [vector] +++ OK, passed 100 tests.
  4251. 627.66 s [vector] iscanr: OK
  4252. 627.66 s [vector] +++ OK, passed 100 tests.
  4253. 627.67 s [vector] iscanr': OK
  4254. 627.67 s [vector] +++ OK, passed 100 tests.
  4255. 627.67 s [vector] mut_read: OK
  4256. 627.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4257. 627.68 s [vector] mut_write: OK
  4258. 627.68 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4259. 627.68 s [vector] mut_modify: OK
  4260. 627.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4261. 627.68 s [vector] mut_generate: OK
  4262. 627.68 s [vector] +++ OK, passed 100 tests.
  4263. 627.70 s [vector] mut_generateM: OK (0.03s)
  4264. 627.71 s [vector] +++ OK, passed 100 tests.
  4265. 627.75 s [vector] mut_mapM_: OK (0.04s)
  4266. 627.75 s [vector] +++ OK, passed 100 tests.
  4267. 627.79 s [vector] mut_imapM_: OK (0.04s)
  4268. 627.79 s [vector] +++ OK, passed 100 tests.
  4269. 627.83 s [vector] mut_forM_: OK (0.04s)
  4270. 627.83 s [vector] +++ OK, passed 100 tests.
  4271. 627.85 s [vector] mut_iforM_: OK (0.04s)
  4272. 627.86 s [vector] +++ OK, passed 100 tests.
  4273. 627.86 s [vector] mut_foldr: OK
  4274. 627.86 s [vector] +++ OK, passed 100 tests.
  4275. 627.86 s [vector] mut_foldr': OK
  4276. 627.86 s [vector] +++ OK, passed 100 tests.
  4277. 627.86 s [vector] mut_foldl: OK
  4278. 627.86 s [vector] +++ OK, passed 100 tests.
  4279. 627.87 s [vector] mut_foldl': OK
  4280. 627.87 s [vector] +++ OK, passed 100 tests.
  4281. 627.88 s [vector] mut_ifoldr: OK
  4282. 627.88 s [vector] +++ OK, passed 100 tests.
  4283. 627.88 s [vector] mut_ifoldr': OK
  4284. 627.88 s [vector] +++ OK, passed 100 tests.
  4285. 627.89 s [vector] mut_ifoldl: OK
  4286. 627.90 s [vector] +++ OK, passed 100 tests.
  4287. 627.90 s [vector] mut_ifoldl': OK (0.01s)
  4288. 627.90 s [vector] +++ OK, passed 100 tests.
  4289. 627.91 s [vector] mut_foldM: OK
  4290. 627.92 s [vector] +++ OK, passed 100 tests.
  4291. 627.92 s [vector] mut_foldM': OK
  4292. 627.92 s [vector] +++ OK, passed 100 tests.
  4293. 627.94 s [vector] mut_foldrM: OK
  4294. 627.94 s [vector] +++ OK, passed 100 tests.
  4295. 627.94 s [vector] mut_foldrM': OK
  4296. 627.94 s [vector] +++ OK, passed 100 tests.
  4297. 627.96 s [vector] mut_ifoldM: OK (0.01s)
  4298. 627.96 s [vector] +++ OK, passed 100 tests.
  4299. 627.96 s [vector] mut_ifoldM': OK (0.01s)
  4300. 627.96 s [vector] +++ OK, passed 100 tests.
  4301. 627.98 s [vector] mut_ifoldrM: OK (0.02s)
  4302. 627.98 s [vector] +++ OK, passed 100 tests.
  4303. 628.00 s [vector] mut_ifoldrM': OK (0.02s)
  4304. 628.00 s [vector] +++ OK, passed 100 tests.
  4305. 628.00 s [vector] compare: OK
  4306. 628.00 s [vector] +++ OK, passed 100 tests.
  4307. 628.00 s [vector] maximum: OK
  4308. 628.00 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4309. 628.00 s [vector] minimum: OK
  4310. 628.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4311. 628.01 s [vector] minIndex: OK
  4312. 628.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4313. 628.01 s [vector] maxIndex: OK
  4314. 628.01 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4315. 628.02 s [vector] maximumBy: OK
  4316. 628.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4317. 628.02 s [vector] minimumBy: OK
  4318. 628.02 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4319. 628.02 s [vector] maximumOn: OK
  4320. 628.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4321. 628.02 s [vector] minimumOn: OK
  4322. 628.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4323. 628.03 s [vector] maxIndexBy: OK
  4324. 628.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4325. 628.03 s [vector] minIndexBy: OK
  4326. 628.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4327. 628.03 s [vector] ListFirstMaxIndexWins: OK
  4328. 628.03 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4329. 628.03 s [vector] FalseListFirstMaxIndexWins: OK
  4330. 628.03 s [vector] +++ OK, failed as expected. (after 1 test):
  4331. 628.03 s [vector] Exception:
  4332. 628.03 s [vector] Prelude.foldr1: empty list
  4333. 628.03 s [vector] CallStack (from HasCallStack):
  4334. 628.03 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4335. 628.03 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4336. 628.03 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4337. 628.03 s [vector] []
  4338. 628.04 s [vector] mempty: OK
  4339. 628.04 s [vector] +++ OK, passed 100 tests.
  4340. 628.04 s [vector] mappend: OK
  4341. 628.04 s [vector] +++ OK, passed 100 tests.
  4342. 628.09 s [vector] mconcat: OK (0.05s)
  4343. 628.09 s [vector] +++ OK, passed 100 tests.
  4344. 628.10 s [vector] glength: OK
  4345. 628.10 s [vector] +++ OK, passed 100 tests.
  4346. 628.10 s [vector] sum: OK
  4347. 628.10 s [vector] +++ OK, passed 100 tests.
  4348. 628.10 s [vector] product: OK
  4349. 628.10 s [vector] +++ OK, passed 100 tests.
  4350. 628.10 s [vector] enumFromN: OK
  4351. 628.10 s [vector] +++ OK, passed 100 tests.
  4352. 628.11 s [vector] enumFromThenN: OK
  4353. 628.11 s [vector] +++ OK, passed 100 tests.
  4354. 628.11 s [vector] enumFromTo: OK
  4355. 628.11 s [vector] +++ OK, passed 100 tests.
  4356. 628.11 s [vector] enumFromThenTo: OK
  4357. 628.11 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4358. 628.11 s [vector] Data.Vector.Storable.Vector (Double)
  4359. 628.11 s [vector] fromList.toList == id: OK
  4360. 628.12 s [vector] +++ OK, passed 100 tests.
  4361. 628.12 s [vector] toList.fromList == id: OK
  4362. 628.12 s [vector] +++ OK, passed 100 tests.
  4363. 628.12 s [vector] unstream.stream == id: OK
  4364. 628.12 s [vector] +++ OK, passed 100 tests.
  4365. 628.12 s [vector] stream.unstream == id: OK
  4366. 628.12 s [vector] +++ OK, passed 100 tests.
  4367. 628.13 s [vector] eq: OK
  4368. 628.13 s [vector] +++ OK, passed 100 tests.
  4369. 628.13 s [vector] length: OK
  4370. 628.13 s [vector] +++ OK, passed 100 tests.
  4371. 628.14 s [vector] null: OK
  4372. 628.14 s [vector] +++ OK, passed 100 tests.
  4373. 628.14 s [vector] index: OK
  4374. 628.14 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4375. 628.14 s [vector] safeIndex: OK
  4376. 628.14 s [vector] +++ OK, passed 100 tests.
  4377. 628.14 s [vector] head: OK
  4378. 628.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4379. 628.17 s [vector] last: OK
  4380. 628.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4381. 628.17 s [vector] unsafeIndex: OK (0.02s)
  4382. 628.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4383. 628.17 s [vector] unsafeHead: OK
  4384. 628.17 s [vector] +++ OK, passed 100 tests; 25 discarded.
  4385. 628.18 s [vector] unsafeLast: OK
  4386. 628.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4387. 628.18 s [vector] slice: OK
  4388. 628.18 s [vector] +++ OK, passed 100 tests.
  4389. 628.18 s [vector] init: OK
  4390. 628.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4391. 628.19 s [vector] tail: OK
  4392. 628.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4393. 628.19 s [vector] take: OK
  4394. 628.19 s [vector] +++ OK, passed 100 tests.
  4395. 628.19 s [vector] drop: OK
  4396. 628.20 s [vector] +++ OK, passed 100 tests.
  4397. 628.20 s [vector] splitAt: OK
  4398. 628.20 s [vector] +++ OK, passed 100 tests.
  4399. 628.20 s [vector] empty: OK
  4400. 628.20 s [vector] +++ OK, passed 100 tests.
  4401. 628.20 s [vector] singleton: OK
  4402. 628.20 s [vector] +++ OK, passed 100 tests.
  4403. 628.20 s [vector] replicate: OK
  4404. 628.20 s [vector] +++ OK, passed 100 tests.
  4405. 628.20 s [vector] generate: OK
  4406. 628.21 s [vector] +++ OK, passed 100 tests.
  4407. 628.21 s [vector] iterateN: OK
  4408. 628.22 s [vector] +++ OK, passed 100 tests.
  4409. 628.34 s [vector] iterateNM: OK (0.12s)
  4410. 628.34 s [vector] +++ OK, passed 100 tests.
  4411. 628.38 s [vector] generateM: OK (0.03s)
  4412. 628.38 s [vector] +++ OK, passed 100 tests.
  4413. 628.38 s [vector] replicateM: OK (0.01s)
  4414. 628.38 s [vector] +++ OK, passed 100 tests.
  4415. 628.38 s [vector] create: OK
  4416. 628.38 s [vector] +++ OK, passed 100 tests.
  4417. 628.38 s [vector] createT: OK
  4418. 628.38 s [vector] +++ OK, passed 100 tests.
  4419. 628.38 s [vector] unfoldr: OK
  4420. 628.38 s [vector] +++ OK, passed 100 tests.
  4421. 628.38 s [vector] unfoldrN: OK
  4422. 628.38 s [vector] +++ OK, passed 100 tests.
  4423. 628.39 s [vector] unfoldrExactN: OK
  4424. 628.39 s [vector] +++ OK, passed 100 tests.
  4425. 628.39 s [vector] unfoldrM: OK
  4426. 628.40 s [vector] +++ OK, passed 100 tests.
  4427. 628.40 s [vector] unfoldrNM: OK
  4428. 628.40 s [vector] +++ OK, passed 100 tests.
  4429. 628.51 s [vector] unfoldrExactNM: OK (0.10s)
  4430. 628.51 s [vector] +++ OK, passed 100 tests.
  4431. 628.53 s [vector] constructN: OK (0.03s)
  4432. 628.53 s [vector] +++ OK, passed 100 tests.
  4433. 628.57 s [vector] constructrN: OK (0.02s)
  4434. 628.57 s [vector] +++ OK, passed 100 tests.
  4435. 628.57 s [vector] cons: OK
  4436. 628.57 s [vector] +++ OK, passed 100 tests.
  4437. 628.58 s [vector] snoc: OK
  4438. 628.58 s [vector] +++ OK, passed 100 tests.
  4439. 628.58 s [vector] append: OK
  4440. 628.58 s [vector] +++ OK, passed 100 tests.
  4441. 628.64 s [vector] concat: OK (0.06s)
  4442. 628.64 s [vector] +++ OK, passed 100 tests.
  4443. 628.65 s [vector] force: OK
  4444. 628.65 s [vector] +++ OK, passed 100 tests.
  4445. 628.67 s [vector] upd: OK
  4446. 628.67 s [vector] +++ OK, passed 100 tests.
  4447. 628.67 s [vector] accum: OK (0.02s)
  4448. 628.67 s [vector] +++ OK, passed 100 tests.
  4449. 628.67 s [vector] reverse: OK
  4450. 628.67 s [vector] +++ OK, passed 100 tests.
  4451. 628.67 s [vector] backpermute: OK
  4452. 628.67 s [vector] +++ OK, passed 100 tests.
  4453. 628.68 s [vector] map: OK
  4454. 628.70 s [vector] +++ OK, passed 100 tests.
  4455. 628.70 s [vector] imap: OK (0.01s)
  4456. 628.70 s [vector] +++ OK, passed 100 tests.
  4457. 628.72 s [vector] concatMap: OK
  4458. 628.72 s [vector] +++ OK, passed 100 tests.
  4459. 628.73 s [vector] mapM: OK (0.01s)
  4460. 628.73 s [vector] +++ OK, passed 100 tests.
  4461. 628.80 s [vector] mapM_: OK (0.07s)
  4462. 628.80 s [vector] +++ OK, passed 100 tests.
  4463. 628.80 s [vector] forM: OK
  4464. 628.80 s [vector] +++ OK, passed 100 tests.
  4465. 628.90 s [vector] forM_: OK (0.09s)
  4466. 628.90 s [vector] +++ OK, passed 100 tests.
  4467. 628.92 s [vector] imapM: OK (0.02s)
  4468. 628.92 s [vector] +++ OK, passed 100 tests.
  4469. 629.04 s [vector] imapM_: OK (0.12s)
  4470. 629.04 s [vector] +++ OK, passed 100 tests.
  4471. 629.04 s [vector] zipWith: OK (0.02s)
  4472. 629.04 s [vector] +++ OK, passed 100 tests.
  4473. 629.06 s [vector] zipWith3: OK
  4474. 629.08 s [vector] +++ OK, passed 100 tests.
  4475. 629.10 s [vector] izipWith: OK (0.02s)
  4476. 629.10 s [vector] +++ OK, passed 100 tests.
  4477. 629.12 s [vector] izipWith3: OK (0.03s)
  4478. 629.12 s [vector] +++ OK, passed 100 tests.
  4479. 629.14 s [vector] izipWithM: OK (0.03s)
  4480. 629.14 s [vector] +++ OK, passed 100 tests.
  4481. 629.24 s [vector] izipWithM_: OK (0.07s)
  4482. 629.24 s [vector] +++ OK, passed 100 tests.
  4483. 629.26 s [vector] zipWithM: OK (0.02s)
  4484. 629.26 s [vector] +++ OK, passed 100 tests.
  4485. 629.34 s [vector] zipWithM_: OK (0.09s)
  4486. 629.34 s [vector] +++ OK, passed 100 tests.
  4487. 629.36 s [vector] filter: OK (0.01s)
  4488. 629.36 s [vector] +++ OK, passed 100 tests.
  4489. 629.38 s [vector] ifilter: OK (0.02s)
  4490. 629.38 s [vector] +++ OK, passed 100 tests.
  4491. 629.48 s [vector] filterM: OK (0.11s)
  4492. 629.48 s [vector] +++ OK, passed 100 tests.
  4493. 629.48 s [vector] uniq: OK
  4494. 629.49 s [vector] +++ OK, passed 100 tests.
  4495. 629.50 s [vector] mapMaybe: OK (0.01s)
  4496. 629.50 s [vector] +++ OK, passed 100 tests.
  4497. 629.51 s [vector] imapMaybe: OK (0.02s)
  4498. 629.51 s [vector] +++ OK, passed 100 tests.
  4499. 629.51 s [vector] takeWhile: OK
  4500. 629.51 s [vector] +++ OK, passed 100 tests.
  4501. 629.51 s [vector] dropWhile: OK
  4502. 629.51 s [vector] +++ OK, passed 100 tests.
  4503. 629.54 s [vector] partition: OK (0.01s)
  4504. 629.54 s [vector] +++ OK, passed 100 tests.
  4505. 629.56 s [vector] partitionWith: OK (0.02s)
  4506. 629.56 s [vector] +++ OK, passed 100 tests.
  4507. 629.56 s [vector] span: OK
  4508. 629.56 s [vector] +++ OK, passed 100 tests.
  4509. 629.56 s [vector] break: OK
  4510. 629.56 s [vector] +++ OK, passed 100 tests.
  4511. 629.57 s [vector] spanR: OK
  4512. 629.57 s [vector] +++ OK, passed 100 tests.
  4513. 629.57 s [vector] breakR: OK
  4514. 629.58 s [vector] +++ OK, passed 100 tests.
  4515. 629.59 s [vector] groupBy: OK (0.02s)
  4516. 629.59 s [vector] +++ OK, passed 100 tests.
  4517. 629.60 s [vector] elem: OK
  4518. 629.60 s [vector] +++ OK, passed 100 tests.
  4519. 629.60 s [vector] notElem: OK
  4520. 629.60 s [vector] +++ OK, passed 100 tests.
  4521. 629.60 s [vector] find: OK
  4522. 629.60 s [vector] +++ OK, passed 100 tests.
  4523. 629.60 s [vector] findIndex: OK
  4524. 629.61 s [vector] +++ OK, passed 100 tests.
  4525. 629.62 s [vector] findIndexR: OK
  4526. 629.62 s [vector] +++ OK, passed 100 tests.
  4527. 629.62 s [vector] findIndices: OK (0.02s)
  4528. 629.62 s [vector] +++ OK, passed 100 tests.
  4529. 629.62 s [vector] elemIndex: OK
  4530. 629.63 s [vector] +++ OK, passed 100 tests.
  4531. 629.64 s [vector] elemIndices: OK
  4532. 629.64 s [vector] +++ OK, passed 100 tests.
  4533. 629.68 s [vector] foldl: OK (0.04s)
  4534. 629.68 s [vector] +++ OK, passed 100 tests.
  4535. 629.70 s [vector] foldl1: OK (0.03s)
  4536. 629.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4537. 629.72 s [vector] foldl': OK (0.03s)
  4538. 629.72 s [vector] +++ OK, passed 100 tests.
  4539. 629.76 s [vector] foldl1': OK (0.03s)
  4540. 629.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4541. 629.77 s [vector] foldr: OK (0.02s)
  4542. 629.77 s [vector] +++ OK, passed 100 tests.
  4543. 629.80 s [vector] foldr1: OK (0.01s)
  4544. 629.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4545. 629.82 s [vector] foldr': OK (0.03s)
  4546. 629.82 s [vector] +++ OK, passed 100 tests.
  4547. 629.86 s [vector] foldr1': OK (0.02s)
  4548. 629.86 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4549. 629.88 s [vector] ifoldl: OK (0.02s)
  4550. 629.88 s [vector] +++ OK, passed 100 tests.
  4551. 629.90 s [vector] ifoldl': OK (0.03s)
  4552. 629.90 s [vector] +++ OK, passed 100 tests.
  4553. 629.92 s [vector] ifoldr: OK (0.02s)
  4554. 629.92 s [vector] +++ OK, passed 100 tests.
  4555. 629.94 s [vector] ifoldr': OK (0.02s)
  4556. 629.94 s [vector] +++ OK, passed 100 tests.
  4557. 629.99 s [vector] ifoldM: OK (0.03s)
  4558. 629.99 s [vector] +++ OK, passed 100 tests.
  4559. 630.00 s [vector] ifoldM': OK (0.03s)
  4560. 630.00 s [vector] +++ OK, passed 100 tests.
  4561. 630.07 s [vector] ifoldM_: OK (0.08s)
  4562. 630.07 s [vector] +++ OK, passed 100 tests.
  4563. 630.15 s [vector] ifoldM'_: OK (0.07s)
  4564. 630.15 s [vector] +++ OK, passed 100 tests.
  4565. 630.15 s [vector] all: OK
  4566. 630.15 s [vector] +++ OK, passed 100 tests.
  4567. 630.16 s [vector] any: OK
  4568. 630.16 s [vector] +++ OK, passed 100 tests.
  4569. 630.18 s [vector] prescanl: OK (0.02s)
  4570. 630.18 s [vector] +++ OK, passed 100 tests.
  4571. 630.20 s [vector] prescanl': OK (0.02s)
  4572. 630.20 s [vector] +++ OK, passed 100 tests.
  4573. 630.24 s [vector] postscanl: OK (0.03s)
  4574. 630.24 s [vector] +++ OK, passed 100 tests.
  4575. 630.26 s [vector] postscanl': OK (0.03s)
  4576. 630.26 s [vector] +++ OK, passed 100 tests.
  4577. 630.28 s [vector] scanl: OK (0.03s)
  4578. 630.28 s [vector] +++ OK, passed 100 tests.
  4579. 630.32 s [vector] scanl': OK (0.03s)
  4580. 630.32 s [vector] +++ OK, passed 100 tests.
  4581. 630.34 s [vector] scanl1: OK (0.03s)
  4582. 630.34 s [vector] +++ OK, passed 100 tests.
  4583. 630.36 s [vector] scanl1': OK (0.02s)
  4584. 630.36 s [vector] +++ OK, passed 100 tests.
  4585. 630.38 s [vector] iscanl: OK (0.03s)
  4586. 630.38 s [vector] +++ OK, passed 100 tests.
  4587. 630.42 s [vector] iscanl': OK (0.03s)
  4588. 630.42 s [vector] +++ OK, passed 100 tests.
  4589. 630.44 s [vector] prescanr: OK (0.02s)
  4590. 630.44 s [vector] +++ OK, passed 100 tests.
  4591. 630.46 s [vector] prescanr': OK (0.02s)
  4592. 630.46 s [vector] +++ OK, passed 100 tests.
  4593. 630.47 s [vector] postscanr: OK (0.02s)
  4594. 630.47 s [vector] +++ OK, passed 100 tests.
  4595. 630.51 s [vector] postscanr': OK (0.03s)
  4596. 630.51 s [vector] +++ OK, passed 100 tests.
  4597. 630.54 s [vector] scanr: OK (0.02s)
  4598. 630.54 s [vector] +++ OK, passed 100 tests.
  4599. 630.58 s [vector] scanr': OK (0.03s)
  4600. 630.58 s [vector] +++ OK, passed 100 tests.
  4601. 630.60 s [vector] scanr1: OK (0.03s)
  4602. 630.60 s [vector] +++ OK, passed 100 tests.
  4603. 630.62 s [vector] scanr1': OK (0.03s)
  4604. 630.62 s [vector] +++ OK, passed 100 tests.
  4605. 630.66 s [vector] iscanr: OK (0.03s)
  4606. 630.66 s [vector] +++ OK, passed 100 tests.
  4607. 630.68 s [vector] iscanr': OK (0.03s)
  4608. 630.69 s [vector] +++ OK, passed 100 tests.
  4609. 630.69 s [vector] mut_read: OK
  4610. 630.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4611. 630.70 s [vector] mut_write: OK
  4612. 630.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4613. 630.70 s [vector] mut_modify: OK
  4614. 630.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4615. 630.72 s [vector] mut_generate: OK
  4616. 630.72 s [vector] +++ OK, passed 100 tests.
  4617. 630.76 s [vector] mut_generateM: OK (0.06s)
  4618. 630.76 s [vector] +++ OK, passed 100 tests.
  4619. 630.82 s [vector] mut_mapM_: OK (0.06s)
  4620. 630.82 s [vector] +++ OK, passed 100 tests.
  4621. 630.96 s [vector] mut_imapM_: OK (0.13s)
  4622. 630.96 s [vector] +++ OK, passed 100 tests.
  4623. 631.04 s [vector] mut_forM_: OK (0.09s)
  4624. 631.04 s [vector] +++ OK, passed 100 tests.
  4625. 631.11 s [vector] mut_iforM_: OK (0.07s)
  4626. 631.11 s [vector] +++ OK, passed 100 tests.
  4627. 631.14 s [vector] mut_foldr: OK (0.01s)
  4628. 631.14 s [vector] +++ OK, passed 100 tests.
  4629. 631.16 s [vector] mut_foldr': OK (0.02s)
  4630. 631.16 s [vector] +++ OK, passed 100 tests.
  4631. 631.20 s [vector] mut_foldl: OK (0.03s)
  4632. 631.20 s [vector] +++ OK, passed 100 tests.
  4633. 631.22 s [vector] mut_foldl': OK (0.02s)
  4634. 631.22 s [vector] +++ OK, passed 100 tests.
  4635. 631.24 s [vector] mut_ifoldr: OK (0.02s)
  4636. 631.24 s [vector] +++ OK, passed 100 tests.
  4637. 631.24 s [vector] mut_ifoldr': OK (0.01s)
  4638. 631.24 s [vector] +++ OK, passed 100 tests.
  4639. 631.26 s [vector] mut_ifoldl: OK (0.01s)
  4640. 631.26 s [vector] +++ OK, passed 100 tests.
  4641. 631.28 s [vector] mut_ifoldl': OK (0.02s)
  4642. 631.28 s [vector] +++ OK, passed 100 tests.
  4643. 631.30 s [vector] mut_foldM: OK (0.01s)
  4644. 631.39 s [vector] +++ OK, passed 100 tests.
  4645. 631.39 s [vector] mut_foldM': OK (0.02s)
  4646. 631.39 s [vector] +++ OK, passed 100 tests.
  4647. 631.39 s [vector] mut_foldrM: OK (0.02s)
  4648. 631.39 s [vector] +++ OK, passed 100 tests.
  4649. 631.39 s [vector] mut_foldrM': OK (0.01s)
  4650. 631.39 s [vector] +++ OK, passed 100 tests.
  4651. 631.39 s [vector] mut_ifoldM: OK (0.02s)
  4652. 631.39 s [vector] +++ OK, passed 100 tests.
  4653. 631.39 s [vector] mut_ifoldM': OK (0.01s)
  4654. 631.39 s [vector] +++ OK, passed 100 tests.
  4655. 631.39 s [vector] mut_ifoldrM: OK (0.02s)
  4656. 631.39 s [vector] +++ OK, passed 100 tests.
  4657. 631.42 s [vector] mut_ifoldrM': OK
  4658. 631.42 s [vector] +++ OK, passed 100 tests.
  4659. 631.42 s [vector] compare: OK
  4660. 631.42 s [vector] +++ OK, passed 100 tests.
  4661. 631.42 s [vector] maximum: OK
  4662. 631.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4663. 631.42 s [vector] minimum: OK
  4664. 631.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4665. 631.42 s [vector] minIndex: OK
  4666. 631.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4667. 631.42 s [vector] maxIndex: OK
  4668. 631.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4669. 631.42 s [vector] maximumBy: OK
  4670. 631.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4671. 631.42 s [vector] minimumBy: OK
  4672. 631.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4673. 631.42 s [vector] maximumOn: OK
  4674. 631.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4675. 631.42 s [vector] minimumOn: OK
  4676. 631.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4677. 631.43 s [vector] maxIndexBy: OK
  4678. 631.43 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4679. 631.43 s [vector] minIndexBy: OK
  4680. 631.43 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4681. 631.43 s [vector] ListFirstMaxIndexWins: OK
  4682. 631.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4683. 631.43 s [vector] FalseListFirstMaxIndexWins: OK
  4684. 631.43 s [vector] +++ OK, failed as expected. (after 1 test):
  4685. 631.43 s [vector] Exception:
  4686. 631.43 s [vector] Prelude.foldr1: empty list
  4687. 631.43 s [vector] CallStack (from HasCallStack):
  4688. 631.43 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4689. 631.43 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4690. 631.43 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4691. 631.43 s [vector] []
  4692. 631.43 s [vector] mempty: OK
  4693. 631.43 s [vector] +++ OK, passed 100 tests.
  4694. 631.43 s [vector] mappend: OK
  4695. 631.44 s [vector] +++ OK, passed 100 tests.
  4696. 631.47 s [vector] mconcat: OK (0.04s)
  4697. 631.47 s [vector] +++ OK, passed 100 tests.
  4698. 631.47 s [vector] glength: OK
  4699. 631.47 s [vector] +++ OK, passed 100 tests.
  4700. 631.47 s [vector] sum: OK
  4701. 631.47 s [vector] +++ OK, passed 100 tests.
  4702. 631.48 s [vector] product: OK
  4703. 631.48 s [vector] +++ OK, passed 100 tests.
  4704. 631.48 s [vector] enumFromN: OK
  4705. 631.48 s [vector] +++ OK, passed 100 tests.
  4706. 631.48 s [vector] enumFromThenN: OK
  4707. 631.48 s [vector] +++ OK, passed 100 tests.
  4708. 631.48 s [vector] enumFromTo: OK
  4709. 631.48 s [vector] +++ OK, passed 100 tests.
  4710. 631.49 s [vector] enumFromThenTo: OK
  4711. 631.49 s [vector] +++ OK, passed 100 tests; 5 discarded.
  4712. 631.49 s [vector] unstream
  4713. 631.49 s [vector] unstream == vunstream (exact): OK
  4714. 631.49 s [vector] +++ OK, passed 100 tests.
  4715. 631.50 s [vector] unstream == vunstream (unknown): OK
  4716. 631.50 s [vector] +++ OK, passed 100 tests.
  4717. 631.50 s [vector] unstreamR ~= vunstream (exact): OK
  4718. 631.50 s [vector] +++ OK, passed 100 tests.
  4719. 631.50 s [vector] unstreamR ~= vunstream (unknown): OK
  4720. 631.50 s [vector] +++ OK, passed 100 tests.
  4721. 631.50 s [vector] Tests.Vector.Strict
  4722. 631.50 s [vector] Bool
  4723. 631.50 s [vector] fromList.toList == id: OK
  4724. 631.50 s [vector] +++ OK, passed 100 tests.
  4725. 631.50 s [vector] toList.fromList == id: OK
  4726. 631.50 s [vector] +++ OK, passed 100 tests.
  4727. 631.50 s [vector] unstream.stream == id: OK
  4728. 631.50 s [vector] +++ OK, passed 100 tests.
  4729. 631.50 s [vector] stream.unstream == id: OK
  4730. 631.50 s [vector] +++ OK, passed 100 tests.
  4731. 631.50 s [vector] eq: OK
  4732. 631.50 s [vector] +++ OK, passed 100 tests.
  4733. 631.50 s [vector] length: OK
  4734. 631.50 s [vector] +++ OK, passed 100 tests.
  4735. 631.50 s [vector] null: OK
  4736. 631.50 s [vector] +++ OK, passed 100 tests.
  4737. 631.50 s [vector] index: OK
  4738. 631.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4739. 631.50 s [vector] safeIndex: OK
  4740. 631.50 s [vector] +++ OK, passed 100 tests.
  4741. 631.50 s [vector] head: OK
  4742. 631.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4743. 631.50 s [vector] last: OK
  4744. 631.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4745. 631.50 s [vector] unsafeIndex: OK
  4746. 631.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4747. 631.50 s [vector] unsafeHead: OK
  4748. 631.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4749. 631.50 s [vector] unsafeLast: OK
  4750. 631.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4751. 631.50 s [vector] slice: OK
  4752. 631.50 s [vector] +++ OK, passed 100 tests.
  4753. 631.50 s [vector] init: OK
  4754. 631.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4755. 631.50 s [vector] tail: OK
  4756. 631.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4757. 631.50 s [vector] take: OK
  4758. 631.51 s [vector] +++ OK, passed 100 tests.
  4759. 631.51 s [vector] drop: OK
  4760. 631.51 s [vector] +++ OK, passed 100 tests.
  4761. 631.51 s [vector] splitAt: OK
  4762. 631.51 s [vector] +++ OK, passed 100 tests.
  4763. 631.51 s [vector] empty: OK
  4764. 631.51 s [vector] +++ OK, passed 100 tests.
  4765. 631.51 s [vector] singleton: OK
  4766. 631.51 s [vector] +++ OK, passed 100 tests.
  4767. 631.51 s [vector] replicate: OK
  4768. 631.51 s [vector] +++ OK, passed 100 tests.
  4769. 631.51 s [vector] generate: OK
  4770. 631.51 s [vector] +++ OK, passed 100 tests.
  4771. 631.51 s [vector] iterateN: OK
  4772. 631.52 s [vector] +++ OK, passed 100 tests.
  4773. 631.60 s [vector] iterateNM: OK (0.07s)
  4774. 631.60 s [vector] +++ OK, passed 100 tests.
  4775. 631.62 s [vector] generateM: OK (0.01s)
  4776. 631.62 s [vector] +++ OK, passed 100 tests.
  4777. 631.63 s [vector] replicateM: OK (0.02s)
  4778. 631.63 s [vector] +++ OK, passed 100 tests.
  4779. 631.63 s [vector] create: OK
  4780. 631.63 s [vector] +++ OK, passed 100 tests.
  4781. 631.63 s [vector] createT: OK
  4782. 631.63 s [vector] +++ OK, passed 100 tests.
  4783. 631.63 s [vector] unfoldr: OK
  4784. 631.63 s [vector] +++ OK, passed 100 tests.
  4785. 631.63 s [vector] unfoldrN: OK
  4786. 631.63 s [vector] +++ OK, passed 100 tests.
  4787. 631.63 s [vector] unfoldrExactN: OK
  4788. 631.63 s [vector] +++ OK, passed 100 tests.
  4789. 631.64 s [vector] unfoldrM: OK
  4790. 631.64 s [vector] +++ OK, passed 100 tests.
  4791. 631.64 s [vector] unfoldrNM: OK
  4792. 631.64 s [vector] +++ OK, passed 100 tests.
  4793. 631.69 s [vector] unfoldrExactNM: OK (0.05s)
  4794. 631.69 s [vector] +++ OK, passed 100 tests.
  4795. 631.69 s [vector] constructN: OK
  4796. 631.69 s [vector] +++ OK, passed 100 tests.
  4797. 631.69 s [vector] constructrN: OK
  4798. 631.69 s [vector] +++ OK, passed 100 tests.
  4799. 631.69 s [vector] cons: OK
  4800. 631.70 s [vector] +++ OK, passed 100 tests.
  4801. 631.70 s [vector] snoc: OK
  4802. 631.70 s [vector] +++ OK, passed 100 tests.
  4803. 631.70 s [vector] append: OK
  4804. 631.70 s [vector] +++ OK, passed 100 tests.
  4805. 631.71 s [vector] concat: OK (0.01s)
  4806. 631.72 s [vector] +++ OK, passed 100 tests.
  4807. 631.72 s [vector] force: OK
  4808. 631.72 s [vector] +++ OK, passed 100 tests.
  4809. 631.72 s [vector] upd: OK
  4810. 631.73 s [vector] +++ OK, passed 100 tests.
  4811. 631.73 s [vector] accum: OK
  4812. 631.73 s [vector] +++ OK, passed 100 tests.
  4813. 631.74 s [vector] reverse: OK
  4814. 631.74 s [vector] +++ OK, passed 100 tests.
  4815. 631.74 s [vector] backpermute: OK
  4816. 631.74 s [vector] +++ OK, passed 100 tests.
  4817. 631.74 s [vector] map: OK
  4818. 631.74 s [vector] +++ OK, passed 100 tests.
  4819. 631.74 s [vector] imap: OK
  4820. 631.74 s [vector] +++ OK, passed 100 tests.
  4821. 631.74 s [vector] concatMap: OK
  4822. 631.74 s [vector] +++ OK, passed 100 tests.
  4823. 631.74 s [vector] mapM: OK
  4824. 631.74 s [vector] +++ OK, passed 100 tests.
  4825. 631.75 s [vector] mapM_: OK (0.02s)
  4826. 631.75 s [vector] +++ OK, passed 100 tests.
  4827. 631.76 s [vector] forM: OK
  4828. 631.76 s [vector] +++ OK, passed 100 tests.
  4829. 631.78 s [vector] forM_: OK (0.02s)
  4830. 631.78 s [vector] +++ OK, passed 100 tests.
  4831. 631.78 s [vector] imapM: OK
  4832. 631.78 s [vector] +++ OK, passed 100 tests.
  4833. 631.80 s [vector] imapM_: OK (0.02s)
  4834. 631.80 s [vector] +++ OK, passed 100 tests.
  4835. 631.80 s [vector] zipWith: OK
  4836. 631.80 s [vector] +++ OK, passed 100 tests.
  4837. 631.81 s [vector] zipWith3: OK
  4838. 631.81 s [vector] +++ OK, passed 100 tests.
  4839. 631.81 s [vector] izipWith: OK
  4840. 631.81 s [vector] +++ OK, passed 100 tests.
  4841. 631.81 s [vector] izipWith3: OK
  4842. 631.81 s [vector] +++ OK, passed 100 tests.
  4843. 631.82 s [vector] izipWithM: OK
  4844. 631.82 s [vector] +++ OK, passed 100 tests.
  4845. 631.83 s [vector] izipWithM_: OK (0.01s)
  4846. 631.83 s [vector] +++ OK, passed 100 tests.
  4847. 631.84 s [vector] zipWithM: OK
  4848. 631.84 s [vector] +++ OK, passed 100 tests.
  4849. 631.85 s [vector] zipWithM_: OK (0.01s)
  4850. 631.85 s [vector] +++ OK, passed 100 tests.
  4851. 631.85 s [vector] filter: OK
  4852. 631.85 s [vector] +++ OK, passed 100 tests.
  4853. 631.86 s [vector] ifilter: OK
  4854. 631.86 s [vector] +++ OK, passed 100 tests.
  4855. 631.88 s [vector] filterM: OK (0.03s)
  4856. 631.88 s [vector] +++ OK, passed 100 tests.
  4857. 631.88 s [vector] uniq: OK
  4858. 631.88 s [vector] +++ OK, passed 100 tests.
  4859. 631.88 s [vector] mapMaybe: OK
  4860. 631.88 s [vector] +++ OK, passed 100 tests.
  4861. 631.88 s [vector] imapMaybe: OK
  4862. 631.88 s [vector] +++ OK, passed 100 tests.
  4863. 631.89 s [vector] takeWhile: OK
  4864. 631.89 s [vector] +++ OK, passed 100 tests.
  4865. 631.89 s [vector] dropWhile: OK
  4866. 631.89 s [vector] +++ OK, passed 100 tests.
  4867. 631.89 s [vector] partition: OK
  4868. 631.89 s [vector] +++ OK, passed 100 tests.
  4869. 631.89 s [vector] partitionWith: OK
  4870. 631.89 s [vector] +++ OK, passed 100 tests.
  4871. 631.89 s [vector] span: OK
  4872. 631.89 s [vector] +++ OK, passed 100 tests.
  4873. 631.90 s [vector] break: OK
  4874. 631.90 s [vector] +++ OK, passed 100 tests.
  4875. 631.90 s [vector] spanR: OK
  4876. 631.90 s [vector] +++ OK, passed 100 tests.
  4877. 631.90 s [vector] breakR: OK
  4878. 631.90 s [vector] +++ OK, passed 100 tests.
  4879. 631.90 s [vector] groupBy: OK
  4880. 631.90 s [vector] +++ OK, passed 100 tests.
  4881. 631.90 s [vector] elem: OK
  4882. 631.90 s [vector] +++ OK, passed 100 tests.
  4883. 631.90 s [vector] notElem: OK
  4884. 631.90 s [vector] +++ OK, passed 100 tests.
  4885. 631.91 s [vector] find: OK
  4886. 631.91 s [vector] +++ OK, passed 100 tests.
  4887. 631.91 s [vector] findIndex: OK
  4888. 631.91 s [vector] +++ OK, passed 100 tests.
  4889. 631.91 s [vector] findIndexR: OK
  4890. 631.91 s [vector] +++ OK, passed 100 tests.
  4891. 631.91 s [vector] findIndices: OK
  4892. 631.91 s [vector] +++ OK, passed 100 tests.
  4893. 631.91 s [vector] elemIndex: OK
  4894. 631.92 s [vector] +++ OK, passed 100 tests.
  4895. 631.92 s [vector] elemIndices: OK
  4896. 631.92 s [vector] +++ OK, passed 100 tests.
  4897. 631.92 s [vector] foldl: OK
  4898. 631.92 s [vector] +++ OK, passed 100 tests.
  4899. 631.92 s [vector] foldl1: OK
  4900. 631.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4901. 631.92 s [vector] foldl': OK
  4902. 631.92 s [vector] +++ OK, passed 100 tests.
  4903. 631.92 s [vector] foldl1': OK
  4904. 631.92 s [vector] +++ OK, passed 100 tests; 26 discarded.
  4905. 631.92 s [vector] foldr: OK
  4906. 631.92 s [vector] +++ OK, passed 100 tests.
  4907. 631.92 s [vector] foldr1: OK
  4908. 631.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4909. 631.93 s [vector] foldr': OK
  4910. 631.93 s [vector] +++ OK, passed 100 tests.
  4911. 631.93 s [vector] foldr1': OK
  4912. 631.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4913. 631.93 s [vector] ifoldl: OK
  4914. 631.94 s [vector] +++ OK, passed 100 tests.
  4915. 631.94 s [vector] ifoldl': OK
  4916. 631.94 s [vector] +++ OK, passed 100 tests.
  4917. 631.94 s [vector] ifoldr: OK
  4918. 631.94 s [vector] +++ OK, passed 100 tests.
  4919. 631.94 s [vector] ifoldr': OK
  4920. 631.94 s [vector] +++ OK, passed 100 tests.
  4921. 631.94 s [vector] ifoldM: OK
  4922. 631.94 s [vector] +++ OK, passed 100 tests.
  4923. 631.96 s [vector] ifoldM': OK
  4924. 631.96 s [vector] +++ OK, passed 100 tests.
  4925. 631.98 s [vector] ifoldM_: OK (0.02s)
  4926. 631.98 s [vector] +++ OK, passed 100 tests.
  4927. 631.99 s [vector] ifoldM'_: OK (0.03s)
  4928. 631.99 s [vector] +++ OK, passed 100 tests.
  4929. 632.00 s [vector] all: OK
  4930. 632.00 s [vector] +++ OK, passed 100 tests.
  4931. 632.00 s [vector] any: OK
  4932. 632.00 s [vector] +++ OK, passed 100 tests.
  4933. 632.00 s [vector] prescanl: OK
  4934. 632.00 s [vector] +++ OK, passed 100 tests.
  4935. 632.00 s [vector] prescanl': OK
  4936. 632.00 s [vector] +++ OK, passed 100 tests.
  4937. 632.01 s [vector] postscanl: OK
  4938. 632.01 s [vector] +++ OK, passed 100 tests.
  4939. 632.01 s [vector] postscanl': OK
  4940. 632.01 s [vector] +++ OK, passed 100 tests.
  4941. 632.02 s [vector] scanl: OK
  4942. 632.02 s [vector] +++ OK, passed 100 tests.
  4943. 632.02 s [vector] scanl': OK
  4944. 632.02 s [vector] +++ OK, passed 100 tests.
  4945. 632.02 s [vector] scanl1: OK
  4946. 632.02 s [vector] +++ OK, passed 100 tests.
  4947. 632.02 s [vector] scanl1': OK
  4948. 632.03 s [vector] +++ OK, passed 100 tests.
  4949. 632.03 s [vector] iscanl: OK
  4950. 632.03 s [vector] +++ OK, passed 100 tests.
  4951. 632.03 s [vector] iscanl': OK
  4952. 632.03 s [vector] +++ OK, passed 100 tests.
  4953. 632.04 s [vector] prescanr: OK
  4954. 632.04 s [vector] +++ OK, passed 100 tests.
  4955. 632.04 s [vector] prescanr': OK
  4956. 632.04 s [vector] +++ OK, passed 100 tests.
  4957. 632.05 s [vector] postscanr: OK
  4958. 632.05 s [vector] +++ OK, passed 100 tests.
  4959. 632.05 s [vector] postscanr': OK
  4960. 632.05 s [vector] +++ OK, passed 100 tests.
  4961. 632.05 s [vector] scanr: OK
  4962. 632.05 s [vector] +++ OK, passed 100 tests.
  4963. 632.05 s [vector] scanr': OK
  4964. 632.06 s [vector] +++ OK, passed 100 tests.
  4965. 632.06 s [vector] scanr1: OK
  4966. 632.06 s [vector] +++ OK, passed 100 tests.
  4967. 632.06 s [vector] scanr1': OK
  4968. 632.07 s [vector] +++ OK, passed 100 tests.
  4969. 632.07 s [vector] iscanr: OK
  4970. 632.08 s [vector] +++ OK, passed 100 tests.
  4971. 632.08 s [vector] iscanr': OK
  4972. 632.08 s [vector] +++ OK, passed 100 tests.
  4973. 632.08 s [vector] mut_read: OK
  4974. 632.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4975. 632.08 s [vector] mut_write: OK
  4976. 632.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4977. 632.08 s [vector] mut_modify: OK
  4978. 632.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4979. 632.09 s [vector] mut_generate: OK
  4980. 632.10 s [vector] +++ OK, passed 100 tests.
  4981. 632.12 s [vector] mut_generateM: OK (0.02s)
  4982. 632.12 s [vector] +++ OK, passed 100 tests.
  4983. 632.14 s [vector] mut_mapM_: OK (0.03s)
  4984. 632.14 s [vector] +++ OK, passed 100 tests.
  4985. 632.18 s [vector] mut_imapM_: OK (0.03s)
  4986. 632.18 s [vector] +++ OK, passed 100 tests.
  4987. 632.19 s [vector] mut_forM_: OK (0.03s)
  4988. 632.19 s [vector] +++ OK, passed 100 tests.
  4989. 632.22 s [vector] mut_iforM_: OK (0.02s)
  4990. 632.22 s [vector] +++ OK, passed 100 tests.
  4991. 632.22 s [vector] mut_foldr: OK
  4992. 632.22 s [vector] +++ OK, passed 100 tests.
  4993. 632.23 s [vector] mut_foldr': OK
  4994. 632.23 s [vector] +++ OK, passed 100 tests.
  4995. 632.24 s [vector] mut_foldl: OK
  4996. 632.24 s [vector] +++ OK, passed 100 tests.
  4997. 632.24 s [vector] mut_foldl': OK
  4998. 632.24 s [vector] +++ OK, passed 100 tests.
  4999. 632.24 s [vector] mut_ifoldr: OK
  5000. 632.24 s [vector] +++ OK, passed 100 tests.
  5001. 632.24 s [vector] mut_ifoldr': OK
  5002. 632.24 s [vector] +++ OK, passed 100 tests.
  5003. 632.25 s [vector] mut_ifoldl: OK
  5004. 632.25 s [vector] +++ OK, passed 100 tests.
  5005. 632.26 s [vector] mut_ifoldl': OK
  5006. 632.26 s [vector] +++ OK, passed 100 tests.
  5007. 632.26 s [vector] mut_foldM: OK
  5008. 632.26 s [vector] +++ OK, passed 100 tests.
  5009. 632.26 s [vector] mut_foldM': OK
  5010. 632.27 s [vector] +++ OK, passed 100 tests.
  5011. 632.27 s [vector] mut_foldrM: OK
  5012. 632.27 s [vector] +++ OK, passed 100 tests.
  5013. 632.27 s [vector] mut_foldrM': OK
  5014. 632.27 s [vector] +++ OK, passed 100 tests.
  5015. 632.27 s [vector] mut_ifoldM: OK
  5016. 632.28 s [vector] +++ OK, passed 100 tests.
  5017. 632.29 s [vector] mut_ifoldM': OK
  5018. 632.29 s [vector] +++ OK, passed 100 tests.
  5019. 632.29 s [vector] mut_ifoldrM: OK
  5020. 632.29 s [vector] +++ OK, passed 100 tests.
  5021. 632.30 s [vector] mut_ifoldrM': OK (0.01s)
  5022. 632.30 s [vector] +++ OK, passed 100 tests.
  5023. 632.30 s [vector] compare: OK
  5024. 632.30 s [vector] +++ OK, passed 100 tests.
  5025. 632.30 s [vector] maximum: OK
  5026. 632.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5027. 632.31 s [vector] minimum: OK
  5028. 632.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5029. 632.31 s [vector] minIndex: OK
  5030. 632.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5031. 632.31 s [vector] maxIndex: OK
  5032. 632.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5033. 632.31 s [vector] maximumBy: OK
  5034. 632.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5035. 632.31 s [vector] minimumBy: OK
  5036. 632.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5037. 632.31 s [vector] maximumOn: OK
  5038. 632.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5039. 632.31 s [vector] minimumOn: OK
  5040. 632.32 s [vector] +++ OK, passed 100 tests; 23 discarded.
  5041. 632.32 s [vector] maxIndexBy: OK
  5042. 632.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5043. 632.32 s [vector] minIndexBy: OK
  5044. 632.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5045. 632.32 s [vector] ListFirstMaxIndexWins: OK
  5046. 632.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5047. 632.32 s [vector] FalseListFirstMaxIndexWins: OK
  5048. 632.32 s [vector] +++ OK, failed as expected. (after 1 test):
  5049. 632.32 s [vector] Exception:
  5050. 632.32 s [vector] Prelude.foldr1: empty list
  5051. 632.32 s [vector] CallStack (from HasCallStack):
  5052. 632.32 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5053. 632.32 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5054. 632.32 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5055. 632.32 s [vector] []
  5056. 632.32 s [vector] zip: OK
  5057. 632.32 s [vector] +++ OK, passed 100 tests.
  5058. 632.32 s [vector] zip3: OK
  5059. 632.32 s [vector] +++ OK, passed 100 tests.
  5060. 632.33 s [vector] unzip: OK
  5061. 632.33 s [vector] +++ OK, passed 100 tests.
  5062. 632.33 s [vector] unzip3: OK
  5063. 632.33 s [vector] +++ OK, passed 100 tests.
  5064. 632.33 s [vector] indexed: OK
  5065. 632.33 s [vector] +++ OK, passed 100 tests.
  5066. 632.34 s [vector] update: OK
  5067. 632.34 s [vector] +++ OK, passed 100 tests.
  5068. 632.34 s [vector] concat: OK (0.01s)
  5069. 632.34 s [vector] +++ OK, passed 100 tests.
  5070. 632.34 s [vector] mempty: OK
  5071. 632.34 s [vector] +++ OK, passed 100 tests.
  5072. 632.34 s [vector] mappend: OK
  5073. 632.35 s [vector] +++ OK, passed 100 tests.
  5074. 632.36 s [vector] mconcat: OK (0.01s)
  5075. 632.36 s [vector] +++ OK, passed 100 tests.
  5076. 632.36 s [vector] fmap: OK
  5077. 632.36 s [vector] +++ OK, passed 100 tests.
  5078. 632.36 s [vector] return: OK
  5079. 632.36 s [vector] +++ OK, passed 100 tests.
  5080. 632.38 s [vector] bind: OK (0.02s)
  5081. 632.38 s [vector] +++ OK, passed 100 tests.
  5082. 632.38 s [vector] mzip: OK
  5083. 632.38 s [vector] +++ OK, passed 100 tests.
  5084. 632.38 s [vector] munzip: OK
  5085. 632.38 s [vector] +++ OK, passed 100 tests.
  5086. 632.38 s [vector] applicative_pure: OK
  5087. 632.38 s [vector] +++ OK, passed 100 tests.
  5088. 632.40 s [vector] applicative_appl: OK (0.02s)
  5089. 632.40 s [vector] +++ OK, passed 100 tests.
  5090. 632.40 s [vector] alternative_empty: OK
  5091. 632.40 s [vector] +++ OK, passed 100 tests.
  5092. 632.40 s [vector] alternative_or: OK
  5093. 632.42 s [vector] +++ OK, passed 100 tests.
  5094. 632.44 s [vector] sequence: OK (0.03s)
  5095. 632.44 s [vector] +++ OK, passed 100 tests.
  5096. 632.45 s [vector] sequence_: OK (0.02s)
  5097. 632.45 s [vector] +++ OK, passed 100 tests.
  5098. 632.46 s [vector] glength: OK
  5099. 632.46 s [vector] +++ OK, passed 100 tests.
  5100. 632.46 s [vector] and: OK
  5101. 632.46 s [vector] +++ OK, passed 100 tests.
  5102. 632.46 s [vector] or: OK
  5103. 632.46 s [vector] +++ OK, passed 100 tests.
  5104. 632.46 s [vector] Int
  5105. 632.46 s [vector] fromList.toList == id: OK
  5106. 632.46 s [vector] +++ OK, passed 100 tests.
  5107. 632.46 s [vector] toList.fromList == id: OK
  5108. 632.46 s [vector] +++ OK, passed 100 tests.
  5109. 632.46 s [vector] unstream.stream == id: OK
  5110. 632.46 s [vector] +++ OK, passed 100 tests.
  5111. 632.46 s [vector] stream.unstream == id: OK
  5112. 632.46 s [vector] +++ OK, passed 100 tests.
  5113. 632.46 s [vector] eq: OK
  5114. 632.46 s [vector] +++ OK, passed 100 tests.
  5115. 632.46 s [vector] length: OK
  5116. 632.46 s [vector] +++ OK, passed 100 tests.
  5117. 632.46 s [vector] null: OK
  5118. 632.46 s [vector] +++ OK, passed 100 tests.
  5119. 632.46 s [vector] index: OK
  5120. 632.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5121. 632.46 s [vector] safeIndex: OK
  5122. 632.46 s [vector] +++ OK, passed 100 tests.
  5123. 632.46 s [vector] head: OK
  5124. 632.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5125. 632.47 s [vector] last: OK
  5126. 632.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5127. 632.47 s [vector] unsafeIndex: OK
  5128. 632.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5129. 632.47 s [vector] unsafeHead: OK
  5130. 632.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5131. 632.47 s [vector] unsafeLast: OK
  5132. 632.47 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5133. 632.47 s [vector] slice: OK
  5134. 632.47 s [vector] +++ OK, passed 100 tests.
  5135. 632.47 s [vector] init: OK
  5136. 632.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5137. 632.47 s [vector] tail: OK
  5138. 632.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5139. 632.47 s [vector] take: OK
  5140. 632.47 s [vector] +++ OK, passed 100 tests.
  5141. 632.47 s [vector] drop: OK
  5142. 632.48 s [vector] +++ OK, passed 100 tests.
  5143. 632.48 s [vector] splitAt: OK
  5144. 632.48 s [vector] +++ OK, passed 100 tests.
  5145. 632.48 s [vector] empty: OK
  5146. 632.48 s [vector] +++ OK, passed 100 tests.
  5147. 632.48 s [vector] singleton: OK
  5148. 632.48 s [vector] +++ OK, passed 100 tests.
  5149. 632.48 s [vector] replicate: OK
  5150. 632.48 s [vector] +++ OK, passed 100 tests.
  5151. 632.48 s [vector] generate: OK
  5152. 632.48 s [vector] +++ OK, passed 100 tests.
  5153. 632.48 s [vector] iterateN: OK
  5154. 632.48 s [vector] +++ OK, passed 100 tests.
  5155. 632.54 s [vector] iterateNM: OK (0.06s)
  5156. 632.54 s [vector] +++ OK, passed 100 tests.
  5157. 632.59 s [vector] generateM: OK (0.04s)
  5158. 632.59 s [vector] +++ OK, passed 100 tests.
  5159. 632.61 s [vector] replicateM: OK (0.03s)
  5160. 632.61 s [vector] +++ OK, passed 100 tests.
  5161. 632.61 s [vector] create: OK
  5162. 632.61 s [vector] +++ OK, passed 100 tests.
  5163. 632.61 s [vector] createT: OK
  5164. 632.61 s [vector] +++ OK, passed 100 tests.
  5165. 632.61 s [vector] unfoldr: OK
  5166. 632.61 s [vector] +++ OK, passed 100 tests.
  5167. 632.61 s [vector] unfoldrN: OK
  5168. 632.61 s [vector] +++ OK, passed 100 tests.
  5169. 632.61 s [vector] unfoldrExactN: OK
  5170. 632.62 s [vector] +++ OK, passed 100 tests.
  5171. 632.62 s [vector] unfoldrM: OK
  5172. 632.62 s [vector] +++ OK, passed 100 tests.
  5173. 632.64 s [vector] unfoldrNM: OK (0.01s)
  5174. 632.64 s [vector] +++ OK, passed 100 tests.
  5175. 632.73 s [vector] unfoldrExactNM: OK (0.10s)
  5176. 632.73 s [vector] +++ OK, passed 100 tests.
  5177. 632.73 s [vector] constructN: OK
  5178. 632.73 s [vector] +++ OK, passed 100 tests.
  5179. 632.74 s [vector] constructrN: OK
  5180. 632.74 s [vector] +++ OK, passed 100 tests.
  5181. 632.74 s [vector] cons: OK
  5182. 632.74 s [vector] +++ OK, passed 100 tests.
  5183. 632.74 s [vector] snoc: OK
  5184. 632.74 s [vector] +++ OK, passed 100 tests.
  5185. 632.76 s [vector] append: OK
  5186. 632.76 s [vector] +++ OK, passed 100 tests.
  5187. 632.77 s [vector] concat: OK (0.02s)
  5188. 632.77 s [vector] +++ OK, passed 100 tests.
  5189. 632.77 s [vector] force: OK
  5190. 632.77 s [vector] +++ OK, passed 100 tests.
  5191. 632.78 s [vector] upd: OK
  5192. 632.78 s [vector] +++ OK, passed 100 tests.
  5193. 632.79 s [vector] accum: OK (0.01s)
  5194. 632.79 s [vector] +++ OK, passed 100 tests.
  5195. 632.80 s [vector] reverse: OK
  5196. 632.80 s [vector] +++ OK, passed 100 tests.
  5197. 632.80 s [vector] backpermute: OK
  5198. 632.80 s [vector] +++ OK, passed 100 tests.
  5199. 632.80 s [vector] map: OK
  5200. 632.80 s [vector] +++ OK, passed 100 tests.
  5201. 632.81 s [vector] imap: OK
  5202. 632.81 s [vector] +++ OK, passed 100 tests.
  5203. 632.81 s [vector] concatMap: OK
  5204. 632.82 s [vector] +++ OK, passed 100 tests.
  5205. 632.82 s [vector] mapM: OK
  5206. 632.83 s [vector] +++ OK, passed 100 tests.
  5207. 632.86 s [vector] mapM_: OK (0.04s)
  5208. 632.86 s [vector] +++ OK, passed 100 tests.
  5209. 632.88 s [vector] forM: OK
  5210. 632.88 s [vector] +++ OK, passed 100 tests.
  5211. 632.90 s [vector] forM_: OK (0.04s)
  5212. 632.90 s [vector] +++ OK, passed 100 tests.
  5213. 632.92 s [vector] imapM: OK
  5214. 632.93 s [vector] +++ OK, passed 100 tests.
  5215. 632.95 s [vector] imapM_: OK (0.04s)
  5216. 632.95 s [vector] +++ OK, passed 100 tests.
  5217. 632.96 s [vector] zipWith: OK
  5218. 632.96 s [vector] +++ OK, passed 100 tests.
  5219. 632.96 s [vector] zipWith3: OK
  5220. 632.96 s [vector] +++ OK, passed 100 tests.
  5221. 632.97 s [vector] izipWith: OK
  5222. 632.97 s [vector] +++ OK, passed 100 tests.
  5223. 632.97 s [vector] izipWith3: OK
  5224. 632.97 s [vector] +++ OK, passed 100 tests.
  5225. 633.00 s [vector] izipWithM: OK (0.01s)
  5226. 633.00 s [vector] +++ OK, passed 100 tests.
  5227. 633.02 s [vector] izipWithM_: OK (0.03s)
  5228. 633.02 s [vector] +++ OK, passed 100 tests.
  5229. 633.02 s [vector] zipWithM: OK
  5230. 633.02 s [vector] +++ OK, passed 100 tests.
  5231. 633.04 s [vector] zipWithM_: OK (0.02s)
  5232. 633.04 s [vector] +++ OK, passed 100 tests.
  5233. 633.05 s [vector] filter: OK
  5234. 633.05 s [vector] +++ OK, passed 100 tests.
  5235. 633.05 s [vector] ifilter: OK
  5236. 633.05 s [vector] +++ OK, passed 100 tests.
  5237. 633.10 s [vector] filterM: OK (0.05s)
  5238. 633.10 s [vector] +++ OK, passed 100 tests.
  5239. 633.10 s [vector] uniq: OK
  5240. 633.10 s [vector] +++ OK, passed 100 tests.
  5241. 633.10 s [vector] mapMaybe: OK
  5242. 633.10 s [vector] +++ OK, passed 100 tests.
  5243. 633.10 s [vector] imapMaybe: OK
  5244. 633.10 s [vector] +++ OK, passed 100 tests.
  5245. 633.11 s [vector] takeWhile: OK
  5246. 633.11 s [vector] +++ OK, passed 100 tests.
  5247. 633.11 s [vector] dropWhile: OK
  5248. 633.11 s [vector] +++ OK, passed 100 tests.
  5249. 633.12 s [vector] partition: OK
  5250. 633.12 s [vector] +++ OK, passed 100 tests.
  5251. 633.12 s [vector] partitionWith: OK
  5252. 633.12 s [vector] +++ OK, passed 100 tests.
  5253. 633.12 s [vector] span: OK
  5254. 633.12 s [vector] +++ OK, passed 100 tests.
  5255. 633.12 s [vector] break: OK
  5256. 633.12 s [vector] +++ OK, passed 100 tests.
  5257. 633.12 s [vector] spanR: OK
  5258. 633.12 s [vector] +++ OK, passed 100 tests.
  5259. 633.12 s [vector] breakR: OK
  5260. 633.12 s [vector] +++ OK, passed 100 tests.
  5261. 633.12 s [vector] groupBy: OK
  5262. 633.12 s [vector] +++ OK, passed 100 tests.
  5263. 633.12 s [vector] elem: OK
  5264. 633.12 s [vector] +++ OK, passed 100 tests.
  5265. 633.12 s [vector] notElem: OK
  5266. 633.12 s [vector] +++ OK, passed 100 tests.
  5267. 633.13 s [vector] find: OK
  5268. 633.13 s [vector] +++ OK, passed 100 tests.
  5269. 633.13 s [vector] findIndex: OK
  5270. 633.13 s [vector] +++ OK, passed 100 tests.
  5271. 633.13 s [vector] findIndexR: OK
  5272. 633.13 s [vector] +++ OK, passed 100 tests.
  5273. 633.13 s [vector] findIndices: OK
  5274. 633.13 s [vector] +++ OK, passed 100 tests.
  5275. 633.13 s [vector] elemIndex: OK
  5276. 633.13 s [vector] +++ OK, passed 100 tests.
  5277. 633.14 s [vector] elemIndices: OK
  5278. 633.14 s [vector] +++ OK, passed 100 tests.
  5279. 633.14 s [vector] foldl: OK
  5280. 633.14 s [vector] +++ OK, passed 100 tests.
  5281. 633.15 s [vector] foldl1: OK
  5282. 633.15 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5283. 633.15 s [vector] foldl': OK
  5284. 633.15 s [vector] +++ OK, passed 100 tests.
  5285. 633.15 s [vector] foldl1': OK
  5286. 633.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5287. 633.16 s [vector] foldr: OK
  5288. 633.16 s [vector] +++ OK, passed 100 tests.
  5289. 633.16 s [vector] foldr1: OK
  5290. 633.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5291. 633.17 s [vector] foldr': OK
  5292. 633.17 s [vector] +++ OK, passed 100 tests.
  5293. 633.17 s [vector] foldr1': OK
  5294. 633.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5295. 633.17 s [vector] ifoldl: OK
  5296. 633.17 s [vector] +++ OK, passed 100 tests.
  5297. 633.19 s [vector] ifoldl': OK
  5298. 633.19 s [vector] +++ OK, passed 100 tests.
  5299. 633.20 s [vector] ifoldr: OK
  5300. 633.20 s [vector] +++ OK, passed 100 tests.
  5301. 633.20 s [vector] ifoldr': OK
  5302. 633.20 s [vector] +++ OK, passed 100 tests.
  5303. 633.20 s [vector] ifoldM: OK
  5304. 633.20 s [vector] +++ OK, passed 100 tests.
  5305. 633.21 s [vector] ifoldM': OK
  5306. 633.21 s [vector] +++ OK, passed 100 tests.
  5307. 633.26 s [vector] ifoldM_: OK (0.05s)
  5308. 633.26 s [vector] +++ OK, passed 100 tests.
  5309. 633.32 s [vector] ifoldM'_: OK (0.06s)
  5310. 633.32 s [vector] +++ OK, passed 100 tests.
  5311. 633.32 s [vector] all: OK
  5312. 633.32 s [vector] +++ OK, passed 100 tests.
  5313. 633.33 s [vector] any: OK
  5314. 633.33 s [vector] +++ OK, passed 100 tests.
  5315. 633.34 s [vector] prescanl: OK (0.01s)
  5316. 633.34 s [vector] +++ OK, passed 100 tests.
  5317. 633.35 s [vector] prescanl': OK
  5318. 633.35 s [vector] +++ OK, passed 100 tests.
  5319. 633.35 s [vector] postscanl: OK
  5320. 633.35 s [vector] +++ OK, passed 100 tests.
  5321. 633.36 s [vector] postscanl': OK
  5322. 633.36 s [vector] +++ OK, passed 100 tests.
  5323. 633.37 s [vector] scanl: OK
  5324. 633.37 s [vector] +++ OK, passed 100 tests.
  5325. 633.37 s [vector] scanl': OK
  5326. 633.38 s [vector] +++ OK, passed 100 tests.
  5327. 633.38 s [vector] scanl1: OK
  5328. 633.38 s [vector] +++ OK, passed 100 tests.
  5329. 633.38 s [vector] scanl1': OK
  5330. 633.39 s [vector] +++ OK, passed 100 tests.
  5331. 633.39 s [vector] iscanl: OK
  5332. 633.40 s [vector] +++ OK, passed 100 tests.
  5333. 633.40 s [vector] iscanl': OK
  5334. 633.41 s [vector] +++ OK, passed 100 tests.
  5335. 633.41 s [vector] prescanr: OK
  5336. 633.41 s [vector] +++ OK, passed 100 tests.
  5337. 633.42 s [vector] prescanr': OK
  5338. 633.42 s [vector] +++ OK, passed 100 tests.
  5339. 633.42 s [vector] postscanr: OK
  5340. 633.42 s [vector] +++ OK, passed 100 tests.
  5341. 633.43 s [vector] postscanr': OK
  5342. 633.43 s [vector] +++ OK, passed 100 tests.
  5343. 633.43 s [vector] scanr: OK
  5344. 633.43 s [vector] +++ OK, passed 100 tests.
  5345. 633.43 s [vector] scanr': OK
  5346. 633.44 s [vector] +++ OK, passed 100 tests.
  5347. 633.44 s [vector] scanr1: OK
  5348. 633.44 s [vector] +++ OK, passed 100 tests.
  5349. 633.44 s [vector] scanr1': OK
  5350. 633.44 s [vector] +++ OK, passed 100 tests.
  5351. 633.46 s [vector] iscanr: OK
  5352. 633.46 s [vector] +++ OK, passed 100 tests.
  5353. 633.47 s [vector] iscanr': OK (0.02s)
  5354. 633.47 s [vector] +++ OK, passed 100 tests.
  5355. 633.47 s [vector] mut_read: OK
  5356. 633.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5357. 633.47 s [vector] mut_write: OK
  5358. 633.47 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5359. 633.47 s [vector] mut_modify: OK
  5360. 633.47 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5361. 633.47 s [vector] mut_generate: OK
  5362. 633.48 s [vector] +++ OK, passed 100 tests.
  5363. 633.48 s [vector] mut_generateM: OK
  5364. 633.50 s [vector] +++ OK, passed 100 tests.
  5365. 633.52 s [vector] mut_mapM_: OK (0.02s)
  5366. 633.52 s [vector] +++ OK, passed 100 tests.
  5367. 633.54 s [vector] mut_imapM_: OK (0.02s)
  5368. 633.54 s [vector] +++ OK, passed 100 tests.
  5369. 633.56 s [vector] mut_forM_: OK (0.02s)
  5370. 633.56 s [vector] +++ OK, passed 100 tests.
  5371. 633.57 s [vector] mut_iforM_: OK (0.02s)
  5372. 633.57 s [vector] +++ OK, passed 100 tests.
  5373. 633.57 s [vector] mut_foldr: OK
  5374. 633.57 s [vector] +++ OK, passed 100 tests.
  5375. 633.57 s [vector] mut_foldr': OK
  5376. 633.58 s [vector] +++ OK, passed 100 tests.
  5377. 633.58 s [vector] mut_foldl: OK
  5378. 633.58 s [vector] +++ OK, passed 100 tests.
  5379. 633.58 s [vector] mut_foldl': OK
  5380. 633.58 s [vector] +++ OK, passed 100 tests.
  5381. 633.58 s [vector] mut_ifoldr: OK
  5382. 633.58 s [vector] +++ OK, passed 100 tests.
  5383. 633.58 s [vector] mut_ifoldr': OK
  5384. 633.59 s [vector] +++ OK, passed 100 tests.
  5385. 633.59 s [vector] mut_ifoldl: OK
  5386. 633.59 s [vector] +++ OK, passed 100 tests.
  5387. 633.60 s [vector] mut_ifoldl': OK
  5388. 633.60 s [vector] +++ OK, passed 100 tests.
  5389. 633.60 s [vector] mut_foldM: OK
  5390. 633.60 s [vector] +++ OK, passed 100 tests.
  5391. 633.60 s [vector] mut_foldM': OK
  5392. 633.61 s [vector] +++ OK, passed 100 tests.
  5393. 633.61 s [vector] mut_foldrM: OK
  5394. 633.62 s [vector] +++ OK, passed 100 tests.
  5395. 633.64 s [vector] mut_foldrM': OK
  5396. 633.64 s [vector] +++ OK, passed 100 tests.
  5397. 633.64 s [vector] mut_ifoldM: OK
  5398. 633.64 s [vector] +++ OK, passed 100 tests.
  5399. 633.64 s [vector] mut_ifoldM': OK
  5400. 633.64 s [vector] +++ OK, passed 100 tests.
  5401. 633.65 s [vector] mut_ifoldrM: OK
  5402. 633.65 s [vector] +++ OK, passed 100 tests.
  5403. 633.65 s [vector] mut_ifoldrM': OK
  5404. 633.65 s [vector] +++ OK, passed 100 tests.
  5405. 633.65 s [vector] compare: OK
  5406. 633.65 s [vector] +++ OK, passed 100 tests.
  5407. 633.65 s [vector] maximum: OK
  5408. 633.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5409. 633.65 s [vector] minimum: OK
  5410. 633.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5411. 633.65 s [vector] minIndex: OK
  5412. 633.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5413. 633.65 s [vector] maxIndex: OK
  5414. 633.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5415. 633.65 s [vector] maximumBy: OK
  5416. 633.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5417. 633.65 s [vector] minimumBy: OK
  5418. 633.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5419. 633.66 s [vector] maximumOn: OK
  5420. 633.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5421. 633.66 s [vector] minimumOn: OK
  5422. 633.66 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5423. 633.66 s [vector] maxIndexBy: OK
  5424. 633.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5425. 633.66 s [vector] minIndexBy: OK
  5426. 633.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5427. 633.66 s [vector] ListFirstMaxIndexWins: OK
  5428. 633.66 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5429. 633.66 s [vector] FalseListFirstMaxIndexWins: OK
  5430. 633.66 s [vector] +++ OK, failed as expected. (after 1 test):
  5431. 633.66 s [vector] Exception:
  5432. 633.66 s [vector] Prelude.foldr1: empty list
  5433. 633.66 s [vector] CallStack (from HasCallStack):
  5434. 633.66 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5435. 633.66 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5436. 633.66 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5437. 633.66 s [vector] []
  5438. 633.66 s [vector] zip: OK
  5439. 633.66 s [vector] +++ OK, passed 100 tests.
  5440. 633.66 s [vector] zip3: OK
  5441. 633.66 s [vector] +++ OK, passed 100 tests.
  5442. 633.66 s [vector] unzip: OK
  5443. 633.67 s [vector] +++ OK, passed 100 tests.
  5444. 633.67 s [vector] unzip3: OK
  5445. 633.67 s [vector] +++ OK, passed 100 tests.
  5446. 633.67 s [vector] indexed: OK
  5447. 633.67 s [vector] +++ OK, passed 100 tests.
  5448. 633.68 s [vector] update: OK
  5449. 633.68 s [vector] +++ OK, passed 100 tests.
  5450. 633.69 s [vector] concat: OK (0.02s)
  5451. 633.69 s [vector] +++ OK, passed 100 tests.
  5452. 633.69 s [vector] mempty: OK
  5453. 633.69 s [vector] +++ OK, passed 100 tests.
  5454. 633.70 s [vector] mappend: OK
  5455. 633.70 s [vector] +++ OK, passed 100 tests.
  5456. 633.72 s [vector] mconcat: OK (0.02s)
  5457. 633.72 s [vector] +++ OK, passed 100 tests.
  5458. 633.72 s [vector] fmap: OK
  5459. 633.72 s [vector] +++ OK, passed 100 tests.
  5460. 633.72 s [vector] return: OK
  5461. 633.72 s [vector] +++ OK, passed 100 tests.
  5462. 633.75 s [vector] bind: OK (0.03s)
  5463. 633.75 s [vector] +++ OK, passed 100 tests.
  5464. 633.75 s [vector] mzip: OK
  5465. 633.75 s [vector] +++ OK, passed 100 tests.
  5466. 633.75 s [vector] munzip: OK
  5467. 633.75 s [vector] +++ OK, passed 100 tests.
  5468. 633.76 s [vector] applicative_pure: OK
  5469. 633.76 s [vector] +++ OK, passed 100 tests.
  5470. 633.81 s [vector] applicative_appl: OK (0.06s)
  5471. 633.82 s [vector] +++ OK, passed 100 tests.
  5472. 633.82 s [vector] alternative_empty: OK
  5473. 633.82 s [vector] +++ OK, passed 100 tests.
  5474. 633.82 s [vector] alternative_or: OK
  5475. 633.82 s [vector] +++ OK, passed 100 tests.
  5476. 633.88 s [vector] sequence: OK (0.04s)
  5477. 633.88 s [vector] +++ OK, passed 100 tests.
  5478. 633.89 s [vector] sequence_: OK (0.02s)
  5479. 633.89 s [vector] +++ OK, passed 100 tests.
  5480. 633.89 s [vector] glength: OK
  5481. 633.89 s [vector] +++ OK, passed 100 tests.
  5482. 633.89 s [vector] sum: OK
  5483. 633.89 s [vector] +++ OK, passed 100 tests.
  5484. 633.89 s [vector] product: OK
  5485. 633.89 s [vector] +++ OK, passed 100 tests.
  5486. 633.89 s [vector] enumFromN: OK
  5487. 633.89 s [vector] +++ OK, passed 100 tests.
  5488. 633.89 s [vector] enumFromThenN: OK
  5489. 633.89 s [vector] +++ OK, passed 100 tests.
  5490. 633.89 s [vector] enumFromTo: OK
  5491. 633.90 s [vector] +++ OK, passed 100 tests.
  5492. 633.90 s [vector] enumFromThenTo: OK
  5493. 633.90 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5494. 633.90 s [vector] unstream
  5495. 633.90 s [vector] unstream == vunstream (exact): OK
  5496. 633.90 s [vector] +++ OK, passed 100 tests.
  5497. 633.90 s [vector] unstream == vunstream (unknown): OK
  5498. 633.90 s [vector] +++ OK, passed 100 tests.
  5499. 633.91 s [vector] unstreamR ~= vunstream (exact): OK
  5500. 633.91 s [vector] +++ OK, passed 100 tests.
  5501. 633.91 s [vector] unstreamR ~= vunstream (unknown): OK
  5502. 633.91 s [vector] +++ OK, passed 100 tests.
  5503. 633.91 s [vector] Tests.Vector.Unboxed
  5504. 633.91 s [vector] ()
  5505. 633.91 s [vector] fromList.toList == id: OK
  5506. 633.91 s [vector] +++ OK, passed 100 tests.
  5507. 633.91 s [vector] toList.fromList == id: OK
  5508. 633.91 s [vector] +++ OK, passed 100 tests.
  5509. 633.91 s [vector] unstream.stream == id: OK
  5510. 633.91 s [vector] +++ OK, passed 100 tests.
  5511. 633.91 s [vector] stream.unstream == id: OK
  5512. 633.91 s [vector] +++ OK, passed 100 tests.
  5513. 633.91 s [vector] eq: OK
  5514. 633.91 s [vector] +++ OK, passed 100 tests.
  5515. 633.91 s [vector] length: OK
  5516. 633.91 s [vector] +++ OK, passed 100 tests.
  5517. 633.91 s [vector] null: OK
  5518. 633.91 s [vector] +++ OK, passed 100 tests.
  5519. 633.91 s [vector] index: OK
  5520. 633.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5521. 633.91 s [vector] safeIndex: OK
  5522. 633.91 s [vector] +++ OK, passed 100 tests.
  5523. 633.91 s [vector] head: OK
  5524. 633.91 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5525. 633.91 s [vector] last: OK
  5526. 633.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5527. 633.91 s [vector] unsafeIndex: OK
  5528. 633.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5529. 633.92 s [vector] unsafeHead: OK
  5530. 633.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5531. 633.92 s [vector] unsafeLast: OK
  5532. 633.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5533. 633.92 s [vector] slice: OK
  5534. 633.92 s [vector] +++ OK, passed 100 tests.
  5535. 633.92 s [vector] init: OK
  5536. 633.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5537. 633.92 s [vector] tail: OK
  5538. 633.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5539. 633.92 s [vector] take: OK
  5540. 633.92 s [vector] +++ OK, passed 100 tests.
  5541. 633.92 s [vector] drop: OK
  5542. 633.92 s [vector] +++ OK, passed 100 tests.
  5543. 633.92 s [vector] splitAt: OK
  5544. 633.92 s [vector] +++ OK, passed 100 tests.
  5545. 633.92 s [vector] empty: OK
  5546. 633.92 s [vector] +++ OK, passed 100 tests.
  5547. 633.92 s [vector] singleton: OK
  5548. 633.92 s [vector] +++ OK, passed 100 tests.
  5549. 633.92 s [vector] replicate: OK
  5550. 633.92 s [vector] +++ OK, passed 100 tests.
  5551. 633.92 s [vector] generate: OK
  5552. 633.93 s [vector] +++ OK, passed 100 tests.
  5553. 633.93 s [vector] iterateN: OK
  5554. 633.94 s [vector] +++ OK, passed 100 tests.
  5555. 634.02 s [vector] iterateNM: OK (0.08s)
  5556. 634.02 s [vector] +++ OK, passed 100 tests.
  5557. 634.06 s [vector] generateM: OK (0.04s)
  5558. 634.06 s [vector] +++ OK, passed 100 tests.
  5559. 634.08 s [vector] replicateM: OK (0.02s)
  5560. 634.08 s [vector] +++ OK, passed 100 tests.
  5561. 634.08 s [vector] create: OK
  5562. 634.08 s [vector] +++ OK, passed 100 tests.
  5563. 634.08 s [vector] createT: OK
  5564. 634.08 s [vector] +++ OK, passed 100 tests.
  5565. 634.08 s [vector] unfoldr: OK
  5566. 634.08 s [vector] +++ OK, passed 100 tests.
  5567. 634.09 s [vector] unfoldrN: OK
  5568. 634.10 s [vector] +++ OK, passed 100 tests.
  5569. 634.10 s [vector] unfoldrExactN: OK
  5570. 634.11 s [vector] +++ OK, passed 100 tests.
  5571. 634.12 s [vector] unfoldrM: OK (0.01s)
  5572. 634.12 s [vector] +++ OK, passed 100 tests.
  5573. 634.12 s [vector] unfoldrNM: OK
  5574. 634.12 s [vector] +++ OK, passed 100 tests.
  5575. 634.13 s [vector] unfoldrExactNM: OK (0.02s)
  5576. 634.13 s [vector] +++ OK, passed 100 tests.
  5577. 634.14 s [vector] constructN: OK
  5578. 634.14 s [vector] +++ OK, passed 100 tests.
  5579. 634.14 s [vector] constructrN: OK
  5580. 634.14 s [vector] +++ OK, passed 100 tests.
  5581. 634.14 s [vector] cons: OK
  5582. 634.14 s [vector] +++ OK, passed 100 tests.
  5583. 634.14 s [vector] snoc: OK
  5584. 634.14 s [vector] +++ OK, passed 100 tests.
  5585. 634.14 s [vector] append: OK
  5586. 634.14 s [vector] +++ OK, passed 100 tests.
  5587. 634.16 s [vector] concat: OK (0.02s)
  5588. 634.16 s [vector] +++ OK, passed 100 tests.
  5589. 634.16 s [vector] force: OK
  5590. 634.16 s [vector] +++ OK, passed 100 tests.
  5591. 634.16 s [vector] upd: OK
  5592. 634.17 s [vector] +++ OK, passed 100 tests.
  5593. 634.17 s [vector] accum: OK
  5594. 634.17 s [vector] +++ OK, passed 100 tests.
  5595. 634.17 s [vector] reverse: OK
  5596. 634.17 s [vector] +++ OK, passed 100 tests.
  5597. 634.17 s [vector] backpermute: OK
  5598. 634.17 s [vector] +++ OK, passed 100 tests.
  5599. 634.17 s [vector] map: OK
  5600. 634.17 s [vector] +++ OK, passed 100 tests.
  5601. 634.17 s [vector] imap: OK
  5602. 634.18 s [vector] +++ OK, passed 100 tests.
  5603. 634.18 s [vector] concatMap: OK
  5604. 634.18 s [vector] +++ OK, passed 100 tests.
  5605. 634.18 s [vector] mapM: OK
  5606. 634.18 s [vector] +++ OK, passed 100 tests.
  5607. 634.20 s [vector] mapM_: OK (0.02s)
  5608. 634.20 s [vector] +++ OK, passed 100 tests.
  5609. 634.20 s [vector] forM: OK
  5610. 634.20 s [vector] +++ OK, passed 100 tests.
  5611. 634.22 s [vector] forM_: OK (0.02s)
  5612. 634.22 s [vector] +++ OK, passed 100 tests.
  5613. 634.22 s [vector] imapM: OK
  5614. 634.22 s [vector] +++ OK, passed 100 tests.
  5615. 634.24 s [vector] imapM_: OK (0.02s)
  5616. 634.24 s [vector] +++ OK, passed 100 tests.
  5617. 634.25 s [vector] zipWith: OK
  5618. 634.25 s [vector] +++ OK, passed 100 tests.
  5619. 634.25 s [vector] zipWith3: OK
  5620. 634.25 s [vector] +++ OK, passed 100 tests.
  5621. 634.25 s [vector] izipWith: OK
  5622. 634.25 s [vector] +++ OK, passed 100 tests.
  5623. 634.25 s [vector] izipWith3: OK
  5624. 634.25 s [vector] +++ OK, passed 100 tests.
  5625. 634.26 s [vector] izipWithM: OK
  5626. 634.26 s [vector] +++ OK, passed 100 tests.
  5627. 634.27 s [vector] izipWithM_: OK (0.01s)
  5628. 634.27 s [vector] +++ OK, passed 100 tests.
  5629. 634.27 s [vector] zipWithM: OK
  5630. 634.27 s [vector] +++ OK, passed 100 tests.
  5631. 634.28 s [vector] zipWithM_: OK (0.01s)
  5632. 634.28 s [vector] +++ OK, passed 100 tests.
  5633. 634.28 s [vector] filter: OK
  5634. 634.28 s [vector] +++ OK, passed 100 tests.
  5635. 634.30 s [vector] ifilter: OK
  5636. 634.30 s [vector] +++ OK, passed 100 tests.
  5637. 634.34 s [vector] filterM: OK (0.06s)
  5638. 634.35 s [vector] +++ OK, passed 100 tests.
  5639. 634.35 s [vector] uniq: OK
  5640. 634.35 s [vector] +++ OK, passed 100 tests.
  5641. 634.35 s [vector] mapMaybe: OK
  5642. 634.35 s [vector] +++ OK, passed 100 tests.
  5643. 634.35 s [vector] imapMaybe: OK
  5644. 634.35 s [vector] +++ OK, passed 100 tests.
  5645. 634.35 s [vector] takeWhile: OK
  5646. 634.35 s [vector] +++ OK, passed 100 tests.
  5647. 634.35 s [vector] dropWhile: OK
  5648. 634.35 s [vector] +++ OK, passed 100 tests.
  5649. 634.36 s [vector] partition: OK
  5650. 634.36 s [vector] +++ OK, passed 100 tests.
  5651. 634.36 s [vector] partitionWith: OK
  5652. 634.36 s [vector] +++ OK, passed 100 tests.
  5653. 634.36 s [vector] span: OK
  5654. 634.36 s [vector] +++ OK, passed 100 tests.
  5655. 634.36 s [vector] break: OK
  5656. 634.36 s [vector] +++ OK, passed 100 tests.
  5657. 634.36 s [vector] spanR: OK
  5658. 634.36 s [vector] +++ OK, passed 100 tests.
  5659. 634.36 s [vector] breakR: OK
  5660. 634.36 s [vector] +++ OK, passed 100 tests.
  5661. 634.36 s [vector] groupBy: OK
  5662. 634.36 s [vector] +++ OK, passed 100 tests.
  5663. 634.36 s [vector] elem: OK
  5664. 634.37 s [vector] +++ OK, passed 100 tests.
  5665. 634.37 s [vector] notElem: OK
  5666. 634.37 s [vector] +++ OK, passed 100 tests.
  5667. 634.37 s [vector] find: OK
  5668. 634.37 s [vector] +++ OK, passed 100 tests.
  5669. 634.37 s [vector] findIndex: OK
  5670. 634.37 s [vector] +++ OK, passed 100 tests.
  5671. 634.37 s [vector] findIndexR: OK
  5672. 634.37 s [vector] +++ OK, passed 100 tests.
  5673. 634.37 s [vector] findIndices: OK
  5674. 634.37 s [vector] +++ OK, passed 100 tests.
  5675. 634.37 s [vector] elemIndex: OK
  5676. 634.37 s [vector] +++ OK, passed 100 tests.
  5677. 634.37 s [vector] elemIndices: OK
  5678. 634.37 s [vector] +++ OK, passed 100 tests.
  5679. 634.37 s [vector] foldl: OK
  5680. 634.37 s [vector] +++ OK, passed 100 tests.
  5681. 634.37 s [vector] foldl1: OK
  5682. 634.38 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5683. 634.38 s [vector] foldl': OK
  5684. 634.38 s [vector] +++ OK, passed 100 tests.
  5685. 634.38 s [vector] foldl1': OK
  5686. 634.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5687. 634.38 s [vector] foldr: OK
  5688. 634.38 s [vector] +++ OK, passed 100 tests.
  5689. 634.38 s [vector] foldr1: OK
  5690. 634.38 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5691. 634.38 s [vector] foldr': OK
  5692. 634.38 s [vector] +++ OK, passed 100 tests.
  5693. 634.38 s [vector] foldr1': OK
  5694. 634.38 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5695. 634.38 s [vector] ifoldl: OK
  5696. 634.38 s [vector] +++ OK, passed 100 tests.
  5697. 634.38 s [vector] ifoldl': OK
  5698. 634.38 s [vector] +++ OK, passed 100 tests.
  5699. 634.39 s [vector] ifoldr: OK
  5700. 634.39 s [vector] +++ OK, passed 100 tests.
  5701. 634.39 s [vector] ifoldr': OK
  5702. 634.39 s [vector] +++ OK, passed 100 tests.
  5703. 634.40 s [vector] ifoldM: OK
  5704. 634.40 s [vector] +++ OK, passed 100 tests.
  5705. 634.40 s [vector] ifoldM': OK
  5706. 634.40 s [vector] +++ OK, passed 100 tests.
  5707. 634.42 s [vector] ifoldM_: OK (0.02s)
  5708. 634.42 s [vector] +++ OK, passed 100 tests.
  5709. 634.43 s [vector] ifoldM'_: OK (0.02s)
  5710. 634.44 s [vector] +++ OK, passed 100 tests.
  5711. 634.44 s [vector] all: OK
  5712. 634.44 s [vector] +++ OK, passed 100 tests.
  5713. 634.44 s [vector] any: OK
  5714. 634.44 s [vector] +++ OK, passed 100 tests.
  5715. 634.44 s [vector] prescanl: OK
  5716. 634.44 s [vector] +++ OK, passed 100 tests.
  5717. 634.44 s [vector] prescanl': OK
  5718. 634.44 s [vector] +++ OK, passed 100 tests.
  5719. 634.44 s [vector] postscanl: OK
  5720. 634.44 s [vector] +++ OK, passed 100 tests.
  5721. 634.44 s [vector] postscanl': OK
  5722. 634.45 s [vector] +++ OK, passed 100 tests.
  5723. 634.45 s [vector] scanl: OK
  5724. 634.45 s [vector] +++ OK, passed 100 tests.
  5725. 634.45 s [vector] scanl': OK
  5726. 634.45 s [vector] +++ OK, passed 100 tests.
  5727. 634.46 s [vector] scanl1: OK
  5728. 634.46 s [vector] +++ OK, passed 100 tests.
  5729. 634.46 s [vector] scanl1': OK
  5730. 634.46 s [vector] +++ OK, passed 100 tests.
  5731. 634.46 s [vector] iscanl: OK
  5732. 634.46 s [vector] +++ OK, passed 100 tests.
  5733. 634.46 s [vector] iscanl': OK
  5734. 634.46 s [vector] +++ OK, passed 100 tests.
  5735. 634.47 s [vector] prescanr: OK
  5736. 634.47 s [vector] +++ OK, passed 100 tests.
  5737. 634.47 s [vector] prescanr': OK
  5738. 634.47 s [vector] +++ OK, passed 100 tests.
  5739. 634.47 s [vector] postscanr: OK
  5740. 634.47 s [vector] +++ OK, passed 100 tests.
  5741. 634.47 s [vector] postscanr': OK
  5742. 634.48 s [vector] +++ OK, passed 100 tests.
  5743. 634.48 s [vector] scanr: OK
  5744. 634.48 s [vector] +++ OK, passed 100 tests.
  5745. 634.48 s [vector] scanr': OK
  5746. 634.48 s [vector] +++ OK, passed 100 tests.
  5747. 634.48 s [vector] scanr1: OK
  5748. 634.48 s [vector] +++ OK, passed 100 tests.
  5749. 634.48 s [vector] scanr1': OK
  5750. 634.48 s [vector] +++ OK, passed 100 tests.
  5751. 634.48 s [vector] iscanr: OK
  5752. 634.48 s [vector] +++ OK, passed 100 tests.
  5753. 634.48 s [vector] iscanr': OK
  5754. 634.48 s [vector] +++ OK, passed 100 tests.
  5755. 634.49 s [vector] mut_read: OK
  5756. 634.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5757. 634.49 s [vector] mut_write: OK
  5758. 634.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5759. 634.49 s [vector] mut_modify: OK
  5760. 634.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5761. 634.50 s [vector] mut_generate: OK
  5762. 634.50 s [vector] +++ OK, passed 100 tests.
  5763. 634.52 s [vector] mut_generateM: OK (0.02s)
  5764. 634.52 s [vector] +++ OK, passed 100 tests.
  5765. 634.54 s [vector] mut_mapM_: OK (0.02s)
  5766. 634.54 s [vector] +++ OK, passed 100 tests.
  5767. 634.56 s [vector] mut_imapM_: OK (0.02s)
  5768. 634.56 s [vector] +++ OK, passed 100 tests.
  5769. 634.58 s [vector] mut_forM_: OK (0.01s)
  5770. 634.58 s [vector] +++ OK, passed 100 tests.
  5771. 634.58 s [vector] mut_iforM_: OK (0.02s)
  5772. 634.58 s [vector] +++ OK, passed 100 tests.
  5773. 634.58 s [vector] mut_foldr: OK
  5774. 634.58 s [vector] +++ OK, passed 100 tests.
  5775. 634.58 s [vector] mut_foldr': OK
  5776. 634.59 s [vector] +++ OK, passed 100 tests.
  5777. 634.59 s [vector] mut_foldl: OK
  5778. 634.59 s [vector] +++ OK, passed 100 tests.
  5779. 634.59 s [vector] mut_foldl': OK
  5780. 634.59 s [vector] +++ OK, passed 100 tests.
  5781. 634.59 s [vector] mut_ifoldr: OK
  5782. 634.59 s [vector] +++ OK, passed 100 tests.
  5783. 634.59 s [vector] mut_ifoldr': OK
  5784. 634.59 s [vector] +++ OK, passed 100 tests.
  5785. 634.60 s [vector] mut_ifoldl: OK
  5786. 634.60 s [vector] +++ OK, passed 100 tests.
  5787. 634.60 s [vector] mut_ifoldl': OK
  5788. 634.60 s [vector] +++ OK, passed 100 tests.
  5789. 634.60 s [vector] mut_foldM: OK
  5790. 634.60 s [vector] +++ OK, passed 100 tests.
  5791. 634.60 s [vector] mut_foldM': OK
  5792. 634.60 s [vector] +++ OK, passed 100 tests.
  5793. 634.60 s [vector] mut_foldrM: OK
  5794. 634.60 s [vector] +++ OK, passed 100 tests.
  5795. 634.60 s [vector] mut_foldrM': OK
  5796. 634.60 s [vector] +++ OK, passed 100 tests.
  5797. 634.60 s [vector] mut_ifoldM: OK
  5798. 634.60 s [vector] +++ OK, passed 100 tests.
  5799. 634.61 s [vector] mut_ifoldM': OK
  5800. 634.61 s [vector] +++ OK, passed 100 tests.
  5801. 634.61 s [vector] mut_ifoldrM: OK
  5802. 634.62 s [vector] +++ OK, passed 100 tests.
  5803. 634.62 s [vector] mut_ifoldrM': OK
  5804. 634.62 s [vector] +++ OK, passed 100 tests.
  5805. 634.62 s [vector] compare: OK
  5806. 634.62 s [vector] +++ OK, passed 100 tests.
  5807. 634.62 s [vector] maximum: OK
  5808. 634.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5809. 634.62 s [vector] minimum: OK
  5810. 634.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5811. 634.63 s [vector] minIndex: OK
  5812. 634.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5813. 634.63 s [vector] maxIndex: OK
  5814. 634.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5815. 634.63 s [vector] maximumBy: OK
  5816. 634.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5817. 634.63 s [vector] minimumBy: OK
  5818. 634.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5819. 634.63 s [vector] maximumOn: OK
  5820. 634.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5821. 634.64 s [vector] minimumOn: OK
  5822. 634.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5823. 634.64 s [vector] maxIndexBy: OK
  5824. 634.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5825. 634.64 s [vector] minIndexBy: OK
  5826. 634.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5827. 634.64 s [vector] ListFirstMaxIndexWins: OK
  5828. 634.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5829. 634.64 s [vector] FalseListFirstMaxIndexWins: OK
  5830. 634.64 s [vector] +++ OK, failed as expected. (after 1 test):
  5831. 634.64 s [vector] Exception:
  5832. 634.64 s [vector] Prelude.foldr1: empty list
  5833. 634.64 s [vector] CallStack (from HasCallStack):
  5834. 634.64 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5835. 634.64 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5836. 634.64 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5837. 634.64 s [vector] []
  5838. 634.65 s [vector] zip: OK
  5839. 634.65 s [vector] +++ OK, passed 100 tests.
  5840. 634.65 s [vector] zip3: OK
  5841. 634.65 s [vector] +++ OK, passed 100 tests.
  5842. 634.65 s [vector] unzip: OK
  5843. 634.65 s [vector] +++ OK, passed 100 tests.
  5844. 634.65 s [vector] unzip3: OK
  5845. 634.66 s [vector] +++ OK, passed 100 tests.
  5846. 634.66 s [vector] indexed: OK
  5847. 634.66 s [vector] +++ OK, passed 100 tests.
  5848. 634.67 s [vector] update: OK
  5849. 634.67 s [vector] +++ OK, passed 100 tests.
  5850. 634.67 s [vector] mempty: OK
  5851. 634.67 s [vector] +++ OK, passed 100 tests.
  5852. 634.67 s [vector] mappend: OK
  5853. 634.68 s [vector] +++ OK, passed 100 tests.
  5854. 634.69 s [vector] mconcat: OK (0.02s)
  5855. 634.69 s [vector] +++ OK, passed 100 tests.
  5856. 634.69 s [vector] glength: OK
  5857. 634.69 s [vector] +++ OK, passed 100 tests.
  5858. 634.69 s [vector] (Bool)
  5859. 634.69 s [vector] fromList.toList == id: OK
  5860. 634.69 s [vector] +++ OK, passed 100 tests.
  5861. 634.70 s [vector] toList.fromList == id: OK
  5862. 634.70 s [vector] +++ OK, passed 100 tests.
  5863. 634.70 s [vector] unstream.stream == id: OK
  5864. 634.70 s [vector] +++ OK, passed 100 tests.
  5865. 634.70 s [vector] stream.unstream == id: OK
  5866. 634.70 s [vector] +++ OK, passed 100 tests.
  5867. 634.70 s [vector] eq: OK
  5868. 634.70 s [vector] +++ OK, passed 100 tests.
  5869. 634.70 s [vector] length: OK
  5870. 634.70 s [vector] +++ OK, passed 100 tests.
  5871. 634.70 s [vector] null: OK
  5872. 634.70 s [vector] +++ OK, passed 100 tests.
  5873. 634.70 s [vector] index: OK
  5874. 634.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5875. 634.70 s [vector] safeIndex: OK
  5876. 634.70 s [vector] +++ OK, passed 100 tests.
  5877. 634.70 s [vector] head: OK
  5878. 634.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5879. 634.70 s [vector] last: OK
  5880. 634.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5881. 634.70 s [vector] unsafeIndex: OK
  5882. 634.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5883. 634.70 s [vector] unsafeHead: OK
  5884. 634.71 s [vector] +++ OK, passed 100 tests; 25 discarded.
  5885. 634.71 s [vector] unsafeLast: OK
  5886. 634.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5887. 634.71 s [vector] slice: OK
  5888. 634.71 s [vector] +++ OK, passed 100 tests.
  5889. 634.71 s [vector] init: OK
  5890. 634.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5891. 634.71 s [vector] tail: OK
  5892. 634.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5893. 634.71 s [vector] take: OK
  5894. 634.71 s [vector] +++ OK, passed 100 tests.
  5895. 634.71 s [vector] drop: OK
  5896. 634.71 s [vector] +++ OK, passed 100 tests.
  5897. 634.71 s [vector] splitAt: OK
  5898. 634.71 s [vector] +++ OK, passed 100 tests.
  5899. 634.71 s [vector] empty: OK
  5900. 634.71 s [vector] +++ OK, passed 100 tests.
  5901. 634.71 s [vector] singleton: OK
  5902. 634.71 s [vector] +++ OK, passed 100 tests.
  5903. 634.71 s [vector] replicate: OK
  5904. 634.71 s [vector] +++ OK, passed 100 tests.
  5905. 634.72 s [vector] generate: OK
  5906. 634.72 s [vector] +++ OK, passed 100 tests.
  5907. 634.72 s [vector] iterateN: OK
  5908. 634.72 s [vector] +++ OK, passed 100 tests.
  5909. 634.83 s [vector] iterateNM: OK (0.09s)
  5910. 634.83 s [vector] +++ OK, passed 100 tests.
  5911. 634.84 s [vector] generateM: OK (0.02s)
  5912. 634.84 s [vector] +++ OK, passed 100 tests.
  5913. 634.87 s [vector] replicateM: OK (0.03s)
  5914. 634.87 s [vector] +++ OK, passed 100 tests.
  5915. 634.88 s [vector] create: OK
  5916. 634.88 s [vector] +++ OK, passed 100 tests.
  5917. 634.88 s [vector] createT: OK
  5918. 634.88 s [vector] +++ OK, passed 100 tests.
  5919. 634.88 s [vector] unfoldr: OK
  5920. 634.88 s [vector] +++ OK, passed 100 tests.
  5921. 634.89 s [vector] unfoldrN: OK
  5922. 634.89 s [vector] +++ OK, passed 100 tests.
  5923. 634.89 s [vector] unfoldrExactN: OK
  5924. 634.89 s [vector] +++ OK, passed 100 tests.
  5925. 634.90 s [vector] unfoldrM: OK
  5926. 634.90 s [vector] +++ OK, passed 100 tests.
  5927. 634.90 s [vector] unfoldrNM: OK
  5928. 634.95 s [vector] +++ OK, passed 100 tests.
  5929. 634.99 s [vector] unfoldrExactNM: OK (0.09s)
  5930. 634.99 s [vector] +++ OK, passed 100 tests.
  5931. 635.03 s [vector] constructN: OK
  5932. 635.03 s [vector] +++ OK, passed 100 tests.
  5933. 635.05 s [vector] constructrN: OK
  5934. 635.05 s [vector] +++ OK, passed 100 tests.
  5935. 635.05 s [vector] cons: OK
  5936. 635.05 s [vector] +++ OK, passed 100 tests.
  5937. 635.06 s [vector] snoc: OK
  5938. 635.06 s [vector] +++ OK, passed 100 tests.
  5939. 635.06 s [vector] append: OK
  5940. 635.06 s [vector] +++ OK, passed 100 tests.
  5941. 635.10 s [vector] concat: OK (0.04s)
  5942. 635.10 s [vector] +++ OK, passed 100 tests.
  5943. 635.11 s [vector] force: OK
  5944. 635.11 s [vector] +++ OK, passed 100 tests.
  5945. 635.11 s [vector] upd: OK
  5946. 635.11 s [vector] +++ OK, passed 100 tests.
  5947. 635.12 s [vector] accum: OK
  5948. 635.12 s [vector] +++ OK, passed 100 tests.
  5949. 635.12 s [vector] reverse: OK
  5950. 635.12 s [vector] +++ OK, passed 100 tests.
  5951. 635.13 s [vector] backpermute: OK
  5952. 635.14 s [vector] +++ OK, passed 100 tests.
  5953. 635.14 s [vector] map: OK
  5954. 635.14 s [vector] +++ OK, passed 100 tests.
  5955. 635.14 s [vector] imap: OK
  5956. 635.14 s [vector] +++ OK, passed 100 tests.
  5957. 635.15 s [vector] concatMap: OK
  5958. 635.15 s [vector] +++ OK, passed 100 tests.
  5959. 635.16 s [vector] mapM: OK
  5960. 635.16 s [vector] +++ OK, passed 100 tests.
  5961. 635.22 s [vector] mapM_: OK (0.04s)
  5962. 635.22 s [vector] +++ OK, passed 100 tests.
  5963. 635.22 s [vector] forM: OK
  5964. 635.22 s [vector] +++ OK, passed 100 tests.
  5965. 635.24 s [vector] forM_: OK (0.03s)
  5966. 635.24 s [vector] +++ OK, passed 100 tests.
  5967. 635.26 s [vector] imapM: OK (0.01s)
  5968. 635.26 s [vector] +++ OK, passed 100 tests.
  5969. 635.31 s [vector] imapM_: OK (0.05s)
  5970. 635.31 s [vector] +++ OK, passed 100 tests.
  5971. 635.32 s [vector] zipWith: OK (0.01s)
  5972. 635.33 s [vector] +++ OK, passed 100 tests.
  5973. 635.33 s [vector] zipWith3: OK
  5974. 635.33 s [vector] +++ OK, passed 100 tests.
  5975. 635.33 s [vector] izipWith: OK
  5976. 635.34 s [vector] +++ OK, passed 100 tests.
  5977. 635.34 s [vector] izipWith3: OK (0.01s)
  5978. 635.34 s [vector] +++ OK, passed 100 tests.
  5979. 635.36 s [vector] izipWithM: OK (0.01s)
  5980. 635.36 s [vector] +++ OK, passed 100 tests.
  5981. 635.40 s [vector] izipWithM_: OK (0.04s)
  5982. 635.40 s [vector] +++ OK, passed 100 tests.
  5983. 635.42 s [vector] zipWithM: OK (0.01s)
  5984. 635.42 s [vector] +++ OK, passed 100 tests.
  5985. 635.44 s [vector] zipWithM_: OK (0.03s)
  5986. 635.44 s [vector] +++ OK, passed 100 tests.
  5987. 635.45 s [vector] filter: OK
  5988. 635.46 s [vector] +++ OK, passed 100 tests.
  5989. 635.46 s [vector] ifilter: OK (0.01s)
  5990. 635.46 s [vector] +++ OK, passed 100 tests.
  5991. 635.60 s [vector] filterM: OK (0.11s)
  5992. 635.60 s [vector] +++ OK, passed 100 tests.
  5993. 635.60 s [vector] uniq: OK
  5994. 635.60 s [vector] +++ OK, passed 100 tests.
  5995. 635.60 s [vector] mapMaybe: OK
  5996. 635.60 s [vector] +++ OK, passed 100 tests.
  5997. 635.60 s [vector] imapMaybe: OK
  5998. 635.60 s [vector] +++ OK, passed 100 tests.
  5999. 635.60 s [vector] takeWhile: OK
  6000. 635.60 s [vector] +++ OK, passed 100 tests.
  6001. 635.60 s [vector] dropWhile: OK
  6002. 635.60 s [vector] +++ OK, passed 100 tests.
  6003. 635.60 s [vector] partition: OK
  6004. 635.60 s [vector] +++ OK, passed 100 tests.
  6005. 635.60 s [vector] partitionWith: OK
  6006. 635.60 s [vector] +++ OK, passed 100 tests.
  6007. 635.60 s [vector] span: OK
  6008. 635.60 s [vector] +++ OK, passed 100 tests.
  6009. 635.60 s [vector] break: OK
  6010. 635.60 s [vector] +++ OK, passed 100 tests.
  6011. 635.61 s [vector] spanR: OK
  6012. 635.61 s [vector] +++ OK, passed 100 tests.
  6013. 635.61 s [vector] breakR: OK
  6014. 635.61 s [vector] +++ OK, passed 100 tests.
  6015. 635.61 s [vector] groupBy: OK
  6016. 635.61 s [vector] +++ OK, passed 100 tests.
  6017. 635.61 s [vector] elem: OK
  6018. 635.61 s [vector] +++ OK, passed 100 tests.
  6019. 635.61 s [vector] notElem: OK
  6020. 635.62 s [vector] +++ OK, passed 100 tests.
  6021. 635.62 s [vector] find: OK
  6022. 635.62 s [vector] +++ OK, passed 100 tests.
  6023. 635.62 s [vector] findIndex: OK
  6024. 635.62 s [vector] +++ OK, passed 100 tests.
  6025. 635.62 s [vector] findIndexR: OK
  6026. 635.62 s [vector] +++ OK, passed 100 tests.
  6027. 635.62 s [vector] findIndices: OK
  6028. 635.62 s [vector] +++ OK, passed 100 tests.
  6029. 635.62 s [vector] elemIndex: OK
  6030. 635.62 s [vector] +++ OK, passed 100 tests.
  6031. 635.62 s [vector] elemIndices: OK
  6032. 635.62 s [vector] +++ OK, passed 100 tests.
  6033. 635.62 s [vector] foldl: OK
  6034. 635.63 s [vector] +++ OK, passed 100 tests.
  6035. 635.63 s [vector] foldl1: OK
  6036. 635.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6037. 635.63 s [vector] foldl': OK
  6038. 635.63 s [vector] +++ OK, passed 100 tests.
  6039. 635.63 s [vector] foldl1': OK
  6040. 635.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6041. 635.64 s [vector] foldr: OK
  6042. 635.64 s [vector] +++ OK, passed 100 tests.
  6043. 635.64 s [vector] foldr1: OK
  6044. 635.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6045. 635.64 s [vector] foldr': OK
  6046. 635.64 s [vector] +++ OK, passed 100 tests.
  6047. 635.64 s [vector] foldr1': OK
  6048. 635.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6049. 635.65 s [vector] ifoldl: OK
  6050. 635.65 s [vector] +++ OK, passed 100 tests.
  6051. 635.65 s [vector] ifoldl': OK
  6052. 635.66 s [vector] +++ OK, passed 100 tests.
  6053. 635.66 s [vector] ifoldr: OK
  6054. 635.66 s [vector] +++ OK, passed 100 tests.
  6055. 635.66 s [vector] ifoldr': OK
  6056. 635.66 s [vector] +++ OK, passed 100 tests.
  6057. 635.67 s [vector] ifoldM: OK
  6058. 635.67 s [vector] +++ OK, passed 100 tests.
  6059. 635.68 s [vector] ifoldM': OK
  6060. 635.68 s [vector] +++ OK, passed 100 tests.
  6061. 635.70 s [vector] ifoldM_: OK (0.02s)
  6062. 635.70 s [vector] +++ OK, passed 100 tests.
  6063. 635.71 s [vector] ifoldM'_: OK (0.02s)
  6064. 635.71 s [vector] +++ OK, passed 100 tests.
  6065. 635.71 s [vector] all: OK
  6066. 635.71 s [vector] +++ OK, passed 100 tests.
  6067. 635.71 s [vector] any: OK
  6068. 635.71 s [vector] +++ OK, passed 100 tests.
  6069. 635.71 s [vector] prescanl: OK
  6070. 635.72 s [vector] +++ OK, passed 100 tests.
  6071. 635.72 s [vector] prescanl': OK
  6072. 635.72 s [vector] +++ OK, passed 100 tests.
  6073. 635.72 s [vector] postscanl: OK
  6074. 635.72 s [vector] +++ OK, passed 100 tests.
  6075. 635.72 s [vector] postscanl': OK
  6076. 635.72 s [vector] +++ OK, passed 100 tests.
  6077. 635.73 s [vector] scanl: OK
  6078. 635.73 s [vector] +++ OK, passed 100 tests.
  6079. 635.73 s [vector] scanl': OK
  6080. 635.73 s [vector] +++ OK, passed 100 tests.
  6081. 635.73 s [vector] scanl1: OK
  6082. 635.73 s [vector] +++ OK, passed 100 tests.
  6083. 635.74 s [vector] scanl1': OK
  6084. 635.74 s [vector] +++ OK, passed 100 tests.
  6085. 635.74 s [vector] iscanl: OK
  6086. 635.74 s [vector] +++ OK, passed 100 tests.
  6087. 635.75 s [vector] iscanl': OK
  6088. 635.75 s [vector] +++ OK, passed 100 tests.
  6089. 635.75 s [vector] prescanr: OK
  6090. 635.75 s [vector] +++ OK, passed 100 tests.
  6091. 635.75 s [vector] prescanr': OK
  6092. 635.75 s [vector] +++ OK, passed 100 tests.
  6093. 635.75 s [vector] postscanr: OK
  6094. 635.75 s [vector] +++ OK, passed 100 tests.
  6095. 635.75 s [vector] postscanr': OK
  6096. 635.75 s [vector] +++ OK, passed 100 tests.
  6097. 635.75 s [vector] scanr: OK
  6098. 635.76 s [vector] +++ OK, passed 100 tests.
  6099. 635.76 s [vector] scanr': OK
  6100. 635.76 s [vector] +++ OK, passed 100 tests.
  6101. 635.76 s [vector] scanr1: OK
  6102. 635.76 s [vector] +++ OK, passed 100 tests.
  6103. 635.76 s [vector] scanr1': OK
  6104. 635.77 s [vector] +++ OK, passed 100 tests.
  6105. 635.77 s [vector] iscanr: OK
  6106. 635.77 s [vector] +++ OK, passed 100 tests.
  6107. 635.77 s [vector] iscanr': OK
  6108. 635.77 s [vector] +++ OK, passed 100 tests.
  6109. 635.77 s [vector] mut_read: OK
  6110. 635.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6111. 635.78 s [vector] mut_write: OK
  6112. 635.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6113. 635.78 s [vector] mut_modify: OK
  6114. 635.78 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6115. 635.78 s [vector] mut_generate: OK
  6116. 635.78 s [vector] +++ OK, passed 100 tests.
  6117. 635.80 s [vector] mut_generateM: OK (0.01s)
  6118. 635.80 s [vector] +++ OK, passed 100 tests.
  6119. 635.82 s [vector] mut_mapM_: OK (0.02s)
  6120. 635.82 s [vector] +++ OK, passed 100 tests.
  6121. 635.84 s [vector] mut_imapM_: OK (0.02s)
  6122. 635.84 s [vector] +++ OK, passed 100 tests.
  6123. 635.86 s [vector] mut_forM_: OK (0.02s)
  6124. 635.86 s [vector] +++ OK, passed 100 tests.
  6125. 635.87 s [vector] mut_iforM_: OK (0.02s)
  6126. 635.87 s [vector] +++ OK, passed 100 tests.
  6127. 635.88 s [vector] mut_foldr: OK
  6128. 635.88 s [vector] +++ OK, passed 100 tests.
  6129. 635.88 s [vector] mut_foldr': OK
  6130. 635.88 s [vector] +++ OK, passed 100 tests.
  6131. 635.88 s [vector] mut_foldl: OK
  6132. 635.88 s [vector] +++ OK, passed 100 tests.
  6133. 635.88 s [vector] mut_foldl': OK
  6134. 635.88 s [vector] +++ OK, passed 100 tests.
  6135. 635.89 s [vector] mut_ifoldr: OK
  6136. 635.89 s [vector] +++ OK, passed 100 tests.
  6137. 635.89 s [vector] mut_ifoldr': OK
  6138. 635.89 s [vector] +++ OK, passed 100 tests.
  6139. 635.89 s [vector] mut_ifoldl: OK
  6140. 635.90 s [vector] +++ OK, passed 100 tests.
  6141. 635.90 s [vector] mut_ifoldl': OK
  6142. 635.90 s [vector] +++ OK, passed 100 tests.
  6143. 635.90 s [vector] mut_foldM: OK
  6144. 635.90 s [vector] +++ OK, passed 100 tests.
  6145. 635.90 s [vector] mut_foldM': OK
  6146. 635.91 s [vector] +++ OK, passed 100 tests.
  6147. 635.91 s [vector] mut_foldrM: OK
  6148. 635.91 s [vector] +++ OK, passed 100 tests.
  6149. 635.91 s [vector] mut_foldrM': OK
  6150. 635.91 s [vector] +++ OK, passed 100 tests.
  6151. 635.92 s [vector] mut_ifoldM: OK
  6152. 635.92 s [vector] +++ OK, passed 100 tests.
  6153. 635.93 s [vector] mut_ifoldM': OK
  6154. 635.93 s [vector] +++ OK, passed 100 tests.
  6155. 635.93 s [vector] mut_ifoldrM: OK
  6156. 635.93 s [vector] +++ OK, passed 100 tests.
  6157. 635.93 s [vector] mut_ifoldrM': OK
  6158. 635.93 s [vector] +++ OK, passed 100 tests.
  6159. 635.93 s [vector] compare: OK
  6160. 635.96 s [vector] +++ OK, passed 100 tests.
  6161. 635.96 s [vector] maximum: OK (0.02s)
  6162. 635.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6163. 635.96 s [vector] minimum: OK
  6164. 635.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6165. 635.96 s [vector] minIndex: OK
  6166. 635.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6167. 635.96 s [vector] maxIndex: OK
  6168. 635.97 s [vector] +++ OK, passed 100 tests; 25 discarded.
  6169. 635.97 s [vector] maximumBy: OK
  6170. 635.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6171. 635.97 s [vector] minimumBy: OK
  6172. 635.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6173. 635.97 s [vector] maximumOn: OK
  6174. 635.97 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6175. 635.97 s [vector] minimumOn: OK
  6176. 635.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6177. 635.97 s [vector] maxIndexBy: OK
  6178. 635.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6179. 635.97 s [vector] minIndexBy: OK
  6180. 635.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6181. 635.97 s [vector] ListFirstMaxIndexWins: OK
  6182. 635.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6183. 635.97 s [vector] FalseListFirstMaxIndexWins: OK
  6184. 635.97 s [vector] +++ OK, failed as expected. (after 1 test):
  6185. 635.97 s [vector] Exception:
  6186. 635.97 s [vector] Prelude.foldr1: empty list
  6187. 635.97 s [vector] CallStack (from HasCallStack):
  6188. 635.97 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6189. 635.97 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6190. 635.97 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6191. 635.97 s [vector] []
  6192. 635.98 s [vector] zip: OK
  6193. 635.98 s [vector] +++ OK, passed 100 tests.
  6194. 635.98 s [vector] zip3: OK
  6195. 635.98 s [vector] +++ OK, passed 100 tests.
  6196. 635.98 s [vector] unzip: OK
  6197. 635.98 s [vector] +++ OK, passed 100 tests.
  6198. 635.98 s [vector] unzip3: OK
  6199. 635.98 s [vector] +++ OK, passed 100 tests.
  6200. 635.99 s [vector] indexed: OK
  6201. 635.99 s [vector] +++ OK, passed 100 tests.
  6202. 635.99 s [vector] update: OK
  6203. 635.99 s [vector] +++ OK, passed 100 tests.
  6204. 635.99 s [vector] mempty: OK
  6205. 635.99 s [vector] +++ OK, passed 100 tests.
  6206. 636.00 s [vector] mappend: OK
  6207. 636.00 s [vector] +++ OK, passed 100 tests.
  6208. 636.02 s [vector] mconcat: OK (0.02s)
  6209. 636.02 s [vector] +++ OK, passed 100 tests.
  6210. 636.02 s [vector] glength: OK
  6211. 636.02 s [vector] +++ OK, passed 100 tests.
  6212. 636.02 s [vector] and: OK
  6213. 636.02 s [vector] +++ OK, passed 100 tests.
  6214. 636.02 s [vector] or: OK
  6215. 636.02 s [vector] +++ OK, passed 100 tests.
  6216. 636.02 s [vector] (Int)
  6217. 636.02 s [vector] fromList.toList == id: OK
  6218. 636.02 s [vector] +++ OK, passed 100 tests.
  6219. 636.02 s [vector] toList.fromList == id: OK
  6220. 636.02 s [vector] +++ OK, passed 100 tests.
  6221. 636.02 s [vector] unstream.stream == id: OK
  6222. 636.02 s [vector] +++ OK, passed 100 tests.
  6223. 636.02 s [vector] stream.unstream == id: OK
  6224. 636.02 s [vector] +++ OK, passed 100 tests.
  6225. 636.02 s [vector] eq: OK
  6226. 636.02 s [vector] +++ OK, passed 100 tests.
  6227. 636.02 s [vector] length: OK
  6228. 636.02 s [vector] +++ OK, passed 100 tests.
  6229. 636.02 s [vector] null: OK
  6230. 636.02 s [vector] +++ OK, passed 100 tests.
  6231. 636.03 s [vector] index: OK
  6232. 636.03 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6233. 636.03 s [vector] safeIndex: OK
  6234. 636.03 s [vector] +++ OK, passed 100 tests.
  6235. 636.03 s [vector] head: OK
  6236. 636.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6237. 636.03 s [vector] last: OK
  6238. 636.03 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6239. 636.03 s [vector] unsafeIndex: OK
  6240. 636.03 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6241. 636.03 s [vector] unsafeHead: OK
  6242. 636.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6243. 636.03 s [vector] unsafeLast: OK
  6244. 636.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6245. 636.03 s [vector] slice: OK
  6246. 636.04 s [vector] +++ OK, passed 100 tests.
  6247. 636.04 s [vector] init: OK
  6248. 636.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6249. 636.04 s [vector] tail: OK
  6250. 636.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6251. 636.04 s [vector] take: OK
  6252. 636.04 s [vector] +++ OK, passed 100 tests.
  6253. 636.04 s [vector] drop: OK
  6254. 636.04 s [vector] +++ OK, passed 100 tests.
  6255. 636.04 s [vector] splitAt: OK
  6256. 636.04 s [vector] +++ OK, passed 100 tests.
  6257. 636.04 s [vector] empty: OK
  6258. 636.04 s [vector] +++ OK, passed 100 tests.
  6259. 636.04 s [vector] singleton: OK
  6260. 636.04 s [vector] +++ OK, passed 100 tests.
  6261. 636.04 s [vector] replicate: OK
  6262. 636.04 s [vector] +++ OK, passed 100 tests.
  6263. 636.04 s [vector] generate: OK
  6264. 636.04 s [vector] +++ OK, passed 100 tests.
  6265. 636.06 s [vector] iterateN: OK
  6266. 636.06 s [vector] +++ OK, passed 100 tests.
  6267. 636.12 s [vector] iterateNM: OK (0.08s)
  6268. 636.12 s [vector] +++ OK, passed 100 tests.
  6269. 636.20 s [vector] generateM: OK (0.07s)
  6270. 636.20 s [vector] +++ OK, passed 100 tests.
  6271. 636.20 s [vector] replicateM: OK (0.01s)
  6272. 636.20 s [vector] +++ OK, passed 100 tests.
  6273. 636.20 s [vector] create: OK
  6274. 636.20 s [vector] +++ OK, passed 100 tests.
  6275. 636.20 s [vector] createT: OK
  6276. 636.20 s [vector] +++ OK, passed 100 tests.
  6277. 636.20 s [vector] unfoldr: OK
  6278. 636.20 s [vector] +++ OK, passed 100 tests.
  6279. 636.21 s [vector] unfoldrN: OK
  6280. 636.21 s [vector] +++ OK, passed 100 tests.
  6281. 636.21 s [vector] unfoldrExactN: OK
  6282. 636.21 s [vector] +++ OK, passed 100 tests.
  6283. 636.21 s [vector] unfoldrM: OK
  6284. 636.22 s [vector] +++ OK, passed 100 tests.
  6285. 636.22 s [vector] unfoldrNM: OK
  6286. 636.22 s [vector] +++ OK, passed 100 tests.
  6287. 636.30 s [vector] unfoldrExactNM: OK (0.07s)
  6288. 636.30 s [vector] +++ OK, passed 100 tests.
  6289. 636.30 s [vector] constructN: OK
  6290. 636.30 s [vector] +++ OK, passed 100 tests.
  6291. 636.31 s [vector] constructrN: OK
  6292. 636.50 s [vector] +++ OK, passed 100 tests.
  6293. 636.50 s [vector] cons: OK
  6294. 636.50 s [vector] +++ OK, passed 100 tests.
  6295. 636.50 s [vector] snoc: OK
  6296. 636.50 s [vector] +++ OK, passed 100 tests.
  6297. 636.50 s [vector] append: OK
  6298. 636.50 s [vector] +++ OK, passed 100 tests.
  6299. 636.50 s [vector] concat: OK (0.03s)
  6300. 636.50 s [vector] +++ OK, passed 100 tests.
  6301. 636.50 s [vector] force: OK
  6302. 636.50 s [vector] +++ OK, passed 100 tests.
  6303. 636.50 s [vector] upd: OK
  6304. 636.50 s [vector] +++ OK, passed 100 tests.
  6305. 636.50 s [vector] accum: OK
  6306. 636.50 s [vector] +++ OK, passed 100 tests.
  6307. 636.50 s [vector] reverse: OK
  6308. 636.50 s [vector] +++ OK, passed 100 tests.
  6309. 636.50 s [vector] backpermute: OK
  6310. 636.50 s [vector] +++ OK, passed 100 tests.
  6311. 636.50 s [vector] map: OK
  6312. 636.50 s [vector] +++ OK, passed 100 tests.
  6313. 636.50 s [vector] imap: OK
  6314. 636.50 s [vector] +++ OK, passed 100 tests.
  6315. 636.50 s [vector] concatMap: OK (0.03s)
  6316. 636.50 s [vector] +++ OK, passed 100 tests.
  6317. 636.50 s [vector] mapM: OK
  6318. 636.50 s [vector] +++ OK, passed 100 tests.
  6319. 636.50 s [vector] mapM_: OK (0.03s)
  6320. 636.50 s [vector] +++ OK, passed 100 tests.
  6321. 636.50 s [vector] forM: OK
  6322. 636.50 s [vector] +++ OK, passed 100 tests.
  6323. 636.50 s [vector] forM_: OK (0.03s)
  6324. 636.50 s [vector] +++ OK, passed 100 tests.
  6325. 636.50 s [vector] imapM: OK
  6326. 636.50 s [vector] +++ OK, passed 100 tests.
  6327. 636.51 s [vector] imapM_: OK (0.03s)
  6328. 636.51 s [vector] +++ OK, passed 100 tests.
  6329. 636.51 s [vector] zipWith: OK
  6330. 636.51 s [vector] +++ OK, passed 100 tests.
  6331. 636.51 s [vector] zipWith3: OK
  6332. 636.52 s [vector] +++ OK, passed 100 tests.
  6333. 636.52 s [vector] izipWith: OK
  6334. 636.52 s [vector] +++ OK, passed 100 tests.
  6335. 636.53 s [vector] izipWith3: OK
  6336. 636.53 s [vector] +++ OK, passed 100 tests.
  6337. 636.53 s [vector] izipWithM: OK
  6338. 636.53 s [vector] +++ OK, passed 100 tests.
  6339. 636.56 s [vector] izipWithM_: OK (0.02s)
  6340. 636.56 s [vector] +++ OK, passed 100 tests.
  6341. 636.56 s [vector] zipWithM: OK
  6342. 636.58 s [vector] +++ OK, passed 100 tests.
  6343. 636.58 s [vector] zipWithM_: OK (0.02s)
  6344. 636.58 s [vector] +++ OK, passed 100 tests.
  6345. 636.59 s [vector] filter: OK
  6346. 636.59 s [vector] +++ OK, passed 100 tests.
  6347. 636.59 s [vector] ifilter: OK
  6348. 636.60 s [vector] +++ OK, passed 100 tests.
  6349. 636.64 s [vector] filterM: OK (0.05s)
  6350. 636.64 s [vector] +++ OK, passed 100 tests.
  6351. 636.64 s [vector] uniq: OK
  6352. 636.64 s [vector] +++ OK, passed 100 tests.
  6353. 636.64 s [vector] mapMaybe: OK
  6354. 636.65 s [vector] +++ OK, passed 100 tests.
  6355. 636.65 s [vector] imapMaybe: OK
  6356. 636.65 s [vector] +++ OK, passed 100 tests.
  6357. 636.65 s [vector] takeWhile: OK
  6358. 636.65 s [vector] +++ OK, passed 100 tests.
  6359. 636.65 s [vector] dropWhile: OK
  6360. 636.65 s [vector] +++ OK, passed 100 tests.
  6361. 636.65 s [vector] partition: OK
  6362. 636.66 s [vector] +++ OK, passed 100 tests.
  6363. 636.66 s [vector] partitionWith: OK
  6364. 636.66 s [vector] +++ OK, passed 100 tests.
  6365. 636.66 s [vector] span: OK
  6366. 636.66 s [vector] +++ OK, passed 100 tests.
  6367. 636.66 s [vector] break: OK
  6368. 636.66 s [vector] +++ OK, passed 100 tests.
  6369. 636.66 s [vector] spanR: OK
  6370. 636.66 s [vector] +++ OK, passed 100 tests.
  6371. 636.66 s [vector] breakR: OK
  6372. 636.67 s [vector] +++ OK, passed 100 tests.
  6373. 636.67 s [vector] groupBy: OK
  6374. 636.67 s [vector] +++ OK, passed 100 tests.
  6375. 636.67 s [vector] elem: OK
  6376. 636.67 s [vector] +++ OK, passed 100 tests.
  6377. 636.67 s [vector] notElem: OK
  6378. 636.67 s [vector] +++ OK, passed 100 tests.
  6379. 636.67 s [vector] find: OK
  6380. 636.67 s [vector] +++ OK, passed 100 tests.
  6381. 636.67 s [vector] findIndex: OK
  6382. 636.67 s [vector] +++ OK, passed 100 tests.
  6383. 636.67 s [vector] findIndexR: OK
  6384. 636.67 s [vector] +++ OK, passed 100 tests.
  6385. 636.67 s [vector] findIndices: OK
  6386. 636.67 s [vector] +++ OK, passed 100 tests.
  6387. 636.68 s [vector] elemIndex: OK
  6388. 636.68 s [vector] +++ OK, passed 100 tests.
  6389. 636.68 s [vector] elemIndices: OK
  6390. 636.68 s [vector] +++ OK, passed 100 tests.
  6391. 636.69 s [vector] foldl: OK
  6392. 636.69 s [vector] +++ OK, passed 100 tests.
  6393. 636.69 s [vector] foldl1: OK
  6394. 636.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6395. 636.70 s [vector] foldl': OK
  6396. 636.70 s [vector] +++ OK, passed 100 tests.
  6397. 636.70 s [vector] foldl1': OK
  6398. 636.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6399. 636.71 s [vector] foldr: OK
  6400. 636.71 s [vector] +++ OK, passed 100 tests.
  6401. 636.71 s [vector] foldr1: OK
  6402. 636.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6403. 636.72 s [vector] foldr': OK
  6404. 636.72 s [vector] +++ OK, passed 100 tests.
  6405. 636.72 s [vector] foldr1': OK
  6406. 636.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6407. 636.73 s [vector] ifoldl: OK
  6408. 636.73 s [vector] +++ OK, passed 100 tests.
  6409. 636.73 s [vector] ifoldl': OK
  6410. 636.73 s [vector] +++ OK, passed 100 tests.
  6411. 636.73 s [vector] ifoldr: OK
  6412. 636.74 s [vector] +++ OK, passed 100 tests.
  6413. 636.74 s [vector] ifoldr': OK
  6414. 636.74 s [vector] +++ OK, passed 100 tests.
  6415. 636.75 s [vector] ifoldM: OK
  6416. 636.75 s [vector] +++ OK, passed 100 tests.
  6417. 636.76 s [vector] ifoldM': OK
  6418. 636.76 s [vector] +++ OK, passed 100 tests.
  6419. 636.78 s [vector] ifoldM_: OK (0.03s)
  6420. 636.78 s [vector] +++ OK, passed 100 tests.
  6421. 636.80 s [vector] ifoldM'_: OK (0.02s)
  6422. 636.80 s [vector] +++ OK, passed 100 tests.
  6423. 636.80 s [vector] all: OK
  6424. 636.80 s [vector] +++ OK, passed 100 tests.
  6425. 636.81 s [vector] any: OK
  6426. 636.81 s [vector] +++ OK, passed 100 tests.
  6427. 636.81 s [vector] prescanl: OK
  6428. 636.81 s [vector] +++ OK, passed 100 tests.
  6429. 636.82 s [vector] prescanl': OK
  6430. 636.82 s [vector] +++ OK, passed 100 tests.
  6431. 636.82 s [vector] postscanl: OK
  6432. 636.82 s [vector] +++ OK, passed 100 tests.
  6433. 636.83 s [vector] postscanl': OK
  6434. 636.83 s [vector] +++ OK, passed 100 tests.
  6435. 636.83 s [vector] scanl: OK
  6436. 636.83 s [vector] +++ OK, passed 100 tests.
  6437. 636.83 s [vector] scanl': OK
  6438. 636.84 s [vector] +++ OK, passed 100 tests.
  6439. 636.84 s [vector] scanl1: OK
  6440. 636.84 s [vector] +++ OK, passed 100 tests.
  6441. 636.85 s [vector] scanl1': OK
  6442. 636.85 s [vector] +++ OK, passed 100 tests.
  6443. 636.85 s [vector] iscanl: OK
  6444. 636.85 s [vector] +++ OK, passed 100 tests.
  6445. 636.86 s [vector] iscanl': OK
  6446. 636.86 s [vector] +++ OK, passed 100 tests.
  6447. 636.86 s [vector] prescanr: OK
  6448. 636.86 s [vector] +++ OK, passed 100 tests.
  6449. 636.86 s [vector] prescanr': OK
  6450. 636.86 s [vector] +++ OK, passed 100 tests.
  6451. 636.87 s [vector] postscanr: OK
  6452. 636.87 s [vector] +++ OK, passed 100 tests.
  6453. 636.88 s [vector] postscanr': OK
  6454. 636.88 s [vector] +++ OK, passed 100 tests.
  6455. 636.88 s [vector] scanr: OK
  6456. 636.88 s [vector] +++ OK, passed 100 tests.
  6457. 636.89 s [vector] scanr': OK
  6458. 636.89 s [vector] +++ OK, passed 100 tests.
  6459. 636.89 s [vector] scanr1: OK
  6460. 636.89 s [vector] +++ OK, passed 100 tests.
  6461. 636.90 s [vector] scanr1': OK
  6462. 636.90 s [vector] +++ OK, passed 100 tests.
  6463. 636.91 s [vector] iscanr: OK
  6464. 636.91 s [vector] +++ OK, passed 100 tests.
  6465. 636.91 s [vector] iscanr': OK
  6466. 636.91 s [vector] +++ OK, passed 100 tests.
  6467. 636.91 s [vector] mut_read: OK
  6468. 636.91 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6469. 636.91 s [vector] mut_write: OK
  6470. 636.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6471. 636.91 s [vector] mut_modify: OK
  6472. 636.91 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6473. 636.91 s [vector] mut_generate: OK
  6474. 636.93 s [vector] +++ OK, passed 100 tests.
  6475. 636.94 s [vector] mut_generateM: OK (0.02s)
  6476. 636.94 s [vector] +++ OK, passed 100 tests.
  6477. 636.96 s [vector] mut_mapM_: OK (0.03s)
  6478. 636.96 s [vector] +++ OK, passed 100 tests.
  6479. 637.00 s [vector] mut_imapM_: OK (0.03s)
  6480. 637.00 s [vector] +++ OK, passed 100 tests.
  6481. 637.02 s [vector] mut_forM_: OK (0.02s)
  6482. 637.02 s [vector] +++ OK, passed 100 tests.
  6483. 637.05 s [vector] mut_iforM_: OK (0.03s)
  6484. 637.05 s [vector] +++ OK, passed 100 tests.
  6485. 637.05 s [vector] mut_foldr: OK
  6486. 637.05 s [vector] +++ OK, passed 100 tests.
  6487. 637.05 s [vector] mut_foldr': OK
  6488. 637.05 s [vector] +++ OK, passed 100 tests.
  6489. 637.06 s [vector] mut_foldl: OK
  6490. 637.06 s [vector] +++ OK, passed 100 tests.
  6491. 637.06 s [vector] mut_foldl': OK
  6492. 637.06 s [vector] +++ OK, passed 100 tests.
  6493. 637.07 s [vector] mut_ifoldr: OK
  6494. 637.07 s [vector] +++ OK, passed 100 tests.
  6495. 637.08 s [vector] mut_ifoldr': OK
  6496. 637.08 s [vector] +++ OK, passed 100 tests.
  6497. 637.08 s [vector] mut_ifoldl: OK
  6498. 637.08 s [vector] +++ OK, passed 100 tests.
  6499. 637.09 s [vector] mut_ifoldl': OK
  6500. 637.09 s [vector] +++ OK, passed 100 tests.
  6501. 637.09 s [vector] mut_foldM: OK
  6502. 637.10 s [vector] +++ OK, passed 100 tests.
  6503. 637.10 s [vector] mut_foldM': OK
  6504. 637.10 s [vector] +++ OK, passed 100 tests.
  6505. 637.10 s [vector] mut_foldrM: OK
  6506. 637.10 s [vector] +++ OK, passed 100 tests.
  6507. 637.11 s [vector] mut_foldrM': OK
  6508. 637.11 s [vector] +++ OK, passed 100 tests.
  6509. 637.12 s [vector] mut_ifoldM: OK
  6510. 637.12 s [vector] +++ OK, passed 100 tests.
  6511. 637.12 s [vector] mut_ifoldM': OK
  6512. 637.12 s [vector] +++ OK, passed 100 tests.
  6513. 637.13 s [vector] mut_ifoldrM: OK
  6514. 637.13 s [vector] +++ OK, passed 100 tests.
  6515. 637.13 s [vector] mut_ifoldrM': OK
  6516. 637.13 s [vector] +++ OK, passed 100 tests.
  6517. 637.13 s [vector] compare: OK
  6518. 637.14 s [vector] +++ OK, passed 100 tests.
  6519. 637.14 s [vector] maximum: OK
  6520. 637.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6521. 637.14 s [vector] minimum: OK
  6522. 637.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6523. 637.14 s [vector] minIndex: OK
  6524. 637.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6525. 637.14 s [vector] maxIndex: OK
  6526. 637.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6527. 637.14 s [vector] maximumBy: OK
  6528. 637.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6529. 637.14 s [vector] minimumBy: OK
  6530. 637.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6531. 637.14 s [vector] maximumOn: OK
  6532. 637.15 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6533. 637.15 s [vector] minimumOn: OK
  6534. 637.15 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6535. 637.15 s [vector] maxIndexBy: OK
  6536. 637.15 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6537. 637.15 s [vector] minIndexBy: OK
  6538. 637.15 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6539. 637.15 s [vector] ListFirstMaxIndexWins: OK
  6540. 637.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6541. 637.15 s [vector] FalseListFirstMaxIndexWins: OK
  6542. 637.15 s [vector] +++ OK, failed as expected. (after 1 test):
  6543. 637.15 s [vector] Exception:
  6544. 637.15 s [vector] Prelude.foldr1: empty list
  6545. 637.15 s [vector] CallStack (from HasCallStack):
  6546. 637.15 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6547. 637.15 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6548. 637.15 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6549. 637.15 s [vector] []
  6550. 637.15 s [vector] zip: OK
  6551. 637.15 s [vector] +++ OK, passed 100 tests.
  6552. 637.15 s [vector] zip3: OK
  6553. 637.16 s [vector] +++ OK, passed 100 tests.
  6554. 637.16 s [vector] unzip: OK
  6555. 637.16 s [vector] +++ OK, passed 100 tests.
  6556. 637.16 s [vector] unzip3: OK
  6557. 637.17 s [vector] +++ OK, passed 100 tests.
  6558. 637.17 s [vector] indexed: OK
  6559. 637.17 s [vector] +++ OK, passed 100 tests.
  6560. 637.17 s [vector] update: OK
  6561. 637.17 s [vector] +++ OK, passed 100 tests.
  6562. 637.17 s [vector] mempty: OK
  6563. 637.17 s [vector] +++ OK, passed 100 tests.
  6564. 637.17 s [vector] mappend: OK
  6565. 637.17 s [vector] +++ OK, passed 100 tests.
  6566. 637.19 s [vector] mconcat: OK (0.02s)
  6567. 637.19 s [vector] +++ OK, passed 100 tests.
  6568. 637.19 s [vector] glength: OK
  6569. 637.19 s [vector] +++ OK, passed 100 tests.
  6570. 637.19 s [vector] sum: OK
  6571. 637.19 s [vector] +++ OK, passed 100 tests.
  6572. 637.19 s [vector] product: OK
  6573. 637.20 s [vector] +++ OK, passed 100 tests.
  6574. 637.20 s [vector] enumFromN: OK
  6575. 637.20 s [vector] +++ OK, passed 100 tests.
  6576. 637.20 s [vector] enumFromThenN: OK
  6577. 637.20 s [vector] +++ OK, passed 100 tests.
  6578. 637.20 s [vector] enumFromTo: OK
  6579. 637.20 s [vector] +++ OK, passed 100 tests.
  6580. 637.20 s [vector] enumFromThenTo: OK
  6581. 637.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6582. 637.20 s [vector] (Float)
  6583. 637.20 s [vector] fromList.toList == id: OK
  6584. 637.20 s [vector] +++ OK, passed 100 tests.
  6585. 637.20 s [vector] toList.fromList == id: OK
  6586. 637.20 s [vector] +++ OK, passed 100 tests.
  6587. 637.21 s [vector] unstream.stream == id: OK
  6588. 637.21 s [vector] +++ OK, passed 100 tests.
  6589. 637.21 s [vector] stream.unstream == id: OK
  6590. 637.21 s [vector] +++ OK, passed 100 tests.
  6591. 637.21 s [vector] eq: OK
  6592. 637.21 s [vector] +++ OK, passed 100 tests.
  6593. 637.21 s [vector] length: OK
  6594. 637.21 s [vector] +++ OK, passed 100 tests.
  6595. 637.21 s [vector] null: OK
  6596. 637.21 s [vector] +++ OK, passed 100 tests.
  6597. 637.21 s [vector] index: OK
  6598. 637.21 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6599. 637.21 s [vector] safeIndex: OK
  6600. 637.21 s [vector] +++ OK, passed 100 tests.
  6601. 637.21 s [vector] head: OK
  6602. 637.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6603. 637.21 s [vector] last: OK
  6604. 637.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6605. 637.22 s [vector] unsafeIndex: OK
  6606. 637.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6607. 637.22 s [vector] unsafeHead: OK
  6608. 637.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6609. 637.22 s [vector] unsafeLast: OK
  6610. 637.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6611. 637.22 s [vector] slice: OK
  6612. 637.22 s [vector] +++ OK, passed 100 tests.
  6613. 637.22 s [vector] init: OK
  6614. 637.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6615. 637.22 s [vector] tail: OK
  6616. 637.22 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6617. 637.22 s [vector] take: OK
  6618. 637.23 s [vector] +++ OK, passed 100 tests.
  6619. 637.23 s [vector] drop: OK
  6620. 637.23 s [vector] +++ OK, passed 100 tests.
  6621. 637.23 s [vector] splitAt: OK
  6622. 637.23 s [vector] +++ OK, passed 100 tests.
  6623. 637.23 s [vector] empty: OK
  6624. 637.23 s [vector] +++ OK, passed 100 tests.
  6625. 637.23 s [vector] singleton: OK
  6626. 637.23 s [vector] +++ OK, passed 100 tests.
  6627. 637.23 s [vector] replicate: OK
  6628. 637.23 s [vector] +++ OK, passed 100 tests.
  6629. 637.23 s [vector] generate: OK
  6630. 637.23 s [vector] +++ OK, passed 100 tests.
  6631. 637.24 s [vector] iterateN: OK
  6632. 637.24 s [vector] +++ OK, passed 100 tests.
  6633. 637.32 s [vector] iterateNM: OK (0.08s)
  6634. 637.32 s [vector] +++ OK, passed 100 tests.
  6635. 637.36 s [vector] generateM: OK (0.05s)
  6636. 637.36 s [vector] +++ OK, passed 100 tests.
  6637. 637.36 s [vector] replicateM: OK
  6638. 637.36 s [vector] +++ OK, passed 100 tests.
  6639. 637.36 s [vector] create: OK
  6640. 637.36 s [vector] +++ OK, passed 100 tests.
  6641. 637.36 s [vector] createT: OK
  6642. 637.36 s [vector] +++ OK, passed 100 tests.
  6643. 637.36 s [vector] unfoldr: OK
  6644. 637.36 s [vector] +++ OK, passed 100 tests.
  6645. 637.36 s [vector] unfoldrN: OK
  6646. 637.37 s [vector] +++ OK, passed 100 tests.
  6647. 637.37 s [vector] unfoldrExactN: OK
  6648. 637.37 s [vector] +++ OK, passed 100 tests.
  6649. 637.37 s [vector] unfoldrM: OK
  6650. 637.38 s [vector] +++ OK, passed 100 tests.
  6651. 637.38 s [vector] unfoldrNM: OK
  6652. 637.38 s [vector] +++ OK, passed 100 tests.
  6653. 637.50 s [vector] unfoldrExactNM: OK (0.12s)
  6654. 637.50 s [vector] +++ OK, passed 100 tests.
  6655. 637.52 s [vector] constructN: OK (0.01s)
  6656. 637.52 s [vector] +++ OK, passed 100 tests.
  6657. 637.53 s [vector] constructrN: OK (0.02s)
  6658. 637.53 s [vector] +++ OK, passed 100 tests.
  6659. 637.53 s [vector] cons: OK
  6660. 637.53 s [vector] +++ OK, passed 100 tests.
  6661. 637.54 s [vector] snoc: OK
  6662. 637.54 s [vector] +++ OK, passed 100 tests.
  6663. 637.54 s [vector] append: OK
  6664. 637.54 s [vector] +++ OK, passed 100 tests.
  6665. 637.57 s [vector] concat: OK (0.03s)
  6666. 637.57 s [vector] +++ OK, passed 100 tests.
  6667. 637.58 s [vector] force: OK
  6668. 637.58 s [vector] +++ OK, passed 100 tests.
  6669. 637.58 s [vector] upd: OK
  6670. 637.58 s [vector] +++ OK, passed 100 tests.
  6671. 637.60 s [vector] accum: OK (0.02s)
  6672. 637.60 s [vector] +++ OK, passed 100 tests.
  6673. 637.60 s [vector] reverse: OK
  6674. 637.60 s [vector] +++ OK, passed 100 tests.
  6675. 637.60 s [vector] backpermute: OK
  6676. 637.60 s [vector] +++ OK, passed 100 tests.
  6677. 637.62 s [vector] map: OK
  6678. 637.62 s [vector] +++ OK, passed 100 tests.
  6679. 637.62 s [vector] imap: OK (0.01s)
  6680. 637.62 s [vector] +++ OK, passed 100 tests.
  6681. 637.64 s [vector] concatMap: OK (0.01s)
  6682. 637.64 s [vector] +++ OK, passed 100 tests.
  6683. 637.66 s [vector] mapM: OK (0.01s)
  6684. 637.66 s [vector] +++ OK, passed 100 tests.
  6685. 637.70 s [vector] mapM_: OK (0.06s)
  6686. 637.70 s [vector] +++ OK, passed 100 tests.
  6687. 637.71 s [vector] forM: OK
  6688. 637.72 s [vector] +++ OK, passed 100 tests.
  6689. 637.74 s [vector] forM_: OK (0.04s)
  6690. 637.74 s [vector] +++ OK, passed 100 tests.
  6691. 637.75 s [vector] imapM: OK
  6692. 637.76 s [vector] +++ OK, passed 100 tests.
  6693. 637.79 s [vector] imapM_: OK (0.04s)
  6694. 637.79 s [vector] +++ OK, passed 100 tests.
  6695. 637.80 s [vector] zipWith: OK
  6696. 637.80 s [vector] +++ OK, passed 100 tests.
  6697. 637.80 s [vector] zipWith3: OK
  6698. 637.80 s [vector] +++ OK, passed 100 tests.
  6699. 637.80 s [vector] izipWith: OK
  6700. 637.81 s [vector] +++ OK, passed 100 tests.
  6701. 637.82 s [vector] izipWith3: OK
  6702. 637.82 s [vector] +++ OK, passed 100 tests.
  6703. 637.82 s [vector] izipWithM: OK
  6704. 637.82 s [vector] +++ OK, passed 100 tests.
  6705. 637.86 s [vector] izipWithM_: OK (0.04s)
  6706. 637.86 s [vector] +++ OK, passed 100 tests.
  6707. 637.88 s [vector] zipWithM: OK
  6708. 637.88 s [vector] +++ OK, passed 100 tests.
  6709. 637.90 s [vector] zipWithM_: OK (0.03s)
  6710. 637.90 s [vector] +++ OK, passed 100 tests.
  6711. 637.90 s [vector] filter: OK
  6712. 637.90 s [vector] +++ OK, passed 100 tests.
  6713. 637.91 s [vector] ifilter: OK
  6714. 637.92 s [vector] +++ OK, passed 100 tests.
  6715. 637.97 s [vector] filterM: OK (0.06s)
  6716. 637.97 s [vector] +++ OK, passed 100 tests.
  6717. 637.98 s [vector] uniq: OK
  6718. 637.98 s [vector] +++ OK, passed 100 tests.
  6719. 637.99 s [vector] mapMaybe: OK
  6720. 637.99 s [vector] +++ OK, passed 100 tests.
  6721. 637.99 s [vector] imapMaybe: OK (0.01s)
  6722. 637.99 s [vector] +++ OK, passed 100 tests.
  6723. 638.00 s [vector] takeWhile: OK
  6724. 638.00 s [vector] +++ OK, passed 100 tests.
  6725. 638.00 s [vector] dropWhile: OK
  6726. 638.00 s [vector] +++ OK, passed 100 tests.
  6727. 638.01 s [vector] partition: OK
  6728. 638.01 s [vector] +++ OK, passed 100 tests.
  6729. 638.02 s [vector] partitionWith: OK
  6730. 638.02 s [vector] +++ OK, passed 100 tests.
  6731. 638.02 s [vector] span: OK
  6732. 638.02 s [vector] +++ OK, passed 100 tests.
  6733. 638.02 s [vector] break: OK
  6734. 638.02 s [vector] +++ OK, passed 100 tests.
  6735. 638.03 s [vector] spanR: OK
  6736. 638.03 s [vector] +++ OK, passed 100 tests.
  6737. 638.03 s [vector] breakR: OK
  6738. 638.03 s [vector] +++ OK, passed 100 tests.
  6739. 638.04 s [vector] groupBy: OK
  6740. 638.04 s [vector] +++ OK, passed 100 tests.
  6741. 638.04 s [vector] elem: OK
  6742. 638.04 s [vector] +++ OK, passed 100 tests.
  6743. 638.04 s [vector] notElem: OK
  6744. 638.04 s [vector] +++ OK, passed 100 tests.
  6745. 638.04 s [vector] find: OK
  6746. 638.04 s [vector] +++ OK, passed 100 tests.
  6747. 638.04 s [vector] findIndex: OK
  6748. 638.05 s [vector] +++ OK, passed 100 tests.
  6749. 638.05 s [vector] findIndexR: OK
  6750. 638.05 s [vector] +++ OK, passed 100 tests.
  6751. 638.05 s [vector] findIndices: OK
  6752. 638.05 s [vector] +++ OK, passed 100 tests.
  6753. 638.05 s [vector] elemIndex: OK
  6754. 638.05 s [vector] +++ OK, passed 100 tests.
  6755. 638.06 s [vector] elemIndices: OK
  6756. 638.06 s [vector] +++ OK, passed 100 tests.
  6757. 638.08 s [vector] foldl: OK (0.01s)
  6758. 638.08 s [vector] +++ OK, passed 100 tests.
  6759. 638.08 s [vector] foldl1: OK (0.01s)
  6760. 638.08 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6761. 638.10 s [vector] foldl': OK (0.01s)
  6762. 638.10 s [vector] +++ OK, passed 100 tests.
  6763. 638.11 s [vector] foldl1': OK (0.01s)
  6764. 638.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6765. 638.12 s [vector] foldr: OK
  6766. 638.12 s [vector] +++ OK, passed 100 tests.
  6767. 638.14 s [vector] foldr1: OK (0.01s)
  6768. 638.14 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6769. 638.16 s [vector] foldr': OK (0.02s)
  6770. 638.16 s [vector] +++ OK, passed 100 tests.
  6771. 638.16 s [vector] foldr1': OK (0.01s)
  6772. 638.16 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6773. 638.18 s [vector] ifoldl: OK (0.02s)
  6774. 638.18 s [vector] +++ OK, passed 100 tests.
  6775. 638.20 s [vector] ifoldl': OK (0.01s)
  6776. 638.20 s [vector] +++ OK, passed 100 tests.
  6777. 638.22 s [vector] ifoldr: OK (0.02s)
  6778. 638.22 s [vector] +++ OK, passed 100 tests.
  6779. 638.24 s [vector] ifoldr': OK (0.01s)
  6780. 638.24 s [vector] +++ OK, passed 100 tests.
  6781. 638.26 s [vector] ifoldM: OK (0.02s)
  6782. 638.26 s [vector] +++ OK, passed 100 tests.
  6783. 638.26 s [vector] ifoldM': OK (0.02s)
  6784. 638.26 s [vector] +++ OK, passed 100 tests.
  6785. 638.32 s [vector] ifoldM_: OK (0.06s)
  6786. 638.32 s [vector] +++ OK, passed 100 tests.
  6787. 638.36 s [vector] ifoldM'_: OK (0.03s)
  6788. 638.36 s [vector] +++ OK, passed 100 tests.
  6789. 638.36 s [vector] all: OK
  6790. 638.36 s [vector] +++ OK, passed 100 tests.
  6791. 638.36 s [vector] any: OK
  6792. 638.36 s [vector] +++ OK, passed 100 tests.
  6793. 638.38 s [vector] prescanl: OK
  6794. 638.38 s [vector] +++ OK, passed 100 tests.
  6795. 638.38 s [vector] prescanl': OK
  6796. 638.38 s [vector] +++ OK, passed 100 tests.
  6797. 638.39 s [vector] postscanl: OK
  6798. 638.39 s [vector] +++ OK, passed 100 tests.
  6799. 638.40 s [vector] postscanl': OK
  6800. 638.40 s [vector] +++ OK, passed 100 tests.
  6801. 638.40 s [vector] scanl: OK
  6802. 638.41 s [vector] +++ OK, passed 100 tests.
  6803. 638.42 s [vector] scanl': OK
  6804. 638.42 s [vector] +++ OK, passed 100 tests.
  6805. 638.42 s [vector] scanl1: OK
  6806. 638.42 s [vector] +++ OK, passed 100 tests.
  6807. 638.43 s [vector] scanl1': OK
  6808. 638.44 s [vector] +++ OK, passed 100 tests.
  6809. 638.44 s [vector] iscanl: OK (0.01s)
  6810. 638.44 s [vector] +++ OK, passed 100 tests.
  6811. 638.46 s [vector] iscanl': OK
  6812. 638.46 s [vector] +++ OK, passed 100 tests.
  6813. 638.46 s [vector] prescanr: OK
  6814. 638.46 s [vector] +++ OK, passed 100 tests.
  6815. 638.47 s [vector] prescanr': OK
  6816. 638.47 s [vector] +++ OK, passed 100 tests.
  6817. 638.48 s [vector] postscanr: OK
  6818. 638.48 s [vector] +++ OK, passed 100 tests.
  6819. 638.49 s [vector] postscanr': OK
  6820. 638.49 s [vector] +++ OK, passed 100 tests.
  6821. 638.49 s [vector] scanr: OK
  6822. 638.49 s [vector] +++ OK, passed 100 tests.
  6823. 638.50 s [vector] scanr': OK
  6824. 638.51 s [vector] +++ OK, passed 100 tests.
  6825. 638.51 s [vector] scanr1: OK
  6826. 638.51 s [vector] +++ OK, passed 100 tests.
  6827. 638.52 s [vector] scanr1': OK
  6828. 638.52 s [vector] +++ OK, passed 100 tests.
  6829. 638.52 s [vector] iscanr: OK
  6830. 638.53 s [vector] +++ OK, passed 100 tests.
  6831. 638.53 s [vector] iscanr': OK
  6832. 638.53 s [vector] +++ OK, passed 100 tests.
  6833. 638.54 s [vector] mut_read: OK
  6834. 638.54 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6835. 638.54 s [vector] mut_write: OK
  6836. 638.54 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6837. 638.54 s [vector] mut_modify: OK
  6838. 638.54 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6839. 638.54 s [vector] mut_generate: OK
  6840. 638.55 s [vector] +++ OK, passed 100 tests.
  6841. 638.57 s [vector] mut_generateM: OK (0.02s)
  6842. 638.57 s [vector] +++ OK, passed 100 tests.
  6843. 638.59 s [vector] mut_mapM_: OK (0.04s)
  6844. 638.59 s [vector] +++ OK, passed 100 tests.
  6845. 638.65 s [vector] mut_imapM_: OK (0.03s)
  6846. 638.65 s [vector] +++ OK, passed 100 tests.
  6847. 638.69 s [vector] mut_forM_: OK (0.05s)
  6848. 638.69 s [vector] +++ OK, passed 100 tests.
  6849. 638.75 s [vector] mut_iforM_: OK (0.06s)
  6850. 638.75 s [vector] +++ OK, passed 100 tests.
  6851. 638.77 s [vector] mut_foldr: OK (0.01s)
  6852. 638.77 s [vector] +++ OK, passed 100 tests.
  6853. 638.77 s [vector] mut_foldr': OK (0.01s)
  6854. 638.77 s [vector] +++ OK, passed 100 tests.
  6855. 638.79 s [vector] mut_foldl: OK (0.01s)
  6856. 638.79 s [vector] +++ OK, passed 100 tests.
  6857. 638.81 s [vector] mut_foldl': OK (0.01s)
  6858. 638.81 s [vector] +++ OK, passed 100 tests.
  6859. 638.81 s [vector] mut_ifoldr: OK (0.01s)
  6860. 638.81 s [vector] +++ OK, passed 100 tests.
  6861. 638.83 s [vector] mut_ifoldr': OK
  6862. 638.83 s [vector] +++ OK, passed 100 tests.
  6863. 638.83 s [vector] mut_ifoldl: OK (0.01s)
  6864. 638.83 s [vector] +++ OK, passed 100 tests.
  6865. 638.85 s [vector] mut_ifoldl': OK (0.01s)
  6866. 638.85 s [vector] +++ OK, passed 100 tests.
  6867. 638.86 s [vector] mut_foldM: OK (0.01s)
  6868. 638.86 s [vector] +++ OK, passed 100 tests.
  6869. 638.87 s [vector] mut_foldM': OK (0.01s)
  6870. 638.87 s [vector] +++ OK, passed 100 tests.
  6871. 638.89 s [vector] mut_foldrM: OK
  6872. 638.89 s [vector] +++ OK, passed 100 tests.
  6873. 638.89 s [vector] mut_foldrM': OK (0.01s)
  6874. 638.89 s [vector] +++ OK, passed 100 tests.
  6875. 638.91 s [vector] mut_ifoldM: OK (0.01s)
  6876. 638.91 s [vector] +++ OK, passed 100 tests.
  6877. 638.93 s [vector] mut_ifoldM': OK (0.02s)
  6878. 638.93 s [vector] +++ OK, passed 100 tests.
  6879. 638.95 s [vector] mut_ifoldrM: OK (0.02s)
  6880. 638.95 s [vector] +++ OK, passed 100 tests.
  6881. 638.95 s [vector] mut_ifoldrM': OK (0.01s)
  6882. 638.95 s [vector] +++ OK, passed 100 tests.
  6883. 638.95 s [vector] compare: OK
  6884. 638.95 s [vector] +++ OK, passed 100 tests.
  6885. 638.95 s [vector] maximum: OK
  6886. 638.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6887. 638.95 s [vector] minimum: OK
  6888. 638.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6889. 638.96 s [vector] minIndex: OK
  6890. 638.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6891. 638.96 s [vector] maxIndex: OK
  6892. 638.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6893. 638.97 s [vector] maximumBy: OK
  6894. 638.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6895. 638.97 s [vector] minimumBy: OK
  6896. 638.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6897. 638.97 s [vector] maximumOn: OK
  6898. 638.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6899. 638.98 s [vector] minimumOn: OK
  6900. 638.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6901. 638.98 s [vector] maxIndexBy: OK
  6902. 638.98 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6903. 638.98 s [vector] minIndexBy: OK
  6904. 638.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6905. 638.98 s [vector] ListFirstMaxIndexWins: OK
  6906. 638.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6907. 638.99 s [vector] FalseListFirstMaxIndexWins: OK
  6908. 638.99 s [vector] +++ OK, failed as expected. (after 1 test):
  6909. 638.99 s [vector] Exception:
  6910. 638.99 s [vector] Prelude.foldr1: empty list
  6911. 638.99 s [vector] CallStack (from HasCallStack):
  6912. 638.99 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6913. 638.99 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6914. 638.99 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6915. 638.99 s [vector] []
  6916. 638.99 s [vector] zip: OK
  6917. 638.99 s [vector] +++ OK, passed 100 tests.
  6918. 639.00 s [vector] zip3: OK
  6919. 639.00 s [vector] +++ OK, passed 100 tests.
  6920. 639.00 s [vector] unzip: OK
  6921. 639.00 s [vector] +++ OK, passed 100 tests.
  6922. 639.01 s [vector] unzip3: OK
  6923. 639.01 s [vector] +++ OK, passed 100 tests.
  6924. 639.01 s [vector] indexed: OK
  6925. 639.01 s [vector] +++ OK, passed 100 tests.
  6926. 639.02 s [vector] update: OK
  6927. 639.02 s [vector] +++ OK, passed 100 tests.
  6928. 639.02 s [vector] mempty: OK
  6929. 639.02 s [vector] +++ OK, passed 100 tests.
  6930. 639.02 s [vector] mappend: OK
  6931. 639.03 s [vector] +++ OK, passed 100 tests.
  6932. 639.08 s [vector] mconcat: OK (0.06s)
  6933. 639.08 s [vector] +++ OK, passed 100 tests.
  6934. 639.08 s [vector] glength: OK
  6935. 639.08 s [vector] +++ OK, passed 100 tests.
  6936. 639.08 s [vector] sum: OK
  6937. 639.08 s [vector] +++ OK, passed 100 tests.
  6938. 639.08 s [vector] product: OK
  6939. 639.08 s [vector] +++ OK, passed 100 tests.
  6940. 639.08 s [vector] enumFromN: OK
  6941. 639.08 s [vector] +++ OK, passed 100 tests.
  6942. 639.09 s [vector] enumFromThenN: OK
  6943. 639.09 s [vector] +++ OK, passed 100 tests.
  6944. 639.09 s [vector] enumFromTo: OK
  6945. 639.09 s [vector] +++ OK, passed 100 tests.
  6946. 639.09 s [vector] enumFromThenTo: OK
  6947. 639.09 s [vector] +++ OK, passed 100 tests; 1 discarded.
  6948. 639.09 s [vector] (Double)
  6949. 639.09 s [vector] fromList.toList == id: OK
  6950. 639.09 s [vector] +++ OK, passed 100 tests.
  6951. 639.09 s [vector] toList.fromList == id: OK
  6952. 639.09 s [vector] +++ OK, passed 100 tests.
  6953. 639.09 s [vector] unstream.stream == id: OK
  6954. 639.09 s [vector] +++ OK, passed 100 tests.
  6955. 639.10 s [vector] stream.unstream == id: OK
  6956. 639.10 s [vector] +++ OK, passed 100 tests.
  6957. 639.10 s [vector] eq: OK
  6958. 639.10 s [vector] +++ OK, passed 100 tests.
  6959. 639.10 s [vector] length: OK
  6960. 639.10 s [vector] +++ OK, passed 100 tests.
  6961. 639.10 s [vector] null: OK
  6962. 639.10 s [vector] +++ OK, passed 100 tests.
  6963. 639.10 s [vector] index: OK
  6964. 639.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6965. 639.10 s [vector] safeIndex: OK
  6966. 639.10 s [vector] +++ OK, passed 100 tests.
  6967. 639.11 s [vector] head: OK
  6968. 639.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6969. 639.11 s [vector] last: OK
  6970. 639.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6971. 639.11 s [vector] unsafeIndex: OK
  6972. 639.11 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6973. 639.11 s [vector] unsafeHead: OK
  6974. 639.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6975. 639.11 s [vector] unsafeLast: OK
  6976. 639.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6977. 639.11 s [vector] slice: OK
  6978. 639.11 s [vector] +++ OK, passed 100 tests.
  6979. 639.11 s [vector] init: OK
  6980. 639.11 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6981. 639.11 s [vector] tail: OK
  6982. 639.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6983. 639.12 s [vector] take: OK
  6984. 639.12 s [vector] +++ OK, passed 100 tests.
  6985. 639.12 s [vector] drop: OK
  6986. 639.12 s [vector] +++ OK, passed 100 tests.
  6987. 639.12 s [vector] splitAt: OK
  6988. 639.12 s [vector] +++ OK, passed 100 tests.
  6989. 639.12 s [vector] empty: OK
  6990. 639.12 s [vector] +++ OK, passed 100 tests.
  6991. 639.12 s [vector] singleton: OK
  6992. 639.12 s [vector] +++ OK, passed 100 tests.
  6993. 639.12 s [vector] replicate: OK
  6994. 639.12 s [vector] +++ OK, passed 100 tests.
  6995. 639.12 s [vector] generate: OK
  6996. 639.12 s [vector] +++ OK, passed 100 tests.
  6997. 639.13 s [vector] iterateN: OK
  6998. 639.13 s [vector] +++ OK, passed 100 tests.
  6999. 639.29 s [vector] iterateNM: OK (0.16s)
  7000. 639.29 s [vector] +++ OK, passed 100 tests.
  7001. 639.33 s [vector] generateM: OK (0.05s)
  7002. 639.33 s [vector] +++ OK, passed 100 tests.
  7003. 639.36 s [vector] replicateM: OK (0.02s)
  7004. 639.36 s [vector] +++ OK, passed 100 tests.
  7005. 639.36 s [vector] create: OK
  7006. 639.36 s [vector] +++ OK, passed 100 tests.
  7007. 639.36 s [vector] createT: OK
  7008. 639.36 s [vector] +++ OK, passed 100 tests.
  7009. 639.36 s [vector] unfoldr: OK
  7010. 639.36 s [vector] +++ OK, passed 100 tests.
  7011. 639.36 s [vector] unfoldrN: OK
  7012. 639.36 s [vector] +++ OK, passed 100 tests.
  7013. 639.37 s [vector] unfoldrExactN: OK
  7014. 639.37 s [vector] +++ OK, passed 100 tests.
  7015. 639.37 s [vector] unfoldrM: OK
  7016. 639.37 s [vector] +++ OK, passed 100 tests.
  7017. 639.37 s [vector] unfoldrNM: OK
  7018. 639.39 s [vector] +++ OK, passed 100 tests.
  7019. 639.45 s [vector] unfoldrExactNM: OK (0.07s)
  7020. 639.45 s [vector] +++ OK, passed 100 tests.
  7021. 639.49 s [vector] constructN: OK (0.03s)
  7022. 639.49 s [vector] +++ OK, passed 100 tests.
  7023. 639.50 s [vector] constructrN: OK (0.03s)
  7024. 639.50 s [vector] +++ OK, passed 100 tests.
  7025. 639.50 s [vector] cons: OK
  7026. 639.51 s [vector] +++ OK, passed 100 tests.
  7027. 639.51 s [vector] snoc: OK
  7028. 639.51 s [vector] +++ OK, passed 100 tests.
  7029. 639.51 s [vector] append: OK
  7030. 639.51 s [vector] +++ OK, passed 100 tests.
  7031. 639.56 s [vector] concat: OK (0.05s)
  7032. 639.56 s [vector] +++ OK, passed 100 tests.
  7033. 639.56 s [vector] force: OK
  7034. 639.56 s [vector] +++ OK, passed 100 tests.
  7035. 639.56 s [vector] upd: OK
  7036. 639.59 s [vector] +++ OK, passed 100 tests.
  7037. 639.60 s [vector] accum: OK (0.03s)
  7038. 639.60 s [vector] +++ OK, passed 100 tests.
  7039. 639.60 s [vector] reverse: OK
  7040. 639.60 s [vector] +++ OK, passed 100 tests.
  7041. 639.60 s [vector] backpermute: OK
  7042. 639.60 s [vector] +++ OK, passed 100 tests.
  7043. 639.63 s [vector] map: OK
  7044. 639.63 s [vector] +++ OK, passed 100 tests.
  7045. 639.65 s [vector] imap: OK (0.02s)
  7046. 639.67 s [vector] +++ OK, passed 100 tests.
  7047. 639.67 s [vector] concatMap: OK (0.01s)
  7048. 639.67 s [vector] +++ OK, passed 100 tests.
  7049. 639.67 s [vector] mapM: OK (0.02s)
  7050. 639.67 s [vector] +++ OK, passed 100 tests.
  7051. 639.75 s [vector] mapM_: OK (0.08s)
  7052. 639.75 s [vector] +++ OK, passed 100 tests.
  7053. 639.77 s [vector] forM: OK (0.01s)
  7054. 639.77 s [vector] +++ OK, passed 100 tests.
  7055. 639.86 s [vector] forM_: OK (0.08s)
  7056. 639.86 s [vector] +++ OK, passed 100 tests.
  7057. 639.87 s [vector] imapM: OK (0.04s)
  7058. 639.87 s [vector] +++ OK, passed 100 tests.
  7059. 639.95 s [vector] imapM_: OK (0.06s)
  7060. 639.95 s [vector] +++ OK, passed 100 tests.
  7061. 639.95 s [vector] zipWith: OK (0.02s)
  7062. 639.95 s [vector] +++ OK, passed 100 tests.
  7063. 639.97 s [vector] zipWith3: OK (0.02s)
  7064. 639.97 s [vector] +++ OK, passed 100 tests.
  7065. 640.01 s [vector] izipWith: OK
  7066. 640.01 s [vector] +++ OK, passed 100 tests.
  7067. 640.01 s [vector] izipWith3: OK (0.02s)
  7068. 640.01 s [vector] +++ OK, passed 100 tests.
  7069. 640.03 s [vector] izipWithM: OK (0.02s)
  7070. 640.03 s [vector] +++ OK, passed 100 tests.
  7071. 640.09 s [vector] izipWithM_: OK (0.04s)
  7072. 640.09 s [vector] +++ OK, passed 100 tests.
  7073. 640.09 s [vector] zipWithM: OK (0.01s)
  7074. 640.09 s [vector] +++ OK, passed 100 tests.
  7075. 640.15 s [vector] zipWithM_: OK (0.05s)
  7076. 640.15 s [vector] +++ OK, passed 100 tests.
  7077. 640.15 s [vector] filter: OK (0.01s)
  7078. 640.15 s [vector] +++ OK, passed 100 tests.
  7079. 640.16 s [vector] ifilter: OK (0.01s)
  7080. 640.16 s [vector] +++ OK, passed 100 tests.
  7081. 640.24 s [vector] filterM: OK (0.07s)
  7082. 640.24 s [vector] +++ OK, passed 100 tests.
  7083. 640.24 s [vector] uniq: OK
  7084. 640.25 s [vector] +++ OK, passed 100 tests.
  7085. 640.26 s [vector] mapMaybe: OK (0.01s)
  7086. 640.26 s [vector] +++ OK, passed 100 tests.
  7087. 640.27 s [vector] imapMaybe: OK (0.01s)
  7088. 640.27 s [vector] +++ OK, passed 100 tests.
  7089. 640.27 s [vector] takeWhile: OK
  7090. 640.27 s [vector] +++ OK, passed 100 tests.
  7091. 640.28 s [vector] dropWhile: OK
  7092. 640.28 s [vector] +++ OK, passed 100 tests.
  7093. 640.30 s [vector] partition: OK (0.01s)
  7094. 640.30 s [vector] +++ OK, passed 100 tests.
  7095. 640.30 s [vector] partitionWith: OK (0.01s)
  7096. 640.30 s [vector] +++ OK, passed 100 tests.
  7097. 640.30 s [vector] span: OK
  7098. 640.30 s [vector] +++ OK, passed 100 tests.
  7099. 640.30 s [vector] break: OK
  7100. 640.30 s [vector] +++ OK, passed 100 tests.
  7101. 640.30 s [vector] spanR: OK
  7102. 640.31 s [vector] +++ OK, passed 100 tests.
  7103. 640.31 s [vector] breakR: OK
  7104. 640.31 s [vector] +++ OK, passed 100 tests.
  7105. 640.33 s [vector] groupBy: OK (0.02s)
  7106. 640.33 s [vector] +++ OK, passed 100 tests.
  7107. 640.33 s [vector] elem: OK
  7108. 640.33 s [vector] +++ OK, passed 100 tests.
  7109. 640.33 s [vector] notElem: OK
  7110. 640.33 s [vector] +++ OK, passed 100 tests.
  7111. 640.33 s [vector] find: OK
  7112. 640.33 s [vector] +++ OK, passed 100 tests.
  7113. 640.34 s [vector] findIndex: OK
  7114. 640.34 s [vector] +++ OK, passed 100 tests.
  7115. 640.34 s [vector] findIndexR: OK
  7116. 640.34 s [vector] +++ OK, passed 100 tests.
  7117. 640.35 s [vector] findIndices: OK (0.01s)
  7118. 640.35 s [vector] +++ OK, passed 100 tests.
  7119. 640.35 s [vector] elemIndex: OK
  7120. 640.35 s [vector] +++ OK, passed 100 tests.
  7121. 640.35 s [vector] elemIndices: OK
  7122. 640.36 s [vector] +++ OK, passed 100 tests.
  7123. 640.38 s [vector] foldl: OK (0.02s)
  7124. 640.38 s [vector] +++ OK, passed 100 tests.
  7125. 640.40 s [vector] foldl1: OK (0.03s)
  7126. 640.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7127. 640.44 s [vector] foldl': OK (0.03s)
  7128. 640.44 s [vector] +++ OK, passed 100 tests.
  7129. 640.45 s [vector] foldl1': OK (0.02s)
  7130. 640.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7131. 640.48 s [vector] foldr: OK (0.02s)
  7132. 640.48 s [vector] +++ OK, passed 100 tests.
  7133. 640.50 s [vector] foldr1: OK (0.02s)
  7134. 640.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7135. 640.54 s [vector] foldr': OK (0.03s)
  7136. 640.54 s [vector] +++ OK, passed 100 tests.
  7137. 640.56 s [vector] foldr1': OK (0.03s)
  7138. 640.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7139. 640.60 s [vector] ifoldl: OK (0.03s)
  7140. 640.60 s [vector] +++ OK, passed 100 tests.
  7141. 640.62 s [vector] ifoldl': OK (0.03s)
  7142. 640.62 s [vector] +++ OK, passed 100 tests.
  7143. 640.66 s [vector] ifoldr: OK (0.03s)
  7144. 640.66 s [vector] +++ OK, passed 100 tests.
  7145. 640.68 s [vector] ifoldr': OK (0.03s)
  7146. 640.68 s [vector] +++ OK, passed 100 tests.
  7147. 640.70 s [vector] ifoldM: OK (0.03s)
  7148. 640.70 s [vector] +++ OK, passed 100 tests.
  7149. 640.74 s [vector] ifoldM': OK (0.02s)
  7150. 640.74 s [vector] +++ OK, passed 100 tests.
  7151. 640.80 s [vector] ifoldM_: OK (0.07s)
  7152. 640.80 s [vector] +++ OK, passed 100 tests.
  7153. 640.88 s [vector] ifoldM'_: OK (0.09s)
  7154. 640.88 s [vector] +++ OK, passed 100 tests.
  7155. 640.88 s [vector] all: OK
  7156. 640.88 s [vector] +++ OK, passed 100 tests.
  7157. 640.88 s [vector] any: OK
  7158. 640.90 s [vector] +++ OK, passed 100 tests.
  7159. 640.92 s [vector] prescanl: OK (0.03s)
  7160. 640.92 s [vector] +++ OK, passed 100 tests.
  7161. 640.96 s [vector] prescanl': OK (0.03s)
  7162. 640.96 s [vector] +++ OK, passed 100 tests.
  7163. 640.98 s [vector] postscanl: OK (0.03s)
  7164. 640.98 s [vector] +++ OK, passed 100 tests.
  7165. 640.99 s [vector] postscanl': OK (0.02s)
  7166. 640.99 s [vector] +++ OK, passed 100 tests.
  7167. 641.02 s [vector] scanl: OK (0.02s)
  7168. 641.02 s [vector] +++ OK, passed 100 tests.
  7169. 641.06 s [vector] scanl': OK (0.03s)
  7170. 641.06 s [vector] +++ OK, passed 100 tests.
  7171. 641.10 s [vector] scanl1: OK (0.03s)
  7172. 641.10 s [vector] +++ OK, passed 100 tests.
  7173. 641.12 s [vector] scanl1': OK (0.03s)
  7174. 641.12 s [vector] +++ OK, passed 100 tests.
  7175. 641.16 s [vector] iscanl: OK (0.03s)
  7176. 641.16 s [vector] +++ OK, passed 100 tests.
  7177. 641.18 s [vector] iscanl': OK (0.03s)
  7178. 641.18 s [vector] +++ OK, passed 100 tests.
  7179. 641.22 s [vector] prescanr: OK (0.03s)
  7180. 641.22 s [vector] +++ OK, passed 100 tests.
  7181. 641.24 s [vector] prescanr': OK (0.02s)
  7182. 641.24 s [vector] +++ OK, passed 100 tests.
  7183. 641.24 s [vector] postscanr: OK (0.01s)
  7184. 641.24 s [vector] +++ OK, passed 100 tests.
  7185. 641.26 s [vector] postscanr': OK (0.01s)
  7186. 641.26 s [vector] +++ OK, passed 100 tests.
  7187. 641.28 s [vector] scanr: OK (0.01s)
  7188. 641.28 s [vector] +++ OK, passed 100 tests.
  7189. 641.28 s [vector] scanr': OK (0.01s)
  7190. 641.28 s [vector] +++ OK, passed 100 tests.
  7191. 641.30 s [vector] scanr1: OK (0.02s)
  7192. 641.30 s [vector] +++ OK, passed 100 tests.
  7193. 641.33 s [vector] scanr1': OK
  7194. 641.33 s [vector] +++ OK, passed 100 tests.
  7195. 641.43 s [vector] iscanr: OK
  7196. 641.43 s [vector] +++ OK, passed 100 tests.
  7197. 641.43 s [vector] iscanr': OK (0.02s)
  7198. 641.43 s [vector] +++ OK, passed 100 tests.
  7199. 641.43 s [vector] mut_read: OK
  7200. 641.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7201. 641.43 s [vector] mut_write: OK
  7202. 641.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7203. 641.43 s [vector] mut_modify: OK
  7204. 641.43 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7205. 641.43 s [vector] mut_generate: OK
  7206. 641.43 s [vector] +++ OK, passed 100 tests.
  7207. 641.43 s [vector] mut_generateM: OK (0.03s)
  7208. 641.43 s [vector] +++ OK, passed 100 tests.
  7209. 641.48 s [vector] mut_mapM_: OK (0.07s)
  7210. 641.48 s [vector] +++ OK, passed 100 tests.
  7211. 641.52 s [vector] mut_imapM_: OK (0.05s)
  7212. 641.52 s [vector] +++ OK, passed 100 tests.
  7213. 641.56 s [vector] mut_forM_: OK (0.04s)
  7214. 641.56 s [vector] +++ OK, passed 100 tests.
  7215. 641.60 s [vector] mut_iforM_: OK (0.04s)
  7216. 641.60 s [vector] +++ OK, passed 100 tests.
  7217. 641.62 s [vector] mut_foldr: OK (0.02s)
  7218. 641.62 s [vector] +++ OK, passed 100 tests.
  7219. 641.62 s [vector] mut_foldr': OK (0.01s)
  7220. 641.62 s [vector] +++ OK, passed 100 tests.
  7221. 641.63 s [vector] mut_foldl: OK
  7222. 641.64 s [vector] +++ OK, passed 100 tests.
  7223. 641.66 s [vector] mut_foldl': OK (0.02s)
  7224. 641.66 s [vector] +++ OK, passed 100 tests.
  7225. 641.69 s [vector] mut_ifoldr: OK (0.02s)
  7226. 641.69 s [vector] +++ OK, passed 100 tests.
  7227. 641.70 s [vector] mut_ifoldr': OK (0.02s)
  7228. 641.70 s [vector] +++ OK, passed 100 tests.
  7229. 641.75 s [vector] mut_ifoldl: OK (0.03s)
  7230. 641.75 s [vector] +++ OK, passed 100 tests.
  7231. 641.75 s [vector] mut_ifoldl': OK (0.03s)
  7232. 641.75 s [vector] +++ OK, passed 100 tests.
  7233. 641.77 s [vector] mut_foldM: OK
  7234. 641.78 s [vector] +++ OK, passed 100 tests.
  7235. 641.80 s [vector] mut_foldM': OK (0.02s)
  7236. 641.80 s [vector] +++ OK, passed 100 tests.
  7237. 641.80 s [vector] mut_foldrM: OK (0.01s)
  7238. 641.80 s [vector] +++ OK, passed 100 tests.
  7239. 641.82 s [vector] mut_foldrM': OK (0.01s)
  7240. 641.82 s [vector] +++ OK, passed 100 tests.
  7241. 641.84 s [vector] mut_ifoldM: OK (0.01s)
  7242. 641.85 s [vector] +++ OK, passed 100 tests.
  7243. 641.86 s [vector] mut_ifoldM': OK (0.02s)
  7244. 641.86 s [vector] +++ OK, passed 100 tests.
  7245. 641.88 s [vector] mut_ifoldrM: OK (0.02s)
  7246. 641.88 s [vector] +++ OK, passed 100 tests.
  7247. 641.88 s [vector] mut_ifoldrM': OK (0.01s)
  7248. 641.88 s [vector] +++ OK, passed 100 tests.
  7249. 641.88 s [vector] compare: OK
  7250. 641.88 s [vector] +++ OK, passed 100 tests.
  7251. 641.88 s [vector] maximum: OK
  7252. 641.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7253. 641.88 s [vector] minimum: OK
  7254. 641.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7255. 641.88 s [vector] minIndex: OK
  7256. 641.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7257. 641.88 s [vector] maxIndex: OK
  7258. 641.89 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7259. 641.89 s [vector] maximumBy: OK
  7260. 641.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7261. 641.89 s [vector] minimumBy: OK
  7262. 641.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7263. 641.89 s [vector] maximumOn: OK
  7264. 641.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7265. 641.89 s [vector] minimumOn: OK
  7266. 641.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7267. 641.89 s [vector] maxIndexBy: OK
  7268. 641.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7269. 641.90 s [vector] minIndexBy: OK
  7270. 641.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7271. 641.90 s [vector] ListFirstMaxIndexWins: OK
  7272. 641.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7273. 641.90 s [vector] FalseListFirstMaxIndexWins: OK
  7274. 641.90 s [vector] +++ OK, failed as expected. (after 1 test):
  7275. 641.90 s [vector] Exception:
  7276. 641.90 s [vector] Prelude.foldr1: empty list
  7277. 641.90 s [vector] CallStack (from HasCallStack):
  7278. 641.90 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7279. 641.90 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7280. 641.90 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7281. 641.90 s [vector] []
  7282. 641.90 s [vector] zip: OK
  7283. 641.90 s [vector] +++ OK, passed 100 tests.
  7284. 641.90 s [vector] zip3: OK
  7285. 641.90 s [vector] +++ OK, passed 100 tests.
  7286. 641.91 s [vector] unzip: OK
  7287. 641.91 s [vector] +++ OK, passed 100 tests.
  7288. 641.91 s [vector] unzip3: OK
  7289. 641.91 s [vector] +++ OK, passed 100 tests.
  7290. 641.92 s [vector] indexed: OK
  7291. 641.92 s [vector] +++ OK, passed 100 tests.
  7292. 641.92 s [vector] update: OK
  7293. 641.92 s [vector] +++ OK, passed 100 tests.
  7294. 641.92 s [vector] mempty: OK
  7295. 641.92 s [vector] +++ OK, passed 100 tests.
  7296. 641.92 s [vector] mappend: OK
  7297. 641.92 s [vector] +++ OK, passed 100 tests.
  7298. 641.96 s [vector] mconcat: OK (0.04s)
  7299. 641.97 s [vector] +++ OK, passed 100 tests.
  7300. 641.97 s [vector] glength: OK
  7301. 641.97 s [vector] +++ OK, passed 100 tests.
  7302. 641.97 s [vector] sum: OK
  7303. 641.97 s [vector] +++ OK, passed 100 tests.
  7304. 641.97 s [vector] product: OK
  7305. 641.97 s [vector] +++ OK, passed 100 tests.
  7306. 641.97 s [vector] enumFromN: OK
  7307. 641.97 s [vector] +++ OK, passed 100 tests.
  7308. 641.97 s [vector] enumFromThenN: OK
  7309. 641.97 s [vector] +++ OK, passed 100 tests.
  7310. 641.97 s [vector] enumFromTo: OK
  7311. 641.97 s [vector] +++ OK, passed 100 tests.
  7312. 641.97 s [vector] enumFromThenTo: OK
  7313. 641.97 s [vector] +++ OK, passed 100 tests; 2 discarded.
  7314. 641.97 s [vector] (Int,Bool)
  7315. 641.98 s [vector] fromList.toList == id: OK
  7316. 641.98 s [vector] +++ OK, passed 100 tests.
  7317. 641.98 s [vector] toList.fromList == id: OK
  7318. 641.98 s [vector] +++ OK, passed 100 tests.
  7319. 641.98 s [vector] unstream.stream == id: OK
  7320. 641.98 s [vector] +++ OK, passed 100 tests.
  7321. 641.98 s [vector] stream.unstream == id: OK
  7322. 641.98 s [vector] +++ OK, passed 100 tests.
  7323. 641.98 s [vector] eq: OK
  7324. 641.98 s [vector] +++ OK, passed 100 tests.
  7325. 641.99 s [vector] length: OK
  7326. 641.99 s [vector] +++ OK, passed 100 tests.
  7327. 641.99 s [vector] null: OK
  7328. 641.99 s [vector] +++ OK, passed 100 tests.
  7329. 641.99 s [vector] index: OK
  7330. 641.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7331. 641.99 s [vector] safeIndex: OK
  7332. 641.99 s [vector] +++ OK, passed 100 tests.
  7333. 641.99 s [vector] head: OK
  7334. 641.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7335. 641.99 s [vector] last: OK
  7336. 641.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7337. 641.99 s [vector] unsafeIndex: OK
  7338. 642.00 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7339. 642.00 s [vector] unsafeHead: OK
  7340. 642.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7341. 642.00 s [vector] unsafeLast: OK
  7342. 642.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7343. 642.00 s [vector] slice: OK
  7344. 642.00 s [vector] +++ OK, passed 100 tests.
  7345. 642.00 s [vector] init: OK
  7346. 642.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7347. 642.00 s [vector] tail: OK
  7348. 642.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7349. 642.00 s [vector] take: OK
  7350. 642.02 s [vector] +++ OK, passed 100 tests.
  7351. 642.03 s [vector] drop: OK (0.02s)
  7352. 642.03 s [vector] +++ OK, passed 100 tests.
  7353. 642.03 s [vector] splitAt: OK
  7354. 642.03 s [vector] +++ OK, passed 100 tests.
  7355. 642.03 s [vector] empty: OK
  7356. 642.03 s [vector] +++ OK, passed 100 tests.
  7357. 642.03 s [vector] singleton: OK
  7358. 642.03 s [vector] +++ OK, passed 100 tests.
  7359. 642.03 s [vector] replicate: OK
  7360. 642.03 s [vector] +++ OK, passed 100 tests.
  7361. 642.03 s [vector] generate: OK
  7362. 642.04 s [vector] +++ OK, passed 100 tests.
  7363. 642.04 s [vector] iterateN: OK
  7364. 642.04 s [vector] +++ OK, passed 100 tests.
  7365. 642.08 s [vector] iterateNM: OK (0.04s)
  7366. 642.08 s [vector] +++ OK, passed 100 tests.
  7367. 642.12 s [vector] generateM: OK (0.04s)
  7368. 642.12 s [vector] +++ OK, passed 100 tests.
  7369. 642.16 s [vector] replicateM: OK (0.04s)
  7370. 642.16 s [vector] +++ OK, passed 100 tests.
  7371. 642.16 s [vector] create: OK
  7372. 642.16 s [vector] +++ OK, passed 100 tests.
  7373. 642.16 s [vector] createT: OK
  7374. 642.16 s [vector] +++ OK, passed 100 tests.
  7375. 642.16 s [vector] unfoldr: OK
  7376. 642.16 s [vector] +++ OK, passed 100 tests.
  7377. 642.16 s [vector] unfoldrN: OK
  7378. 642.16 s [vector] +++ OK, passed 100 tests.
  7379. 642.16 s [vector] unfoldrExactN: OK
  7380. 642.17 s [vector] +++ OK, passed 100 tests.
  7381. 642.17 s [vector] unfoldrM: OK
  7382. 642.17 s [vector] +++ OK, passed 100 tests.
  7383. 642.17 s [vector] unfoldrNM: OK
  7384. 642.18 s [vector] +++ OK, passed 100 tests.
  7385. 642.32 s [vector] unfoldrExactNM: OK (0.14s)
  7386. 642.32 s [vector] +++ OK, passed 100 tests.
  7387. 642.34 s [vector] constructN: OK (0.01s)
  7388. 642.34 s [vector] +++ OK, passed 100 tests.
  7389. 642.34 s [vector] constructrN: OK (0.01s)
  7390. 642.34 s [vector] +++ OK, passed 100 tests.
  7391. 642.35 s [vector] cons: OK
  7392. 642.35 s [vector] +++ OK, passed 100 tests.
  7393. 642.35 s [vector] snoc: OK
  7394. 642.35 s [vector] +++ OK, passed 100 tests.
  7395. 642.36 s [vector] append: OK
  7396. 642.36 s [vector] +++ OK, passed 100 tests.
  7397. 642.42 s [vector] concat: OK (0.07s)
  7398. 642.42 s [vector] +++ OK, passed 100 tests.
  7399. 642.43 s [vector] force: OK
  7400. 642.43 s [vector] +++ OK, passed 100 tests.
  7401. 642.43 s [vector] upd: OK
  7402. 642.44 s [vector] +++ OK, passed 100 tests.
  7403. 642.44 s [vector] accum: OK (0.01s)
  7404. 642.44 s [vector] +++ OK, passed 100 tests.
  7405. 642.44 s [vector] reverse: OK
  7406. 642.45 s [vector] +++ OK, passed 100 tests.
  7407. 642.45 s [vector] backpermute: OK
  7408. 642.45 s [vector] +++ OK, passed 100 tests.
  7409. 642.46 s [vector] map: OK
  7410. 642.46 s [vector] +++ OK, passed 100 tests.
  7411. 642.46 s [vector] imap: OK
  7412. 642.46 s [vector] +++ OK, passed 100 tests.
  7413. 642.48 s [vector] concatMap: OK (0.01s)
  7414. 642.48 s [vector] +++ OK, passed 100 tests.
  7415. 642.48 s [vector] mapM: OK
  7416. 642.48 s [vector] +++ OK, passed 100 tests.
  7417. 642.53 s [vector] mapM_: OK (0.05s)
  7418. 642.53 s [vector] +++ OK, passed 100 tests.
  7419. 642.54 s [vector] forM: OK
  7420. 642.54 s [vector] +++ OK, passed 100 tests.
  7421. 642.59 s [vector] forM_: OK (0.05s)
  7422. 642.59 s [vector] +++ OK, passed 100 tests.
  7423. 642.59 s [vector] imapM: OK
  7424. 642.60 s [vector] +++ OK, passed 100 tests.
  7425. 642.63 s [vector] imapM_: OK (0.03s)
  7426. 642.63 s [vector] +++ OK, passed 100 tests.
  7427. 642.63 s [vector] zipWith: OK
  7428. 642.64 s [vector] +++ OK, passed 100 tests.
  7429. 642.64 s [vector] zipWith3: OK
  7430. 642.64 s [vector] +++ OK, passed 100 tests.
  7431. 642.64 s [vector] izipWith: OK
  7432. 642.65 s [vector] +++ OK, passed 100 tests.
  7433. 642.65 s [vector] izipWith3: OK
  7434. 642.66 s [vector] +++ OK, passed 100 tests.
  7435. 642.66 s [vector] izipWithM: OK
  7436. 642.66 s [vector] +++ OK, passed 100 tests.
  7437. 642.70 s [vector] izipWithM_: OK (0.04s)
  7438. 642.70 s [vector] +++ OK, passed 100 tests.
  7439. 642.70 s [vector] zipWithM: OK
  7440. 642.72 s [vector] +++ OK, passed 100 tests.
  7441. 642.74 s [vector] zipWithM_: OK (0.04s)
  7442. 642.74 s [vector] +++ OK, passed 100 tests.
  7443. 642.75 s [vector] filter: OK
  7444. 642.75 s [vector] +++ OK, passed 100 tests.
  7445. 642.76 s [vector] ifilter: OK
  7446. 642.76 s [vector] +++ OK, passed 100 tests.
  7447. 642.82 s [vector] filterM: OK (0.06s)
  7448. 642.82 s [vector] +++ OK, passed 100 tests.
  7449. 642.82 s [vector] uniq: OK
  7450. 642.82 s [vector] +++ OK, passed 100 tests.
  7451. 642.83 s [vector] mapMaybe: OK
  7452. 642.84 s [vector] +++ OK, passed 100 tests.
  7453. 642.84 s [vector] imapMaybe: OK (0.01s)
  7454. 642.84 s [vector] +++ OK, passed 100 tests.
  7455. 642.84 s [vector] takeWhile: OK
  7456. 642.85 s [vector] +++ OK, passed 100 tests.
  7457. 642.85 s [vector] dropWhile: OK
  7458. 642.85 s [vector] +++ OK, passed 100 tests.
  7459. 642.86 s [vector] partition: OK
  7460. 642.86 s [vector] +++ OK, passed 100 tests.
  7461. 642.87 s [vector] partitionWith: OK (0.01s)
  7462. 642.87 s [vector] +++ OK, passed 100 tests.
  7463. 642.87 s [vector] span: OK
  7464. 642.87 s [vector] +++ OK, passed 100 tests.
  7465. 642.88 s [vector] break: OK
  7466. 642.88 s [vector] +++ OK, passed 100 tests.
  7467. 642.88 s [vector] spanR: OK
  7468. 642.88 s [vector] +++ OK, passed 100 tests.
  7469. 642.88 s [vector] breakR: OK
  7470. 642.88 s [vector] +++ OK, passed 100 tests.
  7471. 642.89 s [vector] groupBy: OK
  7472. 642.89 s [vector] +++ OK, passed 100 tests.
  7473. 642.90 s [vector] elem: OK
  7474. 642.90 s [vector] +++ OK, passed 100 tests.
  7475. 642.90 s [vector] notElem: OK
  7476. 642.90 s [vector] +++ OK, passed 100 tests.
  7477. 642.90 s [vector] find: OK
  7478. 642.90 s [vector] +++ OK, passed 100 tests.
  7479. 642.91 s [vector] findIndex: OK
  7480. 642.91 s [vector] +++ OK, passed 100 tests.
  7481. 642.91 s [vector] findIndexR: OK
  7482. 642.91 s [vector] +++ OK, passed 100 tests.
  7483. 642.91 s [vector] findIndices: OK
  7484. 642.91 s [vector] +++ OK, passed 100 tests.
  7485. 642.92 s [vector] elemIndex: OK
  7486. 642.92 s [vector] +++ OK, passed 100 tests.
  7487. 642.92 s [vector] elemIndices: OK
  7488. 642.92 s [vector] +++ OK, passed 100 tests.
  7489. 642.93 s [vector] foldl: OK
  7490. 642.93 s [vector] +++ OK, passed 100 tests.
  7491. 642.94 s [vector] foldl1: OK
  7492. 642.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7493. 642.94 s [vector] foldl': OK
  7494. 642.95 s [vector] +++ OK, passed 100 tests.
  7495. 642.95 s [vector] foldl1': OK
  7496. 642.96 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7497. 642.97 s [vector] foldr: OK
  7498. 642.97 s [vector] +++ OK, passed 100 tests.
  7499. 642.97 s [vector] foldr1: OK
  7500. 642.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7501. 642.98 s [vector] foldr': OK
  7502. 642.98 s [vector] +++ OK, passed 100 tests.
  7503. 643.00 s [vector] foldr1': OK
  7504. 643.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7505. 643.00 s [vector] ifoldl: OK
  7506. 643.00 s [vector] +++ OK, passed 100 tests.
  7507. 643.01 s [vector] ifoldl': OK
  7508. 643.01 s [vector] +++ OK, passed 100 tests.
  7509. 643.02 s [vector] ifoldr: OK
  7510. 643.02 s [vector] +++ OK, passed 100 tests.
  7511. 643.03 s [vector] ifoldr': OK
  7512. 643.03 s [vector] +++ OK, passed 100 tests.
  7513. 643.03 s [vector] ifoldM: OK
  7514. 643.04 s [vector] +++ OK, passed 100 tests.
  7515. 643.04 s [vector] ifoldM': OK
  7516. 643.06 s [vector] +++ OK, passed 100 tests.
  7517. 643.10 s [vector] ifoldM_: OK (0.06s)
  7518. 643.10 s [vector] +++ OK, passed 100 tests.
  7519. 643.16 s [vector] ifoldM'_: OK (0.04s)
  7520. 643.16 s [vector] +++ OK, passed 100 tests.
  7521. 643.16 s [vector] all: OK
  7522. 643.16 s [vector] +++ OK, passed 100 tests.
  7523. 643.18 s [vector] any: OK
  7524. 643.18 s [vector] +++ OK, passed 100 tests.
  7525. 643.18 s [vector] prescanl: OK (0.01s)
  7526. 643.18 s [vector] +++ OK, passed 100 tests.
  7527. 643.20 s [vector] prescanl': OK (0.01s)
  7528. 643.20 s [vector] +++ OK, passed 100 tests.
  7529. 643.20 s [vector] postscanl: OK (0.01s)
  7530. 643.20 s [vector] +++ OK, passed 100 tests.
  7531. 643.22 s [vector] postscanl': OK (0.01s)
  7532. 643.22 s [vector] +++ OK, passed 100 tests.
  7533. 643.22 s [vector] scanl: OK
  7534. 643.22 s [vector] +++ OK, passed 100 tests.
  7535. 643.23 s [vector] scanl': OK
  7536. 643.24 s [vector] +++ OK, passed 100 tests.
  7537. 643.24 s [vector] scanl1: OK
  7538. 643.24 s [vector] +++ OK, passed 100 tests.
  7539. 643.26 s [vector] scanl1': OK
  7540. 643.26 s [vector] +++ OK, passed 100 tests.
  7541. 643.27 s [vector] iscanl: OK (0.01s)
  7542. 643.27 s [vector] +++ OK, passed 100 tests.
  7543. 643.28 s [vector] iscanl': OK
  7544. 643.28 s [vector] +++ OK, passed 100 tests.
  7545. 643.28 s [vector] prescanr: OK
  7546. 643.28 s [vector] +++ OK, passed 100 tests.
  7547. 643.28 s [vector] prescanr': OK
  7548. 643.29 s [vector] +++ OK, passed 100 tests.
  7549. 643.29 s [vector] postscanr: OK
  7550. 643.31 s [vector] +++ OK, passed 100 tests.
  7551. 643.32 s [vector] postscanr': OK (0.02s)
  7552. 643.32 s [vector] +++ OK, passed 100 tests.
  7553. 643.33 s [vector] scanr: OK
  7554. 643.33 s [vector] +++ OK, passed 100 tests.
  7555. 643.33 s [vector] scanr': OK
  7556. 643.33 s [vector] +++ OK, passed 100 tests.
  7557. 643.34 s [vector] scanr1: OK
  7558. 643.34 s [vector] +++ OK, passed 100 tests.
  7559. 643.34 s [vector] scanr1': OK
  7560. 643.34 s [vector] +++ OK, passed 100 tests.
  7561. 643.35 s [vector] iscanr: OK
  7562. 643.35 s [vector] +++ OK, passed 100 tests.
  7563. 643.35 s [vector] iscanr': OK
  7564. 643.36 s [vector] +++ OK, passed 100 tests.
  7565. 643.36 s [vector] mut_read: OK
  7566. 643.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7567. 643.36 s [vector] mut_write: OK
  7568. 643.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7569. 643.36 s [vector] mut_modify: OK
  7570. 643.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7571. 643.36 s [vector] mut_generate: OK
  7572. 643.36 s [vector] +++ OK, passed 100 tests.
  7573. 643.40 s [vector] mut_generateM: OK (0.03s)
  7574. 643.40 s [vector] +++ OK, passed 100 tests.
  7575. 643.44 s [vector] mut_mapM_: OK (0.05s)
  7576. 643.44 s [vector] +++ OK, passed 100 tests.
  7577. 643.48 s [vector] mut_imapM_: OK (0.04s)
  7578. 643.48 s [vector] +++ OK, passed 100 tests.
  7579. 643.53 s [vector] mut_forM_: OK (0.05s)
  7580. 643.53 s [vector] +++ OK, passed 100 tests.
  7581. 643.56 s [vector] mut_iforM_: OK (0.02s)
  7582. 643.56 s [vector] +++ OK, passed 100 tests.
  7583. 643.57 s [vector] mut_foldr: OK
  7584. 643.57 s [vector] +++ OK, passed 100 tests.
  7585. 643.57 s [vector] mut_foldr': OK
  7586. 643.57 s [vector] +++ OK, passed 100 tests.
  7587. 643.58 s [vector] mut_foldl: OK
  7588. 643.58 s [vector] +++ OK, passed 100 tests.
  7589. 643.58 s [vector] mut_foldl': OK
  7590. 643.58 s [vector] +++ OK, passed 100 tests.
  7591. 643.59 s [vector] mut_ifoldr: OK
  7592. 643.59 s [vector] +++ OK, passed 100 tests.
  7593. 643.60 s [vector] mut_ifoldr': OK
  7594. 643.60 s [vector] +++ OK, passed 100 tests.
  7595. 643.61 s [vector] mut_ifoldl: OK
  7596. 643.61 s [vector] +++ OK, passed 100 tests.
  7597. 643.61 s [vector] mut_ifoldl': OK
  7598. 643.61 s [vector] +++ OK, passed 100 tests.
  7599. 643.61 s [vector] mut_foldM: OK
  7600. 643.62 s [vector] +++ OK, passed 100 tests.
  7601. 643.62 s [vector] mut_foldM': OK
  7602. 643.62 s [vector] +++ OK, passed 100 tests.
  7603. 643.63 s [vector] mut_foldrM: OK
  7604. 643.63 s [vector] +++ OK, passed 100 tests.
  7605. 643.63 s [vector] mut_foldrM': OK
  7606. 643.63 s [vector] +++ OK, passed 100 tests.
  7607. 643.65 s [vector] mut_ifoldM: OK
  7608. 643.65 s [vector] +++ OK, passed 100 tests.
  7609. 643.65 s [vector] mut_ifoldM': OK
  7610. 643.65 s [vector] +++ OK, passed 100 tests.
  7611. 643.65 s [vector] mut_ifoldrM: OK
  7612. 643.66 s [vector] +++ OK, passed 100 tests.
  7613. 643.66 s [vector] mut_ifoldrM': OK
  7614. 643.66 s [vector] +++ OK, passed 100 tests.
  7615. 643.66 s [vector] compare: OK
  7616. 643.66 s [vector] +++ OK, passed 100 tests.
  7617. 643.67 s [vector] maximum: OK
  7618. 643.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7619. 643.67 s [vector] minimum: OK
  7620. 643.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7621. 643.67 s [vector] minIndex: OK
  7622. 643.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7623. 643.67 s [vector] maxIndex: OK
  7624. 643.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7625. 643.67 s [vector] maximumBy: OK
  7626. 643.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7627. 643.67 s [vector] minimumBy: OK
  7628. 643.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7629. 643.67 s [vector] maximumOn: OK
  7630. 643.67 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7631. 643.67 s [vector] minimumOn: OK
  7632. 643.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7633. 643.68 s [vector] maxIndexBy: OK
  7634. 643.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7635. 643.68 s [vector] minIndexBy: OK
  7636. 643.68 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7637. 643.68 s [vector] ListFirstMaxIndexWins: OK
  7638. 643.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7639. 643.68 s [vector] FalseListFirstMaxIndexWins: OK
  7640. 643.68 s [vector] +++ OK, failed as expected. (after 1 test):
  7641. 643.68 s [vector] Exception:
  7642. 643.68 s [vector] Prelude.foldr1: empty list
  7643. 643.68 s [vector] CallStack (from HasCallStack):
  7644. 643.68 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7645. 643.68 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7646. 643.68 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7647. 643.68 s [vector] []
  7648. 643.69 s [vector] zip: OK
  7649. 643.69 s [vector] +++ OK, passed 100 tests.
  7650. 643.69 s [vector] zip3: OK
  7651. 643.69 s [vector] +++ OK, passed 100 tests.
  7652. 643.70 s [vector] unzip: OK
  7653. 643.70 s [vector] +++ OK, passed 100 tests.
  7654. 643.70 s [vector] unzip3: OK
  7655. 643.70 s [vector] +++ OK, passed 100 tests.
  7656. 643.70 s [vector] indexed: OK
  7657. 643.70 s [vector] +++ OK, passed 100 tests.
  7658. 643.71 s [vector] update: OK
  7659. 643.71 s [vector] +++ OK, passed 100 tests.
  7660. 643.71 s [vector] mempty: OK
  7661. 643.71 s [vector] +++ OK, passed 100 tests.
  7662. 643.71 s [vector] mappend: OK
  7663. 643.71 s [vector] +++ OK, passed 100 tests.
  7664. 643.76 s [vector] mconcat: OK (0.04s)
  7665. 643.76 s [vector] +++ OK, passed 100 tests.
  7666. 643.76 s [vector] glength: OK
  7667. 643.76 s [vector] +++ OK, passed 100 tests.
  7668. 643.76 s [vector] (Int,Bool,Int)
  7669. 643.76 s [vector] fromList.toList == id: OK
  7670. 643.76 s [vector] +++ OK, passed 100 tests.
  7671. 643.76 s [vector] toList.fromList == id: OK
  7672. 643.76 s [vector] +++ OK, passed 100 tests.
  7673. 643.76 s [vector] unstream.stream == id: OK
  7674. 643.76 s [vector] +++ OK, passed 100 tests.
  7675. 643.76 s [vector] stream.unstream == id: OK
  7676. 643.76 s [vector] +++ OK, passed 100 tests.
  7677. 643.77 s [vector] eq: OK
  7678. 643.77 s [vector] +++ OK, passed 100 tests.
  7679. 643.77 s [vector] length: OK
  7680. 643.77 s [vector] +++ OK, passed 100 tests.
  7681. 643.77 s [vector] null: OK
  7682. 643.77 s [vector] +++ OK, passed 100 tests.
  7683. 643.77 s [vector] index: OK
  7684. 643.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7685. 643.77 s [vector] safeIndex: OK
  7686. 643.78 s [vector] +++ OK, passed 100 tests.
  7687. 643.78 s [vector] head: OK
  7688. 643.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7689. 643.78 s [vector] last: OK
  7690. 643.78 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7691. 643.78 s [vector] unsafeIndex: OK
  7692. 643.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7693. 643.79 s [vector] unsafeHead: OK
  7694. 643.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7695. 643.79 s [vector] unsafeLast: OK
  7696. 643.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7697. 643.79 s [vector] slice: OK
  7698. 643.79 s [vector] +++ OK, passed 100 tests.
  7699. 643.79 s [vector] init: OK
  7700. 643.80 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7701. 643.80 s [vector] tail: OK
  7702. 643.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7703. 643.80 s [vector] take: OK
  7704. 643.80 s [vector] +++ OK, passed 100 tests.
  7705. 643.80 s [vector] drop: OK
  7706. 643.80 s [vector] +++ OK, passed 100 tests.
  7707. 643.81 s [vector] splitAt: OK
  7708. 643.81 s [vector] +++ OK, passed 100 tests.
  7709. 643.81 s [vector] empty: OK
  7710. 643.81 s [vector] +++ OK, passed 100 tests.
  7711. 643.81 s [vector] singleton: OK
  7712. 643.81 s [vector] +++ OK, passed 100 tests.
  7713. 643.81 s [vector] replicate: OK
  7714. 643.81 s [vector] +++ OK, passed 100 tests.
  7715. 643.81 s [vector] generate: OK
  7716. 643.82 s [vector] +++ OK, passed 100 tests.
  7717. 643.82 s [vector] iterateN: OK
  7718. 643.83 s [vector] +++ OK, passed 100 tests.
  7719. 643.91 s [vector] iterateNM: OK (0.09s)
  7720. 643.91 s [vector] +++ OK, passed 100 tests.
  7721. 643.99 s [vector] generateM: OK (0.08s)
  7722. 643.99 s [vector] +++ OK, passed 100 tests.
  7723. 644.01 s [vector] replicateM: OK (0.02s)
  7724. 644.01 s [vector] +++ OK, passed 100 tests.
  7725. 644.01 s [vector] create: OK
  7726. 644.01 s [vector] +++ OK, passed 100 tests.
  7727. 644.01 s [vector] createT: OK
  7728. 644.01 s [vector] +++ OK, passed 100 tests.
  7729. 644.01 s [vector] unfoldr: OK
  7730. 644.01 s [vector] +++ OK, passed 100 tests.
  7731. 644.02 s [vector] unfoldrN: OK
  7732. 644.02 s [vector] +++ OK, passed 100 tests.
  7733. 644.02 s [vector] unfoldrExactN: OK
  7734. 644.02 s [vector] +++ OK, passed 100 tests.
  7735. 644.03 s [vector] unfoldrM: OK
  7736. 644.03 s [vector] +++ OK, passed 100 tests.
  7737. 644.06 s [vector] unfoldrNM: OK (0.01s)
  7738. 644.06 s [vector] +++ OK, passed 100 tests.
  7739. 644.15 s [vector] unfoldrExactNM: OK (0.11s)
  7740. 644.15 s [vector] +++ OK, passed 100 tests.
  7741. 644.17 s [vector] constructN: OK (0.02s)
  7742. 644.17 s [vector] +++ OK, passed 100 tests.
  7743. 644.19 s [vector] constructrN: OK (0.02s)
  7744. 644.19 s [vector] +++ OK, passed 100 tests.
  7745. 644.19 s [vector] cons: OK
  7746. 644.19 s [vector] +++ OK, passed 100 tests.
  7747. 644.20 s [vector] snoc: OK
  7748. 644.20 s [vector] +++ OK, passed 100 tests.
  7749. 644.20 s [vector] append: OK
  7750. 644.21 s [vector] +++ OK, passed 100 tests.
  7751. 644.30 s [vector] concat: OK (0.10s)
  7752. 644.30 s [vector] +++ OK, passed 100 tests.
  7753. 644.31 s [vector] force: OK
  7754. 644.31 s [vector] +++ OK, passed 100 tests.
  7755. 644.31 s [vector] upd: OK
  7756. 644.31 s [vector] +++ OK, passed 100 tests.
  7757. 644.34 s [vector] accum: OK (0.03s)
  7758. 644.34 s [vector] +++ OK, passed 100 tests.
  7759. 644.34 s [vector] reverse: OK
  7760. 644.35 s [vector] +++ OK, passed 100 tests.
  7761. 644.35 s [vector] backpermute: OK
  7762. 644.35 s [vector] +++ OK, passed 100 tests.
  7763. 644.38 s [vector] map: OK (0.01s)
  7764. 644.38 s [vector] +++ OK, passed 100 tests.
  7765. 644.39 s [vector] imap: OK (0.02s)
  7766. 644.39 s [vector] +++ OK, passed 100 tests.
  7767. 644.41 s [vector] concatMap: OK (0.02s)
  7768. 644.41 s [vector] +++ OK, passed 100 tests.
  7769. 644.41 s [vector] mapM: OK (0.01s)
  7770. 644.41 s [vector] +++ OK, passed 100 tests.
  7771. 644.52 s [vector] mapM_: OK (0.09s)
  7772. 644.52 s [vector] +++ OK, passed 100 tests.
  7773. 644.52 s [vector] forM: OK (0.01s)
  7774. 644.52 s [vector] +++ OK, passed 100 tests.
  7775. 644.61 s [vector] forM_: OK (0.08s)
  7776. 644.61 s [vector] +++ OK, passed 100 tests.
  7777. 644.61 s [vector] imapM: OK (0.01s)
  7778. 644.62 s [vector] +++ OK, passed 100 tests.
  7779. 644.69 s [vector] imapM_: OK (0.08s)
  7780. 644.69 s [vector] +++ OK, passed 100 tests.
  7781. 644.71 s [vector] zipWith: OK (0.01s)
  7782. 644.71 s [vector] +++ OK, passed 100 tests.
  7783. 644.72 s [vector] zipWith3: OK (0.01s)
  7784. 644.73 s [vector] +++ OK, passed 100 tests.
  7785. 644.73 s [vector] izipWith: OK (0.01s)
  7786. 644.73 s [vector] +++ OK, passed 100 tests.
  7787. 644.75 s [vector] izipWith3: OK (0.02s)
  7788. 644.75 s [vector] +++ OK, passed 100 tests.
  7789. 644.76 s [vector] izipWithM: OK (0.02s)
  7790. 644.76 s [vector] +++ OK, passed 100 tests.
  7791. 644.83 s [vector] izipWithM_: OK (0.05s)
  7792. 644.83 s [vector] +++ OK, passed 100 tests.
  7793. 644.85 s [vector] zipWithM: OK (0.01s)
  7794. 644.85 s [vector] +++ OK, passed 100 tests.
  7795. 644.89 s [vector] zipWithM_: OK (0.05s)
  7796. 644.89 s [vector] +++ OK, passed 100 tests.
  7797. 644.89 s [vector] filter: OK
  7798. 644.89 s [vector] +++ OK, passed 100 tests.
  7799. 644.91 s [vector] ifilter: OK
  7800. 644.91 s [vector] +++ OK, passed 100 tests.
  7801. 645.02 s [vector] filterM: OK (0.12s)
  7802. 645.02 s [vector] +++ OK, passed 100 tests.
  7803. 645.02 s [vector] uniq: OK
  7804. 645.03 s [vector] +++ OK, passed 100 tests.
  7805. 645.05 s [vector] mapMaybe: OK (0.01s)
  7806. 645.05 s [vector] +++ OK, passed 100 tests.
  7807. 645.05 s [vector] imapMaybe: OK (0.01s)
  7808. 645.05 s [vector] +++ OK, passed 100 tests.
  7809. 645.05 s [vector] takeWhile: OK
  7810. 645.05 s [vector] +++ OK, passed 100 tests.
  7811. 645.05 s [vector] dropWhile: OK
  7812. 645.06 s [vector] +++ OK, passed 100 tests.
  7813. 645.06 s [vector] partition: OK
  7814. 645.07 s [vector] +++ OK, passed 100 tests.
  7815. 645.08 s [vector] partitionWith: OK (0.01s)
  7816. 645.08 s [vector] +++ OK, passed 100 tests.
  7817. 645.08 s [vector] span: OK
  7818. 645.08 s [vector] +++ OK, passed 100 tests.
  7819. 645.08 s [vector] break: OK
  7820. 645.08 s [vector] +++ OK, passed 100 tests.
  7821. 645.09 s [vector] spanR: OK
  7822. 645.09 s [vector] +++ OK, passed 100 tests.
  7823. 645.09 s [vector] breakR: OK
  7824. 645.09 s [vector] +++ OK, passed 100 tests.
  7825. 645.11 s [vector] groupBy: OK (0.01s)
  7826. 645.11 s [vector] +++ OK, passed 100 tests.
  7827. 645.11 s [vector] elem: OK
  7828. 645.11 s [vector] +++ OK, passed 100 tests.
  7829. 645.11 s [vector] notElem: OK
  7830. 645.11 s [vector] +++ OK, passed 100 tests.
  7831. 645.11 s [vector] find: OK
  7832. 645.11 s [vector] +++ OK, passed 100 tests.
  7833. 645.11 s [vector] findIndex: OK
  7834. 645.11 s [vector] +++ OK, passed 100 tests.
  7835. 645.12 s [vector] findIndexR: OK
  7836. 645.12 s [vector] +++ OK, passed 100 tests.
  7837. 645.12 s [vector] findIndices: OK
  7838. 645.12 s [vector] +++ OK, passed 100 tests.
  7839. 645.13 s [vector] elemIndex: OK
  7840. 645.13 s [vector] +++ OK, passed 100 tests.
  7841. 645.14 s [vector] elemIndices: OK
  7842. 645.14 s [vector] +++ OK, passed 100 tests.
  7843. 645.14 s [vector] foldl: OK
  7844. 645.14 s [vector] +++ OK, passed 100 tests.
  7845. 645.14 s [vector] foldl1: OK
  7846. 645.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7847. 645.15 s [vector] foldl': OK (0.01s)
  7848. 645.15 s [vector] +++ OK, passed 100 tests.
  7849. 645.16 s [vector] foldl1': OK
  7850. 645.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7851. 645.17 s [vector] foldr: OK
  7852. 645.17 s [vector] +++ OK, passed 100 tests.
  7853. 645.18 s [vector] foldr1: OK
  7854. 645.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7855. 645.19 s [vector] foldr': OK
  7856. 645.19 s [vector] +++ OK, passed 100 tests.
  7857. 645.21 s [vector] foldr1': OK (0.01s)
  7858. 645.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7859. 645.23 s [vector] ifoldl: OK (0.02s)
  7860. 645.23 s [vector] +++ OK, passed 100 tests.
  7861. 645.23 s [vector] ifoldl': OK (0.01s)
  7862. 645.23 s [vector] +++ OK, passed 100 tests.
  7863. 645.25 s [vector] ifoldr: OK (0.01s)
  7864. 645.25 s [vector] +++ OK, passed 100 tests.
  7865. 645.25 s [vector] ifoldr': OK (0.01s)
  7866. 645.25 s [vector] +++ OK, passed 100 tests.
  7867. 645.27 s [vector] ifoldM: OK (0.01s)
  7868. 645.27 s [vector] +++ OK, passed 100 tests.
  7869. 645.29 s [vector] ifoldM': OK (0.01s)
  7870. 645.29 s [vector] +++ OK, passed 100 tests.
  7871. 645.35 s [vector] ifoldM_: OK (0.06s)
  7872. 645.35 s [vector] +++ OK, passed 100 tests.
  7873. 645.40 s [vector] ifoldM'_: OK (0.06s)
  7874. 645.40 s [vector] +++ OK, passed 100 tests.
  7875. 645.40 s [vector] all: OK
  7876. 645.40 s [vector] +++ OK, passed 100 tests.
  7877. 645.40 s [vector] any: OK
  7878. 645.41 s [vector] +++ OK, passed 100 tests.
  7879. 645.41 s [vector] prescanl: OK
  7880. 645.41 s [vector] +++ OK, passed 100 tests.
  7881. 645.43 s [vector] prescanl': OK
  7882. 645.43 s [vector] +++ OK, passed 100 tests.
  7883. 645.43 s [vector] postscanl: OK (0.01s)
  7884. 645.43 s [vector] +++ OK, passed 100 tests.
  7885. 645.45 s [vector] postscanl': OK (0.01s)
  7886. 645.45 s [vector] +++ OK, passed 100 tests.
  7887. 645.47 s [vector] scanl: OK (0.02s)
  7888. 645.47 s [vector] +++ OK, passed 100 tests.
  7889. 645.51 s [vector] scanl': OK (0.04s)
  7890. 645.51 s [vector] +++ OK, passed 100 tests.
  7891. 645.55 s [vector] scanl1: OK (0.03s)
  7892. 645.55 s [vector] +++ OK, passed 100 tests.
  7893. 645.57 s [vector] scanl1': OK (0.02s)
  7894. 645.57 s [vector] +++ OK, passed 100 tests.
  7895. 645.59 s [vector] iscanl: OK (0.02s)
  7896. 645.59 s [vector] +++ OK, passed 100 tests.
  7897. 645.61 s [vector] iscanl': OK (0.02s)
  7898. 645.61 s [vector] +++ OK, passed 100 tests.
  7899. 645.61 s [vector] prescanr: OK (0.01s)
  7900. 645.61 s [vector] +++ OK, passed 100 tests.
  7901. 645.63 s [vector] prescanr': OK (0.02s)
  7902. 645.63 s [vector] +++ OK, passed 100 tests.
  7903. 645.65 s [vector] postscanr: OK (0.02s)
  7904. 645.65 s [vector] +++ OK, passed 100 tests.
  7905. 645.69 s [vector] postscanr': OK (0.04s)
  7906. 645.69 s [vector] +++ OK, passed 100 tests.
  7907. 645.71 s [vector] scanr: OK (0.02s)
  7908. 645.71 s [vector] +++ OK, passed 100 tests.
  7909. 645.73 s [vector] scanr': OK (0.02s)
  7910. 645.73 s [vector] +++ OK, passed 100 tests.
  7911. 645.75 s [vector] scanr1: OK (0.01s)
  7912. 645.75 s [vector] +++ OK, passed 100 tests.
  7913. 645.77 s [vector] scanr1': OK (0.01s)
  7914. 645.77 s [vector] +++ OK, passed 100 tests.
  7915. 645.77 s [vector] iscanr: OK (0.02s)
  7916. 645.77 s [vector] +++ OK, passed 100 tests.
  7917. 645.79 s [vector] iscanr': OK (0.01s)
  7918. 645.79 s [vector] +++ OK, passed 100 tests.
  7919. 645.79 s [vector] mut_read: OK
  7920. 645.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7921. 645.80 s [vector] mut_write: OK
  7922. 645.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7923. 645.80 s [vector] mut_modify: OK
  7924. 645.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7925. 645.80 s [vector] mut_generate: OK
  7926. 645.81 s [vector] +++ OK, passed 100 tests.
  7927. 645.86 s [vector] mut_generateM: OK (0.04s)
  7928. 645.86 s [vector] +++ OK, passed 100 tests.
  7929. 645.95 s [vector] mut_mapM_: OK (0.09s)
  7930. 645.95 s [vector] +++ OK, passed 100 tests.
  7931. 646.03 s [vector] mut_imapM_: OK (0.08s)
  7932. 646.03 s [vector] +++ OK, passed 100 tests.
  7933. 646.15 s [vector] mut_forM_: OK (0.12s)
  7934. 646.15 s [vector] +++ OK, passed 100 tests.
  7935. 646.19 s [vector] mut_iforM_: OK (0.05s)
  7936. 646.19 s [vector] +++ OK, passed 100 tests.
  7937. 646.21 s [vector] mut_foldr: OK (0.01s)
  7938. 646.21 s [vector] +++ OK, passed 100 tests.
  7939. 646.21 s [vector] mut_foldr': OK (0.01s)
  7940. 646.21 s [vector] +++ OK, passed 100 tests.
  7941. 646.23 s [vector] mut_foldl: OK (0.01s)
  7942. 646.23 s [vector] +++ OK, passed 100 tests.
  7943. 646.27 s [vector] mut_foldl': OK (0.01s)
  7944. 646.27 s [vector] +++ OK, passed 100 tests.
  7945. 646.27 s [vector] mut_ifoldr: OK (0.01s)
  7946. 646.27 s [vector] +++ OK, passed 100 tests.
  7947. 646.27 s [vector] mut_ifoldr': OK (0.01s)
  7948. 646.27 s [vector] +++ OK, passed 100 tests.
  7949. 646.27 s [vector] mut_ifoldl: OK (0.01s)
  7950. 646.27 s [vector] +++ OK, passed 100 tests.
  7951. 646.29 s [vector] mut_ifoldl': OK (0.01s)
  7952. 646.29 s [vector] +++ OK, passed 100 tests.
  7953. 646.30 s [vector] mut_foldM: OK (0.01s)
  7954. 646.30 s [vector] +++ OK, passed 100 tests.
  7955. 646.31 s [vector] mut_foldM': OK (0.01s)
  7956. 646.32 s [vector] +++ OK, passed 100 tests.
  7957. 646.34 s [vector] mut_foldrM: OK (0.04s)
  7958. 646.46 s [vector] +++ OK, passed 100 tests.
  7959. 646.46 s [vector] mut_foldrM': OK
  7960. 646.46 s [vector] +++ OK, passed 100 tests.
  7961. 646.46 s [vector] mut_ifoldM: OK
  7962. 646.46 s [vector] +++ OK, passed 100 tests.
  7963. 646.46 s [vector] mut_ifoldM': OK
  7964. 646.46 s [vector] +++ OK, passed 100 tests.
  7965. 646.46 s [vector] mut_ifoldrM: OK
  7966. 646.46 s [vector] +++ OK, passed 100 tests.
  7967. 646.46 s [vector] mut_ifoldrM': OK
  7968. 646.46 s [vector] +++ OK, passed 100 tests.
  7969. 646.46 s [vector] compare: OK
  7970. 646.46 s [vector] +++ OK, passed 100 tests.
  7971. 646.46 s [vector] maximum: OK
  7972. 646.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7973. 646.46 s [vector] minimum: OK
  7974. 646.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7975. 646.46 s [vector] minIndex: OK
  7976. 646.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7977. 646.46 s [vector] maxIndex: OK
  7978. 646.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7979. 646.46 s [vector] maximumBy: OK
  7980. 646.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7981. 646.46 s [vector] minimumBy: OK
  7982. 646.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7983. 646.46 s [vector] maximumOn: OK
  7984. 646.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7985. 646.46 s [vector] minimumOn: OK
  7986. 646.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7987. 646.46 s [vector] maxIndexBy: OK
  7988. 646.46 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7989. 646.46 s [vector] minIndexBy: OK
  7990. 646.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7991. 646.46 s [vector] ListFirstMaxIndexWins: OK
  7992. 646.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7993. 646.46 s [vector] FalseListFirstMaxIndexWins: OK
  7994. 646.46 s [vector] +++ OK, failed as expected. (after 1 test):
  7995. 646.46 s [vector] Exception:
  7996. 646.46 s [vector] Prelude.foldr1: empty list
  7997. 646.46 s [vector] CallStack (from HasCallStack):
  7998. 646.46 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7999. 646.46 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8000. 646.46 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8001. 646.46 s [vector] []
  8002. 646.46 s [vector] zip: OK
  8003. 646.47 s [vector] +++ OK, passed 100 tests.
  8004. 646.47 s [vector] zip3: OK
  8005. 646.47 s [vector] +++ OK, passed 100 tests.
  8006. 646.47 s [vector] unzip: OK
  8007. 646.47 s [vector] +++ OK, passed 100 tests.
  8008. 646.47 s [vector] unzip3: OK (0.01s)
  8009. 646.47 s [vector] +++ OK, passed 100 tests.
  8010. 646.47 s [vector] indexed: OK
  8011. 646.47 s [vector] +++ OK, passed 100 tests.
  8012. 646.47 s [vector] update: OK
  8013. 646.47 s [vector] +++ OK, passed 100 tests.
  8014. 646.47 s [vector] mempty: OK
  8015. 646.47 s [vector] +++ OK, passed 100 tests.
  8016. 646.47 s [vector] mappend: OK
  8017. 646.47 s [vector] +++ OK, passed 100 tests.
  8018. 646.57 s [vector] mconcat: OK (0.11s)
  8019. 646.57 s [vector] +++ OK, passed 100 tests.
  8020. 646.57 s [vector] glength: OK
  8021. 646.57 s [vector] +++ OK, passed 100 tests.
  8022. 646.57 s [vector] unstream
  8023. 646.57 s [vector] unstream == vunstream (exact): OK
  8024. 646.58 s [vector] +++ OK, passed 100 tests.
  8025. 646.58 s [vector] unstream == vunstream (unknown): OK
  8026. 646.58 s [vector] +++ OK, passed 100 tests.
  8027. 646.58 s [vector] unstreamR ~= vunstream (exact): OK
  8028. 646.58 s [vector] +++ OK, passed 100 tests.
  8029. 646.58 s [vector] unstreamR ~= vunstream (unknown): OK
  8030. 646.58 s [vector] +++ OK, passed 100 tests.
  8031. 646.58 s [vector] Data.Vector.Storable.Vector Alignment
  8032. 646.58 s [vector] Aligned Double: OK
  8033. 646.58 s [vector] Aligned Int: OK
  8034. 646.58 s [vector] Regression tests
  8035. 646.58 s [vector] enumFromTo crash #188
  8036. 646.58 s [vector] Word8: OK
  8037. 646.58 s [vector] Word16: OK
  8038. 646.59 s [vector] Word32: OK
  8039. 646.59 s [vector] Word64: OK
  8040. 646.59 s [vector] Word: OK
  8041. 646.59 s [vector] Int8: OK
  8042. 646.59 s [vector] Int16: OK
  8043. 646.59 s [vector] Int32: OK
  8044. 646.59 s [vector] Int64: OK
  8045. 646.59 s [vector] Int: OK
  8046. 646.59 s [vector] Char: OK
  8047. 646.59 s [vector] Negative tests
  8048. 646.59 s [vector] slice out of bounds #257
  8049. 646.59 s [vector] Boxed
  8050. 646.59 s [vector] Negative ix: OK
  8051. 646.59 s [vector] Negative size: OK
  8052. 646.59 s [vector] Negative ix and size: OK
  8053. 646.59 s [vector] Too large ix: OK
  8054. 646.59 s [vector] Too large size: OK
  8055. 646.59 s [vector] Too large ix and size: OK
  8056. 646.59 s [vector] Overflow: OK
  8057. 646.59 s [vector] OutOfMemory: OK
  8058. 646.59 s [vector] Primitive
  8059. 646.59 s [vector] Negative ix: OK
  8060. 646.59 s [vector] Negative size: OK
  8061. 646.59 s [vector] Negative ix and size: OK
  8062. 646.59 s [vector] Too large ix: OK
  8063. 646.59 s [vector] Too large size: OK
  8064. 646.59 s [vector] Too large ix and size: OK
  8065. 646.59 s [vector] Overflow: OK
  8066. 646.59 s [vector] OutOfMemory: OK
  8067. 646.59 s [vector] Storable
  8068. 646.59 s [vector] Negative ix: OK
  8069. 646.59 s [vector] Negative size: OK
  8070. 646.59 s [vector] Negative ix and size: OK
  8071. 646.59 s [vector] Too large ix: OK
  8072. 646.59 s [vector] Too large size: OK
  8073. 646.59 s [vector] Too large ix and size: OK
  8074. 646.59 s [vector] Overflow: OK
  8075. 646.59 s [vector] OutOfMemory: OK
  8076. 646.59 s [vector] Unboxed
  8077. 646.59 s [vector] Negative ix: OK
  8078. 646.59 s [vector] Negative size: OK
  8079. 646.59 s [vector] Negative ix and size: OK
  8080. 646.59 s [vector] Too large ix: OK
  8081. 646.59 s [vector] Too large size: OK
  8082. 646.59 s [vector] Too large ix and size: OK
  8083. 646.59 s [vector] Overflow: OK
  8084. 646.59 s [vector] OutOfMemory: OK
  8085. 646.59 s [vector] take #282
  8086. 646.59 s [vector] Boxed: OK
  8087. 646.59 s [vector] Primitive: OK
  8088. 646.59 s [vector] Storable: OK
  8089. 646.59 s [vector] Unboxed: OK
  8090. 646.59 s [vector] Data.Vector
  8091. 646.59 s [vector] MonadFix: OK
  8092. 646.59 s [vector] toFromArray: OK
  8093. 646.59 s [vector] toFromArraySlice: OK
  8094. 646.60 s [vector] toFromArraySliceUnsafe: OK
  8095. 646.60 s [vector] toFromMutableArray: OK
  8096. 646.60 s [vector] Data.Vector.Mutable (Move): OK
  8097. 646.60 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8098. 646.60 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  8099. 646.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8100. 646.60 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  8101. 646.60 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8102. 646.60 s [vector] Data.Vector.Storable.Mutable (Move): OK
  8103. 646.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8104. 646.63 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.04s)
  8105. 646.63 s [vector] +++ OK, passed 100 tests.
  8106. 646.68 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.05s)
  8107. 646.68 s [vector] +++ OK, passed 100 tests.
  8108. 646.68 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  8109. 646.68 s [vector] +++ OK, passed 100 tests.
  8110. 646.68 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  8111. 646.68 s [vector] +++ OK, passed 100 tests.
  8112. 646.68 s [vector]
  8113. 646.69 s [vector] All 2808 tests passed (27.50s)
  8114. 646.70 s [vector] Test suite vector-tests-O0: PASS
  8115. 646.70 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  8116. 646.70 s [vector] Test suite vector-tests-O2: RUNNING...
  8117. 646.80 s [vector] toplevel
  8118. 646.80 s [vector] Data.Vector.Fusion.Bundle
  8119. 646.80 s [vector] fromList.toList == id: OK
  8120. 646.80 s [vector] +++ OK, passed 100 tests.
  8121. 646.80 s [vector] toList.fromList == id: OK
  8122. 646.80 s [vector] +++ OK, passed 100 tests.
  8123. 646.80 s [vector] eq: OK
  8124. 646.80 s [vector] +++ OK, passed 100 tests.
  8125. 646.82 s [vector] length: OK (0.03s)
  8126. 646.82 s [vector] +++ OK, passed 100 tests.
  8127. 646.82 s [vector] null: OK (0.01s)
  8128. 646.82 s [vector] +++ OK, passed 100 tests.
  8129. 646.83 s [vector] empty: OK
  8130. 646.83 s [vector] +++ OK, passed 100 tests.
  8131. 646.83 s [vector] singleton: OK
  8132. 646.83 s [vector] +++ OK, passed 100 tests.
  8133. 646.85 s [vector] replicate: OK
  8134. 646.85 s [vector] +++ OK, passed 100 tests.
  8135. 646.86 s [vector] cons: OK (0.02s)
  8136. 646.87 s [vector] +++ OK, passed 100 tests.
  8137. 646.87 s [vector] snoc: OK
  8138. 646.87 s [vector] +++ OK, passed 100 tests.
  8139. 646.87 s [vector] append: OK
  8140. 646.87 s [vector] +++ OK, passed 100 tests.
  8141. 646.87 s [vector] head: OK
  8142. 646.87 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8143. 646.88 s [vector] last: OK
  8144. 646.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8145. 646.89 s [vector] index: OK
  8146. 646.89 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8147. 646.89 s [vector] extract: OK
  8148. 646.89 s [vector] +++ OK, passed 100 tests.
  8149. 646.90 s [vector] init: OK
  8150. 646.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8151. 646.91 s [vector] tail: OK (0.02s)
  8152. 646.91 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8153. 646.91 s [vector] take: OK
  8154. 646.92 s [vector] +++ OK, passed 100 tests.
  8155. 646.92 s [vector] drop: OK
  8156. 646.92 s [vector] +++ OK, passed 100 tests.
  8157. 646.92 s [vector] map: OK
  8158. 646.93 s [vector] +++ OK, passed 100 tests.
  8159. 646.93 s [vector] zipWith: OK
  8160. 646.93 s [vector] +++ OK, passed 100 tests.
  8161. 646.93 s [vector] zipWith3: OK
  8162. 646.93 s [vector] +++ OK, passed 100 tests.
  8163. 646.93 s [vector] filter: OK
  8164. 646.93 s [vector] +++ OK, passed 100 tests.
  8165. 646.93 s [vector] takeWhile: OK
  8166. 646.93 s [vector] +++ OK, passed 100 tests.
  8167. 646.93 s [vector] dropWhile: OK
  8168. 646.93 s [vector] +++ OK, passed 100 tests.
  8169. 646.93 s [vector] elem: OK
  8170. 646.93 s [vector] +++ OK, passed 100 tests.
  8171. 646.93 s [vector] notElem: OK
  8172. 646.93 s [vector] +++ OK, passed 100 tests.
  8173. 646.93 s [vector] find: OK
  8174. 646.94 s [vector] +++ OK, passed 100 tests.
  8175. 646.94 s [vector] findIndex: OK
  8176. 646.94 s [vector] +++ OK, passed 100 tests.
  8177. 646.94 s [vector] foldl: OK
  8178. 646.94 s [vector] +++ OK, passed 100 tests.
  8179. 646.94 s [vector] foldl1: OK
  8180. 646.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8181. 646.95 s [vector] foldl': OK
  8182. 646.95 s [vector] +++ OK, passed 100 tests.
  8183. 646.95 s [vector] foldl1': OK
  8184. 646.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8185. 646.95 s [vector] foldr: OK
  8186. 646.95 s [vector] +++ OK, passed 100 tests.
  8187. 646.95 s [vector] foldr1: OK
  8188. 646.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8189. 646.96 s [vector] prescanl: OK
  8190. 646.96 s [vector] +++ OK, passed 100 tests.
  8191. 646.96 s [vector] prescanl': OK
  8192. 646.96 s [vector] +++ OK, passed 100 tests.
  8193. 646.97 s [vector] postscanl: OK
  8194. 646.97 s [vector] +++ OK, passed 100 tests.
  8195. 646.97 s [vector] postscanl': OK
  8196. 646.97 s [vector] +++ OK, passed 100 tests.
  8197. 646.97 s [vector] scanl: OK
  8198. 646.98 s [vector] +++ OK, passed 100 tests.
  8199. 646.98 s [vector] scanl': OK
  8200. 646.98 s [vector] +++ OK, passed 100 tests.
  8201. 646.98 s [vector] scanl1: OK
  8202. 646.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8203. 646.98 s [vector] scanl1': OK
  8204. 646.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8205. 646.99 s [vector] concatMap: OK
  8206. 646.99 s [vector] +++ OK, passed 100 tests.
  8207. 646.99 s [vector] unfoldr: OK
  8208. 646.99 s [vector] +++ OK, passed 100 tests.
  8209. 646.99 s [vector] and: OK
  8210. 646.99 s [vector] +++ OK, passed 100 tests.
  8211. 646.99 s [vector] or: OK
  8212. 646.99 s [vector] +++ OK, passed 100 tests.
  8213. 646.99 s [vector] Tests.Vector.Boxed
  8214. 646.99 s [vector] Bool
  8215. 646.99 s [vector] fromList.toList == id: OK
  8216. 646.99 s [vector] +++ OK, passed 100 tests.
  8217. 646.99 s [vector] toList.fromList == id: OK
  8218. 646.99 s [vector] +++ OK, passed 100 tests.
  8219. 646.99 s [vector] unstream.stream == id: OK
  8220. 646.99 s [vector] +++ OK, passed 100 tests.
  8221. 646.99 s [vector] stream.unstream == id: OK
  8222. 646.99 s [vector] +++ OK, passed 100 tests.
  8223. 646.99 s [vector] eq: OK
  8224. 646.99 s [vector] +++ OK, passed 100 tests.
  8225. 646.99 s [vector] length: OK
  8226. 646.99 s [vector] +++ OK, passed 100 tests.
  8227. 646.99 s [vector] null: OK
  8228. 646.99 s [vector] +++ OK, passed 100 tests.
  8229. 646.99 s [vector] index: OK
  8230. 646.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8231. 646.99 s [vector] safeIndex: OK
  8232. 646.99 s [vector] +++ OK, passed 100 tests.
  8233. 646.99 s [vector] head: OK
  8234. 646.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8235. 647.00 s [vector] last: OK
  8236. 647.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8237. 647.00 s [vector] unsafeIndex: OK
  8238. 647.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8239. 647.00 s [vector] unsafeHead: OK
  8240. 647.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8241. 647.00 s [vector] unsafeLast: OK
  8242. 647.00 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8243. 647.00 s [vector] slice: OK
  8244. 647.00 s [vector] +++ OK, passed 100 tests.
  8245. 647.00 s [vector] init: OK
  8246. 647.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8247. 647.00 s [vector] tail: OK
  8248. 647.00 s [vector] +++ OK, passed 100 tests; 26 discarded.
  8249. 647.00 s [vector] take: OK
  8250. 647.00 s [vector] +++ OK, passed 100 tests.
  8251. 647.00 s [vector] drop: OK
  8252. 647.00 s [vector] +++ OK, passed 100 tests.
  8253. 647.00 s [vector] splitAt: OK
  8254. 647.00 s [vector] +++ OK, passed 100 tests.
  8255. 647.00 s [vector] empty: OK
  8256. 647.00 s [vector] +++ OK, passed 100 tests.
  8257. 647.00 s [vector] singleton: OK
  8258. 647.00 s [vector] +++ OK, passed 100 tests.
  8259. 647.00 s [vector] replicate: OK
  8260. 647.00 s [vector] +++ OK, passed 100 tests.
  8261. 647.00 s [vector] generate: OK
  8262. 647.00 s [vector] +++ OK, passed 100 tests.
  8263. 647.00 s [vector] iterateN: OK
  8264. 647.03 s [vector] +++ OK, passed 100 tests.
  8265. 647.04 s [vector] iterateNM: OK (0.03s)
  8266. 647.04 s [vector] +++ OK, passed 100 tests.
  8267. 647.08 s [vector] generateM: OK (0.05s)
  8268. 647.08 s [vector] +++ OK, passed 100 tests.
  8269. 647.11 s [vector] replicateM: OK (0.03s)
  8270. 647.11 s [vector] +++ OK, passed 100 tests.
  8271. 647.11 s [vector] create: OK
  8272. 647.11 s [vector] +++ OK, passed 100 tests.
  8273. 647.11 s [vector] createT: OK
  8274. 647.11 s [vector] +++ OK, passed 100 tests.
  8275. 647.11 s [vector] unfoldr: OK
  8276. 647.11 s [vector] +++ OK, passed 100 tests.
  8277. 647.11 s [vector] unfoldrN: OK
  8278. 647.11 s [vector] +++ OK, passed 100 tests.
  8279. 647.11 s [vector] unfoldrExactN: OK
  8280. 647.12 s [vector] +++ OK, passed 100 tests.
  8281. 647.12 s [vector] unfoldrM: OK
  8282. 647.12 s [vector] +++ OK, passed 100 tests.
  8283. 647.12 s [vector] unfoldrNM: OK
  8284. 647.12 s [vector] +++ OK, passed 100 tests.
  8285. 647.14 s [vector] unfoldrExactNM: OK (0.01s)
  8286. 647.14 s [vector] +++ OK, passed 100 tests.
  8287. 647.14 s [vector] constructN: OK
  8288. 647.14 s [vector] +++ OK, passed 100 tests.
  8289. 647.14 s [vector] constructrN: OK
  8290. 647.14 s [vector] +++ OK, passed 100 tests.
  8291. 647.14 s [vector] cons: OK
  8292. 647.15 s [vector] +++ OK, passed 100 tests.
  8293. 647.15 s [vector] snoc: OK
  8294. 647.15 s [vector] +++ OK, passed 100 tests.
  8295. 647.15 s [vector] append: OK
  8296. 647.16 s [vector] +++ OK, passed 100 tests.
  8297. 647.17 s [vector] concat: OK (0.02s)
  8298. 647.17 s [vector] +++ OK, passed 100 tests.
  8299. 647.17 s [vector] force: OK
  8300. 647.17 s [vector] +++ OK, passed 100 tests.
  8301. 647.17 s [vector] upd: OK
  8302. 647.17 s [vector] +++ OK, passed 100 tests.
  8303. 647.17 s [vector] accum: OK
  8304. 647.17 s [vector] +++ OK, passed 100 tests.
  8305. 647.17 s [vector] reverse: OK
  8306. 647.17 s [vector] +++ OK, passed 100 tests.
  8307. 647.17 s [vector] backpermute: OK
  8308. 647.17 s [vector] +++ OK, passed 100 tests.
  8309. 647.18 s [vector] map: OK
  8310. 647.18 s [vector] +++ OK, passed 100 tests.
  8311. 647.18 s [vector] imap: OK
  8312. 647.18 s [vector] +++ OK, passed 100 tests.
  8313. 647.18 s [vector] concatMap: OK
  8314. 647.18 s [vector] +++ OK, passed 100 tests.
  8315. 647.18 s [vector] mapM: OK
  8316. 647.18 s [vector] +++ OK, passed 100 tests.
  8317. 647.20 s [vector] mapM_: OK (0.02s)
  8318. 647.20 s [vector] +++ OK, passed 100 tests.
  8319. 647.20 s [vector] forM: OK
  8320. 647.20 s [vector] +++ OK, passed 100 tests.
  8321. 647.21 s [vector] forM_: OK (0.02s)
  8322. 647.21 s [vector] +++ OK, passed 100 tests.
  8323. 647.21 s [vector] imapM: OK
  8324. 647.22 s [vector] +++ OK, passed 100 tests.
  8325. 647.23 s [vector] imapM_: OK (0.02s)
  8326. 647.23 s [vector] +++ OK, passed 100 tests.
  8327. 647.24 s [vector] zipWith: OK
  8328. 647.24 s [vector] +++ OK, passed 100 tests.
  8329. 647.24 s [vector] zipWith3: OK
  8330. 647.24 s [vector] +++ OK, passed 100 tests.
  8331. 647.24 s [vector] izipWith: OK
  8332. 647.24 s [vector] +++ OK, passed 100 tests.
  8333. 647.24 s [vector] izipWith3: OK
  8334. 647.24 s [vector] +++ OK, passed 100 tests.
  8335. 647.25 s [vector] izipWithM: OK
  8336. 647.26 s [vector] +++ OK, passed 100 tests.
  8337. 647.26 s [vector] izipWithM_: OK (0.01s)
  8338. 647.26 s [vector] +++ OK, passed 100 tests.
  8339. 647.26 s [vector] zipWithM: OK
  8340. 647.26 s [vector] +++ OK, passed 100 tests.
  8341. 647.27 s [vector] zipWithM_: OK
  8342. 647.27 s [vector] +++ OK, passed 100 tests.
  8343. 647.27 s [vector] filter: OK
  8344. 647.27 s [vector] +++ OK, passed 100 tests.
  8345. 647.27 s [vector] ifilter: OK
  8346. 647.28 s [vector] +++ OK, passed 100 tests.
  8347. 647.32 s [vector] filterM: OK (0.04s)
  8348. 647.32 s [vector] +++ OK, passed 100 tests.
  8349. 647.32 s [vector] uniq: OK (0.01s)
  8350. 647.32 s [vector] +++ OK, passed 100 tests.
  8351. 647.33 s [vector] mapMaybe: OK
  8352. 647.33 s [vector] +++ OK, passed 100 tests.
  8353. 647.33 s [vector] imapMaybe: OK
  8354. 647.33 s [vector] +++ OK, passed 100 tests.
  8355. 647.33 s [vector] takeWhile: OK
  8356. 647.33 s [vector] +++ OK, passed 100 tests.
  8357. 647.33 s [vector] dropWhile: OK
  8358. 647.33 s [vector] +++ OK, passed 100 tests.
  8359. 647.33 s [vector] partition: OK
  8360. 647.34 s [vector] +++ OK, passed 100 tests.
  8361. 647.34 s [vector] partitionWith: OK
  8362. 647.34 s [vector] +++ OK, passed 100 tests.
  8363. 647.34 s [vector] span: OK
  8364. 647.34 s [vector] +++ OK, passed 100 tests.
  8365. 647.34 s [vector] break: OK
  8366. 647.34 s [vector] +++ OK, passed 100 tests.
  8367. 647.34 s [vector] spanR: OK
  8368. 647.34 s [vector] +++ OK, passed 100 tests.
  8369. 647.34 s [vector] breakR: OK
  8370. 647.34 s [vector] +++ OK, passed 100 tests.
  8371. 647.34 s [vector] groupBy: OK
  8372. 647.34 s [vector] +++ OK, passed 100 tests.
  8373. 647.34 s [vector] elem: OK
  8374. 647.34 s [vector] +++ OK, passed 100 tests.
  8375. 647.34 s [vector] notElem: OK
  8376. 647.34 s [vector] +++ OK, passed 100 tests.
  8377. 647.34 s [vector] find: OK
  8378. 647.34 s [vector] +++ OK, passed 100 tests.
  8379. 647.34 s [vector] findIndex: OK
  8380. 647.34 s [vector] +++ OK, passed 100 tests.
  8381. 647.34 s [vector] findIndexR: OK
  8382. 647.34 s [vector] +++ OK, passed 100 tests.
  8383. 647.34 s [vector] findIndices: OK
  8384. 647.34 s [vector] +++ OK, passed 100 tests.
  8385. 647.34 s [vector] elemIndex: OK
  8386. 647.34 s [vector] +++ OK, passed 100 tests.
  8387. 647.34 s [vector] elemIndices: OK
  8388. 647.35 s [vector] +++ OK, passed 100 tests.
  8389. 647.35 s [vector] foldl: OK
  8390. 647.35 s [vector] +++ OK, passed 100 tests.
  8391. 647.35 s [vector] foldl1: OK
  8392. 647.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8393. 647.35 s [vector] foldl': OK
  8394. 647.35 s [vector] +++ OK, passed 100 tests.
  8395. 647.35 s [vector] foldl1': OK
  8396. 647.35 s [vector] +++ OK, passed 100 tests; 28 discarded.
  8397. 647.35 s [vector] foldr: OK
  8398. 647.35 s [vector] +++ OK, passed 100 tests.
  8399. 647.35 s [vector] foldr1: OK
  8400. 647.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8401. 647.35 s [vector] foldr': OK
  8402. 647.36 s [vector] +++ OK, passed 100 tests.
  8403. 647.36 s [vector] foldr1': OK
  8404. 647.36 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8405. 647.36 s [vector] ifoldl: OK
  8406. 647.36 s [vector] +++ OK, passed 100 tests.
  8407. 647.36 s [vector] ifoldl': OK
  8408. 647.36 s [vector] +++ OK, passed 100 tests.
  8409. 647.36 s [vector] ifoldr: OK
  8410. 647.36 s [vector] +++ OK, passed 100 tests.
  8411. 647.37 s [vector] ifoldr': OK
  8412. 647.37 s [vector] +++ OK, passed 100 tests.
  8413. 647.37 s [vector] ifoldM: OK
  8414. 647.37 s [vector] +++ OK, passed 100 tests.
  8415. 647.38 s [vector] ifoldM': OK
  8416. 647.38 s [vector] +++ OK, passed 100 tests.
  8417. 647.38 s [vector] ifoldM_: OK (0.01s)
  8418. 647.38 s [vector] +++ OK, passed 100 tests.
  8419. 647.40 s [vector] ifoldM'_: OK
  8420. 647.40 s [vector] +++ OK, passed 100 tests.
  8421. 647.40 s [vector] all: OK
  8422. 647.40 s [vector] +++ OK, passed 100 tests.
  8423. 647.40 s [vector] any: OK
  8424. 647.40 s [vector] +++ OK, passed 100 tests.
  8425. 647.40 s [vector] prescanl: OK
  8426. 647.40 s [vector] +++ OK, passed 100 tests.
  8427. 647.40 s [vector] prescanl': OK
  8428. 647.40 s [vector] +++ OK, passed 100 tests.
  8429. 647.41 s [vector] postscanl: OK
  8430. 647.41 s [vector] +++ OK, passed 100 tests.
  8431. 647.41 s [vector] postscanl': OK
  8432. 647.41 s [vector] +++ OK, passed 100 tests.
  8433. 647.41 s [vector] scanl: OK
  8434. 647.41 s [vector] +++ OK, passed 100 tests.
  8435. 647.41 s [vector] scanl': OK
  8436. 647.41 s [vector] +++ OK, passed 100 tests.
  8437. 647.41 s [vector] scanl1: OK
  8438. 647.42 s [vector] +++ OK, passed 100 tests.
  8439. 647.42 s [vector] scanl1': OK
  8440. 647.42 s [vector] +++ OK, passed 100 tests.
  8441. 647.42 s [vector] iscanl: OK
  8442. 647.43 s [vector] +++ OK, passed 100 tests.
  8443. 647.43 s [vector] iscanl': OK
  8444. 647.43 s [vector] +++ OK, passed 100 tests.
  8445. 647.43 s [vector] prescanr: OK
  8446. 647.43 s [vector] +++ OK, passed 100 tests.
  8447. 647.43 s [vector] prescanr': OK
  8448. 647.43 s [vector] +++ OK, passed 100 tests.
  8449. 647.43 s [vector] postscanr: OK
  8450. 647.43 s [vector] +++ OK, passed 100 tests.
  8451. 647.43 s [vector] postscanr': OK
  8452. 647.43 s [vector] +++ OK, passed 100 tests.
  8453. 647.44 s [vector] scanr: OK
  8454. 647.44 s [vector] +++ OK, passed 100 tests.
  8455. 647.44 s [vector] scanr': OK
  8456. 647.44 s [vector] +++ OK, passed 100 tests.
  8457. 647.44 s [vector] scanr1: OK
  8458. 647.44 s [vector] +++ OK, passed 100 tests.
  8459. 647.44 s [vector] scanr1': OK
  8460. 647.44 s [vector] +++ OK, passed 100 tests.
  8461. 647.45 s [vector] iscanr: OK
  8462. 647.45 s [vector] +++ OK, passed 100 tests.
  8463. 647.45 s [vector] iscanr': OK
  8464. 647.45 s [vector] +++ OK, passed 100 tests.
  8465. 647.45 s [vector] mut_read: OK
  8466. 647.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8467. 647.45 s [vector] mut_write: OK
  8468. 647.45 s [vector] +++ OK, passed 100 tests; 10 discarded.
  8469. 647.45 s [vector] mut_modify: OK
  8470. 647.45 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8471. 647.45 s [vector] mut_generate: OK
  8472. 647.46 s [vector] +++ OK, passed 100 tests.
  8473. 647.46 s [vector] mut_generateM: OK
  8474. 647.48 s [vector] +++ OK, passed 100 tests.
  8475. 647.48 s [vector] mut_mapM_: OK (0.02s)
  8476. 647.48 s [vector] +++ OK, passed 100 tests.
  8477. 647.50 s [vector] mut_imapM_: OK (0.01s)
  8478. 647.50 s [vector] +++ OK, passed 100 tests.
  8479. 647.52 s [vector] mut_forM_: OK (0.01s)
  8480. 647.52 s [vector] +++ OK, passed 100 tests.
  8481. 647.52 s [vector] mut_iforM_: OK (0.02s)
  8482. 647.53 s [vector] +++ OK, passed 100 tests.
  8483. 647.53 s [vector] mut_foldr: OK
  8484. 647.53 s [vector] +++ OK, passed 100 tests.
  8485. 647.53 s [vector] mut_foldr': OK
  8486. 647.53 s [vector] +++ OK, passed 100 tests.
  8487. 647.53 s [vector] mut_foldl: OK
  8488. 647.53 s [vector] +++ OK, passed 100 tests.
  8489. 647.53 s [vector] mut_foldl': OK
  8490. 647.53 s [vector] +++ OK, passed 100 tests.
  8491. 647.53 s [vector] mut_ifoldr: OK
  8492. 647.54 s [vector] +++ OK, passed 100 tests.
  8493. 647.54 s [vector] mut_ifoldr': OK
  8494. 647.54 s [vector] +++ OK, passed 100 tests.
  8495. 647.54 s [vector] mut_ifoldl: OK
  8496. 647.54 s [vector] +++ OK, passed 100 tests.
  8497. 647.54 s [vector] mut_ifoldl': OK
  8498. 647.54 s [vector] +++ OK, passed 100 tests.
  8499. 647.54 s [vector] mut_foldM: OK
  8500. 647.54 s [vector] +++ OK, passed 100 tests.
  8501. 647.54 s [vector] mut_foldM': OK
  8502. 647.55 s [vector] +++ OK, passed 100 tests.
  8503. 647.55 s [vector] mut_foldrM: OK
  8504. 647.55 s [vector] +++ OK, passed 100 tests.
  8505. 647.55 s [vector] mut_foldrM': OK
  8506. 647.55 s [vector] +++ OK, passed 100 tests.
  8507. 647.55 s [vector] mut_ifoldM: OK
  8508. 647.56 s [vector] +++ OK, passed 100 tests.
  8509. 647.56 s [vector] mut_ifoldM': OK
  8510. 647.56 s [vector] +++ OK, passed 100 tests.
  8511. 647.56 s [vector] mut_ifoldrM: OK
  8512. 647.56 s [vector] +++ OK, passed 100 tests.
  8513. 647.56 s [vector] mut_ifoldrM': OK
  8514. 647.56 s [vector] +++ OK, passed 100 tests.
  8515. 647.56 s [vector] compare: OK
  8516. 647.56 s [vector] +++ OK, passed 100 tests.
  8517. 647.56 s [vector] maximum: OK
  8518. 647.56 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8519. 647.56 s [vector] minimum: OK
  8520. 647.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8521. 647.56 s [vector] minIndex: OK
  8522. 647.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8523. 647.56 s [vector] maxIndex: OK
  8524. 647.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8525. 647.56 s [vector] maximumBy: OK
  8526. 647.56 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8527. 647.56 s [vector] minimumBy: OK
  8528. 647.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8529. 647.57 s [vector] maximumOn: OK
  8530. 647.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8531. 647.57 s [vector] minimumOn: OK
  8532. 647.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8533. 647.57 s [vector] maxIndexBy: OK
  8534. 647.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8535. 647.57 s [vector] minIndexBy: OK
  8536. 647.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8537. 647.57 s [vector] ListFirstMaxIndexWins: OK
  8538. 647.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8539. 647.57 s [vector] FalseListFirstMaxIndexWins: OK
  8540. 647.57 s [vector] +++ OK, failed as expected. (after 1 test):
  8541. 647.57 s [vector] Exception:
  8542. 647.57 s [vector] Prelude.foldr1: empty list
  8543. 647.57 s [vector] CallStack (from HasCallStack):
  8544. 647.57 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8545. 647.57 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8546. 647.57 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8547. 647.57 s [vector] []
  8548. 647.57 s [vector] zip: OK
  8549. 647.57 s [vector] +++ OK, passed 100 tests.
  8550. 647.57 s [vector] zip3: OK
  8551. 647.57 s [vector] +++ OK, passed 100 tests.
  8552. 647.57 s [vector] unzip: OK
  8553. 647.57 s [vector] +++ OK, passed 100 tests.
  8554. 647.57 s [vector] unzip3: OK
  8555. 647.57 s [vector] +++ OK, passed 100 tests.
  8556. 647.57 s [vector] indexed: OK
  8557. 647.57 s [vector] +++ OK, passed 100 tests.
  8558. 647.57 s [vector] update: OK
  8559. 647.58 s [vector] +++ OK, passed 100 tests.
  8560. 647.59 s [vector] concat: OK (0.01s)
  8561. 647.59 s [vector] +++ OK, passed 100 tests.
  8562. 647.59 s [vector] mempty: OK
  8563. 647.59 s [vector] +++ OK, passed 100 tests.
  8564. 647.59 s [vector] mappend: OK
  8565. 647.60 s [vector] +++ OK, passed 100 tests.
  8566. 647.60 s [vector] mconcat: OK
  8567. 647.60 s [vector] +++ OK, passed 100 tests.
  8568. 647.60 s [vector] fmap: OK
  8569. 647.60 s [vector] +++ OK, passed 100 tests.
  8570. 647.60 s [vector] return: OK
  8571. 647.60 s [vector] +++ OK, passed 100 tests.
  8572. 647.61 s [vector] bind: OK (0.01s)
  8573. 647.61 s [vector] +++ OK, passed 100 tests.
  8574. 647.61 s [vector] mzip: OK
  8575. 647.61 s [vector] +++ OK, passed 100 tests.
  8576. 647.61 s [vector] munzip: OK
  8577. 647.61 s [vector] +++ OK, passed 100 tests.
  8578. 647.62 s [vector] applicative_pure: OK
  8579. 647.62 s [vector] +++ OK, passed 100 tests.
  8580. 647.64 s [vector] applicative_appl: OK (0.02s)
  8581. 647.64 s [vector] +++ OK, passed 100 tests.
  8582. 647.64 s [vector] alternative_empty: OK
  8583. 647.64 s [vector] +++ OK, passed 100 tests.
  8584. 647.64 s [vector] alternative_or: OK
  8585. 647.64 s [vector] +++ OK, passed 100 tests.
  8586. 647.72 s [vector] sequence: OK (0.06s)
  8587. 647.72 s [vector] +++ OK, passed 100 tests.
  8588. 647.72 s [vector] sequence_: OK (0.01s)
  8589. 647.72 s [vector] +++ OK, passed 100 tests.
  8590. 647.72 s [vector] glength: OK
  8591. 647.72 s [vector] +++ OK, passed 100 tests.
  8592. 647.72 s [vector] and: OK
  8593. 647.72 s [vector] +++ OK, passed 100 tests.
  8594. 647.72 s [vector] or: OK
  8595. 647.72 s [vector] +++ OK, passed 100 tests.
  8596. 647.72 s [vector] Int
  8597. 647.72 s [vector] fromList.toList == id: OK
  8598. 647.72 s [vector] +++ OK, passed 100 tests.
  8599. 647.72 s [vector] toList.fromList == id: OK
  8600. 647.72 s [vector] +++ OK, passed 100 tests.
  8601. 647.72 s [vector] unstream.stream == id: OK
  8602. 647.72 s [vector] +++ OK, passed 100 tests.
  8603. 647.72 s [vector] stream.unstream == id: OK
  8604. 647.72 s [vector] +++ OK, passed 100 tests.
  8605. 647.72 s [vector] eq: OK
  8606. 647.72 s [vector] +++ OK, passed 100 tests.
  8607. 647.72 s [vector] length: OK
  8608. 647.72 s [vector] +++ OK, passed 100 tests.
  8609. 647.73 s [vector] null: OK
  8610. 647.73 s [vector] +++ OK, passed 100 tests.
  8611. 647.73 s [vector] index: OK
  8612. 647.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8613. 647.73 s [vector] safeIndex: OK
  8614. 647.73 s [vector] +++ OK, passed 100 tests.
  8615. 647.73 s [vector] head: OK
  8616. 647.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8617. 647.73 s [vector] last: OK
  8618. 647.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8619. 647.73 s [vector] unsafeIndex: OK
  8620. 647.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8621. 647.73 s [vector] unsafeHead: OK
  8622. 647.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8623. 647.73 s [vector] unsafeLast: OK
  8624. 647.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8625. 647.73 s [vector] slice: OK
  8626. 647.73 s [vector] +++ OK, passed 100 tests.
  8627. 647.73 s [vector] init: OK
  8628. 647.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8629. 647.73 s [vector] tail: OK
  8630. 647.73 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8631. 647.73 s [vector] take: OK
  8632. 647.73 s [vector] +++ OK, passed 100 tests.
  8633. 647.73 s [vector] drop: OK
  8634. 647.73 s [vector] +++ OK, passed 100 tests.
  8635. 647.73 s [vector] splitAt: OK
  8636. 647.73 s [vector] +++ OK, passed 100 tests.
  8637. 647.73 s [vector] empty: OK
  8638. 647.73 s [vector] +++ OK, passed 100 tests.
  8639. 647.73 s [vector] singleton: OK
  8640. 647.73 s [vector] +++ OK, passed 100 tests.
  8641. 647.73 s [vector] replicate: OK
  8642. 647.73 s [vector] +++ OK, passed 100 tests.
  8643. 647.73 s [vector] generate: OK
  8644. 647.73 s [vector] +++ OK, passed 100 tests.
  8645. 647.73 s [vector] iterateN: OK
  8646. 647.74 s [vector] +++ OK, passed 100 tests.
  8647. 647.77 s [vector] iterateNM: OK (0.02s)
  8648. 647.77 s [vector] +++ OK, passed 100 tests.
  8649. 647.77 s [vector] generateM: OK (0.02s)
  8650. 647.78 s [vector] +++ OK, passed 100 tests.
  8651. 647.81 s [vector] replicateM: OK (0.02s)
  8652. 647.81 s [vector] +++ OK, passed 100 tests.
  8653. 647.81 s [vector] create: OK
  8654. 647.81 s [vector] +++ OK, passed 100 tests.
  8655. 647.81 s [vector] createT: OK
  8656. 647.81 s [vector] +++ OK, passed 100 tests.
  8657. 647.81 s [vector] unfoldr: OK
  8658. 647.81 s [vector] +++ OK, passed 100 tests.
  8659. 647.81 s [vector] unfoldrN: OK
  8660. 647.81 s [vector] +++ OK, passed 100 tests.
  8661. 647.81 s [vector] unfoldrExactN: OK
  8662. 647.81 s [vector] +++ OK, passed 100 tests.
  8663. 647.81 s [vector] unfoldrM: OK
  8664. 647.81 s [vector] +++ OK, passed 100 tests.
  8665. 647.82 s [vector] unfoldrNM: OK
  8666. 647.82 s [vector] +++ OK, passed 100 tests.
  8667. 647.84 s [vector] unfoldrExactNM: OK (0.02s)
  8668. 647.84 s [vector] +++ OK, passed 100 tests.
  8669. 647.84 s [vector] constructN: OK
  8670. 647.84 s [vector] +++ OK, passed 100 tests.
  8671. 647.84 s [vector] constructrN: OK
  8672. 647.84 s [vector] +++ OK, passed 100 tests.
  8673. 647.84 s [vector] cons: OK
  8674. 647.84 s [vector] +++ OK, passed 100 tests.
  8675. 647.84 s [vector] snoc: OK
  8676. 647.84 s [vector] +++ OK, passed 100 tests.
  8677. 647.86 s [vector] append: OK
  8678. 647.86 s [vector] +++ OK, passed 100 tests.
  8679. 647.86 s [vector] concat: OK (0.02s)
  8680. 647.86 s [vector] +++ OK, passed 100 tests.
  8681. 647.86 s [vector] force: OK
  8682. 647.86 s [vector] +++ OK, passed 100 tests.
  8683. 647.86 s [vector] upd: OK
  8684. 647.86 s [vector] +++ OK, passed 100 tests.
  8685. 647.86 s [vector] accum: OK
  8686. 647.86 s [vector] +++ OK, passed 100 tests.
  8687. 647.87 s [vector] reverse: OK
  8688. 647.87 s [vector] +++ OK, passed 100 tests.
  8689. 647.87 s [vector] backpermute: OK
  8690. 647.87 s [vector] +++ OK, passed 100 tests.
  8691. 647.87 s [vector] map: OK
  8692. 647.87 s [vector] +++ OK, passed 100 tests.
  8693. 647.87 s [vector] imap: OK
  8694. 647.87 s [vector] +++ OK, passed 100 tests.
  8695. 647.87 s [vector] concatMap: OK
  8696. 647.87 s [vector] +++ OK, passed 100 tests.
  8697. 647.88 s [vector] mapM: OK
  8698. 647.88 s [vector] +++ OK, passed 100 tests.
  8699. 647.89 s [vector] mapM_: OK (0.02s)
  8700. 647.89 s [vector] +++ OK, passed 100 tests.
  8701. 647.89 s [vector] forM: OK
  8702. 647.90 s [vector] +++ OK, passed 100 tests.
  8703. 647.91 s [vector] forM_: OK (0.02s)
  8704. 647.91 s [vector] +++ OK, passed 100 tests.
  8705. 647.92 s [vector] imapM: OK
  8706. 647.92 s [vector] +++ OK, passed 100 tests.
  8707. 647.93 s [vector] imapM_: OK (0.02s)
  8708. 647.93 s [vector] +++ OK, passed 100 tests.
  8709. 647.93 s [vector] zipWith: OK
  8710. 647.93 s [vector] +++ OK, passed 100 tests.
  8711. 647.94 s [vector] zipWith3: OK
  8712. 647.94 s [vector] +++ OK, passed 100 tests.
  8713. 647.94 s [vector] izipWith: OK
  8714. 647.94 s [vector] +++ OK, passed 100 tests.
  8715. 647.94 s [vector] izipWith3: OK
  8716. 647.94 s [vector] +++ OK, passed 100 tests.
  8717. 647.95 s [vector] izipWithM: OK
  8718. 647.96 s [vector] +++ OK, passed 100 tests.
  8719. 647.96 s [vector] izipWithM_: OK (0.01s)
  8720. 647.96 s [vector] +++ OK, passed 100 tests.
  8721. 647.96 s [vector] zipWithM: OK
  8722. 647.96 s [vector] +++ OK, passed 100 tests.
  8723. 647.97 s [vector] zipWithM_: OK (0.01s)
  8724. 647.97 s [vector] +++ OK, passed 100 tests.
  8725. 647.97 s [vector] filter: OK
  8726. 647.97 s [vector] +++ OK, passed 100 tests.
  8727. 647.97 s [vector] ifilter: OK
  8728. 647.97 s [vector] +++ OK, passed 100 tests.
  8729. 648.00 s [vector] filterM: OK (0.03s)
  8730. 648.00 s [vector] +++ OK, passed 100 tests.
  8731. 648.00 s [vector] uniq: OK
  8732. 648.00 s [vector] +++ OK, passed 100 tests.
  8733. 648.00 s [vector] mapMaybe: OK
  8734. 648.00 s [vector] +++ OK, passed 100 tests.
  8735. 648.01 s [vector] imapMaybe: OK
  8736. 648.01 s [vector] +++ OK, passed 100 tests.
  8737. 648.01 s [vector] takeWhile: OK
  8738. 648.01 s [vector] +++ OK, passed 100 tests.
  8739. 648.01 s [vector] dropWhile: OK
  8740. 648.01 s [vector] +++ OK, passed 100 tests.
  8741. 648.01 s [vector] partition: OK
  8742. 648.01 s [vector] +++ OK, passed 100 tests.
  8743. 648.01 s [vector] partitionWith: OK
  8744. 648.01 s [vector] +++ OK, passed 100 tests.
  8745. 648.01 s [vector] span: OK
  8746. 648.01 s [vector] +++ OK, passed 100 tests.
  8747. 648.01 s [vector] break: OK
  8748. 648.01 s [vector] +++ OK, passed 100 tests.
  8749. 648.01 s [vector] spanR: OK
  8750. 648.01 s [vector] +++ OK, passed 100 tests.
  8751. 648.01 s [vector] breakR: OK
  8752. 648.01 s [vector] +++ OK, passed 100 tests.
  8753. 648.01 s [vector] groupBy: OK
  8754. 648.01 s [vector] +++ OK, passed 100 tests.
  8755. 648.02 s [vector] elem: OK
  8756. 648.02 s [vector] +++ OK, passed 100 tests.
  8757. 648.02 s [vector] notElem: OK
  8758. 648.02 s [vector] +++ OK, passed 100 tests.
  8759. 648.02 s [vector] find: OK
  8760. 648.02 s [vector] +++ OK, passed 100 tests.
  8761. 648.02 s [vector] findIndex: OK
  8762. 648.02 s [vector] +++ OK, passed 100 tests.
  8763. 648.02 s [vector] findIndexR: OK
  8764. 648.02 s [vector] +++ OK, passed 100 tests.
  8765. 648.02 s [vector] findIndices: OK
  8766. 648.02 s [vector] +++ OK, passed 100 tests.
  8767. 648.02 s [vector] elemIndex: OK
  8768. 648.02 s [vector] +++ OK, passed 100 tests.
  8769. 648.02 s [vector] elemIndices: OK
  8770. 648.02 s [vector] +++ OK, passed 100 tests.
  8771. 648.02 s [vector] foldl: OK
  8772. 648.02 s [vector] +++ OK, passed 100 tests.
  8773. 648.02 s [vector] foldl1: OK
  8774. 648.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8775. 648.03 s [vector] foldl': OK
  8776. 648.03 s [vector] +++ OK, passed 100 tests.
  8777. 648.03 s [vector] foldl1': OK
  8778. 648.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8779. 648.03 s [vector] foldr: OK
  8780. 648.03 s [vector] +++ OK, passed 100 tests.
  8781. 648.04 s [vector] foldr1: OK
  8782. 648.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8783. 648.04 s [vector] foldr': OK
  8784. 648.05 s [vector] +++ OK, passed 100 tests.
  8785. 648.05 s [vector] foldr1': OK
  8786. 648.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8787. 648.05 s [vector] ifoldl: OK
  8788. 648.05 s [vector] +++ OK, passed 100 tests.
  8789. 648.05 s [vector] ifoldl': OK
  8790. 648.05 s [vector] +++ OK, passed 100 tests.
  8791. 648.05 s [vector] ifoldr: OK
  8792. 648.05 s [vector] +++ OK, passed 100 tests.
  8793. 648.06 s [vector] ifoldr': OK
  8794. 648.06 s [vector] +++ OK, passed 100 tests.
  8795. 648.07 s [vector] ifoldM: OK
  8796. 648.07 s [vector] +++ OK, passed 100 tests.
  8797. 648.07 s [vector] ifoldM': OK
  8798. 648.07 s [vector] +++ OK, passed 100 tests.
  8799. 648.10 s [vector] ifoldM_: OK (0.03s)
  8800. 648.10 s [vector] +++ OK, passed 100 tests.
  8801. 648.14 s [vector] ifoldM'_: OK (0.02s)
  8802. 648.14 s [vector] +++ OK, passed 100 tests.
  8803. 648.14 s [vector] all: OK
  8804. 648.14 s [vector] +++ OK, passed 100 tests.
  8805. 648.15 s [vector] any: OK
  8806. 648.15 s [vector] +++ OK, passed 100 tests.
  8807. 648.15 s [vector] prescanl: OK
  8808. 648.15 s [vector] +++ OK, passed 100 tests.
  8809. 648.15 s [vector] prescanl': OK
  8810. 648.15 s [vector] +++ OK, passed 100 tests.
  8811. 648.15 s [vector] postscanl: OK
  8812. 648.16 s [vector] +++ OK, passed 100 tests.
  8813. 648.16 s [vector] postscanl': OK
  8814. 648.16 s [vector] +++ OK, passed 100 tests.
  8815. 648.16 s [vector] scanl: OK
  8816. 648.16 s [vector] +++ OK, passed 100 tests.
  8817. 648.16 s [vector] scanl': OK
  8818. 648.16 s [vector] +++ OK, passed 100 tests.
  8819. 648.16 s [vector] scanl1: OK
  8820. 648.17 s [vector] +++ OK, passed 100 tests.
  8821. 648.17 s [vector] scanl1': OK
  8822. 648.17 s [vector] +++ OK, passed 100 tests.
  8823. 648.17 s [vector] iscanl: OK
  8824. 648.17 s [vector] +++ OK, passed 100 tests.
  8825. 648.18 s [vector] iscanl': OK
  8826. 648.18 s [vector] +++ OK, passed 100 tests.
  8827. 648.18 s [vector] prescanr: OK
  8828. 648.18 s [vector] +++ OK, passed 100 tests.
  8829. 648.18 s [vector] prescanr': OK
  8830. 648.18 s [vector] +++ OK, passed 100 tests.
  8831. 648.18 s [vector] postscanr: OK
  8832. 648.18 s [vector] +++ OK, passed 100 tests.
  8833. 648.18 s [vector] postscanr': OK
  8834. 648.18 s [vector] +++ OK, passed 100 tests.
  8835. 648.19 s [vector] scanr: OK
  8836. 648.19 s [vector] +++ OK, passed 100 tests.
  8837. 648.19 s [vector] scanr': OK
  8838. 648.19 s [vector] +++ OK, passed 100 tests.
  8839. 648.19 s [vector] scanr1: OK
  8840. 648.19 s [vector] +++ OK, passed 100 tests.
  8841. 648.20 s [vector] scanr1': OK
  8842. 648.20 s [vector] +++ OK, passed 100 tests.
  8843. 648.20 s [vector] iscanr: OK
  8844. 648.20 s [vector] +++ OK, passed 100 tests.
  8845. 648.20 s [vector] iscanr': OK
  8846. 648.20 s [vector] +++ OK, passed 100 tests.
  8847. 648.20 s [vector] mut_read: OK
  8848. 648.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8849. 648.20 s [vector] mut_write: OK
  8850. 648.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8851. 648.20 s [vector] mut_modify: OK
  8852. 648.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8853. 648.20 s [vector] mut_generate: OK
  8854. 648.20 s [vector] +++ OK, passed 100 tests.
  8855. 648.22 s [vector] mut_generateM: OK
  8856. 648.22 s [vector] +++ OK, passed 100 tests.
  8857. 648.24 s [vector] mut_mapM_: OK (0.01s)
  8858. 648.24 s [vector] +++ OK, passed 100 tests.
  8859. 648.24 s [vector] mut_imapM_: OK (0.02s)
  8860. 648.24 s [vector] +++ OK, passed 100 tests.
  8861. 648.26 s [vector] mut_forM_: OK (0.02s)
  8862. 648.26 s [vector] +++ OK, passed 100 tests.
  8863. 648.28 s [vector] mut_iforM_: OK (0.02s)
  8864. 648.28 s [vector] +++ OK, passed 100 tests.
  8865. 648.28 s [vector] mut_foldr: OK
  8866. 648.28 s [vector] +++ OK, passed 100 tests.
  8867. 648.28 s [vector] mut_foldr': OK
  8868. 648.28 s [vector] +++ OK, passed 100 tests.
  8869. 648.28 s [vector] mut_foldl: OK
  8870. 648.28 s [vector] +++ OK, passed 100 tests.
  8871. 648.29 s [vector] mut_foldl': OK
  8872. 648.29 s [vector] +++ OK, passed 100 tests.
  8873. 648.29 s [vector] mut_ifoldr: OK
  8874. 648.29 s [vector] +++ OK, passed 100 tests.
  8875. 648.29 s [vector] mut_ifoldr': OK
  8876. 648.29 s [vector] +++ OK, passed 100 tests.
  8877. 648.29 s [vector] mut_ifoldl: OK
  8878. 648.29 s [vector] +++ OK, passed 100 tests.
  8879. 648.30 s [vector] mut_ifoldl': OK
  8880. 648.30 s [vector] +++ OK, passed 100 tests.
  8881. 648.30 s [vector] mut_foldM: OK
  8882. 648.30 s [vector] +++ OK, passed 100 tests.
  8883. 648.30 s [vector] mut_foldM': OK
  8884. 648.30 s [vector] +++ OK, passed 100 tests.
  8885. 648.30 s [vector] mut_foldrM: OK
  8886. 648.30 s [vector] +++ OK, passed 100 tests.
  8887. 648.31 s [vector] mut_foldrM': OK
  8888. 648.31 s [vector] +++ OK, passed 100 tests.
  8889. 648.31 s [vector] mut_ifoldM: OK
  8890. 648.31 s [vector] +++ OK, passed 100 tests.
  8891. 648.31 s [vector] mut_ifoldM': OK
  8892. 648.31 s [vector] +++ OK, passed 100 tests.
  8893. 648.32 s [vector] mut_ifoldrM: OK
  8894. 648.32 s [vector] +++ OK, passed 100 tests.
  8895. 648.32 s [vector] mut_ifoldrM': OK
  8896. 648.32 s [vector] +++ OK, passed 100 tests.
  8897. 648.32 s [vector] compare: OK
  8898. 648.32 s [vector] +++ OK, passed 100 tests.
  8899. 648.32 s [vector] maximum: OK
  8900. 648.32 s [vector] +++ OK, passed 100 tests; 25 discarded.
  8901. 648.32 s [vector] minimum: OK
  8902. 648.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8903. 648.32 s [vector] minIndex: OK
  8904. 648.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8905. 648.32 s [vector] maxIndex: OK
  8906. 648.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8907. 648.32 s [vector] maximumBy: OK
  8908. 648.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8909. 648.32 s [vector] minimumBy: OK
  8910. 648.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8911. 648.32 s [vector] maximumOn: OK
  8912. 648.32 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8913. 648.32 s [vector] minimumOn: OK
  8914. 648.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8915. 648.32 s [vector] maxIndexBy: OK
  8916. 648.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8917. 648.32 s [vector] minIndexBy: OK
  8918. 648.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8919. 648.32 s [vector] ListFirstMaxIndexWins: OK
  8920. 648.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8921. 648.32 s [vector] FalseListFirstMaxIndexWins: OK
  8922. 648.32 s [vector] +++ OK, failed as expected. (after 1 test):
  8923. 648.32 s [vector] Exception:
  8924. 648.32 s [vector] Prelude.foldr1: empty list
  8925. 648.32 s [vector] CallStack (from HasCallStack):
  8926. 648.32 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8927. 648.32 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8928. 648.32 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8929. 648.32 s [vector] []
  8930. 648.33 s [vector] zip: OK
  8931. 648.33 s [vector] +++ OK, passed 100 tests.
  8932. 648.33 s [vector] zip3: OK
  8933. 648.33 s [vector] +++ OK, passed 100 tests.
  8934. 648.33 s [vector] unzip: OK
  8935. 648.33 s [vector] +++ OK, passed 100 tests.
  8936. 648.33 s [vector] unzip3: OK
  8937. 648.33 s [vector] +++ OK, passed 100 tests.
  8938. 648.33 s [vector] indexed: OK
  8939. 648.33 s [vector] +++ OK, passed 100 tests.
  8940. 648.34 s [vector] update: OK
  8941. 648.34 s [vector] +++ OK, passed 100 tests.
  8942. 648.34 s [vector] concat: OK (0.01s)
  8943. 648.34 s [vector] +++ OK, passed 100 tests.
  8944. 648.34 s [vector] mempty: OK
  8945. 648.34 s [vector] +++ OK, passed 100 tests.
  8946. 648.35 s [vector] mappend: OK
  8947. 648.35 s [vector] +++ OK, passed 100 tests.
  8948. 648.36 s [vector] mconcat: OK (0.01s)
  8949. 648.36 s [vector] +++ OK, passed 100 tests.
  8950. 648.36 s [vector] fmap: OK
  8951. 648.36 s [vector] +++ OK, passed 100 tests.
  8952. 648.36 s [vector] return: OK
  8953. 648.36 s [vector] +++ OK, passed 100 tests.
  8954. 648.37 s [vector] bind: OK (0.02s)
  8955. 648.38 s [vector] +++ OK, passed 100 tests.
  8956. 648.38 s [vector] mzip: OK
  8957. 648.38 s [vector] +++ OK, passed 100 tests.
  8958. 648.38 s [vector] munzip: OK
  8959. 648.38 s [vector] +++ OK, passed 100 tests.
  8960. 648.38 s [vector] applicative_pure: OK
  8961. 648.38 s [vector] +++ OK, passed 100 tests.
  8962. 648.42 s [vector] applicative_appl: OK (0.03s)
  8963. 648.42 s [vector] +++ OK, passed 100 tests.
  8964. 648.42 s [vector] alternative_empty: OK
  8965. 648.42 s [vector] +++ OK, passed 100 tests.
  8966. 648.43 s [vector] alternative_or: OK
  8967. 648.43 s [vector] +++ OK, passed 100 tests.
  8968. 648.48 s [vector] sequence: OK (0.06s)
  8969. 648.48 s [vector] +++ OK, passed 100 tests.
  8970. 648.49 s [vector] sequence_: OK (0.02s)
  8971. 648.49 s [vector] +++ OK, passed 100 tests.
  8972. 648.49 s [vector] glength: OK
  8973. 648.49 s [vector] +++ OK, passed 100 tests.
  8974. 648.49 s [vector] sum: OK
  8975. 648.49 s [vector] +++ OK, passed 100 tests.
  8976. 648.49 s [vector] product: OK
  8977. 648.49 s [vector] +++ OK, passed 100 tests.
  8978. 648.49 s [vector] enumFromN: OK
  8979. 648.49 s [vector] +++ OK, passed 100 tests.
  8980. 648.50 s [vector] enumFromThenN: OK
  8981. 648.50 s [vector] +++ OK, passed 100 tests.
  8982. 648.50 s [vector] enumFromTo: OK
  8983. 648.50 s [vector] +++ OK, passed 100 tests.
  8984. 648.50 s [vector] enumFromThenTo: OK
  8985. 648.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8986. 648.50 s [vector] unstream
  8987. 648.50 s [vector] unstream == vunstream (exact): OK
  8988. 648.50 s [vector] +++ OK, passed 100 tests.
  8989. 648.50 s [vector] unstream == vunstream (unknown): OK
  8990. 648.50 s [vector] +++ OK, passed 100 tests.
  8991. 648.50 s [vector] unstreamR ~= vunstream (exact): OK
  8992. 648.50 s [vector] +++ OK, passed 100 tests.
  8993. 648.50 s [vector] unstreamR ~= vunstream (unknown): OK
  8994. 648.50 s [vector] +++ OK, passed 100 tests.
  8995. 648.50 s [vector] Tests.Vector.Primitive
  8996. 648.50 s [vector] Int
  8997. 648.50 s [vector] fromList.toList == id: OK
  8998. 648.50 s [vector] +++ OK, passed 100 tests.
  8999. 648.50 s [vector] toList.fromList == id: OK
  9000. 648.50 s [vector] +++ OK, passed 100 tests.
  9001. 648.50 s [vector] unstream.stream == id: OK
  9002. 648.50 s [vector] +++ OK, passed 100 tests.
  9003. 648.51 s [vector] stream.unstream == id: OK
  9004. 648.51 s [vector] +++ OK, passed 100 tests.
  9005. 648.51 s [vector] eq: OK
  9006. 648.51 s [vector] +++ OK, passed 100 tests.
  9007. 648.51 s [vector] length: OK
  9008. 648.51 s [vector] +++ OK, passed 100 tests.
  9009. 648.51 s [vector] null: OK
  9010. 648.51 s [vector] +++ OK, passed 100 tests.
  9011. 648.51 s [vector] index: OK
  9012. 648.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9013. 648.51 s [vector] safeIndex: OK
  9014. 648.51 s [vector] +++ OK, passed 100 tests.
  9015. 648.51 s [vector] head: OK
  9016. 648.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9017. 648.51 s [vector] last: OK
  9018. 648.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9019. 648.51 s [vector] unsafeIndex: OK
  9020. 648.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9021. 648.51 s [vector] unsafeHead: OK
  9022. 648.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9023. 648.51 s [vector] unsafeLast: OK
  9024. 648.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9025. 648.51 s [vector] slice: OK
  9026. 648.51 s [vector] +++ OK, passed 100 tests.
  9027. 648.51 s [vector] init: OK
  9028. 648.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9029. 648.51 s [vector] tail: OK
  9030. 648.51 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9031. 648.51 s [vector] take: OK
  9032. 648.51 s [vector] +++ OK, passed 100 tests.
  9033. 648.52 s [vector] drop: OK
  9034. 648.52 s [vector] +++ OK, passed 100 tests.
  9035. 648.52 s [vector] splitAt: OK
  9036. 648.52 s [vector] +++ OK, passed 100 tests.
  9037. 648.52 s [vector] empty: OK
  9038. 648.52 s [vector] +++ OK, passed 100 tests.
  9039. 648.52 s [vector] singleton: OK
  9040. 648.52 s [vector] +++ OK, passed 100 tests.
  9041. 648.52 s [vector] replicate: OK
  9042. 648.52 s [vector] +++ OK, passed 100 tests.
  9043. 648.52 s [vector] generate: OK
  9044. 648.52 s [vector] +++ OK, passed 100 tests.
  9045. 648.53 s [vector] iterateN: OK
  9046. 648.53 s [vector] +++ OK, passed 100 tests.
  9047. 648.56 s [vector] iterateNM: OK (0.02s)
  9048. 648.56 s [vector] +++ OK, passed 100 tests.
  9049. 648.57 s [vector] generateM: OK (0.03s)
  9050. 648.57 s [vector] +++ OK, passed 100 tests.
  9051. 648.58 s [vector] replicateM: OK (0.01s)
  9052. 648.58 s [vector] +++ OK, passed 100 tests.
  9053. 648.59 s [vector] create: OK
  9054. 648.59 s [vector] +++ OK, passed 100 tests.
  9055. 648.59 s [vector] createT: OK
  9056. 648.59 s [vector] +++ OK, passed 100 tests.
  9057. 648.59 s [vector] unfoldr: OK
  9058. 648.59 s [vector] +++ OK, passed 100 tests.
  9059. 648.59 s [vector] unfoldrN: OK
  9060. 648.59 s [vector] +++ OK, passed 100 tests.
  9061. 648.59 s [vector] unfoldrExactN: OK
  9062. 648.59 s [vector] +++ OK, passed 100 tests.
  9063. 648.60 s [vector] unfoldrM: OK
  9064. 648.60 s [vector] +++ OK, passed 100 tests.
  9065. 648.60 s [vector] unfoldrNM: OK
  9066. 648.60 s [vector] +++ OK, passed 100 tests.
  9067. 648.62 s [vector] unfoldrExactNM: OK
  9068. 648.62 s [vector] +++ OK, passed 100 tests.
  9069. 648.63 s [vector] constructN: OK
  9070. 648.63 s [vector] +++ OK, passed 100 tests.
  9071. 648.63 s [vector] constructrN: OK
  9072. 648.63 s [vector] +++ OK, passed 100 tests.
  9073. 648.63 s [vector] cons: OK
  9074. 648.63 s [vector] +++ OK, passed 100 tests.
  9075. 648.63 s [vector] snoc: OK
  9076. 648.63 s [vector] +++ OK, passed 100 tests.
  9077. 648.63 s [vector] append: OK
  9078. 648.63 s [vector] +++ OK, passed 100 tests.
  9079. 648.66 s [vector] concat: OK (0.02s)
  9080. 648.66 s [vector] +++ OK, passed 100 tests.
  9081. 648.66 s [vector] force: OK
  9082. 648.66 s [vector] +++ OK, passed 100 tests.
  9083. 648.66 s [vector] upd: OK
  9084. 648.66 s [vector] +++ OK, passed 100 tests.
  9085. 648.66 s [vector] accum: OK
  9086. 648.66 s [vector] +++ OK, passed 100 tests.
  9087. 648.67 s [vector] reverse: OK
  9088. 648.67 s [vector] +++ OK, passed 100 tests.
  9089. 648.67 s [vector] backpermute: OK
  9090. 648.67 s [vector] +++ OK, passed 100 tests.
  9091. 648.67 s [vector] map: OK
  9092. 648.67 s [vector] +++ OK, passed 100 tests.
  9093. 648.67 s [vector] imap: OK
  9094. 648.68 s [vector] +++ OK, passed 100 tests.
  9095. 648.68 s [vector] concatMap: OK
  9096. 648.68 s [vector] +++ OK, passed 100 tests.
  9097. 648.68 s [vector] mapM: OK
  9098. 648.70 s [vector] +++ OK, passed 100 tests.
  9099. 648.71 s [vector] mapM_: OK (0.02s)
  9100. 648.71 s [vector] +++ OK, passed 100 tests.
  9101. 648.71 s [vector] forM: OK
  9102. 648.71 s [vector] +++ OK, passed 100 tests.
  9103. 648.73 s [vector] forM_: OK (0.02s)
  9104. 648.73 s [vector] +++ OK, passed 100 tests.
  9105. 648.73 s [vector] imapM: OK
  9106. 648.73 s [vector] +++ OK, passed 100 tests.
  9107. 648.75 s [vector] imapM_: OK (0.02s)
  9108. 648.75 s [vector] +++ OK, passed 100 tests.
  9109. 648.75 s [vector] zipWith: OK
  9110. 648.75 s [vector] +++ OK, passed 100 tests.
  9111. 648.75 s [vector] zipWith3: OK
  9112. 648.75 s [vector] +++ OK, passed 100 tests.
  9113. 648.76 s [vector] izipWith: OK
  9114. 648.76 s [vector] +++ OK, passed 100 tests.
  9115. 648.76 s [vector] izipWith3: OK
  9116. 648.76 s [vector] +++ OK, passed 100 tests.
  9117. 648.77 s [vector] izipWithM: OK
  9118. 648.77 s [vector] +++ OK, passed 100 tests.
  9119. 648.78 s [vector] izipWithM_: OK (0.02s)
  9120. 648.78 s [vector] +++ OK, passed 100 tests.
  9121. 648.79 s [vector] zipWithM: OK
  9122. 648.79 s [vector] +++ OK, passed 100 tests.
  9123. 648.79 s [vector] zipWithM_: OK (0.01s)
  9124. 648.79 s [vector] +++ OK, passed 100 tests.
  9125. 648.79 s [vector] filter: OK
  9126. 648.80 s [vector] +++ OK, passed 100 tests.
  9127. 648.81 s [vector] ifilter: OK
  9128. 648.81 s [vector] +++ OK, passed 100 tests.
  9129. 648.82 s [vector] filterM: OK (0.03s)
  9130. 648.83 s [vector] +++ OK, passed 100 tests.
  9131. 648.83 s [vector] uniq: OK
  9132. 648.83 s [vector] +++ OK, passed 100 tests.
  9133. 648.83 s [vector] mapMaybe: OK
  9134. 648.83 s [vector] +++ OK, passed 100 tests.
  9135. 648.83 s [vector] imapMaybe: OK
  9136. 648.83 s [vector] +++ OK, passed 100 tests.
  9137. 648.83 s [vector] takeWhile: OK
  9138. 648.84 s [vector] +++ OK, passed 100 tests.
  9139. 648.85 s [vector] dropWhile: OK (0.01s)
  9140. 648.85 s [vector] +++ OK, passed 100 tests.
  9141. 648.85 s [vector] partition: OK
  9142. 648.85 s [vector] +++ OK, passed 100 tests.
  9143. 648.85 s [vector] partitionWith: OK
  9144. 648.85 s [vector] +++ OK, passed 100 tests.
  9145. 648.85 s [vector] span: OK
  9146. 648.85 s [vector] +++ OK, passed 100 tests.
  9147. 648.86 s [vector] break: OK
  9148. 648.86 s [vector] +++ OK, passed 100 tests.
  9149. 648.86 s [vector] spanR: OK
  9150. 648.86 s [vector] +++ OK, passed 100 tests.
  9151. 648.86 s [vector] breakR: OK
  9152. 648.86 s [vector] +++ OK, passed 100 tests.
  9153. 648.86 s [vector] groupBy: OK
  9154. 648.86 s [vector] +++ OK, passed 100 tests.
  9155. 648.86 s [vector] elem: OK
  9156. 648.86 s [vector] +++ OK, passed 100 tests.
  9157. 648.86 s [vector] notElem: OK
  9158. 648.86 s [vector] +++ OK, passed 100 tests.
  9159. 648.86 s [vector] find: OK
  9160. 648.86 s [vector] +++ OK, passed 100 tests.
  9161. 648.86 s [vector] findIndex: OK
  9162. 648.86 s [vector] +++ OK, passed 100 tests.
  9163. 648.86 s [vector] findIndexR: OK
  9164. 648.87 s [vector] +++ OK, passed 100 tests.
  9165. 648.87 s [vector] findIndices: OK
  9166. 648.87 s [vector] +++ OK, passed 100 tests.
  9167. 648.87 s [vector] elemIndex: OK
  9168. 648.87 s [vector] +++ OK, passed 100 tests.
  9169. 648.87 s [vector] elemIndices: OK
  9170. 648.87 s [vector] +++ OK, passed 100 tests.
  9171. 648.87 s [vector] foldl: OK
  9172. 648.87 s [vector] +++ OK, passed 100 tests.
  9173. 648.87 s [vector] foldl1: OK
  9174. 648.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9175. 648.88 s [vector] foldl': OK
  9176. 648.88 s [vector] +++ OK, passed 100 tests.
  9177. 648.88 s [vector] foldl1': OK
  9178. 648.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9179. 648.88 s [vector] foldr: OK
  9180. 648.88 s [vector] +++ OK, passed 100 tests.
  9181. 648.89 s [vector] foldr1: OK
  9182. 648.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9183. 648.89 s [vector] foldr': OK
  9184. 648.89 s [vector] +++ OK, passed 100 tests.
  9185. 648.89 s [vector] foldr1': OK
  9186. 648.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9187. 648.89 s [vector] ifoldl: OK
  9188. 648.89 s [vector] +++ OK, passed 100 tests.
  9189. 648.90 s [vector] ifoldl': OK
  9190. 648.90 s [vector] +++ OK, passed 100 tests.
  9191. 648.90 s [vector] ifoldr: OK
  9192. 648.90 s [vector] +++ OK, passed 100 tests.
  9193. 648.90 s [vector] ifoldr': OK
  9194. 648.90 s [vector] +++ OK, passed 100 tests.
  9195. 648.90 s [vector] ifoldM: OK
  9196. 648.90 s [vector] +++ OK, passed 100 tests.
  9197. 648.90 s [vector] ifoldM': OK
  9198. 648.91 s [vector] +++ OK, passed 100 tests.
  9199. 648.93 s [vector] ifoldM_: OK (0.02s)
  9200. 648.93 s [vector] +++ OK, passed 100 tests.
  9201. 648.94 s [vector] ifoldM'_: OK (0.02s)
  9202. 648.94 s [vector] +++ OK, passed 100 tests.
  9203. 648.94 s [vector] all: OK
  9204. 648.94 s [vector] +++ OK, passed 100 tests.
  9205. 648.94 s [vector] any: OK
  9206. 648.94 s [vector] +++ OK, passed 100 tests.
  9207. 648.94 s [vector] prescanl: OK
  9208. 648.94 s [vector] +++ OK, passed 100 tests.
  9209. 648.94 s [vector] prescanl': OK
  9210. 648.95 s [vector] +++ OK, passed 100 tests.
  9211. 648.95 s [vector] postscanl: OK
  9212. 648.95 s [vector] +++ OK, passed 100 tests.
  9213. 648.95 s [vector] postscanl': OK
  9214. 648.95 s [vector] +++ OK, passed 100 tests.
  9215. 648.95 s [vector] scanl: OK
  9216. 648.95 s [vector] +++ OK, passed 100 tests.
  9217. 648.95 s [vector] scanl': OK
  9218. 648.95 s [vector] +++ OK, passed 100 tests.
  9219. 648.96 s [vector] scanl1: OK
  9220. 648.96 s [vector] +++ OK, passed 100 tests.
  9221. 648.96 s [vector] scanl1': OK
  9222. 648.96 s [vector] +++ OK, passed 100 tests.
  9223. 648.96 s [vector] iscanl: OK
  9224. 648.96 s [vector] +++ OK, passed 100 tests.
  9225. 648.97 s [vector] iscanl': OK
  9226. 648.97 s [vector] +++ OK, passed 100 tests.
  9227. 648.97 s [vector] prescanr: OK
  9228. 648.97 s [vector] +++ OK, passed 100 tests.
  9229. 648.97 s [vector] prescanr': OK
  9230. 648.97 s [vector] +++ OK, passed 100 tests.
  9231. 648.98 s [vector] postscanr: OK
  9232. 648.98 s [vector] +++ OK, passed 100 tests.
  9233. 648.98 s [vector] postscanr': OK
  9234. 648.98 s [vector] +++ OK, passed 100 tests.
  9235. 648.98 s [vector] scanr: OK
  9236. 648.98 s [vector] +++ OK, passed 100 tests.
  9237. 648.99 s [vector] scanr': OK
  9238. 648.99 s [vector] +++ OK, passed 100 tests.
  9239. 648.99 s [vector] scanr1: OK
  9240. 648.99 s [vector] +++ OK, passed 100 tests.
  9241. 648.99 s [vector] scanr1': OK
  9242. 648.99 s [vector] +++ OK, passed 100 tests.
  9243. 649.00 s [vector] iscanr: OK
  9244. 649.00 s [vector] +++ OK, passed 100 tests.
  9245. 649.00 s [vector] iscanr': OK
  9246. 649.00 s [vector] +++ OK, passed 100 tests.
  9247. 649.00 s [vector] mut_read: OK
  9248. 649.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9249. 649.00 s [vector] mut_write: OK
  9250. 649.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9251. 649.01 s [vector] mut_modify: OK
  9252. 649.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9253. 649.01 s [vector] mut_generate: OK
  9254. 649.01 s [vector] +++ OK, passed 100 tests.
  9255. 649.03 s [vector] mut_generateM: OK (0.01s)
  9256. 649.03 s [vector] +++ OK, passed 100 tests.
  9257. 649.05 s [vector] mut_mapM_: OK (0.02s)
  9258. 649.05 s [vector] +++ OK, passed 100 tests.
  9259. 649.07 s [vector] mut_imapM_: OK (0.02s)
  9260. 649.09 s [vector] +++ OK, passed 100 tests.
  9261. 649.09 s [vector] mut_forM_: OK (0.02s)
  9262. 649.09 s [vector] +++ OK, passed 100 tests.
  9263. 649.09 s [vector] mut_iforM_: OK (0.02s)
  9264. 649.09 s [vector] +++ OK, passed 100 tests.
  9265. 649.09 s [vector] mut_foldr: OK
  9266. 649.09 s [vector] +++ OK, passed 100 tests.
  9267. 649.10 s [vector] mut_foldr': OK
  9268. 649.10 s [vector] +++ OK, passed 100 tests.
  9269. 649.10 s [vector] mut_foldl: OK
  9270. 649.10 s [vector] +++ OK, passed 100 tests.
  9271. 649.10 s [vector] mut_foldl': OK
  9272. 649.10 s [vector] +++ OK, passed 100 tests.
  9273. 649.10 s [vector] mut_ifoldr: OK
  9274. 649.11 s [vector] +++ OK, passed 100 tests.
  9275. 649.11 s [vector] mut_ifoldr': OK
  9276. 649.11 s [vector] +++ OK, passed 100 tests.
  9277. 649.11 s [vector] mut_ifoldl: OK
  9278. 649.11 s [vector] +++ OK, passed 100 tests.
  9279. 649.11 s [vector] mut_ifoldl': OK
  9280. 649.11 s [vector] +++ OK, passed 100 tests.
  9281. 649.12 s [vector] mut_foldM: OK
  9282. 649.12 s [vector] +++ OK, passed 100 tests.
  9283. 649.12 s [vector] mut_foldM': OK
  9284. 649.12 s [vector] +++ OK, passed 100 tests.
  9285. 649.13 s [vector] mut_foldrM: OK
  9286. 649.13 s [vector] +++ OK, passed 100 tests.
  9287. 649.13 s [vector] mut_foldrM': OK
  9288. 649.13 s [vector] +++ OK, passed 100 tests.
  9289. 649.13 s [vector] mut_ifoldM: OK
  9290. 649.13 s [vector] +++ OK, passed 100 tests.
  9291. 649.14 s [vector] mut_ifoldM': OK
  9292. 649.14 s [vector] +++ OK, passed 100 tests.
  9293. 649.14 s [vector] mut_ifoldrM: OK
  9294. 649.14 s [vector] +++ OK, passed 100 tests.
  9295. 649.14 s [vector] mut_ifoldrM': OK
  9296. 649.15 s [vector] +++ OK, passed 100 tests.
  9297. 649.15 s [vector] compare: OK
  9298. 649.15 s [vector] +++ OK, passed 100 tests.
  9299. 649.15 s [vector] maximum: OK
  9300. 649.15 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9301. 649.15 s [vector] minimum: OK
  9302. 649.15 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9303. 649.15 s [vector] minIndex: OK
  9304. 649.15 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9305. 649.15 s [vector] maxIndex: OK
  9306. 649.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9307. 649.15 s [vector] maximumBy: OK
  9308. 649.15 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9309. 649.15 s [vector] minimumBy: OK
  9310. 649.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9311. 649.15 s [vector] maximumOn: OK
  9312. 649.15 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9313. 649.15 s [vector] minimumOn: OK
  9314. 649.15 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9315. 649.15 s [vector] maxIndexBy: OK
  9316. 649.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9317. 649.15 s [vector] minIndexBy: OK
  9318. 649.15 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9319. 649.15 s [vector] ListFirstMaxIndexWins: OK
  9320. 649.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9321. 649.15 s [vector] FalseListFirstMaxIndexWins: OK
  9322. 649.15 s [vector] +++ OK, failed as expected. (after 1 test):
  9323. 649.15 s [vector] Exception:
  9324. 649.15 s [vector] Prelude.foldr1: empty list
  9325. 649.15 s [vector] CallStack (from HasCallStack):
  9326. 649.15 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9327. 649.15 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9328. 649.15 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9329. 649.15 s [vector] []
  9330. 649.15 s [vector] mempty: OK
  9331. 649.15 s [vector] +++ OK, passed 100 tests.
  9332. 649.17 s [vector] mappend: OK
  9333. 649.17 s [vector] +++ OK, passed 100 tests.
  9334. 649.17 s [vector] mconcat: OK (0.02s)
  9335. 649.17 s [vector] +++ OK, passed 100 tests.
  9336. 649.17 s [vector] glength: OK
  9337. 649.17 s [vector] +++ OK, passed 100 tests.
  9338. 649.18 s [vector] sum: OK
  9339. 649.18 s [vector] +++ OK, passed 100 tests.
  9340. 649.18 s [vector] product: OK
  9341. 649.18 s [vector] +++ OK, passed 100 tests.
  9342. 649.18 s [vector] enumFromN: OK
  9343. 649.18 s [vector] +++ OK, passed 100 tests.
  9344. 649.18 s [vector] enumFromThenN: OK
  9345. 649.18 s [vector] +++ OK, passed 100 tests.
  9346. 649.18 s [vector] enumFromTo: OK
  9347. 649.18 s [vector] +++ OK, passed 100 tests.
  9348. 649.18 s [vector] enumFromThenTo: OK
  9349. 649.18 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9350. 649.18 s [vector] Double
  9351. 649.18 s [vector] fromList.toList == id: OK
  9352. 649.18 s [vector] +++ OK, passed 100 tests.
  9353. 649.18 s [vector] toList.fromList == id: OK
  9354. 649.18 s [vector] +++ OK, passed 100 tests.
  9355. 649.18 s [vector] unstream.stream == id: OK
  9356. 649.18 s [vector] +++ OK, passed 100 tests.
  9357. 649.18 s [vector] stream.unstream == id: OK
  9358. 649.18 s [vector] +++ OK, passed 100 tests.
  9359. 649.18 s [vector] eq: OK
  9360. 649.19 s [vector] +++ OK, passed 100 tests.
  9361. 649.19 s [vector] length: OK
  9362. 649.19 s [vector] +++ OK, passed 100 tests.
  9363. 649.19 s [vector] null: OK
  9364. 649.19 s [vector] +++ OK, passed 100 tests.
  9365. 649.19 s [vector] index: OK
  9366. 649.19 s [vector] +++ OK, passed 100 tests; 30 discarded.
  9367. 649.19 s [vector] safeIndex: OK
  9368. 649.19 s [vector] +++ OK, passed 100 tests.
  9369. 649.19 s [vector] head: OK
  9370. 649.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9371. 649.19 s [vector] last: OK
  9372. 649.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9373. 649.19 s [vector] unsafeIndex: OK
  9374. 649.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9375. 649.19 s [vector] unsafeHead: OK
  9376. 649.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9377. 649.20 s [vector] unsafeLast: OK
  9378. 649.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9379. 649.20 s [vector] slice: OK
  9380. 649.20 s [vector] +++ OK, passed 100 tests.
  9381. 649.20 s [vector] init: OK
  9382. 649.20 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9383. 649.20 s [vector] tail: OK
  9384. 649.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9385. 649.20 s [vector] take: OK
  9386. 649.20 s [vector] +++ OK, passed 100 tests.
  9387. 649.20 s [vector] drop: OK
  9388. 649.20 s [vector] +++ OK, passed 100 tests.
  9389. 649.20 s [vector] splitAt: OK
  9390. 649.20 s [vector] +++ OK, passed 100 tests.
  9391. 649.20 s [vector] empty: OK
  9392. 649.20 s [vector] +++ OK, passed 100 tests.
  9393. 649.20 s [vector] singleton: OK
  9394. 649.20 s [vector] +++ OK, passed 100 tests.
  9395. 649.21 s [vector] replicate: OK
  9396. 649.21 s [vector] +++ OK, passed 100 tests.
  9397. 649.21 s [vector] generate: OK
  9398. 649.21 s [vector] +++ OK, passed 100 tests.
  9399. 649.21 s [vector] iterateN: OK
  9400. 649.21 s [vector] +++ OK, passed 100 tests.
  9401. 649.23 s [vector] iterateNM: OK (0.02s)
  9402. 649.23 s [vector] +++ OK, passed 100 tests.
  9403. 649.27 s [vector] generateM: OK (0.04s)
  9404. 649.27 s [vector] +++ OK, passed 100 tests.
  9405. 649.28 s [vector] replicateM: OK (0.02s)
  9406. 649.28 s [vector] +++ OK, passed 100 tests.
  9407. 649.28 s [vector] create: OK
  9408. 649.29 s [vector] +++ OK, passed 100 tests.
  9409. 649.29 s [vector] createT: OK
  9410. 649.29 s [vector] +++ OK, passed 100 tests.
  9411. 649.29 s [vector] unfoldr: OK
  9412. 649.29 s [vector] +++ OK, passed 100 tests.
  9413. 649.29 s [vector] unfoldrN: OK
  9414. 649.29 s [vector] +++ OK, passed 100 tests.
  9415. 649.29 s [vector] unfoldrExactN: OK
  9416. 649.29 s [vector] +++ OK, passed 100 tests.
  9417. 649.29 s [vector] unfoldrM: OK
  9418. 649.29 s [vector] +++ OK, passed 100 tests.
  9419. 649.29 s [vector] unfoldrNM: OK
  9420. 649.29 s [vector] +++ OK, passed 100 tests.
  9421. 649.31 s [vector] unfoldrExactNM: OK (0.02s)
  9422. 649.31 s [vector] +++ OK, passed 100 tests.
  9423. 649.33 s [vector] constructN: OK (0.02s)
  9424. 649.33 s [vector] +++ OK, passed 100 tests.
  9425. 649.35 s [vector] constructrN: OK (0.02s)
  9426. 649.35 s [vector] +++ OK, passed 100 tests.
  9427. 649.35 s [vector] cons: OK
  9428. 649.35 s [vector] +++ OK, passed 100 tests.
  9429. 649.35 s [vector] snoc: OK
  9430. 649.35 s [vector] +++ OK, passed 100 tests.
  9431. 649.35 s [vector] append: OK
  9432. 649.37 s [vector] +++ OK, passed 100 tests.
  9433. 649.38 s [vector] concat: OK (0.03s)
  9434. 649.38 s [vector] +++ OK, passed 100 tests.
  9435. 649.39 s [vector] force: OK
  9436. 649.39 s [vector] +++ OK, passed 100 tests.
  9437. 649.39 s [vector] upd: OK
  9438. 649.39 s [vector] +++ OK, passed 100 tests.
  9439. 649.41 s [vector] accum: OK (0.02s)
  9440. 649.41 s [vector] +++ OK, passed 100 tests.
  9441. 649.42 s [vector] reverse: OK
  9442. 649.42 s [vector] +++ OK, passed 100 tests.
  9443. 649.42 s [vector] backpermute: OK
  9444. 649.43 s [vector] +++ OK, passed 100 tests.
  9445. 649.45 s [vector] map: OK (0.03s)
  9446. 649.45 s [vector] +++ OK, passed 100 tests.
  9447. 649.47 s [vector] imap: OK (0.02s)
  9448. 649.47 s [vector] +++ OK, passed 100 tests.
  9449. 649.49 s [vector] concatMap: OK (0.02s)
  9450. 649.49 s [vector] +++ OK, passed 100 tests.
  9451. 649.51 s [vector] mapM: OK (0.02s)
  9452. 649.51 s [vector] +++ OK, passed 100 tests.
  9453. 649.55 s [vector] mapM_: OK (0.05s)
  9454. 649.55 s [vector] +++ OK, passed 100 tests.
  9455. 649.57 s [vector] forM: OK (0.01s)
  9456. 649.57 s [vector] +++ OK, passed 100 tests.
  9457. 649.63 s [vector] forM_: OK (0.06s)
  9458. 649.63 s [vector] +++ OK, passed 100 tests.
  9459. 649.66 s [vector] imapM: OK (0.01s)
  9460. 649.66 s [vector] +++ OK, passed 100 tests.
  9461. 649.69 s [vector] imapM_: OK (0.05s)
  9462. 649.69 s [vector] +++ OK, passed 100 tests.
  9463. 649.71 s [vector] zipWith: OK (0.01s)
  9464. 649.71 s [vector] +++ OK, passed 100 tests.
  9465. 649.71 s [vector] zipWith3: OK (0.01s)
  9466. 649.71 s [vector] +++ OK, passed 100 tests.
  9467. 649.73 s [vector] izipWith: OK (0.01s)
  9468. 649.73 s [vector] +++ OK, passed 100 tests.
  9469. 649.75 s [vector] izipWith3: OK (0.02s)
  9470. 649.75 s [vector] +++ OK, passed 100 tests.
  9471. 649.77 s [vector] izipWithM: OK (0.02s)
  9472. 649.77 s [vector] +++ OK, passed 100 tests.
  9473. 649.81 s [vector] izipWithM_: OK (0.06s)
  9474. 649.81 s [vector] +++ OK, passed 100 tests.
  9475. 649.84 s [vector] zipWithM: OK (0.01s)
  9476. 649.84 s [vector] +++ OK, passed 100 tests.
  9477. 649.87 s [vector] zipWithM_: OK (0.04s)
  9478. 649.87 s [vector] +++ OK, passed 100 tests.
  9479. 649.87 s [vector] filter: OK
  9480. 649.87 s [vector] +++ OK, passed 100 tests.
  9481. 649.88 s [vector] ifilter: OK
  9482. 649.89 s [vector] +++ OK, passed 100 tests.
  9483. 649.95 s [vector] filterM: OK (0.07s)
  9484. 649.95 s [vector] +++ OK, passed 100 tests.
  9485. 649.95 s [vector] uniq: OK
  9486. 649.95 s [vector] +++ OK, passed 100 tests.
  9487. 649.96 s [vector] mapMaybe: OK
  9488. 649.97 s [vector] +++ OK, passed 100 tests.
  9489. 649.97 s [vector] imapMaybe: OK
  9490. 649.97 s [vector] +++ OK, passed 100 tests.
  9491. 649.97 s [vector] takeWhile: OK
  9492. 649.97 s [vector] +++ OK, passed 100 tests.
  9493. 649.97 s [vector] dropWhile: OK
  9494. 649.97 s [vector] +++ OK, passed 100 tests.
  9495. 649.97 s [vector] partition: OK
  9496. 649.97 s [vector] +++ OK, passed 100 tests.
  9497. 649.98 s [vector] partitionWith: OK
  9498. 649.99 s [vector] +++ OK, passed 100 tests.
  9499. 649.99 s [vector] span: OK
  9500. 649.99 s [vector] +++ OK, passed 100 tests.
  9501. 649.99 s [vector] break: OK
  9502. 649.99 s [vector] +++ OK, passed 100 tests.
  9503. 649.99 s [vector] spanR: OK
  9504. 649.99 s [vector] +++ OK, passed 100 tests.
  9505. 650.00 s [vector] breakR: OK
  9506. 650.00 s [vector] +++ OK, passed 100 tests.
  9507. 650.00 s [vector] groupBy: OK (0.01s)
  9508. 650.01 s [vector] +++ OK, passed 100 tests.
  9509. 650.01 s [vector] elem: OK
  9510. 650.01 s [vector] +++ OK, passed 100 tests.
  9511. 650.01 s [vector] notElem: OK
  9512. 650.01 s [vector] +++ OK, passed 100 tests.
  9513. 650.01 s [vector] find: OK
  9514. 650.01 s [vector] +++ OK, passed 100 tests.
  9515. 650.01 s [vector] findIndex: OK
  9516. 650.01 s [vector] +++ OK, passed 100 tests.
  9517. 650.01 s [vector] findIndexR: OK
  9518. 650.02 s [vector] +++ OK, passed 100 tests.
  9519. 650.03 s [vector] findIndices: OK
  9520. 650.03 s [vector] +++ OK, passed 100 tests.
  9521. 650.03 s [vector] elemIndex: OK
  9522. 650.03 s [vector] +++ OK, passed 100 tests.
  9523. 650.03 s [vector] elemIndices: OK
  9524. 650.04 s [vector] +++ OK, passed 100 tests.
  9525. 650.04 s [vector] foldl: OK (0.01s)
  9526. 650.04 s [vector] +++ OK, passed 100 tests.
  9527. 650.06 s [vector] foldl1: OK (0.01s)
  9528. 650.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9529. 650.07 s [vector] foldl': OK (0.01s)
  9530. 650.07 s [vector] +++ OK, passed 100 tests.
  9531. 650.08 s [vector] foldl1': OK (0.01s)
  9532. 650.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9533. 650.09 s [vector] foldr: OK (0.01s)
  9534. 650.09 s [vector] +++ OK, passed 100 tests.
  9535. 650.09 s [vector] foldr1: OK (0.01s)
  9536. 650.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9537. 650.11 s [vector] foldr': OK (0.01s)
  9538. 650.11 s [vector] +++ OK, passed 100 tests.
  9539. 650.12 s [vector] foldr1': OK
  9540. 650.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9541. 650.16 s [vector] ifoldl: OK (0.01s)
  9542. 650.16 s [vector] +++ OK, passed 100 tests.
  9543. 650.16 s [vector] ifoldl': OK (0.02s)
  9544. 650.16 s [vector] +++ OK, passed 100 tests.
  9545. 650.18 s [vector] ifoldr: OK (0.02s)
  9546. 650.18 s [vector] +++ OK, passed 100 tests.
  9547. 650.20 s [vector] ifoldr': OK (0.02s)
  9548. 650.20 s [vector] +++ OK, passed 100 tests.
  9549. 650.20 s [vector] ifoldM: OK (0.02s)
  9550. 650.20 s [vector] +++ OK, passed 100 tests.
  9551. 650.24 s [vector] ifoldM': OK
  9552. 650.24 s [vector] +++ OK, passed 100 tests.
  9553. 650.28 s [vector] ifoldM_: OK (0.05s)
  9554. 650.28 s [vector] +++ OK, passed 100 tests.
  9555. 650.31 s [vector] ifoldM'_: OK (0.04s)
  9556. 650.31 s [vector] +++ OK, passed 100 tests.
  9557. 650.31 s [vector] all: OK
  9558. 650.31 s [vector] +++ OK, passed 100 tests.
  9559. 650.31 s [vector] any: OK
  9560. 650.31 s [vector] +++ OK, passed 100 tests.
  9561. 650.33 s [vector] prescanl: OK (0.01s)
  9562. 650.33 s [vector] +++ OK, passed 100 tests.
  9563. 650.35 s [vector] prescanl': OK (0.02s)
  9564. 650.35 s [vector] +++ OK, passed 100 tests.
  9565. 650.35 s [vector] postscanl: OK (0.01s)
  9566. 650.35 s [vector] +++ OK, passed 100 tests.
  9567. 650.37 s [vector] postscanl': OK (0.02s)
  9568. 650.37 s [vector] +++ OK, passed 100 tests.
  9569. 650.39 s [vector] scanl: OK (0.02s)
  9570. 650.39 s [vector] +++ OK, passed 100 tests.
  9571. 650.41 s [vector] scanl': OK (0.02s)
  9572. 650.41 s [vector] +++ OK, passed 100 tests.
  9573. 650.43 s [vector] scanl1: OK (0.02s)
  9574. 650.43 s [vector] +++ OK, passed 100 tests.
  9575. 650.45 s [vector] scanl1': OK (0.01s)
  9576. 650.45 s [vector] +++ OK, passed 100 tests.
  9577. 650.47 s [vector] iscanl: OK (0.02s)
  9578. 650.47 s [vector] +++ OK, passed 100 tests.
  9579. 650.49 s [vector] iscanl': OK (0.02s)
  9580. 650.49 s [vector] +++ OK, passed 100 tests.
  9581. 650.51 s [vector] prescanr: OK (0.02s)
  9582. 650.51 s [vector] +++ OK, passed 100 tests.
  9583. 650.53 s [vector] prescanr': OK (0.03s)
  9584. 650.53 s [vector] +++ OK, passed 100 tests.
  9585. 650.57 s [vector] postscanr: OK (0.03s)
  9586. 650.57 s [vector] +++ OK, passed 100 tests.
  9587. 650.60 s [vector] postscanr': OK (0.03s)
  9588. 650.60 s [vector] +++ OK, passed 100 tests.
  9589. 650.61 s [vector] scanr: OK (0.02s)
  9590. 650.61 s [vector] +++ OK, passed 100 tests.
  9591. 650.63 s [vector] scanr': OK (0.02s)
  9592. 650.63 s [vector] +++ OK, passed 100 tests.
  9593. 650.65 s [vector] scanr1: OK (0.02s)
  9594. 650.65 s [vector] +++ OK, passed 100 tests.
  9595. 650.67 s [vector] scanr1': OK (0.02s)
  9596. 650.68 s [vector] +++ OK, passed 100 tests.
  9597. 650.69 s [vector] iscanr: OK (0.02s)
  9598. 650.69 s [vector] +++ OK, passed 100 tests.
  9599. 650.70 s [vector] iscanr': OK (0.02s)
  9600. 650.70 s [vector] +++ OK, passed 100 tests.
  9601. 650.71 s [vector] mut_read: OK
  9602. 650.71 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9603. 650.71 s [vector] mut_write: OK
  9604. 650.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9605. 650.71 s [vector] mut_modify: OK
  9606. 650.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9607. 650.71 s [vector] mut_generate: OK
  9608. 650.71 s [vector] +++ OK, passed 100 tests.
  9609. 650.73 s [vector] mut_generateM: OK (0.02s)
  9610. 650.73 s [vector] +++ OK, passed 100 tests.
  9611. 650.77 s [vector] mut_mapM_: OK (0.04s)
  9612. 650.77 s [vector] +++ OK, passed 100 tests.
  9613. 650.81 s [vector] mut_imapM_: OK (0.04s)
  9614. 650.82 s [vector] +++ OK, passed 100 tests.
  9615. 650.85 s [vector] mut_forM_: OK (0.04s)
  9616. 650.85 s [vector] +++ OK, passed 100 tests.
  9617. 650.89 s [vector] mut_iforM_: OK (0.03s)
  9618. 650.89 s [vector] +++ OK, passed 100 tests.
  9619. 650.89 s [vector] mut_foldr: OK (0.01s)
  9620. 650.89 s [vector] +++ OK, passed 100 tests.
  9621. 650.91 s [vector] mut_foldr': OK (0.02s)
  9622. 650.91 s [vector] +++ OK, passed 100 tests.
  9623. 650.93 s [vector] mut_foldl: OK (0.01s)
  9624. 650.93 s [vector] +++ OK, passed 100 tests.
  9625. 650.94 s [vector] mut_foldl': OK (0.02s)
  9626. 650.94 s [vector] +++ OK, passed 100 tests.
  9627. 650.95 s [vector] mut_ifoldr: OK
  9628. 650.95 s [vector] +++ OK, passed 100 tests.
  9629. 650.97 s [vector] mut_ifoldr': OK (0.01s)
  9630. 650.97 s [vector] +++ OK, passed 100 tests.
  9631. 651.00 s [vector] mut_ifoldl: OK (0.02s)
  9632. 651.00 s [vector] +++ OK, passed 100 tests.
  9633. 651.01 s [vector] mut_ifoldl': OK (0.02s)
  9634. 651.01 s [vector] +++ OK, passed 100 tests.
  9635. 651.02 s [vector] mut_foldM: OK (0.02s)
  9636. 651.02 s [vector] +++ OK, passed 100 tests.
  9637. 651.03 s [vector] mut_foldM': OK
  9638. 651.07 s [vector] +++ OK, passed 100 tests.
  9639. 651.07 s [vector] mut_foldrM: OK (0.02s)
  9640. 651.07 s [vector] +++ OK, passed 100 tests.
  9641. 651.07 s [vector] mut_foldrM': OK (0.02s)
  9642. 651.07 s [vector] +++ OK, passed 100 tests.
  9643. 651.09 s [vector] mut_ifoldM: OK (0.02s)
  9644. 651.09 s [vector] +++ OK, passed 100 tests.
  9645. 651.11 s [vector] mut_ifoldM': OK (0.02s)
  9646. 651.11 s [vector] +++ OK, passed 100 tests.
  9647. 651.15 s [vector] mut_ifoldrM: OK (0.03s)
  9648. 651.15 s [vector] +++ OK, passed 100 tests.
  9649. 651.16 s [vector] mut_ifoldrM': OK (0.02s)
  9650. 651.16 s [vector] +++ OK, passed 100 tests.
  9651. 651.16 s [vector] compare: OK
  9652. 651.16 s [vector] +++ OK, passed 100 tests.
  9653. 651.16 s [vector] maximum: OK
  9654. 651.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9655. 651.17 s [vector] minimum: OK
  9656. 651.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9657. 651.17 s [vector] minIndex: OK
  9658. 651.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9659. 651.17 s [vector] maxIndex: OK
  9660. 651.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9661. 651.17 s [vector] maximumBy: OK
  9662. 651.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9663. 651.18 s [vector] minimumBy: OK
  9664. 651.18 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9665. 651.18 s [vector] maximumOn: OK
  9666. 651.18 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9667. 651.18 s [vector] minimumOn: OK
  9668. 651.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9669. 651.18 s [vector] maxIndexBy: OK
  9670. 651.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9671. 651.19 s [vector] minIndexBy: OK
  9672. 651.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9673. 651.19 s [vector] ListFirstMaxIndexWins: OK
  9674. 651.19 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9675. 651.19 s [vector] FalseListFirstMaxIndexWins: OK
  9676. 651.19 s [vector] +++ OK, failed as expected. (after 1 test):
  9677. 651.19 s [vector] Exception:
  9678. 651.19 s [vector] Prelude.foldr1: empty list
  9679. 651.19 s [vector] CallStack (from HasCallStack):
  9680. 651.19 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9681. 651.19 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9682. 651.19 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9683. 651.19 s [vector] []
  9684. 651.19 s [vector] mempty: OK
  9685. 651.19 s [vector] +++ OK, passed 100 tests.
  9686. 651.19 s [vector] mappend: OK
  9687. 651.19 s [vector] +++ OK, passed 100 tests.
  9688. 651.22 s [vector] mconcat: OK (0.03s)
  9689. 651.22 s [vector] +++ OK, passed 100 tests.
  9690. 651.22 s [vector] glength: OK
  9691. 651.23 s [vector] +++ OK, passed 100 tests.
  9692. 651.23 s [vector] sum: OK
  9693. 651.23 s [vector] +++ OK, passed 100 tests.
  9694. 651.23 s [vector] product: OK
  9695. 651.23 s [vector] +++ OK, passed 100 tests.
  9696. 651.23 s [vector] enumFromN: OK
  9697. 651.23 s [vector] +++ OK, passed 100 tests.
  9698. 651.23 s [vector] enumFromThenN: OK
  9699. 651.23 s [vector] +++ OK, passed 100 tests.
  9700. 651.23 s [vector] enumFromTo: OK
  9701. 651.23 s [vector] +++ OK, passed 100 tests.
  9702. 651.23 s [vector] enumFromThenTo: OK
  9703. 651.24 s [vector] +++ OK, passed 100 tests; 3 discarded.
  9704. 651.24 s [vector] unstream
  9705. 651.24 s [vector] unstream == vunstream (exact): OK
  9706. 651.24 s [vector] +++ OK, passed 100 tests.
  9707. 651.24 s [vector] unstream == vunstream (unknown): OK
  9708. 651.24 s [vector] +++ OK, passed 100 tests.
  9709. 651.24 s [vector] unstreamR ~= vunstream (exact): OK
  9710. 651.24 s [vector] +++ OK, passed 100 tests.
  9711. 651.24 s [vector] unstreamR ~= vunstream (unknown): OK
  9712. 651.24 s [vector] +++ OK, passed 100 tests.
  9713. 651.24 s [vector] Tests.Vector.Storable
  9714. 651.24 s [vector] Data.Vector.Storable.Vector (Int)
  9715. 651.24 s [vector] fromList.toList == id: OK
  9716. 651.24 s [vector] +++ OK, passed 100 tests.
  9717. 651.24 s [vector] toList.fromList == id: OK
  9718. 651.24 s [vector] +++ OK, passed 100 tests.
  9719. 651.24 s [vector] unstream.stream == id: OK
  9720. 651.24 s [vector] +++ OK, passed 100 tests.
  9721. 651.24 s [vector] stream.unstream == id: OK
  9722. 651.24 s [vector] +++ OK, passed 100 tests.
  9723. 651.24 s [vector] eq: OK
  9724. 651.24 s [vector] +++ OK, passed 100 tests.
  9725. 651.24 s [vector] length: OK
  9726. 651.24 s [vector] +++ OK, passed 100 tests.
  9727. 651.24 s [vector] null: OK
  9728. 651.24 s [vector] +++ OK, passed 100 tests.
  9729. 651.24 s [vector] index: OK
  9730. 651.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9731. 651.24 s [vector] safeIndex: OK
  9732. 651.24 s [vector] +++ OK, passed 100 tests.
  9733. 651.25 s [vector] head: OK
  9734. 651.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9735. 651.25 s [vector] last: OK
  9736. 651.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9737. 651.25 s [vector] unsafeIndex: OK
  9738. 651.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9739. 651.25 s [vector] unsafeHead: OK
  9740. 651.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9741. 651.25 s [vector] unsafeLast: OK
  9742. 651.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9743. 651.25 s [vector] slice: OK
  9744. 651.25 s [vector] +++ OK, passed 100 tests.
  9745. 651.25 s [vector] init: OK
  9746. 651.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9747. 651.25 s [vector] tail: OK
  9748. 651.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9749. 651.25 s [vector] take: OK
  9750. 651.25 s [vector] +++ OK, passed 100 tests.
  9751. 651.25 s [vector] drop: OK
  9752. 651.25 s [vector] +++ OK, passed 100 tests.
  9753. 651.25 s [vector] splitAt: OK
  9754. 651.25 s [vector] +++ OK, passed 100 tests.
  9755. 651.25 s [vector] empty: OK
  9756. 651.25 s [vector] +++ OK, passed 100 tests.
  9757. 651.25 s [vector] singleton: OK
  9758. 651.25 s [vector] +++ OK, passed 100 tests.
  9759. 651.25 s [vector] replicate: OK
  9760. 651.25 s [vector] +++ OK, passed 100 tests.
  9761. 651.25 s [vector] generate: OK
  9762. 651.26 s [vector] +++ OK, passed 100 tests.
  9763. 651.26 s [vector] iterateN: OK
  9764. 651.26 s [vector] +++ OK, passed 100 tests.
  9765. 651.28 s [vector] iterateNM: OK (0.01s)
  9766. 651.28 s [vector] +++ OK, passed 100 tests.
  9767. 651.29 s [vector] generateM: OK (0.03s)
  9768. 651.29 s [vector] +++ OK, passed 100 tests.
  9769. 651.31 s [vector] replicateM: OK (0.01s)
  9770. 651.31 s [vector] +++ OK, passed 100 tests.
  9771. 651.31 s [vector] create: OK
  9772. 651.31 s [vector] +++ OK, passed 100 tests.
  9773. 651.31 s [vector] createT: OK
  9774. 651.31 s [vector] +++ OK, passed 100 tests.
  9775. 651.31 s [vector] unfoldr: OK
  9776. 651.31 s [vector] +++ OK, passed 100 tests.
  9777. 651.31 s [vector] unfoldrN: OK
  9778. 651.31 s [vector] +++ OK, passed 100 tests.
  9779. 651.31 s [vector] unfoldrExactN: OK
  9780. 651.31 s [vector] +++ OK, passed 100 tests.
  9781. 651.32 s [vector] unfoldrM: OK
  9782. 651.32 s [vector] +++ OK, passed 100 tests.
  9783. 651.32 s [vector] unfoldrNM: OK
  9784. 651.34 s [vector] +++ OK, passed 100 tests.
  9785. 651.54 s [vector] unfoldrExactNM: OK (0.04s)
  9786. 651.54 s [vector] +++ OK, passed 100 tests.
  9787. 651.54 s [vector] constructN: OK
  9788. 651.54 s [vector] +++ OK, passed 100 tests.
  9789. 651.54 s [vector] constructrN: OK
  9790. 651.54 s [vector] +++ OK, passed 100 tests.
  9791. 651.54 s [vector] cons: OK
  9792. 651.54 s [vector] +++ OK, passed 100 tests.
  9793. 651.54 s [vector] snoc: OK
  9794. 651.54 s [vector] +++ OK, passed 100 tests.
  9795. 651.54 s [vector] append: OK
  9796. 651.54 s [vector] +++ OK, passed 100 tests.
  9797. 651.54 s [vector] concat: OK (0.02s)
  9798. 651.54 s [vector] +++ OK, passed 100 tests.
  9799. 651.54 s [vector] force: OK
  9800. 651.54 s [vector] +++ OK, passed 100 tests.
  9801. 651.55 s [vector] upd: OK
  9802. 651.55 s [vector] +++ OK, passed 100 tests.
  9803. 651.55 s [vector] accum: OK
  9804. 651.55 s [vector] +++ OK, passed 100 tests.
  9805. 651.55 s [vector] reverse: OK
  9806. 651.55 s [vector] +++ OK, passed 100 tests.
  9807. 651.55 s [vector] backpermute: OK
  9808. 651.55 s [vector] +++ OK, passed 100 tests.
  9809. 651.55 s [vector] map: OK
  9810. 651.55 s [vector] +++ OK, passed 100 tests.
  9811. 651.55 s [vector] imap: OK
  9812. 651.55 s [vector] +++ OK, passed 100 tests.
  9813. 651.55 s [vector] concatMap: OK
  9814. 651.55 s [vector] +++ OK, passed 100 tests.
  9815. 651.55 s [vector] mapM: OK
  9816. 651.55 s [vector] +++ OK, passed 100 tests.
  9817. 651.55 s [vector] mapM_: OK (0.02s)
  9818. 651.55 s [vector] +++ OK, passed 100 tests.
  9819. 651.55 s [vector] forM: OK
  9820. 651.55 s [vector] +++ OK, passed 100 tests.
  9821. 651.55 s [vector] forM_: OK (0.06s)
  9822. 651.55 s [vector] +++ OK, passed 100 tests.
  9823. 651.55 s [vector] imapM: OK (0.01s)
  9824. 651.55 s [vector] +++ OK, passed 100 tests.
  9825. 651.59 s [vector] imapM_: OK (0.06s)
  9826. 651.59 s [vector] +++ OK, passed 100 tests.
  9827. 651.59 s [vector] zipWith: OK
  9828. 651.59 s [vector] +++ OK, passed 100 tests.
  9829. 651.60 s [vector] zipWith3: OK
  9830. 651.60 s [vector] +++ OK, passed 100 tests.
  9831. 651.60 s [vector] izipWith: OK
  9832. 651.61 s [vector] +++ OK, passed 100 tests.
  9833. 651.61 s [vector] izipWith3: OK
  9834. 651.61 s [vector] +++ OK, passed 100 tests.
  9835. 651.61 s [vector] izipWithM: OK
  9836. 651.62 s [vector] +++ OK, passed 100 tests.
  9837. 651.64 s [vector] izipWithM_: OK (0.02s)
  9838. 651.64 s [vector] +++ OK, passed 100 tests.
  9839. 651.64 s [vector] zipWithM: OK
  9840. 651.65 s [vector] +++ OK, passed 100 tests.
  9841. 651.66 s [vector] zipWithM_: OK (0.02s)
  9842. 651.66 s [vector] +++ OK, passed 100 tests.
  9843. 651.66 s [vector] filter: OK
  9844. 651.66 s [vector] +++ OK, passed 100 tests.
  9845. 651.66 s [vector] ifilter: OK
  9846. 651.68 s [vector] +++ OK, passed 100 tests.
  9847. 651.74 s [vector] filterM: OK (0.07s)
  9848. 651.74 s [vector] +++ OK, passed 100 tests.
  9849. 651.74 s [vector] uniq: OK
  9850. 651.74 s [vector] +++ OK, passed 100 tests.
  9851. 651.74 s [vector] mapMaybe: OK
  9852. 651.75 s [vector] +++ OK, passed 100 tests.
  9853. 651.75 s [vector] imapMaybe: OK
  9854. 651.75 s [vector] +++ OK, passed 100 tests.
  9855. 651.75 s [vector] takeWhile: OK
  9856. 651.75 s [vector] +++ OK, passed 100 tests.
  9857. 651.75 s [vector] dropWhile: OK
  9858. 651.75 s [vector] +++ OK, passed 100 tests.
  9859. 651.75 s [vector] partition: OK
  9860. 651.76 s [vector] +++ OK, passed 100 tests.
  9861. 651.76 s [vector] partitionWith: OK
  9862. 651.76 s [vector] +++ OK, passed 100 tests.
  9863. 651.76 s [vector] span: OK
  9864. 651.76 s [vector] +++ OK, passed 100 tests.
  9865. 651.76 s [vector] break: OK
  9866. 651.76 s [vector] +++ OK, passed 100 tests.
  9867. 651.77 s [vector] spanR: OK
  9868. 651.77 s [vector] +++ OK, passed 100 tests.
  9869. 651.77 s [vector] breakR: OK
  9870. 651.77 s [vector] +++ OK, passed 100 tests.
  9871. 651.77 s [vector] groupBy: OK
  9872. 651.77 s [vector] +++ OK, passed 100 tests.
  9873. 651.77 s [vector] elem: OK
  9874. 651.77 s [vector] +++ OK, passed 100 tests.
  9875. 651.77 s [vector] notElem: OK
  9876. 651.77 s [vector] +++ OK, passed 100 tests.
  9877. 651.77 s [vector] find: OK
  9878. 651.77 s [vector] +++ OK, passed 100 tests.
  9879. 651.77 s [vector] findIndex: OK
  9880. 651.77 s [vector] +++ OK, passed 100 tests.
  9881. 651.77 s [vector] findIndexR: OK
  9882. 651.77 s [vector] +++ OK, passed 100 tests.
  9883. 651.78 s [vector] findIndices: OK
  9884. 651.78 s [vector] +++ OK, passed 100 tests.
  9885. 651.78 s [vector] elemIndex: OK
  9886. 651.78 s [vector] +++ OK, passed 100 tests.
  9887. 651.78 s [vector] elemIndices: OK
  9888. 651.78 s [vector] +++ OK, passed 100 tests.
  9889. 651.79 s [vector] foldl: OK
  9890. 651.79 s [vector] +++ OK, passed 100 tests.
  9891. 651.79 s [vector] foldl1: OK
  9892. 651.79 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9893. 651.79 s [vector] foldl': OK
  9894. 651.79 s [vector] +++ OK, passed 100 tests.
  9895. 651.79 s [vector] foldl1': OK
  9896. 651.79 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9897. 651.79 s [vector] foldr: OK
  9898. 651.79 s [vector] +++ OK, passed 100 tests.
  9899. 651.79 s [vector] foldr1: OK
  9900. 651.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9901. 651.80 s [vector] foldr': OK
  9902. 651.80 s [vector] +++ OK, passed 100 tests.
  9903. 651.80 s [vector] foldr1': OK
  9904. 651.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9905. 651.81 s [vector] ifoldl: OK
  9906. 651.81 s [vector] +++ OK, passed 100 tests.
  9907. 651.81 s [vector] ifoldl': OK
  9908. 651.81 s [vector] +++ OK, passed 100 tests.
  9909. 651.81 s [vector] ifoldr: OK
  9910. 651.82 s [vector] +++ OK, passed 100 tests.
  9911. 651.82 s [vector] ifoldr': OK
  9912. 651.82 s [vector] +++ OK, passed 100 tests.
  9913. 651.83 s [vector] ifoldM: OK
  9914. 651.83 s [vector] +++ OK, passed 100 tests.
  9915. 651.84 s [vector] ifoldM': OK
  9916. 651.84 s [vector] +++ OK, passed 100 tests.
  9917. 651.86 s [vector] ifoldM_: OK (0.02s)
  9918. 651.86 s [vector] +++ OK, passed 100 tests.
  9919. 651.88 s [vector] ifoldM'_: OK (0.02s)
  9920. 651.88 s [vector] +++ OK, passed 100 tests.
  9921. 651.88 s [vector] all: OK
  9922. 651.88 s [vector] +++ OK, passed 100 tests.
  9923. 651.88 s [vector] any: OK
  9924. 651.88 s [vector] +++ OK, passed 100 tests.
  9925. 651.88 s [vector] prescanl: OK
  9926. 651.89 s [vector] +++ OK, passed 100 tests.
  9927. 651.89 s [vector] prescanl': OK
  9928. 651.89 s [vector] +++ OK, passed 100 tests.
  9929. 651.89 s [vector] postscanl: OK
  9930. 651.89 s [vector] +++ OK, passed 100 tests.
  9931. 651.90 s [vector] postscanl': OK
  9932. 651.90 s [vector] +++ OK, passed 100 tests.
  9933. 651.91 s [vector] scanl: OK
  9934. 651.91 s [vector] +++ OK, passed 100 tests.
  9935. 651.91 s [vector] scanl': OK
  9936. 651.91 s [vector] +++ OK, passed 100 tests.
  9937. 651.91 s [vector] scanl1: OK
  9938. 651.92 s [vector] +++ OK, passed 100 tests.
  9939. 651.92 s [vector] scanl1': OK
  9940. 651.92 s [vector] +++ OK, passed 100 tests.
  9941. 651.92 s [vector] iscanl: OK
  9942. 651.92 s [vector] +++ OK, passed 100 tests.
  9943. 651.93 s [vector] iscanl': OK
  9944. 651.93 s [vector] +++ OK, passed 100 tests.
  9945. 651.93 s [vector] prescanr: OK
  9946. 651.93 s [vector] +++ OK, passed 100 tests.
  9947. 651.93 s [vector] prescanr': OK
  9948. 651.93 s [vector] +++ OK, passed 100 tests.
  9949. 651.94 s [vector] postscanr: OK
  9950. 651.94 s [vector] +++ OK, passed 100 tests.
  9951. 651.94 s [vector] postscanr': OK
  9952. 651.94 s [vector] +++ OK, passed 100 tests.
  9953. 651.95 s [vector] scanr: OK
  9954. 651.95 s [vector] +++ OK, passed 100 tests.
  9955. 651.95 s [vector] scanr': OK
  9956. 651.95 s [vector] +++ OK, passed 100 tests.
  9957. 651.96 s [vector] scanr1: OK
  9958. 651.96 s [vector] +++ OK, passed 100 tests.
  9959. 651.97 s [vector] scanr1': OK
  9960. 651.97 s [vector] +++ OK, passed 100 tests.
  9961. 651.97 s [vector] iscanr: OK
  9962. 651.97 s [vector] +++ OK, passed 100 tests.
  9963. 651.97 s [vector] iscanr': OK
  9964. 651.97 s [vector] +++ OK, passed 100 tests.
  9965. 651.98 s [vector] mut_read: OK
  9966. 651.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9967. 651.98 s [vector] mut_write: OK
  9968. 651.98 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9969. 651.98 s [vector] mut_modify: OK
  9970. 651.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9971. 651.99 s [vector] mut_generate: OK
  9972. 651.99 s [vector] +++ OK, passed 100 tests.
  9973. 651.99 s [vector] mut_generateM: OK (0.01s)
  9974. 651.99 s [vector] +++ OK, passed 100 tests.
  9975. 652.04 s [vector] mut_mapM_: OK (0.02s)
  9976. 652.04 s [vector] +++ OK, passed 100 tests.
  9977. 652.05 s [vector] mut_imapM_: OK (0.03s)
  9978. 652.05 s [vector] +++ OK, passed 100 tests.
  9979. 652.07 s [vector] mut_forM_: OK (0.02s)
  9980. 652.07 s [vector] +++ OK, passed 100 tests.
  9981. 652.09 s [vector] mut_iforM_: OK (0.02s)
  9982. 652.09 s [vector] +++ OK, passed 100 tests.
  9983. 652.10 s [vector] mut_foldr: OK
  9984. 652.10 s [vector] +++ OK, passed 100 tests.
  9985. 652.10 s [vector] mut_foldr': OK
  9986. 652.10 s [vector] +++ OK, passed 100 tests.
  9987. 652.10 s [vector] mut_foldl: OK
  9988. 652.10 s [vector] +++ OK, passed 100 tests.
  9989. 652.10 s [vector] mut_foldl': OK
  9990. 652.10 s [vector] +++ OK, passed 100 tests.
  9991. 652.10 s [vector] mut_ifoldr: OK
  9992. 652.10 s [vector] +++ OK, passed 100 tests.
  9993. 652.11 s [vector] mut_ifoldr': OK
  9994. 652.11 s [vector] +++ OK, passed 100 tests.
  9995. 652.11 s [vector] mut_ifoldl: OK
  9996. 652.11 s [vector] +++ OK, passed 100 tests.
  9997. 652.12 s [vector] mut_ifoldl': OK
  9998. 652.12 s [vector] +++ OK, passed 100 tests.
  9999. 652.12 s [vector] mut_foldM: OK
  10000. 652.12 s [vector] +++ OK, passed 100 tests.
  10001. 652.12 s [vector] mut_foldM': OK
  10002. 652.12 s [vector] +++ OK, passed 100 tests.
  10003. 652.12 s [vector] mut_foldrM: OK
  10004. 652.13 s [vector] +++ OK, passed 100 tests.
  10005. 652.13 s [vector] mut_foldrM': OK
  10006. 652.13 s [vector] +++ OK, passed 100 tests.
  10007. 652.13 s [vector] mut_ifoldM: OK
  10008. 652.14 s [vector] +++ OK, passed 100 tests.
  10009. 652.14 s [vector] mut_ifoldM': OK
  10010. 652.14 s [vector] +++ OK, passed 100 tests.
  10011. 652.15 s [vector] mut_ifoldrM: OK
  10012. 652.15 s [vector] +++ OK, passed 100 tests.
  10013. 652.15 s [vector] mut_ifoldrM': OK
  10014. 652.15 s [vector] +++ OK, passed 100 tests.
  10015. 652.16 s [vector] compare: OK
  10016. 652.16 s [vector] +++ OK, passed 100 tests.
  10017. 652.16 s [vector] maximum: OK
  10018. 652.16 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10019. 652.17 s [vector] minimum: OK
  10020. 652.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10021. 652.18 s [vector] minIndex: OK
  10022. 652.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10023. 652.19 s [vector] maxIndex: OK (0.01s)
  10024. 652.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10025. 652.19 s [vector] maximumBy: OK
  10026. 652.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10027. 652.20 s [vector] minimumBy: OK
  10028. 652.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10029. 652.20 s [vector] maximumOn: OK
  10030. 652.21 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10031. 652.21 s [vector] minimumOn: OK
  10032. 652.21 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10033. 652.22 s [vector] maxIndexBy: OK
  10034. 652.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10035. 652.22 s [vector] minIndexBy: OK
  10036. 652.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10037. 652.22 s [vector] ListFirstMaxIndexWins: OK
  10038. 652.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10039. 652.22 s [vector] FalseListFirstMaxIndexWins: OK
  10040. 652.22 s [vector] +++ OK, failed as expected. (after 1 test):
  10041. 652.22 s [vector] Exception:
  10042. 652.22 s [vector] Prelude.foldr1: empty list
  10043. 652.22 s [vector] CallStack (from HasCallStack):
  10044. 652.22 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10045. 652.22 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10046. 652.22 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10047. 652.22 s [vector] []
  10048. 652.22 s [vector] mempty: OK
  10049. 652.22 s [vector] +++ OK, passed 100 tests.
  10050. 652.23 s [vector] mappend: OK
  10051. 652.23 s [vector] +++ OK, passed 100 tests.
  10052. 652.25 s [vector] mconcat: OK (0.03s)
  10053. 652.25 s [vector] +++ OK, passed 100 tests.
  10054. 652.25 s [vector] glength: OK
  10055. 652.25 s [vector] +++ OK, passed 100 tests.
  10056. 652.25 s [vector] sum: OK
  10057. 652.25 s [vector] +++ OK, passed 100 tests.
  10058. 652.25 s [vector] product: OK
  10059. 652.25 s [vector] +++ OK, passed 100 tests.
  10060. 652.25 s [vector] enumFromN: OK
  10061. 652.25 s [vector] +++ OK, passed 100 tests.
  10062. 652.25 s [vector] enumFromThenN: OK
  10063. 652.25 s [vector] +++ OK, passed 100 tests.
  10064. 652.25 s [vector] enumFromTo: OK
  10065. 652.26 s [vector] +++ OK, passed 100 tests.
  10066. 652.26 s [vector] enumFromThenTo: OK
  10067. 652.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10068. 652.26 s [vector] Data.Vector.Storable.Vector (Double)
  10069. 652.26 s [vector] fromList.toList == id: OK
  10070. 652.26 s [vector] +++ OK, passed 100 tests.
  10071. 652.26 s [vector] toList.fromList == id: OK
  10072. 652.26 s [vector] +++ OK, passed 100 tests.
  10073. 652.26 s [vector] unstream.stream == id: OK
  10074. 652.26 s [vector] +++ OK, passed 100 tests.
  10075. 652.26 s [vector] stream.unstream == id: OK
  10076. 652.26 s [vector] +++ OK, passed 100 tests.
  10077. 652.26 s [vector] eq: OK
  10078. 652.26 s [vector] +++ OK, passed 100 tests.
  10079. 652.26 s [vector] length: OK
  10080. 652.26 s [vector] +++ OK, passed 100 tests.
  10081. 652.26 s [vector] null: OK
  10082. 652.26 s [vector] +++ OK, passed 100 tests.
  10083. 652.26 s [vector] index: OK
  10084. 652.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10085. 652.27 s [vector] safeIndex: OK
  10086. 652.27 s [vector] +++ OK, passed 100 tests.
  10087. 652.27 s [vector] head: OK
  10088. 652.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10089. 652.27 s [vector] last: OK
  10090. 652.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10091. 652.27 s [vector] unsafeIndex: OK
  10092. 652.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10093. 652.27 s [vector] unsafeHead: OK
  10094. 652.27 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10095. 652.27 s [vector] unsafeLast: OK
  10096. 652.27 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10097. 652.27 s [vector] slice: OK
  10098. 652.27 s [vector] +++ OK, passed 100 tests.
  10099. 652.28 s [vector] init: OK
  10100. 652.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10101. 652.28 s [vector] tail: OK
  10102. 652.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10103. 652.28 s [vector] take: OK
  10104. 652.28 s [vector] +++ OK, passed 100 tests.
  10105. 652.28 s [vector] drop: OK
  10106. 652.28 s [vector] +++ OK, passed 100 tests.
  10107. 652.28 s [vector] splitAt: OK
  10108. 652.28 s [vector] +++ OK, passed 100 tests.
  10109. 652.28 s [vector] empty: OK
  10110. 652.28 s [vector] +++ OK, passed 100 tests.
  10111. 652.29 s [vector] singleton: OK
  10112. 652.29 s [vector] +++ OK, passed 100 tests.
  10113. 652.29 s [vector] replicate: OK
  10114. 652.29 s [vector] +++ OK, passed 100 tests.
  10115. 652.29 s [vector] generate: OK
  10116. 652.29 s [vector] +++ OK, passed 100 tests.
  10117. 652.29 s [vector] iterateN: OK
  10118. 652.29 s [vector] +++ OK, passed 100 tests.
  10119. 652.35 s [vector] iterateNM: OK (0.06s)
  10120. 652.36 s [vector] +++ OK, passed 100 tests.
  10121. 652.39 s [vector] generateM: OK (0.04s)
  10122. 652.39 s [vector] +++ OK, passed 100 tests.
  10123. 652.41 s [vector] replicateM: OK (0.02s)
  10124. 652.41 s [vector] +++ OK, passed 100 tests.
  10125. 652.41 s [vector] create: OK
  10126. 652.41 s [vector] +++ OK, passed 100 tests.
  10127. 652.42 s [vector] createT: OK
  10128. 652.42 s [vector] +++ OK, passed 100 tests.
  10129. 652.42 s [vector] unfoldr: OK
  10130. 652.42 s [vector] +++ OK, passed 100 tests.
  10131. 652.42 s [vector] unfoldrN: OK
  10132. 652.42 s [vector] +++ OK, passed 100 tests.
  10133. 652.42 s [vector] unfoldrExactN: OK
  10134. 652.42 s [vector] +++ OK, passed 100 tests.
  10135. 652.43 s [vector] unfoldrM: OK
  10136. 652.43 s [vector] +++ OK, passed 100 tests.
  10137. 652.43 s [vector] unfoldrNM: OK
  10138. 652.43 s [vector] +++ OK, passed 100 tests.
  10139. 652.49 s [vector] unfoldrExactNM: OK (0.05s)
  10140. 652.49 s [vector] +++ OK, passed 100 tests.
  10141. 652.51 s [vector] constructN: OK (0.03s)
  10142. 652.51 s [vector] +++ OK, passed 100 tests.
  10143. 652.54 s [vector] constructrN: OK (0.03s)
  10144. 652.54 s [vector] +++ OK, passed 100 tests.
  10145. 652.54 s [vector] cons: OK
  10146. 652.54 s [vector] +++ OK, passed 100 tests.
  10147. 652.54 s [vector] snoc: OK
  10148. 652.55 s [vector] +++ OK, passed 100 tests.
  10149. 652.55 s [vector] append: OK
  10150. 652.55 s [vector] +++ OK, passed 100 tests.
  10151. 652.59 s [vector] concat: OK (0.04s)
  10152. 652.59 s [vector] +++ OK, passed 100 tests.
  10153. 652.59 s [vector] force: OK
  10154. 652.59 s [vector] +++ OK, passed 100 tests.
  10155. 652.59 s [vector] upd: OK
  10156. 652.59 s [vector] +++ OK, passed 100 tests.
  10157. 652.61 s [vector] accum: OK (0.02s)
  10158. 652.61 s [vector] +++ OK, passed 100 tests.
  10159. 652.61 s [vector] reverse: OK
  10160. 652.62 s [vector] +++ OK, passed 100 tests.
  10161. 652.62 s [vector] backpermute: OK
  10162. 652.63 s [vector] +++ OK, passed 100 tests.
  10163. 652.63 s [vector] map: OK (0.01s)
  10164. 652.63 s [vector] +++ OK, passed 100 tests.
  10165. 652.65 s [vector] imap: OK (0.01s)
  10166. 652.65 s [vector] +++ OK, passed 100 tests.
  10167. 652.67 s [vector] concatMap: OK (0.02s)
  10168. 652.67 s [vector] +++ OK, passed 100 tests.
  10169. 652.69 s [vector] mapM: OK (0.02s)
  10170. 652.69 s [vector] +++ OK, passed 100 tests.
  10171. 652.79 s [vector] mapM_: OK (0.11s)
  10172. 652.79 s [vector] +++ OK, passed 100 tests.
  10173. 652.84 s [vector] forM: OK (0.04s)
  10174. 652.84 s [vector] +++ OK, passed 100 tests.
  10175. 652.93 s [vector] forM_: OK (0.09s)
  10176. 652.93 s [vector] +++ OK, passed 100 tests.
  10177. 652.95 s [vector] imapM: OK (0.01s)
  10178. 652.95 s [vector] +++ OK, passed 100 tests.
  10179. 653.01 s [vector] imapM_: OK (0.06s)
  10180. 653.01 s [vector] +++ OK, passed 100 tests.
  10181. 653.01 s [vector] zipWith: OK (0.02s)
  10182. 653.01 s [vector] +++ OK, passed 100 tests.
  10183. 653.04 s [vector] zipWith3: OK (0.02s)
  10184. 653.04 s [vector] +++ OK, passed 100 tests.
  10185. 653.07 s [vector] izipWith: OK (0.01s)
  10186. 653.07 s [vector] +++ OK, passed 100 tests.
  10187. 653.11 s [vector] izipWith3: OK (0.03s)
  10188. 653.11 s [vector] +++ OK, passed 100 tests.
  10189. 653.15 s [vector] izipWithM: OK (0.03s)
  10190. 653.15 s [vector] +++ OK, passed 100 tests.
  10191. 653.25 s [vector] izipWithM_: OK (0.11s)
  10192. 653.25 s [vector] +++ OK, passed 100 tests.
  10193. 653.29 s [vector] zipWithM: OK (0.03s)
  10194. 653.29 s [vector] +++ OK, passed 100 tests.
  10195. 653.41 s [vector] zipWithM_: OK (0.11s)
  10196. 653.41 s [vector] +++ OK, passed 100 tests.
  10197. 653.43 s [vector] filter: OK (0.02s)
  10198. 653.43 s [vector] +++ OK, passed 100 tests.
  10199. 653.45 s [vector] ifilter: OK (0.02s)
  10200. 653.45 s [vector] +++ OK, passed 100 tests.
  10201. 653.55 s [vector] filterM: OK (0.11s)
  10202. 653.55 s [vector] +++ OK, passed 100 tests.
  10203. 653.55 s [vector] uniq: OK
  10204. 653.55 s [vector] +++ OK, passed 100 tests.
  10205. 653.57 s [vector] mapMaybe: OK (0.02s)
  10206. 653.57 s [vector] +++ OK, passed 100 tests.
  10207. 653.60 s [vector] imapMaybe: OK (0.03s)
  10208. 653.60 s [vector] +++ OK, passed 100 tests.
  10209. 653.60 s [vector] takeWhile: OK
  10210. 653.61 s [vector] +++ OK, passed 100 tests.
  10211. 653.61 s [vector] dropWhile: OK
  10212. 653.61 s [vector] +++ OK, passed 100 tests.
  10213. 653.64 s [vector] partition: OK (0.02s)
  10214. 653.64 s [vector] +++ OK, passed 100 tests.
  10215. 653.67 s [vector] partitionWith: OK (0.02s)
  10216. 653.67 s [vector] +++ OK, passed 100 tests.
  10217. 653.67 s [vector] span: OK
  10218. 653.68 s [vector] +++ OK, passed 100 tests.
  10219. 653.69 s [vector] break: OK (0.01s)
  10220. 653.69 s [vector] +++ OK, passed 100 tests.
  10221. 653.69 s [vector] spanR: OK
  10222. 653.70 s [vector] +++ OK, passed 100 tests.
  10223. 653.70 s [vector] breakR: OK
  10224. 653.70 s [vector] +++ OK, passed 100 tests.
  10225. 653.73 s [vector] groupBy: OK (0.01s)
  10226. 653.73 s [vector] +++ OK, passed 100 tests.
  10227. 653.73 s [vector] elem: OK
  10228. 653.73 s [vector] +++ OK, passed 100 tests.
  10229. 653.74 s [vector] notElem: OK
  10230. 653.75 s [vector] +++ OK, passed 100 tests.
  10231. 653.75 s [vector] find: OK
  10232. 653.75 s [vector] +++ OK, passed 100 tests.
  10233. 653.77 s [vector] findIndex: OK (0.01s)
  10234. 653.77 s [vector] +++ OK, passed 100 tests.
  10235. 653.79 s [vector] findIndexR: OK (0.01s)
  10236. 653.80 s [vector] +++ OK, passed 100 tests.
  10237. 653.80 s [vector] findIndices: OK (0.03s)
  10238. 653.80 s [vector] +++ OK, passed 100 tests.
  10239. 653.80 s [vector] elemIndex: OK
  10240. 653.80 s [vector] +++ OK, passed 100 tests.
  10241. 653.81 s [vector] elemIndices: OK
  10242. 653.82 s [vector] +++ OK, passed 100 tests.
  10243. 653.85 s [vector] foldl: OK (0.04s)
  10244. 653.86 s [vector] +++ OK, passed 100 tests.
  10245. 653.89 s [vector] foldl1: OK (0.03s)
  10246. 653.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10247. 653.92 s [vector] foldl': OK (0.03s)
  10248. 653.92 s [vector] +++ OK, passed 100 tests.
  10249. 653.95 s [vector] foldl1': OK (0.03s)
  10250. 653.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10251. 653.99 s [vector] foldr: OK (0.04s)
  10252. 654.00 s [vector] +++ OK, passed 100 tests.
  10253. 654.02 s [vector] foldr1: OK (0.03s)
  10254. 654.02 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10255. 654.05 s [vector] foldr': OK (0.04s)
  10256. 654.05 s [vector] +++ OK, passed 100 tests.
  10257. 654.09 s [vector] foldr1': OK (0.04s)
  10258. 654.09 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10259. 654.13 s [vector] ifoldl: OK (0.04s)
  10260. 654.13 s [vector] +++ OK, passed 100 tests.
  10261. 654.17 s [vector] ifoldl': OK (0.04s)
  10262. 654.17 s [vector] +++ OK, passed 100 tests.
  10263. 654.21 s [vector] ifoldr: OK (0.04s)
  10264. 654.21 s [vector] +++ OK, passed 100 tests.
  10265. 654.25 s [vector] ifoldr': OK (0.04s)
  10266. 654.25 s [vector] +++ OK, passed 100 tests.
  10267. 654.29 s [vector] ifoldM: OK (0.04s)
  10268. 654.29 s [vector] +++ OK, passed 100 tests.
  10269. 654.33 s [vector] ifoldM': OK (0.04s)
  10270. 654.33 s [vector] +++ OK, passed 100 tests.
  10271. 654.49 s [vector] ifoldM_: OK (0.16s)
  10272. 654.49 s [vector] +++ OK, passed 100 tests.
  10273. 654.61 s [vector] ifoldM'_: OK (0.13s)
  10274. 654.61 s [vector] +++ OK, passed 100 tests.
  10275. 654.61 s [vector] all: OK
  10276. 654.62 s [vector] +++ OK, passed 100 tests.
  10277. 654.62 s [vector] any: OK
  10278. 654.62 s [vector] +++ OK, passed 100 tests.
  10279. 654.65 s [vector] prescanl: OK (0.02s)
  10280. 654.65 s [vector] +++ OK, passed 100 tests.
  10281. 654.67 s [vector] prescanl': OK (0.02s)
  10282. 654.67 s [vector] +++ OK, passed 100 tests.
  10283. 654.71 s [vector] postscanl: OK (0.04s)
  10284. 654.72 s [vector] +++ OK, passed 100 tests.
  10285. 654.75 s [vector] postscanl': OK (0.03s)
  10286. 654.75 s [vector] +++ OK, passed 100 tests.
  10287. 654.79 s [vector] scanl: OK (0.04s)
  10288. 654.79 s [vector] +++ OK, passed 100 tests.
  10289. 654.85 s [vector] scanl': OK (0.04s)
  10290. 654.85 s [vector] +++ OK, passed 100 tests.
  10291. 654.87 s [vector] scanl1: OK (0.04s)
  10292. 654.87 s [vector] +++ OK, passed 100 tests.
  10293. 654.93 s [vector] scanl1': OK (0.06s)
  10294. 654.93 s [vector] +++ OK, passed 100 tests.
  10295. 654.98 s [vector] iscanl: OK (0.04s)
  10296. 654.98 s [vector] +++ OK, passed 100 tests.
  10297. 655.04 s [vector] iscanl': OK (0.04s)
  10298. 655.04 s [vector] +++ OK, passed 100 tests.
  10299. 655.05 s [vector] prescanr: OK (0.04s)
  10300. 655.05 s [vector] +++ OK, passed 100 tests.
  10301. 655.11 s [vector] prescanr': OK (0.04s)
  10302. 655.11 s [vector] +++ OK, passed 100 tests.
  10303. 655.13 s [vector] postscanr: OK (0.02s)
  10304. 655.13 s [vector] +++ OK, passed 100 tests.
  10305. 655.17 s [vector] postscanr': OK (0.03s)
  10306. 655.17 s [vector] +++ OK, passed 100 tests.
  10307. 655.19 s [vector] scanr: OK (0.03s)
  10308. 655.19 s [vector] +++ OK, passed 100 tests.
  10309. 655.22 s [vector] scanr': OK (0.03s)
  10310. 655.22 s [vector] +++ OK, passed 100 tests.
  10311. 655.27 s [vector] scanr1: OK (0.03s)
  10312. 655.27 s [vector] +++ OK, passed 100 tests.
  10313. 655.29 s [vector] scanr1': OK (0.03s)
  10314. 655.29 s [vector] +++ OK, passed 100 tests.
  10315. 655.33 s [vector] iscanr: OK (0.01s)
  10316. 655.33 s [vector] +++ OK, passed 100 tests.
  10317. 655.36 s [vector] iscanr': OK (0.03s)
  10318. 655.36 s [vector] +++ OK, passed 100 tests.
  10319. 655.36 s [vector] mut_read: OK
  10320. 655.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10321. 655.36 s [vector] mut_write: OK
  10322. 655.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10323. 655.37 s [vector] mut_modify: OK
  10324. 655.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10325. 655.37 s [vector] mut_generate: OK
  10326. 655.39 s [vector] +++ OK, passed 100 tests.
  10327. 655.41 s [vector] mut_generateM: OK (0.03s)
  10328. 655.41 s [vector] +++ OK, passed 100 tests.
  10329. 655.47 s [vector] mut_mapM_: OK (0.05s)
  10330. 655.47 s [vector] +++ OK, passed 100 tests.
  10331. 655.51 s [vector] mut_imapM_: OK (0.04s)
  10332. 655.51 s [vector] +++ OK, passed 100 tests.
  10333. 655.55 s [vector] mut_forM_: OK (0.03s)
  10334. 655.55 s [vector] +++ OK, passed 100 tests.
  10335. 655.61 s [vector] mut_iforM_: OK (0.06s)
  10336. 655.61 s [vector] +++ OK, passed 100 tests.
  10337. 655.62 s [vector] mut_foldr: OK (0.02s)
  10338. 655.62 s [vector] +++ OK, passed 100 tests.
  10339. 655.65 s [vector] mut_foldr': OK (0.02s)
  10340. 655.65 s [vector] +++ OK, passed 100 tests.
  10341. 655.69 s [vector] mut_foldl: OK (0.02s)
  10342. 655.69 s [vector] +++ OK, passed 100 tests.
  10343. 655.71 s [vector] mut_foldl': OK (0.02s)
  10344. 655.71 s [vector] +++ OK, passed 100 tests.
  10345. 655.72 s [vector] mut_ifoldr: OK (0.02s)
  10346. 655.72 s [vector] +++ OK, passed 100 tests.
  10347. 655.75 s [vector] mut_ifoldr': OK (0.02s)
  10348. 655.76 s [vector] +++ OK, passed 100 tests.
  10349. 655.79 s [vector] mut_ifoldl: OK (0.03s)
  10350. 655.79 s [vector] +++ OK, passed 100 tests.
  10351. 655.81 s [vector] mut_ifoldl': OK (0.03s)
  10352. 655.81 s [vector] +++ OK, passed 100 tests.
  10353. 655.83 s [vector] mut_foldM: OK (0.03s)
  10354. 655.83 s [vector] +++ OK, passed 100 tests.
  10355. 655.87 s [vector] mut_foldM': OK (0.03s)
  10356. 655.87 s [vector] +++ OK, passed 100 tests.
  10357. 655.89 s [vector] mut_foldrM: OK (0.03s)
  10358. 655.89 s [vector] +++ OK, passed 100 tests.
  10359. 655.91 s [vector] mut_foldrM': OK (0.02s)
  10360. 655.91 s [vector] +++ OK, passed 100 tests.
  10361. 655.93 s [vector] mut_ifoldM: OK (0.02s)
  10362. 655.93 s [vector] +++ OK, passed 100 tests.
  10363. 655.95 s [vector] mut_ifoldM': OK (0.02s)
  10364. 655.95 s [vector] +++ OK, passed 100 tests.
  10365. 655.97 s [vector] mut_ifoldrM: OK (0.02s)
  10366. 655.97 s [vector] +++ OK, passed 100 tests.
  10367. 655.97 s [vector] mut_ifoldrM': OK (0.02s)
  10368. 655.97 s [vector] +++ OK, passed 100 tests.
  10369. 655.97 s [vector] compare: OK
  10370. 655.97 s [vector] +++ OK, passed 100 tests.
  10371. 655.97 s [vector] maximum: OK
  10372. 655.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10373. 655.97 s [vector] minimum: OK
  10374. 655.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10375. 655.98 s [vector] minIndex: OK
  10376. 655.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10377. 655.98 s [vector] maxIndex: OK
  10378. 655.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10379. 655.98 s [vector] maximumBy: OK
  10380. 655.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10381. 655.98 s [vector] minimumBy: OK
  10382. 655.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10383. 655.98 s [vector] maximumOn: OK
  10384. 655.98 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10385. 655.98 s [vector] minimumOn: OK
  10386. 655.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10387. 655.98 s [vector] maxIndexBy: OK
  10388. 655.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10389. 655.98 s [vector] minIndexBy: OK
  10390. 655.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10391. 655.98 s [vector] ListFirstMaxIndexWins: OK
  10392. 655.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10393. 655.98 s [vector] FalseListFirstMaxIndexWins: OK
  10394. 655.98 s [vector] +++ OK, failed as expected. (after 1 test):
  10395. 655.98 s [vector] Exception:
  10396. 655.98 s [vector] Prelude.foldr1: empty list
  10397. 655.99 s [vector] CallStack (from HasCallStack):
  10398. 655.99 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10399. 655.99 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10400. 655.99 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10401. 655.99 s [vector] []
  10402. 655.99 s [vector] mempty: OK
  10403. 655.99 s [vector] +++ OK, passed 100 tests.
  10404. 655.99 s [vector] mappend: OK
  10405. 655.99 s [vector] +++ OK, passed 100 tests.
  10406. 656.01 s [vector] mconcat: OK (0.02s)
  10407. 656.01 s [vector] +++ OK, passed 100 tests.
  10408. 656.01 s [vector] glength: OK
  10409. 656.01 s [vector] +++ OK, passed 100 tests.
  10410. 656.02 s [vector] sum: OK
  10411. 656.02 s [vector] +++ OK, passed 100 tests.
  10412. 656.02 s [vector] product: OK
  10413. 656.02 s [vector] +++ OK, passed 100 tests.
  10414. 656.02 s [vector] enumFromN: OK
  10415. 656.02 s [vector] +++ OK, passed 100 tests.
  10416. 656.02 s [vector] enumFromThenN: OK
  10417. 656.02 s [vector] +++ OK, passed 100 tests.
  10418. 656.02 s [vector] enumFromTo: OK
  10419. 656.02 s [vector] +++ OK, passed 100 tests.
  10420. 656.02 s [vector] enumFromThenTo: OK
  10421. 656.02 s [vector] +++ OK, passed 100 tests; 3 discarded.
  10422. 656.02 s [vector] unstream
  10423. 656.02 s [vector] unstream == vunstream (exact): OK
  10424. 656.02 s [vector] +++ OK, passed 100 tests.
  10425. 656.02 s [vector] unstream == vunstream (unknown): OK
  10426. 656.02 s [vector] +++ OK, passed 100 tests.
  10427. 656.02 s [vector] unstreamR ~= vunstream (exact): OK
  10428. 656.02 s [vector] +++ OK, passed 100 tests.
  10429. 656.02 s [vector] unstreamR ~= vunstream (unknown): OK
  10430. 656.02 s [vector] +++ OK, passed 100 tests.
  10431. 656.02 s [vector] Tests.Vector.Strict
  10432. 656.02 s [vector] Bool
  10433. 656.02 s [vector] fromList.toList == id: OK
  10434. 656.02 s [vector] +++ OK, passed 100 tests.
  10435. 656.02 s [vector] toList.fromList == id: OK
  10436. 656.02 s [vector] +++ OK, passed 100 tests.
  10437. 656.02 s [vector] unstream.stream == id: OK
  10438. 656.02 s [vector] +++ OK, passed 100 tests.
  10439. 656.02 s [vector] stream.unstream == id: OK
  10440. 656.02 s [vector] +++ OK, passed 100 tests.
  10441. 656.02 s [vector] eq: OK
  10442. 656.02 s [vector] +++ OK, passed 100 tests.
  10443. 656.02 s [vector] length: OK
  10444. 656.02 s [vector] +++ OK, passed 100 tests.
  10445. 656.02 s [vector] null: OK
  10446. 656.02 s [vector] +++ OK, passed 100 tests.
  10447. 656.02 s [vector] index: OK
  10448. 656.03 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10449. 656.03 s [vector] safeIndex: OK
  10450. 656.03 s [vector] +++ OK, passed 100 tests.
  10451. 656.03 s [vector] head: OK
  10452. 656.03 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10453. 656.03 s [vector] last: OK
  10454. 656.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10455. 656.03 s [vector] unsafeIndex: OK
  10456. 656.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10457. 656.03 s [vector] unsafeHead: OK
  10458. 656.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10459. 656.03 s [vector] unsafeLast: OK
  10460. 656.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10461. 656.03 s [vector] slice: OK
  10462. 656.03 s [vector] +++ OK, passed 100 tests.
  10463. 656.03 s [vector] init: OK
  10464. 656.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10465. 656.03 s [vector] tail: OK
  10466. 656.03 s [vector] +++ OK, passed 100 tests; 10 discarded.
  10467. 656.03 s [vector] take: OK
  10468. 656.03 s [vector] +++ OK, passed 100 tests.
  10469. 656.03 s [vector] drop: OK
  10470. 656.03 s [vector] +++ OK, passed 100 tests.
  10471. 656.03 s [vector] splitAt: OK
  10472. 656.03 s [vector] +++ OK, passed 100 tests.
  10473. 656.03 s [vector] empty: OK
  10474. 656.03 s [vector] +++ OK, passed 100 tests.
  10475. 656.03 s [vector] singleton: OK
  10476. 656.03 s [vector] +++ OK, passed 100 tests.
  10477. 656.03 s [vector] replicate: OK
  10478. 656.03 s [vector] +++ OK, passed 100 tests.
  10479. 656.03 s [vector] generate: OK
  10480. 656.03 s [vector] +++ OK, passed 100 tests.
  10481. 656.04 s [vector] iterateN: OK
  10482. 656.05 s [vector] +++ OK, passed 100 tests.
  10483. 656.05 s [vector] iterateNM: OK (0.01s)
  10484. 656.05 s [vector] +++ OK, passed 100 tests.
  10485. 656.08 s [vector] generateM: OK (0.02s)
  10486. 656.08 s [vector] +++ OK, passed 100 tests.
  10487. 656.11 s [vector] replicateM: OK (0.04s)
  10488. 656.11 s [vector] +++ OK, passed 100 tests.
  10489. 656.11 s [vector] create: OK
  10490. 656.11 s [vector] +++ OK, passed 100 tests.
  10491. 656.11 s [vector] createT: OK
  10492. 656.11 s [vector] +++ OK, passed 100 tests.
  10493. 656.11 s [vector] unfoldr: OK
  10494. 656.11 s [vector] +++ OK, passed 100 tests.
  10495. 656.11 s [vector] unfoldrN: OK
  10496. 656.11 s [vector] +++ OK, passed 100 tests.
  10497. 656.11 s [vector] unfoldrExactN: OK
  10498. 656.11 s [vector] +++ OK, passed 100 tests.
  10499. 656.11 s [vector] unfoldrM: OK
  10500. 656.11 s [vector] +++ OK, passed 100 tests.
  10501. 656.11 s [vector] unfoldrNM: OK
  10502. 656.13 s [vector] +++ OK, passed 100 tests.
  10503. 656.14 s [vector] unfoldrExactNM: OK (0.02s)
  10504. 656.14 s [vector] +++ OK, passed 100 tests.
  10505. 656.14 s [vector] constructN: OK
  10506. 656.14 s [vector] +++ OK, passed 100 tests.
  10507. 656.14 s [vector] constructrN: OK
  10508. 656.14 s [vector] +++ OK, passed 100 tests.
  10509. 656.14 s [vector] cons: OK
  10510. 656.14 s [vector] +++ OK, passed 100 tests.
  10511. 656.14 s [vector] snoc: OK
  10512. 656.14 s [vector] +++ OK, passed 100 tests.
  10513. 656.15 s [vector] append: OK
  10514. 656.15 s [vector] +++ OK, passed 100 tests.
  10515. 656.15 s [vector] concat: OK (0.01s)
  10516. 656.15 s [vector] +++ OK, passed 100 tests.
  10517. 656.15 s [vector] force: OK
  10518. 656.15 s [vector] +++ OK, passed 100 tests.
  10519. 656.17 s [vector] upd: OK
  10520. 656.17 s [vector] +++ OK, passed 100 tests.
  10521. 656.17 s [vector] accum: OK (0.01s)
  10522. 656.17 s [vector] +++ OK, passed 100 tests.
  10523. 656.17 s [vector] reverse: OK
  10524. 656.17 s [vector] +++ OK, passed 100 tests.
  10525. 656.17 s [vector] backpermute: OK
  10526. 656.17 s [vector] +++ OK, passed 100 tests.
  10527. 656.18 s [vector] map: OK
  10528. 656.18 s [vector] +++ OK, passed 100 tests.
  10529. 656.18 s [vector] imap: OK
  10530. 656.18 s [vector] +++ OK, passed 100 tests.
  10531. 656.18 s [vector] concatMap: OK
  10532. 656.18 s [vector] +++ OK, passed 100 tests.
  10533. 656.19 s [vector] mapM: OK
  10534. 656.19 s [vector] +++ OK, passed 100 tests.
  10535. 656.19 s [vector] mapM_: OK (0.01s)
  10536. 656.19 s [vector] +++ OK, passed 100 tests.
  10537. 656.19 s [vector] forM: OK
  10538. 656.20 s [vector] +++ OK, passed 100 tests.
  10539. 656.20 s [vector] forM_: OK
  10540. 656.21 s [vector] +++ OK, passed 100 tests.
  10541. 656.21 s [vector] imapM: OK
  10542. 656.21 s [vector] +++ OK, passed 100 tests.
  10543. 656.22 s [vector] imapM_: OK (0.01s)
  10544. 656.22 s [vector] +++ OK, passed 100 tests.
  10545. 656.22 s [vector] zipWith: OK
  10546. 656.22 s [vector] +++ OK, passed 100 tests.
  10547. 656.22 s [vector] zipWith3: OK
  10548. 656.22 s [vector] +++ OK, passed 100 tests.
  10549. 656.23 s [vector] izipWith: OK
  10550. 656.23 s [vector] +++ OK, passed 100 tests.
  10551. 656.23 s [vector] izipWith3: OK
  10552. 656.23 s [vector] +++ OK, passed 100 tests.
  10553. 656.23 s [vector] izipWithM: OK
  10554. 656.23 s [vector] +++ OK, passed 100 tests.
  10555. 656.24 s [vector] izipWithM_: OK
  10556. 656.24 s [vector] +++ OK, passed 100 tests.
  10557. 656.25 s [vector] zipWithM: OK
  10558. 656.25 s [vector] +++ OK, passed 100 tests.
  10559. 656.25 s [vector] zipWithM_: OK
  10560. 656.25 s [vector] +++ OK, passed 100 tests.
  10561. 656.25 s [vector] filter: OK
  10562. 656.25 s [vector] +++ OK, passed 100 tests.
  10563. 656.25 s [vector] ifilter: OK
  10564. 656.25 s [vector] +++ OK, passed 100 tests.
  10565. 656.27 s [vector] filterM: OK (0.02s)
  10566. 656.27 s [vector] +++ OK, passed 100 tests.
  10567. 656.27 s [vector] uniq: OK
  10568. 656.27 s [vector] +++ OK, passed 100 tests.
  10569. 656.27 s [vector] mapMaybe: OK
  10570. 656.27 s [vector] +++ OK, passed 100 tests.
  10571. 656.27 s [vector] imapMaybe: OK
  10572. 656.27 s [vector] +++ OK, passed 100 tests.
  10573. 656.27 s [vector] takeWhile: OK
  10574. 656.27 s [vector] +++ OK, passed 100 tests.
  10575. 656.27 s [vector] dropWhile: OK
  10576. 656.27 s [vector] +++ OK, passed 100 tests.
  10577. 656.27 s [vector] partition: OK
  10578. 656.27 s [vector] +++ OK, passed 100 tests.
  10579. 656.28 s [vector] partitionWith: OK
  10580. 656.28 s [vector] +++ OK, passed 100 tests.
  10581. 656.28 s [vector] span: OK
  10582. 656.28 s [vector] +++ OK, passed 100 tests.
  10583. 656.28 s [vector] break: OK
  10584. 656.28 s [vector] +++ OK, passed 100 tests.
  10585. 656.28 s [vector] spanR: OK
  10586. 656.28 s [vector] +++ OK, passed 100 tests.
  10587. 656.28 s [vector] breakR: OK
  10588. 656.28 s [vector] +++ OK, passed 100 tests.
  10589. 656.28 s [vector] groupBy: OK
  10590. 656.28 s [vector] +++ OK, passed 100 tests.
  10591. 656.28 s [vector] elem: OK
  10592. 656.28 s [vector] +++ OK, passed 100 tests.
  10593. 656.28 s [vector] notElem: OK
  10594. 656.28 s [vector] +++ OK, passed 100 tests.
  10595. 656.28 s [vector] find: OK
  10596. 656.28 s [vector] +++ OK, passed 100 tests.
  10597. 656.28 s [vector] findIndex: OK
  10598. 656.28 s [vector] +++ OK, passed 100 tests.
  10599. 656.28 s [vector] findIndexR: OK
  10600. 656.28 s [vector] +++ OK, passed 100 tests.
  10601. 656.28 s [vector] findIndices: OK
  10602. 656.28 s [vector] +++ OK, passed 100 tests.
  10603. 656.28 s [vector] elemIndex: OK
  10604. 656.28 s [vector] +++ OK, passed 100 tests.
  10605. 656.28 s [vector] elemIndices: OK
  10606. 656.28 s [vector] +++ OK, passed 100 tests.
  10607. 656.29 s [vector] foldl: OK
  10608. 656.29 s [vector] +++ OK, passed 100 tests.
  10609. 656.29 s [vector] foldl1: OK
  10610. 656.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10611. 656.29 s [vector] foldl': OK
  10612. 656.29 s [vector] +++ OK, passed 100 tests.
  10613. 656.29 s [vector] foldl1': OK
  10614. 656.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10615. 656.29 s [vector] foldr: OK
  10616. 656.29 s [vector] +++ OK, passed 100 tests.
  10617. 656.29 s [vector] foldr1: OK
  10618. 656.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10619. 656.29 s [vector] foldr': OK
  10620. 656.29 s [vector] +++ OK, passed 100 tests.
  10621. 656.29 s [vector] foldr1': OK
  10622. 656.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10623. 656.30 s [vector] ifoldl: OK
  10624. 656.30 s [vector] +++ OK, passed 100 tests.
  10625. 656.30 s [vector] ifoldl': OK
  10626. 656.30 s [vector] +++ OK, passed 100 tests.
  10627. 656.30 s [vector] ifoldr: OK
  10628. 656.30 s [vector] +++ OK, passed 100 tests.
  10629. 656.30 s [vector] ifoldr': OK
  10630. 656.30 s [vector] +++ OK, passed 100 tests.
  10631. 656.30 s [vector] ifoldM: OK
  10632. 656.30 s [vector] +++ OK, passed 100 tests.
  10633. 656.30 s [vector] ifoldM': OK
  10634. 656.31 s [vector] +++ OK, passed 100 tests.
  10635. 656.33 s [vector] ifoldM_: OK (0.01s)
  10636. 656.33 s [vector] +++ OK, passed 100 tests.
  10637. 656.33 s [vector] ifoldM'_: OK (0.02s)
  10638. 656.33 s [vector] +++ OK, passed 100 tests.
  10639. 656.33 s [vector] all: OK
  10640. 656.33 s [vector] +++ OK, passed 100 tests.
  10641. 656.34 s [vector] any: OK
  10642. 656.34 s [vector] +++ OK, passed 100 tests.
  10643. 656.34 s [vector] prescanl: OK
  10644. 656.34 s [vector] +++ OK, passed 100 tests.
  10645. 656.34 s [vector] prescanl': OK
  10646. 656.34 s [vector] +++ OK, passed 100 tests.
  10647. 656.35 s [vector] postscanl: OK
  10648. 656.35 s [vector] +++ OK, passed 100 tests.
  10649. 656.35 s [vector] postscanl': OK
  10650. 656.47 s [vector] +++ OK, passed 100 tests.
  10651. 656.47 s [vector] scanl: OK
  10652. 656.47 s [vector] +++ OK, passed 100 tests.
  10653. 656.47 s [vector] scanl': OK (0.01s)
  10654. 656.47 s [vector] +++ OK, passed 100 tests.
  10655. 656.47 s [vector] scanl1: OK
  10656. 656.47 s [vector] +++ OK, passed 100 tests.
  10657. 656.47 s [vector] scanl1': OK (0.01s)
  10658. 656.47 s [vector] +++ OK, passed 100 tests.
  10659. 656.47 s [vector] iscanl: OK (0.02s)
  10660. 656.47 s [vector] +++ OK, passed 100 tests.
  10661. 656.47 s [vector] iscanl': OK (0.02s)
  10662. 656.47 s [vector] +++ OK, passed 100 tests.
  10663. 656.47 s [vector] prescanr: OK (0.01s)
  10664. 656.47 s [vector] +++ OK, passed 100 tests.
  10665. 656.47 s [vector] prescanr': OK (0.01s)
  10666. 656.47 s [vector] +++ OK, passed 100 tests.
  10667. 656.47 s [vector] postscanr: OK (0.02s)
  10668. 656.47 s [vector] +++ OK, passed 100 tests.
  10669. 656.48 s [vector] postscanr': OK (0.01s)
  10670. 656.48 s [vector] +++ OK, passed 100 tests.
  10671. 656.49 s [vector] scanr: OK
  10672. 656.49 s [vector] +++ OK, passed 100 tests.
  10673. 656.50 s [vector] scanr': OK
  10674. 656.50 s [vector] +++ OK, passed 100 tests.
  10675. 656.50 s [vector] scanr1: OK
  10676. 656.50 s [vector] +++ OK, passed 100 tests.
  10677. 656.51 s [vector] scanr1': OK
  10678. 656.51 s [vector] +++ OK, passed 100 tests.
  10679. 656.52 s [vector] iscanr: OK
  10680. 656.52 s [vector] +++ OK, passed 100 tests.
  10681. 656.52 s [vector] iscanr': OK
  10682. 656.52 s [vector] +++ OK, passed 100 tests.
  10683. 656.52 s [vector] mut_read: OK
  10684. 656.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10685. 656.52 s [vector] mut_write: OK
  10686. 656.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10687. 656.52 s [vector] mut_modify: OK
  10688. 656.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10689. 656.53 s [vector] mut_generate: OK
  10690. 656.53 s [vector] +++ OK, passed 100 tests.
  10691. 656.53 s [vector] mut_generateM: OK
  10692. 656.54 s [vector] +++ OK, passed 100 tests.
  10693. 656.54 s [vector] mut_mapM_: OK (0.01s)
  10694. 656.54 s [vector] +++ OK, passed 100 tests.
  10695. 656.58 s [vector] mut_imapM_: OK
  10696. 656.58 s [vector] +++ OK, passed 100 tests.
  10697. 656.59 s [vector] mut_forM_: OK (0.02s)
  10698. 656.60 s [vector] +++ OK, passed 100 tests.
  10699. 656.60 s [vector] mut_iforM_: OK (0.02s)
  10700. 656.60 s [vector] +++ OK, passed 100 tests.
  10701. 656.60 s [vector] mut_foldr: OK
  10702. 656.60 s [vector] +++ OK, passed 100 tests.
  10703. 656.60 s [vector] mut_foldr': OK
  10704. 656.60 s [vector] +++ OK, passed 100 tests.
  10705. 656.60 s [vector] mut_foldl: OK
  10706. 656.60 s [vector] +++ OK, passed 100 tests.
  10707. 656.60 s [vector] mut_foldl': OK
  10708. 656.61 s [vector] +++ OK, passed 100 tests.
  10709. 656.61 s [vector] mut_ifoldr: OK
  10710. 656.61 s [vector] +++ OK, passed 100 tests.
  10711. 656.61 s [vector] mut_ifoldr': OK
  10712. 656.61 s [vector] +++ OK, passed 100 tests.
  10713. 656.61 s [vector] mut_ifoldl: OK
  10714. 656.61 s [vector] +++ OK, passed 100 tests.
  10715. 656.61 s [vector] mut_ifoldl': OK
  10716. 656.61 s [vector] +++ OK, passed 100 tests.
  10717. 656.62 s [vector] mut_foldM: OK
  10718. 656.62 s [vector] +++ OK, passed 100 tests.
  10719. 656.62 s [vector] mut_foldM': OK
  10720. 656.62 s [vector] +++ OK, passed 100 tests.
  10721. 656.62 s [vector] mut_foldrM: OK
  10722. 656.62 s [vector] +++ OK, passed 100 tests.
  10723. 656.62 s [vector] mut_foldrM': OK
  10724. 656.62 s [vector] +++ OK, passed 100 tests.
  10725. 656.62 s [vector] mut_ifoldM: OK
  10726. 656.63 s [vector] +++ OK, passed 100 tests.
  10727. 656.63 s [vector] mut_ifoldM': OK
  10728. 656.63 s [vector] +++ OK, passed 100 tests.
  10729. 656.63 s [vector] mut_ifoldrM: OK
  10730. 656.63 s [vector] +++ OK, passed 100 tests.
  10731. 656.63 s [vector] mut_ifoldrM': OK
  10732. 656.63 s [vector] +++ OK, passed 100 tests.
  10733. 656.63 s [vector] compare: OK
  10734. 656.63 s [vector] +++ OK, passed 100 tests.
  10735. 656.63 s [vector] maximum: OK
  10736. 656.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10737. 656.63 s [vector] minimum: OK
  10738. 656.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10739. 656.64 s [vector] minIndex: OK
  10740. 656.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10741. 656.64 s [vector] maxIndex: OK
  10742. 656.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10743. 656.64 s [vector] maximumBy: OK
  10744. 656.64 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10745. 656.64 s [vector] minimumBy: OK
  10746. 656.64 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10747. 656.64 s [vector] maximumOn: OK
  10748. 656.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10749. 656.64 s [vector] minimumOn: OK
  10750. 656.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10751. 656.64 s [vector] maxIndexBy: OK
  10752. 656.64 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10753. 656.64 s [vector] minIndexBy: OK
  10754. 656.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10755. 656.64 s [vector] ListFirstMaxIndexWins: OK
  10756. 656.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10757. 656.65 s [vector] FalseListFirstMaxIndexWins: OK
  10758. 656.65 s [vector] +++ OK, failed as expected. (after 1 test):
  10759. 656.65 s [vector] Exception:
  10760. 656.65 s [vector] Prelude.foldr1: empty list
  10761. 656.65 s [vector] CallStack (from HasCallStack):
  10762. 656.65 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10763. 656.65 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10764. 656.65 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10765. 656.65 s [vector] []
  10766. 656.65 s [vector] zip: OK
  10767. 656.65 s [vector] +++ OK, passed 100 tests.
  10768. 656.65 s [vector] zip3: OK
  10769. 656.65 s [vector] +++ OK, passed 100 tests.
  10770. 656.65 s [vector] unzip: OK
  10771. 656.65 s [vector] +++ OK, passed 100 tests.
  10772. 656.65 s [vector] unzip3: OK
  10773. 656.65 s [vector] +++ OK, passed 100 tests.
  10774. 656.65 s [vector] indexed: OK
  10775. 656.65 s [vector] +++ OK, passed 100 tests.
  10776. 656.65 s [vector] update: OK
  10777. 656.66 s [vector] +++ OK, passed 100 tests.
  10778. 656.67 s [vector] concat: OK (0.01s)
  10779. 656.67 s [vector] +++ OK, passed 100 tests.
  10780. 656.67 s [vector] mempty: OK
  10781. 656.67 s [vector] +++ OK, passed 100 tests.
  10782. 656.67 s [vector] mappend: OK
  10783. 656.67 s [vector] +++ OK, passed 100 tests.
  10784. 656.68 s [vector] mconcat: OK (0.01s)
  10785. 656.68 s [vector] +++ OK, passed 100 tests.
  10786. 656.68 s [vector] fmap: OK
  10787. 656.68 s [vector] +++ OK, passed 100 tests.
  10788. 656.69 s [vector] return: OK
  10789. 656.69 s [vector] +++ OK, passed 100 tests.
  10790. 656.70 s [vector] bind: OK (0.02s)
  10791. 656.70 s [vector] +++ OK, passed 100 tests.
  10792. 656.70 s [vector] mzip: OK
  10793. 656.70 s [vector] +++ OK, passed 100 tests.
  10794. 656.70 s [vector] munzip: OK
  10795. 656.70 s [vector] +++ OK, passed 100 tests.
  10796. 656.71 s [vector] applicative_pure: OK
  10797. 656.72 s [vector] +++ OK, passed 100 tests.
  10798. 656.73 s [vector] applicative_appl: OK (0.02s)
  10799. 656.73 s [vector] +++ OK, passed 100 tests.
  10800. 656.73 s [vector] alternative_empty: OK
  10801. 656.73 s [vector] +++ OK, passed 100 tests.
  10802. 656.73 s [vector] alternative_or: OK
  10803. 656.73 s [vector] +++ OK, passed 100 tests.
  10804. 656.79 s [vector] sequence: OK (0.04s)
  10805. 656.79 s [vector] +++ OK, passed 100 tests.
  10806. 656.81 s [vector] sequence_: OK (0.05s)
  10807. 656.81 s [vector] +++ OK, passed 100 tests.
  10808. 656.82 s [vector] glength: OK
  10809. 656.82 s [vector] +++ OK, passed 100 tests.
  10810. 656.82 s [vector] and: OK
  10811. 656.82 s [vector] +++ OK, passed 100 tests.
  10812. 656.82 s [vector] or: OK
  10813. 656.82 s [vector] +++ OK, passed 100 tests.
  10814. 656.82 s [vector] Int
  10815. 656.82 s [vector] fromList.toList == id: OK
  10816. 656.82 s [vector] +++ OK, passed 100 tests.
  10817. 656.82 s [vector] toList.fromList == id: OK
  10818. 656.82 s [vector] +++ OK, passed 100 tests.
  10819. 656.82 s [vector] unstream.stream == id: OK
  10820. 656.82 s [vector] +++ OK, passed 100 tests.
  10821. 656.82 s [vector] stream.unstream == id: OK
  10822. 656.82 s [vector] +++ OK, passed 100 tests.
  10823. 656.82 s [vector] eq: OK
  10824. 656.82 s [vector] +++ OK, passed 100 tests.
  10825. 656.83 s [vector] length: OK
  10826. 656.83 s [vector] +++ OK, passed 100 tests.
  10827. 656.83 s [vector] null: OK
  10828. 656.83 s [vector] +++ OK, passed 100 tests.
  10829. 656.83 s [vector] index: OK
  10830. 656.83 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10831. 656.83 s [vector] safeIndex: OK
  10832. 656.83 s [vector] +++ OK, passed 100 tests.
  10833. 656.83 s [vector] head: OK
  10834. 656.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10835. 656.83 s [vector] last: OK
  10836. 656.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10837. 656.83 s [vector] unsafeIndex: OK
  10838. 656.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10839. 656.83 s [vector] unsafeHead: OK
  10840. 656.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10841. 656.83 s [vector] unsafeLast: OK
  10842. 656.83 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10843. 656.83 s [vector] slice: OK
  10844. 656.83 s [vector] +++ OK, passed 100 tests.
  10845. 656.84 s [vector] init: OK
  10846. 656.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10847. 656.84 s [vector] tail: OK
  10848. 656.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10849. 656.84 s [vector] take: OK
  10850. 656.84 s [vector] +++ OK, passed 100 tests.
  10851. 656.84 s [vector] drop: OK
  10852. 656.84 s [vector] +++ OK, passed 100 tests.
  10853. 656.84 s [vector] splitAt: OK
  10854. 656.84 s [vector] +++ OK, passed 100 tests.
  10855. 656.84 s [vector] empty: OK
  10856. 656.84 s [vector] +++ OK, passed 100 tests.
  10857. 656.84 s [vector] singleton: OK
  10858. 656.84 s [vector] +++ OK, passed 100 tests.
  10859. 656.84 s [vector] replicate: OK
  10860. 656.84 s [vector] +++ OK, passed 100 tests.
  10861. 656.84 s [vector] generate: OK
  10862. 656.84 s [vector] +++ OK, passed 100 tests.
  10863. 656.86 s [vector] iterateN: OK
  10864. 656.86 s [vector] +++ OK, passed 100 tests.
  10865. 656.89 s [vector] iterateNM: OK (0.03s)
  10866. 656.89 s [vector] +++ OK, passed 100 tests.
  10867. 656.91 s [vector] generateM: OK (0.02s)
  10868. 656.91 s [vector] +++ OK, passed 100 tests.
  10869. 656.91 s [vector] replicateM: OK (0.01s)
  10870. 656.91 s [vector] +++ OK, passed 100 tests.
  10871. 656.91 s [vector] create: OK
  10872. 656.91 s [vector] +++ OK, passed 100 tests.
  10873. 656.91 s [vector] createT: OK
  10874. 656.91 s [vector] +++ OK, passed 100 tests.
  10875. 656.91 s [vector] unfoldr: OK
  10876. 656.91 s [vector] +++ OK, passed 100 tests.
  10877. 656.91 s [vector] unfoldrN: OK
  10878. 656.91 s [vector] +++ OK, passed 100 tests.
  10879. 656.91 s [vector] unfoldrExactN: OK
  10880. 656.91 s [vector] +++ OK, passed 100 tests.
  10881. 656.91 s [vector] unfoldrM: OK
  10882. 656.91 s [vector] +++ OK, passed 100 tests.
  10883. 656.93 s [vector] unfoldrNM: OK
  10884. 656.93 s [vector] +++ OK, passed 100 tests.
  10885. 656.94 s [vector] unfoldrExactNM: OK (0.03s)
  10886. 656.94 s [vector] +++ OK, passed 100 tests.
  10887. 656.95 s [vector] constructN: OK
  10888. 656.95 s [vector] +++ OK, passed 100 tests.
  10889. 656.95 s [vector] constructrN: OK
  10890. 656.95 s [vector] +++ OK, passed 100 tests.
  10891. 656.95 s [vector] cons: OK
  10892. 656.95 s [vector] +++ OK, passed 100 tests.
  10893. 656.95 s [vector] snoc: OK
  10894. 656.95 s [vector] +++ OK, passed 100 tests.
  10895. 656.95 s [vector] append: OK
  10896. 656.95 s [vector] +++ OK, passed 100 tests.
  10897. 656.97 s [vector] concat: OK (0.02s)
  10898. 656.97 s [vector] +++ OK, passed 100 tests.
  10899. 656.97 s [vector] force: OK
  10900. 656.97 s [vector] +++ OK, passed 100 tests.
  10901. 656.97 s [vector] upd: OK
  10902. 656.97 s [vector] +++ OK, passed 100 tests.
  10903. 656.97 s [vector] accum: OK
  10904. 656.97 s [vector] +++ OK, passed 100 tests.
  10905. 656.97 s [vector] reverse: OK
  10906. 656.97 s [vector] +++ OK, passed 100 tests.
  10907. 656.98 s [vector] backpermute: OK
  10908. 656.98 s [vector] +++ OK, passed 100 tests.
  10909. 656.98 s [vector] map: OK
  10910. 656.98 s [vector] +++ OK, passed 100 tests.
  10911. 656.98 s [vector] imap: OK
  10912. 656.98 s [vector] +++ OK, passed 100 tests.
  10913. 656.98 s [vector] concatMap: OK
  10914. 656.98 s [vector] +++ OK, passed 100 tests.
  10915. 656.98 s [vector] mapM: OK
  10916. 656.99 s [vector] +++ OK, passed 100 tests.
  10917. 657.00 s [vector] mapM_: OK (0.02s)
  10918. 657.00 s [vector] +++ OK, passed 100 tests.
  10919. 657.00 s [vector] forM: OK
  10920. 657.01 s [vector] +++ OK, passed 100 tests.
  10921. 657.02 s [vector] forM_: OK (0.02s)
  10922. 657.03 s [vector] +++ OK, passed 100 tests.
  10923. 657.03 s [vector] imapM: OK
  10924. 657.03 s [vector] +++ OK, passed 100 tests.
  10925. 657.04 s [vector] imapM_: OK (0.02s)
  10926. 657.04 s [vector] +++ OK, passed 100 tests.
  10927. 657.04 s [vector] zipWith: OK
  10928. 657.04 s [vector] +++ OK, passed 100 tests.
  10929. 657.04 s [vector] zipWith3: OK
  10930. 657.04 s [vector] +++ OK, passed 100 tests.
  10931. 657.05 s [vector] izipWith: OK
  10932. 657.05 s [vector] +++ OK, passed 100 tests.
  10933. 657.05 s [vector] izipWith3: OK
  10934. 657.05 s [vector] +++ OK, passed 100 tests.
  10935. 657.05 s [vector] izipWithM: OK
  10936. 657.08 s [vector] +++ OK, passed 100 tests.
  10937. 657.09 s [vector] izipWithM_: OK (0.02s)
  10938. 657.09 s [vector] +++ OK, passed 100 tests.
  10939. 657.09 s [vector] zipWithM: OK
  10940. 657.10 s [vector] +++ OK, passed 100 tests.
  10941. 657.14 s [vector] zipWithM_: OK (0.05s)
  10942. 657.15 s [vector] +++ OK, passed 100 tests.
  10943. 657.15 s [vector] filter: OK
  10944. 657.16 s [vector] +++ OK, passed 100 tests.
  10945. 657.16 s [vector] ifilter: OK
  10946. 657.16 s [vector] +++ OK, passed 100 tests.
  10947. 657.23 s [vector] filterM: OK (0.07s)
  10948. 657.23 s [vector] +++ OK, passed 100 tests.
  10949. 657.23 s [vector] uniq: OK
  10950. 657.23 s [vector] +++ OK, passed 100 tests.
  10951. 657.24 s [vector] mapMaybe: OK
  10952. 657.24 s [vector] +++ OK, passed 100 tests.
  10953. 657.24 s [vector] imapMaybe: OK
  10954. 657.24 s [vector] +++ OK, passed 100 tests.
  10955. 657.24 s [vector] takeWhile: OK
  10956. 657.25 s [vector] +++ OK, passed 100 tests.
  10957. 657.25 s [vector] dropWhile: OK
  10958. 657.25 s [vector] +++ OK, passed 100 tests.
  10959. 657.25 s [vector] partition: OK
  10960. 657.25 s [vector] +++ OK, passed 100 tests.
  10961. 657.25 s [vector] partitionWith: OK
  10962. 657.25 s [vector] +++ OK, passed 100 tests.
  10963. 657.26 s [vector] span: OK
  10964. 657.26 s [vector] +++ OK, passed 100 tests.
  10965. 657.26 s [vector] break: OK
  10966. 657.26 s [vector] +++ OK, passed 100 tests.
  10967. 657.26 s [vector] spanR: OK
  10968. 657.26 s [vector] +++ OK, passed 100 tests.
  10969. 657.26 s [vector] breakR: OK
  10970. 657.26 s [vector] +++ OK, passed 100 tests.
  10971. 657.26 s [vector] groupBy: OK
  10972. 657.26 s [vector] +++ OK, passed 100 tests.
  10973. 657.26 s [vector] elem: OK
  10974. 657.26 s [vector] +++ OK, passed 100 tests.
  10975. 657.26 s [vector] notElem: OK
  10976. 657.26 s [vector] +++ OK, passed 100 tests.
  10977. 657.26 s [vector] find: OK
  10978. 657.26 s [vector] +++ OK, passed 100 tests.
  10979. 657.26 s [vector] findIndex: OK
  10980. 657.26 s [vector] +++ OK, passed 100 tests.
  10981. 657.26 s [vector] findIndexR: OK
  10982. 657.26 s [vector] +++ OK, passed 100 tests.
  10983. 657.26 s [vector] findIndices: OK
  10984. 657.26 s [vector] +++ OK, passed 100 tests.
  10985. 657.26 s [vector] elemIndex: OK
  10986. 657.26 s [vector] +++ OK, passed 100 tests.
  10987. 657.27 s [vector] elemIndices: OK
  10988. 657.27 s [vector] +++ OK, passed 100 tests.
  10989. 657.27 s [vector] foldl: OK
  10990. 657.27 s [vector] +++ OK, passed 100 tests.
  10991. 657.27 s [vector] foldl1: OK
  10992. 657.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10993. 657.27 s [vector] foldl': OK
  10994. 657.27 s [vector] +++ OK, passed 100 tests.
  10995. 657.27 s [vector] foldl1': OK
  10996. 657.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10997. 657.28 s [vector] foldr: OK
  10998. 657.28 s [vector] +++ OK, passed 100 tests.
  10999. 657.28 s [vector] foldr1: OK
  11000. 657.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11001. 657.28 s [vector] foldr': OK
  11002. 657.28 s [vector] +++ OK, passed 100 tests.
  11003. 657.28 s [vector] foldr1': OK
  11004. 657.28 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11005. 657.29 s [vector] ifoldl: OK
  11006. 657.29 s [vector] +++ OK, passed 100 tests.
  11007. 657.29 s [vector] ifoldl': OK
  11008. 657.29 s [vector] +++ OK, passed 100 tests.
  11009. 657.29 s [vector] ifoldr: OK
  11010. 657.29 s [vector] +++ OK, passed 100 tests.
  11011. 657.29 s [vector] ifoldr': OK
  11012. 657.30 s [vector] +++ OK, passed 100 tests.
  11013. 657.30 s [vector] ifoldM: OK
  11014. 657.30 s [vector] +++ OK, passed 100 tests.
  11015. 657.30 s [vector] ifoldM': OK
  11016. 657.31 s [vector] +++ OK, passed 100 tests.
  11017. 657.33 s [vector] ifoldM_: OK (0.02s)
  11018. 657.33 s [vector] +++ OK, passed 100 tests.
  11019. 657.33 s [vector] ifoldM'_: OK (0.02s)
  11020. 657.33 s [vector] +++ OK, passed 100 tests.
  11021. 657.33 s [vector] all: OK
  11022. 657.33 s [vector] +++ OK, passed 100 tests.
  11023. 657.33 s [vector] any: OK
  11024. 657.34 s [vector] +++ OK, passed 100 tests.
  11025. 657.34 s [vector] prescanl: OK
  11026. 657.34 s [vector] +++ OK, passed 100 tests.
  11027. 657.34 s [vector] prescanl': OK
  11028. 657.34 s [vector] +++ OK, passed 100 tests.
  11029. 657.35 s [vector] postscanl: OK
  11030. 657.36 s [vector] +++ OK, passed 100 tests.
  11031. 657.37 s [vector] postscanl': OK
  11032. 657.37 s [vector] +++ OK, passed 100 tests.
  11033. 657.37 s [vector] scanl: OK
  11034. 657.37 s [vector] +++ OK, passed 100 tests.
  11035. 657.37 s [vector] scanl': OK
  11036. 657.37 s [vector] +++ OK, passed 100 tests.
  11037. 657.37 s [vector] scanl1: OK
  11038. 657.37 s [vector] +++ OK, passed 100 tests.
  11039. 657.37 s [vector] scanl1': OK
  11040. 657.38 s [vector] +++ OK, passed 100 tests.
  11041. 657.38 s [vector] iscanl: OK
  11042. 657.38 s [vector] +++ OK, passed 100 tests.
  11043. 657.39 s [vector] iscanl': OK
  11044. 657.39 s [vector] +++ OK, passed 100 tests.
  11045. 657.39 s [vector] prescanr: OK
  11046. 657.39 s [vector] +++ OK, passed 100 tests.
  11047. 657.39 s [vector] prescanr': OK
  11048. 657.40 s [vector] +++ OK, passed 100 tests.
  11049. 657.40 s [vector] postscanr: OK
  11050. 657.40 s [vector] +++ OK, passed 100 tests.
  11051. 657.40 s [vector] postscanr': OK
  11052. 657.40 s [vector] +++ OK, passed 100 tests.
  11053. 657.40 s [vector] scanr: OK
  11054. 657.41 s [vector] +++ OK, passed 100 tests.
  11055. 657.42 s [vector] scanr': OK
  11056. 657.42 s [vector] +++ OK, passed 100 tests.
  11057. 657.42 s [vector] scanr1: OK
  11058. 657.42 s [vector] +++ OK, passed 100 tests.
  11059. 657.42 s [vector] scanr1': OK
  11060. 657.42 s [vector] +++ OK, passed 100 tests.
  11061. 657.43 s [vector] iscanr: OK
  11062. 657.43 s [vector] +++ OK, passed 100 tests.
  11063. 657.43 s [vector] iscanr': OK
  11064. 657.43 s [vector] +++ OK, passed 100 tests.
  11065. 657.43 s [vector] mut_read: OK
  11066. 657.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11067. 657.43 s [vector] mut_write: OK
  11068. 657.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11069. 657.43 s [vector] mut_modify: OK
  11070. 657.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11071. 657.43 s [vector] mut_generate: OK
  11072. 657.43 s [vector] +++ OK, passed 100 tests.
  11073. 657.45 s [vector] mut_generateM: OK (0.01s)
  11074. 657.45 s [vector] +++ OK, passed 100 tests.
  11075. 657.50 s [vector] mut_mapM_: OK (0.03s)
  11076. 657.50 s [vector] +++ OK, passed 100 tests.
  11077. 657.51 s [vector] mut_imapM_: OK (0.03s)
  11078. 657.51 s [vector] +++ OK, passed 100 tests.
  11079. 657.53 s [vector] mut_forM_: OK (0.03s)
  11080. 657.53 s [vector] +++ OK, passed 100 tests.
  11081. 657.56 s [vector] mut_iforM_: OK (0.03s)
  11082. 657.56 s [vector] +++ OK, passed 100 tests.
  11083. 657.56 s [vector] mut_foldr: OK
  11084. 657.56 s [vector] +++ OK, passed 100 tests.
  11085. 657.56 s [vector] mut_foldr': OK
  11086. 657.56 s [vector] +++ OK, passed 100 tests.
  11087. 657.57 s [vector] mut_foldl: OK
  11088. 657.57 s [vector] +++ OK, passed 100 tests.
  11089. 657.57 s [vector] mut_foldl': OK
  11090. 657.57 s [vector] +++ OK, passed 100 tests.
  11091. 657.57 s [vector] mut_ifoldr: OK
  11092. 657.57 s [vector] +++ OK, passed 100 tests.
  11093. 657.58 s [vector] mut_ifoldr': OK
  11094. 657.58 s [vector] +++ OK, passed 100 tests.
  11095. 657.58 s [vector] mut_ifoldl: OK
  11096. 657.58 s [vector] +++ OK, passed 100 tests.
  11097. 657.58 s [vector] mut_ifoldl': OK
  11098. 657.58 s [vector] +++ OK, passed 100 tests.
  11099. 657.58 s [vector] mut_foldM: OK
  11100. 657.58 s [vector] +++ OK, passed 100 tests.
  11101. 657.58 s [vector] mut_foldM': OK
  11102. 657.58 s [vector] +++ OK, passed 100 tests.
  11103. 657.59 s [vector] mut_foldrM: OK
  11104. 657.59 s [vector] +++ OK, passed 100 tests.
  11105. 657.59 s [vector] mut_foldrM': OK
  11106. 657.59 s [vector] +++ OK, passed 100 tests.
  11107. 657.59 s [vector] mut_ifoldM: OK
  11108. 657.60 s [vector] +++ OK, passed 100 tests.
  11109. 657.60 s [vector] mut_ifoldM': OK
  11110. 657.60 s [vector] +++ OK, passed 100 tests.
  11111. 657.60 s [vector] mut_ifoldrM: OK
  11112. 657.60 s [vector] +++ OK, passed 100 tests.
  11113. 657.60 s [vector] mut_ifoldrM': OK
  11114. 657.60 s [vector] +++ OK, passed 100 tests.
  11115. 657.60 s [vector] compare: OK
  11116. 657.60 s [vector] +++ OK, passed 100 tests.
  11117. 657.61 s [vector] maximum: OK
  11118. 657.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11119. 657.61 s [vector] minimum: OK
  11120. 657.61 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11121. 657.61 s [vector] minIndex: OK
  11122. 657.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11123. 657.61 s [vector] maxIndex: OK
  11124. 657.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11125. 657.61 s [vector] maximumBy: OK
  11126. 657.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11127. 657.61 s [vector] minimumBy: OK
  11128. 657.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11129. 657.61 s [vector] maximumOn: OK
  11130. 657.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11131. 657.61 s [vector] minimumOn: OK
  11132. 657.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11133. 657.61 s [vector] maxIndexBy: OK
  11134. 657.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11135. 657.62 s [vector] minIndexBy: OK
  11136. 657.62 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11137. 657.62 s [vector] ListFirstMaxIndexWins: OK
  11138. 657.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11139. 657.62 s [vector] FalseListFirstMaxIndexWins: OK
  11140. 657.62 s [vector] +++ OK, failed as expected. (after 1 test):
  11141. 657.62 s [vector] Exception:
  11142. 657.62 s [vector] Prelude.foldr1: empty list
  11143. 657.62 s [vector] CallStack (from HasCallStack):
  11144. 657.62 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11145. 657.62 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11146. 657.62 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11147. 657.62 s [vector] []
  11148. 657.62 s [vector] zip: OK
  11149. 657.62 s [vector] +++ OK, passed 100 tests.
  11150. 657.62 s [vector] zip3: OK
  11151. 657.62 s [vector] +++ OK, passed 100 tests.
  11152. 657.62 s [vector] unzip: OK
  11153. 657.62 s [vector] +++ OK, passed 100 tests.
  11154. 657.62 s [vector] unzip3: OK
  11155. 657.64 s [vector] +++ OK, passed 100 tests.
  11156. 657.64 s [vector] indexed: OK
  11157. 657.64 s [vector] +++ OK, passed 100 tests.
  11158. 657.64 s [vector] update: OK
  11159. 657.64 s [vector] +++ OK, passed 100 tests.
  11160. 657.65 s [vector] concat: OK (0.03s)
  11161. 657.65 s [vector] +++ OK, passed 100 tests.
  11162. 657.66 s [vector] mempty: OK
  11163. 657.66 s [vector] +++ OK, passed 100 tests.
  11164. 657.66 s [vector] mappend: OK
  11165. 657.68 s [vector] +++ OK, passed 100 tests.
  11166. 657.68 s [vector] mconcat: OK (0.02s)
  11167. 657.68 s [vector] +++ OK, passed 100 tests.
  11168. 657.68 s [vector] fmap: OK
  11169. 657.68 s [vector] +++ OK, passed 100 tests.
  11170. 657.68 s [vector] return: OK
  11171. 657.70 s [vector] +++ OK, passed 100 tests.
  11172. 657.71 s [vector] bind: OK (0.02s)
  11173. 657.71 s [vector] +++ OK, passed 100 tests.
  11174. 657.71 s [vector] mzip: OK
  11175. 657.71 s [vector] +++ OK, passed 100 tests.
  11176. 657.71 s [vector] munzip: OK
  11177. 657.71 s [vector] +++ OK, passed 100 tests.
  11178. 657.71 s [vector] applicative_pure: OK
  11179. 657.71 s [vector] +++ OK, passed 100 tests.
  11180. 657.78 s [vector] applicative_appl: OK (0.07s)
  11181. 657.78 s [vector] +++ OK, passed 100 tests.
  11182. 657.78 s [vector] alternative_empty: OK
  11183. 657.78 s [vector] +++ OK, passed 100 tests.
  11184. 657.78 s [vector] alternative_or: OK
  11185. 657.80 s [vector] +++ OK, passed 100 tests.
  11186. 657.89 s [vector] sequence: OK (0.09s)
  11187. 657.89 s [vector] +++ OK, passed 100 tests.
  11188. 657.90 s [vector] sequence_: OK (0.02s)
  11189. 657.90 s [vector] +++ OK, passed 100 tests.
  11190. 657.90 s [vector] glength: OK
  11191. 657.90 s [vector] +++ OK, passed 100 tests.
  11192. 657.90 s [vector] sum: OK
  11193. 657.90 s [vector] +++ OK, passed 100 tests.
  11194. 657.90 s [vector] product: OK
  11195. 657.90 s [vector] +++ OK, passed 100 tests.
  11196. 657.90 s [vector] enumFromN: OK
  11197. 657.90 s [vector] +++ OK, passed 100 tests.
  11198. 657.90 s [vector] enumFromThenN: OK
  11199. 657.90 s [vector] +++ OK, passed 100 tests.
  11200. 657.90 s [vector] enumFromTo: OK
  11201. 657.90 s [vector] +++ OK, passed 100 tests.
  11202. 657.90 s [vector] enumFromThenTo: OK
  11203. 657.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11204. 657.90 s [vector] unstream
  11205. 657.90 s [vector] unstream == vunstream (exact): OK
  11206. 657.90 s [vector] +++ OK, passed 100 tests.
  11207. 657.90 s [vector] unstream == vunstream (unknown): OK
  11208. 657.90 s [vector] +++ OK, passed 100 tests.
  11209. 657.90 s [vector] unstreamR ~= vunstream (exact): OK
  11210. 657.90 s [vector] +++ OK, passed 100 tests.
  11211. 657.90 s [vector] unstreamR ~= vunstream (unknown): OK
  11212. 657.90 s [vector] +++ OK, passed 100 tests.
  11213. 657.90 s [vector] Tests.Vector.Unboxed
  11214. 657.90 s [vector] ()
  11215. 657.90 s [vector] fromList.toList == id: OK
  11216. 657.90 s [vector] +++ OK, passed 100 tests.
  11217. 657.90 s [vector] toList.fromList == id: OK
  11218. 657.91 s [vector] +++ OK, passed 100 tests.
  11219. 657.91 s [vector] unstream.stream == id: OK
  11220. 657.91 s [vector] +++ OK, passed 100 tests.
  11221. 657.91 s [vector] stream.unstream == id: OK
  11222. 657.91 s [vector] +++ OK, passed 100 tests.
  11223. 657.91 s [vector] eq: OK
  11224. 657.91 s [vector] +++ OK, passed 100 tests.
  11225. 657.91 s [vector] length: OK
  11226. 657.91 s [vector] +++ OK, passed 100 tests.
  11227. 657.91 s [vector] null: OK
  11228. 657.91 s [vector] +++ OK, passed 100 tests.
  11229. 657.91 s [vector] index: OK
  11230. 657.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11231. 657.91 s [vector] safeIndex: OK
  11232. 657.91 s [vector] +++ OK, passed 100 tests.
  11233. 657.91 s [vector] head: OK
  11234. 657.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11235. 657.91 s [vector] last: OK
  11236. 657.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11237. 657.91 s [vector] unsafeIndex: OK
  11238. 657.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11239. 657.91 s [vector] unsafeHead: OK
  11240. 657.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11241. 657.91 s [vector] unsafeLast: OK
  11242. 657.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11243. 657.91 s [vector] slice: OK
  11244. 657.91 s [vector] +++ OK, passed 100 tests.
  11245. 657.91 s [vector] init: OK
  11246. 657.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11247. 657.91 s [vector] tail: OK
  11248. 657.91 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11249. 657.91 s [vector] take: OK
  11250. 657.91 s [vector] +++ OK, passed 100 tests.
  11251. 657.91 s [vector] drop: OK
  11252. 657.92 s [vector] +++ OK, passed 100 tests.
  11253. 657.92 s [vector] splitAt: OK
  11254. 657.92 s [vector] +++ OK, passed 100 tests.
  11255. 657.92 s [vector] empty: OK
  11256. 657.92 s [vector] +++ OK, passed 100 tests.
  11257. 657.92 s [vector] singleton: OK
  11258. 657.92 s [vector] +++ OK, passed 100 tests.
  11259. 657.92 s [vector] replicate: OK
  11260. 657.92 s [vector] +++ OK, passed 100 tests.
  11261. 657.92 s [vector] generate: OK
  11262. 657.92 s [vector] +++ OK, passed 100 tests.
  11263. 657.93 s [vector] iterateN: OK
  11264. 657.93 s [vector] +++ OK, passed 100 tests.
  11265. 657.95 s [vector] iterateNM: OK (0.02s)
  11266. 657.95 s [vector] +++ OK, passed 100 tests.
  11267. 657.99 s [vector] generateM: OK (0.05s)
  11268. 658.00 s [vector] +++ OK, passed 100 tests.
  11269. 658.00 s [vector] replicateM: OK (0.01s)
  11270. 658.00 s [vector] +++ OK, passed 100 tests.
  11271. 658.00 s [vector] create: OK
  11272. 658.00 s [vector] +++ OK, passed 100 tests.
  11273. 658.00 s [vector] createT: OK
  11274. 658.01 s [vector] +++ OK, passed 100 tests.
  11275. 658.01 s [vector] unfoldr: OK
  11276. 658.01 s [vector] +++ OK, passed 100 tests.
  11277. 658.01 s [vector] unfoldrN: OK
  11278. 658.01 s [vector] +++ OK, passed 100 tests.
  11279. 658.01 s [vector] unfoldrExactN: OK
  11280. 658.01 s [vector] +++ OK, passed 100 tests.
  11281. 658.01 s [vector] unfoldrM: OK
  11282. 658.01 s [vector] +++ OK, passed 100 tests.
  11283. 658.02 s [vector] unfoldrNM: OK
  11284. 658.03 s [vector] +++ OK, passed 100 tests.
  11285. 658.07 s [vector] unfoldrExactNM: OK (0.03s)
  11286. 658.07 s [vector] +++ OK, passed 100 tests.
  11287. 658.07 s [vector] constructN: OK (0.03s)
  11288. 658.07 s [vector] +++ OK, passed 100 tests.
  11289. 658.07 s [vector] constructrN: OK
  11290. 658.07 s [vector] +++ OK, passed 100 tests.
  11291. 658.07 s [vector] cons: OK
  11292. 658.07 s [vector] +++ OK, passed 100 tests.
  11293. 658.07 s [vector] snoc: OK
  11294. 658.07 s [vector] +++ OK, passed 100 tests.
  11295. 658.09 s [vector] append: OK
  11296. 658.09 s [vector] +++ OK, passed 100 tests.
  11297. 658.09 s [vector] concat: OK (0.02s)
  11298. 658.09 s [vector] +++ OK, passed 100 tests.
  11299. 658.09 s [vector] force: OK
  11300. 658.09 s [vector] +++ OK, passed 100 tests.
  11301. 658.09 s [vector] upd: OK
  11302. 658.09 s [vector] +++ OK, passed 100 tests.
  11303. 658.10 s [vector] accum: OK
  11304. 658.10 s [vector] +++ OK, passed 100 tests.
  11305. 658.10 s [vector] reverse: OK
  11306. 658.10 s [vector] +++ OK, passed 100 tests.
  11307. 658.10 s [vector] backpermute: OK
  11308. 658.10 s [vector] +++ OK, passed 100 tests.
  11309. 658.10 s [vector] map: OK
  11310. 658.10 s [vector] +++ OK, passed 100 tests.
  11311. 658.10 s [vector] imap: OK
  11312. 658.10 s [vector] +++ OK, passed 100 tests.
  11313. 658.10 s [vector] concatMap: OK
  11314. 658.10 s [vector] +++ OK, passed 100 tests.
  11315. 658.12 s [vector] mapM: OK
  11316. 658.12 s [vector] +++ OK, passed 100 tests.
  11317. 658.12 s [vector] mapM_: OK (0.01s)
  11318. 658.12 s [vector] +++ OK, passed 100 tests.
  11319. 658.12 s [vector] forM: OK
  11320. 658.13 s [vector] +++ OK, passed 100 tests.
  11321. 658.13 s [vector] forM_: OK (0.01s)
  11322. 658.13 s [vector] +++ OK, passed 100 tests.
  11323. 658.13 s [vector] imapM: OK
  11324. 658.14 s [vector] +++ OK, passed 100 tests.
  11325. 658.15 s [vector] imapM_: OK (0.02s)
  11326. 658.15 s [vector] +++ OK, passed 100 tests.
  11327. 658.15 s [vector] zipWith: OK
  11328. 658.15 s [vector] +++ OK, passed 100 tests.
  11329. 658.15 s [vector] zipWith3: OK
  11330. 658.15 s [vector] +++ OK, passed 100 tests.
  11331. 658.15 s [vector] izipWith: OK
  11332. 658.15 s [vector] +++ OK, passed 100 tests.
  11333. 658.16 s [vector] izipWith3: OK
  11334. 658.16 s [vector] +++ OK, passed 100 tests.
  11335. 658.16 s [vector] izipWithM: OK
  11336. 658.16 s [vector] +++ OK, passed 100 tests.
  11337. 658.17 s [vector] izipWithM_: OK (0.01s)
  11338. 658.17 s [vector] +++ OK, passed 100 tests.
  11339. 658.17 s [vector] zipWithM: OK
  11340. 658.18 s [vector] +++ OK, passed 100 tests.
  11341. 658.18 s [vector] zipWithM_: OK
  11342. 658.18 s [vector] +++ OK, passed 100 tests.
  11343. 658.18 s [vector] filter: OK
  11344. 658.18 s [vector] +++ OK, passed 100 tests.
  11345. 658.18 s [vector] ifilter: OK
  11346. 658.20 s [vector] +++ OK, passed 100 tests.
  11347. 658.22 s [vector] filterM: OK (0.04s)
  11348. 658.22 s [vector] +++ OK, passed 100 tests.
  11349. 658.23 s [vector] uniq: OK
  11350. 658.23 s [vector] +++ OK, passed 100 tests.
  11351. 658.23 s [vector] mapMaybe: OK
  11352. 658.23 s [vector] +++ OK, passed 100 tests.
  11353. 658.23 s [vector] imapMaybe: OK
  11354. 658.23 s [vector] +++ OK, passed 100 tests.
  11355. 658.23 s [vector] takeWhile: OK
  11356. 658.23 s [vector] +++ OK, passed 100 tests.
  11357. 658.23 s [vector] dropWhile: OK
  11358. 658.23 s [vector] +++ OK, passed 100 tests.
  11359. 658.23 s [vector] partition: OK
  11360. 658.23 s [vector] +++ OK, passed 100 tests.
  11361. 658.24 s [vector] partitionWith: OK
  11362. 658.24 s [vector] +++ OK, passed 100 tests.
  11363. 658.24 s [vector] span: OK
  11364. 658.24 s [vector] +++ OK, passed 100 tests.
  11365. 658.24 s [vector] break: OK
  11366. 658.24 s [vector] +++ OK, passed 100 tests.
  11367. 658.24 s [vector] spanR: OK
  11368. 658.24 s [vector] +++ OK, passed 100 tests.
  11369. 658.24 s [vector] breakR: OK
  11370. 658.24 s [vector] +++ OK, passed 100 tests.
  11371. 658.24 s [vector] groupBy: OK
  11372. 658.24 s [vector] +++ OK, passed 100 tests.
  11373. 658.24 s [vector] elem: OK
  11374. 658.24 s [vector] +++ OK, passed 100 tests.
  11375. 658.24 s [vector] notElem: OK
  11376. 658.24 s [vector] +++ OK, passed 100 tests.
  11377. 658.24 s [vector] find: OK
  11378. 658.24 s [vector] +++ OK, passed 100 tests.
  11379. 658.24 s [vector] findIndex: OK
  11380. 658.24 s [vector] +++ OK, passed 100 tests.
  11381. 658.24 s [vector] findIndexR: OK
  11382. 658.24 s [vector] +++ OK, passed 100 tests.
  11383. 658.24 s [vector] findIndices: OK
  11384. 658.24 s [vector] +++ OK, passed 100 tests.
  11385. 658.24 s [vector] elemIndex: OK
  11386. 658.24 s [vector] +++ OK, passed 100 tests.
  11387. 658.25 s [vector] elemIndices: OK
  11388. 658.25 s [vector] +++ OK, passed 100 tests.
  11389. 658.25 s [vector] foldl: OK
  11390. 658.25 s [vector] +++ OK, passed 100 tests.
  11391. 658.25 s [vector] foldl1: OK
  11392. 658.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11393. 658.25 s [vector] foldl': OK
  11394. 658.25 s [vector] +++ OK, passed 100 tests.
  11395. 658.25 s [vector] foldl1': OK
  11396. 658.25 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11397. 658.25 s [vector] foldr: OK
  11398. 658.25 s [vector] +++ OK, passed 100 tests.
  11399. 658.25 s [vector] foldr1: OK
  11400. 658.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11401. 658.25 s [vector] foldr': OK
  11402. 658.25 s [vector] +++ OK, passed 100 tests.
  11403. 658.25 s [vector] foldr1': OK
  11404. 658.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11405. 658.25 s [vector] ifoldl: OK
  11406. 658.26 s [vector] +++ OK, passed 100 tests.
  11407. 658.27 s [vector] ifoldl': OK (0.02s)
  11408. 658.27 s [vector] +++ OK, passed 100 tests.
  11409. 658.27 s [vector] ifoldr: OK
  11410. 658.27 s [vector] +++ OK, passed 100 tests.
  11411. 658.27 s [vector] ifoldr': OK
  11412. 658.27 s [vector] +++ OK, passed 100 tests.
  11413. 658.27 s [vector] ifoldM: OK
  11414. 658.27 s [vector] +++ OK, passed 100 tests.
  11415. 658.27 s [vector] ifoldM': OK
  11416. 658.27 s [vector] +++ OK, passed 100 tests.
  11417. 658.30 s [vector] ifoldM_: OK (0.01s)
  11418. 658.30 s [vector] +++ OK, passed 100 tests.
  11419. 658.30 s [vector] ifoldM'_: OK (0.01s)
  11420. 658.30 s [vector] +++ OK, passed 100 tests.
  11421. 658.30 s [vector] all: OK
  11422. 658.30 s [vector] +++ OK, passed 100 tests.
  11423. 658.30 s [vector] any: OK
  11424. 658.30 s [vector] +++ OK, passed 100 tests.
  11425. 658.30 s [vector] prescanl: OK
  11426. 658.30 s [vector] +++ OK, passed 100 tests.
  11427. 658.30 s [vector] prescanl': OK
  11428. 658.30 s [vector] +++ OK, passed 100 tests.
  11429. 658.30 s [vector] postscanl: OK
  11430. 658.30 s [vector] +++ OK, passed 100 tests.
  11431. 658.30 s [vector] postscanl': OK
  11432. 658.31 s [vector] +++ OK, passed 100 tests.
  11433. 658.31 s [vector] scanl: OK
  11434. 658.31 s [vector] +++ OK, passed 100 tests.
  11435. 658.31 s [vector] scanl': OK
  11436. 658.31 s [vector] +++ OK, passed 100 tests.
  11437. 658.31 s [vector] scanl1: OK
  11438. 658.31 s [vector] +++ OK, passed 100 tests.
  11439. 658.31 s [vector] scanl1': OK
  11440. 658.31 s [vector] +++ OK, passed 100 tests.
  11441. 658.31 s [vector] iscanl: OK
  11442. 658.31 s [vector] +++ OK, passed 100 tests.
  11443. 658.31 s [vector] iscanl': OK
  11444. 658.31 s [vector] +++ OK, passed 100 tests.
  11445. 658.31 s [vector] prescanr: OK
  11446. 658.31 s [vector] +++ OK, passed 100 tests.
  11447. 658.31 s [vector] prescanr': OK
  11448. 658.31 s [vector] +++ OK, passed 100 tests.
  11449. 658.31 s [vector] postscanr: OK
  11450. 658.31 s [vector] +++ OK, passed 100 tests.
  11451. 658.31 s [vector] postscanr': OK
  11452. 658.31 s [vector] +++ OK, passed 100 tests.
  11453. 658.31 s [vector] scanr: OK
  11454. 658.32 s [vector] +++ OK, passed 100 tests.
  11455. 658.32 s [vector] scanr': OK
  11456. 658.32 s [vector] +++ OK, passed 100 tests.
  11457. 658.32 s [vector] scanr1: OK
  11458. 658.32 s [vector] +++ OK, passed 100 tests.
  11459. 658.32 s [vector] scanr1': OK
  11460. 658.32 s [vector] +++ OK, passed 100 tests.
  11461. 658.32 s [vector] iscanr: OK
  11462. 658.32 s [vector] +++ OK, passed 100 tests.
  11463. 658.32 s [vector] iscanr': OK
  11464. 658.32 s [vector] +++ OK, passed 100 tests.
  11465. 658.32 s [vector] mut_read: OK
  11466. 658.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11467. 658.32 s [vector] mut_write: OK
  11468. 658.32 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11469. 658.32 s [vector] mut_modify: OK
  11470. 658.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11471. 658.32 s [vector] mut_generate: OK
  11472. 658.32 s [vector] +++ OK, passed 100 tests.
  11473. 658.33 s [vector] mut_generateM: OK
  11474. 658.33 s [vector] +++ OK, passed 100 tests.
  11475. 658.33 s [vector] mut_mapM_: OK
  11476. 658.34 s [vector] +++ OK, passed 100 tests.
  11477. 658.35 s [vector] mut_imapM_: OK (0.01s)
  11478. 658.35 s [vector] +++ OK, passed 100 tests.
  11479. 658.36 s [vector] mut_forM_: OK
  11480. 658.36 s [vector] +++ OK, passed 100 tests.
  11481. 658.38 s [vector] mut_iforM_: OK
  11482. 658.38 s [vector] +++ OK, passed 100 tests.
  11483. 658.38 s [vector] mut_foldr: OK
  11484. 658.38 s [vector] +++ OK, passed 100 tests.
  11485. 658.38 s [vector] mut_foldr': OK
  11486. 658.38 s [vector] +++ OK, passed 100 tests.
  11487. 658.38 s [vector] mut_foldl: OK
  11488. 658.38 s [vector] +++ OK, passed 100 tests.
  11489. 658.38 s [vector] mut_foldl': OK
  11490. 658.38 s [vector] +++ OK, passed 100 tests.
  11491. 658.38 s [vector] mut_ifoldr: OK
  11492. 658.38 s [vector] +++ OK, passed 100 tests.
  11493. 658.38 s [vector] mut_ifoldr': OK
  11494. 658.38 s [vector] +++ OK, passed 100 tests.
  11495. 658.38 s [vector] mut_ifoldl: OK
  11496. 658.38 s [vector] +++ OK, passed 100 tests.
  11497. 658.38 s [vector] mut_ifoldl': OK
  11498. 658.38 s [vector] +++ OK, passed 100 tests.
  11499. 658.38 s [vector] mut_foldM: OK
  11500. 658.38 s [vector] +++ OK, passed 100 tests.
  11501. 658.38 s [vector] mut_foldM': OK
  11502. 658.38 s [vector] +++ OK, passed 100 tests.
  11503. 658.38 s [vector] mut_foldrM: OK
  11504. 658.38 s [vector] +++ OK, passed 100 tests.
  11505. 658.38 s [vector] mut_foldrM': OK
  11506. 658.38 s [vector] +++ OK, passed 100 tests.
  11507. 658.39 s [vector] mut_ifoldM: OK
  11508. 658.39 s [vector] +++ OK, passed 100 tests.
  11509. 658.39 s [vector] mut_ifoldM': OK
  11510. 658.39 s [vector] +++ OK, passed 100 tests.
  11511. 658.39 s [vector] mut_ifoldrM: OK
  11512. 658.39 s [vector] +++ OK, passed 100 tests.
  11513. 658.39 s [vector] mut_ifoldrM': OK
  11514. 658.39 s [vector] +++ OK, passed 100 tests.
  11515. 658.39 s [vector] compare: OK
  11516. 658.39 s [vector] +++ OK, passed 100 tests.
  11517. 658.39 s [vector] maximum: OK
  11518. 658.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11519. 658.39 s [vector] minimum: OK
  11520. 658.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11521. 658.39 s [vector] minIndex: OK
  11522. 658.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11523. 658.39 s [vector] maxIndex: OK
  11524. 658.39 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11525. 658.40 s [vector] maximumBy: OK
  11526. 658.40 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11527. 658.40 s [vector] minimumBy: OK
  11528. 658.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11529. 658.40 s [vector] maximumOn: OK
  11530. 658.40 s [vector] +++ OK, passed 100 tests; 29 discarded.
  11531. 658.40 s [vector] minimumOn: OK
  11532. 658.40 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11533. 658.40 s [vector] maxIndexBy: OK
  11534. 658.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11535. 658.40 s [vector] minIndexBy: OK
  11536. 658.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11537. 658.40 s [vector] ListFirstMaxIndexWins: OK
  11538. 658.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11539. 658.40 s [vector] FalseListFirstMaxIndexWins: OK
  11540. 658.40 s [vector] +++ OK, failed as expected. (after 1 test):
  11541. 658.40 s [vector] Exception:
  11542. 658.40 s [vector] Prelude.foldr1: empty list
  11543. 658.40 s [vector] CallStack (from HasCallStack):
  11544. 658.40 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11545. 658.40 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11546. 658.40 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11547. 658.40 s [vector] []
  11548. 658.40 s [vector] zip: OK
  11549. 658.40 s [vector] +++ OK, passed 100 tests.
  11550. 658.40 s [vector] zip3: OK
  11551. 658.41 s [vector] +++ OK, passed 100 tests.
  11552. 658.41 s [vector] unzip: OK
  11553. 658.41 s [vector] +++ OK, passed 100 tests.
  11554. 658.41 s [vector] unzip3: OK
  11555. 658.41 s [vector] +++ OK, passed 100 tests.
  11556. 658.41 s [vector] indexed: OK
  11557. 658.41 s [vector] +++ OK, passed 100 tests.
  11558. 658.41 s [vector] update: OK
  11559. 658.41 s [vector] +++ OK, passed 100 tests.
  11560. 658.41 s [vector] mempty: OK
  11561. 658.41 s [vector] +++ OK, passed 100 tests.
  11562. 658.42 s [vector] mappend: OK
  11563. 658.42 s [vector] +++ OK, passed 100 tests.
  11564. 658.43 s [vector] mconcat: OK (0.02s)
  11565. 658.43 s [vector] +++ OK, passed 100 tests.
  11566. 658.43 s [vector] glength: OK
  11567. 658.43 s [vector] +++ OK, passed 100 tests.
  11568. 658.43 s [vector] (Bool)
  11569. 658.43 s [vector] fromList.toList == id: OK
  11570. 658.43 s [vector] +++ OK, passed 100 tests.
  11571. 658.43 s [vector] toList.fromList == id: OK
  11572. 658.43 s [vector] +++ OK, passed 100 tests.
  11573. 658.43 s [vector] unstream.stream == id: OK
  11574. 658.43 s [vector] +++ OK, passed 100 tests.
  11575. 658.43 s [vector] stream.unstream == id: OK
  11576. 658.43 s [vector] +++ OK, passed 100 tests.
  11577. 658.43 s [vector] eq: OK
  11578. 658.44 s [vector] +++ OK, passed 100 tests.
  11579. 658.44 s [vector] length: OK
  11580. 658.44 s [vector] +++ OK, passed 100 tests.
  11581. 658.44 s [vector] null: OK
  11582. 658.44 s [vector] +++ OK, passed 100 tests.
  11583. 658.44 s [vector] index: OK
  11584. 658.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11585. 658.44 s [vector] safeIndex: OK
  11586. 658.44 s [vector] +++ OK, passed 100 tests.
  11587. 658.44 s [vector] head: OK
  11588. 658.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11589. 658.44 s [vector] last: OK
  11590. 658.44 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11591. 658.44 s [vector] unsafeIndex: OK
  11592. 658.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11593. 658.44 s [vector] unsafeHead: OK
  11594. 658.44 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11595. 658.44 s [vector] unsafeLast: OK
  11596. 658.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11597. 658.44 s [vector] slice: OK
  11598. 658.44 s [vector] +++ OK, passed 100 tests.
  11599. 658.45 s [vector] init: OK
  11600. 658.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11601. 658.45 s [vector] tail: OK
  11602. 658.45 s [vector] +++ OK, passed 100 tests; 10 discarded.
  11603. 658.45 s [vector] take: OK
  11604. 658.45 s [vector] +++ OK, passed 100 tests.
  11605. 658.45 s [vector] drop: OK
  11606. 658.45 s [vector] +++ OK, passed 100 tests.
  11607. 658.45 s [vector] splitAt: OK
  11608. 658.45 s [vector] +++ OK, passed 100 tests.
  11609. 658.45 s [vector] empty: OK
  11610. 658.45 s [vector] +++ OK, passed 100 tests.
  11611. 658.45 s [vector] singleton: OK
  11612. 658.45 s [vector] +++ OK, passed 100 tests.
  11613. 658.45 s [vector] replicate: OK
  11614. 658.45 s [vector] +++ OK, passed 100 tests.
  11615. 658.45 s [vector] generate: OK
  11616. 658.45 s [vector] +++ OK, passed 100 tests.
  11617. 658.45 s [vector] iterateN: OK
  11618. 658.46 s [vector] +++ OK, passed 100 tests.
  11619. 658.50 s [vector] iterateNM: OK (0.03s)
  11620. 658.50 s [vector] +++ OK, passed 100 tests.
  11621. 658.50 s [vector] generateM: OK (0.02s)
  11622. 658.50 s [vector] +++ OK, passed 100 tests.
  11623. 658.50 s [vector] replicateM: OK
  11624. 658.50 s [vector] +++ OK, passed 100 tests.
  11625. 658.50 s [vector] create: OK
  11626. 658.50 s [vector] +++ OK, passed 100 tests.
  11627. 658.51 s [vector] createT: OK
  11628. 658.51 s [vector] +++ OK, passed 100 tests.
  11629. 658.51 s [vector] unfoldr: OK
  11630. 658.51 s [vector] +++ OK, passed 100 tests.
  11631. 658.51 s [vector] unfoldrN: OK
  11632. 658.51 s [vector] +++ OK, passed 100 tests.
  11633. 658.51 s [vector] unfoldrExactN: OK
  11634. 658.52 s [vector] +++ OK, passed 100 tests.
  11635. 658.52 s [vector] unfoldrM: OK
  11636. 658.52 s [vector] +++ OK, passed 100 tests.
  11637. 658.52 s [vector] unfoldrNM: OK
  11638. 658.55 s [vector] +++ OK, passed 100 tests.
  11639. 658.57 s [vector] unfoldrExactNM: OK (0.05s)
  11640. 658.57 s [vector] +++ OK, passed 100 tests.
  11641. 658.57 s [vector] constructN: OK
  11642. 658.57 s [vector] +++ OK, passed 100 tests.
  11643. 658.58 s [vector] constructrN: OK
  11644. 658.58 s [vector] +++ OK, passed 100 tests.
  11645. 658.58 s [vector] cons: OK
  11646. 658.58 s [vector] +++ OK, passed 100 tests.
  11647. 658.58 s [vector] snoc: OK
  11648. 658.58 s [vector] +++ OK, passed 100 tests.
  11649. 658.59 s [vector] append: OK
  11650. 658.60 s [vector] +++ OK, passed 100 tests.
  11651. 658.61 s [vector] concat: OK (0.02s)
  11652. 658.61 s [vector] +++ OK, passed 100 tests.
  11653. 658.61 s [vector] force: OK
  11654. 658.61 s [vector] +++ OK, passed 100 tests.
  11655. 658.62 s [vector] upd: OK
  11656. 658.62 s [vector] +++ OK, passed 100 tests.
  11657. 658.62 s [vector] accum: OK
  11658. 658.62 s [vector] +++ OK, passed 100 tests.
  11659. 658.62 s [vector] reverse: OK
  11660. 658.62 s [vector] +++ OK, passed 100 tests.
  11661. 658.62 s [vector] backpermute: OK
  11662. 658.62 s [vector] +++ OK, passed 100 tests.
  11663. 658.62 s [vector] map: OK
  11664. 658.62 s [vector] +++ OK, passed 100 tests.
  11665. 658.63 s [vector] imap: OK
  11666. 658.63 s [vector] +++ OK, passed 100 tests.
  11667. 658.63 s [vector] concatMap: OK
  11668. 658.63 s [vector] +++ OK, passed 100 tests.
  11669. 658.63 s [vector] mapM: OK
  11670. 658.63 s [vector] +++ OK, passed 100 tests.
  11671. 658.65 s [vector] mapM_: OK (0.02s)
  11672. 658.65 s [vector] +++ OK, passed 100 tests.
  11673. 658.65 s [vector] forM: OK
  11674. 658.65 s [vector] +++ OK, passed 100 tests.
  11675. 658.67 s [vector] forM_: OK (0.02s)
  11676. 658.67 s [vector] +++ OK, passed 100 tests.
  11677. 658.67 s [vector] imapM: OK
  11678. 658.67 s [vector] +++ OK, passed 100 tests.
  11679. 658.68 s [vector] imapM_: OK (0.01s)
  11680. 658.68 s [vector] +++ OK, passed 100 tests.
  11681. 658.69 s [vector] zipWith: OK
  11682. 658.69 s [vector] +++ OK, passed 100 tests.
  11683. 658.69 s [vector] zipWith3: OK
  11684. 658.69 s [vector] +++ OK, passed 100 tests.
  11685. 658.70 s [vector] izipWith: OK
  11686. 658.70 s [vector] +++ OK, passed 100 tests.
  11687. 658.70 s [vector] izipWith3: OK
  11688. 658.71 s [vector] +++ OK, passed 100 tests.
  11689. 658.71 s [vector] izipWithM: OK
  11690. 658.72 s [vector] +++ OK, passed 100 tests.
  11691. 658.74 s [vector] izipWithM_: OK (0.02s)
  11692. 658.74 s [vector] +++ OK, passed 100 tests.
  11693. 658.74 s [vector] zipWithM: OK (0.01s)
  11694. 658.74 s [vector] +++ OK, passed 100 tests.
  11695. 658.77 s [vector] zipWithM_: OK (0.01s)
  11696. 658.77 s [vector] +++ OK, passed 100 tests.
  11697. 658.78 s [vector] filter: OK
  11698. 658.78 s [vector] +++ OK, passed 100 tests.
  11699. 658.80 s [vector] ifilter: OK
  11700. 658.80 s [vector] +++ OK, passed 100 tests.
  11701. 658.84 s [vector] filterM: OK (0.05s)
  11702. 658.84 s [vector] +++ OK, passed 100 tests.
  11703. 658.84 s [vector] uniq: OK
  11704. 658.84 s [vector] +++ OK, passed 100 tests.
  11705. 658.84 s [vector] mapMaybe: OK
  11706. 658.84 s [vector] +++ OK, passed 100 tests.
  11707. 658.84 s [vector] imapMaybe: OK
  11708. 658.84 s [vector] +++ OK, passed 100 tests.
  11709. 658.84 s [vector] takeWhile: OK
  11710. 658.84 s [vector] +++ OK, passed 100 tests.
  11711. 658.84 s [vector] dropWhile: OK
  11712. 658.85 s [vector] +++ OK, passed 100 tests.
  11713. 658.85 s [vector] partition: OK
  11714. 658.85 s [vector] +++ OK, passed 100 tests.
  11715. 658.85 s [vector] partitionWith: OK
  11716. 658.85 s [vector] +++ OK, passed 100 tests.
  11717. 658.85 s [vector] span: OK
  11718. 658.85 s [vector] +++ OK, passed 100 tests.
  11719. 658.85 s [vector] break: OK
  11720. 658.85 s [vector] +++ OK, passed 100 tests.
  11721. 658.85 s [vector] spanR: OK
  11722. 658.85 s [vector] +++ OK, passed 100 tests.
  11723. 658.85 s [vector] breakR: OK
  11724. 658.85 s [vector] +++ OK, passed 100 tests.
  11725. 658.86 s [vector] groupBy: OK
  11726. 658.86 s [vector] +++ OK, passed 100 tests.
  11727. 658.86 s [vector] elem: OK
  11728. 658.86 s [vector] +++ OK, passed 100 tests.
  11729. 658.86 s [vector] notElem: OK
  11730. 658.86 s [vector] +++ OK, passed 100 tests.
  11731. 658.86 s [vector] find: OK
  11732. 658.86 s [vector] +++ OK, passed 100 tests.
  11733. 658.86 s [vector] findIndex: OK
  11734. 658.86 s [vector] +++ OK, passed 100 tests.
  11735. 658.86 s [vector] findIndexR: OK
  11736. 658.86 s [vector] +++ OK, passed 100 tests.
  11737. 658.86 s [vector] findIndices: OK
  11738. 658.86 s [vector] +++ OK, passed 100 tests.
  11739. 658.86 s [vector] elemIndex: OK
  11740. 658.86 s [vector] +++ OK, passed 100 tests.
  11741. 658.86 s [vector] elemIndices: OK
  11742. 658.86 s [vector] +++ OK, passed 100 tests.
  11743. 658.87 s [vector] foldl: OK
  11744. 658.87 s [vector] +++ OK, passed 100 tests.
  11745. 658.87 s [vector] foldl1: OK
  11746. 658.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11747. 658.87 s [vector] foldl': OK
  11748. 658.87 s [vector] +++ OK, passed 100 tests.
  11749. 658.87 s [vector] foldl1': OK
  11750. 658.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11751. 658.87 s [vector] foldr: OK
  11752. 658.87 s [vector] +++ OK, passed 100 tests.
  11753. 658.87 s [vector] foldr1: OK
  11754. 658.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11755. 658.87 s [vector] foldr': OK
  11756. 658.87 s [vector] +++ OK, passed 100 tests.
  11757. 658.88 s [vector] foldr1': OK
  11758. 658.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11759. 658.88 s [vector] ifoldl: OK
  11760. 658.88 s [vector] +++ OK, passed 100 tests.
  11761. 658.88 s [vector] ifoldl': OK
  11762. 658.88 s [vector] +++ OK, passed 100 tests.
  11763. 658.88 s [vector] ifoldr: OK
  11764. 658.89 s [vector] +++ OK, passed 100 tests.
  11765. 658.89 s [vector] ifoldr': OK
  11766. 658.89 s [vector] +++ OK, passed 100 tests.
  11767. 658.89 s [vector] ifoldM: OK
  11768. 658.89 s [vector] +++ OK, passed 100 tests.
  11769. 658.89 s [vector] ifoldM': OK
  11770. 658.89 s [vector] +++ OK, passed 100 tests.
  11771. 658.91 s [vector] ifoldM_: OK (0.02s)
  11772. 658.91 s [vector] +++ OK, passed 100 tests.
  11773. 658.93 s [vector] ifoldM'_: OK (0.02s)
  11774. 658.93 s [vector] +++ OK, passed 100 tests.
  11775. 658.93 s [vector] all: OK
  11776. 658.93 s [vector] +++ OK, passed 100 tests.
  11777. 658.93 s [vector] any: OK
  11778. 658.93 s [vector] +++ OK, passed 100 tests.
  11779. 658.93 s [vector] prescanl: OK
  11780. 658.93 s [vector] +++ OK, passed 100 tests.
  11781. 658.93 s [vector] prescanl': OK
  11782. 658.94 s [vector] +++ OK, passed 100 tests.
  11783. 658.94 s [vector] postscanl: OK
  11784. 658.94 s [vector] +++ OK, passed 100 tests.
  11785. 658.94 s [vector] postscanl': OK
  11786. 658.94 s [vector] +++ OK, passed 100 tests.
  11787. 658.94 s [vector] scanl: OK
  11788. 658.94 s [vector] +++ OK, passed 100 tests.
  11789. 658.94 s [vector] scanl': OK
  11790. 658.94 s [vector] +++ OK, passed 100 tests.
  11791. 658.94 s [vector] scanl1: OK
  11792. 658.95 s [vector] +++ OK, passed 100 tests.
  11793. 658.95 s [vector] scanl1': OK
  11794. 658.95 s [vector] +++ OK, passed 100 tests.
  11795. 658.95 s [vector] iscanl: OK
  11796. 658.95 s [vector] +++ OK, passed 100 tests.
  11797. 658.95 s [vector] iscanl': OK
  11798. 658.96 s [vector] +++ OK, passed 100 tests.
  11799. 658.96 s [vector] prescanr: OK
  11800. 658.96 s [vector] +++ OK, passed 100 tests.
  11801. 658.96 s [vector] prescanr': OK
  11802. 658.96 s [vector] +++ OK, passed 100 tests.
  11803. 658.96 s [vector] postscanr: OK
  11804. 658.96 s [vector] +++ OK, passed 100 tests.
  11805. 658.96 s [vector] postscanr': OK
  11806. 658.97 s [vector] +++ OK, passed 100 tests.
  11807. 658.97 s [vector] scanr: OK
  11808. 658.97 s [vector] +++ OK, passed 100 tests.
  11809. 658.97 s [vector] scanr': OK
  11810. 658.97 s [vector] +++ OK, passed 100 tests.
  11811. 658.97 s [vector] scanr1: OK
  11812. 658.97 s [vector] +++ OK, passed 100 tests.
  11813. 658.97 s [vector] scanr1': OK
  11814. 658.98 s [vector] +++ OK, passed 100 tests.
  11815. 658.98 s [vector] iscanr: OK
  11816. 658.98 s [vector] +++ OK, passed 100 tests.
  11817. 658.98 s [vector] iscanr': OK
  11818. 658.98 s [vector] +++ OK, passed 100 tests.
  11819. 658.98 s [vector] mut_read: OK
  11820. 658.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11821. 658.98 s [vector] mut_write: OK
  11822. 658.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11823. 658.98 s [vector] mut_modify: OK
  11824. 658.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11825. 658.99 s [vector] mut_generate: OK
  11826. 658.99 s [vector] +++ OK, passed 100 tests.
  11827. 659.01 s [vector] mut_generateM: OK
  11828. 659.01 s [vector] +++ OK, passed 100 tests.
  11829. 659.02 s [vector] mut_mapM_: OK (0.02s)
  11830. 659.02 s [vector] +++ OK, passed 100 tests.
  11831. 659.03 s [vector] mut_imapM_: OK (0.01s)
  11832. 659.03 s [vector] +++ OK, passed 100 tests.
  11833. 659.05 s [vector] mut_forM_: OK (0.02s)
  11834. 659.05 s [vector] +++ OK, passed 100 tests.
  11835. 659.06 s [vector] mut_iforM_: OK (0.02s)
  11836. 659.06 s [vector] +++ OK, passed 100 tests.
  11837. 659.06 s [vector] mut_foldr: OK
  11838. 659.06 s [vector] +++ OK, passed 100 tests.
  11839. 659.06 s [vector] mut_foldr': OK
  11840. 659.06 s [vector] +++ OK, passed 100 tests.
  11841. 659.07 s [vector] mut_foldl: OK
  11842. 659.07 s [vector] +++ OK, passed 100 tests.
  11843. 659.07 s [vector] mut_foldl': OK
  11844. 659.07 s [vector] +++ OK, passed 100 tests.
  11845. 659.07 s [vector] mut_ifoldr: OK
  11846. 659.07 s [vector] +++ OK, passed 100 tests.
  11847. 659.07 s [vector] mut_ifoldr': OK
  11848. 659.07 s [vector] +++ OK, passed 100 tests.
  11849. 659.08 s [vector] mut_ifoldl: OK
  11850. 659.08 s [vector] +++ OK, passed 100 tests.
  11851. 659.08 s [vector] mut_ifoldl': OK
  11852. 659.08 s [vector] +++ OK, passed 100 tests.
  11853. 659.08 s [vector] mut_foldM: OK
  11854. 659.08 s [vector] +++ OK, passed 100 tests.
  11855. 659.08 s [vector] mut_foldM': OK
  11856. 659.08 s [vector] +++ OK, passed 100 tests.
  11857. 659.08 s [vector] mut_foldrM: OK
  11858. 659.08 s [vector] +++ OK, passed 100 tests.
  11859. 659.08 s [vector] mut_foldrM': OK
  11860. 659.08 s [vector] +++ OK, passed 100 tests.
  11861. 659.08 s [vector] mut_ifoldM: OK
  11862. 659.09 s [vector] +++ OK, passed 100 tests.
  11863. 659.09 s [vector] mut_ifoldM': OK
  11864. 659.09 s [vector] +++ OK, passed 100 tests.
  11865. 659.09 s [vector] mut_ifoldrM: OK
  11866. 659.09 s [vector] +++ OK, passed 100 tests.
  11867. 659.09 s [vector] mut_ifoldrM': OK
  11868. 659.09 s [vector] +++ OK, passed 100 tests.
  11869. 659.09 s [vector] compare: OK
  11870. 659.09 s [vector] +++ OK, passed 100 tests.
  11871. 659.10 s [vector] maximum: OK
  11872. 659.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11873. 659.10 s [vector] minimum: OK
  11874. 659.10 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11875. 659.10 s [vector] minIndex: OK
  11876. 659.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11877. 659.10 s [vector] maxIndex: OK
  11878. 659.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11879. 659.10 s [vector] maximumBy: OK
  11880. 659.10 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11881. 659.10 s [vector] minimumBy: OK
  11882. 659.10 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11883. 659.10 s [vector] maximumOn: OK
  11884. 659.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11885. 659.10 s [vector] minimumOn: OK
  11886. 659.10 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11887. 659.10 s [vector] maxIndexBy: OK
  11888. 659.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11889. 659.10 s [vector] minIndexBy: OK
  11890. 659.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11891. 659.10 s [vector] ListFirstMaxIndexWins: OK
  11892. 659.11 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11893. 659.11 s [vector] FalseListFirstMaxIndexWins: OK
  11894. 659.11 s [vector] +++ OK, failed as expected. (after 1 test):
  11895. 659.11 s [vector] Exception:
  11896. 659.11 s [vector] Prelude.foldr1: empty list
  11897. 659.11 s [vector] CallStack (from HasCallStack):
  11898. 659.11 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11899. 659.11 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11900. 659.11 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11901. 659.11 s [vector] []
  11902. 659.11 s [vector] zip: OK
  11903. 659.11 s [vector] +++ OK, passed 100 tests.
  11904. 659.11 s [vector] zip3: OK
  11905. 659.11 s [vector] +++ OK, passed 100 tests.
  11906. 659.11 s [vector] unzip: OK
  11907. 659.11 s [vector] +++ OK, passed 100 tests.
  11908. 659.11 s [vector] unzip3: OK
  11909. 659.11 s [vector] +++ OK, passed 100 tests.
  11910. 659.12 s [vector] indexed: OK
  11911. 659.12 s [vector] +++ OK, passed 100 tests.
  11912. 659.12 s [vector] update: OK
  11913. 659.12 s [vector] +++ OK, passed 100 tests.
  11914. 659.12 s [vector] mempty: OK
  11915. 659.12 s [vector] +++ OK, passed 100 tests.
  11916. 659.12 s [vector] mappend: OK
  11917. 659.13 s [vector] +++ OK, passed 100 tests.
  11918. 659.15 s [vector] mconcat: OK (0.02s)
  11919. 659.15 s [vector] +++ OK, passed 100 tests.
  11920. 659.16 s [vector] glength: OK (0.01s)
  11921. 659.16 s [vector] +++ OK, passed 100 tests.
  11922. 659.16 s [vector] and: OK
  11923. 659.16 s [vector] +++ OK, passed 100 tests.
  11924. 659.16 s [vector] or: OK
  11925. 659.17 s [vector] +++ OK, passed 100 tests.
  11926. 659.17 s [vector] (Int)
  11927. 659.17 s [vector] fromList.toList == id: OK
  11928. 659.17 s [vector] +++ OK, passed 100 tests.
  11929. 659.17 s [vector] toList.fromList == id: OK
  11930. 659.17 s [vector] +++ OK, passed 100 tests.
  11931. 659.17 s [vector] unstream.stream == id: OK
  11932. 659.18 s [vector] +++ OK, passed 100 tests.
  11933. 659.18 s [vector] stream.unstream == id: OK
  11934. 659.18 s [vector] +++ OK, passed 100 tests.
  11935. 659.19 s [vector] eq: OK
  11936. 659.19 s [vector] +++ OK, passed 100 tests.
  11937. 659.19 s [vector] length: OK
  11938. 659.19 s [vector] +++ OK, passed 100 tests.
  11939. 659.19 s [vector] null: OK
  11940. 659.20 s [vector] +++ OK, passed 100 tests.
  11941. 659.20 s [vector] index: OK
  11942. 659.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11943. 659.20 s [vector] safeIndex: OK
  11944. 659.21 s [vector] +++ OK, passed 100 tests.
  11945. 659.21 s [vector] head: OK
  11946. 659.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11947. 659.21 s [vector] last: OK
  11948. 659.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11949. 659.22 s [vector] unsafeIndex: OK
  11950. 659.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11951. 659.23 s [vector] unsafeHead: OK
  11952. 659.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11953. 659.23 s [vector] unsafeLast: OK
  11954. 659.23 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11955. 659.24 s [vector] slice: OK
  11956. 659.24 s [vector] +++ OK, passed 100 tests.
  11957. 659.25 s [vector] init: OK
  11958. 659.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11959. 659.25 s [vector] tail: OK
  11960. 659.25 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11961. 659.25 s [vector] take: OK
  11962. 659.25 s [vector] +++ OK, passed 100 tests.
  11963. 659.25 s [vector] drop: OK
  11964. 659.26 s [vector] +++ OK, passed 100 tests.
  11965. 659.26 s [vector] splitAt: OK
  11966. 659.26 s [vector] +++ OK, passed 100 tests.
  11967. 659.26 s [vector] empty: OK
  11968. 659.26 s [vector] +++ OK, passed 100 tests.
  11969. 659.26 s [vector] singleton: OK
  11970. 659.26 s [vector] +++ OK, passed 100 tests.
  11971. 659.26 s [vector] replicate: OK
  11972. 659.26 s [vector] +++ OK, passed 100 tests.
  11973. 659.26 s [vector] generate: OK
  11974. 659.26 s [vector] +++ OK, passed 100 tests.
  11975. 659.26 s [vector] iterateN: OK
  11976. 659.27 s [vector] +++ OK, passed 100 tests.
  11977. 659.32 s [vector] iterateNM: OK (0.05s)
  11978. 659.32 s [vector] +++ OK, passed 100 tests.
  11979. 659.35 s [vector] generateM: OK (0.02s)
  11980. 659.35 s [vector] +++ OK, passed 100 tests.
  11981. 659.36 s [vector] replicateM: OK (0.03s)
  11982. 659.36 s [vector] +++ OK, passed 100 tests.
  11983. 659.36 s [vector] create: OK
  11984. 659.36 s [vector] +++ OK, passed 100 tests.
  11985. 659.36 s [vector] createT: OK
  11986. 659.36 s [vector] +++ OK, passed 100 tests.
  11987. 659.36 s [vector] unfoldr: OK
  11988. 659.36 s [vector] +++ OK, passed 100 tests.
  11989. 659.36 s [vector] unfoldrN: OK
  11990. 659.37 s [vector] +++ OK, passed 100 tests.
  11991. 659.37 s [vector] unfoldrExactN: OK
  11992. 659.37 s [vector] +++ OK, passed 100 tests.
  11993. 659.37 s [vector] unfoldrM: OK
  11994. 659.37 s [vector] +++ OK, passed 100 tests.
  11995. 659.37 s [vector] unfoldrNM: OK
  11996. 659.37 s [vector] +++ OK, passed 100 tests.
  11997. 659.41 s [vector] unfoldrExactNM: OK (0.03s)
  11998. 659.41 s [vector] +++ OK, passed 100 tests.
  11999. 659.41 s [vector] constructN: OK
  12000. 659.41 s [vector] +++ OK, passed 100 tests.
  12001. 659.41 s [vector] constructrN: OK
  12002. 659.41 s [vector] +++ OK, passed 100 tests.
  12003. 659.41 s [vector] cons: OK
  12004. 659.41 s [vector] +++ OK, passed 100 tests.
  12005. 659.41 s [vector] snoc: OK
  12006. 659.41 s [vector] +++ OK, passed 100 tests.
  12007. 659.41 s [vector] append: OK
  12008. 659.41 s [vector] +++ OK, passed 100 tests.
  12009. 659.43 s [vector] concat: OK (0.02s)
  12010. 659.43 s [vector] +++ OK, passed 100 tests.
  12011. 659.44 s [vector] force: OK
  12012. 659.44 s [vector] +++ OK, passed 100 tests.
  12013. 659.44 s [vector] upd: OK
  12014. 659.44 s [vector] +++ OK, passed 100 tests.
  12015. 659.44 s [vector] accum: OK
  12016. 659.44 s [vector] +++ OK, passed 100 tests.
  12017. 659.44 s [vector] reverse: OK
  12018. 659.44 s [vector] +++ OK, passed 100 tests.
  12019. 659.44 s [vector] backpermute: OK
  12020. 659.44 s [vector] +++ OK, passed 100 tests.
  12021. 659.44 s [vector] map: OK
  12022. 659.44 s [vector] +++ OK, passed 100 tests.
  12023. 659.44 s [vector] imap: OK
  12024. 659.44 s [vector] +++ OK, passed 100 tests.
  12025. 659.44 s [vector] concatMap: OK
  12026. 659.45 s [vector] +++ OK, passed 100 tests.
  12027. 659.45 s [vector] mapM: OK
  12028. 659.45 s [vector] +++ OK, passed 100 tests.
  12029. 659.47 s [vector] mapM_: OK (0.02s)
  12030. 659.47 s [vector] +++ OK, passed 100 tests.
  12031. 659.48 s [vector] forM: OK
  12032. 659.48 s [vector] +++ OK, passed 100 tests.
  12033. 659.48 s [vector] forM_: OK (0.01s)
  12034. 659.48 s [vector] +++ OK, passed 100 tests.
  12035. 659.48 s [vector] imapM: OK
  12036. 659.49 s [vector] +++ OK, passed 100 tests.
  12037. 659.51 s [vector] imapM_: OK (0.02s)
  12038. 659.51 s [vector] +++ OK, passed 100 tests.
  12039. 659.51 s [vector] zipWith: OK
  12040. 659.51 s [vector] +++ OK, passed 100 tests.
  12041. 659.51 s [vector] zipWith3: OK
  12042. 659.52 s [vector] +++ OK, passed 100 tests.
  12043. 659.52 s [vector] izipWith: OK
  12044. 659.53 s [vector] +++ OK, passed 100 tests.
  12045. 659.53 s [vector] izipWith3: OK
  12046. 659.53 s [vector] +++ OK, passed 100 tests.
  12047. 659.54 s [vector] izipWithM: OK
  12048. 659.54 s [vector] +++ OK, passed 100 tests.
  12049. 659.55 s [vector] izipWithM_: OK (0.02s)
  12050. 659.55 s [vector] +++ OK, passed 100 tests.
  12051. 659.55 s [vector] zipWithM: OK
  12052. 659.55 s [vector] +++ OK, passed 100 tests.
  12053. 659.58 s [vector] zipWithM_: OK (0.02s)
  12054. 659.58 s [vector] +++ OK, passed 100 tests.
  12055. 659.58 s [vector] filter: OK
  12056. 659.58 s [vector] +++ OK, passed 100 tests.
  12057. 659.58 s [vector] ifilter: OK
  12058. 659.60 s [vector] +++ OK, passed 100 tests.
  12059. 659.62 s [vector] filterM: OK (0.04s)
  12060. 659.62 s [vector] +++ OK, passed 100 tests.
  12061. 659.62 s [vector] uniq: OK
  12062. 659.62 s [vector] +++ OK, passed 100 tests.
  12063. 659.62 s [vector] mapMaybe: OK
  12064. 659.63 s [vector] +++ OK, passed 100 tests.
  12065. 659.63 s [vector] imapMaybe: OK
  12066. 659.63 s [vector] +++ OK, passed 100 tests.
  12067. 659.63 s [vector] takeWhile: OK
  12068. 659.63 s [vector] +++ OK, passed 100 tests.
  12069. 659.63 s [vector] dropWhile: OK
  12070. 659.63 s [vector] +++ OK, passed 100 tests.
  12071. 659.63 s [vector] partition: OK
  12072. 659.63 s [vector] +++ OK, passed 100 tests.
  12073. 659.63 s [vector] partitionWith: OK
  12074. 659.63 s [vector] +++ OK, passed 100 tests.
  12075. 659.63 s [vector] span: OK
  12076. 659.63 s [vector] +++ OK, passed 100 tests.
  12077. 659.63 s [vector] break: OK
  12078. 659.64 s [vector] +++ OK, passed 100 tests.
  12079. 659.64 s [vector] spanR: OK
  12080. 659.64 s [vector] +++ OK, passed 100 tests.
  12081. 659.64 s [vector] breakR: OK
  12082. 659.64 s [vector] +++ OK, passed 100 tests.
  12083. 659.64 s [vector] groupBy: OK
  12084. 659.64 s [vector] +++ OK, passed 100 tests.
  12085. 659.64 s [vector] elem: OK
  12086. 659.64 s [vector] +++ OK, passed 100 tests.
  12087. 659.64 s [vector] notElem: OK
  12088. 659.64 s [vector] +++ OK, passed 100 tests.
  12089. 659.65 s [vector] find: OK
  12090. 659.65 s [vector] +++ OK, passed 100 tests.
  12091. 659.65 s [vector] findIndex: OK
  12092. 659.65 s [vector] +++ OK, passed 100 tests.
  12093. 659.65 s [vector] findIndexR: OK
  12094. 659.65 s [vector] +++ OK, passed 100 tests.
  12095. 659.65 s [vector] findIndices: OK
  12096. 659.65 s [vector] +++ OK, passed 100 tests.
  12097. 659.65 s [vector] elemIndex: OK
  12098. 659.65 s [vector] +++ OK, passed 100 tests.
  12099. 659.65 s [vector] elemIndices: OK
  12100. 659.66 s [vector] +++ OK, passed 100 tests.
  12101. 659.66 s [vector] foldl: OK
  12102. 659.66 s [vector] +++ OK, passed 100 tests.
  12103. 659.66 s [vector] foldl1: OK
  12104. 659.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12105. 659.66 s [vector] foldl': OK
  12106. 659.66 s [vector] +++ OK, passed 100 tests.
  12107. 659.66 s [vector] foldl1': OK
  12108. 659.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12109. 659.67 s [vector] foldr: OK
  12110. 659.67 s [vector] +++ OK, passed 100 tests.
  12111. 659.67 s [vector] foldr1: OK
  12112. 659.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12113. 659.68 s [vector] foldr': OK
  12114. 659.68 s [vector] +++ OK, passed 100 tests.
  12115. 659.68 s [vector] foldr1': OK
  12116. 659.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12117. 659.69 s [vector] ifoldl: OK
  12118. 659.69 s [vector] +++ OK, passed 100 tests.
  12119. 659.69 s [vector] ifoldl': OK
  12120. 659.69 s [vector] +++ OK, passed 100 tests.
  12121. 659.69 s [vector] ifoldr: OK
  12122. 659.69 s [vector] +++ OK, passed 100 tests.
  12123. 659.70 s [vector] ifoldr': OK
  12124. 659.70 s [vector] +++ OK, passed 100 tests.
  12125. 659.71 s [vector] ifoldM: OK
  12126. 659.71 s [vector] +++ OK, passed 100 tests.
  12127. 659.71 s [vector] ifoldM': OK
  12128. 659.72 s [vector] +++ OK, passed 100 tests.
  12129. 659.75 s [vector] ifoldM_: OK (0.03s)
  12130. 659.75 s [vector] +++ OK, passed 100 tests.
  12131. 659.76 s [vector] ifoldM'_: OK (0.03s)
  12132. 659.76 s [vector] +++ OK, passed 100 tests.
  12133. 659.76 s [vector] all: OK
  12134. 659.76 s [vector] +++ OK, passed 100 tests.
  12135. 659.76 s [vector] any: OK
  12136. 659.76 s [vector] +++ OK, passed 100 tests.
  12137. 659.76 s [vector] prescanl: OK
  12138. 659.77 s [vector] +++ OK, passed 100 tests.
  12139. 659.77 s [vector] prescanl': OK
  12140. 659.77 s [vector] +++ OK, passed 100 tests.
  12141. 659.78 s [vector] postscanl: OK
  12142. 659.78 s [vector] +++ OK, passed 100 tests.
  12143. 659.78 s [vector] postscanl': OK
  12144. 659.78 s [vector] +++ OK, passed 100 tests.
  12145. 659.79 s [vector] scanl: OK
  12146. 659.79 s [vector] +++ OK, passed 100 tests.
  12147. 659.79 s [vector] scanl': OK
  12148. 659.79 s [vector] +++ OK, passed 100 tests.
  12149. 659.79 s [vector] scanl1: OK
  12150. 659.79 s [vector] +++ OK, passed 100 tests.
  12151. 659.80 s [vector] scanl1': OK
  12152. 659.80 s [vector] +++ OK, passed 100 tests.
  12153. 659.81 s [vector] iscanl: OK
  12154. 659.81 s [vector] +++ OK, passed 100 tests.
  12155. 659.81 s [vector] iscanl': OK
  12156. 659.81 s [vector] +++ OK, passed 100 tests.
  12157. 659.81 s [vector] prescanr: OK
  12158. 659.81 s [vector] +++ OK, passed 100 tests.
  12159. 659.81 s [vector] prescanr': OK
  12160. 659.82 s [vector] +++ OK, passed 100 tests.
  12161. 659.82 s [vector] postscanr: OK
  12162. 659.82 s [vector] +++ OK, passed 100 tests.
  12163. 659.83 s [vector] postscanr': OK
  12164. 659.83 s [vector] +++ OK, passed 100 tests.
  12165. 659.83 s [vector] scanr: OK
  12166. 659.83 s [vector] +++ OK, passed 100 tests.
  12167. 659.83 s [vector] scanr': OK
  12168. 659.83 s [vector] +++ OK, passed 100 tests.
  12169. 659.83 s [vector] scanr1: OK
  12170. 659.83 s [vector] +++ OK, passed 100 tests.
  12171. 659.84 s [vector] scanr1': OK
  12172. 659.84 s [vector] +++ OK, passed 100 tests.
  12173. 659.84 s [vector] iscanr: OK
  12174. 659.84 s [vector] +++ OK, passed 100 tests.
  12175. 659.84 s [vector] iscanr': OK
  12176. 659.84 s [vector] +++ OK, passed 100 tests.
  12177. 659.84 s [vector] mut_read: OK
  12178. 659.84 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12179. 659.84 s [vector] mut_write: OK
  12180. 659.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12181. 659.84 s [vector] mut_modify: OK
  12182. 659.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12183. 659.85 s [vector] mut_generate: OK
  12184. 659.85 s [vector] +++ OK, passed 100 tests.
  12185. 659.85 s [vector] mut_generateM: OK
  12186. 659.85 s [vector] +++ OK, passed 100 tests.
  12187. 659.87 s [vector] mut_mapM_: OK (0.02s)
  12188. 659.88 s [vector] +++ OK, passed 100 tests.
  12189. 659.89 s [vector] mut_imapM_: OK (0.02s)
  12190. 659.89 s [vector] +++ OK, passed 100 tests.
  12191. 659.91 s [vector] mut_forM_: OK (0.02s)
  12192. 659.91 s [vector] +++ OK, passed 100 tests.
  12193. 659.92 s [vector] mut_iforM_: OK (0.02s)
  12194. 659.92 s [vector] +++ OK, passed 100 tests.
  12195. 659.92 s [vector] mut_foldr: OK
  12196. 659.92 s [vector] +++ OK, passed 100 tests.
  12197. 659.92 s [vector] mut_foldr': OK
  12198. 659.92 s [vector] +++ OK, passed 100 tests.
  12199. 659.92 s [vector] mut_foldl: OK
  12200. 659.92 s [vector] +++ OK, passed 100 tests.
  12201. 659.92 s [vector] mut_foldl': OK
  12202. 659.93 s [vector] +++ OK, passed 100 tests.
  12203. 659.93 s [vector] mut_ifoldr: OK
  12204. 659.93 s [vector] +++ OK, passed 100 tests.
  12205. 659.93 s [vector] mut_ifoldr': OK
  12206. 659.93 s [vector] +++ OK, passed 100 tests.
  12207. 659.94 s [vector] mut_ifoldl: OK
  12208. 659.94 s [vector] +++ OK, passed 100 tests.
  12209. 659.94 s [vector] mut_ifoldl': OK
  12210. 659.94 s [vector] +++ OK, passed 100 tests.
  12211. 659.94 s [vector] mut_foldM: OK
  12212. 659.94 s [vector] +++ OK, passed 100 tests.
  12213. 659.94 s [vector] mut_foldM': OK
  12214. 659.94 s [vector] +++ OK, passed 100 tests.
  12215. 659.94 s [vector] mut_foldrM: OK
  12216. 659.95 s [vector] +++ OK, passed 100 tests.
  12217. 659.95 s [vector] mut_foldrM': OK
  12218. 659.95 s [vector] +++ OK, passed 100 tests.
  12219. 659.95 s [vector] mut_ifoldM: OK
  12220. 659.95 s [vector] +++ OK, passed 100 tests.
  12221. 659.95 s [vector] mut_ifoldM': OK
  12222. 659.95 s [vector] +++ OK, passed 100 tests.
  12223. 659.95 s [vector] mut_ifoldrM: OK
  12224. 659.96 s [vector] +++ OK, passed 100 tests.
  12225. 659.96 s [vector] mut_ifoldrM': OK
  12226. 659.96 s [vector] +++ OK, passed 100 tests.
  12227. 659.96 s [vector] compare: OK
  12228. 659.96 s [vector] +++ OK, passed 100 tests.
  12229. 659.96 s [vector] maximum: OK
  12230. 659.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12231. 659.96 s [vector] minimum: OK
  12232. 659.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12233. 659.96 s [vector] minIndex: OK
  12234. 659.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12235. 659.96 s [vector] maxIndex: OK
  12236. 659.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12237. 659.96 s [vector] maximumBy: OK
  12238. 659.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12239. 659.96 s [vector] minimumBy: OK
  12240. 659.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12241. 659.97 s [vector] maximumOn: OK
  12242. 659.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12243. 659.97 s [vector] minimumOn: OK
  12244. 659.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12245. 659.97 s [vector] maxIndexBy: OK
  12246. 659.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12247. 659.97 s [vector] minIndexBy: OK
  12248. 659.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12249. 659.97 s [vector] ListFirstMaxIndexWins: OK
  12250. 659.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12251. 659.97 s [vector] FalseListFirstMaxIndexWins: OK
  12252. 659.97 s [vector] +++ OK, failed as expected. (after 1 test):
  12253. 659.97 s [vector] Exception:
  12254. 659.97 s [vector] Prelude.foldr1: empty list
  12255. 659.97 s [vector] CallStack (from HasCallStack):
  12256. 659.97 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12257. 659.97 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12258. 659.97 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12259. 659.97 s [vector] []
  12260. 659.97 s [vector] zip: OK
  12261. 659.97 s [vector] +++ OK, passed 100 tests.
  12262. 659.97 s [vector] zip3: OK
  12263. 659.97 s [vector] +++ OK, passed 100 tests.
  12264. 659.97 s [vector] unzip: OK
  12265. 659.97 s [vector] +++ OK, passed 100 tests.
  12266. 659.98 s [vector] unzip3: OK
  12267. 659.98 s [vector] +++ OK, passed 100 tests.
  12268. 659.98 s [vector] indexed: OK
  12269. 659.98 s [vector] +++ OK, passed 100 tests.
  12270. 659.98 s [vector] update: OK
  12271. 659.98 s [vector] +++ OK, passed 100 tests.
  12272. 659.98 s [vector] mempty: OK
  12273. 659.98 s [vector] +++ OK, passed 100 tests.
  12274. 659.98 s [vector] mappend: OK
  12275. 659.99 s [vector] +++ OK, passed 100 tests.
  12276. 660.00 s [vector] mconcat: OK (0.01s)
  12277. 660.00 s [vector] +++ OK, passed 100 tests.
  12278. 660.00 s [vector] glength: OK
  12279. 660.00 s [vector] +++ OK, passed 100 tests.
  12280. 660.00 s [vector] sum: OK
  12281. 660.00 s [vector] +++ OK, passed 100 tests.
  12282. 660.00 s [vector] product: OK
  12283. 660.00 s [vector] +++ OK, passed 100 tests.
  12284. 660.00 s [vector] enumFromN: OK
  12285. 660.00 s [vector] +++ OK, passed 100 tests.
  12286. 660.00 s [vector] enumFromThenN: OK
  12287. 660.00 s [vector] +++ OK, passed 100 tests.
  12288. 660.00 s [vector] enumFromTo: OK
  12289. 660.00 s [vector] +++ OK, passed 100 tests.
  12290. 660.00 s [vector] enumFromThenTo: OK
  12291. 660.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12292. 660.00 s [vector] (Float)
  12293. 660.00 s [vector] fromList.toList == id: OK
  12294. 660.00 s [vector] +++ OK, passed 100 tests.
  12295. 660.00 s [vector] toList.fromList == id: OK
  12296. 660.00 s [vector] +++ OK, passed 100 tests.
  12297. 660.00 s [vector] unstream.stream == id: OK
  12298. 660.00 s [vector] +++ OK, passed 100 tests.
  12299. 660.00 s [vector] stream.unstream == id: OK
  12300. 660.01 s [vector] +++ OK, passed 100 tests.
  12301. 660.01 s [vector] eq: OK
  12302. 660.01 s [vector] +++ OK, passed 100 tests.
  12303. 660.01 s [vector] length: OK
  12304. 660.01 s [vector] +++ OK, passed 100 tests.
  12305. 660.01 s [vector] null: OK
  12306. 660.01 s [vector] +++ OK, passed 100 tests.
  12307. 660.01 s [vector] index: OK
  12308. 660.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12309. 660.01 s [vector] safeIndex: OK
  12310. 660.01 s [vector] +++ OK, passed 100 tests.
  12311. 660.01 s [vector] head: OK
  12312. 660.01 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12313. 660.01 s [vector] last: OK
  12314. 660.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12315. 660.01 s [vector] unsafeIndex: OK
  12316. 660.01 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12317. 660.01 s [vector] unsafeHead: OK
  12318. 660.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12319. 660.01 s [vector] unsafeLast: OK
  12320. 660.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12321. 660.01 s [vector] slice: OK
  12322. 660.02 s [vector] +++ OK, passed 100 tests.
  12323. 660.02 s [vector] init: OK
  12324. 660.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12325. 660.02 s [vector] tail: OK
  12326. 660.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12327. 660.02 s [vector] take: OK
  12328. 660.02 s [vector] +++ OK, passed 100 tests.
  12329. 660.02 s [vector] drop: OK
  12330. 660.02 s [vector] +++ OK, passed 100 tests.
  12331. 660.02 s [vector] splitAt: OK
  12332. 660.02 s [vector] +++ OK, passed 100 tests.
  12333. 660.02 s [vector] empty: OK
  12334. 660.02 s [vector] +++ OK, passed 100 tests.
  12335. 660.02 s [vector] singleton: OK
  12336. 660.02 s [vector] +++ OK, passed 100 tests.
  12337. 660.03 s [vector] replicate: OK
  12338. 660.03 s [vector] +++ OK, passed 100 tests.
  12339. 660.03 s [vector] generate: OK
  12340. 660.03 s [vector] +++ OK, passed 100 tests.
  12341. 660.04 s [vector] iterateN: OK
  12342. 660.04 s [vector] +++ OK, passed 100 tests.
  12343. 660.07 s [vector] iterateNM: OK (0.04s)
  12344. 660.07 s [vector] +++ OK, passed 100 tests.
  12345. 660.09 s [vector] generateM: OK (0.03s)
  12346. 660.10 s [vector] +++ OK, passed 100 tests.
  12347. 660.13 s [vector] replicateM: OK (0.03s)
  12348. 660.13 s [vector] +++ OK, passed 100 tests.
  12349. 660.13 s [vector] create: OK
  12350. 660.13 s [vector] +++ OK, passed 100 tests.
  12351. 660.13 s [vector] createT: OK
  12352. 660.13 s [vector] +++ OK, passed 100 tests.
  12353. 660.13 s [vector] unfoldr: OK
  12354. 660.13 s [vector] +++ OK, passed 100 tests.
  12355. 660.13 s [vector] unfoldrN: OK
  12356. 660.13 s [vector] +++ OK, passed 100 tests.
  12357. 660.13 s [vector] unfoldrExactN: OK
  12358. 660.13 s [vector] +++ OK, passed 100 tests.
  12359. 660.13 s [vector] unfoldrM: OK
  12360. 660.13 s [vector] +++ OK, passed 100 tests.
  12361. 660.15 s [vector] unfoldrNM: OK
  12362. 660.15 s [vector] +++ OK, passed 100 tests.
  12363. 660.15 s [vector] unfoldrExactNM: OK (0.01s)
  12364. 660.15 s [vector] +++ OK, passed 100 tests.
  12365. 660.16 s [vector] constructN: OK
  12366. 660.17 s [vector] +++ OK, passed 100 tests.
  12367. 660.17 s [vector] constructrN: OK (0.01s)
  12368. 660.17 s [vector] +++ OK, passed 100 tests.
  12369. 660.17 s [vector] cons: OK
  12370. 660.17 s [vector] +++ OK, passed 100 tests.
  12371. 660.17 s [vector] snoc: OK
  12372. 660.17 s [vector] +++ OK, passed 100 tests.
  12373. 660.19 s [vector] append: OK
  12374. 660.19 s [vector] +++ OK, passed 100 tests.
  12375. 660.21 s [vector] concat: OK (0.03s)
  12376. 660.21 s [vector] +++ OK, passed 100 tests.
  12377. 660.21 s [vector] force: OK
  12378. 660.21 s [vector] +++ OK, passed 100 tests.
  12379. 660.21 s [vector] upd: OK
  12380. 660.21 s [vector] +++ OK, passed 100 tests.
  12381. 660.23 s [vector] accum: OK (0.01s)
  12382. 660.23 s [vector] +++ OK, passed 100 tests.
  12383. 660.23 s [vector] reverse: OK
  12384. 660.23 s [vector] +++ OK, passed 100 tests.
  12385. 660.23 s [vector] backpermute: OK
  12386. 660.23 s [vector] +++ OK, passed 100 tests.
  12387. 660.23 s [vector] map: OK
  12388. 660.24 s [vector] +++ OK, passed 100 tests.
  12389. 660.25 s [vector] imap: OK
  12390. 660.25 s [vector] +++ OK, passed 100 tests.
  12391. 660.25 s [vector] concatMap: OK
  12392. 660.25 s [vector] +++ OK, passed 100 tests.
  12393. 660.25 s [vector] mapM: OK
  12394. 660.25 s [vector] +++ OK, passed 100 tests.
  12395. 660.29 s [vector] mapM_: OK (0.04s)
  12396. 660.29 s [vector] +++ OK, passed 100 tests.
  12397. 660.31 s [vector] forM: OK
  12398. 660.31 s [vector] +++ OK, passed 100 tests.
  12399. 660.33 s [vector] forM_: OK (0.04s)
  12400. 660.33 s [vector] +++ OK, passed 100 tests.
  12401. 660.35 s [vector] imapM: OK
  12402. 660.35 s [vector] +++ OK, passed 100 tests.
  12403. 660.37 s [vector] imapM_: OK (0.03s)
  12404. 660.37 s [vector] +++ OK, passed 100 tests.
  12405. 660.39 s [vector] zipWith: OK
  12406. 660.39 s [vector] +++ OK, passed 100 tests.
  12407. 660.39 s [vector] zipWith3: OK
  12408. 660.39 s [vector] +++ OK, passed 100 tests.
  12409. 660.40 s [vector] izipWith: OK
  12410. 660.40 s [vector] +++ OK, passed 100 tests.
  12411. 660.41 s [vector] izipWith3: OK
  12412. 660.41 s [vector] +++ OK, passed 100 tests.
  12413. 660.41 s [vector] izipWithM: OK
  12414. 660.41 s [vector] +++ OK, passed 100 tests.
  12415. 660.44 s [vector] izipWithM_: OK (0.03s)
  12416. 660.44 s [vector] +++ OK, passed 100 tests.
  12417. 660.45 s [vector] zipWithM: OK
  12418. 660.45 s [vector] +++ OK, passed 100 tests.
  12419. 660.47 s [vector] zipWithM_: OK (0.02s)
  12420. 660.47 s [vector] +++ OK, passed 100 tests.
  12421. 660.47 s [vector] filter: OK
  12422. 660.48 s [vector] +++ OK, passed 100 tests.
  12423. 660.48 s [vector] ifilter: OK
  12424. 660.49 s [vector] +++ OK, passed 100 tests.
  12425. 660.55 s [vector] filterM: OK (0.07s)
  12426. 660.55 s [vector] +++ OK, passed 100 tests.
  12427. 660.55 s [vector] uniq: OK
  12428. 660.55 s [vector] +++ OK, passed 100 tests.
  12429. 660.56 s [vector] mapMaybe: OK
  12430. 660.56 s [vector] +++ OK, passed 100 tests.
  12431. 660.56 s [vector] imapMaybe: OK
  12432. 660.56 s [vector] +++ OK, passed 100 tests.
  12433. 660.56 s [vector] takeWhile: OK
  12434. 660.57 s [vector] +++ OK, passed 100 tests.
  12435. 660.57 s [vector] dropWhile: OK
  12436. 660.57 s [vector] +++ OK, passed 100 tests.
  12437. 660.57 s [vector] partition: OK
  12438. 660.57 s [vector] +++ OK, passed 100 tests.
  12439. 660.58 s [vector] partitionWith: OK
  12440. 660.58 s [vector] +++ OK, passed 100 tests.
  12441. 660.58 s [vector] span: OK
  12442. 660.58 s [vector] +++ OK, passed 100 tests.
  12443. 660.58 s [vector] break: OK
  12444. 660.58 s [vector] +++ OK, passed 100 tests.
  12445. 660.58 s [vector] spanR: OK
  12446. 660.58 s [vector] +++ OK, passed 100 tests.
  12447. 660.58 s [vector] breakR: OK
  12448. 660.59 s [vector] +++ OK, passed 100 tests.
  12449. 660.59 s [vector] groupBy: OK
  12450. 660.59 s [vector] +++ OK, passed 100 tests.
  12451. 660.59 s [vector] elem: OK
  12452. 660.59 s [vector] +++ OK, passed 100 tests.
  12453. 660.59 s [vector] notElem: OK
  12454. 660.59 s [vector] +++ OK, passed 100 tests.
  12455. 660.59 s [vector] find: OK
  12456. 660.59 s [vector] +++ OK, passed 100 tests.
  12457. 660.59 s [vector] findIndex: OK
  12458. 660.59 s [vector] +++ OK, passed 100 tests.
  12459. 660.59 s [vector] findIndexR: OK
  12460. 660.60 s [vector] +++ OK, passed 100 tests.
  12461. 660.60 s [vector] findIndices: OK
  12462. 660.60 s [vector] +++ OK, passed 100 tests.
  12463. 660.60 s [vector] elemIndex: OK
  12464. 660.60 s [vector] +++ OK, passed 100 tests.
  12465. 660.60 s [vector] elemIndices: OK
  12466. 660.60 s [vector] +++ OK, passed 100 tests.
  12467. 660.61 s [vector] foldl: OK
  12468. 660.61 s [vector] +++ OK, passed 100 tests.
  12469. 660.62 s [vector] foldl1: OK
  12470. 660.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12471. 660.63 s [vector] foldl': OK
  12472. 660.63 s [vector] +++ OK, passed 100 tests.
  12473. 660.63 s [vector] foldl1': OK
  12474. 660.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12475. 660.64 s [vector] foldr: OK
  12476. 660.64 s [vector] +++ OK, passed 100 tests.
  12477. 660.65 s [vector] foldr1: OK
  12478. 660.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12479. 660.66 s [vector] foldr': OK
  12480. 660.66 s [vector] +++ OK, passed 100 tests.
  12481. 660.66 s [vector] foldr1': OK
  12482. 660.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12483. 660.67 s [vector] ifoldl: OK
  12484. 660.67 s [vector] +++ OK, passed 100 tests.
  12485. 660.69 s [vector] ifoldl': OK
  12486. 660.69 s [vector] +++ OK, passed 100 tests.
  12487. 660.71 s [vector] ifoldr: OK
  12488. 660.71 s [vector] +++ OK, passed 100 tests.
  12489. 660.71 s [vector] ifoldr': OK
  12490. 660.71 s [vector] +++ OK, passed 100 tests.
  12491. 660.71 s [vector] ifoldM: OK
  12492. 660.71 s [vector] +++ OK, passed 100 tests.
  12493. 660.73 s [vector] ifoldM': OK
  12494. 660.73 s [vector] +++ OK, passed 100 tests.
  12495. 660.75 s [vector] ifoldM_: OK (0.03s)
  12496. 660.75 s [vector] +++ OK, passed 100 tests.
  12497. 660.78 s [vector] ifoldM'_: OK (0.03s)
  12498. 660.78 s [vector] +++ OK, passed 100 tests.
  12499. 660.78 s [vector] all: OK
  12500. 660.78 s [vector] +++ OK, passed 100 tests.
  12501. 660.78 s [vector] any: OK
  12502. 660.78 s [vector] +++ OK, passed 100 tests.
  12503. 660.79 s [vector] prescanl: OK
  12504. 660.79 s [vector] +++ OK, passed 100 tests.
  12505. 660.81 s [vector] prescanl': OK
  12506. 660.81 s [vector] +++ OK, passed 100 tests.
  12507. 660.81 s [vector] postscanl: OK (0.01s)
  12508. 660.81 s [vector] +++ OK, passed 100 tests.
  12509. 660.84 s [vector] postscanl': OK (0.01s)
  12510. 660.84 s [vector] +++ OK, passed 100 tests.
  12511. 660.84 s [vector] scanl: OK (0.01s)
  12512. 660.84 s [vector] +++ OK, passed 100 tests.
  12513. 660.86 s [vector] scanl': OK (0.01s)
  12514. 660.86 s [vector] +++ OK, passed 100 tests.
  12515. 660.87 s [vector] scanl1: OK (0.01s)
  12516. 660.87 s [vector] +++ OK, passed 100 tests.
  12517. 660.88 s [vector] scanl1': OK (0.01s)
  12518. 660.88 s [vector] +++ OK, passed 100 tests.
  12519. 660.89 s [vector] iscanl: OK (0.01s)
  12520. 660.89 s [vector] +++ OK, passed 100 tests.
  12521. 660.91 s [vector] iscanl': OK (0.02s)
  12522. 660.91 s [vector] +++ OK, passed 100 tests.
  12523. 660.91 s [vector] prescanr: OK (0.01s)
  12524. 660.91 s [vector] +++ OK, passed 100 tests.
  12525. 660.93 s [vector] prescanr': OK
  12526. 660.93 s [vector] +++ OK, passed 100 tests.
  12527. 660.95 s [vector] postscanr: OK (0.01s)
  12528. 660.95 s [vector] +++ OK, passed 100 tests.
  12529. 660.95 s [vector] postscanr': OK
  12530. 660.95 s [vector] +++ OK, passed 100 tests.
  12531. 660.96 s [vector] scanr: OK
  12532. 660.96 s [vector] +++ OK, passed 100 tests.
  12533. 660.97 s [vector] scanr': OK
  12534. 660.97 s [vector] +++ OK, passed 100 tests.
  12535. 660.97 s [vector] scanr1: OK
  12536. 660.97 s [vector] +++ OK, passed 100 tests.
  12537. 660.98 s [vector] scanr1': OK
  12538. 660.99 s [vector] +++ OK, passed 100 tests.
  12539. 660.99 s [vector] iscanr: OK
  12540. 660.99 s [vector] +++ OK, passed 100 tests.
  12541. 660.99 s [vector] iscanr': OK
  12542. 660.99 s [vector] +++ OK, passed 100 tests.
  12543. 660.99 s [vector] mut_read: OK
  12544. 660.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12545. 661.00 s [vector] mut_write: OK
  12546. 661.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12547. 661.00 s [vector] mut_modify: OK
  12548. 661.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12549. 661.00 s [vector] mut_generate: OK
  12550. 661.01 s [vector] +++ OK, passed 100 tests.
  12551. 661.03 s [vector] mut_generateM: OK (0.02s)
  12552. 661.03 s [vector] +++ OK, passed 100 tests.
  12553. 661.05 s [vector] mut_mapM_: OK (0.03s)
  12554. 661.05 s [vector] +++ OK, passed 100 tests.
  12555. 661.10 s [vector] mut_imapM_: OK (0.04s)
  12556. 661.10 s [vector] +++ OK, passed 100 tests.
  12557. 661.12 s [vector] mut_forM_: OK (0.03s)
  12558. 661.12 s [vector] +++ OK, passed 100 tests.
  12559. 661.15 s [vector] mut_iforM_: OK (0.04s)
  12560. 661.15 s [vector] +++ OK, passed 100 tests.
  12561. 661.16 s [vector] mut_foldr: OK
  12562. 661.16 s [vector] +++ OK, passed 100 tests.
  12563. 661.17 s [vector] mut_foldr': OK
  12564. 661.17 s [vector] +++ OK, passed 100 tests.
  12565. 661.18 s [vector] mut_foldl: OK
  12566. 661.18 s [vector] +++ OK, passed 100 tests.
  12567. 661.18 s [vector] mut_foldl': OK
  12568. 661.18 s [vector] +++ OK, passed 100 tests.
  12569. 661.19 s [vector] mut_ifoldr: OK
  12570. 661.21 s [vector] +++ OK, passed 100 tests.
  12571. 661.21 s [vector] mut_ifoldr': OK (0.01s)
  12572. 661.21 s [vector] +++ OK, passed 100 tests.
  12573. 661.22 s [vector] mut_ifoldl: OK (0.01s)
  12574. 661.23 s [vector] +++ OK, passed 100 tests.
  12575. 661.23 s [vector] mut_ifoldl': OK
  12576. 661.23 s [vector] +++ OK, passed 100 tests.
  12577. 661.24 s [vector] mut_foldM: OK
  12578. 661.24 s [vector] +++ OK, passed 100 tests.
  12579. 661.24 s [vector] mut_foldM': OK
  12580. 661.25 s [vector] +++ OK, passed 100 tests.
  12581. 661.25 s [vector] mut_foldrM: OK
  12582. 661.25 s [vector] +++ OK, passed 100 tests.
  12583. 661.27 s [vector] mut_foldrM': OK
  12584. 661.27 s [vector] +++ OK, passed 100 tests.
  12585. 661.27 s [vector] mut_ifoldM: OK
  12586. 661.27 s [vector] +++ OK, passed 100 tests.
  12587. 661.28 s [vector] mut_ifoldM': OK
  12588. 661.28 s [vector] +++ OK, passed 100 tests.
  12589. 661.29 s [vector] mut_ifoldrM: OK (0.01s)
  12590. 661.29 s [vector] +++ OK, passed 100 tests.
  12591. 661.29 s [vector] mut_ifoldrM': OK
  12592. 661.30 s [vector] +++ OK, passed 100 tests.
  12593. 661.30 s [vector] compare: OK
  12594. 661.30 s [vector] +++ OK, passed 100 tests.
  12595. 661.30 s [vector] maximum: OK
  12596. 661.30 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12597. 661.30 s [vector] minimum: OK
  12598. 661.30 s [vector] +++ OK, passed 100 tests; 24 discarded.
  12599. 661.30 s [vector] minIndex: OK
  12600. 661.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12601. 661.30 s [vector] maxIndex: OK
  12602. 661.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12603. 661.30 s [vector] maximumBy: OK
  12604. 661.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12605. 661.30 s [vector] minimumBy: OK
  12606. 661.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12607. 661.30 s [vector] maximumOn: OK
  12608. 661.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12609. 661.31 s [vector] minimumOn: OK
  12610. 661.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12611. 661.31 s [vector] maxIndexBy: OK
  12612. 661.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12613. 661.31 s [vector] minIndexBy: OK
  12614. 661.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12615. 661.31 s [vector] ListFirstMaxIndexWins: OK
  12616. 661.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12617. 661.31 s [vector] FalseListFirstMaxIndexWins: OK
  12618. 661.31 s [vector] +++ OK, failed as expected. (after 1 test):
  12619. 661.31 s [vector] Exception:
  12620. 661.31 s [vector] Prelude.foldr1: empty list
  12621. 661.31 s [vector] CallStack (from HasCallStack):
  12622. 661.31 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12623. 661.31 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12624. 661.31 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12625. 661.31 s [vector] []
  12626. 661.31 s [vector] zip: OK
  12627. 661.31 s [vector] +++ OK, passed 100 tests.
  12628. 661.31 s [vector] zip3: OK
  12629. 661.31 s [vector] +++ OK, passed 100 tests.
  12630. 661.32 s [vector] unzip: OK
  12631. 661.32 s [vector] +++ OK, passed 100 tests.
  12632. 661.32 s [vector] unzip3: OK
  12633. 661.32 s [vector] +++ OK, passed 100 tests.
  12634. 661.32 s [vector] indexed: OK
  12635. 661.32 s [vector] +++ OK, passed 100 tests.
  12636. 661.32 s [vector] update: OK
  12637. 661.32 s [vector] +++ OK, passed 100 tests.
  12638. 661.32 s [vector] mempty: OK
  12639. 661.32 s [vector] +++ OK, passed 100 tests.
  12640. 661.33 s [vector] mappend: OK
  12641. 661.33 s [vector] +++ OK, passed 100 tests.
  12642. 661.35 s [vector] mconcat: OK (0.02s)
  12643. 661.60 s [vector] +++ OK, passed 100 tests.
  12644. 661.60 s [vector] glength: OK
  12645. 661.60 s [vector] +++ OK, passed 100 tests.
  12646. 661.60 s [vector] sum: OK
  12647. 661.60 s [vector] +++ OK, passed 100 tests.
  12648. 661.60 s [vector] product: OK
  12649. 661.60 s [vector] +++ OK, passed 100 tests.
  12650. 661.61 s [vector] enumFromN: OK
  12651. 661.61 s [vector] +++ OK, passed 100 tests.
  12652. 661.61 s [vector] enumFromThenN: OK
  12653. 661.61 s [vector] +++ OK, passed 100 tests.
  12654. 661.61 s [vector] enumFromTo: OK
  12655. 661.61 s [vector] +++ OK, passed 100 tests.
  12656. 661.61 s [vector] enumFromThenTo: OK
  12657. 661.61 s [vector] +++ OK, passed 100 tests; 4 discarded.
  12658. 661.61 s [vector] (Double)
  12659. 661.61 s [vector] fromList.toList == id: OK
  12660. 661.61 s [vector] +++ OK, passed 100 tests.
  12661. 661.61 s [vector] toList.fromList == id: OK
  12662. 661.61 s [vector] +++ OK, passed 100 tests.
  12663. 661.61 s [vector] unstream.stream == id: OK
  12664. 661.61 s [vector] +++ OK, passed 100 tests.
  12665. 661.61 s [vector] stream.unstream == id: OK
  12666. 661.61 s [vector] +++ OK, passed 100 tests.
  12667. 661.61 s [vector] eq: OK
  12668. 661.61 s [vector] +++ OK, passed 100 tests.
  12669. 661.61 s [vector] length: OK
  12670. 661.61 s [vector] +++ OK, passed 100 tests.
  12671. 661.61 s [vector] null: OK
  12672. 661.61 s [vector] +++ OK, passed 100 tests.
  12673. 661.61 s [vector] index: OK
  12674. 661.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12675. 661.61 s [vector] safeIndex: OK
  12676. 661.61 s [vector] +++ OK, passed 100 tests.
  12677. 661.61 s [vector] head: OK
  12678. 661.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12679. 661.61 s [vector] last: OK
  12680. 661.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12681. 661.61 s [vector] unsafeIndex: OK
  12682. 661.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12683. 661.62 s [vector] unsafeHead: OK
  12684. 661.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12685. 661.62 s [vector] unsafeLast: OK
  12686. 661.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12687. 661.62 s [vector] slice: OK
  12688. 661.62 s [vector] +++ OK, passed 100 tests.
  12689. 661.62 s [vector] init: OK
  12690. 661.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12691. 661.62 s [vector] tail: OK
  12692. 661.62 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12693. 661.62 s [vector] take: OK
  12694. 661.62 s [vector] +++ OK, passed 100 tests.
  12695. 661.62 s [vector] drop: OK
  12696. 661.62 s [vector] +++ OK, passed 100 tests.
  12697. 661.62 s [vector] splitAt: OK
  12698. 661.62 s [vector] +++ OK, passed 100 tests.
  12699. 661.62 s [vector] empty: OK
  12700. 661.62 s [vector] +++ OK, passed 100 tests.
  12701. 661.62 s [vector] singleton: OK
  12702. 661.62 s [vector] +++ OK, passed 100 tests.
  12703. 661.62 s [vector] replicate: OK
  12704. 661.62 s [vector] +++ OK, passed 100 tests.
  12705. 661.62 s [vector] generate: OK
  12706. 661.62 s [vector] +++ OK, passed 100 tests.
  12707. 661.62 s [vector] iterateN: OK
  12708. 661.62 s [vector] +++ OK, passed 100 tests.
  12709. 661.62 s [vector] iterateNM: OK (0.04s)
  12710. 661.62 s [vector] +++ OK, passed 100 tests.
  12711. 661.62 s [vector] generateM: OK (0.03s)
  12712. 661.62 s [vector] +++ OK, passed 100 tests.
  12713. 661.62 s [vector] replicateM: OK (0.03s)
  12714. 661.62 s [vector] +++ OK, passed 100 tests.
  12715. 661.62 s [vector] create: OK
  12716. 661.62 s [vector] +++ OK, passed 100 tests.
  12717. 661.62 s [vector] createT: OK
  12718. 661.62 s [vector] +++ OK, passed 100 tests.
  12719. 661.62 s [vector] unfoldr: OK
  12720. 661.62 s [vector] +++ OK, passed 100 tests.
  12721. 661.62 s [vector] unfoldrN: OK
  12722. 661.62 s [vector] +++ OK, passed 100 tests.
  12723. 661.62 s [vector] unfoldrExactN: OK
  12724. 661.62 s [vector] +++ OK, passed 100 tests.
  12725. 661.62 s [vector] unfoldrM: OK
  12726. 661.62 s [vector] +++ OK, passed 100 tests.
  12727. 661.62 s [vector] unfoldrNM: OK
  12728. 661.62 s [vector] +++ OK, passed 100 tests.
  12729. 661.62 s [vector] unfoldrExactNM: OK (0.03s)
  12730. 661.62 s [vector] +++ OK, passed 100 tests.
  12731. 661.62 s [vector] constructN: OK (0.02s)
  12732. 661.62 s [vector] +++ OK, passed 100 tests.
  12733. 661.62 s [vector] constructrN: OK (0.03s)
  12734. 661.62 s [vector] +++ OK, passed 100 tests.
  12735. 661.62 s [vector] cons: OK
  12736. 661.62 s [vector] +++ OK, passed 100 tests.
  12737. 661.62 s [vector] snoc: OK
  12738. 661.62 s [vector] +++ OK, passed 100 tests.
  12739. 661.62 s [vector] append: OK
  12740. 661.62 s [vector] +++ OK, passed 100 tests.
  12741. 661.62 s [vector] concat: OK (0.03s)
  12742. 661.62 s [vector] +++ OK, passed 100 tests.
  12743. 661.62 s [vector] force: OK
  12744. 661.62 s [vector] +++ OK, passed 100 tests.
  12745. 661.62 s [vector] upd: OK
  12746. 661.62 s [vector] +++ OK, passed 100 tests.
  12747. 661.62 s [vector] accum: OK (0.01s)
  12748. 661.62 s [vector] +++ OK, passed 100 tests.
  12749. 661.62 s [vector] reverse: OK
  12750. 661.62 s [vector] +++ OK, passed 100 tests.
  12751. 661.62 s [vector] backpermute: OK
  12752. 661.62 s [vector] +++ OK, passed 100 tests.
  12753. 661.62 s [vector] map: OK
  12754. 661.63 s [vector] +++ OK, passed 100 tests.
  12755. 661.64 s [vector] imap: OK (0.01s)
  12756. 661.65 s [vector] +++ OK, passed 100 tests.
  12757. 661.65 s [vector] concatMap: OK (0.01s)
  12758. 661.65 s [vector] +++ OK, passed 100 tests.
  12759. 661.67 s [vector] mapM: OK
  12760. 661.67 s [vector] +++ OK, passed 100 tests.
  12761. 661.70 s [vector] mapM_: OK (0.04s)
  12762. 661.70 s [vector] +++ OK, passed 100 tests.
  12763. 661.71 s [vector] forM: OK
  12764. 661.71 s [vector] +++ OK, passed 100 tests.
  12765. 661.75 s [vector] forM_: OK (0.04s)
  12766. 661.75 s [vector] +++ OK, passed 100 tests.
  12767. 661.75 s [vector] imapM: OK
  12768. 661.75 s [vector] +++ OK, passed 100 tests.
  12769. 661.79 s [vector] imapM_: OK (0.04s)
  12770. 661.79 s [vector] +++ OK, passed 100 tests.
  12771. 661.79 s [vector] zipWith: OK
  12772. 661.79 s [vector] +++ OK, passed 100 tests.
  12773. 661.81 s [vector] zipWith3: OK (0.01s)
  12774. 661.81 s [vector] +++ OK, passed 100 tests.
  12775. 661.84 s [vector] izipWith: OK (0.01s)
  12776. 661.84 s [vector] +++ OK, passed 100 tests.
  12777. 661.85 s [vector] izipWith3: OK (0.03s)
  12778. 661.85 s [vector] +++ OK, passed 100 tests.
  12779. 661.87 s [vector] izipWithM: OK (0.01s)
  12780. 661.87 s [vector] +++ OK, passed 100 tests.
  12781. 661.90 s [vector] izipWithM_: OK (0.03s)
  12782. 661.91 s [vector] +++ OK, passed 100 tests.
  12783. 661.91 s [vector] zipWithM: OK (0.01s)
  12784. 661.91 s [vector] +++ OK, passed 100 tests.
  12785. 661.93 s [vector] zipWithM_: OK (0.03s)
  12786. 661.93 s [vector] +++ OK, passed 100 tests.
  12787. 661.94 s [vector] filter: OK
  12788. 661.94 s [vector] +++ OK, passed 100 tests.
  12789. 661.95 s [vector] ifilter: OK
  12790. 661.95 s [vector] +++ OK, passed 100 tests.
  12791. 662.00 s [vector] filterM: OK (0.06s)
  12792. 662.00 s [vector] +++ OK, passed 100 tests.
  12793. 662.00 s [vector] uniq: OK
  12794. 662.01 s [vector] +++ OK, passed 100 tests.
  12795. 662.03 s [vector] mapMaybe: OK (0.01s)
  12796. 662.03 s [vector] +++ OK, passed 100 tests.
  12797. 662.04 s [vector] imapMaybe: OK (0.02s)
  12798. 662.04 s [vector] +++ OK, passed 100 tests.
  12799. 662.04 s [vector] takeWhile: OK
  12800. 662.04 s [vector] +++ OK, passed 100 tests.
  12801. 662.05 s [vector] dropWhile: OK
  12802. 662.05 s [vector] +++ OK, passed 100 tests.
  12803. 662.07 s [vector] partition: OK (0.01s)
  12804. 662.07 s [vector] +++ OK, passed 100 tests.
  12805. 662.07 s [vector] partitionWith: OK (0.01s)
  12806. 662.08 s [vector] +++ OK, passed 100 tests.
  12807. 662.08 s [vector] span: OK
  12808. 662.08 s [vector] +++ OK, passed 100 tests.
  12809. 662.08 s [vector] break: OK
  12810. 662.08 s [vector] +++ OK, passed 100 tests.
  12811. 662.08 s [vector] spanR: OK
  12812. 662.08 s [vector] +++ OK, passed 100 tests.
  12813. 662.08 s [vector] breakR: OK
  12814. 662.09 s [vector] +++ OK, passed 100 tests.
  12815. 662.09 s [vector] groupBy: OK (0.01s)
  12816. 662.09 s [vector] +++ OK, passed 100 tests.
  12817. 662.09 s [vector] elem: OK
  12818. 662.09 s [vector] +++ OK, passed 100 tests.
  12819. 662.09 s [vector] notElem: OK
  12820. 662.09 s [vector] +++ OK, passed 100 tests.
  12821. 662.09 s [vector] find: OK
  12822. 662.09 s [vector] +++ OK, passed 100 tests.
  12823. 662.09 s [vector] findIndex: OK
  12824. 662.09 s [vector] +++ OK, passed 100 tests.
  12825. 662.10 s [vector] findIndexR: OK
  12826. 662.10 s [vector] +++ OK, passed 100 tests.
  12827. 662.10 s [vector] findIndices: OK
  12828. 662.10 s [vector] +++ OK, passed 100 tests.
  12829. 662.10 s [vector] elemIndex: OK
  12830. 662.10 s [vector] +++ OK, passed 100 tests.
  12831. 662.11 s [vector] elemIndices: OK
  12832. 662.11 s [vector] +++ OK, passed 100 tests.
  12833. 662.13 s [vector] foldl: OK (0.01s)
  12834. 662.13 s [vector] +++ OK, passed 100 tests.
  12835. 662.13 s [vector] foldl1: OK (0.01s)
  12836. 662.13 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12837. 662.16 s [vector] foldl': OK (0.02s)
  12838. 662.16 s [vector] +++ OK, passed 100 tests.
  12839. 662.19 s [vector] foldl1': OK (0.02s)
  12840. 662.20 s [vector] +++ OK, passed 100 tests; 28 discarded.
  12841. 662.22 s [vector] foldr: OK
  12842. 662.22 s [vector] +++ OK, passed 100 tests.
  12843. 662.23 s [vector] foldr1: OK (0.02s)
  12844. 662.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12845. 662.25 s [vector] foldr': OK (0.02s)
  12846. 662.25 s [vector] +++ OK, passed 100 tests.
  12847. 662.27 s [vector] foldr1': OK (0.02s)
  12848. 662.27 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12849. 662.29 s [vector] ifoldl: OK (0.02s)
  12850. 662.29 s [vector] +++ OK, passed 100 tests.
  12851. 662.30 s [vector] ifoldl': OK (0.02s)
  12852. 662.30 s [vector] +++ OK, passed 100 tests.
  12853. 662.33 s [vector] ifoldr: OK (0.01s)
  12854. 662.33 s [vector] +++ OK, passed 100 tests.
  12855. 662.35 s [vector] ifoldr': OK (0.02s)
  12856. 662.35 s [vector] +++ OK, passed 100 tests.
  12857. 662.37 s [vector] ifoldM: OK (0.02s)
  12858. 662.37 s [vector] +++ OK, passed 100 tests.
  12859. 662.39 s [vector] ifoldM': OK (0.02s)
  12860. 662.39 s [vector] +++ OK, passed 100 tests.
  12861. 662.47 s [vector] ifoldM_: OK (0.08s)
  12862. 662.47 s [vector] +++ OK, passed 100 tests.
  12863. 662.52 s [vector] ifoldM'_: OK (0.06s)
  12864. 662.52 s [vector] +++ OK, passed 100 tests.
  12865. 662.52 s [vector] all: OK
  12866. 662.52 s [vector] +++ OK, passed 100 tests.
  12867. 662.52 s [vector] any: OK
  12868. 662.53 s [vector] +++ OK, passed 100 tests.
  12869. 662.55 s [vector] prescanl: OK (0.02s)
  12870. 662.55 s [vector] +++ OK, passed 100 tests.
  12871. 662.57 s [vector] prescanl': OK (0.02s)
  12872. 662.57 s [vector] +++ OK, passed 100 tests.
  12873. 662.57 s [vector] postscanl: OK (0.01s)
  12874. 662.57 s [vector] +++ OK, passed 100 tests.
  12875. 662.59 s [vector] postscanl': OK (0.02s)
  12876. 662.59 s [vector] +++ OK, passed 100 tests.
  12877. 662.61 s [vector] scanl: OK (0.02s)
  12878. 662.61 s [vector] +++ OK, passed 100 tests.
  12879. 662.63 s [vector] scanl': OK (0.02s)
  12880. 662.63 s [vector] +++ OK, passed 100 tests.
  12881. 662.65 s [vector] scanl1: OK (0.01s)
  12882. 662.65 s [vector] +++ OK, passed 100 tests.
  12883. 662.67 s [vector] scanl1': OK (0.02s)
  12884. 662.67 s [vector] +++ OK, passed 100 tests.
  12885. 662.69 s [vector] iscanl: OK (0.02s)
  12886. 662.69 s [vector] +++ OK, passed 100 tests.
  12887. 662.69 s [vector] iscanl': OK (0.02s)
  12888. 662.69 s [vector] +++ OK, passed 100 tests.
  12889. 662.72 s [vector] prescanr: OK (0.02s)
  12890. 662.72 s [vector] +++ OK, passed 100 tests.
  12891. 662.73 s [vector] prescanr': OK (0.02s)
  12892. 662.73 s [vector] +++ OK, passed 100 tests.
  12893. 662.75 s [vector] postscanr: OK (0.02s)
  12894. 662.75 s [vector] +++ OK, passed 100 tests.
  12895. 662.77 s [vector] postscanr': OK (0.02s)
  12896. 662.77 s [vector] +++ OK, passed 100 tests.
  12897. 662.77 s [vector] scanr: OK (0.02s)
  12898. 662.77 s [vector] +++ OK, passed 100 tests.
  12899. 662.79 s [vector] scanr': OK (0.02s)
  12900. 662.79 s [vector] +++ OK, passed 100 tests.
  12901. 662.81 s [vector] scanr1: OK (0.01s)
  12902. 662.81 s [vector] +++ OK, passed 100 tests.
  12903. 662.83 s [vector] scanr1': OK (0.02s)
  12904. 662.83 s [vector] +++ OK, passed 100 tests.
  12905. 662.87 s [vector] iscanr: OK (0.03s)
  12906. 662.87 s [vector] +++ OK, passed 100 tests.
  12907. 662.88 s [vector] iscanr': OK (0.02s)
  12908. 662.88 s [vector] +++ OK, passed 100 tests.
  12909. 662.88 s [vector] mut_read: OK
  12910. 662.88 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12911. 662.89 s [vector] mut_write: OK
  12912. 662.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12913. 662.89 s [vector] mut_modify: OK
  12914. 662.89 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12915. 662.89 s [vector] mut_generate: OK
  12916. 662.89 s [vector] +++ OK, passed 100 tests.
  12917. 662.91 s [vector] mut_generateM: OK (0.01s)
  12918. 662.91 s [vector] +++ OK, passed 100 tests.
  12919. 662.95 s [vector] mut_mapM_: OK (0.03s)
  12920. 662.95 s [vector] +++ OK, passed 100 tests.
  12921. 662.97 s [vector] mut_imapM_: OK (0.04s)
  12922. 662.97 s [vector] +++ OK, passed 100 tests.
  12923. 663.03 s [vector] mut_forM_: OK (0.06s)
  12924. 663.03 s [vector] +++ OK, passed 100 tests.
  12925. 663.09 s [vector] mut_iforM_: OK (0.06s)
  12926. 663.09 s [vector] +++ OK, passed 100 tests.
  12927. 663.11 s [vector] mut_foldr: OK (0.02s)
  12928. 663.11 s [vector] +++ OK, passed 100 tests.
  12929. 663.13 s [vector] mut_foldr': OK (0.02s)
  12930. 663.13 s [vector] +++ OK, passed 100 tests.
  12931. 663.17 s [vector] mut_foldl: OK (0.03s)
  12932. 663.17 s [vector] +++ OK, passed 100 tests.
  12933. 663.19 s [vector] mut_foldl': OK (0.03s)
  12934. 663.19 s [vector] +++ OK, passed 100 tests.
  12935. 663.21 s [vector] mut_ifoldr: OK (0.03s)
  12936. 663.21 s [vector] +++ OK, passed 100 tests.
  12937. 663.24 s [vector] mut_ifoldr': OK (0.03s)
  12938. 663.24 s [vector] +++ OK, passed 100 tests.
  12939. 663.27 s [vector] mut_ifoldl: OK (0.01s)
  12940. 663.27 s [vector] +++ OK, passed 100 tests.
  12941. 663.32 s [vector] mut_ifoldl': OK (0.03s)
  12942. 663.32 s [vector] +++ OK, passed 100 tests.
  12943. 663.33 s [vector] mut_foldM: OK (0.03s)
  12944. 663.33 s [vector] +++ OK, passed 100 tests.
  12945. 663.37 s [vector] mut_foldM': OK (0.03s)
  12946. 663.37 s [vector] +++ OK, passed 100 tests.
  12947. 663.39 s [vector] mut_foldrM: OK (0.03s)
  12948. 663.39 s [vector] +++ OK, passed 100 tests.
  12949. 663.40 s [vector] mut_foldrM': OK (0.02s)
  12950. 663.40 s [vector] +++ OK, passed 100 tests.
  12951. 663.42 s [vector] mut_ifoldM: OK
  12952. 663.43 s [vector] +++ OK, passed 100 tests.
  12953. 663.43 s [vector] mut_ifoldM': OK (0.02s)
  12954. 663.43 s [vector] +++ OK, passed 100 tests.
  12955. 663.45 s [vector] mut_ifoldrM: OK (0.02s)
  12956. 663.45 s [vector] +++ OK, passed 100 tests.
  12957. 663.46 s [vector] mut_ifoldrM': OK (0.01s)
  12958. 663.46 s [vector] +++ OK, passed 100 tests.
  12959. 663.46 s [vector] compare: OK
  12960. 663.46 s [vector] +++ OK, passed 100 tests.
  12961. 663.47 s [vector] maximum: OK
  12962. 663.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12963. 663.47 s [vector] minimum: OK
  12964. 663.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12965. 663.47 s [vector] minIndex: OK
  12966. 663.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12967. 663.47 s [vector] maxIndex: OK
  12968. 663.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12969. 663.47 s [vector] maximumBy: OK
  12970. 663.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12971. 663.47 s [vector] minimumBy: OK
  12972. 663.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12973. 663.47 s [vector] maximumOn: OK
  12974. 663.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12975. 663.47 s [vector] minimumOn: OK
  12976. 663.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12977. 663.47 s [vector] maxIndexBy: OK
  12978. 663.47 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12979. 663.47 s [vector] minIndexBy: OK
  12980. 663.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12981. 663.48 s [vector] ListFirstMaxIndexWins: OK
  12982. 663.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12983. 663.48 s [vector] FalseListFirstMaxIndexWins: OK
  12984. 663.48 s [vector] +++ OK, failed as expected. (after 1 test):
  12985. 663.48 s [vector] Exception:
  12986. 663.48 s [vector] Prelude.foldr1: empty list
  12987. 663.48 s [vector] CallStack (from HasCallStack):
  12988. 663.48 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12989. 663.48 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12990. 663.48 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12991. 663.48 s [vector] []
  12992. 663.50 s [vector] zip: OK
  12993. 663.50 s [vector] +++ OK, passed 100 tests.
  12994. 663.50 s [vector] zip3: OK (0.02s)
  12995. 663.50 s [vector] +++ OK, passed 100 tests.
  12996. 663.51 s [vector] unzip: OK
  12997. 663.51 s [vector] +++ OK, passed 100 tests.
  12998. 663.51 s [vector] unzip3: OK
  12999. 663.51 s [vector] +++ OK, passed 100 tests.
  13000. 663.51 s [vector] indexed: OK
  13001. 663.51 s [vector] +++ OK, passed 100 tests.
  13002. 663.52 s [vector] update: OK
  13003. 663.52 s [vector] +++ OK, passed 100 tests.
  13004. 663.52 s [vector] mempty: OK
  13005. 663.52 s [vector] +++ OK, passed 100 tests.
  13006. 663.53 s [vector] mappend: OK
  13007. 663.53 s [vector] +++ OK, passed 100 tests.
  13008. 663.55 s [vector] mconcat: OK (0.03s)
  13009. 663.55 s [vector] +++ OK, passed 100 tests.
  13010. 663.55 s [vector] glength: OK
  13011. 663.55 s [vector] +++ OK, passed 100 tests.
  13012. 663.55 s [vector] sum: OK
  13013. 663.55 s [vector] +++ OK, passed 100 tests.
  13014. 663.55 s [vector] product: OK
  13015. 663.55 s [vector] +++ OK, passed 100 tests.
  13016. 663.55 s [vector] enumFromN: OK
  13017. 663.55 s [vector] +++ OK, passed 100 tests.
  13018. 663.55 s [vector] enumFromThenN: OK
  13019. 663.55 s [vector] +++ OK, passed 100 tests.
  13020. 663.55 s [vector] enumFromTo: OK
  13021. 663.55 s [vector] +++ OK, passed 100 tests.
  13022. 663.55 s [vector] enumFromThenTo: OK
  13023. 663.55 s [vector] +++ OK, passed 100 tests.
  13024. 663.55 s [vector] (Int,Bool)
  13025. 663.55 s [vector] fromList.toList == id: OK
  13026. 663.55 s [vector] +++ OK, passed 100 tests.
  13027. 663.56 s [vector] toList.fromList == id: OK
  13028. 663.56 s [vector] +++ OK, passed 100 tests.
  13029. 663.56 s [vector] unstream.stream == id: OK
  13030. 663.56 s [vector] +++ OK, passed 100 tests.
  13031. 663.56 s [vector] stream.unstream == id: OK
  13032. 663.56 s [vector] +++ OK, passed 100 tests.
  13033. 663.56 s [vector] eq: OK
  13034. 663.56 s [vector] +++ OK, passed 100 tests.
  13035. 663.56 s [vector] length: OK
  13036. 663.56 s [vector] +++ OK, passed 100 tests.
  13037. 663.56 s [vector] null: OK
  13038. 663.56 s [vector] +++ OK, passed 100 tests.
  13039. 663.56 s [vector] index: OK
  13040. 663.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13041. 663.56 s [vector] safeIndex: OK
  13042. 663.56 s [vector] +++ OK, passed 100 tests.
  13043. 663.56 s [vector] head: OK
  13044. 663.56 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13045. 663.56 s [vector] last: OK
  13046. 663.57 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13047. 663.57 s [vector] unsafeIndex: OK
  13048. 663.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13049. 663.57 s [vector] unsafeHead: OK
  13050. 663.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13051. 663.57 s [vector] unsafeLast: OK
  13052. 663.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13053. 663.57 s [vector] slice: OK
  13054. 663.57 s [vector] +++ OK, passed 100 tests.
  13055. 663.57 s [vector] init: OK
  13056. 663.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13057. 663.58 s [vector] tail: OK
  13058. 663.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13059. 663.58 s [vector] take: OK
  13060. 663.58 s [vector] +++ OK, passed 100 tests.
  13061. 663.58 s [vector] drop: OK
  13062. 663.58 s [vector] +++ OK, passed 100 tests.
  13063. 663.58 s [vector] splitAt: OK
  13064. 663.58 s [vector] +++ OK, passed 100 tests.
  13065. 663.58 s [vector] empty: OK
  13066. 663.58 s [vector] +++ OK, passed 100 tests.
  13067. 663.58 s [vector] singleton: OK
  13068. 663.58 s [vector] +++ OK, passed 100 tests.
  13069. 663.58 s [vector] replicate: OK
  13070. 663.59 s [vector] +++ OK, passed 100 tests.
  13071. 663.59 s [vector] generate: OK
  13072. 663.59 s [vector] +++ OK, passed 100 tests.
  13073. 663.59 s [vector] iterateN: OK
  13074. 663.59 s [vector] +++ OK, passed 100 tests.
  13075. 663.61 s [vector] iterateNM: OK (0.01s)
  13076. 663.61 s [vector] +++ OK, passed 100 tests.
  13077. 663.64 s [vector] generateM: OK (0.02s)
  13078. 663.64 s [vector] +++ OK, passed 100 tests.
  13079. 663.66 s [vector] replicateM: OK (0.03s)
  13080. 663.66 s [vector] +++ OK, passed 100 tests.
  13081. 663.66 s [vector] create: OK
  13082. 663.66 s [vector] +++ OK, passed 100 tests.
  13083. 663.66 s [vector] createT: OK
  13084. 663.66 s [vector] +++ OK, passed 100 tests.
  13085. 663.66 s [vector] unfoldr: OK
  13086. 663.66 s [vector] +++ OK, passed 100 tests.
  13087. 663.66 s [vector] unfoldrN: OK
  13088. 663.67 s [vector] +++ OK, passed 100 tests.
  13089. 663.67 s [vector] unfoldrExactN: OK
  13090. 663.67 s [vector] +++ OK, passed 100 tests.
  13091. 663.67 s [vector] unfoldrM: OK
  13092. 663.68 s [vector] +++ OK, passed 100 tests.
  13093. 663.68 s [vector] unfoldrNM: OK
  13094. 663.69 s [vector] +++ OK, passed 100 tests.
  13095. 663.70 s [vector] unfoldrExactNM: OK (0.02s)
  13096. 663.70 s [vector] +++ OK, passed 100 tests.
  13097. 663.70 s [vector] constructN: OK
  13098. 663.71 s [vector] +++ OK, passed 100 tests.
  13099. 663.71 s [vector] constructrN: OK
  13100. 663.71 s [vector] +++ OK, passed 100 tests.
  13101. 663.71 s [vector] cons: OK
  13102. 663.71 s [vector] +++ OK, passed 100 tests.
  13103. 663.72 s [vector] snoc: OK
  13104. 663.72 s [vector] +++ OK, passed 100 tests.
  13105. 663.72 s [vector] append: OK
  13106. 663.73 s [vector] +++ OK, passed 100 tests.
  13107. 663.77 s [vector] concat: OK (0.04s)
  13108. 663.77 s [vector] +++ OK, passed 100 tests.
  13109. 663.77 s [vector] force: OK
  13110. 663.77 s [vector] +++ OK, passed 100 tests.
  13111. 663.77 s [vector] upd: OK
  13112. 663.77 s [vector] +++ OK, passed 100 tests.
  13113. 663.79 s [vector] accum: OK (0.02s)
  13114. 663.79 s [vector] +++ OK, passed 100 tests.
  13115. 663.80 s [vector] reverse: OK
  13116. 663.80 s [vector] +++ OK, passed 100 tests.
  13117. 663.80 s [vector] backpermute: OK
  13118. 663.80 s [vector] +++ OK, passed 100 tests.
  13119. 663.81 s [vector] map: OK
  13120. 663.82 s [vector] +++ OK, passed 100 tests.
  13121. 663.83 s [vector] imap: OK
  13122. 663.84 s [vector] +++ OK, passed 100 tests.
  13123. 663.84 s [vector] concatMap: OK (0.02s)
  13124. 663.84 s [vector] +++ OK, passed 100 tests.
  13125. 663.85 s [vector] mapM: OK
  13126. 663.85 s [vector] +++ OK, passed 100 tests.
  13127. 663.89 s [vector] mapM_: OK (0.05s)
  13128. 663.89 s [vector] +++ OK, passed 100 tests.
  13129. 663.89 s [vector] forM: OK
  13130. 663.89 s [vector] +++ OK, passed 100 tests.
  13131. 663.93 s [vector] forM_: OK (0.03s)
  13132. 663.93 s [vector] +++ OK, passed 100 tests.
  13133. 663.93 s [vector] imapM: OK
  13134. 663.93 s [vector] +++ OK, passed 100 tests.
  13135. 663.96 s [vector] imapM_: OK (0.03s)
  13136. 663.96 s [vector] +++ OK, passed 100 tests.
  13137. 663.96 s [vector] zipWith: OK
  13138. 663.96 s [vector] +++ OK, passed 100 tests.
  13139. 663.97 s [vector] zipWith3: OK
  13140. 663.97 s [vector] +++ OK, passed 100 tests.
  13141. 663.98 s [vector] izipWith: OK
  13142. 663.98 s [vector] +++ OK, passed 100 tests.
  13143. 663.98 s [vector] izipWith3: OK
  13144. 663.98 s [vector] +++ OK, passed 100 tests.
  13145. 663.99 s [vector] izipWithM: OK
  13146. 663.99 s [vector] +++ OK, passed 100 tests.
  13147. 664.02 s [vector] izipWithM_: OK (0.03s)
  13148. 664.02 s [vector] +++ OK, passed 100 tests.
  13149. 664.02 s [vector] zipWithM: OK
  13150. 664.02 s [vector] +++ OK, passed 100 tests.
  13151. 664.04 s [vector] zipWithM_: OK
  13152. 664.04 s [vector] +++ OK, passed 100 tests.
  13153. 664.04 s [vector] filter: OK
  13154. 664.04 s [vector] +++ OK, passed 100 tests.
  13155. 664.05 s [vector] ifilter: OK
  13156. 664.05 s [vector] +++ OK, passed 100 tests.
  13157. 664.11 s [vector] filterM: OK (0.06s)
  13158. 664.11 s [vector] +++ OK, passed 100 tests.
  13159. 664.11 s [vector] uniq: OK
  13160. 664.11 s [vector] +++ OK, passed 100 tests.
  13161. 664.11 s [vector] mapMaybe: OK
  13162. 664.11 s [vector] +++ OK, passed 100 tests.
  13163. 664.11 s [vector] imapMaybe: OK
  13164. 664.12 s [vector] +++ OK, passed 100 tests.
  13165. 664.12 s [vector] takeWhile: OK
  13166. 664.12 s [vector] +++ OK, passed 100 tests.
  13167. 664.12 s [vector] dropWhile: OK
  13168. 664.12 s [vector] +++ OK, passed 100 tests.
  13169. 664.12 s [vector] partition: OK
  13170. 664.13 s [vector] +++ OK, passed 100 tests.
  13171. 664.13 s [vector] partitionWith: OK
  13172. 664.13 s [vector] +++ OK, passed 100 tests.
  13173. 664.13 s [vector] span: OK
  13174. 664.13 s [vector] +++ OK, passed 100 tests.
  13175. 664.13 s [vector] break: OK
  13176. 664.13 s [vector] +++ OK, passed 100 tests.
  13177. 664.13 s [vector] spanR: OK
  13178. 664.13 s [vector] +++ OK, passed 100 tests.
  13179. 664.14 s [vector] breakR: OK
  13180. 664.14 s [vector] +++ OK, passed 100 tests.
  13181. 664.14 s [vector] groupBy: OK
  13182. 664.14 s [vector] +++ OK, passed 100 tests.
  13183. 664.14 s [vector] elem: OK
  13184. 664.14 s [vector] +++ OK, passed 100 tests.
  13185. 664.14 s [vector] notElem: OK
  13186. 664.14 s [vector] +++ OK, passed 100 tests.
  13187. 664.14 s [vector] find: OK
  13188. 664.14 s [vector] +++ OK, passed 100 tests.
  13189. 664.14 s [vector] findIndex: OK
  13190. 664.14 s [vector] +++ OK, passed 100 tests.
  13191. 664.15 s [vector] findIndexR: OK
  13192. 664.15 s [vector] +++ OK, passed 100 tests.
  13193. 664.15 s [vector] findIndices: OK
  13194. 664.15 s [vector] +++ OK, passed 100 tests.
  13195. 664.15 s [vector] elemIndex: OK
  13196. 664.15 s [vector] +++ OK, passed 100 tests.
  13197. 664.15 s [vector] elemIndices: OK
  13198. 664.15 s [vector] +++ OK, passed 100 tests.
  13199. 664.16 s [vector] foldl: OK
  13200. 664.16 s [vector] +++ OK, passed 100 tests.
  13201. 664.16 s [vector] foldl1: OK
  13202. 664.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13203. 664.16 s [vector] foldl': OK
  13204. 664.16 s [vector] +++ OK, passed 100 tests.
  13205. 664.17 s [vector] foldl1': OK
  13206. 664.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13207. 664.17 s [vector] foldr: OK
  13208. 664.17 s [vector] +++ OK, passed 100 tests.
  13209. 664.18 s [vector] foldr1: OK
  13210. 664.18 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13211. 664.18 s [vector] foldr': OK
  13212. 664.19 s [vector] +++ OK, passed 100 tests.
  13213. 664.19 s [vector] foldr1': OK
  13214. 664.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13215. 664.19 s [vector] ifoldl: OK
  13216. 664.19 s [vector] +++ OK, passed 100 tests.
  13217. 664.20 s [vector] ifoldl': OK
  13218. 664.20 s [vector] +++ OK, passed 100 tests.
  13219. 664.21 s [vector] ifoldr: OK
  13220. 664.21 s [vector] +++ OK, passed 100 tests.
  13221. 664.21 s [vector] ifoldr': OK
  13222. 664.21 s [vector] +++ OK, passed 100 tests.
  13223. 664.21 s [vector] ifoldM: OK
  13224. 664.22 s [vector] +++ OK, passed 100 tests.
  13225. 664.22 s [vector] ifoldM': OK
  13226. 664.24 s [vector] +++ OK, passed 100 tests.
  13227. 664.25 s [vector] ifoldM_: OK (0.03s)
  13228. 664.25 s [vector] +++ OK, passed 100 tests.
  13229. 664.30 s [vector] ifoldM'_: OK (0.05s)
  13230. 664.30 s [vector] +++ OK, passed 100 tests.
  13231. 664.30 s [vector] all: OK
  13232. 664.30 s [vector] +++ OK, passed 100 tests.
  13233. 664.30 s [vector] any: OK
  13234. 664.31 s [vector] +++ OK, passed 100 tests.
  13235. 664.31 s [vector] prescanl: OK
  13236. 664.31 s [vector] +++ OK, passed 100 tests.
  13237. 664.32 s [vector] prescanl': OK
  13238. 664.33 s [vector] +++ OK, passed 100 tests.
  13239. 664.33 s [vector] postscanl: OK
  13240. 664.33 s [vector] +++ OK, passed 100 tests.
  13241. 664.34 s [vector] postscanl': OK
  13242. 664.34 s [vector] +++ OK, passed 100 tests.
  13243. 664.35 s [vector] scanl: OK
  13244. 664.35 s [vector] +++ OK, passed 100 tests.
  13245. 664.35 s [vector] scanl': OK
  13246. 664.35 s [vector] +++ OK, passed 100 tests.
  13247. 664.37 s [vector] scanl1: OK
  13248. 664.37 s [vector] +++ OK, passed 100 tests.
  13249. 664.37 s [vector] scanl1': OK (0.01s)
  13250. 664.37 s [vector] +++ OK, passed 100 tests.
  13251. 664.39 s [vector] iscanl: OK (0.01s)
  13252. 664.39 s [vector] +++ OK, passed 100 tests.
  13253. 664.39 s [vector] iscanl': OK
  13254. 664.39 s [vector] +++ OK, passed 100 tests.
  13255. 664.40 s [vector] prescanr: OK
  13256. 664.40 s [vector] +++ OK, passed 100 tests.
  13257. 664.41 s [vector] prescanr': OK
  13258. 664.42 s [vector] +++ OK, passed 100 tests.
  13259. 664.42 s [vector] postscanr: OK
  13260. 664.42 s [vector] +++ OK, passed 100 tests.
  13261. 664.42 s [vector] postscanr': OK
  13262. 664.43 s [vector] +++ OK, passed 100 tests.
  13263. 664.44 s [vector] scanr: OK
  13264. 664.44 s [vector] +++ OK, passed 100 tests.
  13265. 664.45 s [vector] scanr': OK (0.02s)
  13266. 664.45 s [vector] +++ OK, passed 100 tests.
  13267. 664.45 s [vector] scanr1: OK
  13268. 664.45 s [vector] +++ OK, passed 100 tests.
  13269. 664.46 s [vector] scanr1': OK
  13270. 664.46 s [vector] +++ OK, passed 100 tests.
  13271. 664.47 s [vector] iscanr: OK
  13272. 664.47 s [vector] +++ OK, passed 100 tests.
  13273. 664.47 s [vector] iscanr': OK
  13274. 664.47 s [vector] +++ OK, passed 100 tests.
  13275. 664.47 s [vector] mut_read: OK
  13276. 664.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13277. 664.47 s [vector] mut_write: OK
  13278. 664.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13279. 664.48 s [vector] mut_modify: OK
  13280. 664.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13281. 664.49 s [vector] mut_generate: OK
  13282. 664.49 s [vector] +++ OK, passed 100 tests.
  13283. 664.49 s [vector] mut_generateM: OK (0.02s)
  13284. 664.49 s [vector] +++ OK, passed 100 tests.
  13285. 664.54 s [vector] mut_mapM_: OK (0.03s)
  13286. 664.54 s [vector] +++ OK, passed 100 tests.
  13287. 664.56 s [vector] mut_imapM_: OK (0.03s)
  13288. 664.56 s [vector] +++ OK, passed 100 tests.
  13289. 664.59 s [vector] mut_forM_: OK (0.03s)
  13290. 664.60 s [vector] +++ OK, passed 100 tests.
  13291. 664.63 s [vector] mut_iforM_: OK (0.04s)
  13292. 664.63 s [vector] +++ OK, passed 100 tests.
  13293. 664.63 s [vector] mut_foldr: OK
  13294. 664.63 s [vector] +++ OK, passed 100 tests.
  13295. 664.63 s [vector] mut_foldr': OK
  13296. 664.63 s [vector] +++ OK, passed 100 tests.
  13297. 664.64 s [vector] mut_foldl: OK
  13298. 664.64 s [vector] +++ OK, passed 100 tests.
  13299. 664.65 s [vector] mut_foldl': OK
  13300. 664.65 s [vector] +++ OK, passed 100 tests.
  13301. 664.65 s [vector] mut_ifoldr: OK
  13302. 664.65 s [vector] +++ OK, passed 100 tests.
  13303. 664.66 s [vector] mut_ifoldr': OK
  13304. 664.66 s [vector] +++ OK, passed 100 tests.
  13305. 664.66 s [vector] mut_ifoldl: OK
  13306. 664.66 s [vector] +++ OK, passed 100 tests.
  13307. 664.66 s [vector] mut_ifoldl': OK
  13308. 664.66 s [vector] +++ OK, passed 100 tests.
  13309. 664.67 s [vector] mut_foldM: OK
  13310. 664.67 s [vector] +++ OK, passed 100 tests.
  13311. 664.67 s [vector] mut_foldM': OK
  13312. 664.67 s [vector] +++ OK, passed 100 tests.
  13313. 664.67 s [vector] mut_foldrM: OK
  13314. 664.67 s [vector] +++ OK, passed 100 tests.
  13315. 664.68 s [vector] mut_foldrM': OK
  13316. 664.68 s [vector] +++ OK, passed 100 tests.
  13317. 664.69 s [vector] mut_ifoldM: OK
  13318. 664.69 s [vector] +++ OK, passed 100 tests.
  13319. 664.69 s [vector] mut_ifoldM': OK
  13320. 664.69 s [vector] +++ OK, passed 100 tests.
  13321. 664.69 s [vector] mut_ifoldrM: OK
  13322. 664.69 s [vector] +++ OK, passed 100 tests.
  13323. 664.70 s [vector] mut_ifoldrM': OK
  13324. 664.70 s [vector] +++ OK, passed 100 tests.
  13325. 664.70 s [vector] compare: OK
  13326. 664.70 s [vector] +++ OK, passed 100 tests.
  13327. 664.70 s [vector] maximum: OK
  13328. 664.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13329. 664.70 s [vector] minimum: OK
  13330. 664.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13331. 664.70 s [vector] minIndex: OK
  13332. 664.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13333. 664.70 s [vector] maxIndex: OK
  13334. 664.70 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13335. 664.71 s [vector] maximumBy: OK
  13336. 664.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13337. 664.71 s [vector] minimumBy: OK
  13338. 664.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13339. 664.71 s [vector] maximumOn: OK
  13340. 664.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13341. 664.71 s [vector] minimumOn: OK
  13342. 664.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13343. 664.71 s [vector] maxIndexBy: OK
  13344. 664.71 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13345. 664.71 s [vector] minIndexBy: OK
  13346. 664.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13347. 664.71 s [vector] ListFirstMaxIndexWins: OK
  13348. 664.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13349. 664.71 s [vector] FalseListFirstMaxIndexWins: OK
  13350. 664.72 s [vector] +++ OK, failed as expected. (after 1 test):
  13351. 664.72 s [vector] Exception:
  13352. 664.72 s [vector] Prelude.foldr1: empty list
  13353. 664.72 s [vector] CallStack (from HasCallStack):
  13354. 664.72 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13355. 664.72 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13356. 664.72 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13357. 664.72 s [vector] []
  13358. 664.72 s [vector] zip: OK
  13359. 664.72 s [vector] +++ OK, passed 100 tests.
  13360. 664.72 s [vector] zip3: OK
  13361. 664.72 s [vector] +++ OK, passed 100 tests.
  13362. 664.72 s [vector] unzip: OK
  13363. 664.72 s [vector] +++ OK, passed 100 tests.
  13364. 664.72 s [vector] unzip3: OK
  13365. 664.73 s [vector] +++ OK, passed 100 tests.
  13366. 664.73 s [vector] indexed: OK
  13367. 664.73 s [vector] +++ OK, passed 100 tests.
  13368. 664.73 s [vector] update: OK
  13369. 664.73 s [vector] +++ OK, passed 100 tests.
  13370. 664.73 s [vector] mempty: OK
  13371. 664.73 s [vector] +++ OK, passed 100 tests.
  13372. 664.73 s [vector] mappend: OK
  13373. 664.73 s [vector] +++ OK, passed 100 tests.
  13374. 664.78 s [vector] mconcat: OK (0.04s)
  13375. 664.78 s [vector] +++ OK, passed 100 tests.
  13376. 664.78 s [vector] glength: OK
  13377. 664.78 s [vector] +++ OK, passed 100 tests.
  13378. 664.78 s [vector] (Int,Bool,Int)
  13379. 664.78 s [vector] fromList.toList == id: OK
  13380. 664.78 s [vector] +++ OK, passed 100 tests.
  13381. 664.78 s [vector] toList.fromList == id: OK
  13382. 664.78 s [vector] +++ OK, passed 100 tests.
  13383. 664.78 s [vector] unstream.stream == id: OK
  13384. 664.78 s [vector] +++ OK, passed 100 tests.
  13385. 664.78 s [vector] stream.unstream == id: OK
  13386. 664.78 s [vector] +++ OK, passed 100 tests.
  13387. 664.79 s [vector] eq: OK
  13388. 664.79 s [vector] +++ OK, passed 100 tests.
  13389. 664.79 s [vector] length: OK
  13390. 664.79 s [vector] +++ OK, passed 100 tests.
  13391. 664.79 s [vector] null: OK
  13392. 664.79 s [vector] +++ OK, passed 100 tests.
  13393. 664.79 s [vector] index: OK
  13394. 664.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13395. 664.79 s [vector] safeIndex: OK
  13396. 664.79 s [vector] +++ OK, passed 100 tests.
  13397. 664.79 s [vector] head: OK
  13398. 664.79 s [vector] +++ OK, passed 100 tests; 23 discarded.
  13399. 664.79 s [vector] last: OK
  13400. 664.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13401. 664.79 s [vector] unsafeIndex: OK
  13402. 664.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13403. 664.79 s [vector] unsafeHead: OK
  13404. 664.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13405. 664.79 s [vector] unsafeLast: OK
  13406. 664.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13407. 664.80 s [vector] slice: OK
  13408. 664.80 s [vector] +++ OK, passed 100 tests.
  13409. 664.80 s [vector] init: OK
  13410. 664.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13411. 664.80 s [vector] tail: OK
  13412. 664.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13413. 664.80 s [vector] take: OK
  13414. 664.80 s [vector] +++ OK, passed 100 tests.
  13415. 664.81 s [vector] drop: OK
  13416. 664.81 s [vector] +++ OK, passed 100 tests.
  13417. 664.81 s [vector] splitAt: OK
  13418. 664.81 s [vector] +++ OK, passed 100 tests.
  13419. 664.81 s [vector] empty: OK
  13420. 664.81 s [vector] +++ OK, passed 100 tests.
  13421. 664.81 s [vector] singleton: OK
  13422. 664.81 s [vector] +++ OK, passed 100 tests.
  13423. 664.81 s [vector] replicate: OK
  13424. 664.81 s [vector] +++ OK, passed 100 tests.
  13425. 664.81 s [vector] generate: OK
  13426. 664.81 s [vector] +++ OK, passed 100 tests.
  13427. 664.81 s [vector] iterateN: OK
  13428. 664.81 s [vector] +++ OK, passed 100 tests.
  13429. 664.83 s [vector] iterateNM: OK (0.02s)
  13430. 664.83 s [vector] +++ OK, passed 100 tests.
  13431. 664.87 s [vector] generateM: OK (0.05s)
  13432. 664.88 s [vector] +++ OK, passed 100 tests.
  13433. 664.89 s [vector] replicateM: OK (0.01s)
  13434. 664.89 s [vector] +++ OK, passed 100 tests.
  13435. 664.89 s [vector] create: OK
  13436. 664.89 s [vector] +++ OK, passed 100 tests.
  13437. 664.89 s [vector] createT: OK
  13438. 664.89 s [vector] +++ OK, passed 100 tests.
  13439. 664.89 s [vector] unfoldr: OK
  13440. 664.89 s [vector] +++ OK, passed 100 tests.
  13441. 664.89 s [vector] unfoldrN: OK
  13442. 664.89 s [vector] +++ OK, passed 100 tests.
  13443. 664.89 s [vector] unfoldrExactN: OK
  13444. 664.89 s [vector] +++ OK, passed 100 tests.
  13445. 664.90 s [vector] unfoldrM: OK
  13446. 664.90 s [vector] +++ OK, passed 100 tests.
  13447. 664.91 s [vector] unfoldrNM: OK
  13448. 664.91 s [vector] +++ OK, passed 100 tests.
  13449. 664.91 s [vector] unfoldrExactNM: OK (0.01s)
  13450. 664.91 s [vector] +++ OK, passed 100 tests.
  13451. 664.92 s [vector] constructN: OK
  13452. 664.93 s [vector] +++ OK, passed 100 tests.
  13453. 664.93 s [vector] constructrN: OK
  13454. 664.93 s [vector] +++ OK, passed 100 tests.
  13455. 664.93 s [vector] cons: OK
  13456. 664.94 s [vector] +++ OK, passed 100 tests.
  13457. 664.94 s [vector] snoc: OK
  13458. 664.94 s [vector] +++ OK, passed 100 tests.
  13459. 664.94 s [vector] append: OK
  13460. 664.95 s [vector] +++ OK, passed 100 tests.
  13461. 665.02 s [vector] concat: OK (0.08s)
  13462. 665.02 s [vector] +++ OK, passed 100 tests.
  13463. 665.02 s [vector] force: OK
  13464. 665.02 s [vector] +++ OK, passed 100 tests.
  13465. 665.04 s [vector] upd: OK
  13466. 665.04 s [vector] +++ OK, passed 100 tests.
  13467. 665.04 s [vector] accum: OK (0.01s)
  13468. 665.04 s [vector] +++ OK, passed 100 tests.
  13469. 665.04 s [vector] reverse: OK
  13470. 665.05 s [vector] +++ OK, passed 100 tests.
  13471. 665.05 s [vector] backpermute: OK
  13472. 665.05 s [vector] +++ OK, passed 100 tests.
  13473. 665.05 s [vector] map: OK
  13474. 665.05 s [vector] +++ OK, passed 100 tests.
  13475. 665.07 s [vector] imap: OK
  13476. 665.07 s [vector] +++ OK, passed 100 tests.
  13477. 665.07 s [vector] concatMap: OK
  13478. 665.07 s [vector] +++ OK, passed 100 tests.
  13479. 665.07 s [vector] mapM: OK
  13480. 665.07 s [vector] +++ OK, passed 100 tests.
  13481. 665.11 s [vector] mapM_: OK (0.04s)
  13482. 665.12 s [vector] +++ OK, passed 100 tests.
  13483. 665.14 s [vector] forM: OK
  13484. 665.14 s [vector] +++ OK, passed 100 tests.
  13485. 665.17 s [vector] forM_: OK (0.04s)
  13486. 665.17 s [vector] +++ OK, passed 100 tests.
  13487. 665.17 s [vector] imapM: OK
  13488. 665.18 s [vector] +++ OK, passed 100 tests.
  13489. 665.25 s [vector] imapM_: OK (0.07s)
  13490. 665.25 s [vector] +++ OK, passed 100 tests.
  13491. 665.25 s [vector] zipWith: OK
  13492. 665.25 s [vector] +++ OK, passed 100 tests.
  13493. 665.26 s [vector] zipWith3: OK
  13494. 665.26 s [vector] +++ OK, passed 100 tests.
  13495. 665.27 s [vector] izipWith: OK
  13496. 665.27 s [vector] +++ OK, passed 100 tests.
  13497. 665.27 s [vector] izipWith3: OK
  13498. 665.27 s [vector] +++ OK, passed 100 tests.
  13499. 665.29 s [vector] izipWithM: OK
  13500. 665.29 s [vector] +++ OK, passed 100 tests.
  13501. 665.33 s [vector] izipWithM_: OK (0.04s)
  13502. 665.33 s [vector] +++ OK, passed 100 tests.
  13503. 665.33 s [vector] zipWithM: OK
  13504. 665.33 s [vector] +++ OK, passed 100 tests.
  13505. 665.37 s [vector] zipWithM_: OK (0.03s)
  13506. 665.37 s [vector] +++ OK, passed 100 tests.
  13507. 665.37 s [vector] filter: OK
  13508. 665.37 s [vector] +++ OK, passed 100 tests.
  13509. 665.37 s [vector] ifilter: OK
  13510. 665.37 s [vector] +++ OK, passed 100 tests.
  13511. 665.47 s [vector] filterM: OK (0.09s)
  13512. 665.47 s [vector] +++ OK, passed 100 tests.
  13513. 665.47 s [vector] uniq: OK
  13514. 665.47 s [vector] +++ OK, passed 100 tests.
  13515. 665.49 s [vector] mapMaybe: OK
  13516. 665.49 s [vector] +++ OK, passed 100 tests.
  13517. 665.49 s [vector] imapMaybe: OK
  13518. 665.49 s [vector] +++ OK, passed 100 tests.
  13519. 665.49 s [vector] takeWhile: OK
  13520. 665.49 s [vector] +++ OK, passed 100 tests.
  13521. 665.49 s [vector] dropWhile: OK
  13522. 665.50 s [vector] +++ OK, passed 100 tests.
  13523. 665.51 s [vector] partition: OK
  13524. 665.51 s [vector] +++ OK, passed 100 tests.
  13525. 665.51 s [vector] partitionWith: OK
  13526. 665.51 s [vector] +++ OK, passed 100 tests.
  13527. 665.51 s [vector] span: OK
  13528. 665.51 s [vector] +++ OK, passed 100 tests.
  13529. 665.52 s [vector] break: OK
  13530. 665.52 s [vector] +++ OK, passed 100 tests.
  13531. 665.53 s [vector] spanR: OK
  13532. 665.53 s [vector] +++ OK, passed 100 tests.
  13533. 665.53 s [vector] breakR: OK
  13534. 665.54 s [vector] +++ OK, passed 100 tests.
  13535. 665.54 s [vector] groupBy: OK
  13536. 665.54 s [vector] +++ OK, passed 100 tests.
  13537. 665.54 s [vector] elem: OK
  13538. 665.54 s [vector] +++ OK, passed 100 tests.
  13539. 665.54 s [vector] notElem: OK
  13540. 665.54 s [vector] +++ OK, passed 100 tests.
  13541. 665.54 s [vector] find: OK
  13542. 665.54 s [vector] +++ OK, passed 100 tests.
  13543. 665.54 s [vector] findIndex: OK
  13544. 665.54 s [vector] +++ OK, passed 100 tests.
  13545. 665.54 s [vector] findIndexR: OK
  13546. 665.55 s [vector] +++ OK, passed 100 tests.
  13547. 665.55 s [vector] findIndices: OK
  13548. 665.55 s [vector] +++ OK, passed 100 tests.
  13549. 665.55 s [vector] elemIndex: OK
  13550. 665.55 s [vector] +++ OK, passed 100 tests.
  13551. 665.55 s [vector] elemIndices: OK
  13552. 665.56 s [vector] +++ OK, passed 100 tests.
  13553. 665.57 s [vector] foldl: OK
  13554. 665.57 s [vector] +++ OK, passed 100 tests.
  13555. 665.57 s [vector] foldl1: OK
  13556. 665.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13557. 665.59 s [vector] foldl': OK
  13558. 665.59 s [vector] +++ OK, passed 100 tests.
  13559. 665.59 s [vector] foldl1': OK (0.01s)
  13560. 665.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13561. 665.60 s [vector] foldr: OK
  13562. 665.61 s [vector] +++ OK, passed 100 tests.
  13563. 665.61 s [vector] foldr1: OK
  13564. 665.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13565. 665.63 s [vector] foldr': OK
  13566. 665.63 s [vector] +++ OK, passed 100 tests.
  13567. 665.63 s [vector] foldr1': OK
  13568. 665.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13569. 665.64 s [vector] ifoldl: OK
  13570. 665.65 s [vector] +++ OK, passed 100 tests.
  13571. 665.66 s [vector] ifoldl': OK (0.01s)
  13572. 665.66 s [vector] +++ OK, passed 100 tests.
  13573. 665.68 s [vector] ifoldr: OK (0.01s)
  13574. 665.68 s [vector] +++ OK, passed 100 tests.
  13575. 665.69 s [vector] ifoldr': OK (0.01s)
  13576. 665.69 s [vector] +++ OK, passed 100 tests.
  13577. 665.70 s [vector] ifoldM: OK (0.01s)
  13578. 665.70 s [vector] +++ OK, passed 100 tests.
  13579. 665.72 s [vector] ifoldM': OK (0.01s)
  13580. 665.72 s [vector] +++ OK, passed 100 tests.
  13581. 665.78 s [vector] ifoldM_: OK (0.07s)
  13582. 665.78 s [vector] +++ OK, passed 100 tests.
  13583. 665.85 s [vector] ifoldM'_: OK (0.07s)
  13584. 665.85 s [vector] +++ OK, passed 100 tests.
  13585. 665.85 s [vector] all: OK
  13586. 665.85 s [vector] +++ OK, passed 100 tests.
  13587. 665.85 s [vector] any: OK
  13588. 665.85 s [vector] +++ OK, passed 100 tests.
  13589. 665.87 s [vector] prescanl: OK (0.01s)
  13590. 665.87 s [vector] +++ OK, passed 100 tests.
  13591. 665.87 s [vector] prescanl': OK (0.01s)
  13592. 665.87 s [vector] +++ OK, passed 100 tests.
  13593. 665.89 s [vector] postscanl: OK (0.02s)
  13594. 665.89 s [vector] +++ OK, passed 100 tests.
  13595. 665.92 s [vector] postscanl': OK (0.01s)
  13596. 665.92 s [vector] +++ OK, passed 100 tests.
  13597. 665.93 s [vector] scanl: OK (0.02s)
  13598. 665.93 s [vector] +++ OK, passed 100 tests.
  13599. 665.93 s [vector] scanl': OK (0.02s)
  13600. 665.93 s [vector] +++ OK, passed 100 tests.
  13601. 665.95 s [vector] scanl1: OK (0.01s)
  13602. 665.95 s [vector] +++ OK, passed 100 tests.
  13603. 665.97 s [vector] scanl1': OK (0.01s)
  13604. 665.97 s [vector] +++ OK, passed 100 tests.
  13605. 665.97 s [vector] iscanl: OK (0.02s)
  13606. 665.97 s [vector] +++ OK, passed 100 tests.
  13607. 665.99 s [vector] iscanl': OK (0.02s)
  13608. 665.99 s [vector] +++ OK, passed 100 tests.
  13609. 666.01 s [vector] prescanr: OK (0.02s)
  13610. 666.01 s [vector] +++ OK, passed 100 tests.
  13611. 666.03 s [vector] prescanr': OK (0.01s)
  13612. 666.03 s [vector] +++ OK, passed 100 tests.
  13613. 666.03 s [vector] postscanr: OK (0.01s)
  13614. 666.03 s [vector] +++ OK, passed 100 tests.
  13615. 666.04 s [vector] postscanr': OK
  13616. 666.05 s [vector] +++ OK, passed 100 tests.
  13617. 666.05 s [vector] scanr: OK (0.01s)
  13618. 666.05 s [vector] +++ OK, passed 100 tests.
  13619. 666.07 s [vector] scanr': OK (0.01s)
  13620. 666.07 s [vector] +++ OK, passed 100 tests.
  13621. 666.08 s [vector] scanr1: OK (0.01s)
  13622. 666.08 s [vector] +++ OK, passed 100 tests.
  13623. 666.09 s [vector] scanr1': OK
  13624. 666.09 s [vector] +++ OK, passed 100 tests.
  13625. 666.11 s [vector] iscanr: OK (0.01s)
  13626. 666.11 s [vector] +++ OK, passed 100 tests.
  13627. 666.12 s [vector] iscanr': OK (0.01s)
  13628. 666.12 s [vector] +++ OK, passed 100 tests.
  13629. 666.12 s [vector] mut_read: OK
  13630. 666.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13631. 666.12 s [vector] mut_write: OK
  13632. 666.12 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13633. 666.15 s [vector] mut_modify: OK
  13634. 666.15 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13635. 666.17 s [vector] mut_generate: OK (0.02s)
  13636. 666.17 s [vector] +++ OK, passed 100 tests.
  13637. 666.19 s [vector] mut_generateM: OK (0.03s)
  13638. 666.19 s [vector] +++ OK, passed 100 tests.
  13639. 666.25 s [vector] mut_mapM_: OK (0.06s)
  13640. 666.25 s [vector] +++ OK, passed 100 tests.
  13641. 666.30 s [vector] mut_imapM_: OK (0.06s)
  13642. 666.30 s [vector] +++ OK, passed 100 tests.
  13643. 666.37 s [vector] mut_forM_: OK (0.04s)
  13644. 666.37 s [vector] +++ OK, passed 100 tests.
  13645. 666.51 s [vector] mut_iforM_: OK (0.07s)
  13646. 666.51 s [vector] +++ OK, passed 100 tests.
  13647. 666.51 s [vector] mut_foldr: OK
  13648. 666.51 s [vector] +++ OK, passed 100 tests.
  13649. 666.51 s [vector] mut_foldr': OK
  13650. 666.51 s [vector] +++ OK, passed 100 tests.
  13651. 666.51 s [vector] mut_foldl: OK
  13652. 666.51 s [vector] +++ OK, passed 100 tests.
  13653. 666.51 s [vector] mut_foldl': OK
  13654. 666.51 s [vector] +++ OK, passed 100 tests.
  13655. 666.51 s [vector] mut_ifoldr: OK
  13656. 666.51 s [vector] +++ OK, passed 100 tests.
  13657. 666.51 s [vector] mut_ifoldr': OK (0.01s)
  13658. 666.51 s [vector] +++ OK, passed 100 tests.
  13659. 666.51 s [vector] mut_ifoldl: OK (0.01s)
  13660. 666.51 s [vector] +++ OK, passed 100 tests.
  13661. 666.51 s [vector] mut_ifoldl': OK
  13662. 666.51 s [vector] +++ OK, passed 100 tests.
  13663. 666.51 s [vector] mut_foldM: OK
  13664. 666.51 s [vector] +++ OK, passed 100 tests.
  13665. 666.52 s [vector] mut_foldM': OK
  13666. 666.53 s [vector] +++ OK, passed 100 tests.
  13667. 666.53 s [vector] mut_foldrM: OK
  13668. 666.53 s [vector] +++ OK, passed 100 tests.
  13669. 666.54 s [vector] mut_foldrM': OK
  13670. 666.54 s [vector] +++ OK, passed 100 tests.
  13671. 666.54 s [vector] mut_ifoldM: OK
  13672. 666.55 s [vector] +++ OK, passed 100 tests.
  13673. 666.55 s [vector] mut_ifoldM': OK
  13674. 666.56 s [vector] +++ OK, passed 100 tests.
  13675. 666.56 s [vector] mut_ifoldrM: OK
  13676. 666.57 s [vector] +++ OK, passed 100 tests.
  13677. 666.57 s [vector] mut_ifoldrM': OK
  13678. 666.57 s [vector] +++ OK, passed 100 tests.
  13679. 666.58 s [vector] compare: OK
  13680. 666.58 s [vector] +++ OK, passed 100 tests.
  13681. 666.58 s [vector] maximum: OK
  13682. 666.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13683. 666.58 s [vector] minimum: OK
  13684. 666.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13685. 666.58 s [vector] minIndex: OK
  13686. 666.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13687. 666.58 s [vector] maxIndex: OK
  13688. 666.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13689. 666.58 s [vector] maximumBy: OK
  13690. 666.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13691. 666.59 s [vector] minimumBy: OK
  13692. 666.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13693. 666.59 s [vector] maximumOn: OK
  13694. 666.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13695. 666.59 s [vector] minimumOn: OK
  13696. 666.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13697. 666.59 s [vector] maxIndexBy: OK
  13698. 666.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13699. 666.59 s [vector] minIndexBy: OK
  13700. 666.59 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13701. 666.60 s [vector] ListFirstMaxIndexWins: OK
  13702. 666.60 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13703. 666.60 s [vector] FalseListFirstMaxIndexWins: OK
  13704. 666.60 s [vector] +++ OK, failed as expected. (after 1 test):
  13705. 666.60 s [vector] Exception:
  13706. 666.60 s [vector] Prelude.foldr1: empty list
  13707. 666.60 s [vector] CallStack (from HasCallStack):
  13708. 666.60 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13709. 666.60 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13710. 666.60 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13711. 666.60 s [vector] []
  13712. 666.60 s [vector] zip: OK
  13713. 666.61 s [vector] +++ OK, passed 100 tests.
  13714. 666.61 s [vector] zip3: OK
  13715. 666.61 s [vector] +++ OK, passed 100 tests.
  13716. 666.61 s [vector] unzip: OK
  13717. 666.61 s [vector] +++ OK, passed 100 tests.
  13718. 666.62 s [vector] unzip3: OK
  13719. 666.62 s [vector] +++ OK, passed 100 tests.
  13720. 666.62 s [vector] indexed: OK
  13721. 666.63 s [vector] +++ OK, passed 100 tests.
  13722. 666.63 s [vector] update: OK
  13723. 666.63 s [vector] +++ OK, passed 100 tests.
  13724. 666.63 s [vector] mempty: OK
  13725. 666.63 s [vector] +++ OK, passed 100 tests.
  13726. 666.65 s [vector] mappend: OK
  13727. 666.65 s [vector] +++ OK, passed 100 tests.
  13728. 666.73 s [vector] mconcat: OK (0.09s)
  13729. 666.73 s [vector] +++ OK, passed 100 tests.
  13730. 666.73 s [vector] glength: OK
  13731. 666.73 s [vector] +++ OK, passed 100 tests.
  13732. 666.73 s [vector] unstream
  13733. 666.73 s [vector] unstream == vunstream (exact): OK
  13734. 666.73 s [vector] +++ OK, passed 100 tests.
  13735. 666.73 s [vector] unstream == vunstream (unknown): OK
  13736. 666.73 s [vector] +++ OK, passed 100 tests.
  13737. 666.73 s [vector] unstreamR ~= vunstream (exact): OK
  13738. 666.73 s [vector] +++ OK, passed 100 tests.
  13739. 666.73 s [vector] unstreamR ~= vunstream (unknown): OK
  13740. 666.73 s [vector] +++ OK, passed 100 tests.
  13741. 666.73 s [vector] Data.Vector.Storable.Vector Alignment
  13742. 666.73 s [vector] Aligned Double: OK
  13743. 666.73 s [vector] Aligned Int: OK
  13744. 666.73 s [vector] Regression tests
  13745. 666.73 s [vector] enumFromTo crash #188
  13746. 666.73 s [vector] Word8: OK
  13747. 666.73 s [vector] Word16: OK
  13748. 666.73 s [vector] Word32: OK
  13749. 666.73 s [vector] Word64: OK
  13750. 666.73 s [vector] Word: OK
  13751. 666.73 s [vector] Int8: OK
  13752. 666.73 s [vector] Int16: OK
  13753. 666.73 s [vector] Int32: OK
  13754. 666.73 s [vector] Int64: OK
  13755. 666.73 s [vector] Int: OK
  13756. 666.73 s [vector] Char: OK
  13757. 666.73 s [vector] Negative tests
  13758. 666.73 s [vector] slice out of bounds #257
  13759. 666.74 s [vector] Boxed
  13760. 666.74 s [vector] Negative ix: OK
  13761. 666.74 s [vector] Negative size: OK
  13762. 666.74 s [vector] Negative ix and size: OK
  13763. 666.74 s [vector] Too large ix: OK
  13764. 666.74 s [vector] Too large size: OK
  13765. 666.74 s [vector] Too large ix and size: OK
  13766. 666.74 s [vector] Overflow: OK
  13767. 666.74 s [vector] OutOfMemory: OK
  13768. 666.74 s [vector] Primitive
  13769. 666.74 s [vector] Negative ix: OK
  13770. 666.74 s [vector] Negative size: OK
  13771. 666.74 s [vector] Negative ix and size: OK
  13772. 666.74 s [vector] Too large ix: OK
  13773. 666.74 s [vector] Too large size: OK
  13774. 666.74 s [vector] Too large ix and size: OK
  13775. 666.74 s [vector] Overflow: OK
  13776. 666.74 s [vector] OutOfMemory: OK
  13777. 666.74 s [vector] Storable
  13778. 666.74 s [vector] Negative ix: OK
  13779. 666.74 s [vector] Negative size: OK
  13780. 666.74 s [vector] Negative ix and size: OK
  13781. 666.74 s [vector] Too large ix: OK
  13782. 666.74 s [vector] Too large size: OK
  13783. 666.74 s [vector] Too large ix and size: OK
  13784. 666.74 s [vector] Overflow: OK
  13785. 666.74 s [vector] OutOfMemory: OK
  13786. 666.74 s [vector] Unboxed
  13787. 666.74 s [vector] Negative ix: OK
  13788. 666.74 s [vector] Negative size: OK
  13789. 666.74 s [vector] Negative ix and size: OK
  13790. 666.74 s [vector] Too large ix: OK
  13791. 666.74 s [vector] Too large size: OK
  13792. 666.74 s [vector] Too large ix and size: OK
  13793. 666.74 s [vector] Overflow: OK
  13794. 666.74 s [vector] OutOfMemory: OK
  13795. 666.74 s [vector] take #282
  13796. 666.74 s [vector] Boxed: OK
  13797. 666.74 s [vector] Primitive: OK
  13798. 666.74 s [vector] Storable: OK
  13799. 666.74 s [vector] Unboxed: OK
  13800. 666.74 s [vector] Data.Vector
  13801. 666.74 s [vector] MonadFix: OK
  13802. 666.74 s [vector] toFromArray: OK
  13803. 666.74 s [vector] toFromArraySlice: OK
  13804. 666.74 s [vector] toFromArraySliceUnsafe: OK
  13805. 666.74 s [vector] toFromMutableArray: OK
  13806. 666.74 s [vector] Data.Vector.Mutable (Move): OK
  13807. 666.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13808. 666.74 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  13809. 666.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13810. 666.74 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  13811. 666.74 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13812. 666.75 s [vector] Data.Vector.Storable.Mutable (Move): OK
  13813. 666.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13814. 666.77 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
  13815. 666.77 s [vector] +++ OK, passed 100 tests.
  13816. 666.78 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  13817. 666.78 s [vector] +++ OK, passed 100 tests.
  13818. 666.78 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  13819. 666.78 s [vector] +++ OK, passed 100 tests.
  13820. 666.78 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  13821. 666.78 s [vector] +++ OK, passed 100 tests.
  13822. 666.78 s [vector]
  13823. 666.78 s [vector] All 2808 tests passed (20.01s)
  13824. 666.79 s [vector] Test suite vector-tests-O2: PASS
  13825. 666.79 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  13826. 666.79 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  13827. 666.82 s [vector] checkPhase completed in 49 seconds
  13828. 666.82 s [vector] Phase: haddockPhase
  13829. 666.83 s [vector] Phase: installPhase
  13830. 667.12 s [vector] Installing library in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  13831. 668.44 s [vector] Installing internal library benchmarks-O2 in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2
  13832. 669.17 s [vector] Phase: fixupPhase
  13833. 669.22 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0
  13834. 669.23 s [vector] shrinking /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSvector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2-ghc9.10.3.so
  13835. 669.25 s [vector] shrinking /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSvector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a-ghc9.10.3.so
  13836. 669.29 s [vector] checking for references to /build/ in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0...
  13837. 669.36 s [vector] patching script interpreter paths in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0
  13838. 669.37 s [vector] stripping (with command strip and flags -S -p) in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib
  13839. 671.32 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0
  13840. 672.40 s [vector:post-build] Nothing to push - all store paths are already on Cachix.
  13841. 672.48 s [vector:post-build] Uploading to the NixCI cache: /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0
  13842. 672.73 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13843. 672.80 s [vector:post-build] copying 1 paths...
  13844. 672.80 s [vector:post-build] copying path '/nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  13845. 704.31 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13846. 704.68 s [vector:post-build] copying 0 paths...
  13847. 704.90 s Progress: 5 of 15 built, 159 of 159 downloaded from cache
  13848. 705.07 s Building /nix/store/xqd70lna4yqvx8fhh3rrk8vnfp0y8k68-nothunks-0.3.1.drv
  13849. 705.37 s [nothunks] Phase: setupCompilerEnvironmentPhase
  13850. 705.37 s [nothunks] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  13851. 706.14 s [nothunks] Phase: unpackPhase
  13852. 706.16 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  13853. 706.18 s [nothunks] source root is nothunks-0.3.1
  13854. 706.21 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  13855. 706.23 s [nothunks] Phase: patchPhase
  13856. 706.26 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  13857. 706.28 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  13858. 706.32 s [nothunks] Phase: compileBuildDriverPhase
  13859. 706.33 s [nothunks] setupCompileFlags: -package-db=/build/tmp.fNsLtRQxqw/setup-package.conf.d -threaded
  13860. 706.54 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.fNsLtRQxqw/Main.o )
  13861. 706.73 s [nothunks] [2 of 2] Linking Setup
  13862. 710.68 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  13863. 710.71 s [nothunks] Phase: configurePhase
  13864. 710.74 s [nothunks] configureFlags: --verbose --prefix=/nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.fNsLtRQxqw/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  13865. 710.77 s [nothunks] Using Parsec parser
  13866. 710.77 s [nothunks] Configuring nothunks-0.3.1...
  13867. 712.34 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  13868. 713.40 s [nothunks] Dependency base: using base-4.20.2.0
  13869. 713.40 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
  13870. 713.40 s [nothunks] Dependency containers: using containers-0.7
  13871. 713.40 s [nothunks] Dependency ghc-heap: using ghc-heap-9.10.3
  13872. 713.40 s [nothunks] Dependency stm: using stm-2.5.3.1
  13873. 713.40 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.3
  13874. 713.40 s [nothunks] Dependency time: using time-1.12.2
  13875. 713.40 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  13876. 713.40 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  13877. 713.40 s [nothunks] Dependency base: using base-4.20.2.0
  13878. 713.40 s [nothunks] Dependency containers: using containers-0.7
  13879. 713.40 s [nothunks] Dependency ghc-prim: using ghc-prim-0.12.0
  13880. 713.40 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  13881. 713.40 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  13882. 713.40 s [nothunks] Dependency random: using random-1.2.1.3
  13883. 713.40 s [nothunks] Dependency stm: using stm-2.5.3.1
  13884. 713.40 s [nothunks] Dependency tasty: using tasty-1.5.3
  13885. 713.40 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  13886. 713.40 s [nothunks] Source component graph:
  13887. 713.40 s [nothunks] component lib
  13888. 713.40 s [nothunks] component test:nothunks-test dependency lib
  13889. 713.40 s [nothunks] Configured component graph:
  13890. 713.41 s [nothunks] component nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13891. 713.41 s [nothunks] include base-4.20.2.0-64da
  13892. 713.41 s [nothunks] include bytestring-0.12.2.0-262e
  13893. 713.41 s [nothunks] include containers-0.7-504a
  13894. 713.41 s [nothunks] include ghc-heap-9.10.3-7805
  13895. 713.41 s [nothunks] include stm-2.5.3.1-a2f3
  13896. 713.41 s [nothunks] include text-2.1.3-c691
  13897. 713.41 s [nothunks] include time-1.12.2-652a
  13898. 713.41 s [nothunks] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  13899. 713.41 s [nothunks] include wherefrom-compat-0.1.1.1-yp5RypMYSz1KLSyhMA9Ta
  13900. 713.41 s [nothunks] component nothunks-0.3.1-9PLORH1jEHICdQFPMi70o3-nothunks-test
  13901. 713.41 s [nothunks] include base-4.20.2.0-64da
  13902. 713.41 s [nothunks] include containers-0.7-504a
  13903. 713.41 s [nothunks] include ghc-prim-0.12.0-1d7d
  13904. 713.41 s [nothunks] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  13905. 713.41 s [nothunks] include nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13906. 713.41 s [nothunks] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  13907. 713.41 s [nothunks] include stm-2.5.3.1-a2f3
  13908. 713.41 s [nothunks] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  13909. 713.41 s [nothunks] include tasty-hedgehog-1.4.0.2-2xK7lvGG5mD8uErfBwrBze
  13910. 713.41 s [nothunks] Linked component graph:
  13911. 713.41 s [nothunks] unit nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13912. 713.41 s [nothunks] include base-4.20.2.0-64da
  13913. 713.41 s [nothunks] include bytestring-0.12.2.0-262e
  13914. 713.41 s [nothunks] include containers-0.7-504a
  13915. 713.41 s [nothunks] include ghc-heap-9.10.3-7805
  13916. 713.41 s [nothunks] include stm-2.5.3.1-a2f3
  13917. 713.41 s [nothunks] include text-2.1.3-c691
  13918. 713.41 s [nothunks] include time-1.12.2-652a
  13919. 713.41 s [nothunks] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  13920. 713.41 s [nothunks] include wherefrom-compat-0.1.1.1-yp5RypMYSz1KLSyhMA9Ta
  13921. 713.42 s [nothunks] NoThunks.Class=nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam:NoThunks.Class
  13922. 713.42 s [nothunks] unit nothunks-0.3.1-9PLORH1jEHICdQFPMi70o3-nothunks-test
  13923. 713.42 s [nothunks] include base-4.20.2.0-64da
  13924. 713.42 s [nothunks] include containers-0.7-504a
  13925. 713.42 s [nothunks] include ghc-prim-0.12.0-1d7d
  13926. 713.42 s [nothunks] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  13927. 713.42 s [nothunks] include nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13928. 713.42 s [nothunks] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  13929. 713.42 s [nothunks] include stm-2.5.3.1-a2f3
  13930. 713.42 s [nothunks] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  13931. 713.42 s [nothunks] include tasty-hedgehog-1.4.0.2-2xK7lvGG5mD8uErfBwrBze
  13932. 713.42 s [nothunks] Ready component graph:
  13933. 713.42 s [nothunks] definite nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13934. 713.42 s [nothunks] depends base-4.20.2.0-64da
  13935. 713.42 s [nothunks] depends bytestring-0.12.2.0-262e
  13936. 713.42 s [nothunks] depends containers-0.7-504a
  13937. 713.42 s [nothunks] depends ghc-heap-9.10.3-7805
  13938. 713.42 s [nothunks] depends stm-2.5.3.1-a2f3
  13939. 713.42 s [nothunks] depends text-2.1.3-c691
  13940. 713.42 s [nothunks] depends time-1.12.2-652a
  13941. 713.42 s [nothunks] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  13942. 713.42 s [nothunks] depends wherefrom-compat-0.1.1.1-yp5RypMYSz1KLSyhMA9Ta
  13943. 713.42 s [nothunks] definite nothunks-0.3.1-9PLORH1jEHICdQFPMi70o3-nothunks-test
  13944. 713.42 s [nothunks] depends base-4.20.2.0-64da
  13945. 713.42 s [nothunks] depends containers-0.7-504a
  13946. 713.42 s [nothunks] depends ghc-prim-0.12.0-1d7d
  13947. 713.42 s [nothunks] depends hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  13948. 713.42 s [nothunks] depends nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13949. 713.42 s [nothunks] depends random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  13950. 713.42 s [nothunks] depends stm-2.5.3.1-a2f3
  13951. 713.42 s [nothunks] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  13952. 713.42 s [nothunks] depends tasty-hedgehog-1.4.0.2-2xK7lvGG5mD8uErfBwrBze
  13953. 713.42 s [nothunks] Using Cabal-3.12.1.0 compiled by ghc-9.10
  13954. 713.42 s [nothunks] Using compiler: ghc-9.10.3
  13955. 713.42 s [nothunks] Using install prefix:
  13956. 713.42 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1
  13957. 713.42 s [nothunks] Executables installed in:
  13958. 713.42 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/bin
  13959. 713.42 s [nothunks] Libraries installed in:
  13960. 713.42 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13961. 713.43 s [nothunks] Dynamic Libraries installed in:
  13962. 713.43 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  13963. 713.43 s [nothunks] Private executables installed in:
  13964. 713.43 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.10.3-05f6/nothunks-0.3.1
  13965. 713.43 s [nothunks] Data files installed in:
  13966. 713.43 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/share/x86_64-linux-ghc-9.10.3-05f6/nothunks-0.3.1
  13967. 713.43 s [nothunks] Documentation installed in:
  13968. 713.43 s [nothunks] /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  13969. 713.43 s [nothunks] Configuration files installed in:
  13970. 713.43 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/etc
  13971. 713.43 s [nothunks] No alex found
  13972. 713.43 s [nothunks] Using ar found on system at:
  13973. 713.43 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  13974. 713.43 s [nothunks] No c2hs found
  13975. 713.43 s [nothunks] No cpphs found
  13976. 713.43 s [nothunks] No doctest found
  13977. 713.43 s [nothunks] Using gcc version 14.3.0 given by user at:
  13978. 713.43 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  13979. 713.43 s [nothunks] Using ghc version 9.10.3 found on system at:
  13980. 713.43 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  13981. 713.43 s [nothunks] Using ghc-pkg version 9.10.3 found on system at:
  13982. 713.43 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  13983. 713.43 s [nothunks] No ghcjs found
  13984. 713.43 s [nothunks] No ghcjs-pkg found
  13985. 713.43 s [nothunks] No greencard found
  13986. 713.43 s [nothunks] Using haddock version 2.31.1 found on system at:
  13987. 713.43 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  13988. 713.43 s [nothunks] No happy found
  13989. 713.43 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  13990. 713.43 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  13991. 713.43 s [nothunks] No hmake found
  13992. 713.43 s [nothunks] Using hpc version 0.69 found on system at:
  13993. 713.43 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  13994. 713.43 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  13995. 713.43 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  13996. 713.43 s [nothunks] Using hscolour version 1.25 found on system at:
  13997. 713.43 s [nothunks] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  13998. 713.43 s [nothunks] No jhc found
  13999. 713.43 s [nothunks] Using ld found on system at:
  14000. 713.43 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  14001. 713.43 s [nothunks] No pkg-config found
  14002. 713.43 s [nothunks] Using runghc version 9.10.3 found on system at:
  14003. 713.43 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  14004. 713.43 s [nothunks] Using strip version 2.44 found on system at:
  14005. 713.43 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  14006. 713.43 s [nothunks] Using tar found on system at:
  14007. 713.43 s [nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  14008. 713.43 s [nothunks] No uhc found
  14009. 714.30 s [nothunks] Phase: buildPhase
  14010. 714.60 s [nothunks] Preprocessing library for nothunks-0.3.1...
  14011. 714.60 s [nothunks] Building library for nothunks-0.3.1...
  14012. 714.89 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  14013. 721.03 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  14014. 727.96 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  14015. 727.96 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1...
  14016. 728.20 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 )
  14017. 732.52 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  14018. 733.17 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  14019. 735.08 s [nothunks] Phase: checkPhase
  14020. 735.64 s [nothunks] Running 1 test suites...
  14021. 735.64 s [nothunks] Test suite nothunks-test: RUNNING...
  14022. 735.65 s [nothunks] Tests
  14023. 735.65 s [nothunks] NoThunks.Class
  14024. 735.65 s [nothunks] Sanity
  14025. 735.65 s [nothunks] IntNotNF: OK
  14026. 735.65 s [nothunks] ✓ <interactive> passed 1 test.
  14027. 735.65 s [nothunks] IntIsNF: OK
  14028. 735.65 s [nothunks] ✓ <interactive> passed 1 test.
  14029. 735.65 s [nothunks] Pair: OK
  14030. 735.65 s [nothunks] ✓ <interactive> passed 1 test.
  14031. 735.65 s [nothunks] Sum: OK
  14032. 735.65 s [nothunks] ✓ <interactive> passed 1 test.
  14033. 735.65 s [nothunks] Fn: OK
  14034. 735.65 s [nothunks] ✓ <interactive> passed 1 test.
  14035. 735.65 s [nothunks] IO: OK
  14036. 735.66 s [nothunks] ✓ <interactive> passed 1 test.
  14037. 735.66 s [nothunks] InspectHeap
  14038. 735.68 s [nothunks] Int: OK (0.02s)
  14039. 735.68 s [nothunks] ✓ <interactive> passed 1000 tests.
  14040. 735.68 s [nothunks] Just ["Int"] 49% █████████▊··········
  14041. 735.68 s [nothunks] Nothing 51% ██████████▏·········
  14042. 735.70 s [nothunks] IntInt: OK (0.02s)
  14043. 735.70 s [nothunks] ✓ <interactive> passed 1000 tests.
  14044. 735.70 s [nothunks] Just ["Int","Tuple2"] 39% ███████▋············
  14045. 735.70 s [nothunks] Just ["Tuple2"] 49% █████████▊··········
  14046. 735.70 s [nothunks] Nothing 12% ██▍·················
  14047. 735.72 s [nothunks] SumInt: OK (0.02s)
  14048. 735.72 s [nothunks] ✓ <interactive> passed 1000 tests.
  14049. 735.72 s [nothunks] Just ["Either"] 35% ██████▉·············
  14050. 735.72 s [nothunks] Just ["Int","Either"] 33% ██████▋·············
  14051. 735.72 s [nothunks] Nothing 32% ██████▍·············
  14052. 735.74 s [nothunks] ListInt: OK (0.02s)
  14053. 735.74 s [nothunks] ✓ <interactive> passed 1000 tests.
  14054. 735.74 s [nothunks] Just ["Int","List"] 23% ████▌···············
  14055. 735.74 s [nothunks] Just ["List"] 43% ████████▌···········
  14056. 735.74 s [nothunks] Nothing 34% ██████▊·············
  14057. 735.76 s [nothunks] IntListInt: OK (0.03s)
  14058. 735.76 s [nothunks] ✓ <interactive> passed 1000 tests.
  14059. 735.76 s [nothunks] Just ["Int","List","Tuple2"] 5% █···················
  14060. 735.76 s [nothunks] Just ["Int","Tuple2"] 24% ████▋···············
  14061. 735.76 s [nothunks] Just ["List","Tuple2"] 11% ██▏·················
  14062. 735.76 s [nothunks] Just ["Tuple2"] 50% ██████████··········
  14063. 735.76 s [nothunks] Nothing 9% █▊··················
  14064. 735.80 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  14065. 735.80 s [nothunks] after 12 tests.
  14066. 735.80 s [nothunks] shrink path: 12:
  14067. 735.80 s [nothunks] Just ["Int","Seq"] 58% ███████████▋········
  14068. 735.80 s [nothunks] Nothing 33% ██████▋·············
  14069. 735.80 s [nothunks]
  14070. 735.80 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  14071. 735.80 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  14072. 735.80 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  14073. 735.80 s [nothunks] 168 ┃ -> Proxy a
  14074. 735.80 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  14075. 735.80 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  14076. 735.80 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  14077. 735.80 s [nothunks] 172 ┃ -> Property
  14078. 735.80 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  14079. 735.80 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  14080. 735.80 s [nothunks] ┃ │ Wrap
  14081. 735.80 s [nothunks] ┃ │ { unwrap =
  14082. 735.80 s [nothunks] ┃ │ SeqEnqueue
  14083. 735.80 s [nothunks] ┃ │ (IntValue 0)
  14084. 735.80 s [nothunks] ┃ │ (SeqEnqueue
  14085. 735.80 s [nothunks] ┃ │ (IntValue 0)
  14086. 735.80 s [nothunks] ┃ │ (SeqEnqueue
  14087. 735.80 s [nothunks] ┃ │ (IntValue 0)
  14088. 735.80 s [nothunks] ┃ │ (SeqEnqueue
  14089. 735.80 s [nothunks] ┃ │ (IntValue 0)
  14090. 735.80 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  14091. 735.80 s [nothunks] ┃ │ }
  14092. 735.80 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  14093. 735.80 s [nothunks] 176 ┃ fromModel m $ \a -> do
  14094. 735.80 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  14095. 735.80 s [nothunks] ┃ │ IsNF
  14096. 735.80 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  14097. 735.80 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  14098. 735.80 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14099. 735.80 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  14100. 735.80 s [nothunks] ┃ │ - Just
  14101. 735.80 s [nothunks] ┃ │ - ThunkInfo
  14102. 735.80 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  14103. 735.80 s [nothunks] ┃ │ + Nothing
  14104. 735.80 s [nothunks]
  14105. 735.80 s [nothunks] This failure can be reproduced by running:
  14106. 735.81 s [nothunks] > recheckAt (Seed 15325251014833532358 13322120031038168575) "12:" EXPECTED FAILURE
  14107. 735.81 s [nothunks]
  14108. 735.82 s [nothunks] OK (0.04s)
  14109. 735.82 s [nothunks] ✓ <interactive> passed 1 test.
  14110. 735.82 s [nothunks] Model
  14111. 735.84 s [nothunks] Int: OK (0.02s)
  14112. 735.84 s [nothunks] ✓ <interactive> passed 1000 tests.
  14113. 735.84 s [nothunks] Just ["Int"] 51% ██████████▎·········
  14114. 735.84 s [nothunks] Nothing 49% █████████▋··········
  14115. 735.84 s [nothunks] IntInt: OK (0.02s)
  14116. 735.84 s [nothunks] ✓ <interactive> passed 1000 tests.
  14117. 735.84 s [nothunks] Just ["Int","Tuple2"] 39% ███████▊············
  14118. 735.84 s [nothunks] Just ["Tuple2"] 49% █████████▉··········
  14119. 735.84 s [nothunks] Nothing 12% ██▎·················
  14120. 735.88 s [nothunks] SumInt: OK
  14121. 735.88 s [nothunks] ✓ <interactive> passed 1000 tests.
  14122. 735.88 s [nothunks] Just ["Either"] 32% ██████▍·············
  14123. 735.88 s [nothunks] Just ["Int","Either"] 33% ██████▋·············
  14124. 735.88 s [nothunks] Nothing 34% ██████▊·············
  14125. 735.90 s [nothunks] ListInt: OK (0.02s)
  14126. 735.90 s [nothunks] ✓ <interactive> passed 1000 tests.
  14127. 735.90 s [nothunks] Just ["Int","List"] 24% ████▊···············
  14128. 735.90 s [nothunks] Just ["List"] 43% ████████▋···········
  14129. 735.90 s [nothunks] Nothing 33% ██████▌·············
  14130. 735.92 s [nothunks] IntListInt: OK (0.03s)
  14131. 735.92 s [nothunks] ✓ <interactive> passed 1000 tests.
  14132. 735.92 s [nothunks] Just ["Int","List","Tuple2"] 5% ▉···················
  14133. 735.92 s [nothunks] Just ["Int","Tuple2"] 24% ████▊···············
  14134. 735.92 s [nothunks] Just ["List","Tuple2"] 12% ██▍·················
  14135. 735.92 s [nothunks] Just ["Tuple2"] 50% ██████████··········
  14136. 735.92 s [nothunks] Nothing 9% █▊··················
  14137. 736.02 s [nothunks] SeqInt: OK (0.10s)
  14138. 736.02 s [nothunks] ✓ <interactive> passed 1000 tests.
  14139. 736.02 s [nothunks] Just ["Int","Seq"] 48% █████████▋··········
  14140. 736.02 s [nothunks] Nothing 52% ██████████▎·········
  14141. 736.06 s [nothunks] AllowThunksIn: OK (0.04s)
  14142. 736.06 s [nothunks] ✓ <interactive> passed 1000 tests.
  14143. 736.06 s [nothunks] Just ["Int","field2","Record"] 25% █████···············
  14144. 736.06 s [nothunks] Just ["Record"] 49% █████████▉··········
  14145. 736.06 s [nothunks] Nothing 25% █████···············
  14146. 736.08 s [nothunks] Fn: OK (0.02s)
  14147. 736.08 s [nothunks] ✓ <interactive> passed 1000 tests.
  14148. 736.08 s [nothunks] Just ["->"] 24% ████▋···············
  14149. 736.08 s [nothunks] Nothing 76% ███████████████▎····
  14150. 736.10 s [nothunks] IO: OK (0.02s)
  14151. 736.10 s [nothunks] ✓ <interactive> passed 1000 tests.
  14152. 736.10 s [nothunks] Just ["IO"] 23% ████▌···············
  14153. 736.10 s [nothunks] Nothing 77% ███████████████▍····
  14154. 736.11 s [nothunks] ThunkFreeFn: OK (0.02s)
  14155. 736.11 s [nothunks] ✓ <interactive> passed 1000 tests.
  14156. 736.11 s [nothunks] Just ["->"] 25% █████···············
  14157. 736.11 s [nothunks] Just ["...","->"] 37% ███████▍············
  14158. 736.11 s [nothunks] Nothing 38% ███████▌············
  14159. 736.13 s [nothunks] ThunkFreeIO: OK (0.01s)
  14160. 736.13 s [nothunks] ✓ <interactive> passed 1000 tests.
  14161. 736.13 s [nothunks] Just ["...","IO"] 37% ███████▎············
  14162. 736.13 s [nothunks] Just ["IO"] 26% █████▏··············
  14163. 736.13 s [nothunks] Nothing 37% ███████▍············
  14164. 736.13 s [nothunks] MutableVars
  14165. 736.13 s [nothunks] IORef
  14166. 736.13 s [nothunks] NotNF: OK
  14167. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14168. 736.13 s [nothunks] NF: OK
  14169. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14170. 736.13 s [nothunks] NotNFPure: OK
  14171. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14172. 736.13 s [nothunks] NFPure: OK
  14173. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14174. 736.13 s [nothunks] NotNFAtomically: OK
  14175. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14176. 736.13 s [nothunks] NFAtomically: OK
  14177. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14178. 736.13 s [nothunks] MVar
  14179. 736.13 s [nothunks] NotNF: OK
  14180. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14181. 736.13 s [nothunks] NF: OK
  14182. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14183. 736.13 s [nothunks] NotNFPure: OK
  14184. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14185. 736.13 s [nothunks] NFPure: OK
  14186. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14187. 736.13 s [nothunks] NotNFAtomically: OK
  14188. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14189. 736.13 s [nothunks] NFAtomically: OK
  14190. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14191. 736.13 s [nothunks] TVar
  14192. 736.13 s [nothunks] NotNF: OK
  14193. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14194. 736.13 s [nothunks] NF: OK
  14195. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14196. 736.13 s [nothunks] NotNFPure: OK
  14197. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14198. 736.13 s [nothunks] NFPure: OK
  14199. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14200. 736.13 s [nothunks] NotNFAtomically: OK
  14201. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14202. 736.13 s [nothunks] NFAtomically: OK
  14203. 736.13 s [nothunks] ✓ <interactive> passed 1 test.
  14204. 736.13 s [nothunks]
  14205. 736.13 s [nothunks] All 41 tests passed (0.48s)
  14206. 736.13 s [nothunks] Test suite nothunks-test: PASS
  14207. 736.13 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  14208. 736.13 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  14209. 736.15 s [nothunks] Phase: haddockPhase
  14210. 736.41 s [nothunks] Preprocessing library for nothunks-0.3.1...
  14211. 736.41 s [nothunks] Running Haddock on library for nothunks-0.3.1...
  14212. 736.42 s [nothunks] Warning: The documentation for the following packages are not installed. No
  14213. 736.42 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  14214. 736.95 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  14215. 738.62 s [nothunks] Haddock coverage:
  14216. 738.63 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  14217. 738.63 s [nothunks] * at src/NoThunks/Class.hs:334:48
  14218. 738.66 s [nothunks] * at src/NoThunks/Class.hs:334:1
  14219. 738.66 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14220. 738.66 s [nothunks] by specifying the type/value namespace explicitly.
  14221. 738.66 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  14222. 738.66 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  14223. 738.66 s [nothunks] * at src/NoThunks/Class.hs:353:25
  14224. 738.66 s [nothunks] * at src/NoThunks/Class.hs:353:1
  14225. 738.66 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14226. 738.66 s [nothunks] by specifying the type/value namespace explicitly.
  14227. 738.66 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  14228. 738.66 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  14229. 738.66 s [nothunks] * at src/NoThunks/Class.hs:358:47
  14230. 738.66 s [nothunks] * at src/NoThunks/Class.hs:358:1
  14231. 738.66 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14232. 738.66 s [nothunks] by specifying the type/value namespace explicitly.
  14233. 738.66 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  14234. 738.66 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  14235. 738.66 s [nothunks] * at src/NoThunks/Class.hs:308:27
  14236. 738.66 s [nothunks] * at src/NoThunks/Class.hs:308:1
  14237. 738.66 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14238. 738.66 s [nothunks] by specifying the type/value namespace explicitly.
  14239. 738.66 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  14240. 738.66 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  14241. 738.66 s [nothunks] * at src/NoThunks/Class.hs:230:18
  14242. 738.66 s [nothunks] * at src/NoThunks/Class.hs:230:1
  14243. 738.66 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14244. 738.66 s [nothunks] by specifying the type/value namespace explicitly.
  14245. 738.66 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  14246. 738.66 s [nothunks] Warning: 'GHC' is out of scope.
  14247. 738.66 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  14248. 738.67 s [nothunks] Warning: 'a' is out of scope.
  14249. 738.67 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  14250. 738.67 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  14251. 738.67 s [nothunks] Missing documentation for:
  14252. 738.67 s [nothunks] Module header
  14253. 739.83 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  14254. 739.83 s [nothunks] - Data.Vector.Vector
  14255. 739.83 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  14256. 739.83 s [nothunks] - NoThunks.Class.HasFields
  14257. 739.83 s [nothunks] - NoThunks.Class.Elem
  14258. 739.83 s [nothunks] - NoThunks.Class.GShowTypeOf
  14259. 739.83 s [nothunks] - NoThunks.Class.GWRecordField
  14260. 739.83 s [nothunks] - NoThunks.Class.checkContainsThunks
  14261. 747.22 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  14262. 747.22 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  14263. 747.34 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  14264. 747.36 s [nothunks] Phase: installPhase
  14265. 747.52 s [nothunks] Installing library in /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  14266. 747.88 s [nothunks] Phase: fixupPhase
  14267. 747.91 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1
  14268. 747.91 s [nothunks] shrinking /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSnothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam-ghc9.10.3.so
  14269. 747.92 s [nothunks] checking for references to /build/ in /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1...
  14270. 747.95 s [nothunks] patching script interpreter paths in /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1
  14271. 747.95 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/lib
  14272. 748.04 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc
  14273. 748.05 s [nothunks] checking for references to /build/ in /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc...
  14274. 748.07 s [nothunks] patching script interpreter paths in /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc
  14275. 748.25 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1 /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc
  14276. 748.75 s [nothunks:post-build] Nothing to push - all store paths are already on Cachix.
  14277. 748.79 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1 /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc
  14278. 748.88 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14279. 748.95 s [nothunks:post-build] copying 1 paths...
  14280. 748.95 s [nothunks:post-build] copying path '/nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  14281. 749.89 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14282. 750.04 s [nothunks:post-build] copying 0 paths...
  14283. 750.10 s Progress: 6 of 15 built, 159 of 159 downloaded from cache
  14284. 750.19 s Building /nix/store/924f0jc8vckgh1byfg683lax1s9a3yn1-unordered-containers-0.2.20.1.drv
  14285. 750.35 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  14286. 750.35 s [unordered-containers] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  14287. 750.61 s [unordered-containers] Phase: unpackPhase
  14288. 750.62 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  14289. 750.63 s [unordered-containers] source root is unordered-containers-0.2.20.1
  14290. 750.64 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  14291. 750.64 s [unordered-containers] Phase: patchPhase
  14292. 750.66 s [unordered-containers] Phase: compileBuildDriverPhase
  14293. 750.67 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.qgcEx9LwF8/setup-package.conf.d -threaded
  14294. 750.77 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.qgcEx9LwF8/Main.o )
  14295. 750.84 s [unordered-containers] [2 of 2] Linking Setup
  14296. 753.57 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  14297. 753.59 s [unordered-containers] Phase: configurePhase
  14298. 753.60 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.qgcEx9LwF8/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  14299. 753.62 s [unordered-containers] Using Parsec parser
  14300. 753.62 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  14301. 754.10 s [unordered-containers] Flags chosen: debug=False
  14302. 754.51 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.20.2.0
  14303. 754.51 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.0.0
  14304. 754.51 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  14305. 754.51 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.22.0.0
  14306. 754.51 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  14307. 754.51 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  14308. 754.51 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  14309. 754.51 s [unordered-containers] Dependency base: using base-4.20.2.0
  14310. 754.51 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  14311. 754.51 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  14312. 754.51 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  14313. 754.51 s [unordered-containers] Dependency random: using random-1.2.1.3
  14314. 754.51 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  14315. 754.51 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  14316. 754.51 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  14317. 754.51 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  14318. 754.51 s [unordered-containers] Source component graph:
  14319. 754.51 s [unordered-containers] component lib
  14320. 754.51 s [unordered-containers] component test:unordered-containers-tests dependency lib
  14321. 754.51 s [unordered-containers] Configured component graph:
  14322. 754.51 s [unordered-containers] component unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14323. 754.51 s [unordered-containers] include base-4.20.2.0-64da
  14324. 754.51 s [unordered-containers] include deepseq-1.5.0.0-9a2c
  14325. 754.51 s [unordered-containers] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14326. 754.51 s [unordered-containers] include template-haskell-2.22.0.0-09e7
  14327. 754.52 s [unordered-containers] component unordered-containers-0.2.20.1-1vi3OXi9xRj6NOlFqsDNWl-unordered-containers-tests
  14328. 754.52 s [unordered-containers] include ChasingBottoms-1.3.1.17-FMp1YdIQccZ5CLIwe3eDxw
  14329. 754.52 s [unordered-containers] include HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  14330. 754.52 s [unordered-containers] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  14331. 754.52 s [unordered-containers] include base-4.20.2.0-64da
  14332. 754.52 s [unordered-containers] include containers-0.7-504a
  14333. 754.52 s [unordered-containers] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14334. 754.52 s [unordered-containers] include nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  14335. 754.52 s [unordered-containers] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  14336. 754.52 s [unordered-containers] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  14337. 754.52 s [unordered-containers] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  14338. 754.52 s [unordered-containers] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  14339. 754.52 s [unordered-containers] include unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14340. 754.52 s [unordered-containers] Linked component graph:
  14341. 754.52 s [unordered-containers] unit unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14342. 754.52 s [unordered-containers] include base-4.20.2.0-64da
  14343. 754.52 s [unordered-containers] include deepseq-1.5.0.0-9a2c
  14344. 754.52 s [unordered-containers] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14345. 754.52 s [unordered-containers] include template-haskell-2.22.0.0-09e7
  14346. 754.52 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashSet.Internal
  14347. 754.52 s [unordered-containers] unit unordered-containers-0.2.20.1-1vi3OXi9xRj6NOlFqsDNWl-unordered-containers-tests
  14348. 754.52 s [unordered-containers] include ChasingBottoms-1.3.1.17-FMp1YdIQccZ5CLIwe3eDxw
  14349. 754.52 s [unordered-containers] include HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  14350. 754.52 s [unordered-containers] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  14351. 754.52 s [unordered-containers] include base-4.20.2.0-64da
  14352. 754.52 s [unordered-containers] include containers-0.7-504a
  14353. 754.52 s [unordered-containers] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14354. 754.52 s [unordered-containers] include nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  14355. 754.52 s [unordered-containers] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  14356. 754.52 s [unordered-containers] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  14357. 754.52 s [unordered-containers] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  14358. 754.52 s [unordered-containers] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  14359. 754.52 s [unordered-containers] include unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14360. 754.52 s [unordered-containers] Ready component graph:
  14361. 754.52 s [unordered-containers] definite unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14362. 754.52 s [unordered-containers] depends base-4.20.2.0-64da
  14363. 754.52 s [unordered-containers] depends deepseq-1.5.0.0-9a2c
  14364. 754.52 s [unordered-containers] depends hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14365. 754.52 s [unordered-containers] depends template-haskell-2.22.0.0-09e7
  14366. 754.52 s [unordered-containers] definite unordered-containers-0.2.20.1-1vi3OXi9xRj6NOlFqsDNWl-unordered-containers-tests
  14367. 754.52 s [unordered-containers] depends ChasingBottoms-1.3.1.17-FMp1YdIQccZ5CLIwe3eDxw
  14368. 754.52 s [unordered-containers] depends HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  14369. 754.52 s [unordered-containers] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  14370. 754.52 s [unordered-containers] depends base-4.20.2.0-64da
  14371. 754.52 s [unordered-containers] depends containers-0.7-504a
  14372. 754.52 s [unordered-containers] depends hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14373. 754.52 s [unordered-containers] depends nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  14374. 754.52 s [unordered-containers] depends random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  14375. 754.52 s [unordered-containers] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  14376. 754.52 s [unordered-containers] depends tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  14377. 754.52 s [unordered-containers] depends tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  14378. 754.52 s [unordered-containers] depends unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14379. 754.52 s [unordered-containers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  14380. 754.52 s [unordered-containers] Using compiler: ghc-9.10.3
  14381. 754.52 s [unordered-containers] Using install prefix:
  14382. 754.52 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1
  14383. 754.52 s [unordered-containers] Executables installed in:
  14384. 754.52 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/bin
  14385. 754.52 s [unordered-containers] Libraries installed in:
  14386. 754.52 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14387. 754.52 s [unordered-containers] Dynamic Libraries installed in:
  14388. 754.52 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  14389. 754.52 s [unordered-containers] Private executables installed in:
  14390. 754.52 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.10.3-05f6/unordered-containers-0.2.20.1
  14391. 754.52 s [unordered-containers] Data files installed in:
  14392. 754.52 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.10.3-05f6/unordered-containers-0.2.20.1
  14393. 754.52 s [unordered-containers] Documentation installed in:
  14394. 754.52 s [unordered-containers] /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  14395. 754.52 s [unordered-containers] Configuration files installed in:
  14396. 754.52 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/etc
  14397. 754.52 s [unordered-containers] No alex found
  14398. 754.52 s [unordered-containers] Using ar found on system at:
  14399. 754.52 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  14400. 754.52 s [unordered-containers] No c2hs found
  14401. 754.52 s [unordered-containers] No cpphs found
  14402. 754.52 s [unordered-containers] No doctest found
  14403. 754.52 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  14404. 754.52 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  14405. 754.52 s [unordered-containers] Using ghc version 9.10.3 found on system at:
  14406. 754.52 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  14407. 754.52 s [unordered-containers] Using ghc-pkg version 9.10.3 found on system at:
  14408. 754.52 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  14409. 754.52 s [unordered-containers] No ghcjs found
  14410. 754.52 s [unordered-containers] No ghcjs-pkg found
  14411. 754.52 s [unordered-containers] No greencard found
  14412. 754.52 s [unordered-containers] Using haddock version 2.31.1 found on system at:
  14413. 754.52 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  14414. 754.52 s [unordered-containers] No happy found
  14415. 754.52 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  14416. 754.52 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14417. 754.52 s [unordered-containers] No hmake found
  14418. 754.52 s [unordered-containers] Using hpc version 0.69 found on system at:
  14419. 754.52 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  14420. 754.52 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  14421. 754.52 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  14422. 754.52 s [unordered-containers] Using hscolour version 1.25 found on system at:
  14423. 754.52 s [unordered-containers] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  14424. 754.52 s [unordered-containers] No jhc found
  14425. 754.52 s [unordered-containers] Using ld found on system at:
  14426. 754.52 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  14427. 754.52 s [unordered-containers] No pkg-config found
  14428. 754.52 s [unordered-containers] Using runghc version 9.10.3 found on system at:
  14429. 754.52 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  14430. 754.52 s [unordered-containers] Using strip version 2.44 found on system at:
  14431. 754.52 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  14432. 754.52 s [unordered-containers] Using tar found on system at:
  14433. 754.52 s [unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  14434. 754.52 s [unordered-containers] No uhc found
  14435. 754.83 s [unordered-containers] Phase: buildPhase
  14436. 754.91 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  14437. 754.92 s [unordered-containers] Building library for unordered-containers-0.2.20.1...
  14438. 755.04 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14439. 755.04 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14440. 755.04 s [unordered-containers] |
  14441. 755.04 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14442. 755.04 s [unordered-containers] | ^^^^^^^^^^
  14443. 755.04 s [unordered-containers]
  14444. 755.33 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 )
  14445. 755.57 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14446. 755.57 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14447. 755.57 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14448. 755.57 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14449. 755.57 s [unordered-containers] |
  14450. 755.57 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14451. 755.57 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14452. 755.57 s [unordered-containers]
  14453. 756.30 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 )
  14454. 756.30 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 )
  14455. 765.83 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 )
  14456. 767.01 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 )
  14457. 770.61 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 )
  14458. 770.61 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  14459. 770.62 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 )
  14460. 771.51 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 )
  14461. 771.88 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14462. 771.88 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14463. 771.88 s [unordered-containers] |
  14464. 771.88 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14465. 771.88 s [unordered-containers] | ^^^^^^^^^^
  14466. 771.88 s [unordered-containers]
  14467. 772.17 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  14468. 772.40 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14469. 772.40 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14470. 772.40 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14471. 772.40 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14472. 772.40 s [unordered-containers] |
  14473. 772.40 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14474. 772.40 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14475. 772.40 s [unordered-containers]
  14476. 773.38 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  14477. 773.38 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  14478. 791.32 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  14479. 792.91 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  14480. 797.66 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  14481. 797.66 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  14482. 797.67 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  14483. 797.93 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  14484. 800.86 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  14485. 800.86 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  14486. 801.10 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 )
  14487. 801.44 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  14488. 801.44 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  14489. 801.44 s [unordered-containers] In the use of ‘head’
  14490. 801.44 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  14491. 801.44 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"."
  14492. 801.44 s [unordered-containers] |
  14493. 801.44 s [unordered-containers] 93 | k = head keys
  14494. 801.44 s [unordered-containers] | ^^^^
  14495. 801.44 s [unordered-containers]
  14496. 805.31 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 )
  14497. 805.32 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  14498. 805.32 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  14499. 805.32 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  14500. 805.32 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  14501. 805.32 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  14502. 805.32 s [unordered-containers] |
  14503. 805.32 s [unordered-containers] 7 | import Data.Foldable (foldl')
  14504. 805.32 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14505. 805.32 s [unordered-containers]
  14506. 805.32 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 )
  14507. 805.33 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 )
  14508. 814.21 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 )
  14509. 814.23 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  14510. 814.25 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  14511. 814.98 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  14512. 816.99 s [unordered-containers] buildPhase completed in 1 minutes 2 seconds
  14513. 816.99 s [unordered-containers] Phase: checkPhase
  14514. 817.70 s [unordered-containers] Running 1 test suites...
  14515. 817.70 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  14516. 817.73 s [unordered-containers] All
  14517. 817.73 s [unordered-containers] Properties
  14518. 817.73 s [unordered-containers] Data.HashMap.Lazy
  14519. 817.73 s [unordered-containers] instances
  14520. 817.73 s [unordered-containers] Eq
  14521. 817.74 s [unordered-containers] ==: OK (0.02s)
  14522. 817.74 s [unordered-containers] +++ OK, passed 100 tests.
  14523. 817.76 s [unordered-containers] /=: OK (0.02s)
  14524. 817.76 s [unordered-containers] +++ OK, passed 100 tests.
  14525. 817.76 s [unordered-containers] Ord
  14526. 817.76 s [unordered-containers] compare reflexive: OK (0.02s)
  14527. 817.76 s [unordered-containers] +++ OK, passed 100 tests.
  14528. 817.76 s [unordered-containers] compare transitive: OK (0.03s)
  14529. 817.77 s [unordered-containers] +++ OK, passed 100 tests.
  14530. 817.77 s [unordered-containers] compare antisymmetric: OK (0.01s)
  14531. 817.77 s [unordered-containers] +++ OK, passed 100 tests.
  14532. 817.77 s [unordered-containers] Ord => Eq: OK
  14533. 817.77 s [unordered-containers] +++ OK, passed 100 tests.
  14534. 818.26 s [unordered-containers] Read/Show: OK (0.49s)
  14535. 818.26 s [unordered-containers] +++ OK, passed 100 tests.
  14536. 818.26 s [unordered-containers] Functor: OK (0.05s)
  14537. 818.26 s [unordered-containers] +++ OK, passed 100 tests.
  14538. 818.26 s [unordered-containers] Foldable: OK
  14539. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14540. 818.27 s [unordered-containers] Bifoldable
  14541. 818.27 s [unordered-containers] bifoldMap: OK (0.01s)
  14542. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14543. 818.27 s [unordered-containers] bifoldr: OK
  14544. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14545. 818.27 s [unordered-containers] bifoldl: OK (0.02s)
  14546. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14547. 818.27 s [unordered-containers] Hashable: OK (0.05s)
  14548. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14549. 818.27 s [unordered-containers] empty
  14550. 818.27 s [unordered-containers] valid: OK
  14551. 818.27 s [unordered-containers] +++ OK, passed 1 test.
  14552. 818.27 s [unordered-containers] singleton
  14553. 818.27 s [unordered-containers] valid: OK
  14554. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14555. 818.27 s [unordered-containers] size: OK (0.01s)
  14556. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14557. 818.27 s [unordered-containers] member: OK
  14558. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14559. 818.27 s [unordered-containers] lookup: OK (0.01s)
  14560. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14561. 818.27 s [unordered-containers] !?: OK
  14562. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14563. 818.27 s [unordered-containers] insert
  14564. 818.27 s [unordered-containers] model: OK (0.02s)
  14565. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14566. 818.27 s [unordered-containers] valid: OK
  14567. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14568. 818.27 s [unordered-containers] insertWith
  14569. 818.27 s [unordered-containers] insertWith: OK
  14570. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14571. 818.27 s [unordered-containers] valid: OK
  14572. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14573. 818.27 s [unordered-containers] delete
  14574. 818.27 s [unordered-containers] model: OK
  14575. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14576. 818.27 s [unordered-containers] valid: OK
  14577. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14578. 818.27 s [unordered-containers] adjust
  14579. 818.27 s [unordered-containers] model: OK
  14580. 818.27 s [unordered-containers] +++ OK, passed 100 tests.
  14581. 818.28 s [unordered-containers] valid: OK
  14582. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14583. 818.28 s [unordered-containers] update
  14584. 818.28 s [unordered-containers] model: OK
  14585. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14586. 818.28 s [unordered-containers] valid: OK
  14587. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14588. 818.28 s [unordered-containers] alter
  14589. 818.28 s [unordered-containers] model: OK (0.03s)
  14590. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14591. 818.28 s [unordered-containers] valid: OK (0.01s)
  14592. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14593. 818.28 s [unordered-containers] alterF
  14594. 818.28 s [unordered-containers] model
  14595. 818.28 s [unordered-containers] []: OK (0.11s)
  14596. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14597. 818.28 s [unordered-containers] adjust: OK (0.04s)
  14598. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14599. 818.28 s [unordered-containers] insert: OK (0.03s)
  14600. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14601. 818.28 s [unordered-containers] insertWith: OK (0.01s)
  14602. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14603. 818.28 s [unordered-containers] delete: OK
  14604. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14605. 818.28 s [unordered-containers] lookup: OK
  14606. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14607. 818.28 s [unordered-containers] valid: OK (0.02s)
  14608. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14609. 818.28 s [unordered-containers] isSubmapOf
  14610. 818.28 s [unordered-containers] model: OK
  14611. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14612. 818.28 s [unordered-containers] m ⊆ m: OK
  14613. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14614. 818.28 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.03s)
  14615. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14616. 818.28 s [unordered-containers] m1\m2 ⊆ m1: OK (0.01s)
  14617. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14618. 818.28 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.02s)
  14619. 818.28 s [unordered-containers] +++ OK, passed 100 tests; 165 discarded.
  14620. 818.28 s [unordered-containers] delete k m ⊆ m: OK
  14621. 818.28 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  14622. 818.28 s [unordered-containers] m ⊈ delete k m : OK
  14623. 818.28 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  14624. 818.28 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
  14625. 818.28 s [unordered-containers] +++ OK, passed 100 tests; 11 discarded.
  14626. 818.28 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  14627. 818.28 s [unordered-containers] +++ OK, passed 100 tests; 11 discarded.
  14628. 818.28 s [unordered-containers] union
  14629. 818.28 s [unordered-containers] model: OK (0.05s)
  14630. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14631. 818.28 s [unordered-containers] valid: OK (0.02s)
  14632. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14633. 818.28 s [unordered-containers] unionWith
  14634. 818.28 s [unordered-containers] model: OK (0.04s)
  14635. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14636. 818.28 s [unordered-containers] valid: OK (0.04s)
  14637. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14638. 818.28 s [unordered-containers] unionWithKey
  14639. 818.28 s [unordered-containers] model: OK (0.10s)
  14640. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14641. 818.28 s [unordered-containers] valid: OK (0.01s)
  14642. 818.28 s [unordered-containers] +++ OK, passed 100 tests.
  14643. 818.28 s [unordered-containers] unions
  14644. 819.31 s [unordered-containers] model: OK (1.53s)
  14645. 819.35 s [unordered-containers] +++ OK, passed 100 tests.
  14646. 819.39 s [unordered-containers] valid: OK (0.86s)
  14647. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14648. 819.39 s [unordered-containers] difference
  14649. 819.39 s [unordered-containers] model: OK (0.02s)
  14650. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14651. 819.39 s [unordered-containers] valid: OK (0.01s)
  14652. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14653. 819.39 s [unordered-containers] differenceWith
  14654. 819.39 s [unordered-containers] model: OK (0.08s)
  14655. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14656. 819.39 s [unordered-containers] valid: OK (0.04s)
  14657. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14658. 819.39 s [unordered-containers] intersection
  14659. 819.39 s [unordered-containers] model: OK (0.03s)
  14660. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14661. 819.39 s [unordered-containers] valid: OK (0.03s)
  14662. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14663. 819.39 s [unordered-containers] intersectionWith
  14664. 819.39 s [unordered-containers] model: OK (0.03s)
  14665. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14666. 819.39 s [unordered-containers] valid: OK (0.03s)
  14667. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14668. 819.39 s [unordered-containers] intersectionWithKey
  14669. 819.39 s [unordered-containers] model: OK (0.13s)
  14670. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14671. 819.39 s [unordered-containers] valid: OK (0.02s)
  14672. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14673. 819.39 s [unordered-containers] compose
  14674. 819.39 s [unordered-containers] valid: OK (0.02s)
  14675. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14676. 819.39 s [unordered-containers] map
  14677. 819.39 s [unordered-containers] model: OK (0.10s)
  14678. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14679. 819.39 s [unordered-containers] valid: OK
  14680. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14681. 819.39 s [unordered-containers] traverseWithKey
  14682. 819.39 s [unordered-containers] model: OK (0.81s)
  14683. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14684. 819.39 s [unordered-containers] valid: OK (0.02s)
  14685. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14686. 819.39 s [unordered-containers] mapKeys
  14687. 819.39 s [unordered-containers] model: OK (0.05s)
  14688. 819.39 s [unordered-containers] +++ OK, passed 100 tests.
  14689. 819.42 s [unordered-containers] valid: OK (0.60s)
  14690. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14691. 819.42 s [unordered-containers] foldr: OK (0.02s)
  14692. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14693. 819.42 s [unordered-containers] foldl: OK (0.02s)
  14694. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14695. 819.42 s [unordered-containers] foldrWithKey: OK (0.04s)
  14696. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14697. 819.42 s [unordered-containers] foldlWithKey: OK (0.02s)
  14698. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14699. 819.42 s [unordered-containers] foldrWithKey': OK (0.01s)
  14700. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14701. 819.42 s [unordered-containers] foldlWithKey': OK (0.01s)
  14702. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14703. 819.42 s [unordered-containers] foldl': OK (0.02s)
  14704. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14705. 819.42 s [unordered-containers] foldr': OK (0.02s)
  14706. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14707. 819.42 s [unordered-containers] foldMapWithKey: OK (0.02s)
  14708. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14709. 819.42 s [unordered-containers] filter
  14710. 819.42 s [unordered-containers] model: OK (0.07s)
  14711. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14712. 819.42 s [unordered-containers] valid: OK (0.04s)
  14713. 819.42 s [unordered-containers] +++ OK, passed 100 tests.
  14714. 819.42 s [unordered-containers] filterWithKey
  14715. 820.25 s [unordered-containers] model: OK (2.39s)
  14716. 820.25 s [unordered-containers] +++ OK, passed 100 tests.
  14717. 820.25 s [unordered-containers] valid: OK (1.43s)
  14718. 820.25 s [unordered-containers] +++ OK, passed 100 tests.
  14719. 820.25 s [unordered-containers] mapMaybe
  14720. 820.25 s [unordered-containers] model: OK (0.10s)
  14721. 820.25 s [unordered-containers] +++ OK, passed 100 tests.
  14722. 820.25 s [unordered-containers] valid: OK (0.07s)
  14723. 820.25 s [unordered-containers] +++ OK, passed 100 tests.
  14724. 820.25 s [unordered-containers] mapMaybeWithKey
  14725. 820.25 s [unordered-containers] model: OK (2.28s)
  14726. 820.25 s [unordered-containers] +++ OK, passed 100 tests.
  14727. 820.25 s [unordered-containers] valid: OK (1.54s)
  14728. 820.25 s [unordered-containers] +++ OK, passed 100 tests.
  14729. 820.25 s [unordered-containers] elems: OK
  14730. 820.25 s [unordered-containers] +++ OK, passed 100 tests.
  14731. 820.25 s [unordered-containers] keys: OK (0.05s)
  14732. 820.25 s [unordered-containers] +++ OK, passed 100 tests.
  14733. 820.25 s [unordered-containers] fromList
  14734. 820.25 s [unordered-containers] model: OK (0.04s)
  14735. 820.25 s [unordered-containers] +++ OK, passed 100 tests.
  14736. 820.25 s [unordered-containers] valid: OK (0.01s)
  14737. 820.25 s [unordered-containers] +++ OK, passed 100 tests.
  14738. 820.25 s [unordered-containers] fromListWith
  14739. 820.25 s [unordered-containers] model: OK (0.02s)
  14740. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14741. 820.26 s [unordered-containers] valid: OK (0.02s)
  14742. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14743. 820.26 s [unordered-containers] fromListWithKey
  14744. 820.26 s [unordered-containers] model: OK (0.02s)
  14745. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14746. 820.26 s [unordered-containers] valid: OK
  14747. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14748. 820.26 s [unordered-containers] toList: OK (0.01s)
  14749. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14750. 820.26 s [unordered-containers] Data.HashMap.Strict
  14751. 820.26 s [unordered-containers] instances
  14752. 820.26 s [unordered-containers] Eq
  14753. 820.26 s [unordered-containers] ==: OK (0.03s)
  14754. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14755. 820.26 s [unordered-containers] /=: OK (0.04s)
  14756. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14757. 820.26 s [unordered-containers] Ord
  14758. 820.26 s [unordered-containers] compare reflexive: OK (0.02s)
  14759. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14760. 820.26 s [unordered-containers] compare transitive: OK (0.04s)
  14761. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14762. 820.26 s [unordered-containers] compare antisymmetric: OK (0.02s)
  14763. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14764. 820.26 s [unordered-containers] Ord => Eq: OK (0.01s)
  14765. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14766. 820.26 s [unordered-containers] Read/Show: OK (0.49s)
  14767. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14768. 820.26 s [unordered-containers] Functor: OK (0.19s)
  14769. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14770. 820.26 s [unordered-containers] Foldable: OK (0.02s)
  14771. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14772. 820.26 s [unordered-containers] Bifoldable
  14773. 820.26 s [unordered-containers] bifoldMap: OK (0.01s)
  14774. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14775. 820.26 s [unordered-containers] bifoldr: OK (0.02s)
  14776. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14777. 820.26 s [unordered-containers] bifoldl: OK (0.01s)
  14778. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14779. 820.26 s [unordered-containers] Hashable: OK (0.08s)
  14780. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14781. 820.26 s [unordered-containers] empty
  14782. 820.26 s [unordered-containers] valid: OK
  14783. 820.26 s [unordered-containers] +++ OK, passed 1 test.
  14784. 820.26 s [unordered-containers] singleton
  14785. 820.26 s [unordered-containers] valid: OK
  14786. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14787. 820.26 s [unordered-containers] size: OK (0.08s)
  14788. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14789. 820.26 s [unordered-containers] member: OK (0.04s)
  14790. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14791. 820.26 s [unordered-containers] lookup: OK (0.03s)
  14792. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14793. 820.26 s [unordered-containers] !?: OK (0.03s)
  14794. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14795. 820.26 s [unordered-containers] insert
  14796. 820.26 s [unordered-containers] model: OK (0.08s)
  14797. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14798. 820.26 s [unordered-containers] valid: OK (0.08s)
  14799. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14800. 820.26 s [unordered-containers] insertWith
  14801. 820.26 s [unordered-containers] insertWith: OK (0.07s)
  14802. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14803. 820.26 s [unordered-containers] valid: OK (0.04s)
  14804. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14805. 820.26 s [unordered-containers] delete
  14806. 820.26 s [unordered-containers] model: OK (0.04s)
  14807. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14808. 820.26 s [unordered-containers] valid: OK (0.01s)
  14809. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14810. 820.26 s [unordered-containers] adjust
  14811. 820.26 s [unordered-containers] model: OK (0.06s)
  14812. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14813. 820.26 s [unordered-containers] valid: OK (0.03s)
  14814. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14815. 820.26 s [unordered-containers] update
  14816. 820.26 s [unordered-containers] model: OK (0.01s)
  14817. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14818. 820.26 s [unordered-containers] valid: OK (0.02s)
  14819. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14820. 820.26 s [unordered-containers] alter
  14821. 820.26 s [unordered-containers] model: OK (0.03s)
  14822. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14823. 820.26 s [unordered-containers] valid: OK (0.03s)
  14824. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14825. 820.26 s [unordered-containers] alterF
  14826. 820.26 s [unordered-containers] model
  14827. 820.26 s [unordered-containers] []: OK (0.36s)
  14828. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14829. 820.26 s [unordered-containers] adjust: OK (0.04s)
  14830. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14831. 820.26 s [unordered-containers] insert: OK (0.06s)
  14832. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14833. 820.26 s [unordered-containers] insertWith: OK (0.07s)
  14834. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14835. 820.26 s [unordered-containers] delete: OK (0.03s)
  14836. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14837. 820.26 s [unordered-containers] lookup: OK (0.02s)
  14838. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14839. 820.26 s [unordered-containers] valid: OK (0.04s)
  14840. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14841. 820.26 s [unordered-containers] isSubmapOf
  14842. 820.26 s [unordered-containers] model: OK (0.07s)
  14843. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14844. 820.26 s [unordered-containers] m ⊆ m: OK (0.03s)
  14845. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14846. 820.26 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.03s)
  14847. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14848. 820.26 s [unordered-containers] m1\m2 ⊆ m1: OK (0.06s)
  14849. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14850. 820.26 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.06s)
  14851. 820.26 s [unordered-containers] +++ OK, passed 100 tests; 121 discarded.
  14852. 820.26 s [unordered-containers] delete k m ⊆ m: OK (0.03s)
  14853. 820.26 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  14854. 820.26 s [unordered-containers] m ⊈ delete k m : OK (0.04s)
  14855. 820.26 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  14856. 820.26 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.03s)
  14857. 820.26 s [unordered-containers] +++ OK, passed 100 tests; 10 discarded.
  14858. 820.26 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  14859. 820.26 s [unordered-containers] +++ OK, passed 100 tests; 9 discarded.
  14860. 820.26 s [unordered-containers] union
  14861. 820.26 s [unordered-containers] model: OK (0.13s)
  14862. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14863. 820.26 s [unordered-containers] valid: OK (0.06s)
  14864. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14865. 820.26 s [unordered-containers] unionWith
  14866. 820.26 s [unordered-containers] model: OK (0.12s)
  14867. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14868. 820.26 s [unordered-containers] valid: OK (0.09s)
  14869. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14870. 820.26 s [unordered-containers] unionWithKey
  14871. 820.26 s [unordered-containers] model: OK (0.31s)
  14872. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14873. 820.26 s [unordered-containers] valid: OK (0.15s)
  14874. 820.26 s [unordered-containers] +++ OK, passed 100 tests.
  14875. 820.26 s [unordered-containers] unions
  14876. 820.27 s [unordered-containers] model: OK (1.50s)
  14877. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14878. 820.27 s [unordered-containers] valid: OK (1.00s)
  14879. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14880. 820.27 s [unordered-containers] difference
  14881. 820.27 s [unordered-containers] model: OK (0.07s)
  14882. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14883. 820.27 s [unordered-containers] valid: OK (0.04s)
  14884. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14885. 820.27 s [unordered-containers] differenceWith
  14886. 820.27 s [unordered-containers] model: OK (0.13s)
  14887. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14888. 820.27 s [unordered-containers] valid: OK (0.06s)
  14889. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14890. 820.27 s [unordered-containers] intersection
  14891. 820.27 s [unordered-containers] model: OK (0.10s)
  14892. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14893. 820.27 s [unordered-containers] valid: OK (0.05s)
  14894. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14895. 820.27 s [unordered-containers] intersectionWith
  14896. 820.27 s [unordered-containers] model: OK (0.16s)
  14897. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14898. 820.27 s [unordered-containers] valid: OK (0.08s)
  14899. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14900. 820.27 s [unordered-containers] intersectionWithKey
  14901. 820.27 s [unordered-containers] model: OK (0.20s)
  14902. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14903. 820.27 s [unordered-containers] valid: OK (0.11s)
  14904. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14905. 820.27 s [unordered-containers] compose
  14906. 820.27 s [unordered-containers] valid: OK (0.04s)
  14907. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14908. 820.27 s [unordered-containers] map
  14909. 820.27 s [unordered-containers] model: OK (0.16s)
  14910. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14911. 820.27 s [unordered-containers] valid: OK (0.10s)
  14912. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14913. 820.27 s [unordered-containers] traverseWithKey
  14914. 820.27 s [unordered-containers] model: OK (1.43s)
  14915. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14916. 820.27 s [unordered-containers] valid: OK (0.02s)
  14917. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14918. 820.27 s [unordered-containers] mapKeys
  14919. 820.27 s [unordered-containers] model: OK (0.04s)
  14920. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14921. 820.27 s [unordered-containers] valid: OK (1.04s)
  14922. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14923. 820.27 s [unordered-containers] foldr: OK (0.04s)
  14924. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14925. 820.27 s [unordered-containers] foldl: OK (0.02s)
  14926. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14927. 820.27 s [unordered-containers] foldrWithKey: OK (0.04s)
  14928. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14929. 820.27 s [unordered-containers] foldlWithKey: OK (0.03s)
  14930. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14931. 820.27 s [unordered-containers] foldrWithKey': OK (0.04s)
  14932. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14933. 820.27 s [unordered-containers] foldlWithKey': OK (0.03s)
  14934. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14935. 820.27 s [unordered-containers] foldl': OK (0.03s)
  14936. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14937. 820.27 s [unordered-containers] foldr': OK (0.04s)
  14938. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14939. 820.27 s [unordered-containers] foldMapWithKey: OK (0.10s)
  14940. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14941. 820.27 s [unordered-containers] filter
  14942. 820.27 s [unordered-containers] model: OK (0.19s)
  14943. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14944. 820.27 s [unordered-containers] valid: OK (0.10s)
  14945. 820.27 s [unordered-containers] +++ OK, passed 100 tests.
  14946. 820.27 s [unordered-containers] filterWithKey
  14947. 820.55 s [unordered-containers] model: OK (1.87s)
  14948. 820.55 s [unordered-containers] +++ OK, passed 100 tests.
  14949. 820.55 s [unordered-containers] valid: OK (1.38s)
  14950. 820.55 s [unordered-containers] +++ OK, passed 100 tests.
  14951. 820.55 s [unordered-containers] mapMaybe
  14952. 820.55 s [unordered-containers] model: OK (0.15s)
  14953. 820.55 s [unordered-containers] +++ OK, passed 100 tests.
  14954. 820.55 s [unordered-containers] valid: OK (0.11s)
  14955. 820.55 s [unordered-containers] +++ OK, passed 100 tests.
  14956. 820.55 s [unordered-containers] mapMaybeWithKey
  14957. 820.58 s [unordered-containers] model: OK (1.81s)
  14958. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14959. 820.58 s [unordered-containers] valid: OK (1.29s)
  14960. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14961. 820.58 s [unordered-containers] elems: OK (0.03s)
  14962. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14963. 820.58 s [unordered-containers] keys: OK (0.05s)
  14964. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14965. 820.58 s [unordered-containers] fromList
  14966. 820.58 s [unordered-containers] model: OK (0.03s)
  14967. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14968. 820.58 s [unordered-containers] valid: OK (0.02s)
  14969. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14970. 820.58 s [unordered-containers] fromListWith
  14971. 820.58 s [unordered-containers] model: OK (0.04s)
  14972. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14973. 820.58 s [unordered-containers] valid: OK (0.06s)
  14974. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14975. 820.58 s [unordered-containers] fromListWithKey
  14976. 820.58 s [unordered-containers] model: OK (0.07s)
  14977. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14978. 820.58 s [unordered-containers] valid: OK (0.17s)
  14979. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14980. 820.58 s [unordered-containers] toList: OK (0.04s)
  14981. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14982. 820.58 s [unordered-containers] Data.HashSet
  14983. 820.58 s [unordered-containers] instances
  14984. 820.58 s [unordered-containers] Eq
  14985. 820.58 s [unordered-containers] ==: OK (0.07s)
  14986. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14987. 820.58 s [unordered-containers] == permutations: OK (0.04s)
  14988. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14989. 820.58 s [unordered-containers] /=: OK (0.08s)
  14990. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14991. 820.58 s [unordered-containers] Ord
  14992. 820.58 s [unordered-containers] compare reflexive: OK (0.04s)
  14993. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14994. 820.58 s [unordered-containers] compare transitive: OK (0.12s)
  14995. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14996. 820.58 s [unordered-containers] compare antisymmetric: OK (0.08s)
  14997. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  14998. 820.58 s [unordered-containers] Ord => Eq: OK (0.03s)
  14999. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  15000. 820.58 s [unordered-containers] Read/Show: OK (0.57s)
  15001. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  15002. 820.58 s [unordered-containers] Foldable: OK (0.05s)
  15003. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  15004. 820.58 s [unordered-containers] Hashable: OK (0.04s)
  15005. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  15006. 820.58 s [unordered-containers] size: OK (0.04s)
  15007. 820.58 s [unordered-containers] +++ OK, passed 100 tests.
  15008. 820.59 s [unordered-containers] member: OK (0.01s)
  15009. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15010. 820.59 s [unordered-containers] insert: OK (0.03s)
  15011. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15012. 820.59 s [unordered-containers] delete: OK (0.04s)
  15013. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15014. 820.59 s [unordered-containers] union: OK (0.10s)
  15015. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15016. 820.59 s [unordered-containers] map: OK (1.06s)
  15017. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15018. 820.59 s [unordered-containers] foldr: OK (0.15s)
  15019. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15020. 820.59 s [unordered-containers] foldl': OK (0.08s)
  15021. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15022. 820.59 s [unordered-containers] filter: OK (1.07s)
  15023. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15024. 820.59 s [unordered-containers] toList: OK (0.05s)
  15025. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15026. 820.59 s [unordered-containers] Data.HashMap.Internal.List
  15027. 820.59 s [unordered-containers] isPermutationBy: OK (0.04s)
  15028. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15029. 820.59 s [unordered-containers] isPermutationBy of different length: OK (0.05s)
  15030. 820.59 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  15031. 820.59 s [unordered-containers] pUnorderedCompare: OK (0.09s)
  15032. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15033. 820.59 s [unordered-containers] modelUnorderedCompare
  15034. 820.59 s [unordered-containers] reflexive: OK (0.05s)
  15035. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15036. 820.59 s [unordered-containers] anti-symmetric: OK (0.01s)
  15037. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15038. 820.59 s [unordered-containers] transitive: OK (0.03s)
  15039. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15040. 820.59 s [unordered-containers] Regression tests
  15041. 820.59 s [unordered-containers] issue32: OK
  15042. 820.59 s [unordered-containers] issue39a: OK
  15043. 820.59 s [unordered-containers] issue39b: OK (0.05s)
  15044. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15045. 820.59 s [unordered-containers] issue254 lazy: OK (0.02s)
  15046. 820.59 s [unordered-containers] issue254 strict: OK
  15047. 820.59 s [unordered-containers] issue379
  15048. 820.59 s [unordered-containers] Lazy.unionWith: OK
  15049. 820.59 s [unordered-containers] union: OK
  15050. 820.59 s [unordered-containers] Strict.unionWith: OK
  15051. 820.59 s [unordered-containers] Strict.unionWithKey: OK
  15052. 820.59 s [unordered-containers] issue381
  15053. 820.59 s [unordered-containers] mapMaybe: OK
  15054. 820.59 s [unordered-containers] mapMaybeWithKey: OK
  15055. 820.59 s [unordered-containers] issue382: OK
  15056. 820.59 s [unordered-containers] issue383: OK
  15057. 820.59 s [unordered-containers] issue420: OK
  15058. 820.59 s [unordered-containers] issue491
  15059. 820.59 s [unordered-containers] 1: OK
  15060. 820.59 s [unordered-containers] 2: OK
  15061. 820.59 s [unordered-containers] 3: OK
  15062. 820.59 s [unordered-containers] Strictness
  15063. 820.59 s [unordered-containers] HashMap.Strict
  15064. 820.59 s [unordered-containers] singleton is key-strict: OK
  15065. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15066. 820.59 s [unordered-containers] singleton is value-strict: OK
  15067. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15068. 820.59 s [unordered-containers] member is key-strict: OK
  15069. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15070. 820.59 s [unordered-containers] lookup is key-strict: OK
  15071. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15072. 820.59 s [unordered-containers] lookupDefault is key-strict: OK
  15073. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15074. 820.59 s [unordered-containers] findWithDefault is key-strict: OK
  15075. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15076. 820.59 s [unordered-containers] ! is key-strict: OK
  15077. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15078. 820.59 s [unordered-containers] delete is key-strict: OK
  15079. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15080. 820.59 s [unordered-containers] adjust is key-strict: OK
  15081. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15082. 820.59 s [unordered-containers] adjust is value-strict: OK (0.01s)
  15083. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15084. 820.59 s [unordered-containers] insert is key-strict: OK
  15085. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15086. 820.59 s [unordered-containers] insert is value-strict: OK
  15087. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15088. 820.59 s [unordered-containers] insertWith is key-strict: OK
  15089. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15090. 820.59 s [unordered-containers] insertWith is value-strict: OK (0.02s)
  15091. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15092. 820.59 s [unordered-containers] fromList is key-strict: OK
  15093. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15094. 820.59 s [unordered-containers] fromList is value-strict: OK
  15095. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15096. 820.59 s [unordered-containers] fromListWith is key-strict: OK
  15097. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15098. 820.59 s [unordered-containers] fromListWith is value-strict: OK
  15099. 820.59 s [unordered-containers] +++ OK, passed 100 tests.
  15100. 820.59 s [unordered-containers]
  15101. 820.59 s [unordered-containers] All 257 tests passed (2.86s)
  15102. 820.61 s [unordered-containers] Test suite unordered-containers-tests: PASS
  15103. 820.61 s [unordered-containers] Test suite logged to:
  15104. 820.61 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  15105. 820.61 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  15106. 820.62 s [unordered-containers] Phase: haddockPhase
  15107. 820.89 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  15108. 820.90 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1...
  15109. 821.34 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  15110. 821.34 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  15111. 821.34 s [unordered-containers] |
  15112. 821.34 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  15113. 821.34 s [unordered-containers] | ^^^^^^^^^^
  15114. 821.34 s [unordered-containers]
  15115. 821.59 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  15116. 822.10 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  15117. 822.10 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  15118. 822.10 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  15119. 822.10 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  15120. 822.10 s [unordered-containers] |
  15121. 822.10 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  15122. 822.10 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  15123. 822.10 s [unordered-containers]
  15124. 822.12 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  15125. 822.16 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  15126. 824.40 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  15127. 824.54 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  15128. 825.06 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  15129. 825.30 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  15130. 825.32 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  15131. 825.33 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  15132. 825.34 s [unordered-containers] Haddock coverage:
  15133. 825.35 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  15134. 825.35 s [unordered-containers] Missing documentation for:
  15135. 825.35 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  15136. 825.35 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  15137. 825.35 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  15138. 825.35 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  15139. 825.35 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  15140. 825.35 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  15141. 825.35 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  15142. 825.35 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  15143. 825.35 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  15144. 825.35 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  15145. 825.35 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  15146. 825.35 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  15147. 825.35 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  15148. 825.35 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  15149. 825.35 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  15150. 825.35 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  15151. 825.35 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  15152. 825.35 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  15153. 825.35 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  15154. 825.35 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  15155. 825.35 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  15156. 825.35 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  15157. 825.35 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  15158. 825.35 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  15159. 825.35 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  15160. 825.35 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  15161. 825.35 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  15162. 825.36 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  15163. 825.36 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  15164. 825.36 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  15165. 825.36 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  15166. 825.36 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  15167. 825.36 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  15168. 825.36 s [unordered-containers] Missing documentation for:
  15169. 825.36 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  15170. 825.36 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  15171. 825.36 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  15172. 825.36 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  15173. 825.36 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  15174. 825.36 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  15175. 825.36 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  15176. 825.36 s [unordered-containers] by specifying the type/value namespace explicitly.
  15177. 825.36 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  15178. 825.37 s [unordered-containers] Warning: 'at' is out of scope.
  15179. 825.37 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  15180. 825.39 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  15181. 825.39 s [unordered-containers] Missing documentation for:
  15182. 825.39 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  15183. 825.39 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  15184. 825.39 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  15185. 825.39 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  15186. 825.39 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  15187. 825.39 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  15188. 825.39 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  15189. 825.39 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  15190. 825.39 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  15191. 825.39 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  15192. 825.39 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  15193. 825.39 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  15194. 825.40 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  15195. 825.40 s [unordered-containers] Missing documentation for:
  15196. 825.40 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  15197. 825.40 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  15198. 825.40 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  15199. 825.41 s [unordered-containers] Warning: 'lookup' is out of scope.
  15200. 825.41 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  15201. 825.41 s [unordered-containers] Warning: 'at' is out of scope.
  15202. 825.41 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  15203. 825.42 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  15204. 825.43 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  15205. 825.43 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  15206. 825.43 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  15207. 825.43 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  15208. 825.43 s [unordered-containers] by specifying the type/value namespace explicitly.
  15209. 825.43 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  15210. 825.44 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  15211. 825.45 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  15212. 825.45 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  15213. 825.45 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  15214. 825.45 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  15215. 825.45 s [unordered-containers] by specifying the type/value namespace explicitly.
  15216. 825.45 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  15217. 825.45 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  15218. 825.45 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  15219. 825.46 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  15220. 840.13 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  15221. 840.13 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  15222. 840.31 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  15223. 840.34 s [unordered-containers] Phase: installPhase
  15224. 840.60 s [unordered-containers] Installing library in /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  15225. 842.14 s [unordered-containers] Phase: fixupPhase
  15226. 842.97 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1
  15227. 842.97 s [unordered-containers] shrinking /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSunordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq-ghc9.10.3.so
  15228. 842.98 s [unordered-containers] checking for references to /build/ in /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1...
  15229. 843.01 s [unordered-containers] patching script interpreter paths in /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1
  15230. 843.02 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/lib
  15231. 843.19 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc
  15232. 843.21 s [unordered-containers] checking for references to /build/ in /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc...
  15233. 843.25 s [unordered-containers] patching script interpreter paths in /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc
  15234. 843.46 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1 /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc
  15235. 844.01 s [unordered-containers:post-build] Nothing to push - all store paths are already on Cachix.
  15236. 844.06 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1 /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc
  15237. 844.14 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15238. 844.25 s [unordered-containers:post-build] copying 1 paths...
  15239. 844.25 s [unordered-containers:post-build] copying path '/nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  15240. 848.61 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15241. 848.76 s [unordered-containers:post-build] copying 0 paths...
  15242. 848.88 s Progress: 7 of 15 built, 159 of 159 downloaded from cache
  15243. 848.97 s Building /nix/store/nzdj8v73vqbrcsb7iarjbb0y5nmfgn9b-quickcheck-instances-0.3.33.drv
  15244. 849.20 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  15245. 849.21 s [quickcheck-instances] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  15246. 849.62 s [quickcheck-instances] Phase: unpackPhase
  15247. 849.62 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  15248. 849.63 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  15249. 849.65 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  15250. 849.66 s [quickcheck-instances] Phase: patchPhase
  15251. 849.66 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  15252. 849.68 s [quickcheck-instances] Phase: compileBuildDriverPhase
  15253. 849.68 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.uacCMUeblb/setup-package.conf.d -threaded
  15254. 849.79 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.uacCMUeblb/Main.o )
  15255. 849.89 s [quickcheck-instances] [2 of 2] Linking Setup
  15256. 852.61 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  15257. 852.63 s [quickcheck-instances] Phase: configurePhase
  15258. 852.64 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.uacCMUeblb/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  15259. 852.66 s [quickcheck-instances] Using Parsec parser
  15260. 852.66 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  15261. 854.09 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  15262. 854.11 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  15263. 854.11 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  15264. 854.11 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.20.2.0
  15265. 854.11 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
  15266. 854.11 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  15267. 854.11 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  15268. 854.11 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  15269. 854.11 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  15270. 854.11 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  15271. 854.11 s [quickcheck-instances] integer-logarithms-1.0.4
  15272. 854.11 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  15273. 854.11 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  15274. 854.11 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  15275. 854.11 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  15276. 854.11 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  15277. 854.11 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  15278. 854.11 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.3
  15279. 854.11 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  15280. 854.11 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  15281. 854.11 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  15282. 854.11 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.1
  15283. 854.11 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  15284. 854.11 s [quickcheck-instances] unordered-containers-0.2.20.1
  15285. 854.11 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  15286. 854.11 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  15287. 854.11 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  15288. 854.11 s [quickcheck-instances] Dependency base: using base-4.20.2.0
  15289. 854.11 s [quickcheck-instances] Dependency containers: using containers-0.7
  15290. 854.11 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  15291. 854.11 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  15292. 854.11 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  15293. 854.11 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  15294. 854.11 s [quickcheck-instances] Source component graph:
  15295. 854.11 s [quickcheck-instances] component lib
  15296. 854.11 s [quickcheck-instances] component test:self-test dependency lib
  15297. 854.11 s [quickcheck-instances] Configured component graph:
  15298. 854.11 s [quickcheck-instances] component quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15299. 854.11 s [quickcheck-instances] include OneTuple-0.4.2-GRtegyTHdcp8cc3WBaYWdG
  15300. 854.11 s [quickcheck-instances] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15301. 854.11 s [quickcheck-instances] include array-0.5.8.0-68f3
  15302. 854.11 s [quickcheck-instances] include base-4.20.2.0-64da
  15303. 854.11 s [quickcheck-instances] include bytestring-0.12.2.0-262e
  15304. 854.11 s [quickcheck-instances] include case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  15305. 854.11 s [quickcheck-instances] include containers-0.7-504a
  15306. 854.11 s [quickcheck-instances] include data-fix-0.3.4-Ity9RnZlpNYBToUDyG6f10
  15307. 854.11 s [quickcheck-instances] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  15308. 854.11 s [quickcheck-instances] include integer-logarithms-1.0.4-H7Rfid5I6Ecy5a2peKb9I
  15309. 854.11 s [quickcheck-instances] include old-time-1.1.0.4-LamKvQxcXvGIaPGAUxqrFE
  15310. 854.11 s [quickcheck-instances] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15311. 854.11 s [quickcheck-instances] include scientific-0.3.8.0-208EAotcHKuKK3a0uMgoFR
  15312. 854.11 s [quickcheck-instances] include splitmix-0.1.3.1-5QjYMYUxA5CmrSLc1zIZY
  15313. 854.11 s [quickcheck-instances] include strict-0.5.1-34kyIfF1hqWEKGfMyT7By0
  15314. 854.11 s [quickcheck-instances] include tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15315. 854.11 s [quickcheck-instances] include text-2.1.3-c691
  15316. 854.11 s [quickcheck-instances] include text-short-0.1.6-8mYoeU8VnAzKZcCnBOoo5y
  15317. 854.11 s [quickcheck-instances] include these-1.2.1-9ZdFnb52yDo6MFOrFYcqPa
  15318. 854.11 s [quickcheck-instances] include time-compat-1.9.8-741uIWoYvbfKIgMssLvXzT
  15319. 854.11 s [quickcheck-instances] include transformers-0.6.1.1-6a26
  15320. 854.11 s [quickcheck-instances] include unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  15321. 854.11 s [quickcheck-instances] include uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15322. 854.11 s [quickcheck-instances] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  15323. 854.11 s [quickcheck-instances] component quickcheck-instances-0.3.33-4Np47pFNrQdBiRgwYkf2Vq-self-test
  15324. 854.11 s [quickcheck-instances] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15325. 854.11 s [quickcheck-instances] include base-4.20.2.0-64da
  15326. 854.11 s [quickcheck-instances] include containers-0.7-504a
  15327. 854.11 s [quickcheck-instances] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15328. 854.12 s [quickcheck-instances] include quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15329. 854.12 s [quickcheck-instances] include tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15330. 854.12 s [quickcheck-instances] include uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15331. 854.12 s [quickcheck-instances] Linked component graph:
  15332. 854.12 s [quickcheck-instances] unit quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15333. 854.12 s [quickcheck-instances] include OneTuple-0.4.2-GRtegyTHdcp8cc3WBaYWdG
  15334. 854.12 s [quickcheck-instances] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15335. 854.12 s [quickcheck-instances] include array-0.5.8.0-68f3
  15336. 854.12 s [quickcheck-instances] include base-4.20.2.0-64da
  15337. 854.12 s [quickcheck-instances] include bytestring-0.12.2.0-262e
  15338. 854.12 s [quickcheck-instances] include case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  15339. 854.12 s [quickcheck-instances] include containers-0.7-504a
  15340. 854.12 s [quickcheck-instances] include data-fix-0.3.4-Ity9RnZlpNYBToUDyG6f10
  15341. 854.12 s [quickcheck-instances] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  15342. 854.12 s [quickcheck-instances] include integer-logarithms-1.0.4-H7Rfid5I6Ecy5a2peKb9I
  15343. 854.12 s [quickcheck-instances] include old-time-1.1.0.4-LamKvQxcXvGIaPGAUxqrFE
  15344. 854.12 s [quickcheck-instances] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15345. 854.12 s [quickcheck-instances] include scientific-0.3.8.0-208EAotcHKuKK3a0uMgoFR
  15346. 854.12 s [quickcheck-instances] include splitmix-0.1.3.1-5QjYMYUxA5CmrSLc1zIZY
  15347. 854.12 s [quickcheck-instances] include strict-0.5.1-34kyIfF1hqWEKGfMyT7By0
  15348. 854.12 s [quickcheck-instances] include tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15349. 854.12 s [quickcheck-instances] include text-2.1.3-c691
  15350. 854.12 s [quickcheck-instances] include text-short-0.1.6-8mYoeU8VnAzKZcCnBOoo5y
  15351. 854.12 s [quickcheck-instances] include these-1.2.1-9ZdFnb52yDo6MFOrFYcqPa
  15352. 854.12 s [quickcheck-instances] include time-compat-1.9.8-741uIWoYvbfKIgMssLvXzT
  15353. 854.12 s [quickcheck-instances] include transformers-0.6.1.1-6a26
  15354. 854.12 s [quickcheck-instances] include unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  15355. 854.12 s [quickcheck-instances] include uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15356. 854.12 s [quickcheck-instances] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  15357. 854.12 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Void
  15358. 854.12 s [quickcheck-instances] unit quickcheck-instances-0.3.33-4Np47pFNrQdBiRgwYkf2Vq-self-test
  15359. 854.12 s [quickcheck-instances] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15360. 854.15 s [quickcheck-instances] include base-4.20.2.0-64da
  15361. 854.15 s [quickcheck-instances] include containers-0.7-504a
  15362. 854.15 s [quickcheck-instances] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15363. 854.15 s [quickcheck-instances] include quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15364. 854.15 s [quickcheck-instances] include tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15365. 854.15 s [quickcheck-instances] include uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15366. 854.15 s [quickcheck-instances] Ready component graph:
  15367. 854.15 s [quickcheck-instances] definite quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15368. 854.15 s [quickcheck-instances] depends OneTuple-0.4.2-GRtegyTHdcp8cc3WBaYWdG
  15369. 854.15 s [quickcheck-instances] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15370. 854.15 s [quickcheck-instances] depends array-0.5.8.0-68f3
  15371. 854.15 s [quickcheck-instances] depends base-4.20.2.0-64da
  15372. 854.15 s [quickcheck-instances] depends bytestring-0.12.2.0-262e
  15373. 854.15 s [quickcheck-instances] depends case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  15374. 854.15 s [quickcheck-instances] depends containers-0.7-504a
  15375. 854.15 s [quickcheck-instances] depends data-fix-0.3.4-Ity9RnZlpNYBToUDyG6f10
  15376. 854.15 s [quickcheck-instances] depends hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  15377. 854.15 s [quickcheck-instances] depends integer-logarithms-1.0.4-H7Rfid5I6Ecy5a2peKb9I
  15378. 854.15 s [quickcheck-instances] depends old-time-1.1.0.4-LamKvQxcXvGIaPGAUxqrFE
  15379. 854.15 s [quickcheck-instances] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15380. 854.15 s [quickcheck-instances] depends scientific-0.3.8.0-208EAotcHKuKK3a0uMgoFR
  15381. 854.15 s [quickcheck-instances] depends splitmix-0.1.3.1-5QjYMYUxA5CmrSLc1zIZY
  15382. 854.15 s [quickcheck-instances] depends strict-0.5.1-34kyIfF1hqWEKGfMyT7By0
  15383. 854.15 s [quickcheck-instances] depends tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15384. 854.15 s [quickcheck-instances] depends text-2.1.3-c691
  15385. 854.15 s [quickcheck-instances] depends text-short-0.1.6-8mYoeU8VnAzKZcCnBOoo5y
  15386. 854.15 s [quickcheck-instances] depends these-1.2.1-9ZdFnb52yDo6MFOrFYcqPa
  15387. 854.15 s [quickcheck-instances] depends time-compat-1.9.8-741uIWoYvbfKIgMssLvXzT
  15388. 854.15 s [quickcheck-instances] depends transformers-0.6.1.1-6a26
  15389. 854.15 s [quickcheck-instances] depends unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  15390. 854.15 s [quickcheck-instances] depends uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15391. 854.15 s [quickcheck-instances] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  15392. 854.15 s [quickcheck-instances] definite quickcheck-instances-0.3.33-4Np47pFNrQdBiRgwYkf2Vq-self-test
  15393. 854.15 s [quickcheck-instances] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15394. 854.15 s [quickcheck-instances] depends base-4.20.2.0-64da
  15395. 854.15 s [quickcheck-instances] depends containers-0.7-504a
  15396. 854.15 s [quickcheck-instances] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15397. 854.15 s [quickcheck-instances] depends quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15398. 854.15 s [quickcheck-instances] depends tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15399. 854.15 s [quickcheck-instances] depends uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15400. 854.15 s [quickcheck-instances] Using Cabal-3.12.1.0 compiled by ghc-9.10
  15401. 854.15 s [quickcheck-instances] Using compiler: ghc-9.10.3
  15402. 854.15 s [quickcheck-instances] Using install prefix:
  15403. 854.15 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33
  15404. 854.15 s [quickcheck-instances] Executables installed in:
  15405. 854.16 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/bin
  15406. 854.16 s [quickcheck-instances] Libraries installed in:
  15407. 854.16 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15408. 854.16 s [quickcheck-instances] Dynamic Libraries installed in:
  15409. 854.16 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  15410. 854.16 s [quickcheck-instances] Private executables installed in:
  15411. 854.16 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.10.3-05f6/quickcheck-instances-0.3.33
  15412. 854.16 s [quickcheck-instances] Data files installed in:
  15413. 854.16 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.10.3-05f6/quickcheck-instances-0.3.33
  15414. 854.16 s [quickcheck-instances] Documentation installed in:
  15415. 854.16 s [quickcheck-instances] /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  15416. 854.16 s [quickcheck-instances] Configuration files installed in:
  15417. 854.16 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/etc
  15418. 854.16 s [quickcheck-instances] No alex found
  15419. 854.16 s [quickcheck-instances] Using ar found on system at:
  15420. 854.16 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  15421. 854.16 s [quickcheck-instances] No c2hs found
  15422. 854.16 s [quickcheck-instances] No cpphs found
  15423. 854.16 s [quickcheck-instances] No doctest found
  15424. 854.16 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  15425. 854.16 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  15426. 854.16 s [quickcheck-instances] Using ghc version 9.10.3 found on system at:
  15427. 854.16 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  15428. 854.16 s [quickcheck-instances] Using ghc-pkg version 9.10.3 found on system at:
  15429. 854.16 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  15430. 854.16 s [quickcheck-instances] No ghcjs found
  15431. 854.16 s [quickcheck-instances] No ghcjs-pkg found
  15432. 854.16 s [quickcheck-instances] No greencard found
  15433. 854.16 s [quickcheck-instances] Using haddock version 2.31.1 found on system at:
  15434. 854.16 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  15435. 854.16 s [quickcheck-instances] No happy found
  15436. 854.16 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  15437. 854.16 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15438. 854.16 s [quickcheck-instances] No hmake found
  15439. 854.16 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  15440. 854.16 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  15441. 854.16 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  15442. 854.16 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  15443. 854.16 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  15444. 854.16 s [quickcheck-instances] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  15445. 854.16 s [quickcheck-instances] No jhc found
  15446. 854.16 s [quickcheck-instances] Using ld found on system at:
  15447. 854.16 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  15448. 854.16 s [quickcheck-instances] No pkg-config found
  15449. 854.16 s [quickcheck-instances] Using runghc version 9.10.3 found on system at:
  15450. 854.16 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  15451. 854.16 s [quickcheck-instances] Using strip version 2.44 found on system at:
  15452. 854.16 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  15453. 854.16 s [quickcheck-instances] Using tar found on system at:
  15454. 854.16 s [quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  15455. 854.16 s [quickcheck-instances] No uhc found
  15456. 854.57 s [quickcheck-instances] Phase: buildPhase
  15457. 854.73 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  15458. 854.75 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33...
  15459. 854.98 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 )
  15460. 855.06 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 )
  15461. 855.08 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 )
  15462. 856.07 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 )
  15463. 856.35 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 )
  15464. 856.59 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 )
  15465. 856.59 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 )
  15466. 856.59 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 )
  15467. 856.59 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 )
  15468. 856.59 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 )
  15469. 856.60 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 )
  15470. 856.60 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 )
  15471. 856.60 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 )
  15472. 856.60 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 )
  15473. 856.60 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 )
  15474. 856.86 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 )
  15475. 856.86 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 )
  15476. 856.86 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 )
  15477. 856.86 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 )
  15478. 856.93 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 )
  15479. 857.65 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 )
  15480. 857.65 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 )
  15481. 857.65 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 )
  15482. 857.65 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 )
  15483. 857.65 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 )
  15484. 857.65 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 )
  15485. 858.32 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 )
  15486. 858.57 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 )
  15487. 858.61 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 )
  15488. 860.17 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 )
  15489. 860.20 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 )
  15490. 860.44 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 )
  15491. 860.45 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 )
  15492. 860.71 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 )
  15493. 860.71 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 )
  15494. 860.71 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 )
  15495. 860.71 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 )
  15496. 860.84 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 )
  15497. 860.84 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 )
  15498. 860.84 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 )
  15499. 860.84 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 )
  15500. 860.84 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 )
  15501. 860.84 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 )
  15502. 860.84 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 )
  15503. 860.84 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 )
  15504. 861.14 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 )
  15505. 861.51 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 )
  15506. 861.51 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 )
  15507. 861.51 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 )
  15508. 861.51 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 )
  15509. 861.51 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 )
  15510. 861.51 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  15511. 865.72 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  15512. 865.72 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33...
  15513. 865.86 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  15514. 866.48 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  15515. 868.12 s [quickcheck-instances] Phase: checkPhase
  15516. 869.31 s [quickcheck-instances] Running 1 test suites...
  15517. 869.32 s [quickcheck-instances] Test suite self-test: RUNNING...
  15518. 869.33 s [quickcheck-instances] +++ OK, passed 100 tests.
  15519. 869.33 s [quickcheck-instances] +++ OK, passed 100 tests.
  15520. 869.33 s [quickcheck-instances] +++ OK, passed 100 tests.
  15521. 869.33 s [quickcheck-instances] +++ OK, passed 100 tests.
  15522. 869.34 s [quickcheck-instances] +++ OK, passed 100 tests.
  15523. 869.34 s [quickcheck-instances] Test suite self-test: PASS
  15524. 869.34 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  15525. 869.34 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  15526. 869.35 s [quickcheck-instances] Phase: haddockPhase
  15527. 869.72 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  15528. 869.74 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33...
  15529. 869.74 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  15530. 869.74 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  15531. 870.54 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  15532. 870.58 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  15533. 870.62 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  15534. 870.95 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  15535. 871.07 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  15536. 871.15 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  15537. 871.19 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  15538. 871.21 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  15539. 871.22 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  15540. 871.30 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  15541. 871.42 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  15542. 871.43 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  15543. 871.63 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  15544. 871.73 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  15545. 871.75 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  15546. 871.88 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  15547. 872.06 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  15548. 872.07 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  15549. 872.09 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  15550. 872.16 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  15551. 872.43 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  15552. 872.53 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  15553. 872.58 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  15554. 872.63 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  15555. 873.02 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  15556. 873.03 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  15557. 873.05 s [quickcheck-instances] Haddock coverage:
  15558. 873.05 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  15559. 873.05 s [quickcheck-instances] Missing documentation for:
  15560. 873.05 s [quickcheck-instances] Module header
  15561. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  15562. 873.07 s [quickcheck-instances] Missing documentation for:
  15563. 873.07 s [quickcheck-instances] Module header
  15564. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  15565. 873.07 s [quickcheck-instances] Missing documentation for:
  15566. 873.07 s [quickcheck-instances] Module header
  15567. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  15568. 873.07 s [quickcheck-instances] Missing documentation for:
  15569. 873.07 s [quickcheck-instances] Module header
  15570. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  15571. 873.07 s [quickcheck-instances] Missing documentation for:
  15572. 873.07 s [quickcheck-instances] Module header
  15573. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  15574. 873.07 s [quickcheck-instances] Missing documentation for:
  15575. 873.07 s [quickcheck-instances] Module header
  15576. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  15577. 873.07 s [quickcheck-instances] Missing documentation for:
  15578. 873.07 s [quickcheck-instances] Module header
  15579. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  15580. 873.07 s [quickcheck-instances] Missing documentation for:
  15581. 873.07 s [quickcheck-instances] Module header
  15582. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  15583. 873.07 s [quickcheck-instances] Missing documentation for:
  15584. 873.07 s [quickcheck-instances] Module header
  15585. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  15586. 873.07 s [quickcheck-instances] Missing documentation for:
  15587. 873.07 s [quickcheck-instances] Module header
  15588. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  15589. 873.07 s [quickcheck-instances] Missing documentation for:
  15590. 873.07 s [quickcheck-instances] Module header
  15591. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  15592. 873.07 s [quickcheck-instances] Missing documentation for:
  15593. 873.07 s [quickcheck-instances] Module header
  15594. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  15595. 873.07 s [quickcheck-instances] Missing documentation for:
  15596. 873.07 s [quickcheck-instances] Module header
  15597. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  15598. 873.07 s [quickcheck-instances] Missing documentation for:
  15599. 873.07 s [quickcheck-instances] Module header
  15600. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  15601. 873.07 s [quickcheck-instances] Missing documentation for:
  15602. 873.07 s [quickcheck-instances] Module header
  15603. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  15604. 873.07 s [quickcheck-instances] Missing documentation for:
  15605. 873.07 s [quickcheck-instances] Module header
  15606. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  15607. 873.07 s [quickcheck-instances] Missing documentation for:
  15608. 873.07 s [quickcheck-instances] Module header
  15609. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  15610. 873.07 s [quickcheck-instances] Missing documentation for:
  15611. 873.07 s [quickcheck-instances] Module header
  15612. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  15613. 873.07 s [quickcheck-instances] Missing documentation for:
  15614. 873.07 s [quickcheck-instances] Module header
  15615. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  15616. 873.07 s [quickcheck-instances] Missing documentation for:
  15617. 873.07 s [quickcheck-instances] Module header
  15618. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  15619. 873.07 s [quickcheck-instances] Missing documentation for:
  15620. 873.07 s [quickcheck-instances] Module header
  15621. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  15622. 873.07 s [quickcheck-instances] Missing documentation for:
  15623. 873.07 s [quickcheck-instances] Module header
  15624. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  15625. 873.07 s [quickcheck-instances] Missing documentation for:
  15626. 873.07 s [quickcheck-instances] Module header
  15627. 873.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  15628. 873.07 s [quickcheck-instances] Missing documentation for:
  15629. 873.07 s [quickcheck-instances] Module header
  15630. 873.07 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  15631. 875.27 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  15632. 875.27 s [quickcheck-instances] - Data.Vector.Vector
  15633. 875.27 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  15634. 875.27 s [quickcheck-instances] - Data.Vector.Storable.Vector
  15635. 875.27 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  15636. 875.27 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  15637. 875.27 s [quickcheck-instances] - Data.Vector.Strict.Vector
  15638. 890.02 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  15639. 890.02 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  15640. 890.24 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  15641. 890.25 s [quickcheck-instances] Phase: installPhase
  15642. 890.45 s [quickcheck-instances] Installing library in /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15643. 891.45 s [quickcheck-instances] Phase: fixupPhase
  15644. 891.49 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33
  15645. 891.50 s [quickcheck-instances] shrinking /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSquickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq-ghc9.10.3.so
  15646. 891.54 s [quickcheck-instances] checking for references to /build/ in /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33...
  15647. 891.60 s [quickcheck-instances] patching script interpreter paths in /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33
  15648. 891.61 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/lib
  15649. 891.84 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc
  15650. 891.87 s [quickcheck-instances] checking for references to /build/ in /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc...
  15651. 891.91 s [quickcheck-instances] patching script interpreter paths in /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc
  15652. 892.14 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33
  15653. 892.68 s [quickcheck-instances:post-build] Nothing to push - all store paths are already on Cachix.
  15654. 892.72 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33
  15655. 892.82 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15656. 892.90 s [quickcheck-instances:post-build] copying 1 paths...
  15657. 892.90 s [quickcheck-instances:post-build] copying path '/nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  15658. 895.73 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15659. 895.89 s [quickcheck-instances:post-build] copying 0 paths...
  15660. 895.95 s Progress: 8 of 15 built, 159 of 159 downloaded from cache
  15661. 896.16 s Building /nix/store/bz161fnf57cqvgzf0f4j7qs4pl5dmgs5-extra-1.8.1.drv
  15662. 896.39 s [extra] Phase: setupCompilerEnvironmentPhase
  15663. 896.40 s [extra] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  15664. 897.02 s [extra] Phase: unpackPhase
  15665. 897.03 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  15666. 897.05 s [extra] source root is extra-1.8.1
  15667. 897.10 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  15668. 897.10 s [extra] Phase: patchPhase
  15669. 897.13 s [extra] Phase: compileBuildDriverPhase
  15670. 897.14 s [extra] setupCompileFlags: -package-db=/build/tmp.RdFHlvSRdP/setup-package.conf.d -threaded
  15671. 897.36 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.RdFHlvSRdP/Main.o )
  15672. 897.52 s [extra] [2 of 2] Linking Setup
  15673. 900.63 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  15674. 900.65 s [extra] Phase: configurePhase
  15675. 900.66 s [extra] configureFlags: --verbose --prefix=/nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.RdFHlvSRdP/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  15676. 900.68 s [extra] Using Parsec parser
  15677. 900.68 s [extra] Configuring extra-1.8.1...
  15678. 902.04 s [extra] Dependency base >=4.9 && <5: using base-4.20.2.0
  15679. 902.04 s [extra] Dependency clock >=0.7: using clock-0.8.4
  15680. 902.06 s [extra] Dependency directory: using directory-1.3.8.5
  15681. 902.06 s [extra] Dependency filepath: using filepath-1.5.4.0
  15682. 902.06 s [extra] Dependency process: using process-1.6.26.1
  15683. 902.06 s [extra] Dependency time: using time-1.12.2
  15684. 902.06 s [extra] Dependency unix: using unix-2.8.7.0
  15685. 902.06 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  15686. 902.06 s [extra] Dependency base >=4 && <5: using base-4.20.2.0
  15687. 902.06 s [extra] Dependency directory: using directory-1.3.8.5
  15688. 902.06 s [extra] Dependency extra: using extra-1.8.1
  15689. 902.06 s [extra] Dependency filepath: using filepath-1.5.4.0
  15690. 902.06 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  15691. 902.06 s [extra] Dependency unix: using unix-2.8.7.0
  15692. 902.06 s [extra] Source component graph:
  15693. 902.06 s [extra] component lib
  15694. 902.06 s [extra] component test:extra-test dependency lib
  15695. 902.06 s [extra] Configured component graph:
  15696. 902.06 s [extra] component extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15697. 902.06 s [extra] include base-4.20.2.0-64da
  15698. 902.06 s [extra] include clock-0.8.4-DESOrX5zfVt4al9hSRThI9
  15699. 902.06 s [extra] include directory-1.3.8.5-c84a
  15700. 902.06 s [extra] include filepath-1.5.4.0-e600
  15701. 902.06 s [extra] include process-1.6.26.1-ccf0
  15702. 902.06 s [extra] include time-1.12.2-652a
  15703. 902.06 s [extra] include unix-2.8.7.0-da6a
  15704. 902.06 s [extra] component extra-1.8.1-7HOE6hcxmLi39jdFVDdKEp-extra-test
  15705. 902.06 s [extra] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15706. 902.06 s [extra] include base-4.20.2.0-64da
  15707. 902.07 s [extra] include directory-1.3.8.5-c84a
  15708. 902.07 s [extra] include extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15709. 902.07 s [extra] include filepath-1.5.4.0-e600
  15710. 902.07 s [extra] include quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15711. 902.07 s [extra] include unix-2.8.7.0-da6a
  15712. 902.07 s [extra] Linked component graph:
  15713. 902.07 s [extra] unit extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15714. 902.07 s [extra] include base-4.20.2.0-64da
  15715. 902.07 s [extra] include clock-0.8.4-DESOrX5zfVt4al9hSRThI9
  15716. 902.07 s [extra] include directory-1.3.8.5-c84a
  15717. 902.07 s [extra] include filepath-1.5.4.0-e600
  15718. 902.07 s [extra] include process-1.6.26.1-ccf0
  15719. 902.07 s [extra] include time-1.12.2-652a
  15720. 902.07 s [extra] include unix-2.8.7.0-da6a
  15721. 902.07 s [extra] Control.Concurrent.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Version.Extra,Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Extra,Numeric.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Numeric.Extra,System.Directory.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.Environment.Extra,System.IO.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.IO.Extra,System.Info.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.Info.Extra,System.Process.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.Process.Extra,System.Time.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.Time.Extra,Text.Read.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Text.Read.Extra
  15722. 902.07 s [extra] unit extra-1.8.1-7HOE6hcxmLi39jdFVDdKEp-extra-test
  15723. 902.07 s [extra] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15724. 902.07 s [extra] include base-4.20.2.0-64da
  15725. 902.07 s [extra] include directory-1.3.8.5-c84a
  15726. 902.07 s [extra] include extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15727. 902.07 s [extra] include filepath-1.5.4.0-e600
  15728. 902.07 s [extra] include quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15729. 902.07 s [extra] include unix-2.8.7.0-da6a
  15730. 902.07 s [extra] Ready component graph:
  15731. 902.07 s [extra] definite extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15732. 902.07 s [extra] depends base-4.20.2.0-64da
  15733. 902.07 s [extra] depends clock-0.8.4-DESOrX5zfVt4al9hSRThI9
  15734. 902.07 s [extra] depends directory-1.3.8.5-c84a
  15735. 902.07 s [extra] depends filepath-1.5.4.0-e600
  15736. 902.07 s [extra] depends process-1.6.26.1-ccf0
  15737. 902.07 s [extra] depends time-1.12.2-652a
  15738. 902.07 s [extra] depends unix-2.8.7.0-da6a
  15739. 902.07 s [extra] definite extra-1.8.1-7HOE6hcxmLi39jdFVDdKEp-extra-test
  15740. 902.07 s [extra] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15741. 902.07 s [extra] depends base-4.20.2.0-64da
  15742. 902.07 s [extra] depends directory-1.3.8.5-c84a
  15743. 902.07 s [extra] depends extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15744. 902.07 s [extra] depends filepath-1.5.4.0-e600
  15745. 902.07 s [extra] depends quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15746. 902.07 s [extra] depends unix-2.8.7.0-da6a
  15747. 902.07 s [extra] Using Cabal-3.12.1.0 compiled by ghc-9.10
  15748. 902.07 s [extra] Using compiler: ghc-9.10.3
  15749. 902.07 s [extra] Using install prefix: /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1
  15750. 902.07 s [extra] Executables installed in:
  15751. 902.07 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/bin
  15752. 902.07 s [extra] Libraries installed in:
  15753. 902.07 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15754. 902.07 s [extra] Dynamic Libraries installed in:
  15755. 902.07 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  15756. 902.07 s [extra] Private executables installed in:
  15757. 902.07 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/libexec/x86_64-linux-ghc-9.10.3-05f6/extra-1.8.1
  15758. 902.07 s [extra] Data files installed in:
  15759. 902.07 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/share/x86_64-linux-ghc-9.10.3-05f6/extra-1.8.1
  15760. 902.07 s [extra] Documentation installed in:
  15761. 902.07 s [extra] /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc/share/doc/extra-1.8.1
  15762. 902.07 s [extra] Configuration files installed in:
  15763. 902.07 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/etc
  15764. 902.07 s [extra] No alex found
  15765. 902.07 s [extra] Using ar found on system at:
  15766. 902.07 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  15767. 902.07 s [extra] No c2hs found
  15768. 902.07 s [extra] No cpphs found
  15769. 902.07 s [extra] No doctest found
  15770. 902.07 s [extra] Using gcc version 14.3.0 given by user at:
  15771. 902.07 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  15772. 902.07 s [extra] Using ghc version 9.10.3 found on system at:
  15773. 902.07 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  15774. 902.07 s [extra] Using ghc-pkg version 9.10.3 found on system at:
  15775. 902.07 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  15776. 902.07 s [extra] No ghcjs found
  15777. 902.07 s [extra] No ghcjs-pkg found
  15778. 902.07 s [extra] No greencard found
  15779. 902.07 s [extra] Using haddock version 2.31.1 found on system at:
  15780. 902.07 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  15781. 902.07 s [extra] No happy found
  15782. 902.07 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  15783. 902.07 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15784. 902.07 s [extra] No hmake found
  15785. 902.07 s [extra] Using hpc version 0.69 found on system at:
  15786. 902.07 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  15787. 902.07 s [extra] Using hsc2hs version 0.68.10 found on system at:
  15788. 902.07 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  15789. 902.07 s [extra] Using hscolour version 1.25 found on system at:
  15790. 902.07 s [extra] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  15791. 902.07 s [extra] No jhc found
  15792. 902.07 s [extra] Using ld found on system at:
  15793. 902.07 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  15794. 902.07 s [extra] No pkg-config found
  15795. 902.07 s [extra] Using runghc version 9.10.3 found on system at:
  15796. 902.07 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  15797. 902.07 s [extra] Using strip version 2.44 found on system at:
  15798. 902.07 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  15799. 902.07 s [extra] Using tar found on system at:
  15800. 902.07 s [extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  15801. 902.07 s [extra] No uhc found
  15802. 902.43 s [extra] Phase: buildPhase
  15803. 902.52 s [extra] Preprocessing library for extra-1.8.1...
  15804. 902.54 s [extra] Building library for extra-1.8.1...
  15805. 902.96 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 )
  15806. 903.21 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 )
  15807. 903.21 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 )
  15808. 903.25 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 )
  15809. 903.25 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  15810. 903.25 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  15811. 903.25 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 )
  15812. 905.60 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 )
  15813. 905.69 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 )
  15814. 905.89 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 )
  15815. 905.89 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 )
  15816. 905.89 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 )
  15817. 906.22 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 )
  15818. 906.36 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 )
  15819. 906.74 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 )
  15820. 906.74 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 )
  15821. 906.74 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 )
  15822. 907.08 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 )
  15823. 907.12 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 )
  15824. 907.18 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 )
  15825. 907.18 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  15826. 907.35 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 )
  15827. 908.25 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  15828. 908.69 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  15829. 908.69 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  15830. 908.73 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  15831. 908.73 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  15832. 908.73 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  15833. 908.73 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  15834. 910.44 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  15835. 910.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 )
  15836. 910.85 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  15837. 910.85 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  15838. 910.85 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  15839. 911.35 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  15840. 911.63 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  15841. 911.84 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  15842. 911.84 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  15843. 911.84 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  15844. 912.28 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  15845. 912.31 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  15846. 912.57 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  15847. 912.58 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  15848. 912.84 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  15849. 914.83 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  15850. 914.83 s [extra] Building test suite 'extra-test' for extra-1.8.1...
  15851. 914.94 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  15852. 915.64 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  15853. 919.62 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  15854. 919.64 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  15855. 920.16 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  15856. 921.70 s [extra] Phase: checkPhase
  15857. 922.24 s [extra] Running 1 test suites...
  15858. 922.24 s [extra] Test suite extra-test: RUNNING...
  15859. 922.25 s [extra] withTempFile
  15860. 922.25 s [extra] +++ OK, passed 100 tests.
  15861. 922.25 s [extra] captureOutput
  15862. 922.26 s [extra] +++ OK, passed 100 tests.
  15863. 922.26 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  15864. 922.31 s [extra] +++ OK, passed 100 tests.
  15865. 922.31 s [extra] \(x :: IO Int) -> join (once x) == x
  15866. 922.36 s [extra] +++ OK, passed 100 tests.
  15867. 922.36 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  15868. 922.42 s [extra] +++ OK, passed 100 tests.
  15869. 922.42 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  15870. 922.48 s [extra] +++ OK, passed 100 tests.
  15871. 922.48 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  15872. 922.54 s [extra] +++ OK, passed 100 tests.
  15873. 922.54 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  15874. 922.59 s [extra] +++ OK, passed 100 tests.
  15875. 922.59 s [extra] stringException "test" == pure "test"
  15876. 922.59 s [extra] +++ OK, passed 100 tests.
  15877. 922.59 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  15878. 922.59 s [extra] +++ OK, passed 100 tests.
  15879. 922.59 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  15880. 922.59 s [extra] +++ OK, passed 100 tests.
  15881. 922.59 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  15882. 922.59 s [extra] +++ OK, passed 100 tests.
  15883. 922.59 s [extra] ignore (print 1) == print 1
  15884. 922.59 s [extra] +++ OK, passed 100 tests.
  15885. 922.59 s [extra] ignore (fail "die") == pure ()
  15886. 922.60 s [extra] +++ OK, passed 100 tests.
  15887. 922.60 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  15888. 922.60 s [extra] +++ OK, passed 100 tests.
  15889. 922.60 s [extra] seq (errorIO "foo") (print 1) == print 1
  15890. 922.60 s [extra] +++ OK, passed 100 tests.
  15891. 922.60 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  15892. 922.60 s [extra] +++ OK, passed 100 tests.
  15893. 922.60 s [extra] seq (assertIO False) (print 1) == print 1
  15894. 922.60 s [extra] +++ OK, passed 100 tests.
  15895. 922.60 s [extra] retry 1 (print "x") == print "x"
  15896. 922.60 s [extra] +++ OK, passed 100 tests.
  15897. 922.60 s [extra] retry 3 (fail "die") == fail "die"
  15898. 922.60 s [extra] +++ OK, passed 100 tests.
  15899. 922.60 s [extra] whenJust Nothing print == pure ()
  15900. 922.60 s [extra] +++ OK, passed 100 tests.
  15901. 922.60 s [extra] whenJust (Just 1) print == print 1
  15902. 922.60 s [extra] +++ OK, passed 100 tests.
  15903. 922.60 s [extra] pureIf @Maybe True 5 == Just 5
  15904. 922.60 s [extra] +++ OK, passed 100 tests.
  15905. 922.60 s [extra] pureIf @Maybe False 5 == Nothing
  15906. 922.60 s [extra] +++ OK, passed 100 tests.
  15907. 922.60 s [extra] pureIf @[] True 5 == [5]
  15908. 922.60 s [extra] +++ OK, passed 100 tests.
  15909. 922.60 s [extra] pureIf @[] False 5 == []
  15910. 922.60 s [extra] +++ OK, passed 100 tests.
  15911. 922.60 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  15912. 922.60 s [extra] +++ OK, passed 100 tests.
  15913. 922.60 s [extra] whenMaybe False (print 1) == pure Nothing
  15914. 922.60 s [extra] +++ OK, passed 100 tests.
  15915. 922.61 s [extra] \(x :: Maybe ()) -> unit x == x
  15916. 922.61 s [extra] +++ OK, passed 100 tests.
  15917. 922.61 s [extra] guarded even 2 == [2]
  15918. 922.61 s [extra] +++ OK, passed 100 tests.
  15919. 922.61 s [extra] guarded odd 2 == Nothing
  15920. 922.61 s [extra] +++ OK, passed 100 tests.
  15921. 922.61 s [extra] guarded (not.null) "My Name" == Just "My Name"
  15922. 922.61 s [extra] +++ OK, passed 100 tests.
  15923. 922.61 s [extra] guardedA (return . even) 42 == Just [42]
  15924. 922.61 s [extra] +++ OK, passed 100 tests.
  15925. 922.61 s [extra] guardedA (return . odd) 42 == Just []
  15926. 922.61 s [extra] +++ OK, passed 100 tests.
  15927. 922.61 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  15928. 922.61 s [extra] +++ OK, passed 100 tests.
  15929. 922.61 s [extra] fold1M (\x y -> Just x) [] == undefined
  15930. 922.61 s [extra] +++ OK, passed 100 tests.
  15931. 922.61 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  15932. 922.61 s [extra] +++ OK, passed 100 tests.
  15933. 922.61 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  15934. 922.61 s [extra] +++ OK, passed 100 tests.
  15935. 922.61 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  15936. 922.61 s [extra] +++ OK, passed 100 tests.
  15937. 922.61 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  15938. 922.61 s [extra] +++ OK, passed 100 tests.
  15939. 922.61 s [extra] Just True ||^ undefined == Just True
  15940. 922.61 s [extra] +++ OK, passed 100 tests.
  15941. 922.61 s [extra] Just False ||^ Just True == Just True
  15942. 922.61 s [extra] +++ OK, passed 100 tests.
  15943. 922.61 s [extra] Just False ||^ Just False == Just False
  15944. 922.61 s [extra] +++ OK, passed 100 tests.
  15945. 922.61 s [extra] Just False &&^ undefined == Just False
  15946. 922.61 s [extra] +++ OK, passed 100 tests.
  15947. 922.61 s [extra] Just True &&^ Just True == Just True
  15948. 922.61 s [extra] +++ OK, passed 100 tests.
  15949. 922.61 s [extra] Just True &&^ Just False == Just False
  15950. 922.61 s [extra] +++ OK, passed 100 tests.
  15951. 922.61 s [extra] anyM Just [False,True ,undefined] == Just True
  15952. 922.61 s [extra] +++ OK, passed 100 tests.
  15953. 922.61 s [extra] anyM Just [False,False,undefined] == undefined
  15954. 922.61 s [extra] +++ OK, passed 100 tests.
  15955. 922.61 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15956. 922.61 s [extra] +++ OK, passed 100 tests.
  15957. 922.61 s [extra] allM Just [True,False,undefined] == Just False
  15958. 922.61 s [extra] +++ OK, passed 100 tests.
  15959. 922.61 s [extra] allM Just [True,True ,undefined] == undefined
  15960. 922.61 s [extra] +++ OK, passed 100 tests.
  15961. 922.61 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15962. 922.61 s [extra] +++ OK, passed 100 tests.
  15963. 922.61 s [extra] orM [Just False,Just True ,undefined] == Just True
  15964. 922.61 s [extra] +++ OK, passed 100 tests.
  15965. 922.61 s [extra] orM [Just False,Just False,undefined] == undefined
  15966. 922.61 s [extra] +++ OK, passed 100 tests.
  15967. 922.61 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  15968. 922.61 s [extra] +++ OK, passed 100 tests.
  15969. 922.61 s [extra] andM [Just True,Just False,undefined] == Just False
  15970. 922.61 s [extra] +++ OK, passed 100 tests.
  15971. 922.61 s [extra] andM [Just True,Just True ,undefined] == undefined
  15972. 922.61 s [extra] +++ OK, passed 100 tests.
  15973. 922.61 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  15974. 922.61 s [extra] +++ OK, passed 100 tests.
  15975. 922.61 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  15976. 922.61 s [extra] +++ OK, passed 100 tests.
  15977. 922.61 s [extra] findM (Just . isUpper) "test" == Just Nothing
  15978. 922.61 s [extra] +++ OK, passed 100 tests.
  15979. 922.61 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  15980. 922.61 s [extra] +++ OK, passed 100 tests.
  15981. 922.61 s [extra] fromLeft 1 (Left 3) == 3
  15982. 922.61 s [extra] +++ OK, passed 100 tests.
  15983. 922.61 s [extra] fromLeft 1 (Right "foo") == 1
  15984. 922.62 s [extra] +++ OK, passed 100 tests.
  15985. 922.62 s [extra] fromRight 1 (Right 3) == 3
  15986. 922.62 s [extra] +++ OK, passed 100 tests.
  15987. 922.62 s [extra] fromRight 1 (Left "foo") == 1
  15988. 922.62 s [extra] +++ OK, passed 100 tests.
  15989. 922.62 s [extra] \x -> fromLeft' (Left x) == x
  15990. 922.63 s [extra] +++ OK, passed 100 tests.
  15991. 922.63 s [extra] \x -> fromLeft' (Right x) == undefined
  15992. 922.63 s [extra] +++ OK, passed 100 tests.
  15993. 922.63 s [extra] \x -> fromRight' (Right x) == x
  15994. 922.63 s [extra] +++ OK, passed 100 tests.
  15995. 922.63 s [extra] \x -> fromRight' (Left x) == undefined
  15996. 922.63 s [extra] +++ OK, passed 100 tests.
  15997. 922.63 s [extra] \x -> fromEither (Left x ) == x
  15998. 922.63 s [extra] +++ OK, passed 100 tests.
  15999. 922.63 s [extra] \x -> fromEither (Right x) == x
  16000. 922.63 s [extra] +++ OK, passed 100 tests.
  16001. 922.63 s [extra] \a b -> maybeToEither a (Just b) == Right b
  16002. 922.63 s [extra] +++ OK, passed 100 tests.
  16003. 922.63 s [extra] \a -> maybeToEither a Nothing == Left a
  16004. 922.63 s [extra] +++ OK, passed 100 tests.
  16005. 922.63 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  16006. 922.63 s [extra] +++ OK, passed 100 tests.
  16007. 922.63 s [extra] \x -> eitherToMaybe (Right x) == Just x
  16008. 922.63 s [extra] +++ OK, passed 100 tests.
  16009. 922.63 s [extra] mapLeft show (Left 1) == Left "1"
  16010. 922.63 s [extra] +++ OK, passed 100 tests.
  16011. 922.63 s [extra] mapLeft show (Right True) == Right True
  16012. 922.63 s [extra] +++ OK, passed 100 tests.
  16013. 922.63 s [extra] mapRight show (Left 1) == Left 1
  16014. 922.63 s [extra] +++ OK, passed 100 tests.
  16015. 922.63 s [extra] mapRight show (Right True) == Right "True"
  16016. 922.63 s [extra] +++ OK, passed 100 tests.
  16017. 922.63 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  16018. 922.64 s [extra] +++ OK, passed 100 tests.
  16019. 922.64 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  16020. 922.64 s [extra] +++ OK, passed 100 tests.
  16021. 922.64 s [extra] \xs -> repeatedly line1 xs == lines xs
  16022. 922.64 s [extra] +++ OK, passed 100 tests.
  16023. 922.64 s [extra] disjoint [1,2,3] [4,5] == True
  16024. 922.64 s [extra] +++ OK, passed 100 tests.
  16025. 922.64 s [extra] disjoint [1,2,3] [4,1] == False
  16026. 922.64 s [extra] +++ OK, passed 100 tests.
  16027. 922.64 s [extra] disjointOrd [1,2,3] [4,5] == True
  16028. 922.64 s [extra] +++ OK, passed 100 tests.
  16029. 922.64 s [extra] disjointOrd [1,2,3] [4,1] == False
  16030. 922.64 s [extra] +++ OK, passed 100 tests.
  16031. 922.64 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  16032. 922.64 s [extra] +++ OK, passed 100 tests.
  16033. 922.64 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  16034. 922.64 s [extra] +++ OK, passed 100 tests.
  16035. 922.64 s [extra] anySame [1,1,2] == True
  16036. 922.64 s [extra] +++ OK, passed 100 tests.
  16037. 922.64 s [extra] anySame [1,2,3] == False
  16038. 922.64 s [extra] +++ OK, passed 100 tests.
  16039. 922.64 s [extra] anySame (1:2:1:undefined) == True
  16040. 922.64 s [extra] +++ OK, passed 100 tests.
  16041. 922.64 s [extra] anySame [] == False
  16042. 922.64 s [extra] +++ OK, passed 100 tests.
  16043. 922.64 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  16044. 922.64 s [extra] +++ OK, passed 100 tests.
  16045. 922.64 s [extra] allSame [1,1,2] == False
  16046. 922.64 s [extra] +++ OK, passed 100 tests.
  16047. 922.64 s [extra] allSame [1,1,1] == True
  16048. 922.64 s [extra] +++ OK, passed 100 tests.
  16049. 922.64 s [extra] allSame [1] == True
  16050. 922.64 s [extra] +++ OK, passed 100 tests.
  16051. 922.64 s [extra] allSame [] == True
  16052. 922.64 s [extra] +++ OK, passed 100 tests.
  16053. 922.64 s [extra] allSame (1:1:2:undefined) == False
  16054. 922.64 s [extra] +++ OK, passed 100 tests.
  16055. 922.64 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  16056. 922.64 s [extra] +++ OK, passed 100 tests.
  16057. 922.64 s [extra] headDef 1 [] == 1
  16058. 922.64 s [extra] +++ OK, passed 100 tests.
  16059. 922.64 s [extra] headDef 1 [2,3,4] == 2
  16060. 922.64 s [extra] +++ OK, passed 100 tests.
  16061. 922.64 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  16062. 922.64 s [extra] +++ OK, passed 100 tests.
  16063. 922.64 s [extra] lastDef 1 [] == 1
  16064. 922.64 s [extra] +++ OK, passed 100 tests.
  16065. 922.64 s [extra] lastDef 1 [2,3,4] == 4
  16066. 922.64 s [extra] +++ OK, passed 100 tests.
  16067. 922.64 s [extra] \x xs -> lastDef x xs == last (x:xs)
  16068. 922.65 s [extra] +++ OK, passed 100 tests.
  16069. 922.65 s [extra] [2,3,4] !? 1 == Just 3
  16070. 922.65 s [extra] +++ OK, passed 100 tests.
  16071. 922.65 s [extra] [2,3,4] !? (-1) == Nothing
  16072. 922.65 s [extra] +++ OK, passed 100 tests.
  16073. 922.65 s [extra] [] !? 0 == Nothing
  16074. 922.65 s [extra] +++ OK, passed 100 tests.
  16075. 922.65 s [extra] notNull [] == False
  16076. 922.65 s [extra] +++ OK, passed 100 tests.
  16077. 922.65 s [extra] notNull [1] == True
  16078. 922.65 s [extra] +++ OK, passed 100 tests.
  16079. 922.65 s [extra] \xs -> notNull xs == not (null xs)
  16080. 922.65 s [extra] +++ OK, passed 100 tests.
  16081. 922.65 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  16082. 922.65 s [extra] +++ OK, passed 100 tests.
  16083. 922.65 s [extra] list 1 (\v _ -> v - 2) [] == 1
  16084. 922.65 s [extra] +++ OK, passed 100 tests.
  16085. 922.65 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  16086. 922.65 s [extra] +++ OK, passed 100 tests.
  16087. 922.65 s [extra] unsnoc "test" == Just ("tes",'t')
  16088. 922.65 s [extra] +++ OK, passed 100 tests.
  16089. 922.65 s [extra] unsnoc "" == Nothing
  16090. 922.65 s [extra] +++ OK, passed 100 tests.
  16091. 922.65 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  16092. 922.65 s [extra] +++ OK, passed 100 tests.
  16093. 922.65 s [extra] cons 't' "est" == "test"
  16094. 922.65 s [extra] +++ OK, passed 100 tests.
  16095. 922.65 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  16096. 922.65 s [extra] +++ OK, passed 100 tests.
  16097. 922.65 s [extra] snoc "tes" 't' == "test"
  16098. 922.65 s [extra] +++ OK, passed 100 tests.
  16099. 922.65 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  16100. 922.65 s [extra] +++ OK, passed 100 tests.
  16101. 922.65 s [extra] enumerate == [False, True]
  16102. 922.65 s [extra] +++ OK, passed 100 tests.
  16103. 922.65 s [extra] takeEnd 3 "hello" == "llo"
  16104. 922.65 s [extra] +++ OK, passed 100 tests.
  16105. 922.65 s [extra] takeEnd 5 "bye" == "bye"
  16106. 922.65 s [extra] +++ OK, passed 100 tests.
  16107. 922.65 s [extra] takeEnd (-1) "bye" == ""
  16108. 922.65 s [extra] +++ OK, passed 100 tests.
  16109. 922.65 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  16110. 922.65 s [extra] +++ OK, passed 100 tests.
  16111. 922.65 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  16112. 922.66 s [extra] +++ OK, passed 100 tests.
  16113. 922.66 s [extra] dropEnd 3 "hello" == "he"
  16114. 922.66 s [extra] +++ OK, passed 100 tests.
  16115. 922.66 s [extra] dropEnd 5 "bye" == ""
  16116. 922.66 s [extra] +++ OK, passed 100 tests.
  16117. 922.66 s [extra] dropEnd (-1) "bye" == "bye"
  16118. 922.66 s [extra] +++ OK, passed 100 tests.
  16119. 922.66 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  16120. 922.66 s [extra] +++ OK, passed 100 tests.
  16121. 922.66 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  16122. 922.66 s [extra] +++ OK, passed 100 tests.
  16123. 922.66 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  16124. 922.66 s [extra] +++ OK, passed 100 tests.
  16125. 922.66 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  16126. 922.66 s [extra] +++ OK, passed 100 tests.
  16127. 922.66 s [extra] splitAtEnd 3 "he" == ("", "he")
  16128. 922.66 s [extra] +++ OK, passed 100 tests.
  16129. 922.66 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  16130. 922.66 s [extra] +++ OK, passed 100 tests.
  16131. 922.66 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  16132. 922.66 s [extra] +++ OK, passed 100 tests.
  16133. 922.66 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  16134. 922.66 s [extra] +++ OK, passed 100 tests.
  16135. 922.66 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  16136. 922.66 s [extra] +++ OK, passed 100 tests.
  16137. 922.66 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  16138. 922.66 s [extra] +++ OK, passed 100 tests.
  16139. 922.66 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  16140. 922.66 s [extra] +++ OK, passed 100 tests.
  16141. 922.66 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  16142. 922.66 s [extra] +++ OK, passed 100 tests.
  16143. 922.66 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  16144. 922.66 s [extra] +++ OK, passed 100 tests.
  16145. 922.66 s [extra] trim " hello " == "hello"
  16146. 922.66 s [extra] +++ OK, passed 100 tests.
  16147. 922.66 s [extra] trimStart " hello " == "hello "
  16148. 922.66 s [extra] +++ OK, passed 100 tests.
  16149. 922.66 s [extra] trimEnd " hello " == " hello"
  16150. 922.66 s [extra] +++ OK, passed 100 tests.
  16151. 922.66 s [extra] \s -> trim s == trimEnd (trimStart s)
  16152. 922.67 s [extra] +++ OK, passed 100 tests.
  16153. 922.67 s [extra] lower "This is A TEST" == "this is a test"
  16154. 922.67 s [extra] +++ OK, passed 100 tests.
  16155. 922.67 s [extra] lower "" == ""
  16156. 922.67 s [extra] +++ OK, passed 100 tests.
  16157. 922.67 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  16158. 922.67 s [extra] +++ OK, passed 100 tests.
  16159. 922.67 s [extra] upper "" == ""
  16160. 922.67 s [extra] +++ OK, passed 100 tests.
  16161. 922.67 s [extra] word1 "" == ("", "")
  16162. 922.67 s [extra] +++ OK, passed 100 tests.
  16163. 922.67 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  16164. 922.67 s [extra] +++ OK, passed 100 tests.
  16165. 922.67 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  16166. 922.67 s [extra] +++ OK, passed 100 tests.
  16167. 922.67 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  16168. 922.67 s [extra] +++ OK, passed 100 tests.
  16169. 922.67 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  16170. 922.67 s [extra] +++ OK, passed 100 tests.
  16171. 922.67 s [extra] line1 "" == ("", "")
  16172. 922.67 s [extra] +++ OK, passed 100 tests.
  16173. 922.67 s [extra] line1 "test" == ("test","")
  16174. 922.67 s [extra] +++ OK, passed 100 tests.
  16175. 922.67 s [extra] line1 "test\n" == ("test","")
  16176. 922.67 s [extra] +++ OK, passed 100 tests.
  16177. 922.67 s [extra] line1 "test\nrest" == ("test","rest")
  16178. 922.67 s [extra] +++ OK, passed 100 tests.
  16179. 922.67 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  16180. 922.67 s [extra] +++ OK, passed 100 tests.
  16181. 922.67 s [extra] escapeHTML "this is a test" == "this is a test"
  16182. 922.67 s [extra] +++ OK, passed 100 tests.
  16183. 922.67 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  16184. 922.67 s [extra] +++ OK, passed 100 tests.
  16185. 922.67 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  16186. 922.68 s [extra] +++ OK, passed 100 tests.
  16187. 922.68 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  16188. 922.68 s [extra] +++ OK, passed 100 tests.
  16189. 922.68 s [extra] escapeJSON "this is a test" == "this is a test"
  16190. 922.68 s [extra] +++ OK, passed 100 tests.
  16191. 922.68 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  16192. 922.68 s [extra] +++ OK, passed 100 tests.
  16193. 922.68 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  16194. 922.68 s [extra] +++ OK, passed 100 tests.
  16195. 922.68 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  16196. 922.68 s [extra] +++ OK, passed 100 tests.
  16197. 922.68 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  16198. 922.68 s [extra] +++ OK, passed 100 tests.
  16199. 922.68 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  16200. 922.68 s [extra] +++ OK, passed 100 tests.
  16201. 922.68 s [extra] maximumOn id [] == undefined
  16202. 922.68 s [extra] +++ OK, passed 100 tests.
  16203. 922.68 s [extra] maximumOn length ["test","extra","a"] == "extra"
  16204. 922.68 s [extra] +++ OK, passed 100 tests.
  16205. 922.68 s [extra] minimumOn id [] == undefined
  16206. 922.68 s [extra] +++ OK, passed 100 tests.
  16207. 922.68 s [extra] minimumOn length ["test","extra","a"] == "a"
  16208. 922.68 s [extra] +++ OK, passed 100 tests.
  16209. 922.68 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  16210. 922.68 s [extra] +++ OK, passed 100 tests.
  16211. 922.68 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  16212. 922.69 s [extra] +++ OK, passed 100 tests.
  16213. 922.69 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  16214. 922.69 s [extra] +++ OK, passed 100 tests.
  16215. 922.69 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  16216. 922.69 s [extra] +++ OK, passed 100 tests.
  16217. 922.69 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  16218. 922.69 s [extra] +++ OK, passed 100 tests.
  16219. 922.69 s [extra] sum' [1, 2, 3] == 6
  16220. 922.69 s [extra] +++ OK, passed 100 tests.
  16221. 922.69 s [extra] sumOn' read ["1", "2", "3"] == 6
  16222. 922.69 s [extra] +++ OK, passed 100 tests.
  16223. 922.69 s [extra] product' [1, 2, 4] == 8
  16224. 922.69 s [extra] +++ OK, passed 100 tests.
  16225. 922.69 s [extra] productOn' read ["1", "2", "4"] == 8
  16226. 922.69 s [extra] +++ OK, passed 100 tests.
  16227. 922.69 s [extra] merge "ace" "bd" == "abcde"
  16228. 922.69 s [extra] +++ OK, passed 100 tests.
  16229. 922.70 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  16230. 922.70 s [extra] +++ OK, passed 100 tests.
  16231. 922.70 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  16232. 922.70 s [extra] +++ OK, passed 100 tests.
  16233. 922.70 s [extra] replace "el" "e" "Hello" == "Helo"
  16234. 922.70 s [extra] +++ OK, passed 100 tests.
  16235. 922.70 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  16236. 922.70 s [extra] +++ OK, passed 100 tests.
  16237. 922.70 s [extra] replace "" "x" "" == "x"
  16238. 922.70 s [extra] +++ OK, passed 100 tests.
  16239. 922.70 s [extra] \xs ys -> replace xs xs ys == ys
  16240. 922.70 s [extra] +++ OK, passed 100 tests.
  16241. 922.70 s [extra] breakEnd isLower "youRE" == ("you","RE")
  16242. 922.70 s [extra] +++ OK, passed 100 tests.
  16243. 922.70 s [extra] breakEnd isLower "youre" == ("youre","")
  16244. 922.70 s [extra] +++ OK, passed 100 tests.
  16245. 922.70 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  16246. 922.70 s [extra] +++ OK, passed 100 tests.
  16247. 922.70 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  16248. 922.70 s [extra] +++ OK, passed 100 tests.
  16249. 922.70 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  16250. 922.70 s [extra] +++ OK, passed 100 tests.
  16251. 922.70 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  16252. 922.71 s [extra] +++ OK, passed 100 tests.
  16253. 922.71 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  16254. 922.71 s [extra] +++ OK, passed 100 tests.
  16255. 922.71 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  16256. 922.71 s [extra] +++ OK, passed 100 tests.
  16257. 922.71 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  16258. 922.71 s [extra] +++ OK, passed 100 tests.
  16259. 922.71 s [extra] \s -> wordsBy isSpace s == words s
  16260. 922.71 s [extra] +++ OK, passed 100 tests.
  16261. 922.71 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  16262. 922.71 s [extra] +++ OK, passed 100 tests.
  16263. 922.71 s [extra] \s -> linesBy (== '\n') s == lines s
  16264. 922.71 s [extra] +++ OK, passed 100 tests.
  16265. 922.71 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  16266. 922.71 s [extra] +++ OK, passed 100 tests.
  16267. 922.71 s [extra] firstJust id [Nothing,Just 3] == Just 3
  16268. 922.71 s [extra] +++ OK, passed 100 tests.
  16269. 922.71 s [extra] firstJust id [Nothing,Nothing] == Nothing
  16270. 922.71 s [extra] +++ OK, passed 100 tests.
  16271. 922.71 s [extra] drop1 "" == ""
  16272. 922.71 s [extra] +++ OK, passed 100 tests.
  16273. 922.71 s [extra] drop1 "test" == "est"
  16274. 922.71 s [extra] +++ OK, passed 100 tests.
  16275. 922.71 s [extra] \xs -> drop 1 xs == drop1 xs
  16276. 922.71 s [extra] +++ OK, passed 100 tests.
  16277. 922.71 s [extra] dropEnd1 "" == ""
  16278. 922.71 s [extra] +++ OK, passed 100 tests.
  16279. 922.71 s [extra] dropEnd1 "test" == "tes"
  16280. 922.71 s [extra] +++ OK, passed 100 tests.
  16281. 922.71 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  16282. 922.72 s [extra] +++ OK, passed 100 tests.
  16283. 922.72 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  16284. 922.72 s [extra] +++ OK, passed 100 tests.
  16285. 922.72 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  16286. 922.75 s [extra] +++ OK, passed 100 tests.
  16287. 922.75 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  16288. 922.75 s [extra] +++ OK, passed 100 tests.
  16289. 922.75 s [extra] breakOn "/" "foobar" == ("foobar", "")
  16290. 922.75 s [extra] +++ OK, passed 100 tests.
  16291. 922.75 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  16292. 922.75 s [extra] +++ OK, passed 100 tests.
  16293. 922.75 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  16294. 922.75 s [extra] +++ OK, passed 100 tests.
  16295. 922.75 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  16296. 922.75 s [extra] +++ OK, passed 100 tests.
  16297. 922.75 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  16298. 922.75 s [extra] +++ OK, passed 100 tests.
  16299. 922.75 s [extra] splitOn "x" "x" == ["",""]
  16300. 922.75 s [extra] +++ OK, passed 100 tests.
  16301. 922.75 s [extra] splitOn "x" "" == [""]
  16302. 922.75 s [extra] +++ OK, passed 100 tests.
  16303. 922.75 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  16304. 922.75 s [extra] +++ OK, passed 100 tests; 20 discarded.
  16305. 922.75 s [extra] \c x -> splitOn [c] x == split (==c) x
  16306. 922.76 s [extra] +++ OK, passed 100 tests.
  16307. 922.76 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  16308. 922.76 s [extra] +++ OK, passed 100 tests.
  16309. 922.76 s [extra] split (== 'a') "" == [""]
  16310. 922.76 s [extra] +++ OK, passed 100 tests.
  16311. 922.76 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  16312. 922.76 s [extra] +++ OK, passed 100 tests.
  16313. 922.76 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  16314. 922.76 s [extra] +++ OK, passed 100 tests.
  16315. 922.76 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  16316. 922.76 s [extra] +++ OK, passed 100 tests.
  16317. 922.76 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  16318. 922.76 s [extra] +++ OK, passed 100 tests.
  16319. 922.76 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  16320. 922.76 s [extra] +++ OK, passed 100 tests.
  16321. 922.76 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  16322. 922.76 s [extra] +++ OK, passed 100 tests.
  16323. 922.76 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  16324. 922.76 s [extra] +++ OK, passed 100 tests.
  16325. 922.76 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  16326. 922.76 s [extra] +++ OK, passed 100 tests.
  16327. 922.76 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  16328. 922.76 s [extra] +++ OK, passed 100 tests.
  16329. 922.76 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  16330. 922.76 s [extra] +++ OK, passed 100 tests.
  16331. 922.76 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  16332. 922.76 s [extra] +++ OK, passed 100 tests.
  16333. 922.76 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  16334. 922.76 s [extra] +++ OK, passed 100 tests.
  16335. 922.76 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  16336. 922.76 s [extra] +++ OK, passed 100 tests.
  16337. 922.76 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  16338. 922.76 s [extra] +++ OK, passed 100 tests.
  16339. 922.76 s [extra] stripSuffix "" "baz" == Just "baz"
  16340. 922.76 s [extra] +++ OK, passed 100 tests.
  16341. 922.76 s [extra] stripSuffix "foo" "quux" == Nothing
  16342. 922.76 s [extra] +++ OK, passed 100 tests.
  16343. 922.76 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  16344. 922.76 s [extra] +++ OK, passed 100 tests.
  16345. 922.76 s [extra] stripInfix "/" "foobar" == Nothing
  16346. 922.76 s [extra] +++ OK, passed 100 tests.
  16347. 922.76 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  16348. 922.76 s [extra] +++ OK, passed 100 tests.
  16349. 922.76 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  16350. 922.76 s [extra] +++ OK, passed 100 tests.
  16351. 922.76 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  16352. 922.76 s [extra] +++ OK, passed 100 tests.
  16353. 922.76 s [extra] chunksOf 8 "" == []
  16354. 922.76 s [extra] +++ OK, passed 100 tests.
  16355. 922.76 s [extra] chunksOf 0 "test" == undefined
  16356. 922.76 s [extra] +++ OK, passed 100 tests.
  16357. 922.76 s [extra] nubSort "this is a test" == " aehist"
  16358. 922.76 s [extra] +++ OK, passed 100 tests.
  16359. 922.76 s [extra] \xs -> nubSort xs == nub (sort xs)
  16360. 922.77 s [extra] +++ OK, passed 100 tests.
  16361. 922.77 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  16362. 922.77 s [extra] +++ OK, passed 100 tests.
  16363. 922.77 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  16364. 922.77 s [extra] +++ OK, passed 100 tests.
  16365. 922.77 s [extra] nubOrd "this is a test" == "this ae"
  16366. 922.77 s [extra] +++ OK, passed 100 tests.
  16367. 922.77 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  16368. 922.77 s [extra] +++ OK, passed 100 tests.
  16369. 922.77 s [extra] \xs -> nubOrd xs == nub xs
  16370. 922.77 s [extra] +++ OK, passed 100 tests.
  16371. 922.77 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  16372. 922.77 s [extra] +++ OK, passed 100 tests.
  16373. 922.77 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  16374. 922.77 s [extra] +++ OK, passed 100 tests.
  16375. 922.77 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  16376. 922.77 s [extra] +++ OK, passed 100 tests.
  16377. 922.77 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  16378. 922.77 s [extra] +++ OK, passed 100 tests.
  16379. 922.77 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  16380. 922.77 s [extra] +++ OK, passed 100 tests.
  16381. 922.77 s [extra] comparingLength [1,2,3] [False] == GT
  16382. 922.77 s [extra] +++ OK, passed 100 tests.
  16383. 922.77 s [extra] comparingLength [1,2] "ab" == EQ
  16384. 922.77 s [extra] +++ OK, passed 100 tests.
  16385. 922.77 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  16386. 922.77 s [extra] +++ OK, passed 100 tests.
  16387. 922.77 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  16388. 922.77 s [extra] +++ OK, passed 100 tests.
  16389. 922.77 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  16390. 922.77 s [extra] +++ OK, passed 100 tests.
  16391. 922.77 s [extra] mwhen True "test" == "test"
  16392. 922.77 s [extra] +++ OK, passed 100 tests.
  16393. 922.77 s [extra] mwhen False "test" == ""
  16394. 922.77 s [extra] +++ OK, passed 100 tests.
  16395. 922.77 s [extra] first succ (1,"test") == (2,"test")
  16396. 922.77 s [extra] +++ OK, passed 100 tests.
  16397. 922.77 s [extra] second reverse (1,"test") == (1,"tset")
  16398. 922.77 s [extra] +++ OK, passed 100 tests.
  16399. 922.77 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  16400. 922.77 s [extra] +++ OK, passed 100 tests.
  16401. 922.77 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  16402. 922.77 s [extra] +++ OK, passed 100 tests.
  16403. 922.77 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  16404. 922.77 s [extra] +++ OK, passed 100 tests.
  16405. 922.77 s [extra] (succ &&& pred) 1 == (2,0)
  16406. 922.77 s [extra] +++ OK, passed 100 tests.
  16407. 922.77 s [extra] dupe 12 == (12, 12)
  16408. 922.77 s [extra] +++ OK, passed 100 tests.
  16409. 922.77 s [extra] both succ (1,2) == (2,3)
  16410. 922.77 s [extra] +++ OK, passed 100 tests.
  16411. 922.78 s [extra] first3 succ (1,1,1) == (2,1,1)
  16412. 922.78 s [extra] +++ OK, passed 100 tests.
  16413. 922.78 s [extra] second3 succ (1,1,1) == (1,2,1)
  16414. 922.78 s [extra] +++ OK, passed 100 tests.
  16415. 922.78 s [extra] third3 succ (1,1,1) == (1,1,2)
  16416. 922.78 s [extra] +++ OK, passed 100 tests.
  16417. 922.78 s [extra] \x -> readVersion (showVersion x) == x
  16418. 922.78 s [extra] +++ OK, passed 100 tests.
  16419. 922.78 s [extra] readVersion "hello" == undefined
  16420. 922.78 s [extra] +++ OK, passed 100 tests.
  16421. 922.78 s [extra] showDP 4 pi == "3.1416"
  16422. 922.78 s [extra] +++ OK, passed 100 tests.
  16423. 922.78 s [extra] showDP 0 pi == "3"
  16424. 922.78 s [extra] +++ OK, passed 100 tests.
  16425. 922.78 s [extra] showDP 2 3 == "3.00"
  16426. 922.78 s [extra] +++ OK, passed 100 tests.
  16427. 922.78 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  16428. 922.78 s [extra] +++ OK, passed 100 tests.
  16429. 922.78 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  16430. 922.78 s [extra] +++ OK, passed 100 tests.
  16431. 922.78 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  16432. 922.78 s [extra] +++ OK, passed 100 tests.
  16433. 922.78 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  16434. 922.78 s [extra] +++ OK, passed 100 tests.
  16435. 922.78 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  16436. 922.79 s [extra] +++ OK, passed 100 tests.
  16437. 922.79 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16438. 922.79 s [extra] +++ OK, passed 100 tests.
  16439. 922.79 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16440. 922.79 s [extra] +++ OK, passed 100 tests.
  16441. 922.79 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  16442. 922.79 s [extra] +++ OK, passed 100 tests.
  16443. 922.79 s [extra] isWindows == (os == "mingw32")
  16444. 922.79 s [extra] +++ OK, passed 100 tests.
  16445. 922.79 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  16446. 922.82 s [extra] +++ OK, passed 100 tests.
  16447. 922.82 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  16448. 922.86 s [extra] +++ OK, passed 100 tests.
  16449. 922.86 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  16450. 922.88 s [extra] +++ OK, passed 100 tests.
  16451. 922.88 s [extra] captureOutput (print 1) == pure ("1\n",())
  16452. 922.88 s [extra] +++ OK, passed 100 tests.
  16453. 922.88 s [extra] withTempFile doesFileExist == pure True
  16454. 922.88 s [extra] +++ OK, passed 100 tests.
  16455. 922.88 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  16456. 922.88 s [extra] +++ OK, passed 100 tests.
  16457. 922.88 s [extra] withTempFile readFile' == pure ""
  16458. 922.88 s [extra] +++ OK, passed 100 tests.
  16459. 922.88 s [extra] withTempDir doesDirectoryExist == pure True
  16460. 922.89 s [extra] +++ OK, passed 100 tests.
  16461. 922.89 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  16462. 922.89 s [extra] +++ OK, passed 100 tests.
  16463. 922.89 s [extra] withTempDir listFiles == pure []
  16464. 922.89 s [extra] +++ OK, passed 100 tests.
  16465. 922.89 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  16466. 922.89 s [extra] +++ OK, passed 100 tests.
  16467. 922.89 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  16468. 922.89 s [extra] +++ OK, passed 100 tests.
  16469. 922.89 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  16470. 922.89 s [extra] +++ OK, passed 100 tests.
  16471. 922.89 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  16472. 922.89 s [extra] +++ OK, passed 100 tests.
  16473. 922.89 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  16474. 922.89 s [extra] +++ OK, passed 100 tests.
  16475. 922.89 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  16476. 922.89 s [extra] +++ OK, passed 100 tests.
  16477. 922.89 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  16478. 923.89 s [extra] +++ OK, passed 100 tests.
  16479. 923.89 s [extra] timeout (-3) (print 1) == pure Nothing
  16480. 923.89 s [extra] +++ OK, passed 100 tests.
  16481. 923.89 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  16482. 923.89 s [extra] +++ OK, passed 100 tests.
  16483. 923.90 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  16484. 924.00 s [extra] 0.102778269
  16485. 924.00 s [extra] +++ OK, passed 100 tests.
  16486. 924.00 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  16487. 924.10 s [extra] +++ OK, passed 100 tests.
  16488. 924.10 s [extra] showDuration 3.435 == "3.44s"
  16489. 924.10 s [extra] +++ OK, passed 100 tests.
  16490. 924.10 s [extra] showDuration 623.8 == "10m24s"
  16491. 924.10 s [extra] +++ OK, passed 100 tests.
  16492. 924.11 s [extra] showDuration 62003.8 == "17h13m"
  16493. 924.11 s [extra] +++ OK, passed 100 tests.
  16494. 924.11 s [extra] showDuration 1e8 == "27777h47m"
  16495. 924.11 s [extra] +++ OK, passed 100 tests.
  16496. 924.11 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  16497. 924.11 s [extra] +++ OK, passed 100 tests.
  16498. 924.11 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  16499. 925.11 s [extra] +++ OK, passed 100 tests.
  16500. 925.11 s [extra] Extra export
  16501. 925.11 s [extra] +++ OK, passed 100 tests.
  16502. 925.11 s [extra] withTempFile
  16503. 925.13 s [extra] ....done
  16504. 925.20 s [extra] withTempDir
  16505. 925.20 s [extra] ....done
  16506. 925.20 s [extra] retry
  16507. 925.20 s [extra] +++ OK, passed 100 tests.
  16508. 925.20 s [extra] barrier
  16509. 925.20 s [extra] Success (325 tests)
  16510. 925.22 s [extra] Test suite extra-test: PASS
  16511. 925.22 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  16512. 925.22 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  16513. 925.24 s [extra] Phase: haddockPhase
  16514. 925.67 s [extra] Preprocessing library for extra-1.8.1...
  16515. 925.68 s [extra] Running Haddock on library for extra-1.8.1...
  16516. 926.70 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  16517. 926.79 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  16518. 926.81 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  16519. 926.90 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  16520. 926.91 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  16521. 927.11 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  16522. 927.12 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  16523. 927.87 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  16524. 927.88 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  16525. 927.91 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  16526. 927.93 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  16527. 928.06 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  16528. 928.32 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  16529. 928.37 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  16530. 928.47 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  16531. 928.56 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  16532. 928.58 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  16533. 928.97 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  16534. 928.98 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  16535. 929.03 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  16536. 929.12 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  16537. 929.34 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  16538. 929.35 s [extra] Haddock coverage:
  16539. 929.35 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  16540. 929.36 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  16541. 929.37 s [extra] Warning: 'Arrow' is out of scope.
  16542. 929.37 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16543. 929.37 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  16544. 929.38 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  16545. 929.38 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  16546. 929.39 s [extra] Warning: '(:)' is out of scope.
  16547. 929.39 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16548. 929.39 s [extra] Warning: 'unzip' is ambiguous. It is defined
  16549. 929.39 s [extra] * in ‘GHC.Internal.Data.Functor’
  16550. 929.39 s [extra] * in ‘GHC.Internal.List’
  16551. 929.39 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16552. 929.39 s [extra] by specifying the type/value namespace explicitly.
  16553. 929.39 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  16554. 929.41 s [extra] Warning: 'firstJustM' is out of scope.
  16555. 929.41 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16556. 929.42 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  16557. 929.42 s [extra] Warning: 'Version' is ambiguous. It is defined
  16558. 929.42 s [extra] * in ‘GHC.Internal.Data.Version’
  16559. 929.42 s [extra] * in ‘GHC.Internal.Data.Version’
  16560. 929.42 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16561. 929.42 s [extra] by specifying the type/value namespace explicitly.
  16562. 929.42 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  16563. 929.42 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  16564. 929.43 s [extra] Warning: 'length' is ambiguous. It is defined
  16565. 929.43 s [extra] * in ‘Data.List.NonEmpty’
  16566. 929.43 s [extra] * in ‘GHC.Internal.Data.Foldable’
  16567. 929.43 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16568. 929.43 s [extra] by specifying the type/value namespace explicitly.
  16569. 929.43 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Foldable’
  16570. 929.43 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  16571. 929.43 s [extra] Warning: 'fromJust' is out of scope.
  16572. 929.43 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16573. 929.44 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  16574. 929.44 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  16575. 929.44 s [extra] * in ‘GHC.Internal.Exception’
  16576. 929.44 s [extra] * in ‘GHC.Internal.Exception’
  16577. 929.44 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16578. 929.44 s [extra] by specifying the type/value namespace explicitly.
  16579. 929.44 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  16580. 929.44 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  16581. 929.44 s [extra] * in ‘GHC.Internal.IO.Exception’
  16582. 929.44 s [extra] * in ‘GHC.Internal.IO.Exception’
  16583. 929.44 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16584. 929.44 s [extra] by specifying the type/value namespace explicitly.
  16585. 929.44 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  16586. 929.44 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  16587. 929.44 s [extra] * in ‘GHC.Internal.Exception.Type’
  16588. 929.44 s [extra] * in ‘GHC.Internal.Exception.Type’
  16589. 929.44 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16590. 929.44 s [extra] by specifying the type/value namespace explicitly.
  16591. 929.44 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  16592. 929.45 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  16593. 929.45 s [extra] Warning: 'partition' is out of scope.
  16594. 929.45 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16595. 929.45 s [extra] Warning: 'mconcatMap' is out of scope.
  16596. 929.45 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16597. 929.46 s [extra] Warning: 'find' is out of scope.
  16598. 929.46 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16599. 929.46 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  16600. 929.46 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  16601. 929.46 s [extra] Missing documentation for:
  16602. 929.46 s [extra] Module header
  16603. 929.46 s [extra] Warning: 'Lock' is ambiguous. It is defined
  16604. 929.46 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  16605. 929.46 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  16606. 929.46 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16607. 929.46 s [extra] by specifying the type/value namespace explicitly.
  16608. 929.46 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  16609. 929.47 s [extra] Warning: 'Var' is ambiguous. It is defined
  16610. 929.47 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  16611. 929.47 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  16612. 929.47 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16613. 929.47 s [extra] by specifying the type/value namespace explicitly.
  16614. 929.47 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  16615. 929.47 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  16616. 929.47 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  16617. 929.47 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  16618. 929.47 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16619. 929.47 s [extra] by specifying the type/value namespace explicitly.
  16620. 929.47 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  16621. 929.48 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  16622. 929.49 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  16623. 929.49 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  16624. 929.51 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  16625. 929.51 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  16626. 929.51 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  16627. 929.52 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  16628. 929.54 s [extra] 100% (270 /270) in 'Extra'
  16629. 929.55 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  16630. 944.46 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  16631. 944.61 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  16632. 944.62 s [extra] Phase: installPhase
  16633. 944.96 s [extra] Installing library in /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  16634. 947.19 s [extra] Phase: fixupPhase
  16635. 947.22 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1
  16636. 947.22 s [extra] shrinking /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSextra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1-ghc9.10.3.so
  16637. 947.24 s [extra] checking for references to /build/ in /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1...
  16638. 947.31 s [extra] patching script interpreter paths in /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1
  16639. 947.33 s [extra] stripping (with command strip and flags -S -p) in /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/lib
  16640. 947.67 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc
  16641. 947.71 s [extra] checking for references to /build/ in /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc...
  16642. 947.77 s [extra] patching script interpreter paths in /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc
  16643. 948.13 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1 /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc
  16644. 949.19 s [extra:post-build] Nothing to push - all store paths are already on Cachix.
  16645. 949.23 s [extra:post-build] Uploading to the NixCI cache: /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1 /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc
  16646. 949.61 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16647. 949.76 s [extra:post-build] copying 1 paths...
  16648. 949.77 s [extra:post-build] copying path '/nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1' to 'https://cache.nix-ci.com'...
  16649. 952.66 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16650. 952.91 s [extra:post-build] copying 0 paths...
  16651. 952.94 s Progress: 9 of 15 built, 159 of 159 downloaded from cache
  16652. 953.08 s Building /nix/store/wip2nh33hcl5kpqgrwz4lwk1ki34w3y6-algebraic-graphs-0.7.drv
  16653. 953.22 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  16654. 953.24 s [algebraic-graphs] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  16655. 953.67 s [algebraic-graphs] Phase: unpackPhase
  16656. 953.68 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  16657. 953.71 s [algebraic-graphs] source root is algebraic-graphs-0.7
  16658. 953.73 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  16659. 953.74 s [algebraic-graphs] Phase: patchPhase
  16660. 953.75 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  16661. 953.78 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  16662. 953.79 s [algebraic-graphs] patching file algebraic-graphs.cabal
  16663. 953.80 s [algebraic-graphs] Phase: compileBuildDriverPhase
  16664. 953.81 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.H5odWYFWuR/setup-package.conf.d -threaded
  16665. 954.03 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.H5odWYFWuR/Main.o )
  16666. 954.22 s [algebraic-graphs] [2 of 2] Linking Setup
  16667. 957.61 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  16668. 957.64 s [algebraic-graphs] Phase: configurePhase
  16669. 957.65 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.H5odWYFWuR/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  16670. 957.69 s [algebraic-graphs] Using Parsec parser
  16671. 957.69 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  16672. 959.55 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  16673. 959.55 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.2.0
  16674. 959.55 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  16675. 959.55 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  16676. 959.55 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  16677. 959.55 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  16678. 959.55 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  16679. 959.55 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  16680. 959.55 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.2.0
  16681. 959.55 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  16682. 959.55 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  16683. 959.55 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  16684. 959.55 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  16685. 959.55 s [algebraic-graphs] inspection-testing-0.6.2
  16686. 959.55 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  16687. 959.55 s [algebraic-graphs] Source component graph:
  16688. 959.55 s [algebraic-graphs] component lib
  16689. 959.55 s [algebraic-graphs] component test:main dependency lib
  16690. 959.55 s [algebraic-graphs] Configured component graph:
  16691. 959.55 s [algebraic-graphs] component algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16692. 959.55 s [algebraic-graphs] include array-0.5.8.0-68f3
  16693. 959.55 s [algebraic-graphs] include base-4.20.2.0-64da
  16694. 959.56 s [algebraic-graphs] include containers-0.7-504a
  16695. 959.56 s [algebraic-graphs] include deepseq-1.5.0.0-9a2c
  16696. 959.56 s [algebraic-graphs] include transformers-0.6.1.1-6a26
  16697. 959.56 s [algebraic-graphs] component algebraic-graphs-0.7-ARq344kEjdO7L4GacV0ChU-main
  16698. 959.56 s [algebraic-graphs] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  16699. 959.56 s [algebraic-graphs] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16700. 959.56 s [algebraic-graphs] include array-0.5.8.0-68f3
  16701. 959.56 s [algebraic-graphs] include base-4.20.2.0-64da
  16702. 959.56 s [algebraic-graphs] include containers-0.7-504a
  16703. 959.56 s [algebraic-graphs] include deepseq-1.5.0.0-9a2c
  16704. 959.56 s [algebraic-graphs] include extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  16705. 959.56 s [algebraic-graphs] include inspection-testing-0.6.2-KcDosfOAyZc48KShLAksRA
  16706. 959.56 s [algebraic-graphs] include transformers-0.6.1.1-6a26
  16707. 959.56 s [algebraic-graphs] Linked component graph:
  16708. 959.56 s [algebraic-graphs] unit algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16709. 959.56 s [algebraic-graphs] include array-0.5.8.0-68f3
  16710. 959.56 s [algebraic-graphs] include base-4.20.2.0-64da
  16711. 959.56 s [algebraic-graphs] include containers-0.7-504a
  16712. 959.56 s [algebraic-graphs] include deepseq-1.5.0.0-9a2c
  16713. 959.56 s [algebraic-graphs] include transformers-0.6.1.1-6a26
  16714. 959.56 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Data.Graph.Typed
  16715. 959.56 s [algebraic-graphs] unit algebraic-graphs-0.7-ARq344kEjdO7L4GacV0ChU-main
  16716. 959.56 s [algebraic-graphs] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  16717. 959.56 s [algebraic-graphs] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16718. 959.56 s [algebraic-graphs] include array-0.5.8.0-68f3
  16719. 959.56 s [algebraic-graphs] include base-4.20.2.0-64da
  16720. 959.56 s [algebraic-graphs] include containers-0.7-504a
  16721. 959.56 s [algebraic-graphs] include deepseq-1.5.0.0-9a2c
  16722. 959.56 s [algebraic-graphs] include extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  16723. 959.56 s [algebraic-graphs] include inspection-testing-0.6.2-KcDosfOAyZc48KShLAksRA
  16724. 959.56 s [algebraic-graphs] include transformers-0.6.1.1-6a26
  16725. 959.56 s [algebraic-graphs] Ready component graph:
  16726. 959.56 s [algebraic-graphs] definite algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16727. 959.56 s [algebraic-graphs] depends array-0.5.8.0-68f3
  16728. 959.56 s [algebraic-graphs] depends base-4.20.2.0-64da
  16729. 959.56 s [algebraic-graphs] depends containers-0.7-504a
  16730. 959.56 s [algebraic-graphs] depends deepseq-1.5.0.0-9a2c
  16731. 959.56 s [algebraic-graphs] depends transformers-0.6.1.1-6a26
  16732. 959.56 s [algebraic-graphs] definite algebraic-graphs-0.7-ARq344kEjdO7L4GacV0ChU-main
  16733. 959.56 s [algebraic-graphs] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  16734. 959.56 s [algebraic-graphs] depends algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16735. 959.56 s [algebraic-graphs] depends array-0.5.8.0-68f3
  16736. 959.56 s [algebraic-graphs] depends base-4.20.2.0-64da
  16737. 959.56 s [algebraic-graphs] depends containers-0.7-504a
  16738. 959.56 s [algebraic-graphs] depends deepseq-1.5.0.0-9a2c
  16739. 959.56 s [algebraic-graphs] depends extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  16740. 959.56 s [algebraic-graphs] depends inspection-testing-0.6.2-KcDosfOAyZc48KShLAksRA
  16741. 959.56 s [algebraic-graphs] depends transformers-0.6.1.1-6a26
  16742. 959.56 s [algebraic-graphs] Using Cabal-3.12.1.0 compiled by ghc-9.10
  16743. 959.57 s [algebraic-graphs] Using compiler: ghc-9.10.3
  16744. 959.57 s [algebraic-graphs] Using install prefix:
  16745. 959.57 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7
  16746. 959.57 s [algebraic-graphs] Executables installed in:
  16747. 959.57 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/bin
  16748. 959.57 s [algebraic-graphs] Libraries installed in:
  16749. 959.57 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16750. 959.57 s [algebraic-graphs] Dynamic Libraries installed in:
  16751. 959.57 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  16752. 959.57 s [algebraic-graphs] Private executables installed in:
  16753. 959.57 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.10.3-05f6/algebraic-graphs-0.7
  16754. 959.57 s [algebraic-graphs] Data files installed in:
  16755. 959.57 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.10.3-05f6/algebraic-graphs-0.7
  16756. 959.57 s [algebraic-graphs] Documentation installed in:
  16757. 959.57 s [algebraic-graphs] /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  16758. 959.57 s [algebraic-graphs] Configuration files installed in:
  16759. 959.57 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/etc
  16760. 959.57 s [algebraic-graphs] No alex found
  16761. 959.57 s [algebraic-graphs] Using ar found on system at:
  16762. 959.57 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  16763. 959.57 s [algebraic-graphs] No c2hs found
  16764. 959.57 s [algebraic-graphs] No cpphs found
  16765. 959.57 s [algebraic-graphs] No doctest found
  16766. 959.57 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  16767. 959.57 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  16768. 959.57 s [algebraic-graphs] Using ghc version 9.10.3 found on system at:
  16769. 959.57 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  16770. 959.57 s [algebraic-graphs] Using ghc-pkg version 9.10.3 found on system at:
  16771. 959.57 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  16772. 959.57 s [algebraic-graphs] No ghcjs found
  16773. 959.57 s [algebraic-graphs] No ghcjs-pkg found
  16774. 959.57 s [algebraic-graphs] No greencard found
  16775. 959.57 s [algebraic-graphs] Using haddock version 2.31.1 found on system at:
  16776. 959.57 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  16777. 959.57 s [algebraic-graphs] No happy found
  16778. 959.57 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  16779. 959.57 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16780. 959.57 s [algebraic-graphs] No hmake found
  16781. 959.57 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  16782. 959.60 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  16783. 959.60 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  16784. 959.60 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  16785. 959.60 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  16786. 959.60 s [algebraic-graphs] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  16787. 959.60 s [algebraic-graphs] No jhc found
  16788. 959.60 s [algebraic-graphs] Using ld found on system at:
  16789. 959.60 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  16790. 959.60 s [algebraic-graphs] No pkg-config found
  16791. 959.60 s [algebraic-graphs] Using runghc version 9.10.3 found on system at:
  16792. 959.60 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  16793. 959.61 s [algebraic-graphs] Using strip version 2.44 found on system at:
  16794. 959.61 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  16795. 959.61 s [algebraic-graphs] Using tar found on system at:
  16796. 959.61 s [algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  16797. 959.61 s [algebraic-graphs] No uhc found
  16798. 960.13 s [algebraic-graphs] Phase: buildPhase
  16799. 960.29 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  16800. 960.30 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  16801. 960.55 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 )
  16802. 963.03 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 )
  16803. 964.91 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 )
  16804. 965.99 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 )
  16805. 965.99 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  16806. 969.21 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 )
  16807. 970.00 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 )
  16808. 971.51 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 )
  16809. 973.05 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 )
  16810. 973.05 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 )
  16811. 973.05 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 )
  16812. 973.06 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16813. 973.06 s [algebraic-graphs] In the use of ‘head’
  16814. 973.06 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16815. 973.06 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"."
  16816. 973.06 s [algebraic-graphs] |
  16817. 973.06 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16818. 973.06 s [algebraic-graphs] | ^^^^
  16819. 973.06 s [algebraic-graphs]
  16820. 973.06 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16821. 973.06 s [algebraic-graphs] In the use of ‘tail’
  16822. 973.06 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16823. 973.06 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"."
  16824. 973.06 s [algebraic-graphs] |
  16825. 973.06 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16826. 973.06 s [algebraic-graphs] | ^^^^
  16827. 973.06 s [algebraic-graphs]
  16828. 973.06 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16829. 973.06 s [algebraic-graphs] In the use of ‘head’
  16830. 973.06 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16831. 973.06 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"."
  16832. 973.06 s [algebraic-graphs] |
  16833. 973.06 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16834. 973.06 s [algebraic-graphs] | ^^^^
  16835. 973.06 s [algebraic-graphs]
  16836. 973.06 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16837. 973.06 s [algebraic-graphs] In the use of ‘tail’
  16838. 973.06 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16839. 973.06 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"."
  16840. 973.06 s [algebraic-graphs] |
  16841. 973.06 s [algebraic-graphs] 397 | bnd' = tail bnd
  16842. 973.06 s [algebraic-graphs] | ^^^^
  16843. 973.06 s [algebraic-graphs]
  16844. 973.06 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 )
  16845. 973.06 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 )
  16846. 973.06 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16847. 973.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16848. 973.07 s [algebraic-graphs] will become an error in a future GHC release.
  16849. 973.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16850. 973.07 s [algebraic-graphs] |
  16851. 973.07 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16852. 973.07 s [algebraic-graphs] | ^
  16853. 973.07 s [algebraic-graphs]
  16854. 973.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16855. 973.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16856. 973.07 s [algebraic-graphs] will become an error in a future GHC release.
  16857. 973.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16858. 973.07 s [algebraic-graphs] |
  16859. 973.07 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16860. 973.07 s [algebraic-graphs] | ^
  16861. 973.07 s [algebraic-graphs]
  16862. 973.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16863. 973.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16864. 973.07 s [algebraic-graphs] will become an error in a future GHC release.
  16865. 973.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16866. 973.07 s [algebraic-graphs] |
  16867. 973.07 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16868. 973.07 s [algebraic-graphs] | ^
  16869. 973.07 s [algebraic-graphs]
  16870. 973.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16871. 973.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16872. 973.07 s [algebraic-graphs] will become an error in a future GHC release.
  16873. 973.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16874. 973.07 s [algebraic-graphs] |
  16875. 973.07 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16876. 973.07 s [algebraic-graphs] | ^
  16877. 973.07 s [algebraic-graphs]
  16878. 973.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16879. 973.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16880. 973.07 s [algebraic-graphs] will become an error in a future GHC release.
  16881. 973.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16882. 973.07 s [algebraic-graphs] |
  16883. 973.07 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16884. 973.07 s [algebraic-graphs] | ^
  16885. 973.07 s [algebraic-graphs]
  16886. 973.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16887. 973.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16888. 973.07 s [algebraic-graphs] will become an error in a future GHC release.
  16889. 973.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16890. 973.07 s [algebraic-graphs] |
  16891. 973.07 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16892. 973.07 s [algebraic-graphs] | ^
  16893. 973.07 s [algebraic-graphs]
  16894. 973.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16895. 973.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16896. 973.07 s [algebraic-graphs] will become an error in a future GHC release.
  16897. 973.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16898. 973.07 s [algebraic-graphs] |
  16899. 973.07 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16900. 973.07 s [algebraic-graphs] | ^
  16901. 973.07 s [algebraic-graphs]
  16902. 973.07 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 )
  16903. 973.63 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 )
  16904. 974.69 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 )
  16905. 974.72 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 )
  16906. 974.72 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 )
  16907. 976.18 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 )
  16908. 976.62 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 )
  16909. 977.25 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 )
  16910. 977.25 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16911. 977.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16912. 977.25 s [algebraic-graphs] will become an error in a future GHC release.
  16913. 977.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16914. 977.25 s [algebraic-graphs] |
  16915. 977.25 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16916. 977.25 s [algebraic-graphs] | ^
  16917. 977.25 s [algebraic-graphs]
  16918. 977.25 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 )
  16919. 977.25 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16920. 977.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16921. 977.25 s [algebraic-graphs] will become an error in a future GHC release.
  16922. 977.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16923. 977.25 s [algebraic-graphs] |
  16924. 977.26 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16925. 977.26 s [algebraic-graphs] | ^
  16926. 977.26 s [algebraic-graphs]
  16927. 977.26 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16928. 977.26 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16929. 977.26 s [algebraic-graphs] will become an error in a future GHC release.
  16930. 977.26 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16931. 977.26 s [algebraic-graphs] |
  16932. 977.26 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16933. 977.26 s [algebraic-graphs] | ^
  16934. 977.26 s [algebraic-graphs]
  16935. 977.26 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 )
  16936. 977.26 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 )
  16937. 977.26 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 )
  16938. 977.26 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 )
  16939. 977.26 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 )
  16940. 977.30 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 )
  16941. 977.42 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 )
  16942. 978.13 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  16943. 980.77 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  16944. 982.65 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 )
  16945. 983.92 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  16946. 983.92 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  16947. 987.00 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 )
  16948. 988.25 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 )
  16949. 989.48 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 )
  16950. 991.43 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  16951. 991.43 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 )
  16952. 991.43 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 )
  16953. 991.43 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16954. 991.43 s [algebraic-graphs] In the use of ‘head’
  16955. 991.43 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16956. 991.43 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"."
  16957. 991.43 s [algebraic-graphs] |
  16958. 991.43 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16959. 991.43 s [algebraic-graphs] | ^^^^
  16960. 991.43 s [algebraic-graphs]
  16961. 991.43 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16962. 991.43 s [algebraic-graphs] In the use of ‘tail’
  16963. 991.43 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16964. 991.44 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"."
  16965. 991.44 s [algebraic-graphs] |
  16966. 991.44 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16967. 991.44 s [algebraic-graphs] | ^^^^
  16968. 991.44 s [algebraic-graphs]
  16969. 991.44 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16970. 991.44 s [algebraic-graphs] In the use of ‘head’
  16971. 991.44 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16972. 991.44 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"."
  16973. 991.44 s [algebraic-graphs] |
  16974. 991.44 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16975. 991.44 s [algebraic-graphs] | ^^^^
  16976. 991.44 s [algebraic-graphs]
  16977. 991.44 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16978. 991.44 s [algebraic-graphs] In the use of ‘tail’
  16979. 991.44 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16980. 991.44 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"."
  16981. 991.44 s [algebraic-graphs] |
  16982. 991.44 s [algebraic-graphs] 397 | bnd' = tail bnd
  16983. 991.44 s [algebraic-graphs] | ^^^^
  16984. 991.44 s [algebraic-graphs]
  16985. 991.44 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 )
  16986. 991.44 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  16987. 991.44 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16988. 991.44 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16989. 991.44 s [algebraic-graphs] will become an error in a future GHC release.
  16990. 991.44 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16991. 991.44 s [algebraic-graphs] |
  16992. 991.44 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16993. 991.44 s [algebraic-graphs] | ^
  16994. 991.44 s [algebraic-graphs]
  16995. 991.44 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16996. 991.44 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16997. 991.44 s [algebraic-graphs] will become an error in a future GHC release.
  16998. 991.44 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16999. 991.44 s [algebraic-graphs] |
  17000. 991.44 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  17001. 991.44 s [algebraic-graphs] | ^
  17002. 991.44 s [algebraic-graphs]
  17003. 991.44 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17004. 991.44 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17005. 991.44 s [algebraic-graphs] will become an error in a future GHC release.
  17006. 991.44 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17007. 991.44 s [algebraic-graphs] |
  17008. 991.44 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  17009. 991.44 s [algebraic-graphs] | ^
  17010. 991.44 s [algebraic-graphs]
  17011. 991.44 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17012. 991.44 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17013. 991.45 s [algebraic-graphs] will become an error in a future GHC release.
  17014. 991.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17015. 991.45 s [algebraic-graphs] |
  17016. 991.45 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  17017. 991.45 s [algebraic-graphs] | ^
  17018. 991.45 s [algebraic-graphs]
  17019. 991.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17020. 991.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17021. 991.45 s [algebraic-graphs] will become an error in a future GHC release.
  17022. 991.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17023. 991.45 s [algebraic-graphs] |
  17024. 991.45 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  17025. 991.45 s [algebraic-graphs] | ^
  17026. 991.45 s [algebraic-graphs]
  17027. 991.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17028. 991.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17029. 991.45 s [algebraic-graphs] will become an error in a future GHC release.
  17030. 991.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17031. 991.45 s [algebraic-graphs] |
  17032. 991.45 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  17033. 991.45 s [algebraic-graphs] | ^
  17034. 991.45 s [algebraic-graphs]
  17035. 991.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17036. 991.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17037. 991.45 s [algebraic-graphs] will become an error in a future GHC release.
  17038. 991.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17039. 991.45 s [algebraic-graphs] |
  17040. 991.45 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  17041. 991.45 s [algebraic-graphs] | ^
  17042. 991.45 s [algebraic-graphs]
  17043. 991.45 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  17044. 992.16 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 )
  17045. 993.47 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  17046. 993.47 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 )
  17047. 993.47 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  17048. 994.65 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 )
  17049. 995.24 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 )
  17050. 995.61 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  17051. 995.61 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17052. 995.61 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17053. 995.61 s [algebraic-graphs] will become an error in a future GHC release.
  17054. 995.61 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17055. 995.61 s [algebraic-graphs] |
  17056. 995.61 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  17057. 995.61 s [algebraic-graphs] | ^
  17058. 995.61 s [algebraic-graphs]
  17059. 995.61 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 )
  17060. 995.61 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17061. 995.61 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17062. 995.61 s [algebraic-graphs] will become an error in a future GHC release.
  17063. 995.61 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17064. 995.61 s [algebraic-graphs] |
  17065. 995.61 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  17066. 995.61 s [algebraic-graphs] | ^
  17067. 995.61 s [algebraic-graphs]
  17068. 995.61 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17069. 995.61 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17070. 995.61 s [algebraic-graphs] will become an error in a future GHC release.
  17071. 995.61 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17072. 995.61 s [algebraic-graphs] |
  17073. 995.61 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  17074. 995.61 s [algebraic-graphs] | ^
  17075. 995.61 s [algebraic-graphs]
  17076. 995.61 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  17077. 995.61 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  17078. 995.61 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 )
  17079. 995.76 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 )
  17080. 995.77 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 )
  17081. 995.77 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 )
  17082. 995.88 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  17083. 998.28 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  17084. 998.30 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  17085. 998.57 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 )
  17086. 1000.56 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 )
  17087. 1005.11 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 )
  17088. 1005.12 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 )
  17089. 1006.09 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 )
  17090. 1008.29 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 )
  17091. 1008.29 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 )
  17092. 1008.29 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 )
  17093. 1014.70 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 )
  17094. 1014.97 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 )
  17095. 1014.97 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 )
  17096. 1015.96 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 )
  17097. 1015.96 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 )
  17098. 1015.96 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 )
  17099. 1017.20 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 )
  17100. 1017.20 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 )
  17101. 1017.20 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 )
  17102. 1017.20 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 )
  17103. 1017.20 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 )
  17104. 1017.20 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 )
  17105. 1017.20 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  17106. 1017.20 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  17107. 1017.20 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  17108. 1017.20 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  17109. 1017.20 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  17110. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  17111. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  17112. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  17113. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  17114. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  17115. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  17116. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  17117. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  17118. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  17119. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  17120. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  17121. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  17122. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  17123. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  17124. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  17125. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  17126. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  17127. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  17128. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17129. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  17130. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17131. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  17132. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  17133. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  17134. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  17135. 1017.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  17136. 1017.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  17137. 1017.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  17138. 1017.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  17139. 1017.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  17140. 1017.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  17141. 1017.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  17142. 1017.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17143. 1017.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  17144. 1017.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  17145. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17146. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  17147. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  17148. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  17149. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  17150. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  17151. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  17152. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  17153. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  17154. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  17155. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  17156. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  17157. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  17158. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  17159. 1017.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  17160. 1017.24 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  17161. 1017.24 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  17162. 1017.24 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  17163. 1017.24 s [algebraic-graphs] inspection testing successful
  17164. 1017.24 s [algebraic-graphs] expected successes: 58
  17165. 1017.24 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 )
  17166. 1017.24 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 )
  17167. 1017.24 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 )
  17168. 1018.20 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  17169. 1019.40 s [algebraic-graphs] buildPhase completed in 59 seconds
  17170. 1019.40 s [algebraic-graphs] Phase: checkPhase
  17171. 1019.66 s [algebraic-graphs] Running 1 test suites...
  17172. 1019.66 s [algebraic-graphs] Test suite main: RUNNING...
  17173. 1031.72 s [algebraic-graphs]
  17174. 1031.72 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  17175. 1031.74 s [algebraic-graphs] OK: show empty == "empty"
  17176. 1031.74 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  17177. 1031.74 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  17178. 1031.74 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  17179. 1031.74 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  17180. 1031.74 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  17181. 1031.74 s [algebraic-graphs]
  17182. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  17183. 1031.74 s [algebraic-graphs] OK: fromAcyclic empty == empty
  17184. 1031.74 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  17185. 1031.74 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  17186. 1031.74 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  17187. 1031.74 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  17188. 1031.74 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  17189. 1031.74 s [algebraic-graphs]
  17190. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  17191. 1031.74 s [algebraic-graphs] OK: isEmpty empty == True
  17192. 1031.74 s [algebraic-graphs] OK: hasVertex x empty == False
  17193. 1031.74 s [algebraic-graphs] OK: vertexCount empty == 0
  17194. 1031.74 s [algebraic-graphs] OK: edgeCount empty == 0
  17195. 1031.74 s [algebraic-graphs]
  17196. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  17197. 1031.74 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17198. 1031.74 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17199. 1031.74 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17200. 1031.74 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17201. 1031.74 s [algebraic-graphs]
  17202. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  17203. 1031.74 s [algebraic-graphs] OK: vertices [] == empty
  17204. 1031.74 s [algebraic-graphs] OK: vertices [x] == vertex x
  17205. 1031.74 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17206. 1031.74 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17207. 1031.74 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17208. 1031.74 s [algebraic-graphs]
  17209. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  17210. 1031.74 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  17211. 1031.74 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  17212. 1031.74 s [algebraic-graphs]
  17213. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  17214. 1031.74 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  17215. 1031.74 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  17216. 1031.74 s [algebraic-graphs]
  17217. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  17218. 1031.74 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17219. 1031.74 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17220. 1031.74 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17221. 1031.74 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  17222. 1031.74 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17223. 1031.74 s [algebraic-graphs]
  17224. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  17225. 1031.74 s [algebraic-graphs] OK: isEmpty empty == True
  17226. 1031.74 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17227. 1031.74 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17228. 1031.74 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  17229. 1031.74 s [algebraic-graphs]
  17230. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  17231. 1031.74 s [algebraic-graphs] OK: hasVertex x empty == False
  17232. 1031.74 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17233. 1031.74 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17234. 1031.74 s [algebraic-graphs]
  17235. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  17236. 1031.74 s [algebraic-graphs] OK: hasEdge x y empty == False
  17237. 1031.74 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17238. 1031.74 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  17239. 1031.74 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17240. 1031.74 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17241. 1031.74 s [algebraic-graphs]
  17242. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  17243. 1031.74 s [algebraic-graphs] OK: vertexCount empty == 0
  17244. 1031.74 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17245. 1031.74 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17246. 1031.74 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17247. 1031.74 s [algebraic-graphs]
  17248. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  17249. 1031.74 s [algebraic-graphs] OK: edgeCount empty == 0
  17250. 1031.74 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17251. 1031.74 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  17252. 1031.74 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17253. 1031.74 s [algebraic-graphs]
  17254. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  17255. 1031.74 s [algebraic-graphs] OK: vertexList empty == []
  17256. 1031.74 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17257. 1031.74 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17258. 1031.74 s [algebraic-graphs]
  17259. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  17260. 1031.74 s [algebraic-graphs] OK: edgeList empty == []
  17261. 1031.74 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17262. 1031.74 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  17263. 1031.74 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17264. 1031.74 s [algebraic-graphs]
  17265. 1031.74 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  17266. 1031.75 s [algebraic-graphs] OK: adjacencyList empty == []
  17267. 1031.75 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17268. 1031.75 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  17269. 1031.75 s [algebraic-graphs]
  17270. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  17271. 1031.75 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17272. 1031.75 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17273. 1031.75 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17274. 1031.75 s [algebraic-graphs]
  17275. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  17276. 1031.75 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17277. 1031.75 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17278. 1031.75 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  17279. 1031.75 s [algebraic-graphs]
  17280. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  17281. 1031.75 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17282. 1031.75 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17283. 1031.75 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  17284. 1031.75 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  17285. 1031.75 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  17286. 1031.75 s [algebraic-graphs]
  17287. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  17288. 1031.75 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17289. 1031.75 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17290. 1031.75 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  17291. 1031.75 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  17292. 1031.75 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  17293. 1031.75 s [algebraic-graphs]
  17294. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  17295. 1031.75 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17296. 1031.75 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17297. 1031.75 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  17298. 1031.75 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17299. 1031.75 s [algebraic-graphs]
  17300. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  17301. 1031.75 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  17302. 1031.75 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17303. 1031.75 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17304. 1031.75 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  17305. 1031.75 s [algebraic-graphs]
  17306. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  17307. 1031.75 s [algebraic-graphs] OK: transpose empty == empty
  17308. 1031.75 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17309. 1031.75 s [algebraic-graphs] OK: transpose . transpose == id
  17310. 1031.75 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17311. 1031.75 s [algebraic-graphs]
  17312. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  17313. 1031.75 s [algebraic-graphs] OK: induce (const True ) x == x
  17314. 1031.75 s [algebraic-graphs] OK: induce (const False) x == empty
  17315. 1031.75 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17316. 1031.75 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17317. 1031.75 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17318. 1031.75 s [algebraic-graphs]
  17319. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  17320. 1031.75 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17321. 1031.75 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  17322. 1031.75 s [algebraic-graphs]
  17323. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  17324. 1031.75 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  17325. 1031.75 s [algebraic-graphs]
  17326. 1031.75 s [algebraic-graphs] OK: box x y ~~ box y x
  17327. 1031.75 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  17328. 1031.75 s [algebraic-graphs] OK: box x empty ~~ empty
  17329. 1031.75 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  17330. 1031.75 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  17331. 1031.75 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  17332. 1031.75 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  17333. 1031.75 s [algebraic-graphs]
  17334. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  17335. 1031.75 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17336. 1031.75 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17337. 1031.75 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  17338. 1031.75 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17339. 1031.75 s [algebraic-graphs]
  17340. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  17341. 1031.75 s [algebraic-graphs] OK: topSort empty == []
  17342. 1031.75 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  17343. 1031.75 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  17344. 1031.75 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  17345. 1031.75 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  17346. 1031.75 s [algebraic-graphs]
  17347. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  17348. 1031.75 s [algebraic-graphs] OK: scc empty == empty
  17349. 1031.75 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  17350. 1031.75 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  17351. 1031.75 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  17352. 1031.75 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  17353. 1031.75 s [algebraic-graphs]
  17354. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  17355. 1031.75 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  17356. 1031.75 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  17357. 1031.75 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  17358. 1031.75 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  17359. 1031.75 s [algebraic-graphs]
  17360. 1031.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  17361. 1031.75 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  17362. 1031.75 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  17363. 1031.75 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  17364. 1031.75 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  17365. 1031.75 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  17366. 1031.75 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  17367. 1036.68 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  17368. 1036.68 s [algebraic-graphs]
  17369. 1036.68 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  17370. 1036.68 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  17371. 1036.68 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  17372. 1036.68 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  17373. 1036.68 s [algebraic-graphs]
  17374. 1036.68 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  17375. 1036.68 s [algebraic-graphs] OK: Arbitrary
  17376. 1036.68 s [algebraic-graphs] OK: empty
  17377. 1036.69 s [algebraic-graphs] OK: vertex
  17378. 1036.69 s [algebraic-graphs] OK: vertices
  17379. 1036.69 s [algebraic-graphs] OK: union
  17380. 1036.69 s [algebraic-graphs] OK: join
  17381. 1036.69 s [algebraic-graphs] OK: transpose
  17382. 1036.69 s [algebraic-graphs] OK: box
  17383. 1036.69 s [algebraic-graphs] OK: transitiveClosure
  17384. 1036.69 s [algebraic-graphs] OK: scc
  17385. 1036.69 s [algebraic-graphs] OK: toAcyclic
  17386. 1036.69 s [algebraic-graphs] OK: toAcyclicOrd
  17387. 1036.69 s [algebraic-graphs]
  17388. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap ============
  17389. 1036.69 s [algebraic-graphs] OK: Axioms of graphs
  17390. 1036.69 s [algebraic-graphs]
  17391. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  17392. 1036.69 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  17393. 1036.69 s [algebraic-graphs]
  17394. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  17395. 1036.69 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17396. 1036.69 s [algebraic-graphs]
  17397. 1036.69 s [algebraic-graphs] OK: consistent empty == True
  17398. 1036.69 s [algebraic-graphs] OK: consistent (vertex x) == True
  17399. 1036.69 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17400. 1036.69 s [algebraic-graphs] OK: consistent (connect x y) == True
  17401. 1036.69 s [algebraic-graphs] OK: consistent (edge x y) == True
  17402. 1036.69 s [algebraic-graphs] OK: consistent (edges xs) == True
  17403. 1036.69 s [algebraic-graphs] OK: consistent (stars xs) == True
  17404. 1036.69 s [algebraic-graphs]
  17405. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  17406. 1036.69 s [algebraic-graphs] OK: show (empty ) == "empty"
  17407. 1036.69 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17408. 1036.69 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17409. 1036.69 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17410. 1036.69 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17411. 1036.69 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17412. 1036.69 s [algebraic-graphs]
  17413. 1036.69 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17414. 1036.69 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17415. 1036.69 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17416. 1036.69 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17417. 1036.69 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17418. 1036.69 s [algebraic-graphs]
  17419. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  17420. 1036.69 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17421. 1036.69 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17422. 1036.69 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17423. 1036.69 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17424. 1036.69 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17425. 1036.69 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17426. 1036.69 s [algebraic-graphs] OK: x <= x + y
  17427. 1036.69 s [algebraic-graphs] OK: x + y <= x * y
  17428. 1036.69 s [algebraic-graphs]
  17429. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  17430. 1036.69 s [algebraic-graphs] OK: isEmpty empty == True
  17431. 1036.69 s [algebraic-graphs] OK: hasVertex x empty == False
  17432. 1036.69 s [algebraic-graphs] OK: vertexCount empty == 0
  17433. 1036.69 s [algebraic-graphs] OK: edgeCount empty == 0
  17434. 1036.69 s [algebraic-graphs]
  17435. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  17436. 1036.69 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17437. 1036.69 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17438. 1036.69 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17439. 1036.69 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17440. 1036.69 s [algebraic-graphs]
  17441. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  17442. 1036.69 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17443. 1036.69 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17444. 1036.69 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17445. 1036.69 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17446. 1036.69 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17447. 1036.69 s [algebraic-graphs]
  17448. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  17449. 1036.69 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17450. 1036.69 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17451. 1036.69 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17452. 1036.69 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17453. 1036.69 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17454. 1036.69 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17455. 1036.69 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17456. 1036.69 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17457. 1036.69 s [algebraic-graphs]
  17458. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  17459. 1036.69 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17460. 1036.69 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17461. 1036.69 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17462. 1036.69 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17463. 1036.69 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17464. 1036.69 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17465. 1036.69 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17466. 1036.69 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17467. 1036.69 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17468. 1036.69 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17469. 1036.69 s [algebraic-graphs]
  17470. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  17471. 1036.69 s [algebraic-graphs] OK: vertices [] == empty
  17472. 1036.69 s [algebraic-graphs] OK: vertices [x] == vertex x
  17473. 1036.69 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17474. 1036.69 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17475. 1036.69 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17476. 1036.69 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17477. 1036.69 s [algebraic-graphs]
  17478. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  17479. 1036.69 s [algebraic-graphs] OK: edges [] == empty
  17480. 1036.69 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17481. 1036.69 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17482. 1036.69 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17483. 1036.69 s [algebraic-graphs]
  17484. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  17485. 1036.69 s [algebraic-graphs] OK: overlays [] == empty
  17486. 1036.69 s [algebraic-graphs] OK: overlays [x] == x
  17487. 1036.69 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17488. 1036.69 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17489. 1036.69 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17490. 1036.69 s [algebraic-graphs]
  17491. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  17492. 1036.69 s [algebraic-graphs] OK: connects [] == empty
  17493. 1036.69 s [algebraic-graphs] OK: connects [x] == x
  17494. 1036.69 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17495. 1036.69 s [algebraic-graphs] OK: connects == foldr connect empty
  17496. 1036.69 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17497. 1036.69 s [algebraic-graphs]
  17498. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  17499. 1036.69 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  17500. 1036.69 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  17501. 1036.69 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  17502. 1036.69 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  17503. 1036.69 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  17504. 1036.69 s [algebraic-graphs]
  17505. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  17506. 1036.69 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17507. 1036.69 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17508. 1036.69 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17509. 1036.69 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17510. 1036.69 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17511. 1036.69 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17512. 1036.69 s [algebraic-graphs]
  17513. 1036.69 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  17514. 1036.69 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17515. 1036.69 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17516. 1036.69 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17517. 1036.69 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17518. 1036.69 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17519. 1036.69 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17520. 1036.69 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17521. 1036.69 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17522. 1036.69 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17523. 1036.69 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17524. 1036.69 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17525. 1036.69 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17526. 1036.69 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17527. 1036.69 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17528. 1036.69 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17529. 1036.69 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17530. 1036.69 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17531. 1036.69 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17532. 1036.69 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17533. 1036.69 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17534. 1036.69 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17535. 1036.69 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17536. 1036.69 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17537. 1036.69 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17538. 1036.69 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17539. 1036.70 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17540. 1036.70 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17541. 1036.70 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17542. 1036.70 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17543. 1036.70 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17544. 1036.70 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17545. 1036.70 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17546. 1036.70 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17547. 1036.70 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17548. 1037.55 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17549. 1037.55 s [algebraic-graphs]
  17550. 1037.55 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  17551. 1037.59 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17552. 1037.59 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17553. 1037.59 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17554. 1037.59 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17555. 1037.59 s [algebraic-graphs]
  17556. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  17557. 1037.59 s [algebraic-graphs] OK: isEmpty empty == True
  17558. 1037.59 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17559. 1037.59 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17560. 1037.59 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17561. 1037.59 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17562. 1037.59 s [algebraic-graphs]
  17563. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  17564. 1037.59 s [algebraic-graphs] OK: hasVertex x empty == False
  17565. 1037.59 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17566. 1037.59 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17567. 1037.59 s [algebraic-graphs]
  17568. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  17569. 1037.59 s [algebraic-graphs] OK: hasEdge x y empty == False
  17570. 1037.59 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17571. 1037.59 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17572. 1037.59 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17573. 1037.59 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17574. 1037.59 s [algebraic-graphs]
  17575. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  17576. 1037.59 s [algebraic-graphs] OK: vertexCount empty == 0
  17577. 1037.59 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17578. 1037.59 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17579. 1037.59 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17580. 1037.59 s [algebraic-graphs]
  17581. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  17582. 1037.59 s [algebraic-graphs] OK: edgeCount empty == 0
  17583. 1037.59 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17584. 1037.59 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17585. 1037.59 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17586. 1037.59 s [algebraic-graphs]
  17587. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  17588. 1037.59 s [algebraic-graphs] OK: vertexList empty == []
  17589. 1037.59 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17590. 1037.59 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17591. 1037.59 s [algebraic-graphs]
  17592. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  17593. 1037.59 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17594. 1037.59 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17595. 1037.59 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17596. 1037.59 s [algebraic-graphs]
  17597. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  17598. 1037.59 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17599. 1037.59 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17600. 1037.59 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17601. 1037.59 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17602. 1037.59 s [algebraic-graphs]
  17603. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  17604. 1037.59 s [algebraic-graphs] OK: edgeList empty == []
  17605. 1037.59 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17606. 1037.59 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17607. 1037.59 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17608. 1037.59 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17609. 1037.59 s [algebraic-graphs]
  17610. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  17611. 1037.59 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17612. 1037.59 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17613. 1037.59 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17614. 1037.59 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17615. 1037.59 s [algebraic-graphs]
  17616. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  17617. 1037.59 s [algebraic-graphs] OK: adjacencyList empty == []
  17618. 1037.59 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17619. 1037.59 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17620. 1037.59 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17621. 1037.59 s [algebraic-graphs]
  17622. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  17623. 1037.59 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17624. 1037.59 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17625. 1037.59 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17626. 1037.59 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17627. 1037.59 s [algebraic-graphs]
  17628. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  17629. 1037.59 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17630. 1037.59 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17631. 1037.59 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17632. 1037.59 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17633. 1037.59 s [algebraic-graphs]
  17634. 1037.59 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  17635. 1037.60 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17636. 1037.60 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17637. 1037.60 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17638. 1037.60 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17639. 1037.60 s [algebraic-graphs]
  17640. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  17641. 1037.60 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17642. 1037.60 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17643. 1037.60 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17644. 1037.60 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17645. 1037.60 s [algebraic-graphs]
  17646. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  17647. 1037.60 s [algebraic-graphs] OK: path [] == empty
  17648. 1037.60 s [algebraic-graphs] OK: path [x] == vertex x
  17649. 1037.60 s [algebraic-graphs] OK: path [x,y] == edge x y
  17650. 1037.60 s [algebraic-graphs]
  17651. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  17652. 1037.60 s [algebraic-graphs] OK: circuit [] == empty
  17653. 1037.60 s [algebraic-graphs] OK: circuit [x] == edge x x
  17654. 1037.60 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17655. 1037.60 s [algebraic-graphs]
  17656. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  17657. 1037.60 s [algebraic-graphs] OK: clique [] == empty
  17658. 1037.60 s [algebraic-graphs] OK: clique [x] == vertex x
  17659. 1037.60 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17660. 1037.60 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17661. 1037.60 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17662. 1037.60 s [algebraic-graphs]
  17663. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  17664. 1037.60 s [algebraic-graphs] OK: biclique [] [] == empty
  17665. 1037.60 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17666. 1037.60 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17667. 1037.60 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17668. 1037.60 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17669. 1037.60 s [algebraic-graphs]
  17670. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  17671. 1037.60 s [algebraic-graphs] OK: star x [] == vertex x
  17672. 1037.60 s [algebraic-graphs] OK: star x [y] == edge x y
  17673. 1037.60 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17674. 1037.60 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17675. 1037.60 s [algebraic-graphs]
  17676. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  17677. 1037.60 s [algebraic-graphs] OK: stars [] == empty
  17678. 1037.60 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17679. 1037.60 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17680. 1037.60 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17681. 1037.60 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17682. 1037.60 s [algebraic-graphs] OK: stars . adjacencyList == id
  17683. 1037.60 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17684. 1037.60 s [algebraic-graphs]
  17685. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  17686. 1037.60 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17687. 1037.60 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17688. 1037.60 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17689. 1037.60 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  17690. 1037.60 s [algebraic-graphs]
  17691. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  17692. 1037.60 s [algebraic-graphs] OK: forest [] == empty
  17693. 1037.60 s [algebraic-graphs] OK: forest [x] == tree x
  17694. 1037.60 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17695. 1037.60 s [algebraic-graphs] OK: forest == overlays . map tree
  17696. 1037.60 s [algebraic-graphs]
  17697. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  17698. 1037.60 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17699. 1037.60 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17700. 1037.60 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17701. 1037.60 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17702. 1037.60 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17703. 1037.60 s [algebraic-graphs]
  17704. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  17705. 1037.60 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17706. 1037.60 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17707. 1037.60 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17708. 1037.60 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17709. 1037.60 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17710. 1037.60 s [algebraic-graphs]
  17711. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  17712. 1037.60 s [algebraic-graphs] OK: replaceVertex x x == id
  17713. 1037.60 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17714. 1037.60 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17715. 1037.60 s [algebraic-graphs]
  17716. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  17717. 1037.60 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17718. 1037.60 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17719. 1037.60 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17720. 1037.60 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17721. 1037.60 s [algebraic-graphs]
  17722. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  17723. 1037.60 s [algebraic-graphs] OK: transpose empty == empty
  17724. 1037.60 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17725. 1037.60 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17726. 1037.60 s [algebraic-graphs] OK: transpose . transpose == id
  17727. 1037.60 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17728. 1037.60 s [algebraic-graphs]
  17729. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  17730. 1037.60 s [algebraic-graphs] OK: gmap f empty == empty
  17731. 1037.60 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17732. 1037.60 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17733. 1037.60 s [algebraic-graphs] OK: gmap id == id
  17734. 1037.60 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17735. 1037.60 s [algebraic-graphs]
  17736. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  17737. 1037.60 s [algebraic-graphs] OK: induce (const True ) x == x
  17738. 1037.60 s [algebraic-graphs] OK: induce (const False) x == empty
  17739. 1037.60 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17740. 1037.60 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17741. 1037.60 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17742. 1037.60 s [algebraic-graphs]
  17743. 1037.60 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  17744. 1037.60 s [algebraic-graphs] OK: compose empty x == empty
  17745. 1037.60 s [algebraic-graphs] OK: compose x empty == empty
  17746. 1037.60 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17747. 1037.60 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17748. 1037.60 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17749. 1037.60 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17750. 1037.80 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17751. 1037.80 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17752. 1037.80 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17753. 1037.80 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17754. 1037.80 s [algebraic-graphs]
  17755. 1037.80 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  17756. 1037.80 s [algebraic-graphs] OK: closure empty == empty
  17757. 1037.80 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  17758. 1037.80 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  17759. 1037.80 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17760. 1037.80 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  17761. 1037.80 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  17762. 1037.80 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  17763. 1037.80 s [algebraic-graphs] OK: closure . closure == closure
  17764. 1037.80 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  17765. 1037.80 s [algebraic-graphs]
  17766. 1037.80 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  17767. 1037.80 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  17768. 1037.80 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  17769. 1037.80 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  17770. 1037.80 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17771. 1037.80 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  17772. 1037.80 s [algebraic-graphs]
  17773. 1037.80 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  17774. 1037.80 s [algebraic-graphs] OK: symmetricClosure empty == empty
  17775. 1037.80 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  17776. 1037.80 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  17777. 1037.80 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  17778. 1037.80 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  17779. 1037.80 s [algebraic-graphs]
  17780. 1037.80 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  17781. 1037.80 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17782. 1037.80 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17783. 1037.80 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  17784. 1037.80 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  17785. 1037.80 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17786. 1037.80 s [algebraic-graphs]
  17787. 1037.80 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  17788. 1037.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  17789. 1037.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  17790. 1037.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  17791. 1037.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  17792. 1037.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  17793. 1037.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  17794. 1037.80 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  17795. 1037.80 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  17796. 1037.80 s [algebraic-graphs] OK: bfsForest x [] == []
  17797. 1037.80 s [algebraic-graphs] OK: bfsForest empty vs == []
  17798. 1037.80 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17799. 1037.80 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  17800. 1037.80 s [algebraic-graphs]
  17801. 1037.80 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  17802. 1037.80 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  17803. 1037.80 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  17804. 1037.80 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  17805. 1037.80 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  17806. 1037.80 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  17807. 1037.80 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  17808. 1037.80 s [algebraic-graphs] OK: bfs empty vs == []
  17809. 1037.80 s [algebraic-graphs] OK: bfs x [] == []
  17810. 1037.80 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  17811. 1037.80 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  17812. 1037.80 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  17813. 1037.80 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  17814. 1037.80 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  17815. 1037.80 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  17816. 1037.80 s [algebraic-graphs]
  17817. 1037.80 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  17818. 1037.80 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  17819. 1037.80 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  17820. 1037.80 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  17821. 1037.80 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  17822. 1037.80 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  17823. 1037.80 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  17824. 1037.80 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  17825. 1037.80 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  17826. 1037.80 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  17827. 1037.80 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  17828. 1037.80 s [algebraic-graphs]
  17829. 1037.80 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  17830. 1037.80 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  17831. 1037.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  17832. 1037.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  17833. 1037.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  17834. 1037.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  17835. 1037.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  17836. 1037.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  17837. 1037.80 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  17838. 1037.80 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  17839. 1037.80 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  17840. 1037.80 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  17841. 1037.80 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17842. 1037.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  17843. 1037.80 s [algebraic-graphs]
  17844. 1037.80 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17845. 1037.80 s [algebraic-graphs] OK: dfs empty vs == []
  17846. 1037.80 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  17847. 1037.80 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  17848. 1037.80 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  17849. 1037.81 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  17850. 1037.81 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  17851. 1037.81 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  17852. 1037.81 s [algebraic-graphs] OK: dfs x [] == []
  17853. 1037.81 s [algebraic-graphs]
  17854. 1037.81 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  17855. 1037.81 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  17856. 1037.81 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  17857. 1037.81 s [algebraic-graphs]
  17858. 1037.81 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17859. 1037.81 s [algebraic-graphs] OK: reachable empty x == []
  17860. 1037.81 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  17861. 1037.81 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  17862. 1037.81 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  17863. 1037.81 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  17864. 1037.81 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  17865. 1037.81 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  17866. 1037.81 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  17867. 1037.81 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  17868. 1037.81 s [algebraic-graphs]
  17869. 1037.81 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  17870. 1037.81 s [algebraic-graphs]
  17871. 1037.81 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  17872. 1037.81 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  17873. 1037.81 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  17874. 1037.81 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  17875. 1037.81 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  17876. 1037.81 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  17877. 1037.81 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  17878. 1037.81 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  17879. 1037.81 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  17880. 1037.81 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  17881. 1037.81 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  17882. 1037.81 s [algebraic-graphs]
  17883. 1037.81 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  17884. 1037.81 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  17885. 1037.81 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  17886. 1037.81 s [algebraic-graphs] OK: isAcyclic . circuit == null
  17887. 1037.81 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  17888. 1037.81 s [algebraic-graphs]
  17889. 1037.81 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  17890. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  17891. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  17892. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  17893. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  17894. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  17895. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  17896. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  17897. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  17898. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  17899. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  17900. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  17901. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  17902. 1037.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  17903. 1045.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  17904. 1045.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  17905. 1045.92 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  17906. 1045.92 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  17907. 1045.92 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  17908. 1045.92 s [algebraic-graphs]
  17909. 1045.92 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  17910. 1045.92 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  17911. 1045.92 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  17912. 1045.92 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  17913. 1045.92 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  17914. 1045.92 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  17915. 1045.92 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  17916. 1045.92 s [algebraic-graphs]
  17917. 1045.92 s [algebraic-graphs] ============ AdjacencyMap ============
  17918. 1045.92 s [algebraic-graphs] OK: Axioms of graphs
  17919. 1045.92 s [algebraic-graphs]
  17920. 1045.92 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  17921. 1045.92 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17922. 1045.92 s [algebraic-graphs]
  17923. 1045.92 s [algebraic-graphs] OK: consistent empty == True
  17924. 1045.92 s [algebraic-graphs] OK: consistent (vertex x) == True
  17925. 1045.92 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17926. 1045.92 s [algebraic-graphs] OK: consistent (connect x y) == True
  17927. 1045.92 s [algebraic-graphs] OK: consistent (edge x y) == True
  17928. 1045.92 s [algebraic-graphs] OK: consistent (edges xs) == True
  17929. 1045.92 s [algebraic-graphs] OK: consistent (stars xs) == True
  17930. 1045.92 s [algebraic-graphs]
  17931. 1045.92 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  17932. 1045.92 s [algebraic-graphs] OK: show (empty ) == "empty"
  17933. 1045.92 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17934. 1045.92 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17935. 1045.92 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17936. 1045.92 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17937. 1045.92 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17938. 1045.92 s [algebraic-graphs]
  17939. 1045.92 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17940. 1045.92 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17941. 1045.92 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17942. 1045.92 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17943. 1045.92 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17944. 1045.92 s [algebraic-graphs]
  17945. 1045.92 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  17946. 1045.92 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17947. 1045.92 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17948. 1045.92 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17949. 1045.92 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17950. 1045.92 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17951. 1045.92 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17952. 1045.92 s [algebraic-graphs] OK: x <= x + y
  17953. 1045.92 s [algebraic-graphs] OK: x + y <= x * y
  17954. 1045.92 s [algebraic-graphs]
  17955. 1045.92 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  17956. 1045.92 s [algebraic-graphs] OK: isEmpty empty == True
  17957. 1045.92 s [algebraic-graphs] OK: hasVertex x empty == False
  17958. 1045.92 s [algebraic-graphs] OK: vertexCount empty == 0
  17959. 1045.92 s [algebraic-graphs] OK: edgeCount empty == 0
  17960. 1045.92 s [algebraic-graphs]
  17961. 1045.92 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  17962. 1045.92 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17963. 1045.92 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17964. 1045.92 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17965. 1045.92 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17966. 1045.92 s [algebraic-graphs]
  17967. 1045.92 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  17968. 1045.92 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17969. 1045.92 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17970. 1045.92 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17971. 1045.92 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17972. 1045.92 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17973. 1045.92 s [algebraic-graphs]
  17974. 1045.92 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  17975. 1045.92 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17976. 1045.92 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17977. 1045.92 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17978. 1045.92 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17979. 1045.92 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17980. 1045.92 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17981. 1045.92 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17982. 1045.92 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17983. 1045.92 s [algebraic-graphs]
  17984. 1045.92 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  17985. 1045.92 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17986. 1045.92 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17987. 1045.92 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17988. 1045.92 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17989. 1045.92 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17990. 1045.92 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17991. 1045.92 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17992. 1045.92 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17993. 1045.92 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17994. 1045.92 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17995. 1045.92 s [algebraic-graphs]
  17996. 1045.92 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  17997. 1045.92 s [algebraic-graphs] OK: vertices [] == empty
  17998. 1045.92 s [algebraic-graphs] OK: vertices [x] == vertex x
  17999. 1045.92 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18000. 1045.93 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18001. 1045.93 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18002. 1045.93 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18003. 1045.93 s [algebraic-graphs]
  18004. 1045.93 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  18005. 1045.93 s [algebraic-graphs] OK: edges [] == empty
  18006. 1045.93 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18007. 1045.93 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18008. 1045.93 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18009. 1045.93 s [algebraic-graphs]
  18010. 1045.93 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  18011. 1045.93 s [algebraic-graphs] OK: overlays [] == empty
  18012. 1045.93 s [algebraic-graphs] OK: overlays [x] == x
  18013. 1045.93 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18014. 1045.93 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18015. 1045.93 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18016. 1045.93 s [algebraic-graphs]
  18017. 1045.93 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  18018. 1045.93 s [algebraic-graphs] OK: connects [] == empty
  18019. 1045.93 s [algebraic-graphs] OK: connects [x] == x
  18020. 1045.93 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18021. 1045.93 s [algebraic-graphs] OK: connects == foldr connect empty
  18022. 1045.93 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18023. 1045.93 s [algebraic-graphs]
  18024. 1045.93 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  18025. 1045.93 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  18026. 1045.93 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  18027. 1045.93 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  18028. 1045.93 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  18029. 1045.93 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  18030. 1045.93 s [algebraic-graphs]
  18031. 1045.93 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  18032. 1045.93 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18033. 1045.93 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18034. 1045.93 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18035. 1045.93 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18036. 1045.93 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  18037. 1045.93 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18038. 1045.93 s [algebraic-graphs]
  18039. 1045.93 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  18040. 1045.93 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  18041. 1045.93 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  18042. 1045.93 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  18043. 1045.93 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  18044. 1045.93 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  18045. 1045.93 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  18046. 1045.93 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  18047. 1045.93 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  18048. 1045.93 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  18049. 1045.93 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  18050. 1045.93 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  18051. 1045.93 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  18052. 1045.93 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  18053. 1045.93 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  18054. 1045.93 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  18055. 1045.93 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  18056. 1045.93 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  18057. 1045.93 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  18058. 1045.93 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  18059. 1045.93 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  18060. 1045.93 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  18061. 1045.93 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  18062. 1045.93 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  18063. 1045.93 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  18064. 1045.93 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  18065. 1045.93 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  18066. 1045.93 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  18067. 1045.93 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  18068. 1045.93 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18069. 1045.93 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  18070. 1045.93 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  18071. 1045.93 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  18072. 1045.93 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  18073. 1048.82 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  18074. 1048.82 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18075. 1048.82 s [algebraic-graphs]
  18076. 1048.82 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  18077. 1048.82 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  18078. 1048.82 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  18079. 1048.82 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  18080. 1048.82 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  18081. 1048.82 s [algebraic-graphs]
  18082. 1048.82 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  18083. 1048.82 s [algebraic-graphs] OK: isEmpty empty == True
  18084. 1048.82 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18085. 1048.82 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18086. 1048.82 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18087. 1048.82 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  18088. 1048.82 s [algebraic-graphs]
  18089. 1048.82 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  18090. 1048.82 s [algebraic-graphs] OK: hasVertex x empty == False
  18091. 1048.82 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18092. 1048.82 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18093. 1048.82 s [algebraic-graphs]
  18094. 1048.82 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  18095. 1048.82 s [algebraic-graphs] OK: hasEdge x y empty == False
  18096. 1048.82 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18097. 1048.82 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18098. 1048.82 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18099. 1048.82 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18100. 1048.82 s [algebraic-graphs]
  18101. 1048.82 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  18102. 1048.82 s [algebraic-graphs] OK: vertexCount empty == 0
  18103. 1048.82 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18104. 1048.82 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18105. 1048.82 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18106. 1048.82 s [algebraic-graphs]
  18107. 1048.82 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  18108. 1048.82 s [algebraic-graphs] OK: edgeCount empty == 0
  18109. 1048.82 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18110. 1048.82 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18111. 1048.82 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18112. 1048.82 s [algebraic-graphs]
  18113. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  18114. 1048.83 s [algebraic-graphs] OK: vertexList empty == []
  18115. 1048.83 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18116. 1048.83 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18117. 1048.83 s [algebraic-graphs]
  18118. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  18119. 1048.83 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18120. 1048.83 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18121. 1048.83 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18122. 1048.83 s [algebraic-graphs]
  18123. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  18124. 1048.83 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  18125. 1048.83 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18126. 1048.83 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18127. 1048.83 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18128. 1048.83 s [algebraic-graphs]
  18129. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  18130. 1048.83 s [algebraic-graphs] OK: edgeList empty == []
  18131. 1048.83 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18132. 1048.83 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18133. 1048.83 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18134. 1048.83 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18135. 1048.83 s [algebraic-graphs]
  18136. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  18137. 1048.83 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18138. 1048.83 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18139. 1048.83 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18140. 1048.83 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18141. 1048.83 s [algebraic-graphs]
  18142. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  18143. 1048.83 s [algebraic-graphs] OK: adjacencyList empty == []
  18144. 1048.83 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  18145. 1048.83 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  18146. 1048.83 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  18147. 1048.83 s [algebraic-graphs]
  18148. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  18149. 1048.83 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18150. 1048.83 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18151. 1048.83 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18152. 1048.83 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18153. 1048.83 s [algebraic-graphs]
  18154. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  18155. 1048.83 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18156. 1048.83 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18157. 1048.83 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18158. 1048.83 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18159. 1048.83 s [algebraic-graphs]
  18160. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  18161. 1048.83 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18162. 1048.83 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18163. 1048.83 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18164. 1048.83 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18165. 1048.83 s [algebraic-graphs]
  18166. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  18167. 1048.83 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18168. 1048.83 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18169. 1048.83 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18170. 1048.83 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18171. 1048.83 s [algebraic-graphs]
  18172. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.path ============
  18173. 1048.83 s [algebraic-graphs] OK: path [] == empty
  18174. 1048.83 s [algebraic-graphs] OK: path [x] == vertex x
  18175. 1048.83 s [algebraic-graphs] OK: path [x,y] == edge x y
  18176. 1048.83 s [algebraic-graphs]
  18177. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  18178. 1048.83 s [algebraic-graphs] OK: circuit [] == empty
  18179. 1048.83 s [algebraic-graphs] OK: circuit [x] == edge x x
  18180. 1048.83 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18181. 1048.83 s [algebraic-graphs]
  18182. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  18183. 1048.83 s [algebraic-graphs] OK: clique [] == empty
  18184. 1048.83 s [algebraic-graphs] OK: clique [x] == vertex x
  18185. 1048.83 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18186. 1048.83 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18187. 1048.83 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18188. 1048.83 s [algebraic-graphs]
  18189. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  18190. 1048.83 s [algebraic-graphs] OK: biclique [] [] == empty
  18191. 1048.83 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18192. 1048.83 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18193. 1048.83 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18194. 1048.83 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18195. 1048.83 s [algebraic-graphs]
  18196. 1048.83 s [algebraic-graphs] ============ AdjacencyMap.star ============
  18197. 1048.83 s [algebraic-graphs] OK: star x [] == vertex x
  18198. 1048.83 s [algebraic-graphs] OK: star x [y] == edge x y
  18199. 1048.83 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18200. 1048.84 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  18201. 1048.84 s [algebraic-graphs]
  18202. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  18203. 1048.84 s [algebraic-graphs] OK: stars [] == empty
  18204. 1048.84 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  18205. 1048.84 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18206. 1048.84 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18207. 1048.84 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18208. 1048.84 s [algebraic-graphs] OK: stars . adjacencyList == id
  18209. 1048.84 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18210. 1048.84 s [algebraic-graphs]
  18211. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  18212. 1048.84 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18213. 1048.84 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  18214. 1048.84 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18215. 1048.84 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  18216. 1048.84 s [algebraic-graphs]
  18217. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  18218. 1048.84 s [algebraic-graphs] OK: forest [] == empty
  18219. 1048.84 s [algebraic-graphs] OK: forest [x] == tree x
  18220. 1048.84 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  18221. 1048.84 s [algebraic-graphs] OK: forest == overlays . map tree
  18222. 1048.84 s [algebraic-graphs]
  18223. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  18224. 1048.84 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18225. 1048.84 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18226. 1048.84 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  18227. 1048.84 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  18228. 1048.84 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18229. 1048.84 s [algebraic-graphs]
  18230. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  18231. 1048.84 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  18232. 1048.84 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18233. 1048.84 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18234. 1048.84 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18235. 1048.84 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18236. 1048.84 s [algebraic-graphs]
  18237. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  18238. 1048.84 s [algebraic-graphs] OK: replaceVertex x x == id
  18239. 1048.84 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18240. 1048.84 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18241. 1048.84 s [algebraic-graphs]
  18242. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  18243. 1048.84 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18244. 1048.84 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18245. 1048.84 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18246. 1048.84 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18247. 1048.84 s [algebraic-graphs]
  18248. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  18249. 1048.84 s [algebraic-graphs] OK: transpose empty == empty
  18250. 1048.84 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18251. 1048.84 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18252. 1048.84 s [algebraic-graphs] OK: transpose . transpose == id
  18253. 1048.84 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18254. 1048.84 s [algebraic-graphs]
  18255. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  18256. 1048.84 s [algebraic-graphs] OK: gmap f empty == empty
  18257. 1048.84 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18258. 1048.84 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18259. 1048.84 s [algebraic-graphs] OK: gmap id == id
  18260. 1048.84 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18261. 1048.84 s [algebraic-graphs]
  18262. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  18263. 1048.84 s [algebraic-graphs] OK: induce (const True ) x == x
  18264. 1048.84 s [algebraic-graphs] OK: induce (const False) x == empty
  18265. 1048.84 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18266. 1048.84 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18267. 1048.84 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18268. 1048.84 s [algebraic-graphs]
  18269. 1048.84 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  18270. 1048.84 s [algebraic-graphs] OK: compose empty x == empty
  18271. 1048.84 s [algebraic-graphs] OK: compose x empty == empty
  18272. 1048.84 s [algebraic-graphs] OK: compose (vertex x) y == empty
  18273. 1048.84 s [algebraic-graphs] OK: compose x (vertex y) == empty
  18274. 1048.84 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  18275. 1048.84 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  18276. 1052.31 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  18277. 1052.31 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  18278. 1052.37 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  18279. 1052.37 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  18280. 1052.37 s [algebraic-graphs]
  18281. 1052.37 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  18282. 1052.37 s [algebraic-graphs] OK: closure empty == empty
  18283. 1052.37 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  18284. 1052.37 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  18285. 1052.37 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18286. 1052.37 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  18287. 1052.37 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18288. 1052.37 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18289. 1052.37 s [algebraic-graphs] OK: closure . closure == closure
  18290. 1052.37 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18291. 1052.37 s [algebraic-graphs]
  18292. 1052.37 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  18293. 1052.37 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  18294. 1052.37 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  18295. 1052.37 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  18296. 1052.37 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18297. 1052.37 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18298. 1052.37 s [algebraic-graphs]
  18299. 1052.37 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  18300. 1052.37 s [algebraic-graphs] OK: symmetricClosure empty == empty
  18301. 1052.37 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18302. 1052.37 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  18303. 1052.37 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18304. 1052.37 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18305. 1052.37 s [algebraic-graphs]
  18306. 1052.37 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  18307. 1052.37 s [algebraic-graphs] OK: transitiveClosure empty == empty
  18308. 1052.37 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18309. 1052.37 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  18310. 1052.37 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  18311. 1052.37 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18312. 1052.37 s [algebraic-graphs]
  18313. 1052.37 s [algebraic-graphs] ============ AdjacencyMap.box ============
  18314. 1052.37 s [algebraic-graphs] OK: box x y ~~ box y x
  18315. 1052.37 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  18316. 1052.37 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  18317. 1052.37 s [algebraic-graphs] OK: box x empty ~~ empty
  18318. 1052.37 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18319. 1052.37 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18320. 1052.37 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  18321. 1052.37 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18322. 1052.37 s [algebraic-graphs]
  18323. 1052.37 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  18324. 1052.37 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  18325. 1052.37 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  18326. 1052.37 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  18327. 1052.37 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  18328. 1052.37 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  18329. 1052.37 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  18330. 1052.37 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  18331. 1052.37 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  18332. 1052.37 s [algebraic-graphs] OK: bfsForest x [] == []
  18333. 1052.37 s [algebraic-graphs] OK: bfsForest empty vs == []
  18334. 1052.37 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18335. 1052.37 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  18336. 1052.37 s [algebraic-graphs]
  18337. 1052.37 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  18338. 1052.37 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  18339. 1052.37 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  18340. 1052.37 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  18341. 1052.37 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  18342. 1052.37 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  18343. 1052.37 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  18344. 1052.37 s [algebraic-graphs] OK: bfs empty vs == []
  18345. 1052.37 s [algebraic-graphs] OK: bfs x [] == []
  18346. 1052.37 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  18347. 1052.37 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  18348. 1052.37 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  18349. 1052.37 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  18350. 1052.37 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  18351. 1052.37 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  18352. 1052.37 s [algebraic-graphs]
  18353. 1052.37 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  18354. 1052.37 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  18355. 1052.37 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  18356. 1052.37 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  18357. 1052.37 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  18358. 1052.37 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  18359. 1052.37 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  18360. 1052.37 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  18361. 1052.37 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  18362. 1052.37 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  18363. 1052.37 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  18364. 1052.37 s [algebraic-graphs]
  18365. 1052.37 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  18366. 1052.37 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  18367. 1052.37 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  18368. 1052.37 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  18369. 1052.37 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  18370. 1052.37 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  18371. 1052.37 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  18372. 1052.37 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  18373. 1052.37 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  18374. 1052.37 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  18375. 1052.37 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  18376. 1052.37 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  18377. 1052.37 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18378. 1052.37 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  18379. 1052.37 s [algebraic-graphs]
  18380. 1052.37 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18381. 1052.37 s [algebraic-graphs] OK: dfs empty vs == []
  18382. 1052.37 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  18383. 1052.37 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  18384. 1052.37 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  18385. 1052.37 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  18386. 1052.37 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  18387. 1052.37 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  18388. 1052.37 s [algebraic-graphs] OK: dfs x [] == []
  18389. 1052.37 s [algebraic-graphs]
  18390. 1052.37 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  18391. 1052.38 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  18392. 1052.38 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  18393. 1052.38 s [algebraic-graphs]
  18394. 1052.38 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18395. 1052.38 s [algebraic-graphs] OK: reachable empty x == []
  18396. 1052.38 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  18397. 1052.38 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  18398. 1052.38 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  18399. 1052.38 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  18400. 1052.38 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  18401. 1052.38 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  18402. 1052.38 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  18403. 1052.38 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  18404. 1052.38 s [algebraic-graphs]
  18405. 1052.38 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  18406. 1052.38 s [algebraic-graphs]
  18407. 1052.38 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  18408. 1052.38 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  18409. 1052.38 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  18410. 1052.38 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  18411. 1052.38 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  18412. 1052.38 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  18413. 1052.38 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  18414. 1052.38 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  18415. 1052.38 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  18416. 1052.38 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  18417. 1052.38 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  18418. 1052.38 s [algebraic-graphs]
  18419. 1052.38 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  18420. 1052.38 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  18421. 1052.38 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  18422. 1052.38 s [algebraic-graphs] OK: isAcyclic . circuit == null
  18423. 1052.38 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  18424. 1052.38 s [algebraic-graphs]
  18425. 1052.38 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  18426. 1052.38 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  18427. 1052.38 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  18428. 1052.38 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  18429. 1052.38 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  18430. 1052.38 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  18431. 1052.38 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  18432. 1052.38 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  18433. 1059.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  18434. 1059.51 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  18435. 1059.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  18436. 1059.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  18437. 1059.52 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  18438. 1059.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  18439. 1059.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  18440. 1059.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  18441. 1059.52 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  18442. 1059.52 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  18443. 1059.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  18444. 1059.52 s [algebraic-graphs]
  18445. 1059.52 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  18446. 1059.52 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  18447. 1059.52 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  18448. 1059.52 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  18449. 1059.52 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  18450. 1059.52 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  18451. 1059.52 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  18452. 1059.52 s [algebraic-graphs]
  18453. 1059.52 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  18454. 1059.52 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18455. 1059.52 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18456. 1059.52 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18457. 1059.52 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18458. 1059.52 s [algebraic-graphs]
  18459. 1059.52 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  18460. 1059.52 s [algebraic-graphs] OK: scc empty == empty
  18461. 1059.52 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  18462. 1059.52 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  18463. 1059.52 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  18464. 1059.52 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  18465. 1059.52 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  18466. 1059.52 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  18467. 1059.52 s [algebraic-graphs] OK: isAcyclic . scc == const True
  18468. 1059.52 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  18469. 1059.52 s [algebraic-graphs] OK: scc g == KL.scc g
  18470. 1059.52 s [algebraic-graphs]
  18471. 1059.52 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  18472. 1059.52 s [algebraic-graphs] OK: 0 == rightVertex 0
  18473. 1059.52 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  18474. 1059.52 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  18475. 1059.52 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  18476. 1059.52 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  18477. 1059.52 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  18478. 1059.52 s [algebraic-graphs]
  18479. 1059.52 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  18480. 1059.52 s [algebraic-graphs] OK: show empty == "empty"
  18481. 1059.52 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  18482. 1059.52 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  18483. 1059.52 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  18484. 1059.52 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  18485. 1059.52 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  18486. 1059.52 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  18487. 1059.52 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  18488. 1059.52 s [algebraic-graphs]
  18489. 1059.52 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  18490. 1059.52 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  18491. 1059.52 s [algebraic-graphs]
  18492. 1059.52 s [algebraic-graphs] OK: x + y == y + x
  18493. 1059.52 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  18494. 1059.52 s [algebraic-graphs] OK: x * empty == x
  18495. 1059.52 s [algebraic-graphs] OK: empty * x == x
  18496. 1059.52 s [algebraic-graphs] OK: x * y == y * x
  18497. 1059.52 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  18498. 1059.52 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  18499. 1059.52 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  18500. 1059.52 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  18501. 1059.52 s [algebraic-graphs] OK: x + empty == x
  18502. 1059.52 s [algebraic-graphs] OK: empty + x == x
  18503. 1059.52 s [algebraic-graphs] OK: x + x == x
  18504. 1059.52 s [algebraic-graphs] OK: x * y + x + y == x * y
  18505. 1059.52 s [algebraic-graphs] OK: x * x * x == x * x
  18506. 1059.52 s [algebraic-graphs]
  18507. 1059.52 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  18508. 1059.52 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  18509. 1059.52 s [algebraic-graphs]
  18510. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  18511. 1059.53 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18512. 1059.53 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18513. 1059.53 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18514. 1059.53 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18515. 1059.53 s [algebraic-graphs]
  18516. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  18517. 1059.53 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18518. 1059.53 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18519. 1059.53 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18520. 1059.53 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18521. 1059.53 s [algebraic-graphs]
  18522. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  18523. 1059.53 s [algebraic-graphs] OK: isEmpty empty == True
  18524. 1059.53 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18525. 1059.53 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18526. 1059.53 s [algebraic-graphs] OK: hasVertex x empty == False
  18527. 1059.53 s [algebraic-graphs]
  18528. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  18529. 1059.53 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18530. 1059.53 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18531. 1059.53 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18532. 1059.53 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18533. 1059.53 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  18534. 1059.53 s [algebraic-graphs]
  18535. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  18536. 1059.53 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18537. 1059.53 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18538. 1059.53 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18539. 1059.53 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18540. 1059.53 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  18541. 1059.53 s [algebraic-graphs]
  18542. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  18543. 1059.53 s [algebraic-graphs] OK: vertex . Left == leftVertex
  18544. 1059.53 s [algebraic-graphs] OK: vertex . Right == rightVertex
  18545. 1059.53 s [algebraic-graphs]
  18546. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  18547. 1059.53 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  18548. 1059.53 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18549. 1059.53 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18550. 1059.53 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18551. 1059.53 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  18552. 1059.53 s [algebraic-graphs]
  18553. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  18554. 1059.53 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18555. 1059.53 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18556. 1059.53 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18557. 1059.53 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18558. 1059.53 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18559. 1059.53 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18560. 1059.53 s [algebraic-graphs]
  18561. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  18562. 1059.53 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  18563. 1059.53 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  18564. 1059.53 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  18565. 1059.53 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  18566. 1059.53 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  18567. 1059.53 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18568. 1059.53 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18569. 1059.53 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18570. 1059.53 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18571. 1059.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18572. 1059.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  18573. 1059.53 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  18574. 1059.53 s [algebraic-graphs]
  18575. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  18576. 1059.53 s [algebraic-graphs] OK: vertices [] [] == empty
  18577. 1059.53 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  18578. 1059.53 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  18579. 1059.53 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  18580. 1059.53 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  18581. 1059.53 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  18582. 1059.53 s [algebraic-graphs]
  18583. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  18584. 1059.53 s [algebraic-graphs] OK: edges [] == empty
  18585. 1059.53 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18586. 1059.53 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18587. 1059.53 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  18588. 1059.53 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18589. 1059.53 s [algebraic-graphs]
  18590. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  18591. 1059.53 s [algebraic-graphs] OK: overlays [] == empty
  18592. 1059.53 s [algebraic-graphs] OK: overlays [x] == x
  18593. 1059.53 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18594. 1059.53 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18595. 1059.53 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18596. 1059.53 s [algebraic-graphs]
  18597. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  18598. 1059.53 s [algebraic-graphs] OK: connects [] == empty
  18599. 1059.53 s [algebraic-graphs] OK: connects [x] == x
  18600. 1059.53 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18601. 1059.53 s [algebraic-graphs] OK: connects == foldr connect empty
  18602. 1059.53 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18603. 1059.53 s [algebraic-graphs]
  18604. 1059.53 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  18605. 1061.15 s [algebraic-graphs] OK: swap empty == empty
  18606. 1061.15 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  18607. 1061.15 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  18608. 1061.15 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  18609. 1061.16 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  18610. 1061.16 s [algebraic-graphs] OK: swap . swap == id
  18611. 1061.16 s [algebraic-graphs]
  18612. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  18613. 1061.16 s [algebraic-graphs] OK: toBipartite empty == empty
  18614. 1061.16 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  18615. 1061.16 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  18616. 1061.16 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  18617. 1061.16 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  18618. 1061.16 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  18619. 1061.16 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  18620. 1061.16 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  18621. 1061.16 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  18622. 1061.16 s [algebraic-graphs]
  18623. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  18624. 1061.16 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  18625. 1061.16 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  18626. 1061.16 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  18627. 1061.16 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  18628. 1061.16 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  18629. 1061.16 s [algebraic-graphs]
  18630. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  18631. 1061.16 s [algebraic-graphs] OK: fromBipartite empty == empty
  18632. 1061.16 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  18633. 1061.16 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  18634. 1061.16 s [algebraic-graphs]
  18635. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  18636. 1061.16 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  18637. 1061.16 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  18638. 1061.16 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  18639. 1061.16 s [algebraic-graphs]
  18640. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  18641. 1061.16 s [algebraic-graphs] OK: isEmpty empty == True
  18642. 1061.16 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18643. 1061.16 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18644. 1061.16 s [algebraic-graphs] OK: isEmpty == (==) empty
  18645. 1061.16 s [algebraic-graphs]
  18646. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  18647. 1061.16 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  18648. 1061.16 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18649. 1061.16 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18650. 1061.16 s [algebraic-graphs]
  18651. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  18652. 1061.16 s [algebraic-graphs] OK: hasRightVertex x empty == False
  18653. 1061.16 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18654. 1061.16 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18655. 1061.16 s [algebraic-graphs]
  18656. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  18657. 1061.16 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  18658. 1061.16 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  18659. 1061.16 s [algebraic-graphs]
  18660. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  18661. 1061.16 s [algebraic-graphs] OK: hasEdge x y empty == False
  18662. 1061.16 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18663. 1061.16 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18664. 1061.16 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18665. 1061.16 s [algebraic-graphs]
  18666. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  18667. 1061.16 s [algebraic-graphs] OK: leftVertexCount empty == 0
  18668. 1061.16 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  18669. 1061.16 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  18670. 1061.16 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  18671. 1061.16 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  18672. 1061.16 s [algebraic-graphs]
  18673. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  18674. 1061.16 s [algebraic-graphs] OK: rightVertexCount empty == 0
  18675. 1061.16 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  18676. 1061.16 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  18677. 1061.16 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  18678. 1061.16 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  18679. 1061.16 s [algebraic-graphs]
  18680. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  18681. 1061.16 s [algebraic-graphs] OK: vertexCount empty == 0
  18682. 1061.16 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18683. 1061.16 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  18684. 1061.16 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  18685. 1061.16 s [algebraic-graphs]
  18686. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  18687. 1061.16 s [algebraic-graphs] OK: edgeCount empty == 0
  18688. 1061.16 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18689. 1061.16 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18690. 1061.16 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18691. 1061.16 s [algebraic-graphs]
  18692. 1061.16 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  18693. 1061.16 s [algebraic-graphs] OK: leftVertexList empty == []
  18694. 1061.16 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  18695. 1061.17 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  18696. 1061.17 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  18697. 1061.17 s [algebraic-graphs]
  18698. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  18699. 1061.17 s [algebraic-graphs] OK: rightVertexList empty == []
  18700. 1061.17 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  18701. 1061.17 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  18702. 1061.17 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  18703. 1061.17 s [algebraic-graphs]
  18704. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  18705. 1061.17 s [algebraic-graphs] OK: vertexList empty == []
  18706. 1061.17 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18707. 1061.17 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  18708. 1061.17 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  18709. 1061.17 s [algebraic-graphs]
  18710. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  18711. 1061.17 s [algebraic-graphs] OK: edgeList empty == []
  18712. 1061.17 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18713. 1061.17 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18714. 1061.17 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18715. 1061.17 s [algebraic-graphs]
  18716. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  18717. 1061.17 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  18718. 1061.17 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  18719. 1061.17 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  18720. 1061.17 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  18721. 1061.17 s [algebraic-graphs]
  18722. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  18723. 1061.17 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  18724. 1061.17 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  18725. 1061.17 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  18726. 1061.17 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  18727. 1061.17 s [algebraic-graphs]
  18728. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  18729. 1061.17 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18730. 1061.17 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18731. 1061.17 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  18732. 1061.17 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  18733. 1061.17 s [algebraic-graphs]
  18734. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  18735. 1061.17 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18736. 1061.17 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18737. 1061.17 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18738. 1061.17 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18739. 1061.17 s [algebraic-graphs]
  18740. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  18741. 1061.17 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  18742. 1061.17 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  18743. 1061.17 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  18744. 1061.17 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  18745. 1061.17 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  18746. 1061.17 s [algebraic-graphs]
  18747. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  18748. 1061.17 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  18749. 1061.17 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  18750. 1061.17 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  18751. 1061.17 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  18752. 1061.17 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  18753. 1061.17 s [algebraic-graphs]
  18754. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  18755. 1061.17 s [algebraic-graphs] OK: evenList [] == Nil
  18756. 1061.17 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  18757. 1061.17 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  18758. 1061.17 s [algebraic-graphs]
  18759. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  18760. 1061.17 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  18761. 1061.17 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  18762. 1061.17 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  18763. 1061.17 s [algebraic-graphs]
  18764. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  18765. 1061.17 s [algebraic-graphs] OK: path Nil == empty
  18766. 1061.17 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  18767. 1061.17 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  18768. 1061.17 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  18769. 1061.17 s [algebraic-graphs]
  18770. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  18771. 1061.17 s [algebraic-graphs] OK: circuit [] == empty
  18772. 1061.17 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  18773. 1061.17 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  18774. 1061.17 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  18775. 1061.17 s [algebraic-graphs]
  18776. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  18777. 1061.17 s [algebraic-graphs] OK: biclique [] [] == empty
  18778. 1061.17 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  18779. 1061.17 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  18780. 1061.17 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  18781. 1061.17 s [algebraic-graphs]
  18782. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  18783. 1061.17 s [algebraic-graphs] OK: star x [] == leftVertex x
  18784. 1061.17 s [algebraic-graphs] OK: star x [y] == edge x y
  18785. 1061.17 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18786. 1061.17 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  18787. 1061.17 s [algebraic-graphs]
  18788. 1061.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  18789. 1061.17 s [algebraic-graphs] OK: stars [] == empty
  18790. 1061.17 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  18791. 1061.17 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18792. 1061.17 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18793. 1089.11 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18794. 1089.13 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18795. 1089.13 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18796. 1089.13 s [algebraic-graphs]
  18797. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  18798. 1089.13 s [algebraic-graphs] OK: mesh xs [] == empty
  18799. 1089.13 s [algebraic-graphs] OK: mesh [] ys == empty
  18800. 1089.13 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  18801. 1089.13 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  18802. 1089.13 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  18803. 1089.13 s [algebraic-graphs]
  18804. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  18805. 1089.13 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  18806. 1089.13 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  18807. 1089.13 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  18808. 1089.13 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  18809. 1089.13 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  18810. 1089.13 s [algebraic-graphs]
  18811. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  18812. 1089.13 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  18813. 1089.13 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  18814. 1089.13 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  18815. 1089.13 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  18816. 1089.13 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  18817. 1089.13 s [algebraic-graphs]
  18818. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  18819. 1089.13 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  18820. 1089.13 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18821. 1089.13 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  18822. 1089.13 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  18823. 1089.13 s [algebraic-graphs]
  18824. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  18825. 1089.13 s [algebraic-graphs] OK: bimap f g empty == empty
  18826. 1089.13 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  18827. 1089.13 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  18828. 1089.13 s [algebraic-graphs] OK: bimap id id == id
  18829. 1089.13 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  18830. 1089.13 s [algebraic-graphs]
  18831. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  18832. 1089.13 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  18833. 1089.13 s [algebraic-graphs]
  18834. 1089.13 s [algebraic-graphs] OK: box x y ~~ box y x
  18835. 1089.13 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18836. 1089.13 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18837. 1089.13 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  18838. 1089.13 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  18839. 1089.13 s [algebraic-graphs] OK: box x empty ~~ empty
  18840. 1089.13 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  18841. 1089.13 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18842. 1089.13 s [algebraic-graphs]
  18843. 1089.13 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  18844. 1089.13 s [algebraic-graphs]
  18845. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  18846. 1089.13 s [algebraic-graphs] OK: consistent empty == True
  18847. 1089.13 s [algebraic-graphs] OK: consistent (vertex x) == True
  18848. 1089.13 s [algebraic-graphs] OK: consistent (edge x y) == True
  18849. 1089.13 s [algebraic-graphs] OK: consistent (edges x) == True
  18850. 1089.13 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  18851. 1089.13 s [algebraic-graphs] OK: consistent (swap x) == True
  18852. 1089.13 s [algebraic-graphs] OK: consistent (circuit xs) == True
  18853. 1089.13 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  18854. 1089.13 s [algebraic-graphs]
  18855. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  18856. 1089.13 s [algebraic-graphs] OK: detectParts empty == Right empty
  18857. 1089.13 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  18858. 1089.13 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  18859. 1089.13 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  18860. 1089.13 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  18861. 1089.13 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  18862. 1089.13 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  18863. 1089.13 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  18864. 1089.13 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  18865. 1089.13 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  18866. 1089.13 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  18867. 1089.13 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  18868. 1089.13 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  18869. 1089.13 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  18870. 1089.13 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  18871. 1089.13 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  18872. 1089.13 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  18873. 1089.13 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  18874. 1089.13 s [algebraic-graphs]
  18875. 1089.13 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  18876. 1089.13 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  18877. 1089.13 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  18878. 1089.13 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  18879. 1089.13 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  18880. 1089.13 s [algebraic-graphs]
  18881. 1089.13 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18882. 1089.13 s [algebraic-graphs] OK: show (matching []) == "matching []"
  18883. 1089.13 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  18884. 1089.13 s [algebraic-graphs]
  18885. 1089.13 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18886. 1089.13 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  18887. 1089.13 s [algebraic-graphs]
  18888. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  18889. 1089.13 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  18890. 1089.13 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  18891. 1089.13 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  18892. 1089.13 s [algebraic-graphs]
  18893. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  18894. 1089.13 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  18895. 1089.13 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  18896. 1089.13 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  18897. 1089.13 s [algebraic-graphs]
  18898. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  18899. 1089.13 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  18900. 1089.13 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  18901. 1089.13 s [algebraic-graphs]
  18902. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  18903. 1089.13 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  18904. 1089.13 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  18905. 1089.13 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  18906. 1089.13 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  18907. 1089.13 s [algebraic-graphs]
  18908. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  18909. 1089.13 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  18910. 1089.13 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  18911. 1089.13 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  18912. 1089.13 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  18913. 1089.13 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  18914. 1089.13 s [algebraic-graphs]
  18915. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  18916. 1089.13 s [algebraic-graphs] OK: maxMatching empty == matching []
  18917. 1089.13 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  18918. 1089.13 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  18919. 1089.13 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  18920. 1089.13 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  18921. 1089.13 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18922. 1089.13 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  18923. 1089.13 s [algebraic-graphs]
  18924. 1089.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  18925. 1089.13 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  18926. 1089.13 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18927. 1089.13 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  18928. 1089.13 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  18929. 1089.14 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  18930. 1089.14 s [algebraic-graphs]
  18931. 1089.14 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  18932. 1089.14 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  18933. 1091.94 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  18934. 1091.94 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  18935. 1091.94 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  18936. 1091.94 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18937. 1091.94 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  18938. 1091.94 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  18939. 1091.94 s [algebraic-graphs]
  18940. 1091.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  18941. 1091.94 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  18942. 1091.94 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18943. 1091.94 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  18944. 1091.94 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  18945. 1091.94 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  18946. 1091.94 s [algebraic-graphs]
  18947. 1091.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  18948. 1091.94 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  18949. 1091.94 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  18950. 1091.94 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  18951. 1091.94 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  18952. 1091.94 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  18953. 1091.94 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  18954. 1091.94 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  18955. 1091.94 s [algebraic-graphs]
  18956. 1091.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  18957. 1091.94 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  18958. 1091.94 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  18959. 1091.94 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  18960. 1091.94 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  18961. 1091.94 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  18962. 1091.94 s [algebraic-graphs]
  18963. 1091.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  18964. 1091.94 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  18965. 1091.94 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  18966. 1091.94 s [algebraic-graphs]
  18967. 1091.94 s [algebraic-graphs] ============ Export.Eq ============
  18968. 1091.94 s [algebraic-graphs] OK: mempty /= literal ""
  18969. 1091.94 s [algebraic-graphs]
  18970. 1091.94 s [algebraic-graphs] ============ Export.Ord ============
  18971. 1091.94 s [algebraic-graphs] OK: mempty < literal ""
  18972. 1091.94 s [algebraic-graphs]
  18973. 1091.94 s [algebraic-graphs] ============ Export.isEmpty ============
  18974. 1091.94 s [algebraic-graphs] OK: isEmpty mempty == True
  18975. 1091.95 s [algebraic-graphs] OK: isEmpty (literal "") == False
  18976. 1091.95 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  18977. 1091.95 s [algebraic-graphs]
  18978. 1091.95 s [algebraic-graphs] ============ Export.literal ============
  18979. 1091.95 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  18980. 1091.95 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  18981. 1091.95 s [algebraic-graphs] OK: render . literal == id
  18982. 1091.95 s [algebraic-graphs]
  18983. 1091.95 s [algebraic-graphs] ============ Export.render ============
  18984. 1091.95 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  18985. 1091.95 s [algebraic-graphs] OK: render mempty == mempty
  18986. 1091.95 s [algebraic-graphs]
  18987. 1091.95 s [algebraic-graphs] ============ Export.<+> ============
  18988. 1091.95 s [algebraic-graphs] OK: x <+> mempty == x
  18989. 1091.95 s [algebraic-graphs] OK: mempty <+> x == x
  18990. 1091.95 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  18991. 1091.95 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  18992. 1091.95 s [algebraic-graphs]
  18993. 1091.95 s [algebraic-graphs] ============ Export.brackets ============
  18994. 1091.95 s [algebraic-graphs] OK: brackets "i" == "[i]"
  18995. 1091.95 s [algebraic-graphs] OK: brackets mempty == "[]"
  18996. 1091.95 s [algebraic-graphs]
  18997. 1091.95 s [algebraic-graphs] ============ Export.doubleQuotes ============
  18998. 1091.95 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  18999. 1091.95 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  19000. 1091.95 s [algebraic-graphs]
  19001. 1091.95 s [algebraic-graphs] ============ Export.indent ============
  19002. 1091.95 s [algebraic-graphs] OK: indent 0 == id
  19003. 1091.95 s [algebraic-graphs] OK: indent 1 mempty == " "
  19004. 1091.95 s [algebraic-graphs]
  19005. 1091.95 s [algebraic-graphs] ============ Export.unlines ============
  19006. 1091.95 s [algebraic-graphs] OK: unlines [] == mempty
  19007. 1091.95 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  19008. 1091.95 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  19009. 1091.95 s [algebraic-graphs]
  19010. 1091.95 s [algebraic-graphs] ============ Export.export ============
  19011. 1091.95 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  19012. 1091.95 s [algebraic-graphs]
  19013. 1091.95 s [algebraic-graphs] ============ Export.Dot.export ============
  19014. 1091.95 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  19015. 1091.95 s [algebraic-graphs]
  19016. 1091.95 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  19017. 1091.95 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  19018. 1091.95 s [algebraic-graphs]
  19019. 1091.95 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  19020. 1091.95 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  19021. 1091.95 s [algebraic-graphs]
  19022. 1091.95 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  19023. 1091.95 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  19024. 1091.95 s [algebraic-graphs]
  19025. 1091.95 s [algebraic-graphs] ============ Graph ============
  19026. 1091.95 s [algebraic-graphs] OK: Axioms of graphs
  19027. 1091.95 s [algebraic-graphs] OK: Theorems of graphs
  19028. 1091.95 s [algebraic-graphs]
  19029. 1091.95 s [algebraic-graphs] ============ Graph.Ord ============
  19030. 1091.95 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19031. 1091.95 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19032. 1091.95 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19033. 1091.95 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19034. 1091.95 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19035. 1091.95 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19036. 1091.95 s [algebraic-graphs] OK: x <= x + y
  19037. 1091.95 s [algebraic-graphs] OK: x + y <= x * y
  19038. 1091.95 s [algebraic-graphs]
  19039. 1091.95 s [algebraic-graphs] ============ Graph.empty ============
  19040. 1091.95 s [algebraic-graphs] OK: isEmpty empty == True
  19041. 1091.95 s [algebraic-graphs] OK: hasVertex x empty == False
  19042. 1091.95 s [algebraic-graphs] OK: vertexCount empty == 0
  19043. 1091.95 s [algebraic-graphs] OK: edgeCount empty == 0
  19044. 1091.95 s [algebraic-graphs]
  19045. 1091.95 s [algebraic-graphs] ============ Graph.vertex ============
  19046. 1091.95 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19047. 1091.95 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19048. 1091.95 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19049. 1091.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19050. 1091.95 s [algebraic-graphs]
  19051. 1091.95 s [algebraic-graphs] ============ Graph.edge ============
  19052. 1091.95 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19053. 1091.95 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19054. 1091.95 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19055. 1091.95 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19056. 1091.95 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19057. 1091.95 s [algebraic-graphs]
  19058. 1091.95 s [algebraic-graphs] ============ Graph.overlay ============
  19059. 1091.95 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19060. 1091.95 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19061. 1091.95 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19062. 1091.95 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19063. 1091.95 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19064. 1091.95 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19065. 1091.95 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19066. 1091.95 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19067. 1091.95 s [algebraic-graphs]
  19068. 1091.95 s [algebraic-graphs] ============ Graph.connect ============
  19069. 1091.95 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  19070. 1091.95 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19071. 1091.95 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19072. 1091.95 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19073. 1091.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19074. 1091.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19075. 1091.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19076. 1091.95 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19077. 1091.95 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19078. 1091.95 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19079. 1091.95 s [algebraic-graphs]
  19080. 1091.95 s [algebraic-graphs] ============ Graph.vertices ============
  19081. 1091.95 s [algebraic-graphs] OK: vertices [] == empty
  19082. 1091.95 s [algebraic-graphs] OK: vertices [x] == vertex x
  19083. 1091.95 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19084. 1091.95 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19085. 1091.95 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19086. 1091.95 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19087. 1091.95 s [algebraic-graphs]
  19088. 1091.95 s [algebraic-graphs] ============ Graph.edges ============
  19089. 1091.95 s [algebraic-graphs] OK: edges [] == empty
  19090. 1091.95 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  19091. 1091.95 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  19092. 1091.95 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  19093. 1091.95 s [algebraic-graphs]
  19094. 1091.95 s [algebraic-graphs] ============ Graph.overlays ============
  19095. 1091.95 s [algebraic-graphs] OK: overlays [] == empty
  19096. 1091.95 s [algebraic-graphs] OK: overlays [x] == x
  19097. 1091.95 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19098. 1091.95 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19099. 1091.95 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19100. 1091.95 s [algebraic-graphs]
  19101. 1091.95 s [algebraic-graphs] ============ Graph.connects ============
  19102. 1091.95 s [algebraic-graphs] OK: connects [] == empty
  19103. 1091.95 s [algebraic-graphs] OK: connects [x] == x
  19104. 1091.95 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19105. 1091.95 s [algebraic-graphs] OK: connects == foldr connect empty
  19106. 1091.95 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19107. 1091.95 s [algebraic-graphs]
  19108. 1091.95 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  19109. 1091.95 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19110. 1091.95 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19111. 1091.95 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19112. 1091.95 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19113. 1091.95 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  19114. 1091.95 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19115. 1091.95 s [algebraic-graphs]
  19116. 1091.95 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  19117. 1091.95 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  19118. 1091.95 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  19119. 1091.95 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  19120. 1091.95 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  19121. 1091.95 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  19122. 1091.95 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  19123. 1091.95 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  19124. 1091.95 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  19125. 1091.95 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  19126. 1092.86 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  19127. 1092.86 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  19128. 1092.86 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  19129. 1092.86 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  19130. 1092.86 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  19131. 1092.86 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  19132. 1092.86 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  19133. 1092.86 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  19134. 1092.86 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  19135. 1092.86 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  19136. 1092.86 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  19137. 1092.86 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  19138. 1092.86 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  19139. 1092.86 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  19140. 1092.86 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  19141. 1092.86 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  19142. 1092.86 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  19143. 1092.86 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  19144. 1092.86 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  19145. 1092.86 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19146. 1092.86 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  19147. 1092.86 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  19148. 1092.86 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  19149. 1092.86 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  19150. 1092.86 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  19151. 1092.86 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19152. 1092.86 s [algebraic-graphs]
  19153. 1092.86 s [algebraic-graphs] ============ Graph.foldg ============
  19154. 1092.86 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  19155. 1092.86 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  19156. 1092.86 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  19157. 1092.86 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  19158. 1092.86 s [algebraic-graphs]
  19159. 1092.86 s [algebraic-graphs] ============ Graph.isEmpty ============
  19160. 1092.86 s [algebraic-graphs] OK: isEmpty empty == True
  19161. 1092.86 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19162. 1092.86 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19163. 1092.86 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19164. 1092.86 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  19165. 1092.86 s [algebraic-graphs]
  19166. 1092.86 s [algebraic-graphs] ============ Graph.hasVertex ============
  19167. 1092.86 s [algebraic-graphs] OK: hasVertex x empty == False
  19168. 1092.86 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19169. 1092.86 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19170. 1092.86 s [algebraic-graphs]
  19171. 1092.86 s [algebraic-graphs] ============ Graph.hasEdge ============
  19172. 1092.86 s [algebraic-graphs] OK: hasEdge x y empty == False
  19173. 1092.86 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19174. 1092.86 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19175. 1092.86 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19176. 1092.86 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19177. 1092.86 s [algebraic-graphs]
  19178. 1092.86 s [algebraic-graphs] ============ Graph.vertexCount ============
  19179. 1092.86 s [algebraic-graphs] OK: vertexCount empty == 0
  19180. 1092.86 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19181. 1092.86 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19182. 1092.86 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19183. 1092.86 s [algebraic-graphs]
  19184. 1092.86 s [algebraic-graphs] ============ Graph.edgeCount ============
  19185. 1092.86 s [algebraic-graphs] OK: edgeCount empty == 0
  19186. 1092.86 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19187. 1092.86 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19188. 1092.86 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19189. 1092.86 s [algebraic-graphs]
  19190. 1092.86 s [algebraic-graphs] ============ Graph.vertexList ============
  19191. 1092.86 s [algebraic-graphs] OK: vertexList empty == []
  19192. 1092.86 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19193. 1092.86 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19194. 1092.86 s [algebraic-graphs]
  19195. 1092.86 s [algebraic-graphs] ============ Graph.vertexSet ============
  19196. 1092.86 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19197. 1092.86 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19198. 1092.86 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19199. 1092.86 s [algebraic-graphs]
  19200. 1092.86 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  19201. 1092.86 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  19202. 1092.86 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  19203. 1092.86 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  19204. 1092.87 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  19205. 1092.87 s [algebraic-graphs]
  19206. 1092.87 s [algebraic-graphs] ============ Graph.edgeList ============
  19207. 1092.87 s [algebraic-graphs] OK: edgeList empty == []
  19208. 1092.87 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19209. 1092.87 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19210. 1092.87 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19211. 1092.87 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  19212. 1092.87 s [algebraic-graphs]
  19213. 1092.87 s [algebraic-graphs] ============ Graph.edgeSet ============
  19214. 1092.87 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19215. 1092.87 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19216. 1092.87 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19217. 1092.87 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  19218. 1092.87 s [algebraic-graphs]
  19219. 1092.87 s [algebraic-graphs] ============ Graph.adjacencyList ============
  19220. 1092.87 s [algebraic-graphs] OK: adjacencyList empty == []
  19221. 1092.87 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19222. 1092.87 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  19223. 1092.87 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  19224. 1092.87 s [algebraic-graphs]
  19225. 1092.87 s [algebraic-graphs] ============ Graph.preSet ============
  19226. 1092.87 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19227. 1092.87 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19228. 1092.87 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19229. 1092.87 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19230. 1092.87 s [algebraic-graphs]
  19231. 1092.87 s [algebraic-graphs] ============ Graph.preIntSet ============
  19232. 1092.87 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  19233. 1092.87 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  19234. 1092.87 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  19235. 1092.87 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  19236. 1092.87 s [algebraic-graphs]
  19237. 1092.87 s [algebraic-graphs] ============ Graph.postSet ============
  19238. 1092.87 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19239. 1092.87 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19240. 1092.87 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19241. 1092.87 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19242. 1092.87 s [algebraic-graphs]
  19243. 1092.87 s [algebraic-graphs] ============ Graph.postIntSet ============
  19244. 1092.87 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  19245. 1092.87 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  19246. 1092.87 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  19247. 1092.87 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  19248. 1092.87 s [algebraic-graphs]
  19249. 1092.87 s [algebraic-graphs] ============ Graph.size ============
  19250. 1092.87 s [algebraic-graphs] OK: size empty == 1
  19251. 1092.87 s [algebraic-graphs] OK: size (vertex x) == 1
  19252. 1092.87 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19253. 1092.87 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19254. 1092.87 s [algebraic-graphs] OK: size x >= 1
  19255. 1092.87 s [algebraic-graphs] OK: size x >= vertexCount x
  19256. 1092.87 s [algebraic-graphs]
  19257. 1092.87 s [algebraic-graphs] ============ Graph.path ============
  19258. 1092.87 s [algebraic-graphs] OK: path [] == empty
  19259. 1092.87 s [algebraic-graphs] OK: path [x] == vertex x
  19260. 1092.87 s [algebraic-graphs] OK: path [x,y] == edge x y
  19261. 1092.87 s [algebraic-graphs]
  19262. 1092.87 s [algebraic-graphs] ============ Graph.circuit ============
  19263. 1092.87 s [algebraic-graphs] OK: circuit [] == empty
  19264. 1092.87 s [algebraic-graphs] OK: circuit [x] == edge x x
  19265. 1092.87 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  19266. 1092.87 s [algebraic-graphs]
  19267. 1092.87 s [algebraic-graphs] ============ Graph.clique ============
  19268. 1092.87 s [algebraic-graphs] OK: clique [] == empty
  19269. 1092.87 s [algebraic-graphs] OK: clique [x] == vertex x
  19270. 1092.87 s [algebraic-graphs] OK: clique [x,y] == edge x y
  19271. 1092.87 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  19272. 1092.87 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  19273. 1092.87 s [algebraic-graphs]
  19274. 1092.87 s [algebraic-graphs] ============ Graph.biclique ============
  19275. 1092.87 s [algebraic-graphs] OK: biclique [] [] == empty
  19276. 1092.87 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  19277. 1092.87 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  19278. 1092.87 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19279. 1092.87 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  19280. 1092.87 s [algebraic-graphs]
  19281. 1092.87 s [algebraic-graphs] ============ Graph.star ============
  19282. 1092.87 s [algebraic-graphs] OK: star x [] == vertex x
  19283. 1092.87 s [algebraic-graphs] OK: star x [y] == edge x y
  19284. 1092.87 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19285. 1092.87 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  19286. 1092.87 s [algebraic-graphs]
  19287. 1092.87 s [algebraic-graphs] ============ Graph.stars ============
  19288. 1092.87 s [algebraic-graphs] OK: stars [] == empty
  19289. 1092.87 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  19290. 1092.87 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  19291. 1092.87 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  19292. 1092.87 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  19293. 1092.87 s [algebraic-graphs] OK: stars . adjacencyList == id
  19294. 1092.87 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  19295. 1092.87 s [algebraic-graphs]
  19296. 1092.87 s [algebraic-graphs] ============ Graph.tree ============
  19297. 1092.87 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19298. 1092.87 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  19299. 1092.87 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19300. 1092.87 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  19301. 1092.87 s [algebraic-graphs]
  19302. 1092.87 s [algebraic-graphs] ============ Graph.forest ============
  19303. 1092.87 s [algebraic-graphs] OK: forest [] == empty
  19304. 1092.87 s [algebraic-graphs] OK: forest [x] == tree x
  19305. 1092.87 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  19306. 1092.87 s [algebraic-graphs] OK: forest == overlays . map tree
  19307. 1092.87 s [algebraic-graphs]
  19308. 1092.87 s [algebraic-graphs] ============ Graph.removeVertex ============
  19309. 1098.54 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19310. 1098.54 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19311. 1098.54 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  19312. 1098.55 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  19313. 1098.55 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19314. 1098.55 s [algebraic-graphs]
  19315. 1098.55 s [algebraic-graphs] ============ Graph.removeEdge ============
  19316. 1098.55 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  19317. 1098.55 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19318. 1098.55 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19319. 1098.55 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19320. 1098.55 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19321. 1098.55 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  19322. 1098.55 s [algebraic-graphs]
  19323. 1098.55 s [algebraic-graphs] ============ Graph.replaceVertex ============
  19324. 1098.55 s [algebraic-graphs] OK: replaceVertex x x == id
  19325. 1098.55 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19326. 1098.55 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19327. 1098.55 s [algebraic-graphs]
  19328. 1098.55 s [algebraic-graphs] ============ Graph.mergeVertices ============
  19329. 1098.55 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19330. 1098.55 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19331. 1098.55 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19332. 1098.55 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19333. 1098.55 s [algebraic-graphs]
  19334. 1098.55 s [algebraic-graphs] ============ Graph.transpose ============
  19335. 1098.55 s [algebraic-graphs] OK: transpose empty == empty
  19336. 1098.55 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19337. 1098.55 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19338. 1098.55 s [algebraic-graphs] OK: transpose . transpose == id
  19339. 1098.55 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19340. 1098.55 s [algebraic-graphs]
  19341. 1098.55 s [algebraic-graphs] ============ Graph.gmap ============
  19342. 1098.55 s [algebraic-graphs] OK: gmap f empty == empty
  19343. 1098.55 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19344. 1098.55 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19345. 1098.55 s [algebraic-graphs] OK: gmap id == id
  19346. 1098.55 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19347. 1098.55 s [algebraic-graphs]
  19348. 1098.55 s [algebraic-graphs] ============ Graph.induce ============
  19349. 1098.55 s [algebraic-graphs] OK: induce (const True ) x == x
  19350. 1098.55 s [algebraic-graphs] OK: induce (const False) x == empty
  19351. 1098.55 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19352. 1098.55 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19353. 1098.55 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19354. 1098.56 s [algebraic-graphs]
  19355. 1098.56 s [algebraic-graphs] ============ Graph.induceJust ============
  19356. 1098.56 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19357. 1098.56 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19358. 1098.56 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19359. 1098.56 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19360. 1098.56 s [algebraic-graphs]
  19361. 1098.56 s [algebraic-graphs] ============ Graph.compose ============
  19362. 1098.56 s [algebraic-graphs] OK: compose empty x == empty
  19363. 1098.56 s [algebraic-graphs] OK: compose x empty == empty
  19364. 1098.56 s [algebraic-graphs] OK: compose (vertex x) y == empty
  19365. 1098.56 s [algebraic-graphs] OK: compose x (vertex y) == empty
  19366. 1098.56 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  19367. 1098.56 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  19368. 1098.56 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  19369. 1098.56 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  19370. 1098.56 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  19371. 1098.56 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  19372. 1098.56 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  19373. 1098.56 s [algebraic-graphs]
  19374. 1098.56 s [algebraic-graphs] ============ Graph.(===) ============
  19375. 1098.56 s [algebraic-graphs] OK: x === x == True
  19376. 1098.56 s [algebraic-graphs] OK: x === x + empty == False
  19377. 1098.56 s [algebraic-graphs] OK: x + y === x + y == True
  19378. 1098.56 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  19379. 1098.56 s [algebraic-graphs] OK: x + y === x * y == False
  19380. 1098.56 s [algebraic-graphs]
  19381. 1098.56 s [algebraic-graphs] ============ Graph.mesh ============
  19382. 1098.56 s [algebraic-graphs] OK: mesh xs [] == empty
  19383. 1098.56 s [algebraic-graphs] OK: mesh [] ys == empty
  19384. 1098.56 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  19385. 1098.56 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  19386. 1098.56 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  19387. 1098.56 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  19388. 1098.56 s [algebraic-graphs]
  19389. 1098.56 s [algebraic-graphs] ============ Graph.torus ============
  19390. 1098.56 s [algebraic-graphs] OK: torus xs [] == empty
  19391. 1098.56 s [algebraic-graphs] OK: torus [] ys == empty
  19392. 1098.56 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  19393. 1098.56 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  19394. 1098.56 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  19395. 1098.56 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  19396. 1098.56 s [algebraic-graphs]
  19397. 1098.56 s [algebraic-graphs] ============ Graph.deBruijn ============
  19398. 1098.56 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  19399. 1098.56 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  19400. 1098.56 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  19401. 1098.56 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  19402. 1098.56 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  19403. 1098.56 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  19404. 1098.56 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  19405. 1098.56 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  19406. 1098.56 s [algebraic-graphs]
  19407. 1098.56 s [algebraic-graphs] ============ Graph.splitVertex ============
  19408. 1098.56 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  19409. 1098.56 s [algebraic-graphs] OK: splitVertex x [x] == id
  19410. 1098.56 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  19411. 1098.56 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  19412. 1098.56 s [algebraic-graphs]
  19413. 1098.56 s [algebraic-graphs] ============ Graph.bind ============
  19414. 1098.56 s [algebraic-graphs] OK: bind empty f == empty
  19415. 1098.56 s [algebraic-graphs] OK: bind (vertex x) f == f x
  19416. 1098.56 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  19417. 1098.56 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  19418. 1098.56 s [algebraic-graphs] OK: bind x (const empty) == empty
  19419. 1098.56 s [algebraic-graphs] OK: bind x vertex == x
  19420. 1098.56 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  19421. 1098.56 s [algebraic-graphs]
  19422. 1098.56 s [algebraic-graphs] ============ Graph.simplify ============
  19423. 1098.56 s [algebraic-graphs] OK: simplify == id
  19424. 1098.56 s [algebraic-graphs] OK: size (simplify x) <= size x
  19425. 1098.56 s [algebraic-graphs]
  19426. 1098.56 s [algebraic-graphs] ============ Graph.box ============
  19427. 1098.56 s [algebraic-graphs] OK: box x y ~~ box y x
  19428. 1098.56 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  19429. 1098.56 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19430. 1098.56 s [algebraic-graphs] OK: box x empty ~~ empty
  19431. 1098.56 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19432. 1098.56 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19433. 1098.56 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19434. 1098.56 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19435. 1098.56 s [algebraic-graphs]
  19436. 1098.56 s [algebraic-graphs] ============ Graph.sparsify ============
  19437. 1098.56 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  19438. 1098.56 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  19439. 1098.56 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  19440. 1098.56 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  19441. 1098.56 s [algebraic-graphs]
  19442. 1098.56 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  19443. 1098.56 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  19444. 1098.56 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  19445. 1098.56 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  19446. 1098.56 s [algebraic-graphs]
  19447. 1098.56 s [algebraic-graphs] ============ Graph.context ============
  19448. 1098.56 s [algebraic-graphs] OK: context (const False) x == Nothing
  19449. 1098.56 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  19450. 1098.56 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  19451. 1098.56 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  19452. 1098.56 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  19453. 1098.56 s [algebraic-graphs]
  19454. 1098.56 s [algebraic-graphs] ============ Graph.buildg ============
  19455. 1098.56 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  19456. 1098.56 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  19457. 1098.56 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
  19458. 1098.56 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
  19459. 1098.56 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  19460. 1098.56 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  19461. 1098.56 s [algebraic-graphs]
  19462. 1098.56 s [algebraic-graphs] ============ Internal.List ============
  19463. 1098.56 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  19464. 1098.56 s [algebraic-graphs]
  19465. 1098.56 s [algebraic-graphs] ============ Graph.Label ============
  19466. 1098.56 s [algebraic-graphs]
  19467. 1098.56 s [algebraic-graphs] ============ Any: instances ============
  19468. 1098.56 s [algebraic-graphs] OK: Semiring
  19469. 1098.56 s [algebraic-graphs] OK: StarSemiring
  19470. 1098.56 s [algebraic-graphs] OK: Dioid
  19471. 1098.56 s [algebraic-graphs]
  19472. 1098.56 s [algebraic-graphs] ============ Distance Int: instances ============
  19473. 1098.56 s [algebraic-graphs] OK: Semiring
  19474. 1098.56 s [algebraic-graphs] OK: StarSemiring
  19475. 1098.56 s [algebraic-graphs] OK: Dioid
  19476. 1098.56 s [algebraic-graphs]
  19477. 1098.56 s [algebraic-graphs] ============ Capacity Int: instances ============
  19478. 1098.56 s [algebraic-graphs] OK: Semiring
  19479. 1098.56 s [algebraic-graphs] OK: StarSemiring
  19480. 1098.56 s [algebraic-graphs] OK: Dioid
  19481. 1098.56 s [algebraic-graphs]
  19482. 1098.56 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  19483. 1098.56 s [algebraic-graphs] OK: LeftNearRing
  19484. 1098.56 s [algebraic-graphs]
  19485. 1098.56 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  19486. 1098.56 s [algebraic-graphs] OK: Semiring
  19487. 1098.56 s [algebraic-graphs] OK: Dioid
  19488. 1098.56 s [algebraic-graphs]
  19489. 1098.56 s [algebraic-graphs] ============ Count Int: instances ============
  19490. 1098.56 s [algebraic-graphs] OK: Semiring
  19491. 1098.56 s [algebraic-graphs] OK: StarSemiring
  19492. 1098.56 s [algebraic-graphs]
  19493. 1098.56 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  19494. 1098.56 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  19495. 1098.56 s [algebraic-graphs] OK: empty
  19496. 1098.56 s [algebraic-graphs] OK: vertex
  19497. 1098.56 s [algebraic-graphs] OK: edge
  19498. 1098.56 s [algebraic-graphs] OK: overlay
  19499. 1098.56 s [algebraic-graphs] OK: connect
  19500. 1098.56 s [algebraic-graphs] OK: vertices
  19501. 1098.56 s [algebraic-graphs] OK: edges
  19502. 1098.56 s [algebraic-graphs] OK: overlays
  19503. 1098.56 s [algebraic-graphs] OK: fromAdjacencyMaps
  19504. 1098.56 s [algebraic-graphs] OK: removeVertex
  19505. 1098.56 s [algebraic-graphs] OK: removeEdge
  19506. 1098.56 s [algebraic-graphs] OK: replaceVertex
  19507. 1098.56 s [algebraic-graphs] OK: replaceEdge
  19508. 1098.56 s [algebraic-graphs] OK: transpose
  19509. 1098.56 s [algebraic-graphs] OK: gmap
  19510. 1098.56 s [algebraic-graphs] OK: emap
  19511. 1098.56 s [algebraic-graphs] OK: induce
  19512. 1098.56 s [algebraic-graphs] OK: closure
  19513. 1098.56 s [algebraic-graphs] OK: reflexiveClosure
  19514. 1098.56 s [algebraic-graphs] OK: symmetricClosure
  19515. 1098.56 s [algebraic-graphs] OK: transitiveClosure
  19516. 1098.56 s [algebraic-graphs]
  19517. 1098.56 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  19518. 1098.56 s [algebraic-graphs] OK: isEmpty empty == True
  19519. 1098.56 s [algebraic-graphs] OK: hasVertex x empty == False
  19520. 1098.56 s [algebraic-graphs] OK: vertexCount empty == 0
  19521. 1098.56 s [algebraic-graphs] OK: edgeCount empty == 0
  19522. 1098.56 s [algebraic-graphs]
  19523. 1098.56 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  19524. 1098.56 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19525. 1098.56 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19526. 1098.56 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19527. 1098.56 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19528. 1098.56 s [algebraic-graphs]
  19529. 1102.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  19530. 1102.40 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19531. 1102.40 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19532. 1102.40 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19533. 1102.40 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19534. 1102.40 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19535. 1102.40 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19536. 1102.40 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19537. 1102.40 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19538. 1102.40 s [algebraic-graphs]
  19539. 1102.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  19540. 1102.40 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19541. 1102.40 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19542. 1102.40 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19543. 1102.40 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19544. 1102.40 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19545. 1102.40 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19546. 1102.40 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19547. 1102.40 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19548. 1102.40 s [algebraic-graphs]
  19549. 1102.40 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19550. 1102.40 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19551. 1102.40 s [algebraic-graphs]
  19552. 1102.40 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19553. 1102.40 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19554. 1102.40 s [algebraic-graphs]
  19555. 1102.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  19556. 1102.40 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19557. 1102.40 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19558. 1102.40 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19559. 1102.40 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19560. 1102.40 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19561. 1102.40 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19562. 1102.40 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19563. 1102.40 s [algebraic-graphs]
  19564. 1102.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  19565. 1102.40 s [algebraic-graphs] OK: vertices [] == empty
  19566. 1102.40 s [algebraic-graphs] OK: vertices [x] == vertex x
  19567. 1102.40 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19568. 1102.40 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19569. 1102.40 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19570. 1102.40 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19571. 1102.40 s [algebraic-graphs]
  19572. 1102.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  19573. 1102.40 s [algebraic-graphs] OK: edges [] == empty
  19574. 1102.40 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19575. 1102.40 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19576. 1102.40 s [algebraic-graphs]
  19577. 1102.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  19578. 1102.40 s [algebraic-graphs] OK: overlays [] == empty
  19579. 1102.40 s [algebraic-graphs] OK: overlays [x] == x
  19580. 1102.40 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19581. 1102.40 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19582. 1102.40 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19583. 1102.40 s [algebraic-graphs]
  19584. 1102.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  19585. 1102.40 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  19586. 1102.40 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  19587. 1102.40 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  19588. 1102.40 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  19589. 1102.40 s [algebraic-graphs]
  19590. 1102.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  19591. 1102.40 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19592. 1102.40 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19593. 1102.40 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19594. 1102.40 s [algebraic-graphs]
  19595. 1102.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  19596. 1102.40 s [algebraic-graphs] OK: isEmpty empty == True
  19597. 1102.41 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19598. 1102.41 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19599. 1102.41 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19600. 1102.41 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19601. 1102.41 s [algebraic-graphs]
  19602. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  19603. 1102.41 s [algebraic-graphs] OK: hasVertex x empty == False
  19604. 1102.41 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19605. 1102.41 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19606. 1102.41 s [algebraic-graphs]
  19607. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  19608. 1102.41 s [algebraic-graphs] OK: hasEdge x y empty == False
  19609. 1102.41 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19610. 1102.41 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19611. 1102.41 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19612. 1102.41 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19613. 1102.41 s [algebraic-graphs]
  19614. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  19615. 1102.41 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19616. 1102.41 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19617. 1102.41 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19618. 1102.41 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19619. 1102.41 s [algebraic-graphs]
  19620. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  19621. 1102.41 s [algebraic-graphs] OK: vertexCount empty == 0
  19622. 1102.41 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19623. 1102.41 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19624. 1102.41 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19625. 1102.41 s [algebraic-graphs]
  19626. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  19627. 1102.41 s [algebraic-graphs] OK: edgeCount empty == 0
  19628. 1102.41 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19629. 1102.41 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19630. 1102.41 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19631. 1102.41 s [algebraic-graphs]
  19632. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  19633. 1102.41 s [algebraic-graphs] OK: vertexList empty == []
  19634. 1102.41 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19635. 1102.41 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19636. 1102.41 s [algebraic-graphs]
  19637. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  19638. 1102.41 s [algebraic-graphs] OK: edgeList empty == []
  19639. 1102.41 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19640. 1102.41 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19641. 1102.41 s [algebraic-graphs]
  19642. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  19643. 1102.41 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19644. 1102.41 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19645. 1102.41 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19646. 1102.41 s [algebraic-graphs]
  19647. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  19648. 1102.41 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19649. 1102.41 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19650. 1102.41 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19651. 1102.41 s [algebraic-graphs]
  19652. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  19653. 1102.41 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19654. 1102.41 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19655. 1102.41 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19656. 1102.41 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19657. 1102.41 s [algebraic-graphs]
  19658. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  19659. 1102.41 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19660. 1102.41 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19661. 1102.41 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19662. 1102.41 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19663. 1102.41 s [algebraic-graphs]
  19664. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  19665. 1102.41 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  19666. 1102.41 s [algebraic-graphs]
  19667. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  19668. 1102.41 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19669. 1102.41 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19670. 1102.41 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19671. 1102.41 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19672. 1102.41 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19673. 1102.41 s [algebraic-graphs]
  19674. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  19675. 1102.41 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19676. 1102.41 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19677. 1102.41 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19678. 1102.41 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19679. 1102.41 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19680. 1102.41 s [algebraic-graphs]
  19681. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  19682. 1102.41 s [algebraic-graphs] OK: replaceVertex x x == id
  19683. 1102.41 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19684. 1102.41 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  19685. 1102.41 s [algebraic-graphs]
  19686. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  19687. 1102.41 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19688. 1102.41 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19689. 1102.41 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19690. 1102.41 s [algebraic-graphs]
  19691. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  19692. 1102.41 s [algebraic-graphs] OK: transpose empty == empty
  19693. 1102.41 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19694. 1102.41 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19695. 1102.41 s [algebraic-graphs] OK: transpose . transpose == id
  19696. 1102.41 s [algebraic-graphs]
  19697. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  19698. 1102.41 s [algebraic-graphs] OK: gmap f empty == empty
  19699. 1102.41 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19700. 1102.41 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  19701. 1102.41 s [algebraic-graphs] OK: gmap id == id
  19702. 1102.41 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19703. 1102.41 s [algebraic-graphs]
  19704. 1102.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  19705. 1102.41 s [algebraic-graphs] OK: emap h empty == empty
  19706. 1102.41 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19707. 1102.41 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19708. 1102.41 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19709. 1102.41 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19710. 1102.41 s [algebraic-graphs] OK: emap id == id
  19711. 1102.41 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19712. 1102.41 s [algebraic-graphs]
  19713. 1102.42 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  19714. 1102.42 s [algebraic-graphs] OK: induce (const True ) x == x
  19715. 1102.42 s [algebraic-graphs] OK: induce (const False) x == empty
  19716. 1102.42 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19717. 1102.42 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19718. 1102.42 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19719. 1102.42 s [algebraic-graphs]
  19720. 1102.42 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  19721. 1103.90 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19722. 1103.90 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19723. 1103.95 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19724. 1103.95 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19725. 1103.95 s [algebraic-graphs]
  19726. 1103.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  19727. 1103.95 s [algebraic-graphs] OK: closure empty == empty
  19728. 1103.95 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19729. 1103.95 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19730. 1103.95 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19731. 1103.95 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19732. 1103.95 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19733. 1103.95 s [algebraic-graphs] OK: closure . closure == closure
  19734. 1103.95 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19735. 1103.95 s [algebraic-graphs]
  19736. 1103.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  19737. 1103.95 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19738. 1103.95 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19739. 1103.95 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19740. 1103.95 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19741. 1103.95 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19742. 1103.95 s [algebraic-graphs]
  19743. 1103.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  19744. 1103.95 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19745. 1103.95 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19746. 1103.95 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19747. 1103.95 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19748. 1103.95 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19749. 1103.95 s [algebraic-graphs]
  19750. 1103.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  19751. 1103.95 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19752. 1103.95 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19753. 1103.95 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19754. 1103.95 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19755. 1103.95 s [algebraic-graphs]
  19756. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  19757. 1103.95 s [algebraic-graphs] OK: isEmpty empty == True
  19758. 1103.95 s [algebraic-graphs] OK: hasVertex x empty == False
  19759. 1103.95 s [algebraic-graphs] OK: vertexCount empty == 0
  19760. 1103.95 s [algebraic-graphs] OK: edgeCount empty == 0
  19761. 1103.95 s [algebraic-graphs]
  19762. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  19763. 1103.95 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19764. 1103.95 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19765. 1103.95 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19766. 1103.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19767. 1103.95 s [algebraic-graphs]
  19768. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  19769. 1103.95 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19770. 1103.95 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19771. 1103.95 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19772. 1103.95 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19773. 1103.95 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19774. 1103.95 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19775. 1103.95 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19776. 1103.95 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19777. 1103.95 s [algebraic-graphs]
  19778. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  19779. 1103.95 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19780. 1103.95 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19781. 1103.95 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19782. 1103.95 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19783. 1103.95 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19784. 1103.95 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19785. 1103.95 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19786. 1103.95 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19787. 1103.95 s [algebraic-graphs]
  19788. 1103.95 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19789. 1103.95 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19790. 1103.95 s [algebraic-graphs]
  19791. 1103.95 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19792. 1103.95 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19793. 1103.95 s [algebraic-graphs]
  19794. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  19795. 1103.95 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19796. 1103.95 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19797. 1103.95 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19798. 1103.95 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19799. 1103.95 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19800. 1103.95 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19801. 1103.95 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19802. 1103.95 s [algebraic-graphs]
  19803. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  19804. 1103.95 s [algebraic-graphs] OK: vertices [] == empty
  19805. 1103.95 s [algebraic-graphs] OK: vertices [x] == vertex x
  19806. 1103.95 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19807. 1103.95 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19808. 1103.95 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19809. 1103.95 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19810. 1103.95 s [algebraic-graphs]
  19811. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  19812. 1103.95 s [algebraic-graphs] OK: edges [] == empty
  19813. 1103.95 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19814. 1103.95 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19815. 1103.95 s [algebraic-graphs]
  19816. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  19817. 1103.95 s [algebraic-graphs] OK: overlays [] == empty
  19818. 1103.95 s [algebraic-graphs] OK: overlays [x] == x
  19819. 1103.95 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19820. 1103.95 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19821. 1103.95 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19822. 1103.95 s [algebraic-graphs]
  19823. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  19824. 1103.95 s [algebraic-graphs] OK: foldg empty vertex connect == id
  19825. 1103.95 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  19826. 1103.95 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  19827. 1103.95 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  19828. 1103.95 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  19829. 1103.95 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  19830. 1103.95 s [algebraic-graphs]
  19831. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  19832. 1103.95 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  19833. 1103.95 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  19834. 1103.95 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  19835. 1103.95 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  19836. 1103.95 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  19837. 1103.95 s [algebraic-graphs]
  19838. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  19839. 1103.95 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19840. 1103.95 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19841. 1103.95 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19842. 1103.95 s [algebraic-graphs]
  19843. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  19844. 1103.95 s [algebraic-graphs] OK: isEmpty empty == True
  19845. 1103.95 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19846. 1103.95 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19847. 1103.95 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19848. 1103.95 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19849. 1103.95 s [algebraic-graphs]
  19850. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.size ============
  19851. 1103.95 s [algebraic-graphs] OK: size empty == 1
  19852. 1103.95 s [algebraic-graphs] OK: size (vertex x) == 1
  19853. 1103.95 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19854. 1103.95 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19855. 1103.95 s [algebraic-graphs] OK: size x >= 1
  19856. 1103.95 s [algebraic-graphs] OK: size x >= vertexCount x
  19857. 1103.95 s [algebraic-graphs]
  19858. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  19859. 1103.95 s [algebraic-graphs] OK: hasVertex x empty == False
  19860. 1103.95 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19861. 1103.95 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19862. 1103.95 s [algebraic-graphs]
  19863. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  19864. 1103.95 s [algebraic-graphs] OK: hasEdge x y empty == False
  19865. 1103.95 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19866. 1103.95 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19867. 1103.95 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19868. 1103.95 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19869. 1103.95 s [algebraic-graphs]
  19870. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  19871. 1103.95 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19872. 1103.95 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19873. 1103.95 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19874. 1103.95 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19875. 1103.95 s [algebraic-graphs]
  19876. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  19877. 1103.95 s [algebraic-graphs] OK: vertexCount empty == 0
  19878. 1103.95 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19879. 1103.95 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19880. 1103.95 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19881. 1103.95 s [algebraic-graphs]
  19882. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  19883. 1103.95 s [algebraic-graphs] OK: edgeCount empty == 0
  19884. 1103.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19885. 1103.95 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19886. 1103.95 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19887. 1103.95 s [algebraic-graphs]
  19888. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  19889. 1103.95 s [algebraic-graphs] OK: vertexList empty == []
  19890. 1103.95 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19891. 1103.95 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19892. 1103.95 s [algebraic-graphs]
  19893. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  19894. 1103.95 s [algebraic-graphs] OK: edgeList empty == []
  19895. 1103.95 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19896. 1103.95 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19897. 1103.95 s [algebraic-graphs]
  19898. 1103.95 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  19899. 1103.96 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19900. 1103.96 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19901. 1103.96 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19902. 1103.96 s [algebraic-graphs]
  19903. 1103.96 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  19904. 1103.96 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19905. 1103.96 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19906. 1103.96 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19907. 1103.96 s [algebraic-graphs]
  19908. 1103.96 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  19909. 1103.96 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19910. 1103.96 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19911. 1107.47 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19912. 1107.47 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19913. 1107.47 s [algebraic-graphs]
  19914. 1107.47 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  19915. 1107.47 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19916. 1107.47 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19917. 1107.47 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19918. 1107.47 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19919. 1107.47 s [algebraic-graphs]
  19920. 1107.47 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  19921. 1107.47 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19922. 1107.47 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19923. 1107.47 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19924. 1107.47 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19925. 1107.47 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19926. 1107.47 s [algebraic-graphs]
  19927. 1107.47 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  19928. 1107.47 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19929. 1107.47 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19930. 1107.47 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19931. 1107.47 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19932. 1107.47 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19933. 1107.47 s [algebraic-graphs]
  19934. 1107.47 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  19935. 1107.47 s [algebraic-graphs] OK: replaceVertex x x == id
  19936. 1107.47 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19937. 1107.47 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  19938. 1107.47 s [algebraic-graphs]
  19939. 1107.47 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  19940. 1107.47 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19941. 1107.47 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19942. 1107.47 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19943. 1107.47 s [algebraic-graphs]
  19944. 1107.47 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  19945. 1107.47 s [algebraic-graphs] OK: transpose empty == empty
  19946. 1107.47 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19947. 1107.47 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19948. 1107.47 s [algebraic-graphs] OK: transpose . transpose == id
  19949. 1107.47 s [algebraic-graphs]
  19950. 1107.47 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  19951. 1107.47 s [algebraic-graphs] OK: fmap f empty == empty
  19952. 1107.47 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  19953. 1107.47 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  19954. 1107.47 s [algebraic-graphs] OK: fmap id == id
  19955. 1107.47 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19956. 1107.47 s [algebraic-graphs]
  19957. 1107.47 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  19958. 1107.48 s [algebraic-graphs] OK: emap h empty == empty
  19959. 1107.48 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19960. 1107.48 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19961. 1107.48 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19962. 1107.48 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19963. 1107.48 s [algebraic-graphs] OK: emap id == id
  19964. 1107.48 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19965. 1107.48 s [algebraic-graphs]
  19966. 1107.48 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  19967. 1107.48 s [algebraic-graphs] OK: induce (const True ) x == x
  19968. 1107.48 s [algebraic-graphs] OK: induce (const False) x == empty
  19969. 1107.48 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19970. 1107.48 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19971. 1107.48 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19972. 1107.48 s [algebraic-graphs]
  19973. 1107.48 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  19974. 1107.48 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19975. 1107.48 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19976. 1107.48 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19977. 1107.48 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19978. 1107.48 s [algebraic-graphs]
  19979. 1107.48 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  19980. 1107.48 s [algebraic-graphs] OK: closure empty == empty
  19981. 1107.48 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19982. 1107.48 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19983. 1107.48 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19984. 1107.48 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19985. 1107.48 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19986. 1107.48 s [algebraic-graphs] OK: closure . closure == closure
  19987. 1107.48 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19988. 1107.48 s [algebraic-graphs]
  19989. 1107.48 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  19990. 1107.48 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19991. 1107.48 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19992. 1107.48 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19993. 1107.48 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19994. 1107.48 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19995. 1107.48 s [algebraic-graphs]
  19996. 1107.48 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  19997. 1107.48 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19998. 1107.48 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19999. 1107.48 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  20000. 1107.48 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20001. 1107.48 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20002. 1107.48 s [algebraic-graphs]
  20003. 1107.48 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  20004. 1107.48 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20005. 1107.48 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20006. 1107.48 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  20007. 1107.48 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20008. 1107.48 s [algebraic-graphs]
  20009. 1107.48 s [algebraic-graphs] ============ Labelled.Graph.context ============
  20010. 1107.48 s [algebraic-graphs] OK: context (const False) x == Nothing
  20011. 1107.48 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  20012. 1107.48 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  20013. 1107.48 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  20014. 1107.48 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  20015. 1107.48 s [algebraic-graphs]
  20016. 1107.48 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  20017. 1107.48 s [algebraic-graphs] OK: Axioms of non-empty graphs
  20018. 1107.48 s [algebraic-graphs] OK: Theorems of non-empty graphs
  20019. 1107.48 s [algebraic-graphs]
  20020. 1107.48 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  20021. 1107.48 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20022. 1107.48 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20023. 1107.48 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20024. 1107.48 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20025. 1107.48 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20026. 1107.48 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20027. 1107.48 s [algebraic-graphs] OK: x <= x + y
  20028. 1107.48 s [algebraic-graphs] OK: x + y <= x * y
  20029. 1107.48 s [algebraic-graphs]
  20030. 1107.48 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  20031. 1107.48 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  20032. 1107.48 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  20033. 1107.48 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  20034. 1107.48 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  20035. 1107.48 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  20036. 1107.48 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  20037. 1107.48 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  20038. 1107.48 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  20039. 1107.48 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  20040. 1107.48 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  20041. 1107.48 s [algebraic-graphs]
  20042. 1107.48 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  20043. 1107.48 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  20044. 1107.48 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  20045. 1107.48 s [algebraic-graphs]
  20046. 1107.48 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  20047. 1107.48 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  20048. 1107.48 s [algebraic-graphs]
  20049. 1107.48 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  20050. 1107.48 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20051. 1107.48 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20052. 1107.48 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20053. 1107.48 s [algebraic-graphs]
  20054. 1107.48 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  20055. 1107.48 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20056. 1107.48 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20057. 1107.48 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20058. 1107.48 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20059. 1107.48 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20060. 1107.48 s [algebraic-graphs]
  20061. 1107.48 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  20062. 1107.48 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20063. 1107.48 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20064. 1107.48 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20065. 1107.48 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20066. 1107.48 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20067. 1107.48 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20068. 1107.48 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20069. 1107.48 s [algebraic-graphs]
  20070. 1107.48 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  20071. 1107.48 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20072. 1107.48 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20073. 1107.48 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20074. 1107.48 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20075. 1107.48 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20076. 1107.48 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20077. 1107.48 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20078. 1107.48 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20079. 1107.48 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20080. 1107.48 s [algebraic-graphs]
  20081. 1107.48 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  20082. 1107.48 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  20083. 1107.48 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  20084. 1107.48 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  20085. 1107.48 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20086. 1107.48 s [algebraic-graphs]
  20087. 1107.48 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  20088. 1107.48 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  20089. 1107.48 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  20090. 1107.48 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  20091. 1107.49 s [algebraic-graphs]
  20092. 1111.32 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  20093. 1111.32 s [algebraic-graphs] OK: overlays1 [x] == x
  20094. 1111.37 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  20095. 1111.37 s [algebraic-graphs]
  20096. 1111.37 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  20097. 1111.37 s [algebraic-graphs] OK: connects1 [x] == x
  20098. 1111.37 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  20099. 1111.37 s [algebraic-graphs]
  20100. 1111.37 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  20101. 1111.37 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20102. 1111.37 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20103. 1111.37 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  20104. 1111.37 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20105. 1111.37 s [algebraic-graphs]
  20106. 1111.37 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  20107. 1111.37 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20108. 1111.37 s [algebraic-graphs]
  20109. 1111.37 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  20110. 1111.37 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20111. 1111.37 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20112. 1111.37 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20113. 1111.37 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20114. 1111.37 s [algebraic-graphs]
  20115. 1111.37 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  20116. 1111.37 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20117. 1111.37 s [algebraic-graphs] OK: vertexCount x >= 1
  20118. 1111.37 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  20119. 1111.37 s [algebraic-graphs]
  20120. 1111.37 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  20121. 1111.37 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20122. 1111.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20123. 1111.38 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20124. 1111.38 s [algebraic-graphs]
  20125. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  20126. 1111.38 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  20127. 1111.38 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  20128. 1111.38 s [algebraic-graphs]
  20129. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  20130. 1111.38 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20131. 1111.38 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20132. 1111.38 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20133. 1111.38 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  20134. 1111.38 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20135. 1111.38 s [algebraic-graphs]
  20136. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  20137. 1111.38 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20138. 1111.38 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20139. 1111.38 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  20140. 1111.38 s [algebraic-graphs]
  20141. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  20142. 1111.38 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20143. 1111.38 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20144. 1111.38 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  20145. 1111.38 s [algebraic-graphs]
  20146. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  20147. 1111.38 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20148. 1111.38 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20149. 1111.38 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20150. 1111.38 s [algebraic-graphs]
  20151. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  20152. 1111.38 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20153. 1111.38 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20154. 1111.38 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20155. 1111.38 s [algebraic-graphs]
  20156. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  20157. 1111.38 s [algebraic-graphs] OK: path1 [x] == vertex x
  20158. 1111.38 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  20159. 1111.38 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  20160. 1111.38 s [algebraic-graphs]
  20161. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  20162. 1111.38 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  20163. 1111.38 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  20164. 1111.38 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  20165. 1111.38 s [algebraic-graphs]
  20166. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  20167. 1111.38 s [algebraic-graphs] OK: clique1 [x] == vertex x
  20168. 1111.38 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  20169. 1111.38 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  20170. 1111.38 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  20171. 1111.38 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  20172. 1111.38 s [algebraic-graphs]
  20173. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  20174. 1111.38 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20175. 1111.38 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  20176. 1111.38 s [algebraic-graphs]
  20177. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  20178. 1111.38 s [algebraic-graphs] OK: star x [] == vertex x
  20179. 1111.38 s [algebraic-graphs] OK: star x [y] == edge x y
  20180. 1111.38 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  20181. 1111.38 s [algebraic-graphs]
  20182. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  20183. 1111.38 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20184. 1111.38 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20185. 1111.38 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20186. 1111.38 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20187. 1111.38 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20188. 1111.38 s [algebraic-graphs]
  20189. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  20190. 1111.38 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20191. 1111.38 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20192. 1111.38 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20193. 1111.38 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20194. 1111.38 s [algebraic-graphs]
  20195. 1111.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  20196. 1111.38 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20197. 1111.39 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20198. 1111.39 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20199. 1111.39 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20200. 1111.39 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20201. 1111.39 s [algebraic-graphs]
  20202. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  20203. 1111.39 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20204. 1111.39 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20205. 1111.39 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20206. 1111.39 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20207. 1111.39 s [algebraic-graphs]
  20208. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  20209. 1111.39 s [algebraic-graphs] OK: replaceVertex x x == id
  20210. 1111.39 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20211. 1111.39 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20212. 1111.39 s [algebraic-graphs]
  20213. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  20214. 1111.39 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20215. 1111.39 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20216. 1111.39 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20217. 1111.39 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20218. 1111.39 s [algebraic-graphs]
  20219. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  20220. 1111.39 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20221. 1111.39 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20222. 1111.39 s [algebraic-graphs] OK: transpose . transpose == id
  20223. 1111.39 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20224. 1111.39 s [algebraic-graphs]
  20225. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  20226. 1111.39 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20227. 1111.39 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20228. 1111.39 s [algebraic-graphs] OK: gmap id == id
  20229. 1111.39 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20230. 1111.39 s [algebraic-graphs]
  20231. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  20232. 1111.39 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20233. 1111.39 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20234. 1111.39 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20235. 1111.39 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20236. 1111.39 s [algebraic-graphs]
  20237. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  20238. 1111.39 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20239. 1111.39 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20240. 1111.39 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  20241. 1111.39 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  20242. 1111.39 s [algebraic-graphs]
  20243. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  20244. 1111.39 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20245. 1111.39 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20246. 1111.39 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  20247. 1111.39 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  20248. 1111.39 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20249. 1111.39 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20250. 1111.39 s [algebraic-graphs] OK: closure . closure == closure
  20251. 1111.39 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20252. 1111.39 s [algebraic-graphs]
  20253. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  20254. 1111.39 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20255. 1111.39 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20256. 1111.39 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  20257. 1111.39 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20258. 1111.39 s [algebraic-graphs]
  20259. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  20260. 1111.39 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20261. 1111.39 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  20262. 1111.39 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20263. 1111.39 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20264. 1111.39 s [algebraic-graphs]
  20265. 1111.39 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  20266. 1111.39 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20267. 1111.39 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20268. 1111.39 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  20269. 1111.39 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20270. 1111.39 s [algebraic-graphs]
  20271. 1111.39 s [algebraic-graphs] ============ NonEmpty.Graph.============
  20272. 1111.39 s [algebraic-graphs] OK: Axioms of non-empty graphs
  20273. 1111.39 s [algebraic-graphs] OK: Theorems of non-empty graphs
  20274. 1111.39 s [algebraic-graphs]
  20275. 1111.39 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  20276. 1111.39 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20277. 1111.39 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20278. 1111.39 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20279. 1111.39 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20280. 1111.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20281. 1111.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20282. 1111.39 s [algebraic-graphs] OK: x <= x + y
  20283. 1111.39 s [algebraic-graphs] OK: x + y <= x * y
  20284. 1111.39 s [algebraic-graphs]
  20285. 1111.39 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  20286. 1111.39 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  20287. 1111.39 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  20288. 1111.39 s [algebraic-graphs] OK: fmap id == id
  20289. 1111.39 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  20290. 1111.39 s [algebraic-graphs]
  20291. 1111.39 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  20292. 1111.39 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  20293. 1114.25 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  20294. 1114.25 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  20295. 1114.25 s [algebraic-graphs] OK: (x >>= vertex) == x
  20296. 1114.25 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  20297. 1114.25 s [algebraic-graphs]
  20298. 1114.25 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  20299. 1114.25 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  20300. 1114.25 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  20301. 1114.25 s [algebraic-graphs]
  20302. 1114.25 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  20303. 1114.25 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20304. 1114.25 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20305. 1114.25 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20306. 1114.25 s [algebraic-graphs] OK: size (vertex x) == 1
  20307. 1114.25 s [algebraic-graphs]
  20308. 1114.25 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  20309. 1114.26 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20310. 1114.26 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20311. 1114.26 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20312. 1114.26 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20313. 1114.26 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20314. 1114.26 s [algebraic-graphs]
  20315. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  20316. 1114.26 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20317. 1114.26 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20318. 1114.26 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20319. 1114.26 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20320. 1114.26 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20321. 1114.26 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20322. 1114.26 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20323. 1114.26 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20324. 1114.26 s [algebraic-graphs]
  20325. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  20326. 1114.26 s [algebraic-graphs] OK: overlay1 empty x == x
  20327. 1114.26 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  20328. 1114.26 s [algebraic-graphs]
  20329. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  20330. 1114.26 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20331. 1114.26 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20332. 1114.26 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20333. 1114.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20334. 1114.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20335. 1114.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20336. 1114.26 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20337. 1114.26 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20338. 1114.26 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20339. 1114.26 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20340. 1114.26 s [algebraic-graphs]
  20341. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  20342. 1114.26 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  20343. 1114.26 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  20344. 1114.26 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  20345. 1114.26 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20346. 1114.26 s [algebraic-graphs]
  20347. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  20348. 1114.26 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  20349. 1114.26 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  20350. 1114.26 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  20351. 1114.26 s [algebraic-graphs]
  20352. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  20353. 1114.26 s [algebraic-graphs] OK: overlays1 [x] == x
  20354. 1114.26 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  20355. 1114.26 s [algebraic-graphs]
  20356. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  20357. 1114.26 s [algebraic-graphs] OK: connects1 [x] == x
  20358. 1114.26 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  20359. 1114.26 s [algebraic-graphs]
  20360. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  20361. 1114.26 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  20362. 1114.26 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  20363. 1114.26 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  20364. 1114.26 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  20365. 1114.26 s [algebraic-graphs]
  20366. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  20367. 1114.26 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20368. 1114.26 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20369. 1114.26 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  20370. 1114.26 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20371. 1114.26 s [algebraic-graphs]
  20372. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  20373. 1114.26 s [algebraic-graphs] OK: x === x == True
  20374. 1114.26 s [algebraic-graphs] OK: x + y === x + y == True
  20375. 1114.26 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  20376. 1114.26 s [algebraic-graphs] OK: x + y === x * y == False
  20377. 1114.26 s [algebraic-graphs]
  20378. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  20379. 1114.26 s [algebraic-graphs] OK: size (vertex x) == 1
  20380. 1114.26 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20381. 1114.26 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20382. 1114.26 s [algebraic-graphs] OK: size x >= 1
  20383. 1114.26 s [algebraic-graphs] OK: size x >= vertexCount x
  20384. 1114.26 s [algebraic-graphs]
  20385. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  20386. 1114.26 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20387. 1114.26 s [algebraic-graphs]
  20388. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  20389. 1114.26 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20390. 1114.26 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20391. 1114.26 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20392. 1114.26 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20393. 1114.26 s [algebraic-graphs]
  20394. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  20395. 1114.26 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20396. 1114.26 s [algebraic-graphs] OK: vertexCount x >= 1
  20397. 1114.26 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  20398. 1114.26 s [algebraic-graphs]
  20399. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  20400. 1114.26 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20401. 1114.26 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20402. 1114.26 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20403. 1114.26 s [algebraic-graphs]
  20404. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  20405. 1114.26 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  20406. 1114.26 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  20407. 1114.26 s [algebraic-graphs]
  20408. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  20409. 1114.26 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20410. 1114.26 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20411. 1114.26 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20412. 1114.26 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  20413. 1114.26 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20414. 1114.26 s [algebraic-graphs]
  20415. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  20416. 1114.26 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20417. 1114.26 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20418. 1114.26 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  20419. 1114.26 s [algebraic-graphs]
  20420. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  20421. 1114.26 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20422. 1114.26 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20423. 1114.26 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  20424. 1114.26 s [algebraic-graphs]
  20425. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  20426. 1114.26 s [algebraic-graphs] OK: path1 [x] == vertex x
  20427. 1114.26 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  20428. 1114.26 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  20429. 1114.26 s [algebraic-graphs]
  20430. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  20431. 1114.26 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  20432. 1114.26 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  20433. 1114.26 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  20434. 1114.26 s [algebraic-graphs]
  20435. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  20436. 1114.26 s [algebraic-graphs] OK: clique1 [x] == vertex x
  20437. 1114.26 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  20438. 1114.26 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  20439. 1114.26 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  20440. 1114.26 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  20441. 1114.26 s [algebraic-graphs]
  20442. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  20443. 1114.26 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20444. 1114.26 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  20445. 1114.26 s [algebraic-graphs]
  20446. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  20447. 1114.26 s [algebraic-graphs] OK: star x [] == vertex x
  20448. 1114.26 s [algebraic-graphs] OK: star x [y] == edge x y
  20449. 1114.26 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  20450. 1114.26 s [algebraic-graphs]
  20451. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  20452. 1114.26 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20453. 1114.26 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20454. 1114.26 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20455. 1114.26 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20456. 1114.26 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20457. 1114.26 s [algebraic-graphs]
  20458. 1114.26 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  20459. 1114.26 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20460. 1114.27 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20461. 1114.27 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20462. 1114.27 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20463. 1114.27 s [algebraic-graphs]
  20464. 1114.27 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  20465. 1114.27 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  20466. 1114.27 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  20467. 1114.27 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  20468. 1114.27 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  20469. 1114.27 s [algebraic-graphs]
  20470. 1114.27 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  20471. 1114.27 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  20472. 1114.27 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  20473. 1114.27 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  20474. 1114.27 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  20475. 1114.27 s [algebraic-graphs]
  20476. 1114.27 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  20477. 1114.27 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20478. 1114.27 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20479. 1114.27 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20480. 1114.27 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20481. 1114.27 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20482. 1114.27 s [algebraic-graphs]
  20483. 1114.27 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  20484. 1114.27 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20485. 1114.27 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20486. 1114.27 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20487. 1114.27 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20488. 1114.27 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  20489. 1114.27 s [algebraic-graphs]
  20490. 1114.27 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  20491. 1114.27 s [algebraic-graphs] OK: replaceVertex x x == id
  20492. 1114.27 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20493. 1114.27 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20494. 1114.27 s [algebraic-graphs]
  20495. 1114.27 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  20496. 1114.27 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20497. 1131.11 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20498. 1131.11 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20499. 1131.12 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20500. 1131.12 s [algebraic-graphs]
  20501. 1131.12 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  20502. 1131.12 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  20503. 1131.12 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  20504. 1131.12 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  20505. 1131.12 s [algebraic-graphs]
  20506. 1131.12 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  20507. 1131.12 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20508. 1131.12 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20509. 1131.12 s [algebraic-graphs] OK: transpose . transpose == id
  20510. 1131.12 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20511. 1131.12 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20512. 1131.12 s [algebraic-graphs]
  20513. 1131.12 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  20514. 1131.12 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20515. 1131.12 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20516. 1131.12 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20517. 1131.12 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20518. 1131.12 s [algebraic-graphs]
  20519. 1131.12 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  20520. 1131.12 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20521. 1131.12 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20522. 1131.12 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  20523. 1131.13 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  20524. 1131.13 s [algebraic-graphs]
  20525. 1131.13 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  20526. 1131.13 s [algebraic-graphs] OK: simplify == id
  20527. 1131.13 s [algebraic-graphs] OK: size (simplify x) <= size x
  20528. 1131.13 s [algebraic-graphs] OK: simplify 1 === 1
  20529. 1131.13 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  20530. 1131.13 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  20531. 1131.13 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  20532. 1131.13 s [algebraic-graphs]
  20533. 1131.13 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  20534. 1131.13 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  20535. 1131.13 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  20536. 1131.13 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  20537. 1131.13 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  20538. 1131.13 s [algebraic-graphs]
  20539. 1131.13 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  20540. 1131.13 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  20541. 1131.13 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  20542. 1131.13 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  20543. 1131.13 s [algebraic-graphs]
  20544. 1131.13 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  20545. 1131.13 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  20546. 1131.13 s [algebraic-graphs] OK: box x y ~~ box y x
  20547. 1131.13 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20548. 1131.13 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20549. 1131.13 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20550. 1131.13 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20551. 1131.13 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20552. 1131.13 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20553. 1131.13 s [algebraic-graphs]
  20554. 1131.13 s [algebraic-graphs] ============ Relation ============
  20555. 1131.13 s [algebraic-graphs] OK: Axioms of graphs
  20556. 1131.13 s [algebraic-graphs]
  20557. 1131.13 s [algebraic-graphs] ============ Relation.consistent ============
  20558. 1131.13 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20559. 1131.13 s [algebraic-graphs]
  20560. 1131.13 s [algebraic-graphs] OK: consistent empty == True
  20561. 1131.13 s [algebraic-graphs] OK: consistent (vertex x) == True
  20562. 1131.13 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20563. 1131.13 s [algebraic-graphs] OK: consistent (connect x y) == True
  20564. 1131.13 s [algebraic-graphs] OK: consistent (edge x y) == True
  20565. 1131.13 s [algebraic-graphs] OK: consistent (edges xs) == True
  20566. 1131.13 s [algebraic-graphs] OK: consistent (stars xs) == True
  20567. 1131.13 s [algebraic-graphs]
  20568. 1131.13 s [algebraic-graphs] ============ Relation.Show ============
  20569. 1131.13 s [algebraic-graphs] OK: show (empty ) == "empty"
  20570. 1131.13 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20571. 1131.13 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20572. 1131.13 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20573. 1131.13 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20574. 1131.13 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20575. 1131.13 s [algebraic-graphs]
  20576. 1131.13 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20577. 1131.13 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20578. 1131.13 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20579. 1131.13 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20580. 1131.13 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20581. 1131.13 s [algebraic-graphs]
  20582. 1131.13 s [algebraic-graphs] ============ Relation.Ord ============
  20583. 1131.13 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20584. 1131.13 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20585. 1131.13 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20586. 1131.13 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20587. 1131.13 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20588. 1131.13 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20589. 1131.13 s [algebraic-graphs] OK: x <= x + y
  20590. 1131.13 s [algebraic-graphs] OK: x + y <= x * y
  20591. 1131.13 s [algebraic-graphs]
  20592. 1131.13 s [algebraic-graphs] ============ Relation.empty ============
  20593. 1131.13 s [algebraic-graphs] OK: isEmpty empty == True
  20594. 1131.13 s [algebraic-graphs] OK: hasVertex x empty == False
  20595. 1131.13 s [algebraic-graphs] OK: vertexCount empty == 0
  20596. 1131.13 s [algebraic-graphs] OK: edgeCount empty == 0
  20597. 1131.13 s [algebraic-graphs]
  20598. 1131.13 s [algebraic-graphs] ============ Relation.vertex ============
  20599. 1131.13 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20600. 1131.13 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20601. 1131.13 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20602. 1131.13 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20603. 1131.13 s [algebraic-graphs]
  20604. 1131.13 s [algebraic-graphs] ============ Relation.edge ============
  20605. 1131.13 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20606. 1131.13 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20607. 1131.13 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20608. 1131.13 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20609. 1131.13 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20610. 1131.13 s [algebraic-graphs]
  20611. 1131.13 s [algebraic-graphs] ============ Relation.overlay ============
  20612. 1131.13 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20613. 1131.13 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20614. 1131.13 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20615. 1131.13 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20616. 1131.13 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20617. 1131.13 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20618. 1131.13 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20619. 1131.13 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20620. 1131.13 s [algebraic-graphs]
  20621. 1131.13 s [algebraic-graphs] ============ Relation.connect ============
  20622. 1131.13 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20623. 1131.13 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20624. 1131.13 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20625. 1131.13 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20626. 1131.13 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20627. 1131.13 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20628. 1131.13 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20629. 1131.13 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20630. 1131.13 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20631. 1131.13 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20632. 1131.13 s [algebraic-graphs]
  20633. 1131.13 s [algebraic-graphs] ============ Relation.vertices ============
  20634. 1131.13 s [algebraic-graphs] OK: vertices [] == empty
  20635. 1131.13 s [algebraic-graphs] OK: vertices [x] == vertex x
  20636. 1131.13 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20637. 1131.13 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20638. 1131.13 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20639. 1131.13 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20640. 1131.13 s [algebraic-graphs]
  20641. 1131.13 s [algebraic-graphs] ============ Relation.edges ============
  20642. 1131.13 s [algebraic-graphs] OK: edges [] == empty
  20643. 1131.13 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20644. 1131.13 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20645. 1131.13 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20646. 1131.13 s [algebraic-graphs]
  20647. 1131.13 s [algebraic-graphs] ============ Relation.overlays ============
  20648. 1131.13 s [algebraic-graphs] OK: overlays [] == empty
  20649. 1131.13 s [algebraic-graphs] OK: overlays [x] == x
  20650. 1131.13 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20651. 1131.13 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20652. 1131.13 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20653. 1131.13 s [algebraic-graphs]
  20654. 1131.13 s [algebraic-graphs] ============ Relation.connects ============
  20655. 1131.13 s [algebraic-graphs] OK: connects [] == empty
  20656. 1131.13 s [algebraic-graphs] OK: connects [x] == x
  20657. 1131.13 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20658. 1131.13 s [algebraic-graphs] OK: connects == foldr connect empty
  20659. 1131.13 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20660. 1131.13 s [algebraic-graphs]
  20661. 1131.13 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  20662. 1131.13 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20663. 1131.14 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20664. 1131.14 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20665. 1131.14 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20666. 1131.14 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20667. 1131.14 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20668. 1131.14 s [algebraic-graphs]
  20669. 1131.14 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  20670. 1131.14 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20671. 1131.14 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20672. 1131.14 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20673. 1131.14 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20674. 1131.14 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20675. 1131.14 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20676. 1131.14 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20677. 1131.14 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20678. 1131.14 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20679. 1131.14 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20680. 1131.14 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20681. 1131.14 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20682. 1131.14 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20683. 1131.14 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20684. 1131.14 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20685. 1131.14 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20686. 1131.14 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20687. 1135.53 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20688. 1135.53 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20689. 1135.53 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20690. 1135.53 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20691. 1135.53 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20692. 1135.53 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20693. 1135.53 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20694. 1135.53 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20695. 1135.53 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20696. 1135.53 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20697. 1135.53 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20698. 1135.53 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20699. 1135.53 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20700. 1135.53 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20701. 1135.53 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20702. 1135.53 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20703. 1135.53 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20704. 1135.53 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20705. 1135.53 s [algebraic-graphs]
  20706. 1135.53 s [algebraic-graphs] ============ Relation.foldg ============
  20707. 1135.53 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20708. 1135.53 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20709. 1135.53 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20710. 1135.53 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20711. 1135.53 s [algebraic-graphs]
  20712. 1135.53 s [algebraic-graphs] ============ Relation.isEmpty ============
  20713. 1135.53 s [algebraic-graphs] OK: isEmpty empty == True
  20714. 1135.53 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20715. 1135.53 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20716. 1135.53 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20717. 1135.53 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20718. 1135.53 s [algebraic-graphs]
  20719. 1135.53 s [algebraic-graphs] ============ Relation.hasVertex ============
  20720. 1135.53 s [algebraic-graphs] OK: hasVertex x empty == False
  20721. 1135.54 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20722. 1135.54 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20723. 1135.54 s [algebraic-graphs]
  20724. 1135.54 s [algebraic-graphs] ============ Relation.hasEdge ============
  20725. 1135.54 s [algebraic-graphs] OK: hasEdge x y empty == False
  20726. 1135.54 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20727. 1135.54 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20728. 1135.54 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20729. 1135.54 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20730. 1135.54 s [algebraic-graphs]
  20731. 1135.54 s [algebraic-graphs] ============ Relation.vertexCount ============
  20732. 1135.54 s [algebraic-graphs] OK: vertexCount empty == 0
  20733. 1135.54 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20734. 1135.54 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20735. 1135.54 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20736. 1135.54 s [algebraic-graphs]
  20737. 1135.54 s [algebraic-graphs] ============ Relation.edgeCount ============
  20738. 1135.54 s [algebraic-graphs] OK: edgeCount empty == 0
  20739. 1135.54 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20740. 1135.54 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20741. 1135.54 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20742. 1135.54 s [algebraic-graphs]
  20743. 1135.54 s [algebraic-graphs] ============ Relation.vertexList ============
  20744. 1135.54 s [algebraic-graphs] OK: vertexList empty == []
  20745. 1135.54 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20746. 1135.54 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20747. 1135.54 s [algebraic-graphs]
  20748. 1135.54 s [algebraic-graphs] ============ Relation.vertexSet ============
  20749. 1135.54 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20750. 1135.54 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20751. 1135.54 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20752. 1135.54 s [algebraic-graphs]
  20753. 1135.54 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  20754. 1135.54 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20755. 1135.54 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20756. 1135.54 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20757. 1135.54 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20758. 1135.54 s [algebraic-graphs]
  20759. 1135.54 s [algebraic-graphs] ============ Relation.edgeList ============
  20760. 1135.54 s [algebraic-graphs] OK: edgeList empty == []
  20761. 1135.54 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20762. 1135.54 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20763. 1135.54 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20764. 1135.54 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20765. 1135.54 s [algebraic-graphs]
  20766. 1135.54 s [algebraic-graphs] ============ Relation.edgeSet ============
  20767. 1135.54 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20768. 1135.54 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20769. 1135.54 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20770. 1135.54 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20771. 1135.54 s [algebraic-graphs]
  20772. 1135.54 s [algebraic-graphs] ============ Relation.adjacencyList ============
  20773. 1135.54 s [algebraic-graphs] OK: adjacencyList empty == []
  20774. 1135.54 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20775. 1135.54 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20776. 1135.54 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20777. 1135.54 s [algebraic-graphs]
  20778. 1135.54 s [algebraic-graphs] ============ Relation.preSet ============
  20779. 1135.54 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20780. 1135.54 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20781. 1135.54 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20782. 1135.54 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20783. 1135.54 s [algebraic-graphs]
  20784. 1135.54 s [algebraic-graphs] ============ Relation.preIntSet ============
  20785. 1135.54 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20786. 1135.54 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20787. 1135.54 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20788. 1135.54 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20789. 1135.54 s [algebraic-graphs]
  20790. 1135.54 s [algebraic-graphs] ============ Relation.postSet ============
  20791. 1135.54 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20792. 1135.54 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20793. 1135.54 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20794. 1135.54 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20795. 1135.54 s [algebraic-graphs]
  20796. 1135.54 s [algebraic-graphs] ============ Relation.postIntSet ============
  20797. 1135.54 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20798. 1135.54 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20799. 1135.54 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20800. 1135.54 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20801. 1135.54 s [algebraic-graphs]
  20802. 1135.54 s [algebraic-graphs] ============ Relation.path ============
  20803. 1135.54 s [algebraic-graphs] OK: path [] == empty
  20804. 1135.54 s [algebraic-graphs] OK: path [x] == vertex x
  20805. 1135.54 s [algebraic-graphs] OK: path [x,y] == edge x y
  20806. 1135.54 s [algebraic-graphs]
  20807. 1135.54 s [algebraic-graphs] ============ Relation.circuit ============
  20808. 1135.54 s [algebraic-graphs] OK: circuit [] == empty
  20809. 1135.54 s [algebraic-graphs] OK: circuit [x] == edge x x
  20810. 1135.54 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20811. 1135.54 s [algebraic-graphs]
  20812. 1135.54 s [algebraic-graphs] ============ Relation.clique ============
  20813. 1135.54 s [algebraic-graphs] OK: clique [] == empty
  20814. 1135.54 s [algebraic-graphs] OK: clique [x] == vertex x
  20815. 1135.54 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20816. 1135.54 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20817. 1135.54 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20818. 1135.54 s [algebraic-graphs]
  20819. 1135.54 s [algebraic-graphs] ============ Relation.biclique ============
  20820. 1135.54 s [algebraic-graphs] OK: biclique [] [] == empty
  20821. 1135.54 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20822. 1135.54 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20823. 1135.54 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20824. 1135.54 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20825. 1135.54 s [algebraic-graphs]
  20826. 1135.54 s [algebraic-graphs] ============ Relation.star ============
  20827. 1135.54 s [algebraic-graphs] OK: star x [] == vertex x
  20828. 1135.54 s [algebraic-graphs] OK: star x [y] == edge x y
  20829. 1135.54 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20830. 1135.54 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20831. 1135.54 s [algebraic-graphs]
  20832. 1135.54 s [algebraic-graphs] ============ Relation.stars ============
  20833. 1135.54 s [algebraic-graphs] OK: stars [] == empty
  20834. 1135.54 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20835. 1135.54 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20836. 1135.54 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20837. 1135.54 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20838. 1135.54 s [algebraic-graphs] OK: stars . adjacencyList == id
  20839. 1135.54 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20840. 1135.54 s [algebraic-graphs]
  20841. 1135.54 s [algebraic-graphs] ============ Relation.tree ============
  20842. 1135.54 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20843. 1135.54 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20844. 1135.54 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20845. 1135.54 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20846. 1135.54 s [algebraic-graphs]
  20847. 1135.54 s [algebraic-graphs] ============ Relation.forest ============
  20848. 1135.54 s [algebraic-graphs] OK: forest [] == empty
  20849. 1135.54 s [algebraic-graphs] OK: forest [x] == tree x
  20850. 1135.54 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20851. 1135.54 s [algebraic-graphs] OK: forest == overlays . map tree
  20852. 1135.54 s [algebraic-graphs]
  20853. 1135.54 s [algebraic-graphs] ============ Relation.removeVertex ============
  20854. 1135.54 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20855. 1135.54 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20856. 1135.54 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20857. 1135.54 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20858. 1135.54 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20859. 1135.54 s [algebraic-graphs]
  20860. 1135.54 s [algebraic-graphs] ============ Relation.removeEdge ============
  20861. 1135.54 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20862. 1135.54 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20863. 1135.54 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20864. 1135.54 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20865. 1135.54 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20866. 1135.54 s [algebraic-graphs]
  20867. 1135.54 s [algebraic-graphs] ============ Relation.replaceVertex ============
  20868. 1135.54 s [algebraic-graphs] OK: replaceVertex x x == id
  20869. 1135.54 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20870. 1135.54 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20871. 1135.54 s [algebraic-graphs]
  20872. 1135.54 s [algebraic-graphs] ============ Relation.mergeVertices ============
  20873. 1135.54 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20874. 1177.18 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20875. 1177.18 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20876. 1177.20 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20877. 1177.20 s [algebraic-graphs]
  20878. 1177.20 s [algebraic-graphs] ============ Relation.transpose ============
  20879. 1177.20 s [algebraic-graphs] OK: transpose empty == empty
  20880. 1177.20 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20881. 1177.20 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20882. 1177.20 s [algebraic-graphs] OK: transpose . transpose == id
  20883. 1177.20 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20884. 1177.20 s [algebraic-graphs]
  20885. 1177.20 s [algebraic-graphs] ============ Relation.gmap ============
  20886. 1177.20 s [algebraic-graphs] OK: gmap f empty == empty
  20887. 1177.20 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20888. 1177.20 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20889. 1177.20 s [algebraic-graphs] OK: gmap id == id
  20890. 1177.20 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20891. 1177.20 s [algebraic-graphs]
  20892. 1177.20 s [algebraic-graphs] ============ Relation.induce ============
  20893. 1177.20 s [algebraic-graphs] OK: induce (const True ) x == x
  20894. 1177.20 s [algebraic-graphs] OK: induce (const False) x == empty
  20895. 1177.20 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20896. 1177.20 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20897. 1177.20 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20898. 1177.20 s [algebraic-graphs]
  20899. 1177.20 s [algebraic-graphs] ============ Relation.compose ============
  20900. 1177.20 s [algebraic-graphs] OK: compose empty x == empty
  20901. 1177.20 s [algebraic-graphs] OK: compose x empty == empty
  20902. 1177.20 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20903. 1177.20 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20904. 1177.20 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20905. 1177.20 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20906. 1177.20 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20907. 1177.20 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20908. 1177.20 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20909. 1177.20 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20910. 1177.20 s [algebraic-graphs]
  20911. 1177.20 s [algebraic-graphs] ============ Relation.closure ============
  20912. 1177.20 s [algebraic-graphs] OK: closure empty == empty
  20913. 1177.20 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20914. 1177.20 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20915. 1177.20 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20916. 1177.20 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20917. 1177.20 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20918. 1177.20 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20919. 1177.20 s [algebraic-graphs] OK: closure . closure == closure
  20920. 1177.20 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20921. 1177.20 s [algebraic-graphs]
  20922. 1177.20 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  20923. 1177.20 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20924. 1177.20 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20925. 1177.20 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20926. 1177.20 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20927. 1177.20 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20928. 1177.20 s [algebraic-graphs]
  20929. 1177.20 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  20930. 1177.20 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20931. 1177.20 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20932. 1177.20 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20933. 1177.20 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20934. 1177.20 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20935. 1177.20 s [algebraic-graphs]
  20936. 1177.20 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  20937. 1177.20 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20938. 1177.20 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20939. 1177.20 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20940. 1177.20 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20941. 1177.20 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20942. 1177.20 s [algebraic-graphs]
  20943. 1177.20 s [algebraic-graphs] ============ Relation.induceJust ============
  20944. 1177.20 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20945. 1177.20 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20946. 1177.20 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20947. 1177.20 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20948. 1177.21 s [algebraic-graphs]
  20949. 1177.21 s [algebraic-graphs] ============ ReflexiveRelation ============
  20950. 1177.21 s [algebraic-graphs] OK: Axioms of reflexive graphs
  20951. 1177.21 s [algebraic-graphs]
  20952. 1177.21 s [algebraic-graphs] ============ TransitiveRelation ============
  20953. 1177.21 s [algebraic-graphs] OK: Axioms of transitive graphs
  20954. 1177.21 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  20955. 1177.21 s [algebraic-graphs]
  20956. 1177.21 s [algebraic-graphs] ============ PreorderRelation ============
  20957. 1177.21 s [algebraic-graphs] OK: Axioms of preorder graphs
  20958. 1177.21 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  20959. 1177.21 s [algebraic-graphs]
  20960. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation ============
  20961. 1177.21 s [algebraic-graphs] OK: Axioms of undirected graphs
  20962. 1177.21 s [algebraic-graphs]
  20963. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  20964. 1177.21 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20965. 1177.21 s [algebraic-graphs]
  20966. 1177.21 s [algebraic-graphs] OK: consistent empty == True
  20967. 1177.21 s [algebraic-graphs] OK: consistent (vertex x) == True
  20968. 1177.21 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20969. 1177.21 s [algebraic-graphs] OK: consistent (connect x y) == True
  20970. 1177.21 s [algebraic-graphs] OK: consistent (edge x y) == True
  20971. 1177.21 s [algebraic-graphs] OK: consistent (edges xs) == True
  20972. 1177.21 s [algebraic-graphs] OK: consistent (stars xs) == True
  20973. 1177.21 s [algebraic-graphs]
  20974. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  20975. 1177.21 s [algebraic-graphs] OK: show (empty ) == "empty"
  20976. 1177.21 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20977. 1177.21 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20978. 1177.21 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20979. 1177.21 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20980. 1177.21 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20981. 1177.21 s [algebraic-graphs]
  20982. 1177.21 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20983. 1177.21 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20984. 1177.21 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20985. 1177.21 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20986. 1177.21 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20987. 1177.21 s [algebraic-graphs]
  20988. 1177.21 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  20989. 1177.21 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  20990. 1177.21 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  20991. 1177.21 s [algebraic-graphs]
  20992. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  20993. 1177.21 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  20994. 1177.21 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  20995. 1177.21 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  20996. 1177.21 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  20997. 1177.21 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  20998. 1177.21 s [algebraic-graphs]
  20999. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  21000. 1177.21 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  21001. 1177.21 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  21002. 1177.21 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  21003. 1177.21 s [algebraic-graphs]
  21004. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  21005. 1177.21 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21006. 1177.21 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21007. 1177.21 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21008. 1177.21 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21009. 1177.21 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21010. 1177.21 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  21011. 1177.21 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  21012. 1177.21 s [algebraic-graphs] OK: x <= x + y
  21013. 1177.21 s [algebraic-graphs] OK: x + y <= x * y
  21014. 1177.21 s [algebraic-graphs]
  21015. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  21016. 1177.21 s [algebraic-graphs] OK: isEmpty empty == True
  21017. 1177.21 s [algebraic-graphs] OK: hasVertex x empty == False
  21018. 1177.21 s [algebraic-graphs] OK: vertexCount empty == 0
  21019. 1177.21 s [algebraic-graphs] OK: edgeCount empty == 0
  21020. 1177.21 s [algebraic-graphs]
  21021. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  21022. 1177.21 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21023. 1177.21 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21024. 1177.21 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21025. 1177.21 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21026. 1177.21 s [algebraic-graphs]
  21027. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  21028. 1177.21 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21029. 1177.21 s [algebraic-graphs] OK: edge x y == edge y x
  21030. 1177.21 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  21031. 1177.21 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21032. 1177.21 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21033. 1177.21 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21034. 1177.21 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21035. 1177.21 s [algebraic-graphs]
  21036. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  21037. 1177.21 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21038. 1177.21 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21039. 1177.21 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21040. 1177.21 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21041. 1177.21 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21042. 1177.21 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21043. 1177.21 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21044. 1177.21 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21045. 1177.21 s [algebraic-graphs]
  21046. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  21047. 1177.21 s [algebraic-graphs] OK: connect x y == connect y x
  21048. 1177.21 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21049. 1177.21 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21050. 1177.21 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21051. 1177.21 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21052. 1177.21 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21053. 1177.21 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21054. 1177.21 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  21055. 1177.21 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21056. 1177.21 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21057. 1177.21 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21058. 1177.21 s [algebraic-graphs]
  21059. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  21060. 1177.21 s [algebraic-graphs] OK: vertices [] == empty
  21061. 1177.21 s [algebraic-graphs] OK: vertices [x] == vertex x
  21062. 1177.21 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21063. 1177.21 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21064. 1177.21 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21065. 1177.21 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21066. 1177.21 s [algebraic-graphs]
  21067. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  21068. 1177.21 s [algebraic-graphs] OK: edges [] == empty
  21069. 1177.21 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21070. 1177.21 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  21071. 1177.21 s [algebraic-graphs]
  21072. 1177.21 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  21073. 1177.21 s [algebraic-graphs] OK: overlays [] == empty
  21074. 1203.85 s [algebraic-graphs] OK: overlays [x] == x
  21075. 1203.87 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21076. 1203.87 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21077. 1203.87 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21078. 1203.87 s [algebraic-graphs]
  21079. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  21080. 1203.87 s [algebraic-graphs] OK: connects [] == empty
  21081. 1203.87 s [algebraic-graphs] OK: connects [x] == x
  21082. 1203.87 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21083. 1203.87 s [algebraic-graphs] OK: connects == foldr connect empty
  21084. 1203.87 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21085. 1203.87 s [algebraic-graphs] OK: connects == connects . reverse
  21086. 1203.87 s [algebraic-graphs]
  21087. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  21088. 1203.87 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21089. 1203.87 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21090. 1203.87 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21091. 1203.87 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21092. 1203.87 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21093. 1203.87 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21094. 1203.87 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  21095. 1203.87 s [algebraic-graphs]
  21096. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  21097. 1203.87 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21098. 1203.87 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21099. 1203.87 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21100. 1203.87 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21101. 1203.87 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21102. 1203.87 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21103. 1203.87 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21104. 1203.87 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21105. 1203.87 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21106. 1203.87 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21107. 1203.87 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21108. 1203.87 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21109. 1203.87 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21110. 1203.87 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21111. 1203.87 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21112. 1203.87 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21113. 1203.87 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21114. 1203.87 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21115. 1203.87 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21116. 1203.87 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21117. 1203.87 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21118. 1203.87 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21119. 1203.87 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21120. 1203.87 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21121. 1203.87 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21122. 1203.87 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21123. 1203.87 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21124. 1203.87 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21125. 1203.87 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21126. 1203.87 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21127. 1203.87 s [algebraic-graphs]
  21128. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  21129. 1203.87 s [algebraic-graphs] OK: isEmpty empty == True
  21130. 1203.87 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21131. 1203.87 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21132. 1203.87 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21133. 1203.87 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21134. 1203.87 s [algebraic-graphs]
  21135. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  21136. 1203.87 s [algebraic-graphs] OK: hasVertex x empty == False
  21137. 1203.87 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21138. 1203.87 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21139. 1203.87 s [algebraic-graphs]
  21140. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  21141. 1203.87 s [algebraic-graphs] OK: hasEdge x y empty == False
  21142. 1203.87 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21143. 1203.87 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21144. 1203.87 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  21145. 1203.87 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21146. 1203.87 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  21147. 1203.87 s [algebraic-graphs]
  21148. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  21149. 1203.87 s [algebraic-graphs] OK: vertexCount empty == 0
  21150. 1203.87 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21151. 1203.87 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21152. 1203.87 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21153. 1203.87 s [algebraic-graphs]
  21154. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  21155. 1203.87 s [algebraic-graphs] OK: edgeCount empty == 0
  21156. 1203.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21157. 1203.87 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21158. 1203.87 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21159. 1203.87 s [algebraic-graphs]
  21160. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  21161. 1203.87 s [algebraic-graphs] OK: vertexList empty == []
  21162. 1203.87 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21163. 1203.87 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21164. 1203.87 s [algebraic-graphs]
  21165. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  21166. 1203.87 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21167. 1203.87 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21168. 1203.87 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21169. 1203.87 s [algebraic-graphs]
  21170. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  21171. 1203.87 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21172. 1203.87 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21173. 1203.87 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21174. 1203.87 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21175. 1203.87 s [algebraic-graphs]
  21176. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  21177. 1203.87 s [algebraic-graphs] OK: edgeList empty == []
  21178. 1203.87 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21179. 1203.87 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  21180. 1203.87 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  21181. 1203.87 s [algebraic-graphs]
  21182. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  21183. 1203.87 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21184. 1203.87 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21185. 1203.87 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  21186. 1203.87 s [algebraic-graphs]
  21187. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  21188. 1203.87 s [algebraic-graphs] OK: adjacencyList empty == []
  21189. 1203.87 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21190. 1203.87 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  21191. 1203.87 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  21192. 1203.87 s [algebraic-graphs]
  21193. 1203.87 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  21194. 1203.87 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  21195. 1203.87 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  21196. 1203.87 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  21197. 1203.87 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  21198. 1203.88 s [algebraic-graphs]
  21199. 1203.88 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  21200. 1203.88 s [algebraic-graphs] OK: path [] == empty
  21201. 1203.88 s [algebraic-graphs] OK: path [x] == vertex x
  21202. 1203.88 s [algebraic-graphs] OK: path [x,y] == edge x y
  21203. 1203.88 s [algebraic-graphs] OK: path == path . reverse
  21204. 1203.88 s [algebraic-graphs]
  21205. 1203.88 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  21206. 1203.88 s [algebraic-graphs] OK: circuit [] == empty
  21207. 1203.88 s [algebraic-graphs] OK: circuit [x] == edge x x
  21208. 1203.88 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21209. 1203.88 s [algebraic-graphs] OK: circuit == circuit . reverse
  21210. 1203.88 s [algebraic-graphs]
  21211. 1203.88 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  21212. 1203.88 s [algebraic-graphs] OK: clique [] == empty
  21213. 1203.88 s [algebraic-graphs] OK: clique [x] == vertex x
  21214. 1203.88 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21215. 1203.88 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21216. 1203.88 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21217. 1203.88 s [algebraic-graphs] OK: clique == clique . reverse
  21218. 1203.88 s [algebraic-graphs]
  21219. 1203.88 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  21220. 1203.88 s [algebraic-graphs] OK: biclique [] [] == empty
  21221. 1203.88 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21222. 1203.88 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21223. 1203.88 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21224. 1203.88 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21225. 1203.88 s [algebraic-graphs]
  21226. 1203.88 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  21227. 1203.88 s [algebraic-graphs] OK: star x [] == vertex x
  21228. 1203.88 s [algebraic-graphs] OK: star x [y] == edge x y
  21229. 1203.88 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21230. 1203.88 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21231. 1203.88 s [algebraic-graphs]
  21232. 1203.88 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  21233. 1203.88 s [algebraic-graphs] OK: stars [] == empty
  21234. 1203.88 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21235. 1203.88 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21236. 1203.88 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21237. 1203.88 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21238. 1203.88 s [algebraic-graphs] OK: stars . adjacencyList == id
  21239. 1203.88 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21240. 1203.88 s [algebraic-graphs]
  21241. 1203.88 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  21242. 1203.88 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21243. 1203.88 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21244. 1203.88 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21245. 1203.88 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21246. 1203.88 s [algebraic-graphs]
  21247. 1203.88 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  21248. 1203.88 s [algebraic-graphs] OK: forest [] == empty
  21249. 1214.24 s [algebraic-graphs] OK: forest [x] == tree x
  21250. 1214.24 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21251. 1214.25 s [algebraic-graphs] OK: forest == overlays . map tree
  21252. 1214.25 s [algebraic-graphs]
  21253. 1214.25 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  21254. 1214.25 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21255. 1214.25 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21256. 1214.25 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21257. 1214.25 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21258. 1214.25 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21259. 1214.25 s [algebraic-graphs]
  21260. 1214.25 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  21261. 1214.25 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21262. 1214.25 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21263. 1214.25 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21264. 1214.25 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21265. 1214.25 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21266. 1214.25 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21267. 1214.25 s [algebraic-graphs]
  21268. 1214.25 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  21269. 1214.25 s [algebraic-graphs] OK: replaceVertex x x == id
  21270. 1214.25 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21271. 1214.26 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21272. 1214.26 s [algebraic-graphs]
  21273. 1214.26 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  21274. 1214.26 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21275. 1214.26 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21276. 1214.26 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21277. 1214.26 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21278. 1214.26 s [algebraic-graphs]
  21279. 1214.26 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  21280. 1214.26 s [algebraic-graphs] OK: gmap f empty == empty
  21281. 1214.26 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21282. 1214.26 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21283. 1214.26 s [algebraic-graphs] OK: gmap id == id
  21284. 1214.26 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21285. 1214.26 s [algebraic-graphs]
  21286. 1214.26 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  21287. 1214.26 s [algebraic-graphs] OK: induce (const True ) x == x
  21288. 1214.26 s [algebraic-graphs] OK: induce (const False) x == empty
  21289. 1214.26 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21290. 1214.26 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21291. 1214.26 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21292. 1214.26 s [algebraic-graphs]
  21293. 1214.26 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  21294. 1214.26 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21295. 1214.26 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21296. 1214.26 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21297. 1214.26 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21298. 1214.26 s [algebraic-graphs]
  21299. 1214.26 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  21300. 1214.26 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  21301. 1214.26 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  21302. 1214.26 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  21303. 1214.26 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  21304. 1214.26 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  21305. 1214.26 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  21306. 1214.26 s [algebraic-graphs]
  21307. 1214.26 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  21308. 1214.26 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  21309. 1214.26 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  21310. 1214.26 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  21311. 1214.26 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  21312. 1214.26 s [algebraic-graphs]
  21313. 1214.26 s [algebraic-graphs] ============ Typed ============
  21314. 1214.26 s [algebraic-graphs]
  21315. 1214.26 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  21316. 1214.26 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21317. 1214.26 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21318. 1214.26 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  21319. 1214.26 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21320. 1214.26 s [algebraic-graphs]
  21321. 1214.26 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  21322. 1214.26 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21323. 1214.26 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21324. 1214.26 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  21325. 1214.26 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21326. 1214.26 s [algebraic-graphs]
  21327. 1214.26 s [algebraic-graphs] ============ Typed.dfsForest ============
  21328. 1214.26 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  21329. 1214.26 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  21330. 1214.26 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  21331. 1214.26 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  21332. 1214.26 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  21333. 1214.26 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  21334. 1214.26 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  21335. 1214.26 s [algebraic-graphs]
  21336. 1214.26 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  21337. 1214.26 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  21338. 1214.26 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  21339. 1214.26 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  21340. 1214.26 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  21341. 1214.26 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  21342. 1214.26 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  21343. 1214.26 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  21344. 1214.26 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  21345. 1214.26 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  21346. 1214.26 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  21347. 1214.26 s [algebraic-graphs]
  21348. 1214.26 s [algebraic-graphs] ============ Typed.dfs ============
  21349. 1214.26 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  21350. 1214.26 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  21351. 1214.26 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  21352. 1214.26 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  21353. 1214.26 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  21354. 1214.26 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  21355. 1214.26 s [algebraic-graphs] OK: dfs % x $ [] == []
  21356. 1214.26 s [algebraic-graphs]
  21357. 1214.26 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  21358. 1214.26 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  21359. 1214.26 s [algebraic-graphs]
  21360. 1214.26 s [algebraic-graphs] ============ Typed.topSort ============
  21361. 1214.26 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  21362. 1214.26 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  21363. 1214.26 s [algebraic-graphs]
  21364. 1214.26 s [algebraic-graphs] ============ Graph.Undirected ============
  21365. 1214.26 s [algebraic-graphs] OK: Axioms of undirected graphs
  21366. 1214.26 s [algebraic-graphs]
  21367. 1214.26 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  21368. 1214.26 s [algebraic-graphs] OK: show (empty ) == "empty"
  21369. 1214.26 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  21370. 1214.26 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  21371. 1214.26 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  21372. 1214.26 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  21373. 1214.26 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  21374. 1214.26 s [algebraic-graphs]
  21375. 1214.26 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  21376. 1214.26 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  21377. 1214.26 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  21378. 1214.26 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  21379. 1214.26 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  21380. 1214.26 s [algebraic-graphs]
  21381. 1214.26 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  21382. 1214.26 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  21383. 1214.26 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  21384. 1214.26 s [algebraic-graphs]
  21385. 1214.26 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  21386. 1214.26 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  21387. 1214.26 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21388. 1214.26 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  21389. 1214.26 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  21390. 1214.26 s [algebraic-graphs]
  21391. 1214.26 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  21392. 1214.26 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  21393. 1214.26 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21394. 1214.26 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  21395. 1214.26 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  21396. 1214.26 s [algebraic-graphs]
  21397. 1214.26 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  21398. 1214.26 s [algebraic-graphs] OK: complement empty == empty
  21399. 1214.26 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  21400. 1214.26 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  21401. 1214.26 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  21402. 1214.26 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  21403. 1214.26 s [algebraic-graphs] OK: complement . complement == id
  21404. 1214.26 s [algebraic-graphs]
  21405. 1214.26 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  21406. 1214.26 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21407. 1214.26 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21408. 1214.26 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21409. 1214.26 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21410. 1214.26 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21411. 1214.26 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  21412. 1214.26 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  21413. 1214.26 s [algebraic-graphs] OK: x <= x + y
  21414. 1214.26 s [algebraic-graphs] OK: x + y <= x * y
  21415. 1214.26 s [algebraic-graphs]
  21416. 1214.26 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  21417. 1214.26 s [algebraic-graphs] OK: isEmpty empty == True
  21418. 1214.26 s [algebraic-graphs] OK: hasVertex x empty == False
  21419. 1214.26 s [algebraic-graphs] OK: vertexCount empty == 0
  21420. 1214.26 s [algebraic-graphs] OK: edgeCount empty == 0
  21421. 1214.26 s [algebraic-graphs]
  21422. 1214.26 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  21423. 1214.26 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21424. 1214.26 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21425. 1214.26 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21426. 1214.26 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21427. 1214.26 s [algebraic-graphs]
  21428. 1214.26 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  21429. 1214.26 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21430. 1214.26 s [algebraic-graphs] OK: edge x y == edge y x
  21431. 1228.64 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  21432. 1228.64 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21433. 1228.64 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21434. 1228.66 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21435. 1228.66 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21436. 1228.66 s [algebraic-graphs]
  21437. 1228.66 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  21438. 1228.66 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21439. 1228.66 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21440. 1228.66 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21441. 1228.66 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21442. 1228.66 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21443. 1228.66 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21444. 1228.66 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21445. 1228.66 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21446. 1228.66 s [algebraic-graphs]
  21447. 1228.66 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  21448. 1228.66 s [algebraic-graphs] OK: connect x y == connect y x
  21449. 1228.66 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21450. 1228.66 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21451. 1228.66 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21452. 1228.66 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21453. 1228.66 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21454. 1228.66 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21455. 1228.66 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  21456. 1228.66 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21457. 1228.66 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21458. 1228.66 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21459. 1228.67 s [algebraic-graphs]
  21460. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  21461. 1228.67 s [algebraic-graphs] OK: vertices [] == empty
  21462. 1228.67 s [algebraic-graphs] OK: vertices [x] == vertex x
  21463. 1228.67 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21464. 1228.67 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21465. 1228.67 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21466. 1228.67 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21467. 1228.67 s [algebraic-graphs]
  21468. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  21469. 1228.67 s [algebraic-graphs] OK: edges [] == empty
  21470. 1228.67 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21471. 1228.67 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  21472. 1228.67 s [algebraic-graphs]
  21473. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  21474. 1228.67 s [algebraic-graphs] OK: overlays [] == empty
  21475. 1228.67 s [algebraic-graphs] OK: overlays [x] == x
  21476. 1228.67 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21477. 1228.67 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21478. 1228.67 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21479. 1228.67 s [algebraic-graphs]
  21480. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  21481. 1228.67 s [algebraic-graphs] OK: connects [] == empty
  21482. 1228.67 s [algebraic-graphs] OK: connects [x] == x
  21483. 1228.67 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21484. 1228.67 s [algebraic-graphs] OK: connects == foldr connect empty
  21485. 1228.67 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21486. 1228.67 s [algebraic-graphs] OK: connects == connects . reverse
  21487. 1228.67 s [algebraic-graphs]
  21488. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  21489. 1228.67 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21490. 1228.67 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21491. 1228.67 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21492. 1228.67 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21493. 1228.67 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21494. 1228.67 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21495. 1228.67 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  21496. 1228.67 s [algebraic-graphs]
  21497. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.path ============
  21498. 1228.67 s [algebraic-graphs] OK: path [] == empty
  21499. 1228.67 s [algebraic-graphs] OK: path [x] == vertex x
  21500. 1228.67 s [algebraic-graphs] OK: path [x,y] == edge x y
  21501. 1228.67 s [algebraic-graphs] OK: path == path . reverse
  21502. 1228.67 s [algebraic-graphs]
  21503. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  21504. 1228.67 s [algebraic-graphs] OK: circuit [] == empty
  21505. 1228.67 s [algebraic-graphs] OK: circuit [x] == edge x x
  21506. 1228.67 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21507. 1228.67 s [algebraic-graphs] OK: circuit == circuit . reverse
  21508. 1228.67 s [algebraic-graphs]
  21509. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  21510. 1228.67 s [algebraic-graphs] OK: clique [] == empty
  21511. 1228.67 s [algebraic-graphs] OK: clique [x] == vertex x
  21512. 1228.67 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21513. 1228.67 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21514. 1228.67 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21515. 1228.67 s [algebraic-graphs] OK: clique == clique . reverse
  21516. 1228.67 s [algebraic-graphs]
  21517. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  21518. 1228.67 s [algebraic-graphs] OK: biclique [] [] == empty
  21519. 1228.67 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21520. 1228.67 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21521. 1228.67 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21522. 1228.67 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21523. 1228.67 s [algebraic-graphs]
  21524. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.star ============
  21525. 1228.67 s [algebraic-graphs] OK: star x [] == vertex x
  21526. 1228.67 s [algebraic-graphs] OK: star x [y] == edge x y
  21527. 1228.67 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21528. 1228.67 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21529. 1228.67 s [algebraic-graphs]
  21530. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  21531. 1228.67 s [algebraic-graphs] OK: stars [] == empty
  21532. 1228.67 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21533. 1228.67 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21534. 1228.67 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21535. 1228.67 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21536. 1228.67 s [algebraic-graphs] OK: stars . adjacencyList == id
  21537. 1228.67 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21538. 1228.67 s [algebraic-graphs]
  21539. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  21540. 1228.67 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21541. 1228.67 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21542. 1228.67 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21543. 1228.67 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21544. 1228.67 s [algebraic-graphs]
  21545. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  21546. 1228.67 s [algebraic-graphs] OK: forest [] == empty
  21547. 1228.67 s [algebraic-graphs] OK: forest [x] == tree x
  21548. 1228.67 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21549. 1228.67 s [algebraic-graphs] OK: forest == overlays . map tree
  21550. 1228.67 s [algebraic-graphs]
  21551. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  21552. 1228.67 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21553. 1228.67 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21554. 1228.67 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21555. 1228.67 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21556. 1228.67 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21557. 1228.67 s [algebraic-graphs]
  21558. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  21559. 1228.67 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21560. 1228.67 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21561. 1228.67 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21562. 1228.67 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21563. 1228.67 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21564. 1228.67 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21565. 1228.67 s [algebraic-graphs]
  21566. 1228.67 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  21567. 1228.67 s [algebraic-graphs] OK: replaceVertex x x == id
  21568. 1228.67 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21569. 1228.67 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21570. 1228.67 s [algebraic-graphs]
  21571. 1228.68 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  21572. 1228.68 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21573. 1228.68 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21574. 1228.68 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21575. 1228.68 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21576. 1228.68 s [algebraic-graphs]
  21577. 1228.68 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  21578. 1228.68 s [algebraic-graphs] OK: gmap f empty == empty
  21579. 1228.68 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21580. 1228.68 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21581. 1228.68 s [algebraic-graphs] OK: gmap id == id
  21582. 1228.68 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21583. 1228.68 s [algebraic-graphs]
  21584. 1228.68 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  21585. 1228.68 s [algebraic-graphs] OK: induce (const True ) x == x
  21586. 1228.68 s [algebraic-graphs] OK: induce (const False) x == empty
  21587. 1228.68 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21588. 1228.68 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21589. 1228.68 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21590. 1228.68 s [algebraic-graphs]
  21591. 1228.68 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  21592. 1228.68 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21593. 1228.68 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21594. 1228.68 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21595. 1228.68 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21596. 1228.68 s [algebraic-graphs] Test suite main: PASS
  21597. 1228.68 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  21598. 1228.68 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  21599. 1228.68 s [algebraic-graphs] checkPhase completed in 3 minutes 30 seconds
  21600. 1228.68 s [algebraic-graphs] Phase: haddockPhase
  21601. 1228.85 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  21602. 1228.86 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  21603. 1229.10 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  21604. 1229.59 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  21605. 1229.69 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  21606. 1229.75 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  21607. 1229.79 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  21608. 1230.14 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  21609. 1230.20 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  21610. 1230.46 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  21611. 1230.72 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  21612. 1231.04 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  21613. 1231.20 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  21614. 1231.39 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  21615. 1231.39 s [algebraic-graphs] In the use of ‘head’
  21616. 1231.39 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21617. 1231.39 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"."
  21618. 1231.39 s [algebraic-graphs] |
  21619. 1231.39 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  21620. 1231.39 s [algebraic-graphs] | ^^^^
  21621. 1231.39 s [algebraic-graphs]
  21622. 1231.40 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  21623. 1231.40 s [algebraic-graphs] In the use of ‘tail’
  21624. 1231.40 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21625. 1231.40 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"."
  21626. 1231.40 s [algebraic-graphs] |
  21627. 1231.40 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  21628. 1231.40 s [algebraic-graphs] | ^^^^
  21629. 1231.40 s [algebraic-graphs]
  21630. 1231.40 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  21631. 1231.40 s [algebraic-graphs] In the use of ‘head’
  21632. 1231.40 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21633. 1231.40 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"."
  21634. 1231.40 s [algebraic-graphs] |
  21635. 1231.40 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  21636. 1231.40 s [algebraic-graphs] | ^^^^
  21637. 1231.40 s [algebraic-graphs]
  21638. 1231.40 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  21639. 1231.40 s [algebraic-graphs] In the use of ‘tail’
  21640. 1231.40 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21641. 1231.40 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"."
  21642. 1231.40 s [algebraic-graphs] |
  21643. 1231.40 s [algebraic-graphs] 397 | bnd' = tail bnd
  21644. 1231.40 s [algebraic-graphs] | ^^^^
  21645. 1231.40 s [algebraic-graphs]
  21646. 1231.41 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  21647. 1231.48 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  21648. 1231.61 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21649. 1231.61 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21650. 1231.61 s [algebraic-graphs] will become an error in a future GHC release.
  21651. 1231.61 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21652. 1231.61 s [algebraic-graphs] |
  21653. 1231.61 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  21654. 1231.61 s [algebraic-graphs] | ^
  21655. 1231.61 s [algebraic-graphs]
  21656. 1231.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21657. 1231.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21658. 1231.62 s [algebraic-graphs] will become an error in a future GHC release.
  21659. 1231.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21660. 1231.62 s [algebraic-graphs] |
  21661. 1231.62 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21662. 1231.62 s [algebraic-graphs] | ^
  21663. 1231.62 s [algebraic-graphs]
  21664. 1231.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21665. 1231.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21666. 1231.62 s [algebraic-graphs] will become an error in a future GHC release.
  21667. 1231.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21668. 1231.62 s [algebraic-graphs] |
  21669. 1231.62 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21670. 1231.62 s [algebraic-graphs] | ^
  21671. 1231.62 s [algebraic-graphs]
  21672. 1231.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21673. 1231.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21674. 1231.62 s [algebraic-graphs] will become an error in a future GHC release.
  21675. 1231.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21676. 1231.62 s [algebraic-graphs] |
  21677. 1231.62 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21678. 1231.62 s [algebraic-graphs] | ^
  21679. 1231.62 s [algebraic-graphs]
  21680. 1231.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21681. 1231.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21682. 1231.62 s [algebraic-graphs] will become an error in a future GHC release.
  21683. 1231.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21684. 1231.62 s [algebraic-graphs] |
  21685. 1231.62 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21686. 1231.62 s [algebraic-graphs] | ^
  21687. 1231.62 s [algebraic-graphs]
  21688. 1231.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21689. 1231.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21690. 1231.62 s [algebraic-graphs] will become an error in a future GHC release.
  21691. 1231.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21692. 1231.62 s [algebraic-graphs] |
  21693. 1231.62 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21694. 1231.63 s [algebraic-graphs] | ^
  21695. 1231.63 s [algebraic-graphs]
  21696. 1231.63 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21697. 1231.63 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21698. 1231.63 s [algebraic-graphs] will become an error in a future GHC release.
  21699. 1231.63 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21700. 1231.63 s [algebraic-graphs] |
  21701. 1231.63 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21702. 1231.63 s [algebraic-graphs] | ^
  21703. 1231.63 s [algebraic-graphs]
  21704. 1231.63 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  21705. 1231.86 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  21706. 1231.95 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  21707. 1232.14 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  21708. 1232.45 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  21709. 1232.69 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  21710. 1232.71 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  21711. 1232.76 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  21712. 1232.81 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21713. 1232.81 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21714. 1232.81 s [algebraic-graphs] will become an error in a future GHC release.
  21715. 1232.81 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21716. 1232.81 s [algebraic-graphs] |
  21717. 1232.81 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  21718. 1232.81 s [algebraic-graphs] | ^
  21719. 1232.81 s [algebraic-graphs]
  21720. 1232.81 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  21721. 1232.86 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21722. 1232.86 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21723. 1232.86 s [algebraic-graphs] will become an error in a future GHC release.
  21724. 1232.86 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21725. 1232.86 s [algebraic-graphs] |
  21726. 1232.86 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  21727. 1232.86 s [algebraic-graphs] | ^
  21728. 1232.86 s [algebraic-graphs]
  21729. 1232.86 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21730. 1232.86 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21731. 1232.86 s [algebraic-graphs] will become an error in a future GHC release.
  21732. 1232.86 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21733. 1232.86 s [algebraic-graphs] |
  21734. 1232.86 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  21735. 1232.86 s [algebraic-graphs] | ^
  21736. 1232.86 s [algebraic-graphs]
  21737. 1232.86 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  21738. 1233.03 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  21739. 1233.19 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  21740. 1233.22 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  21741. 1233.38 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  21742. 1233.42 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  21743. 1233.46 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  21744. 1233.49 s [algebraic-graphs] Haddock coverage:
  21745. 1233.49 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21746. 1233.49 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21747. 1233.49 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21748. 1233.49 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21749. 1233.50 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21750. 1233.50 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21751. 1233.50 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21752. 1233.52 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  21753. 1233.52 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21754. 1233.52 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21755. 1233.52 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  21756. 1233.52 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21757. 1233.52 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21758. 1233.52 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21759. 1233.52 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21760. 1233.54 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  21761. 1233.55 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21762. 1233.55 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21763. 1233.55 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21764. 1233.55 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21765. 1233.55 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  21766. 1233.55 s [algebraic-graphs] Missing documentation for:
  21767. 1233.55 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  21768. 1233.55 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  21769. 1233.55 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  21770. 1233.55 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  21771. 1233.55 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21772. 1233.55 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21773. 1233.55 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  21774. 1233.55 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  21775. 1233.55 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21776. 1233.56 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  21777. 1233.56 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21778. 1233.56 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  21779. 1233.56 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  21780. 1233.56 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21781. 1233.56 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21782. 1233.56 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  21783. 1233.57 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21784. 1233.57 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  21785. 1233.57 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21786. 1233.57 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21787. 1233.57 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21788. 1233.57 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  21789. 1233.58 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  21790. 1233.59 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  21791. 1233.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21792. 1233.59 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  21793. 1233.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21794. 1233.59 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  21795. 1233.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21796. 1233.59 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  21797. 1233.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21798. 1233.59 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21799. 1233.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21800. 1233.59 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  21801. 1233.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21802. 1233.59 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21803. 1233.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21804. 1233.59 s [algebraic-graphs] Warning: 'box' is out of scope.
  21805. 1233.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21806. 1233.60 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  21807. 1233.60 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21808. 1233.60 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  21809. 1233.61 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21810. 1233.61 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21811. 1233.61 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21812. 1233.61 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21813. 1233.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21814. 1233.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21815. 1233.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21816. 1233.61 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21817. 1233.61 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21818. 1233.62 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  21819. 1233.62 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21820. 1233.62 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  21821. 1233.62 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21822. 1233.62 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21823. 1233.62 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21824. 1233.62 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  21825. 1233.63 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  21826. 1233.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21827. 1233.63 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  21828. 1233.63 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  21829. 1233.63 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21830. 1233.63 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21831. 1233.63 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21832. 1233.63 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21833. 1233.63 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21834. 1233.63 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21835. 1233.63 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21836. 1233.63 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21837. 1233.63 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21838. 1233.63 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21839. 1233.63 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  21840. 1233.64 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  21841. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  21842. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  21843. 1233.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21844. 1233.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21845. 1233.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  21846. 1233.64 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  21847. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  21848. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  21849. 1233.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21850. 1233.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21851. 1233.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  21852. 1233.64 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  21853. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  21854. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  21855. 1233.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21856. 1233.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21857. 1233.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  21858. 1233.64 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  21859. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  21860. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  21861. 1233.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21862. 1233.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21863. 1233.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  21864. 1233.64 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  21865. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  21866. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  21867. 1233.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21868. 1233.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21869. 1233.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  21870. 1233.64 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  21871. 1233.64 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  21872. 1233.64 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  21873. 1234.42 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21874. 1234.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21875. 1234.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21876. 1234.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21877. 1234.42 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21878. 1234.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21879. 1234.42 s [algebraic-graphs] Warning: 'empty' is out of scope.
  21880. 1234.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21881. 1234.42 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21882. 1234.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21883. 1234.42 s [algebraic-graphs] Warning: 'edges' is out of scope.
  21884. 1234.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21885. 1234.42 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21886. 1234.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21887. 1234.42 s [algebraic-graphs] Warning: 'stars' is out of scope.
  21888. 1234.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21889. 1234.42 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  21890. 1234.42 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21891. 1234.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21892. 1234.42 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21893. 1234.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21894. 1234.42 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21895. 1234.42 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21896. 1234.42 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21897. 1234.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21898. 1234.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21899. 1234.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21900. 1234.42 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  21901. 1234.42 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  21902. 1234.42 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21903. 1234.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21904. 1234.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21905. 1234.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21906. 1234.42 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  21907. 1234.42 s [algebraic-graphs] Missing documentation for:
  21908. 1234.42 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  21909. 1234.42 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21910. 1234.42 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  21911. 1234.42 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21912. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21913. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21914. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21915. 1234.43 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21916. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  21917. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21918. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21919. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21920. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21921. 1234.43 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21922. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  21923. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21924. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21925. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21926. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21927. 1234.43 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21928. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  21929. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21930. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21931. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21932. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21933. 1234.43 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  21934. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  21935. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21936. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21937. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21938. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21939. 1234.43 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  21940. 1234.43 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  21941. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  21942. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  21943. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21944. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21945. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  21946. 1234.43 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  21947. 1234.43 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  21948. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  21949. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  21950. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21951. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21952. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  21953. 1234.43 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21954. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  21955. 1234.43 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21956. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21957. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21958. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  21959. 1234.43 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  21960. 1234.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21961. 1234.43 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  21962. 1234.43 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21963. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  21964. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21965. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21966. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21967. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21968. 1234.43 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21969. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  21970. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21971. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21972. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21973. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21974. 1234.43 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21975. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21976. 1234.43 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21977. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21978. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21979. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21980. 1234.43 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  21981. 1234.43 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21982. 1234.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21983. 1234.43 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  21984. 1234.43 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21985. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21986. 1234.43 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21987. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21988. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21989. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21990. 1234.43 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  21991. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  21992. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21993. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21994. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21995. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21996. 1234.43 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  21997. 1234.43 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21998. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  21999. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  22000. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22001. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22002. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  22003. 1234.43 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22004. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  22005. 1234.43 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22006. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22007. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22008. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  22009. 1234.43 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  22010. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  22011. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  22012. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22013. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22014. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  22015. 1234.43 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  22016. 1234.43 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  22017. 1234.43 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  22018. 1234.43 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  22019. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  22020. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  22021. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22022. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22023. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  22024. 1234.43 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  22025. 1234.43 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  22026. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  22027. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  22028. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22029. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22030. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  22031. 1234.43 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  22032. 1234.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22033. 1234.43 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  22034. 1234.43 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22035. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  22036. 1234.43 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22037. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22038. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22039. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  22040. 1234.43 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  22041. 1234.43 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  22042. 1234.43 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  22043. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  22044. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  22045. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22046. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22047. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  22048. 1234.43 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  22049. 1234.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22050. 1234.43 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  22051. 1234.43 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  22052. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  22053. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  22054. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22055. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22056. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  22057. 1234.43 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  22058. 1234.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22059. 1234.43 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  22060. 1234.43 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  22061. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  22062. 1234.43 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  22063. 1234.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22064. 1234.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22065. 1234.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  22066. 1234.43 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  22067. 1234.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22068. 1234.43 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  22069. 1234.43 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  22070. 1234.43 s [algebraic-graphs] Missing documentation for:
  22071. 1234.43 s [algebraic-graphs] Module header
  22072. 1234.43 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  22073. 1234.43 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  22074. 1234.43 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  22075. 1234.43 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  22076. 1234.43 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  22077. 1234.44 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  22078. 1234.44 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  22079. 1234.44 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  22080. 1234.44 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  22081. 1234.44 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  22082. 1234.44 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22083. 1234.44 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22084. 1234.44 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  22085. 1234.44 s [algebraic-graphs] Warning: 'array' is out of scope.
  22086. 1234.44 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22087. 1234.44 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  22088. 1234.44 s [algebraic-graphs] Missing documentation for:
  22089. 1234.44 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  22090. 1234.44 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  22091. 1234.44 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  22092. 1234.44 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  22093. 1234.44 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  22094. 1234.44 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  22095. 1234.44 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  22096. 1234.44 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  22097. 1234.44 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  22098. 1234.44 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  22099. 1234.44 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  22100. 1234.44 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  22101. 1234.44 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  22102. 1234.44 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  22103. 1234.46 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  22104. 1234.46 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  22105. 1234.47 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  22106. 1234.47 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  22107. 1234.48 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  22108. 1234.48 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  22109. 1242.89 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  22110. 1242.89 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  22111. 1243.18 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  22112. 1243.18 s [algebraic-graphs] Phase: installPhase
  22113. 1243.18 s [algebraic-graphs] Installing library in /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  22114. 1244.01 s [algebraic-graphs] Phase: fixupPhase
  22115. 1244.04 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7
  22116. 1244.06 s [algebraic-graphs] shrinking /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSalgebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF-ghc9.10.3.so
  22117. 1244.07 s [algebraic-graphs] checking for references to /build/ in /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7...
  22118. 1244.11 s [algebraic-graphs] patching script interpreter paths in /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7
  22119. 1244.12 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/lib
  22120. 1244.47 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc
  22121. 1244.50 s [algebraic-graphs] checking for references to /build/ in /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc...
  22122. 1244.55 s [algebraic-graphs] patching script interpreter paths in /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc
  22123. 1244.77 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7
  22124. 1245.27 s [algebraic-graphs:post-build] Nothing to push - all store paths are already on Cachix.
  22125. 1245.30 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7
  22126. 1245.36 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22127. 1245.38 s [algebraic-graphs:post-build] copying 2 paths...
  22128. 1245.38 s [algebraic-graphs:post-build] copying path '/nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  22129. 1247.28 s [algebraic-graphs:post-build] copying path '/nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  22130. 1258.33 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22131. 1258.33 s [algebraic-graphs:post-build] copying 0 paths...
  22132. 1258.39 s Progress: 10 of 15 built, 159 of 159 downloaded from cache
  22133. 1258.39 s Building /nix/store/27p59dzxgsasnm1l2qgih8lh7w4ly8s6-algebraic-graph-duoids-0.0.1.0.drv
  22134. 1258.40 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  22135. 1258.49 s [algebraic-graph-duoids] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  22136. 1259.23 s [algebraic-graph-duoids] Phase: unpackPhase
  22137. 1259.31 s [algebraic-graph-duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./algebraic-graphs
  22138. 1259.32 s [algebraic-graph-duoids] source root is algebraic-graphs
  22139. 1259.33 s [algebraic-graph-duoids] Phase: patchPhase
  22140. 1259.43 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  22141. 1259.43 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.zXLlPq4zFF/setup-package.conf.d -threaded
  22142. 1259.49 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.zXLlPq4zFF/Main.o )
  22143. 1259.60 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  22144. 1261.45 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  22145. 1261.53 s [algebraic-graph-duoids] Phase: configurePhase
  22146. 1261.96 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.zXLlPq4zFF/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  22147. 1261.97 s [algebraic-graph-duoids] Using Parsec parser
  22148. 1261.97 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  22149. 1262.42 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  22150. 1262.83 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  22151. 1262.83 s [algebraic-graph-duoids] algebraic-graphs-0.7
  22152. 1262.83 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  22153. 1262.83 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  22154. 1262.83 s [algebraic-graph-duoids] <4.23: using base-4.20.2.0
  22155. 1262.83 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  22156. 1262.83 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  22157. 1262.83 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  22158. 1262.83 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  22159. 1262.83 s [algebraic-graph-duoids] algebraic-graphs-0.7
  22160. 1262.84 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  22161. 1262.84 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  22162. 1262.84 s [algebraic-graph-duoids] <4.23: using base-4.20.2.0
  22163. 1262.84 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  22164. 1262.84 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  22165. 1262.84 s [algebraic-graph-duoids] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  22166. 1262.84 s [algebraic-graph-duoids] hedgehog-1.5
  22167. 1262.84 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  22168. 1262.84 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  22169. 1262.84 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  22170. 1262.84 s [algebraic-graph-duoids] <4.23: using base-4.20.2.0
  22171. 1262.84 s [algebraic-graph-duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  22172. 1262.84 s [algebraic-graph-duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  22173. 1262.84 s [algebraic-graph-duoids] doctest-0.24.2
  22174. 1262.84 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  22175. 1262.84 s [algebraic-graph-duoids] Source component graph:
  22176. 1262.84 s [algebraic-graph-duoids] component lib
  22177. 1262.84 s [algebraic-graph-duoids] component test:doctests dependency lib
  22178. 1262.84 s [algebraic-graph-duoids] component test:laws dependency lib
  22179. 1262.84 s [algebraic-graph-duoids] Configured component graph:
  22180. 1262.84 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22181. 1262.84 s [algebraic-graph-duoids] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  22182. 1262.84 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  22183. 1262.84 s [algebraic-graph-duoids] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  22184. 1262.84 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22185. 1262.84 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-9AaeaywO6vaWvAoMck7b7-doctests
  22186. 1262.84 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22187. 1262.84 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  22188. 1262.84 s [algebraic-graph-duoids] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  22189. 1262.84 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22190. 1262.84 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-5qIqiLWJtwP1i7RCUjDxOb-laws
  22191. 1262.84 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22192. 1262.84 s [algebraic-graph-duoids] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  22193. 1262.84 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  22194. 1262.84 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  22195. 1262.84 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22196. 1262.84 s [algebraic-graph-duoids] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  22197. 1262.84 s [algebraic-graph-duoids] Linked component graph:
  22198. 1262.84 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22199. 1262.84 s [algebraic-graph-duoids] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  22200. 1262.84 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  22201. 1262.84 s [algebraic-graph-duoids] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  22202. 1262.84 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22203. 1262.84 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0:Algebra.Graph.Duoid.Orphans
  22204. 1262.84 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-9AaeaywO6vaWvAoMck7b7-doctests
  22205. 1262.84 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22206. 1262.84 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  22207. 1262.84 s [algebraic-graph-duoids] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  22208. 1262.84 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22209. 1262.84 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-5qIqiLWJtwP1i7RCUjDxOb-laws
  22210. 1262.84 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22211. 1262.84 s [algebraic-graph-duoids] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  22212. 1262.84 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  22213. 1262.84 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  22214. 1262.84 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22215. 1262.84 s [algebraic-graph-duoids] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  22216. 1262.84 s [algebraic-graph-duoids] Ready component graph:
  22217. 1262.84 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22218. 1262.84 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  22219. 1262.84 s [algebraic-graph-duoids] depends base-4.20.2.0-64da
  22220. 1262.84 s [algebraic-graph-duoids] depends duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  22221. 1262.84 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22222. 1262.84 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-5qIqiLWJtwP1i7RCUjDxOb-laws
  22223. 1262.84 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22224. 1262.84 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  22225. 1262.84 s [algebraic-graph-duoids] depends base-4.20.2.0-64da
  22226. 1262.84 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  22227. 1262.84 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22228. 1262.84 s [algebraic-graph-duoids] depends hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  22229. 1262.84 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-9AaeaywO6vaWvAoMck7b7-doctests
  22230. 1262.84 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22231. 1262.84 s [algebraic-graph-duoids] depends base-4.20.2.0-64da
  22232. 1262.84 s [algebraic-graph-duoids] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  22233. 1262.84 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22234. 1262.84 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  22235. 1262.84 s [algebraic-graph-duoids] Using compiler: ghc-9.10.3
  22236. 1262.84 s [algebraic-graph-duoids] Using install prefix:
  22237. 1262.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0
  22238. 1262.84 s [algebraic-graph-duoids] Executables installed in:
  22239. 1262.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/bin
  22240. 1262.84 s [algebraic-graph-duoids] Libraries installed in:
  22241. 1262.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22242. 1262.84 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  22243. 1262.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  22244. 1262.84 s [algebraic-graph-duoids] Private executables installed in:
  22245. 1262.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-05f6/algebraic-graph-duoids-0.0.1.0
  22246. 1262.84 s [algebraic-graph-duoids] Data files installed in:
  22247. 1262.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.3-05f6/algebraic-graph-duoids-0.0.1.0
  22248. 1262.84 s [algebraic-graph-duoids] Documentation installed in:
  22249. 1262.84 s [algebraic-graph-duoids] /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  22250. 1262.84 s [algebraic-graph-duoids] Configuration files installed in:
  22251. 1262.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/etc
  22252. 1262.84 s [algebraic-graph-duoids] No alex found
  22253. 1262.84 s [algebraic-graph-duoids] Using ar found on system at:
  22254. 1262.84 s [algebraic-graph-duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  22255. 1262.84 s [algebraic-graph-duoids] No c2hs found
  22256. 1262.84 s [algebraic-graph-duoids] No cpphs found
  22257. 1262.84 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  22258. 1262.84 s [algebraic-graph-duoids] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  22259. 1262.84 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  22260. 1262.84 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  22261. 1262.84 s [algebraic-graph-duoids] Using ghc version 9.10.3 found on system at:
  22262. 1262.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  22263. 1262.84 s [algebraic-graph-duoids] Using ghc-pkg version 9.10.3 found on system at:
  22264. 1262.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  22265. 1262.84 s [algebraic-graph-duoids] No ghcjs found
  22266. 1262.84 s [algebraic-graph-duoids] No ghcjs-pkg found
  22267. 1262.84 s [algebraic-graph-duoids] No greencard found
  22268. 1262.84 s [algebraic-graph-duoids] Using haddock version 2.31.1 found on system at:
  22269. 1262.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  22270. 1262.84 s [algebraic-graph-duoids] No happy found
  22271. 1262.84 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  22272. 1262.84 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  22273. 1262.84 s [algebraic-graph-duoids] No hmake found
  22274. 1262.84 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  22275. 1262.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  22276. 1262.84 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  22277. 1262.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  22278. 1262.84 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  22279. 1262.84 s [algebraic-graph-duoids] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  22280. 1262.84 s [algebraic-graph-duoids] No jhc found
  22281. 1262.84 s [algebraic-graph-duoids] Using ld found on system at:
  22282. 1262.84 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  22283. 1262.84 s [algebraic-graph-duoids] No pkg-config found
  22284. 1262.84 s [algebraic-graph-duoids] Using runghc version 9.10.3 found on system at:
  22285. 1262.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  22286. 1262.84 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  22287. 1262.84 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  22288. 1262.84 s [algebraic-graph-duoids] Using tar found on system at:
  22289. 1262.84 s [algebraic-graph-duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  22290. 1262.84 s [algebraic-graph-duoids] No uhc found
  22291. 1263.15 s [algebraic-graph-duoids] Phase: buildPhase
  22292. 1263.31 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  22293. 1263.31 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  22294. 1263.50 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 )
  22295. 1263.99 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 )
  22296. 1266.68 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  22297. 1267.50 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 )
  22298. 1275.76 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22299. 1275.76 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22300. 1276.06 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  22301. 1277.73 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  22302. 1279.64 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22303. 1279.64 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22304. 1279.93 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 )
  22305. 1280.71 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  22306. 1281.86 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  22307. 1288.19 s [algebraic-graph-duoids] Phase: checkPhase
  22308. 1289.28 s [algebraic-graph-duoids] Running 2 test suites...
  22309. 1289.28 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  22310. 1289.29 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  22311. 1289.29 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  22312. 1289.30 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  22313. 1289.30 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  22314. 1289.30 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  22315. 1289.30 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  22316. 1289.30 s [algebraic-graph-duoids] ✓ 5 succeeded.
  22317. 1289.30 s [algebraic-graph-duoids] Test suite laws: PASS
  22318. 1289.30 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  22319. 1289.30 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  22320. 1290.13 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  22321. 1290.20 s [algebraic-graph-duoids] NameLib Nothing
  22322. 1290.20 s [algebraic-graph-duoids] ----------------------------------------
  22323. 1290.22 s [algebraic-graph-duoids] Test suite doctests: PASS
  22324. 1290.22 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  22325. 1290.22 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  22326. 1290.23 s [algebraic-graph-duoids] Phase: haddockPhase
  22327. 1290.47 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  22328. 1290.47 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  22329. 1291.15 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
  22330. 1291.72 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
  22331. 1292.10 s [algebraic-graph-duoids] Haddock coverage:
  22332. 1292.10 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  22333. 1292.10 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  22334. 1305.13 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  22335. 1305.13 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  22336. 1305.58 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22337. 1305.58 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22338. 1305.59 s [algebraic-graph-duoids] Phase: installPhase
  22339. 1305.67 s [algebraic-graph-duoids] Installing library in /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22340. 1305.96 s [algebraic-graph-duoids] Phase: fixupPhase
  22341. 1305.98 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0
  22342. 1305.99 s [algebraic-graph-duoids] shrinking /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSalgebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0-ghc9.10.3.so
  22343. 1305.99 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0...
  22344. 1306.01 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0
  22345. 1306.02 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/lib
  22346. 1306.06 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc
  22347. 1306.07 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc...
  22348. 1306.09 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc
  22349. 1306.38 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0 /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc
  22350. 1307.45 s [algebraic-graph-duoids:post-build] Nothing to push - all store paths are already on Cachix.
  22351. 1307.54 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0 /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc
  22352. 1307.66 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22353. 1307.70 s [algebraic-graph-duoids:post-build] copying 2 paths...
  22354. 1307.70 s [algebraic-graph-duoids:post-build] copying path '/nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  22355. 1307.98 s [algebraic-graph-duoids:post-build] copying path '/nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  22356. 1308.60 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22357. 1308.70 s [algebraic-graph-duoids:post-build] copying 0 paths...
  22358. 1308.75 s Progress: 11 of 15 built, 159 of 159 downloaded from cache
  22359. 1308.83 s Building /nix/store/1xihsvk0rgmw0jc33wyimrlylp6ma87b-ghc-9.10.3-with-packages.drv
  22360. 1308.89 s [ghc-9.10.3-with-packages] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/nix-support:
  22361. 1308.89 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22362. 1308.90 s [ghc-9.10.3-with-packages] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/nix-support:
  22363. 1308.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22364. 1308.90 s [ghc-9.10.3-with-packages] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/nix-support:
  22365. 1308.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22366. 1308.91 s [ghc-9.10.3-with-packages] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/nix-support:
  22367. 1308.91 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22368. 1308.91 s [ghc-9.10.3-with-packages] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/nix-support:
  22369. 1308.91 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22370. 1308.91 s [ghc-9.10.3-with-packages] /nix/store/mca4hqdxwyqdqrcn2zi2iivca6yf9qhb-ghc-compat-plugin-0.1.0.1/nix-support:
  22371. 1308.91 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22372. 1308.91 s [ghc-9.10.3-with-packages] /nix/store/mca4hqdxwyqdqrcn2zi2iivca6yf9qhb-ghc-compat-plugin-0.1.0.1/nix-support:
  22373. 1308.91 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22374. 1308.92 s [ghc-9.10.3-with-packages] /nix/store/b0lrn2wipwvwzrxxdllwd82g27pa8483-hedgehog-1.5/nix-support:
  22375. 1308.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22376. 1308.92 s [ghc-9.10.3-with-packages] /nix/store/b0lrn2wipwvwzrxxdllwd82g27pa8483-hedgehog-1.5/nix-support:
  22377. 1308.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22378. 1308.92 s [ghc-9.10.3-with-packages] /nix/store/f147jf7r9k02q4r8r58yyy2d0pvni6qp-ansi-terminal-1.1.3/nix-support:
  22379. 1308.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22380. 1308.92 s [ghc-9.10.3-with-packages] /nix/store/f147jf7r9k02q4r8r58yyy2d0pvni6qp-ansi-terminal-1.1.3/nix-support:
  22381. 1308.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22382. 1308.93 s [ghc-9.10.3-with-packages] /nix/store/8zn2w7q66nk2d3l76mbsfgjdbkrxz35f-async-2.2.5/nix-support:
  22383. 1308.93 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22384. 1308.93 s [ghc-9.10.3-with-packages] /nix/store/8zn2w7q66nk2d3l76mbsfgjdbkrxz35f-async-2.2.5/nix-support:
  22385. 1308.93 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22386. 1308.93 s [ghc-9.10.3-with-packages] /nix/store/v4kk7n3dr39cglxrb3b3mnq3xhqr9ygq-barbies-2.1.1.0/nix-support:
  22387. 1308.93 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22388. 1308.94 s [ghc-9.10.3-with-packages] /nix/store/v4kk7n3dr39cglxrb3b3mnq3xhqr9ygq-barbies-2.1.1.0/nix-support:
  22389. 1308.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22390. 1308.94 s [ghc-9.10.3-with-packages] /nix/store/92mmmv96yx7xzbsi8r8c9mnz4hs7b2jg-concurrent-output-1.10.21/nix-support:
  22391. 1308.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22392. 1308.94 s [ghc-9.10.3-with-packages] /nix/store/92mmmv96yx7xzbsi8r8c9mnz4hs7b2jg-concurrent-output-1.10.21/nix-support:
  22393. 1308.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22394. 1308.94 s [ghc-9.10.3-with-packages] /nix/store/6vbk582bi1d1nhhzlxw705s7z7qsbrky-lifted-async-0.10.2.7/nix-support:
  22395. 1308.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22396. 1308.95 s [ghc-9.10.3-with-packages] /nix/store/6vbk582bi1d1nhhzlxw705s7z7qsbrky-lifted-async-0.10.2.7/nix-support:
  22397. 1308.95 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22398. 1308.95 s [ghc-9.10.3-with-packages] /nix/store/9msj85qq1gvwhcz908sbiilrfrdhq3lp-mmorph-1.2.1/nix-support:
  22399. 1308.95 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22400. 1308.95 s [ghc-9.10.3-with-packages] /nix/store/9msj85qq1gvwhcz908sbiilrfrdhq3lp-mmorph-1.2.1/nix-support:
  22401. 1308.95 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22402. 1308.95 s [ghc-9.10.3-with-packages] /nix/store/iillknnvv4x7b9m8853wgpj95fn6k2qf-monad-control-1.0.3.1/nix-support:
  22403. 1308.95 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22404. 1308.95 s [ghc-9.10.3-with-packages] /nix/store/iillknnvv4x7b9m8853wgpj95fn6k2qf-monad-control-1.0.3.1/nix-support:
  22405. 1308.95 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22406. 1308.96 s [ghc-9.10.3-with-packages] /nix/store/cfiih3l00fil2vi6fpvjxl1kll55h6j4-pretty-show-1.10/nix-support:
  22407. 1308.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22408. 1308.96 s [ghc-9.10.3-with-packages] /nix/store/cfiih3l00fil2vi6fpvjxl1kll55h6j4-pretty-show-1.10/nix-support:
  22409. 1308.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22410. 1308.96 s [ghc-9.10.3-with-packages] /nix/store/27n162kkviz2zwcsb1xc8hcwc8c9km67-primitive-0.9.1.0/nix-support:
  22411. 1308.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22412. 1308.96 s [ghc-9.10.3-with-packages] /nix/store/27n162kkviz2zwcsb1xc8hcwc8c9km67-primitive-0.9.1.0/nix-support:
  22413. 1308.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22414. 1308.96 s [ghc-9.10.3-with-packages] /nix/store/rsqv6kj134cgiyf311k8950imffs712n-random-1.2.1.3/nix-support:
  22415. 1308.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22416. 1308.97 s [ghc-9.10.3-with-packages] /nix/store/rsqv6kj134cgiyf311k8950imffs712n-random-1.2.1.3/nix-support:
  22417. 1308.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22418. 1308.97 s [ghc-9.10.3-with-packages] /nix/store/9gwczd0aw4yasspbyrggw32lgagp7q9f-resourcet-1.3.0/nix-support:
  22419. 1308.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22420. 1308.97 s [ghc-9.10.3-with-packages] /nix/store/9gwczd0aw4yasspbyrggw32lgagp7q9f-resourcet-1.3.0/nix-support:
  22421. 1308.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22422. 1308.97 s [ghc-9.10.3-with-packages] /nix/store/pfhmc6sgkrxknfzsl1hmnjkhvd0kwbcr-safe-exceptions-0.1.7.4/nix-support:
  22423. 1308.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22424. 1308.97 s [ghc-9.10.3-with-packages] /nix/store/pfhmc6sgkrxknfzsl1hmnjkhvd0kwbcr-safe-exceptions-0.1.7.4/nix-support:
  22425. 1308.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22426. 1308.97 s [ghc-9.10.3-with-packages] /nix/store/wb64jk3cmlv16vk3bxjcj9jd6021zad9-transformers-base-0.4.6/nix-support:
  22427. 1308.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22428. 1308.97 s [ghc-9.10.3-with-packages] /nix/store/wb64jk3cmlv16vk3bxjcj9jd6021zad9-transformers-base-0.4.6/nix-support:
  22429. 1308.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22430. 1308.98 s [ghc-9.10.3-with-packages] /nix/store/zjpkhy93qrkndn8ba1j1bs2270gzx36k-wl-pprint-annotated-0.1.0.1/nix-support:
  22431. 1308.98 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22432. 1308.98 s [ghc-9.10.3-with-packages] /nix/store/zjpkhy93qrkndn8ba1j1bs2270gzx36k-wl-pprint-annotated-0.1.0.1/nix-support:
  22433. 1308.98 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22434. 1308.98 s [ghc-9.10.3-with-packages] /nix/store/dn2zldw6k1a7hxqi0fs8n1zdfzfpg1rj-ansi-terminal-types-1.1.3/nix-support:
  22435. 1308.98 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22436. 1308.98 s [ghc-9.10.3-with-packages] /nix/store/dn2zldw6k1a7hxqi0fs8n1zdfzfpg1rj-ansi-terminal-types-1.1.3/nix-support:
  22437. 1308.98 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22438. 1308.99 s [ghc-9.10.3-with-packages] /nix/store/r3rsmiyfdiww3xw1jqx6rjz1k1fhzk5i-hashable-1.5.0.0/nix-support:
  22439. 1308.99 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22440. 1308.99 s [ghc-9.10.3-with-packages] /nix/store/r3rsmiyfdiww3xw1jqx6rjz1k1fhzk5i-hashable-1.5.0.0/nix-support:
  22441. 1308.99 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22442. 1308.99 s [ghc-9.10.3-with-packages] /nix/store/lcn9ndq73wfbx5fki5z4dsnskysqnx92-distributive-0.6.2.1/nix-support:
  22443. 1308.99 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22444. 1308.99 s [ghc-9.10.3-with-packages] /nix/store/lcn9ndq73wfbx5fki5z4dsnskysqnx92-distributive-0.6.2.1/nix-support:
  22445. 1308.99 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22446. 1309.00 s [ghc-9.10.3-with-packages] /nix/store/qcbcryh3b168hrs77lyr1a25dika56x0-constraints-0.14.2/nix-support:
  22447. 1309.00 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22448. 1309.00 s [ghc-9.10.3-with-packages] /nix/store/qcbcryh3b168hrs77lyr1a25dika56x0-constraints-0.14.2/nix-support:
  22449. 1309.00 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22450. 1309.00 s [ghc-9.10.3-with-packages] /nix/store/48csrd1s2gzcpf3d3s4j6g5052ya8n4w-lifted-base-0.2.3.12/nix-support:
  22451. 1309.00 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22452. 1309.00 s [ghc-9.10.3-with-packages] /nix/store/48csrd1s2gzcpf3d3s4j6g5052ya8n4w-lifted-base-0.2.3.12/nix-support:
  22453. 1309.00 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22454. 1309.01 s [ghc-9.10.3-with-packages] /nix/store/g5b8zbiw0dqhh2ckjz664ir10qljfvcy-transformers-compat-0.7.2/nix-support:
  22455. 1309.01 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22456. 1309.01 s [ghc-9.10.3-with-packages] /nix/store/g5b8zbiw0dqhh2ckjz664ir10qljfvcy-transformers-compat-0.7.2/nix-support:
  22457. 1309.01 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22458. 1309.01 s [ghc-9.10.3-with-packages] /nix/store/fac3a4hwqmhgmmx1ra67rf82sf77hmxh-splitmix-0.1.3.1/nix-support:
  22459. 1309.01 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22460. 1309.02 s [ghc-9.10.3-with-packages] /nix/store/fac3a4hwqmhgmmx1ra67rf82sf77hmxh-splitmix-0.1.3.1/nix-support:
  22461. 1309.02 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22462. 1309.02 s [ghc-9.10.3-with-packages] /nix/store/llbg63zgzyrq17fwz7q1y1vqnj6vj2fa-unliftio-core-0.2.1.0/nix-support:
  22463. 1309.02 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22464. 1309.02 s [ghc-9.10.3-with-packages] /nix/store/llbg63zgzyrq17fwz7q1y1vqnj6vj2fa-unliftio-core-0.2.1.0/nix-support:
  22465. 1309.02 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22466. 1309.02 s [ghc-9.10.3-with-packages] /nix/store/pamck590w5lych1dj4j31s57plvxb7pf-base-orphans-0.9.3/nix-support:
  22467. 1309.02 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22468. 1309.02 s [ghc-9.10.3-with-packages] /nix/store/pamck590w5lych1dj4j31s57plvxb7pf-base-orphans-0.9.3/nix-support:
  22469. 1309.02 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22470. 1309.02 s [ghc-9.10.3-with-packages] /nix/store/l6b1in1yfspmhzs386qa4yvdd1yw5d3v-tagged-0.8.9/nix-support:
  22471. 1309.02 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22472. 1309.03 s [ghc-9.10.3-with-packages] /nix/store/l6b1in1yfspmhzs386qa4yvdd1yw5d3v-tagged-0.8.9/nix-support:
  22473. 1309.03 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22474. 1309.03 s [ghc-9.10.3-with-packages] /nix/store/hykvsy2hdb9issxg3xm8ah8z48f7h30w-boring-0.2.2/nix-support:
  22475. 1309.03 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22476. 1309.03 s [ghc-9.10.3-with-packages] /nix/store/hykvsy2hdb9issxg3xm8ah8z48f7h30w-boring-0.2.2/nix-support:
  22477. 1309.03 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22478. 1309.91 s [ghc-9.10.3-with-packages] Warning: include-dirs: /nix/store/bcwhbqlv73axa65rnzjz500hfcycvrxs-ghc-9.10.3-with-packages/lib/ghc-9.10.3/lib/../lib/x86_64-linux-ghc-9.10.3/directory-1.3.8.5-c84a/include doesn't exist or isn't a directory
  22479. 1311.54 s [ghc-9.10.3-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/bcwhbqlv73axa65rnzjz500hfcycvrxs-ghc-9.10.3-with-packages
  22480. 1312.03 s [ghc-9.10.3-with-packages:post-build] Nothing to push - all store paths are already on Cachix.
  22481. 1312.06 s [ghc-9.10.3-with-packages:post-build] Uploading to the NixCI cache: /nix/store/bcwhbqlv73axa65rnzjz500hfcycvrxs-ghc-9.10.3-with-packages
  22482. 1312.11 s [ghc-9.10.3-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22483. 1312.16 s [ghc-9.10.3-with-packages:post-build] copying 0 paths...
  22484. 1312.23 s [ghc-9.10.3-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22485. 1312.30 s [ghc-9.10.3-with-packages:post-build] copying 0 paths...
  22486. 1312.32 s Progress: 12 of 14 built, 159 of 159 downloaded from cache
  22487. 1312.38 s Building /nix/store/00m16dy0iydkipqgflspyiwwafn4mnaf-all-packages.drv
  22488. 1312.46 s [all-packages] created 3 symlinks in user environment
  22489. 1312.51 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/9xi8vbgphx6pmc809n9mwbakjylpry1v-all-packages
  22490. 1312.97 s [all-packages:post-build] Nothing to push - all store paths are already on Cachix.
  22491. 1313.00 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/9xi8vbgphx6pmc809n9mwbakjylpry1v-all-packages
  22492. 1313.06 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22493. 1313.10 s [all-packages:post-build] copying 0 paths...
  22494. 1313.17 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22495. 1313.27 s [all-packages:post-build] copying 0 paths...
  22496. 1313.29 s Progress: 13 of 14 built, 159 of 159 downloaded from cache
  22497. 1313.29 s Progress: 14 of 14 built, 159 of 159 downloaded from cache
  22498. 1313.30 s /nix/store/9xi8vbgphx6pmc809n9mwbakjylpry1v-all-packages
  22499. 1313.35 s Build succeeded.
Tail Raw Logs