1. 0.08 s $ /nix/store/vzx1mi9c0xfadmsm9dhd83d005cb1qs9-coreutils-9.8/bin/timeout --kill-after=15s 1800s /nix/store/99b1z08awpxj8b6mzggn59gp1shljnff-nix-2.34.5/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --log-format internal-json build --no-link git+https://github.com/sellout/duoids?ref=renovate%2Flock-file-maintenance&rev=79c06dc2c6c27b38ed3c2352861f2c3765b5e4c5#devShells.x86_64-linux.ghc948 --print-build-logs
  2. 0.18 s fetching Git repository 'https://github.com/sellout/duoids'
  3. 0.66 s remote: Enumerating objects: 430, done.
  4. 0.67 s remote: Counting objects: 0% (1/118) remote: Counting objects: 1% (2/118) remote: Counting objects: 2% (3/118) remote: Counting objects: 3% (4/118) remote: Counting objects: 4% (5/118) remote: Counting objects: 5% (6/118) remote: Counting objects: 6% (8/118) remote: Counting objects: 7% (9/118) remote: Counting objects: 8% (10/118) remote: Counting objects: 9% (11/118) remote: Counting objects: 10% (12/118) remote: Counting objects: 11% (13/118) remote: Counting objects: 12% (15/118) remote: Counting objects: 13% (16/118) remote: Counting objects: 14% (17/118) remote: Counting objects: 15% (18/118) remote: Counting objects: 16% (19/118) remote: Counting objects: 17% (21/118) remote: Counting objects: 18% (22/118) remote: Counting objects: 19% (23/118) remote: Counting objects: 20% (24/118) remote: Counting objects: 21% (25/118) remote: Counting objects: 22% (26/118) remote: Counting objects: 23% (28/118) remote: Counting objects: 24% (29/118) remote: Counting objects: 25% (30/118) remote: Counting objects: 26% (31/118) remote: Counting objects: 27% (32/118) remote: Counting objects: 28% (34/118) remote: Counting objects: 29% (35/118) remote: Counting objects: 30% (36/118) remote: Counting objects: 31% (37/118) remote: Counting objects: 32% (38/118) remote: Counting objects: 33% (39/118) remote: Counting objects: 34% (41/118) remote: Counting objects: 35% (42/118) remote: Counting objects: 36% (43/118) remote: Counting objects: 37% (44/118) remote: Counting objects: 38% (45/118) remote: Counting objects: 39% (47/118) remote: Counting objects: 40% (48/118) remote: Counting objects: 41% (49/118) remote: Counting objects: 42% (50/118) remote: Counting objects: 43% (51/118) remote: Counting objects: 44% (52/118) remote: Counting objects: 45% (54/118) remote: Counting objects: 46% (55/118) remote: Counting objects: 47% (56/118) remote: Counting objects: 48% (57/118) remote: Counting objects: 49% (58/118) remote: Counting objects: 50% (59/118) remote: Counting objects: 51% (61/118) remote: Counting objects: 52% (62/118) remote: Counting objects: 53% (63/118) remote: Counting objects: 54% (64/118) remote: Counting objects: 55% (65/118) remote: Counting objects: 56% (67/118) remote: Counting objects: 57% (68/118) remote: Counting objects: 58% (69/118) remote: Counting objects: 59% (70/118) remote: Counting objects: 60% (71/118) remote: Counting objects: 61% (72/118) remote: Counting objects: 62% (74/118) remote: Counting objects: 63% (75/118) remote: Counting objects: 64% (76/118) remote: Counting objects: 65% (77/118) remote: Counting objects: 66% (78/118) remote: Counting objects: 67% (80/118) remote: Counting objects: 68% (81/118) remote: Counting objects: 69% (82/118) remote: Counting objects: 70% (83/118) remote: Counting objects: 71% (84/118) remote: Counting objects: 72% (85/118) remote: Counting objects: 73% (87/118) remote: Counting objects: 74% (88/118) remote: Counting objects: 75% (89/118) remote: Counting objects: 76% (90/118) remote: Counting objects: 77% (91/118) remote: Counting objects: 78% (93/118) remote: Counting objects: 79% (94/118) remote: Counting objects: 80% (95/118) remote: Counting objects: 81% (96/118) remote: Counting objects: 82% (97/118) remote: Counting objects: 83% (98/118) remote: Counting objects: 84% (100/118) remote: Counting objects: 85% (101/118) remote: Counting objects: 86% (102/118) remote: Counting objects: 87% (103/118) remote: Counting objects: 88% (104/118) remote: Counting objects: 89% (106/118) remote: Counting objects: 90% (107/118) remote: Counting objects: 91% (108/118) remote: Counting objects: 92% (109/118) remote: Counting objects: 93% (110/118) remote: Counting objects: 94% (111/118) remote: Counting objects: 95% (113/118) remote: Counting objects: 96% (114/118) remote: Counting objects: 97% (115/118) remote: Counting objects: 98% (116/118) remote: Counting objects: 99% (117/118) remote: Counting objects: 100% (118/118) remote: Counting objects: 100% (118/118), done.
  5. 0.67 s remote: Compressing objects: 2% (1/48) remote: Compressing objects: 4% (2/48) remote: Compressing objects: 6% (3/48) remote: Compressing objects: 8% (4/48) remote: Compressing objects: 10% (5/48) remote: Compressing objects: 12% (6/48) remote: Compressing objects: 14% (7/48) remote: Compressing objects: 16% (8/48) remote: Compressing objects: 18% (9/48) remote: Compressing objects: 20% (10/48) remote: Compressing objects: 22% (11/48) remote: Compressing objects: 25% (12/48) remote: Compressing objects: 27% (13/48) remote: Compressing objects: 29% (14/48) remote: Compressing objects: 31% (15/48) remote: Compressing objects: 33% (16/48) remote: Compressing objects: 35% (17/48) remote: Compressing objects: 37% (18/48) remote: Compressing objects: 39% (19/48) remote: Compressing objects: 41% (20/48) remote: Compressing objects: 43% (21/48) remote: Compressing objects: 45% (22/48) remote: Compressing objects: 47% (23/48) remote: Compressing objects: 50% (24/48) remote: Compressing objects: 52% (25/48) remote: Compressing objects: 54% (26/48) remote: Compressing objects: 56% (27/48) remote: Compressing objects: 58% (28/48) remote: Compressing objects: 60% (29/48) remote: Compressing objects: 62% (30/48) remote: Compressing objects: 64% (31/48) remote: Compressing objects: 66% (32/48) remote: Compressing objects: 68% (33/48) remote: Compressing objects: 70% (34/48) remote: Compressing objects: 72% (35/48) remote: Compressing objects: 75% (36/48) remote: Compressing objects: 77% (37/48) remote: Compressing objects: 79% (38/48) remote: Compressing objects: 81% (39/48) remote: Compressing objects: 83% (40/48) remote: Compressing objects: 85% (41/48) remote: Compressing objects: 87% (42/48) remote: Compressing objects: 89% (43/48) remote: Compressing objects: 91% (44/48) remote: Compressing objects: 93% (45/48) remote: Compressing objects: 95% (46/48) remote: Compressing objects: 97% (47/48) remote: Compressing objects: 100% (48/48) remote: Compressing objects: 100% (48/48), done.
  6. 0.74 s Receiving objects: 0% (1/430) Receiving objects: 1% (5/430) Receiving objects: 2% (9/430) Receiving objects: 3% (13/430) Receiving objects: 4% (18/430) Receiving objects: 5% (22/430) Receiving objects: 6% (26/430) Receiving objects: 7% (31/430) Receiving objects: 8% (35/430) Receiving objects: 9% (39/430) Receiving objects: 10% (43/430) Receiving objects: 11% (48/430) Receiving objects: 12% (52/430) Receiving objects: 13% (56/430) Receiving objects: 14% (61/430) Receiving objects: 15% (65/430) Receiving objects: 16% (69/430) Receiving objects: 17% (74/430) Receiving objects: 18% (78/430) Receiving objects: 19% (82/430) Receiving objects: 20% (86/430) Receiving objects: 21% (91/430) Receiving objects: 22% (95/430) Receiving objects: 23% (99/430) Receiving objects: 24% (104/430) Receiving objects: 25% (108/430) Receiving objects: 26% (112/430) Receiving objects: 27% (117/430) Receiving objects: 28% (121/430) Receiving objects: 29% (125/430) Receiving objects: 30% (129/430) Receiving objects: 31% (134/430) Receiving objects: 32% (138/430) Receiving objects: 33% (142/430) Receiving objects: 34% (147/430) Receiving objects: 35% (151/430) Receiving objects: 36% (155/430) Receiving objects: 37% (160/430) Receiving objects: 38% (164/430) Receiving objects: 39% (168/430) Receiving objects: 40% (172/430) Receiving objects: 41% (177/430) Receiving objects: 42% (181/430) Receiving objects: 43% (185/430) Receiving objects: 44% (190/430) Receiving objects: 45% (194/430) Receiving objects: 46% (198/430) Receiving objects: 47% (203/430) Receiving objects: 48% (207/430) Receiving objects: 49% (211/430) Receiving objects: 50% (215/430) Receiving objects: 51% (220/430) Receiving objects: 52% (224/430) Receiving objects: 53% (228/430) Receiving objects: 54% (233/430) Receiving objects: 55% (237/430) Receiving objects: 56% (241/430) Receiving objects: 57% (246/430) Receiving objects: 58% (250/430) Receiving objects: 59% (254/430) Receiving objects: 60% (258/430) Receiving objects: 61% (263/430) Receiving objects: 62% (267/430) Receiving objects: 63% (271/430) Receiving objects: 64% (276/430) Receiving objects: 65% (280/430) Receiving objects: 66% (284/430) Receiving objects: 67% (289/430) Receiving objects: 68% (293/430) Receiving objects: 69% (297/430) Receiving objects: 70% (301/430) Receiving objects: 71% (306/430) Receiving objects: 72% (310/430) Receiving objects: 73% (314/430) Receiving objects: 74% (319/430) Receiving objects: 75% (323/430) Receiving objects: 76% (327/430) Receiving objects: 77% (332/430) Receiving objects: 78% (336/430) Receiving objects: 79% (340/430) Receiving objects: 80% (344/430) Receiving objects: 81% (349/430) Receiving objects: 82% (353/430) Receiving objects: 83% (357/430) Receiving objects: 84% (362/430) Receiving objects: 85% (366/430) Receiving objects: 86% (370/430) Receiving objects: 87% (375/430) Receiving objects: 88% (379/430) Receiving objects: 89% (383/430) Receiving objects: 90% (387/430) Receiving objects: 91% (392/430) Receiving objects: 92% (396/430) remote: Total 430 (delta 84), reused 78 (delta 69), pack-reused 312 (from 1)
  7. 0.74 s Receiving objects: 93% (400/430) Receiving objects: 94% (405/430) Receiving objects: 95% (409/430) Receiving objects: 96% (413/430) Receiving objects: 97% (418/430) Receiving objects: 98% (422/430) Receiving objects: 99% (426/430) Receiving objects: 100% (430/430) Receiving objects: 100% (430/430), 149.95 KiB | 3.00 MiB/s, done.
  8. 0.75 s Resolving deltas: 0% (0/225) Resolving deltas: 1% (3/225) Resolving deltas: 2% (5/225) Resolving deltas: 3% (7/225) Resolving deltas: 4% (9/225) Resolving deltas: 5% (12/225) Resolving deltas: 6% (14/225) Resolving deltas: 7% (16/225) Resolving deltas: 8% (18/225) Resolving deltas: 9% (21/225) Resolving deltas: 10% (23/225) Resolving deltas: 11% (25/225) Resolving deltas: 12% (27/225) Resolving deltas: 13% (30/225) Resolving deltas: 14% (32/225) Resolving deltas: 15% (34/225) Resolving deltas: 16% (36/225) Resolving deltas: 17% (39/225) Resolving deltas: 18% (41/225) Resolving deltas: 19% (43/225) Resolving deltas: 20% (45/225) Resolving deltas: 21% (48/225) Resolving deltas: 22% (50/225) Resolving deltas: 23% (52/225) Resolving deltas: 24% (54/225) Resolving deltas: 25% (57/225) Resolving deltas: 26% (59/225) Resolving deltas: 27% (61/225) Resolving deltas: 28% (63/225) Resolving deltas: 29% (66/225) Resolving deltas: 30% (68/225) Resolving deltas: 31% (70/225) Resolving deltas: 32% (72/225) Resolving deltas: 33% (75/225) Resolving deltas: 34% (77/225) Resolving deltas: 35% (79/225) Resolving deltas: 36% (82/225) Resolving deltas: 38% (86/225) Resolving deltas: 39% (88/225) Resolving deltas: 40% (91/225) Resolving deltas: 41% (93/225) Resolving deltas: 42% (96/225) Resolving deltas: 43% (97/225) Resolving deltas: 44% (99/225) Resolving deltas: 45% (103/225) Resolving deltas: 46% (104/225) Resolving deltas: 47% (107/225) Resolving deltas: 48% (109/225) Resolving deltas: 49% (111/225) Resolving deltas: 50% (113/225) Resolving deltas: 51% (115/225) Resolving deltas: 52% (118/225) Resolving deltas: 53% (121/225) Resolving deltas: 54% (122/225) Resolving deltas: 55% (124/225) Resolving deltas: 56% (126/225) Resolving deltas: 57% (129/225) Resolving deltas: 58% (131/225) Resolving deltas: 59% (133/225) Resolving deltas: 60% (135/225) Resolving deltas: 61% (138/225) Resolving deltas: 62% (140/225) Resolving deltas: 63% (142/225) Resolving deltas: 64% (146/225) Resolving deltas: 65% (147/225) Resolving deltas: 66% (149/225) Resolving deltas: 67% (151/225) Resolving deltas: 68% (153/225) Resolving deltas: 69% (156/225) Resolving deltas: 70% (158/225) Resolving deltas: 71% (160/225) Resolving deltas: 72% (162/225) Resolving deltas: 73% (165/225) Resolving deltas: 74% (167/225) Resolving deltas: 75% (169/225) Resolving deltas: 76% (171/225) Resolving deltas: 77% (174/225) Resolving deltas: 78% (176/225) Resolving deltas: 79% (178/225) Resolving deltas: 80% (180/225) Resolving deltas: 81% (183/225) Resolving deltas: 82% (185/225) Resolving deltas: 83% (187/225) Resolving deltas: 84% (189/225) Resolving deltas: 85% (192/225) Resolving deltas: 86% (194/225) Resolving deltas: 87% (197/225) Resolving deltas: 88% (198/225) Resolving deltas: 89% (201/225) Resolving deltas: 90% (203/225) Resolving deltas: 91% (205/225) Resolving deltas: 92% (207/225) Resolving deltas: 93% (210/225) Resolving deltas: 94% (212/225) Resolving deltas: 95% (214/225) Resolving deltas: 96% (216/225) Resolving deltas: 97% (219/225) Resolving deltas: 98% (222/225) Resolving deltas: 99% (223/225) Resolving deltas: 100% (225/225) Resolving deltas: 100% (225/225), done.
  9. 0.76 s From https://github.com/sellout/duoids
  10. 0.76 s * branch 79c06dc2c6c27b38ed3c2352861f2c3765b5e4c5 -> FETCH_HEAD
  11. 0.83 s warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
  12. 0.83 s Pass '--accept-flake-config' to trust it
  13. 0.83 s warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
  14. 0.83 s Pass '--accept-flake-config' to trust it
  15. 0.83 s warning: ignoring untrusted flake configuration setting 'extra-substituters'.
  16. 0.83 s Pass '--accept-flake-config' to trust it
  17. 0.83 s warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
  18. 0.83 s Pass '--accept-flake-config' to trust it
  19. 0.83 s warning: ignoring untrusted flake configuration setting 'sandbox'.
  20. 0.83 s Pass '--accept-flake-config' to trust it
  21. 0.83 s warning: ignoring untrusted flake configuration setting 'use-registries'.
  22. 0.83 s Pass '--accept-flake-config' to trust it
  23. 1.21 s 'system' has been renamed to/replaced by 'stdenv.hostPlatform.system'
  24. 2.06 s
  25. 2.08 s Building cabal2nix-algebraic-graph-duoids
  26. 2.23 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/9ydnvi1cbgss8lsfclw2w88wvbb2qili-cabal2nix-algebraic-graph-duoids
  27. 2.91 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  28. 2.93 s [post-build-hook] Uploading to the NixCI cache: /nix/store/9ydnvi1cbgss8lsfclw2w88wvbb2qili-cabal2nix-algebraic-graph-duoids
  29. 2.98 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  30. 3.24 s [post-build-hook] copying 1 paths...
  31. 3.24 s [post-build-hook] copying path '/nix/store/9ydnvi1cbgss8lsfclw2w88wvbb2qili-cabal2nix-algebraic-graph-duoids' to 'https://cache.nix-ci.com'...
  32. 3.36 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  33. 3.49 s [post-build-hook] copying 0 paths...
  34. 3.51 s Progress: 1 of 2 built
  35. 3.51 s
  36. 3.54 s Building cabal2nix-duoidal-transformers
  37. 3.62 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/h5461q295mk9vqg2rllfnxmdb4kirc8f-cabal2nix-duoidal-transformers
  38. 4.11 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  39. 4.13 s [post-build-hook] Uploading to the NixCI cache: /nix/store/h5461q295mk9vqg2rllfnxmdb4kirc8f-cabal2nix-duoidal-transformers
  40. 4.17 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  41. 4.37 s [post-build-hook] copying 1 paths...
  42. 4.37 s [post-build-hook] copying path '/nix/store/h5461q295mk9vqg2rllfnxmdb4kirc8f-cabal2nix-duoidal-transformers' to 'https://cache.nix-ci.com'...
  43. 4.83 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  44. 4.99 s [post-build-hook] copying 0 paths...
  45. 5.00 s Progress: 1 of 2 built
  46. 5.01 s
  47. 5.04 s Building cabal2nix-duoids
  48. 5.11 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/441yj89niabbfbdz0p7ds102nbp0g5fs-cabal2nix-duoids
  49. 5.54 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  50. 5.55 s [post-build-hook] Uploading to the NixCI cache: /nix/store/441yj89niabbfbdz0p7ds102nbp0g5fs-cabal2nix-duoids
  51. 5.59 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  52. 5.80 s [post-build-hook] copying 1 paths...
  53. 5.80 s [post-build-hook] copying path '/nix/store/441yj89niabbfbdz0p7ds102nbp0g5fs-cabal2nix-duoids' to 'https://cache.nix-ci.com'...
  54. 5.98 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  55. 6.14 s [post-build-hook] copying 0 paths...
  56. 6.16 s Progress: 1 of 2 built
  57. 6.17 s
  58. 6.19 s Building cabal2nix-duoids-hedgehog
  59. 6.27 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/x35icwyd9l1a43hciw0jj0nm3865bksz-cabal2nix-duoids-hedgehog
  60. 6.83 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  61. 6.85 s [post-build-hook] Uploading to the NixCI cache: /nix/store/x35icwyd9l1a43hciw0jj0nm3865bksz-cabal2nix-duoids-hedgehog
  62. 6.89 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  63. 7.09 s [post-build-hook] copying 1 paths...
  64. 7.09 s [post-build-hook] copying path '/nix/store/x35icwyd9l1a43hciw0jj0nm3865bksz-cabal2nix-duoids-hedgehog' to 'https://cache.nix-ci.com'...
  65. 7.20 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  66. 7.36 s [post-build-hook] copying 0 paths...
  67. 7.38 s Progress: 1 of 2 built
  68. 7.62 s
  69. 7.70 s Building cabal2nix-ghc-compat-plugin
  70. 7.78 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/ps3r5l1r0iby5l1lx88s9yi1qy24q720-cabal2nix-ghc-compat-plugin
  71. 8.22 s [post-build-hook] Pushing 1 paths (1 are already present) using zstd to cache sellout ⏳
  72. 8.22 s [post-build-hook]
  73. 8.84 s [post-build-hook] Pushing /nix/store/ps3r5l1r0iby5l1lx88s9yi1qy24q720-cabal2nix-ghc-compat-plugin (720.00 B)
  74. 9.94 s [post-build-hook]
  75. 9.94 s [post-build-hook] All done.
  76. 9.95 s [post-build-hook] Uploading to the NixCI cache: /nix/store/ps3r5l1r0iby5l1lx88s9yi1qy24q720-cabal2nix-ghc-compat-plugin
  77. 9.99 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  78. 10.24 s [post-build-hook] copying 1 paths...
  79. 10.28 s [post-build-hook] copying path '/nix/store/ps3r5l1r0iby5l1lx88s9yi1qy24q720-cabal2nix-ghc-compat-plugin' to 'https://cache.nix-ci.com'...
  80. 10.36 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  81. 10.85 s [post-build-hook] copying 1 paths...
  82. 10.85 s [post-build-hook] copying path '/nix/store/z1yfryybzf2m5703ylc3n6ilz385x8ip-cabal2nix-ghc-compat-plugin.drv' to 'https://cache.nix-ci.com'...
  83. 11.08 s Progress: 1 of 2 built
  84. 11.13 s
  85. 15.29 s Downloading cached ghc-9.4.8-doc from https://cache.nix-ci.com
  86. 19.16 s Progress: 0 of 84 built, 1 of 152 downloaded from cache
  87. 19.20 s Downloading cached OneTuple-0.4.2-doc from https://cache.nix-ci.com
  88. 19.20 s Downloading cached assoc-1.1.1-doc from https://cache.nix-ci.com
  89. 19.20 s Downloading cached base-compat-0.14.1-doc from https://cache.nix-ci.com
  90. 19.20 s Downloading cached base-orphans-0.9.3-doc from https://cache.nix-ci.com
  91. 19.20 s Downloading cached call-stack-0.4.0-doc from https://cache.nix-ci.com
  92. 19.20 s Downloading cached clock-0.8.4-doc from https://cache.nix-ci.com
  93. 19.20 s Downloading cached code-page-0.2.1-doc from https://cache.nix-ci.com
  94. 19.20 s Downloading cached colour-2.3.6-doc from https://cache.nix-ci.com
  95. 19.20 s Downloading cached erf-2.0.0.0-doc from https://cache.nix-ci.com
  96. 19.20 s Downloading cached ghc from https://cache.nix-ci.com
  97. 19.20 s Downloading cached ghc-compat-plugin-0.1.0.1-doc from https://cache.nix-ci.com
  98. 19.20 s Downloading cached haskell-lexer-1.2.1-doc from https://cache.nix-ci.com
  99. 19.20 s Downloading cached hspec-discover-2.11.14-doc from https://cache.nix-ci.com
  100. 19.20 s Downloading cached inspection-testing-0.6.2-doc from https://cache.nix-ci.com
  101. 19.20 s Downloading cached integer-logarithms-1.0.4-doc from https://cache.nix-ci.com
  102. 19.20 s Downloading cached mmorph-1.2.1-doc from https://cache.nix-ci.com
  103. 19.20 s Progress: 0 of 83 built, 2 of 152 downloaded from cache (15 downloading)
  104. 19.20 s Progress: 0 of 83 built, 3 of 152 downloaded from cache (14 downloading)
  105. 19.20 s Progress: 0 of 83 built, 4 of 152 downloaded from cache (13 downloading)
  106. 19.20 s Progress: 0 of 83 built, 5 of 152 downloaded from cache (12 downloading)
  107. 19.20 s Progress: 0 of 83 built, 6 of 152 downloaded from cache (11 downloading)
  108. 19.20 s Progress: 0 of 83 built, 7 of 152 downloaded from cache (10 downloading)
  109. 19.20 s Progress: 0 of 83 built, 8 of 152 downloaded from cache (9 downloading)
  110. 19.20 s Progress: 0 of 83 built, 9 of 152 downloaded from cache (8 downloading)
  111. 19.20 s Progress: 0 of 83 built, 10 of 152 downloaded from cache (7 downloading)
  112. 19.20 s Progress: 0 of 83 built, 11 of 152 downloaded from cache (6 downloading)
  113. 19.20 s Progress: 0 of 83 built, 12 of 152 downloaded from cache (5 downloading)
  114. 19.20 s Progress: 0 of 83 built, 13 of 152 downloaded from cache (4 downloading)
  115. 19.20 s Progress: 0 of 83 built, 14 of 152 downloaded from cache (3 downloading)
  116. 19.20 s Downloading cached old-locale-1.0.0.7-doc from https://cache.nix-ci.com
  117. 19.20 s Downloading cached os-string-2.0.8-doc from https://cache.nix-ci.com
  118. 19.20 s Downloading cached prettyprinter-1.7.1-doc from https://cache.nix-ci.com
  119. 19.20 s Downloading cached primitive-0.9.1.0-doc from https://cache.nix-ci.com
  120. 19.20 s Downloading cached safe-exceptions-0.1.7.4-doc from https://cache.nix-ci.com
  121. 19.20 s Downloading cached silently-1.2.5.4-doc from https://cache.nix-ci.com
  122. 19.20 s Downloading cached splitmix-0.1.3.1-doc from https://cache.nix-ci.com
  123. 19.20 s Downloading cached stringbuilder-0.5.1-doc from https://cache.nix-ci.com
  124. 19.20 s Downloading cached syb-0.7.2.4-doc from https://cache.nix-ci.com
  125. 19.20 s Downloading cached tagged-0.8.9-doc from https://cache.nix-ci.com
  126. 19.20 s Downloading cached terminal-size-0.3.4-doc from https://cache.nix-ci.com
  127. 19.20 s Downloading cached transformers-base-0.4.6-doc from https://cache.nix-ci.com
  128. 19.20 s Downloading cached transformers-compat-0.7.2-doc from https://cache.nix-ci.com
  129. 19.20 s Progress: 0 of 82 built, 15 of 152 downloaded from cache (15 downloading)
  130. 19.20 s Progress: 0 of 82 built, 16 of 152 downloaded from cache (14 downloading)
  131. 19.20 s Progress: 0 of 82 built, 17 of 152 downloaded from cache (13 downloading)
  132. 19.20 s Progress: 0 of 82 built, 18 of 152 downloaded from cache (12 downloading)
  133. 19.20 s Progress: 0 of 82 built, 19 of 152 downloaded from cache (11 downloading)
  134. 19.20 s Progress: 0 of 82 built, 20 of 152 downloaded from cache (10 downloading)
  135. 19.20 s Progress: 0 of 82 built, 21 of 152 downloaded from cache (9 downloading)
  136. 19.20 s Progress: 0 of 82 built, 22 of 152 downloaded from cache (8 downloading)
  137. 19.20 s Progress: 0 of 82 built, 23 of 152 downloaded from cache (7 downloading)
  138. 19.20 s Progress: 0 of 82 built, 24 of 152 downloaded from cache (6 downloading)
  139. 19.20 s Progress: 0 of 82 built, 25 of 152 downloaded from cache (5 downloading)
  140. 19.20 s Progress: 0 of 82 built, 26 of 152 downloaded from cache (4 downloading)
  141. 19.20 s Progress: 0 of 82 built, 27 of 152 downloaded from cache (3 downloading)
  142. 19.20 s Progress: 0 of 82 built, 28 of 152 downloaded from cache (2 downloading)
  143. 19.20 s Progress: 0 of 82 built, 29 of 152 downloaded from cache (1 downloading)
  144. 19.20 s Downloading cached HUnit-1.6.2.0-doc from https://cache.nix-ci.com
  145. 19.20 s Downloading cached ansi-terminal-types-1.1.3-doc from https://cache.nix-ci.com
  146. 19.20 s Downloading cached logging-facade-0.3.1-doc from https://cache.nix-ci.com
  147. 19.20 s Downloading cached pretty-show-1.10-doc from https://cache.nix-ci.com
  148. 19.20 s Downloading cached unliftio-core-0.2.1.0-doc from https://cache.nix-ci.com
  149. 19.20 s Downloading cached vector-stream-0.1.0.1-doc from https://cache.nix-ci.com
  150. 19.20 s Downloading cached wherefrom-compat-0.1.1.1-doc from https://cache.nix-ci.com
  151. 19.20 s Downloading cached wl-pprint-annotated-0.1.0.1-doc from https://cache.nix-ci.com
  152. 19.20 s Downloading cached boring-0.2.2-doc from https://cache.nix-ci.com
  153. 19.20 s Downloading cached distributive-0.6.2.1-doc from https://cache.nix-ci.com
  154. 19.20 s Downloading cached hashable-1.4.7.0-doc from https://cache.nix-ci.com
  155. 19.20 s Downloading cached monad-control-1.0.3.1-doc from https://cache.nix-ci.com
  156. 19.21 s Downloading cached old-time-1.1.0.4-doc from https://cache.nix-ci.com
  157. 19.21 s Downloading cached random-1.2.1.3-doc from https://cache.nix-ci.com
  158. 19.21 s Progress: 0 of 82 built, 30 of 152 downloaded from cache (14 downloading)
  159. 19.21 s Progress: 0 of 82 built, 31 of 152 downloaded from cache (13 downloading)
  160. 19.21 s Progress: 0 of 82 built, 32 of 152 downloaded from cache (12 downloading)
  161. 19.21 s Progress: 0 of 82 built, 33 of 152 downloaded from cache (11 downloading)
  162. 19.21 s Progress: 0 of 82 built, 34 of 152 downloaded from cache (10 downloading)
  163. 19.21 s Progress: 0 of 82 built, 35 of 152 downloaded from cache (9 downloading)
  164. 19.21 s Progress: 0 of 82 built, 36 of 152 downloaded from cache (8 downloading)
  165. 19.21 s Progress: 0 of 82 built, 37 of 152 downloaded from cache (7 downloading)
  166. 19.21 s Progress: 0 of 82 built, 38 of 152 downloaded from cache (6 downloading)
  167. 19.21 s Progress: 0 of 82 built, 39 of 152 downloaded from cache (5 downloading)
  168. 19.21 s Progress: 0 of 82 built, 40 of 152 downloaded from cache (4 downloading)
  169. 19.21 s Progress: 0 of 82 built, 41 of 152 downloaded from cache (3 downloading)
  170. 19.21 s Downloading cached ansi-terminal-1.1.3-doc from https://cache.nix-ci.com
  171. 19.21 s Downloading cached async-2.2.5-doc from https://cache.nix-ci.com
  172. 19.21 s Downloading cached barbies-2.1.1.0-doc from https://cache.nix-ci.com
  173. 19.21 s Downloading cached case-insensitive-1.2.1.0-doc from https://cache.nix-ci.com
  174. 19.21 s Downloading cached constraints-0.14.2-doc from https://cache.nix-ci.com
  175. 19.21 s Downloading cached data-fix-0.3.4-doc from https://cache.nix-ci.com
  176. 19.21 s Downloading cached hspec-expectations-0.8.4-doc from https://cache.nix-ci.com
  177. 19.21 s Downloading cached lifted-base-0.2.3.12-doc from https://cache.nix-ci.com
  178. 19.21 s Downloading cached resourcet-1.3.0-doc from https://cache.nix-ci.com
  179. 19.21 s Downloading cached scientific-0.3.8.0-doc from https://cache.nix-ci.com
  180. 19.21 s Downloading cached text-short-0.1.6-doc from https://cache.nix-ci.com
  181. 19.21 s Downloading cached these-1.2.1-doc from https://cache.nix-ci.com
  182. 19.21 s Downloading cached time-compat-1.9.8-doc from https://cache.nix-ci.com
  183. 19.21 s Progress: 0 of 82 built, 42 of 152 downloaded from cache (15 downloading)
  184. 19.21 s Progress: 0 of 82 built, 43 of 152 downloaded from cache (14 downloading)
  185. 19.21 s Progress: 0 of 82 built, 44 of 152 downloaded from cache (13 downloading)
  186. 19.21 s Downloading cached prettyprinter-ansi-terminal-1.1.3-doc from https://cache.nix-ci.com
  187. 19.21 s Downloading cached QuickCheck-2.15.0.1-doc from https://cache.nix-ci.com
  188. 19.21 s Downloading cached temporary-1.3-doc from https://cache.nix-ci.com
  189. 19.21 s Progress: 0 of 82 built, 45 of 152 downloaded from cache (15 downloading)
  190. 19.21 s Downloading cached tf-random-0.5-doc from https://cache.nix-ci.com
  191. 19.27 s Progress: 0 of 82 built, 46 of 152 downloaded from cache (15 downloading)
  192. 19.27 s Downloading cached uuid-types-1.0.6-doc from https://cache.nix-ci.com
  193. 19.29 s Progress: 0 of 82 built, 47 of 152 downloaded from cache (15 downloading)
  194. 19.29 s Progress: 0 of 82 built, 48 of 152 downloaded from cache (14 downloading)
  195. 19.31 s Progress: 0 of 82 built, 49 of 152 downloaded from cache (13 downloading)
  196. 19.33 s Progress: 0 of 82 built, 50 of 152 downloaded from cache (12 downloading)
  197. 19.35 s Progress: 0 of 82 built, 51 of 152 downloaded from cache (11 downloading)
  198. 19.35 s Downloading cached strict-0.5.1-doc from https://cache.nix-ci.com
  199. 19.35 s Progress: 0 of 82 built, 52 of 152 downloaded from cache (11 downloading)
  200. 19.35 s Downloading cached concurrent-output-1.10.21-doc from https://cache.nix-ci.com
  201. 19.37 s Progress: 0 of 82 built, 53 of 152 downloaded from cache (11 downloading)
  202. 19.37 s Downloading cached mockery-0.3.5-doc from https://cache.nix-ci.com
  203. 19.38 s Progress: 0 of 82 built, 54 of 152 downloaded from cache (11 downloading)
  204. 19.38 s Downloading cached optparse-applicative-0.18.1.0-doc from https://cache.nix-ci.com
  205. 19.38 s Progress: 0 of 82 built, 55 of 152 downloaded from cache (11 downloading)
  206. 19.39 s Progress: 0 of 82 built, 56 of 152 downloaded from cache (10 downloading)
  207. 19.43 s Progress: 0 of 82 built, 57 of 152 downloaded from cache (9 downloading)
  208. 19.44 s Progress: 0 of 82 built, 58 of 152 downloaded from cache (8 downloading)
  209. 19.46 s Progress: 0 of 82 built, 59 of 152 downloaded from cache (7 downloading)
  210. 19.48 s Progress: 0 of 82 built, 60 of 152 downloaded from cache (6 downloading)
  211. 19.48 s Downloading cached lifted-async-0.10.2.7-doc from https://cache.nix-ci.com
  212. 19.49 s Progress: 0 of 82 built, 61 of 152 downloaded from cache (6 downloading)
  213. 19.49 s Downloading cached ChasingBottoms-1.3.1.17-doc from https://cache.nix-ci.com
  214. 19.49 s Downloading cached quickcheck-io-0.2.0-doc from https://cache.nix-ci.com
  215. 19.68 s Progress: 0 of 82 built, 62 of 152 downloaded from cache (7 downloading)
  216. 19.70 s Progress: 0 of 82 built, 63 of 152 downloaded from cache (6 downloading)
  217. 19.73 s Progress: 0 of 82 built, 64 of 152 downloaded from cache (5 downloading)
  218. 19.77 s Progress: 0 of 82 built, 65 of 152 downloaded from cache (4 downloading)
  219. 19.77 s Downloading cached tasty-1.5.3-doc from https://cache.nix-ci.com
  220. 19.78 s Progress: 0 of 82 built, 66 of 152 downloaded from cache (4 downloading)
  221. 19.79 s Progress: 0 of 82 built, 67 of 152 downloaded from cache (3 downloading)
  222. 19.79 s Downloading cached hspec-core-2.11.14-doc from https://cache.nix-ci.com
  223. 19.82 s Progress: 0 of 82 built, 68 of 152 downloaded from cache (3 downloading)
  224. 20.11 s Progress: 0 of 82 built, 69 of 152 downloaded from cache (2 downloading)
  225. 20.11 s Downloading cached hspec-2.11.14-doc from https://cache.nix-ci.com
  226. 20.13 s Progress: 0 of 82 built, 70 of 152 downloaded from cache (2 downloading)
  227. 20.13 s Downloading cached tasty-hedgehog-1.4.0.2-doc from https://cache.nix-ci.com
  228. 20.13 s Downloading cached tasty-hunit-0.10.2-doc from https://cache.nix-ci.com
  229. 20.13 s Downloading cached tasty-inspection-testing-0.2.1-doc from https://cache.nix-ci.com
  230. 20.13 s Downloading cached tasty-quickcheck-0.11.1-doc from https://cache.nix-ci.com
  231. 20.39 s Progress: 0 of 82 built, 71 of 152 downloaded from cache (5 downloading)
  232. 20.43 s Progress: 0 of 82 built, 72 of 152 downloaded from cache (4 downloading)
  233. 20.46 s Progress: 0 of 82 built, 73 of 152 downloaded from cache (3 downloading)
  234. 20.46 s Progress: 0 of 82 built, 74 of 152 downloaded from cache (2 downloading)
  235. 20.51 s Progress: 0 of 82 built, 75 of 152 downloaded from cache (1 downloading)
  236. 49.43 s Progress: 0 of 82 built, 76 of 152 downloaded from cache
  237. 49.44 s Downloading cached assoc from https://cache.nix-ci.com
  238. 49.47 s Downloading cached base-compat from https://cache.nix-ci.com
  239. 49.47 s Downloading cached clock from https://cache.nix-ci.com
  240. 49.47 s Downloading cached code-page from https://cache.nix-ci.com
  241. 49.47 s Downloading cached base-orphans from https://cache.nix-ci.com
  242. 49.47 s Downloading cached call-stack from https://cache.nix-ci.com
  243. 49.47 s Downloading cached colour from https://cache.nix-ci.com
  244. 49.47 s Downloading cached erf from https://cache.nix-ci.com
  245. 49.47 s Downloading cached ghc-compat-plugin from https://cache.nix-ci.com
  246. 49.47 s Downloading cached haskell-lexer from https://cache.nix-ci.com
  247. 49.47 s Downloading cached hspec-discover from https://cache.nix-ci.com
  248. 49.47 s Downloading cached inspection-testing from https://cache.nix-ci.com
  249. 49.47 s Downloading cached integer-logarithms from https://cache.nix-ci.com
  250. 49.47 s Downloading cached old-locale from https://cache.nix-ci.com
  251. 49.47 s Downloading cached os-string from https://cache.nix-ci.com
  252. 49.47 s Downloading cached prettyprinter from https://cache.nix-ci.com
  253. 49.47 s Waiting for lock on waiting for lock on '/nix/store/sb63k4x3p6917zkr90illlvk0q0fk26g-Cabal-syntax-3.12.1.0-doc', '/nix/store/xmpz5r3lk1rxsgyk6y46s2w58ampfr5g-Cabal-syntax
  254. 49.47 s Progress: 0 of 81 built, 77 of 152 downloaded from cache (15 downloading)
  255. 49.47 s Progress: 0 of 81 built, 78 of 152 downloaded from cache (14 downloading)
  256. 49.47 s Progress: 0 of 81 built, 79 of 152 downloaded from cache (13 downloading)
  257. 49.47 s Progress: 0 of 81 built, 80 of 152 downloaded from cache (12 downloading)
  258. 49.47 s Progress: 0 of 81 built, 81 of 152 downloaded from cache (11 downloading)
  259. 49.47 s Progress: 0 of 81 built, 82 of 152 downloaded from cache (10 downloading)
  260. 49.47 s Progress: 0 of 81 built, 83 of 152 downloaded from cache (9 downloading)
  261. 49.47 s Progress: 0 of 81 built, 84 of 152 downloaded from cache (8 downloading)
  262. 49.47 s Progress: 0 of 81 built, 85 of 152 downloaded from cache (7 downloading)
  263. 49.47 s Progress: 0 of 81 built, 86 of 152 downloaded from cache (6 downloading)
  264. 49.47 s Progress: 0 of 81 built, 87 of 152 downloaded from cache (5 downloading)
  265. 49.48 s Progress: 0 of 81 built, 88 of 152 downloaded from cache (4 downloading)
  266. 49.48 s Progress: 0 of 81 built, 89 of 152 downloaded from cache (3 downloading)
  267. 49.48 s Progress: 0 of 81 built, 90 of 152 downloaded from cache (2 downloading)
  268. 49.48 s Progress: 0 of 81 built, 91 of 152 downloaded from cache (1 downloading)
  269. 49.48 s Progress: 0 of 81 built, 92 of 152 downloaded from cache
  270. 49.48 s Downloading cached primitive from https://cache.nix-ci.com
  271. 49.48 s Downloading cached safe-exceptions from https://cache.nix-ci.com
  272. 49.48 s Downloading cached silently from https://cache.nix-ci.com
  273. 49.48 s Downloading cached splitmix from https://cache.nix-ci.com
  274. 49.48 s Downloading cached stringbuilder from https://cache.nix-ci.com
  275. 49.48 s Downloading cached syb from https://cache.nix-ci.com
  276. 49.48 s Downloading cached tagged from https://cache.nix-ci.com
  277. 49.48 s Downloading cached terminal-size from https://cache.nix-ci.com
  278. 49.48 s Downloading cached transformers-compat from https://cache.nix-ci.com
  279. 49.48 s Downloading cached unliftio-core from https://cache.nix-ci.com
  280. 49.48 s Downloading cached vector-stream from https://cache.nix-ci.com
  281. 49.48 s Downloading cached wherefrom-compat from https://cache.nix-ci.com
  282. 49.48 s Downloading cached HUnit from https://cache.nix-ci.com
  283. 49.48 s Downloading cached ansi-terminal-types from https://cache.nix-ci.com
  284. 49.48 s Downloading cached hashable from https://cache.nix-ci.com
  285. 49.48 s Progress: 0 of 70 built, 93 of 152 downloaded from cache (15 downloading)
  286. 49.48 s Progress: 0 of 70 built, 94 of 152 downloaded from cache (14 downloading)
  287. 49.48 s Progress: 0 of 70 built, 95 of 152 downloaded from cache (13 downloading)
  288. 49.48 s Progress: 0 of 70 built, 96 of 152 downloaded from cache (12 downloading)
  289. 49.48 s Progress: 0 of 70 built, 97 of 152 downloaded from cache (11 downloading)
  290. 49.48 s Progress: 0 of 70 built, 98 of 152 downloaded from cache (10 downloading)
  291. 49.48 s Progress: 0 of 70 built, 99 of 152 downloaded from cache (9 downloading)
  292. 49.48 s Progress: 0 of 70 built, 100 of 152 downloaded from cache (8 downloading)
  293. 49.48 s Progress: 0 of 70 built, 101 of 152 downloaded from cache (7 downloading)
  294. 49.48 s Progress: 0 of 70 built, 102 of 152 downloaded from cache (6 downloading)
  295. 49.48 s Progress: 0 of 70 built, 103 of 152 downloaded from cache (5 downloading)
  296. 49.48 s Progress: 0 of 70 built, 104 of 152 downloaded from cache (4 downloading)
  297. 49.48 s Progress: 0 of 70 built, 105 of 152 downloaded from cache (3 downloading)
  298. 49.48 s Progress: 0 of 70 built, 106 of 152 downloaded from cache (2 downloading)
  299. 49.48 s Progress: 0 of 70 built, 107 of 152 downloaded from cache (1 downloading)
  300. 49.48 s Downloading cached wl-pprint-annotated from https://cache.nix-ci.com
  301. 49.48 s Downloading cached async from https://cache.nix-ci.com
  302. 49.48 s Downloading cached case-insensitive from https://cache.nix-ci.com
  303. 49.48 s Downloading cached pretty-show from https://cache.nix-ci.com
  304. 49.48 s Downloading cached old-time from https://cache.nix-ci.com
  305. 49.48 s Downloading cached distributive from https://cache.nix-ci.com
  306. 49.48 s Downloading cached data-fix from https://cache.nix-ci.com
  307. 49.48 s Downloading cached logging-facade from https://cache.nix-ci.com
  308. 49.48 s Downloading cached boring from https://cache.nix-ci.com
  309. 49.48 s Downloading cached resourcet from https://cache.nix-ci.com
  310. 49.48 s Downloading cached ansi-terminal from https://cache.nix-ci.com
  311. 49.48 s Downloading cached mmorph from https://cache.nix-ci.com
  312. 49.48 s Downloading cached hspec-expectations from https://cache.nix-ci.com
  313. 49.48 s Downloading cached random from https://cache.nix-ci.com
  314. 49.48 s Downloading cached foldable1-classes-compat from https://cache.nix-ci.com
  315. 49.48 s Progress: 0 of 55 built, 108 of 152 downloaded from cache (15 downloading)
  316. 49.48 s Progress: 0 of 55 built, 109 of 152 downloaded from cache (14 downloading)
  317. 49.48 s Progress: 0 of 55 built, 110 of 152 downloaded from cache (13 downloading)
  318. 49.48 s Progress: 0 of 55 built, 111 of 152 downloaded from cache (12 downloading)
  319. 49.48 s Progress: 0 of 55 built, 112 of 152 downloaded from cache (11 downloading)
  320. 49.48 s Progress: 0 of 55 built, 113 of 152 downloaded from cache (10 downloading)
  321. 49.48 s Progress: 0 of 55 built, 114 of 152 downloaded from cache (9 downloading)
  322. 49.48 s Progress: 0 of 55 built, 115 of 152 downloaded from cache (8 downloading)
  323. 49.48 s Downloading cached transformers-base from https://cache.nix-ci.com
  324. 49.48 s Downloading cached text-short from https://cache.nix-ci.com
  325. 49.48 s Downloading cached time-compat from https://cache.nix-ci.com
  326. 49.48 s Downloading cached barbies from https://cache.nix-ci.com
  327. 49.48 s Downloading cached scientific from https://cache.nix-ci.com
  328. 49.48 s Downloading cached constraints from https://cache.nix-ci.com
  329. 49.48 s Progress: 0 of 48 built, 116 of 152 downloaded from cache (12 downloading)
  330. 49.48 s Progress: 0 of 48 built, 117 of 152 downloaded from cache (11 downloading)
  331. 49.48 s Progress: 0 of 48 built, 118 of 152 downloaded from cache (10 downloading)
  332. 49.48 s Progress: 0 of 48 built, 119 of 152 downloaded from cache (9 downloading)
  333. 49.48 s Progress: 0 of 48 built, 120 of 152 downloaded from cache (8 downloading)
  334. 49.48 s Progress: 0 of 48 built, 121 of 152 downloaded from cache (7 downloading)
  335. 49.48 s Progress: 0 of 48 built, 122 of 152 downloaded from cache (6 downloading)
  336. 49.48 s Downloading cached prettyprinter-ansi-terminal from https://cache.nix-ci.com
  337. 49.48 s Progress: 0 of 43 built, 123 of 152 downloaded from cache (9 downloading)
  338. 49.48 s Progress: 0 of 43 built, 124 of 152 downloaded from cache (8 downloading)
  339. 49.48 s Progress: 0 of 43 built, 125 of 152 downloaded from cache (7 downloading)
  340. 49.48 s Progress: 0 of 43 built, 126 of 152 downloaded from cache (6 downloading)
  341. 49.48 s Progress: 0 of 43 built, 127 of 152 downloaded from cache (5 downloading)
  342. 49.48 s Downloading cached OneTuple from https://cache.nix-ci.com
  343. 49.48 s Downloading cached concurrent-output from https://cache.nix-ci.com
  344. 49.48 s Downloading cached these from https://cache.nix-ci.com
  345. 49.48 s Progress: 0 of 39 built, 128 of 152 downloaded from cache (6 downloading)
  346. 49.48 s Progress: 0 of 39 built, 129 of 152 downloaded from cache (5 downloading)
  347. 49.48 s Progress: 0 of 39 built, 130 of 152 downloaded from cache (4 downloading)
  348. 49.48 s Progress: 0 of 39 built, 131 of 152 downloaded from cache (3 downloading)
  349. 49.48 s Downloading cached monad-control from https://cache.nix-ci.com
  350. 49.48 s Downloading cached optparse-applicative from https://cache.nix-ci.com
  351. 49.48 s Downloading cached QuickCheck from https://cache.nix-ci.com
  352. 49.48 s Downloading cached temporary from https://cache.nix-ci.com
  353. 49.48 s Downloading cached uuid-types from https://cache.nix-ci.com
  354. 49.48 s Progress: 0 of 35 built, 132 of 152 downloaded from cache (6 downloading)
  355. 49.49 s Progress: 0 of 35 built, 133 of 152 downloaded from cache (5 downloading)
  356. 49.49 s Progress: 0 of 35 built, 134 of 152 downloaded from cache (4 downloading)
  357. 49.49 s Progress: 0 of 35 built, 135 of 152 downloaded from cache (3 downloading)
  358. 49.49 s Progress: 0 of 35 built, 136 of 152 downloaded from cache (2 downloading)
  359. 49.49 s Progress: 0 of 35 built, 137 of 152 downloaded from cache (1 downloading)
  360. 49.49 s Downloading cached lifted-base from https://cache.nix-ci.com
  361. 49.49 s Downloading cached mockery from https://cache.nix-ci.com
  362. 49.49 s Progress: 0 of 30 built, 138 of 152 downloaded from cache (6 downloading)
  363. 49.49 s Progress: 0 of 30 built, 139 of 152 downloaded from cache (5 downloading)
  364. 49.49 s Downloading cached tf-random from https://cache.nix-ci.com
  365. 49.49 s Downloading cached quickcheck-io from https://cache.nix-ci.com
  366. 49.49 s Downloading cached tasty from https://cache.nix-ci.com
  367. 49.49 s Downloading cached strict from https://cache.nix-ci.com
  368. 49.49 s Downloading cached lifted-async from https://cache.nix-ci.com
  369. 49.49 s Progress: 0 of 28 built, 140 of 152 downloaded from cache (5 downloading)
  370. 49.49 s Progress: 0 of 28 built, 141 of 152 downloaded from cache (4 downloading)
  371. 49.49 s Progress: 0 of 28 built, 142 of 152 downloaded from cache (3 downloading)
  372. 49.49 s Downloading cached tasty-hunit from https://cache.nix-ci.com
  373. 49.49 s Downloading cached tasty-quickcheck from https://cache.nix-ci.com
  374. 49.49 s Downloading cached tasty-inspection-testing from https://cache.nix-ci.com
  375. 49.49 s Downloading cached ChasingBottoms from https://cache.nix-ci.com
  376. 49.49 s Progress: 0 of 26 built, 143 of 152 downloaded from cache (5 downloading)
  377. 49.49 s Progress: 0 of 26 built, 144 of 152 downloaded from cache (4 downloading)
  378. 49.49 s Progress: 0 of 26 built, 145 of 152 downloaded from cache (3 downloading)
  379. 49.49 s Progress: 0 of 26 built, 146 of 152 downloaded from cache (2 downloading)
  380. 49.49 s Downloading cached hedgehog from https://cache.nix-ci.com
  381. 49.49 s Downloading cached hspec-core from https://cache.nix-ci.com
  382. 49.49 s Progress: 0 of 23 built, 147 of 152 downloaded from cache (3 downloading)
  383. 49.49 s Progress: 0 of 23 built, 148 of 152 downloaded from cache (2 downloading)
  384. 49.49 s Progress: 0 of 23 built, 149 of 152 downloaded from cache (1 downloading)
  385. 49.49 s Progress: 0 of 23 built, 150 of 152 downloaded from cache
  386. 49.49 s Downloading cached hspec from https://cache.nix-ci.com
  387. 49.49 s Downloading cached tasty-hedgehog from https://cache.nix-ci.com
  388. 49.49 s Progress: 0 of 19 built, 151 of 152 downloaded from cache (1 downloading)
  389. 49.49 s Progress: 0 of 19 built, 152 of 152 downloaded from cache
  390. 179.59 s Waiting for lock on waiting for lock on '/nix/store/an89r3vx2sj8hygv6hyqmrg6aqvwh37m-Cabal-3.12.1.0-doc', '/nix/store/qwpjg0whfp59bvjbbd3zj7d7av19frrj-Cabal
  391. 289.71 s Waiting for lock on waiting for lock on '/nix/store/78b6z0a9zmy5f96car6nmr393h6ysvhp-cabal-doctest-1.0.12-doc', '/nix/store/9awxkcf7mf8r2p73q0p3jwkkz5jhxk1j-cabal-doctest
  392. 289.74 s Waiting for lock on waiting for lock on '/nix/store/53jxbk2lk8d5w0z7k9mhwgachz62qpb6-ghc-paths-0.1.0.12', '/nix/store/9yrq27pzk62v94mhwbng6abd191a88vs-ghc-paths-0.1.0.12-doc'
  393. 299.72 s Waiting for lock on waiting for lock on '/nix/store/iwqw5xnc7zqlhkh89a1v3r3jmwkfja1c-doctest-0.24.2', '/nix/store/nlxg1ixj56ccg46jama6d1vr3hcfwy81-doctest-0.24.2-doc'
  394. 364.79 s Waiting for lock on waiting for lock on '/nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector
  395. 424.98 s Building vector
  396. 425.11 s [vector] Phase: setupCompilerEnvironmentPhase
  397. 425.14 s [vector] Build with /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8.
  398. 425.28 s [vector] Phase: unpackPhase
  399. 425.29 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  400. 425.29 s [vector] source root is vector-0.13.2.0
  401. 425.30 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  402. 425.31 s [vector] Phase: patchPhase
  403. 425.31 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  404. 425.32 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  405. 425.34 s [vector] Phase: compileBuildDriverPhase
  406. 425.34 s [vector] setupCompileFlags: -package-db=/build/tmp.1pkh4N3xuw/setup-package.conf.d -threaded
  407. 425.39 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.1pkh4N3xuw/Main.o )
  408. 425.44 s [vector] [2 of 2] Linking Setup
  409. 426.45 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  410. 426.46 s [vector] Phase: configurePhase
  411. 426.47 s [vector] configureFlags: --verbose --prefix=/nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.1pkh4N3xuw/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/lib
  412. 427.02 s [vector] Using Parsec parser
  413. 427.02 s [vector] Configuring vector-0.13.2.0...
  414. 427.02 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  415. 427.02 s [vector] wall=False
  416. 427.02 s [vector] Dependency base: using base-4.17.2.1
  417. 427.02 s [vector] Dependency deepseq: using deepseq-1.4.8.0
  418. 427.02 s [vector] Dependency primitive: using primitive-0.9.1.0
  419. 427.02 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  420. 427.02 s [vector] Dependency base: using base-4.17.2.1
  421. 427.02 s [vector] Dependency random: using random-1.2.1.3
  422. 427.02 s [vector] Dependency tasty: using tasty-1.5.3
  423. 427.02 s [vector] Dependency vector: using vector-0.13.2.0
  424. 427.02 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  425. 427.02 s [vector] Dependency base: using base-4.17.2.1
  426. 427.02 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  427. 427.02 s [vector] Dependency primitive: using primitive-0.9.1.0
  428. 427.02 s [vector] Dependency random: using random-1.2.1.3
  429. 427.02 s [vector] Dependency tasty: using tasty-1.5.3
  430. 427.02 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  431. 427.02 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  432. 427.02 s [vector] Dependency template-haskell: using template-haskell-2.19.0.0
  433. 427.02 s [vector] Dependency transformers: using transformers-0.5.6.2
  434. 427.02 s [vector] Dependency vector: using vector-0.13.2.0
  435. 427.02 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  436. 427.02 s [vector] Dependency base: using base-4.17.2.1
  437. 427.02 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  438. 427.02 s [vector] Dependency primitive: using primitive-0.9.1.0
  439. 427.02 s [vector] Dependency random: using random-1.2.1.3
  440. 427.02 s [vector] Dependency tasty: using tasty-1.5.3
  441. 427.02 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  442. 427.02 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  443. 427.02 s [vector] Dependency template-haskell: using template-haskell-2.19.0.0
  444. 427.02 s [vector] Dependency transformers: using transformers-0.5.6.2
  445. 427.02 s [vector] Dependency vector: using vector-0.13.2.0
  446. 427.02 s [vector] Dependency base: using base-4.17.2.1
  447. 427.02 s [vector] Dependency doctest: using doctest-0.24.2
  448. 427.02 s [vector] Dependency primitive: using primitive-0.9.1.0
  449. 427.02 s [vector] Dependency vector: using vector-0.13.2.0
  450. 427.02 s [vector] Dependency base: using base-4.17.2.1
  451. 427.02 s [vector] Dependency primitive: using primitive-0.9.1.0
  452. 427.02 s [vector] Dependency tasty: using tasty-1.5.3
  453. 427.02 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  454. 427.02 s [vector] Dependency vector: using vector-0.13.2.0
  455. 427.21 s [vector] Source component graph:
  456. 427.21 s [vector] component lib
  457. 427.21 s [vector] component lib:benchmarks-O2 dependency lib
  458. 427.21 s [vector] component test:vector-doctest dependency lib
  459. 427.21 s [vector] component test:vector-inspection dependency lib
  460. 427.21 s [vector] component test:vector-tests-O0 dependency lib
  461. 427.21 s [vector] component test:vector-tests-O2 dependency lib
  462. 427.21 s [vector] Configured component graph:
  463. 427.21 s [vector] component vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  464. 427.21 s [vector] include base-4.17.2.1
  465. 427.21 s [vector] include deepseq-1.4.8.0
  466. 427.21 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  467. 427.21 s [vector] include vector-stream-0.1.0.1-F03bfhC0HhqL26lQDSs4vb
  468. 427.21 s [vector] component vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  469. 427.21 s [vector] include base-4.17.2.1
  470. 427.21 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  471. 427.21 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  472. 427.21 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  473. 427.21 s [vector] component vector-0.13.2.0-BrHxLv2KUPv5Fn8v7eQoOx-vector-doctest
  474. 427.21 s [vector] include base-4.17.2.1
  475. 427.21 s [vector] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  476. 427.21 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  477. 427.21 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  478. 427.21 s [vector] component vector-0.13.2.0-5Q4kMcUxhdwEKrCweElQP4-vector-inspection
  479. 427.21 s [vector] include base-4.17.2.1
  480. 427.21 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  481. 427.21 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  482. 427.21 s [vector] include tasty-inspection-testing-0.2.1-48CUMaIHGWv8RqzO1O1dns
  483. 427.21 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  484. 427.21 s [vector] component vector-0.13.2.0-HRM4UhWJxA9CssEeWd3cIj-vector-tests-O0
  485. 427.21 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  486. 427.21 s [vector] include base-4.17.2.1
  487. 427.21 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  488. 427.21 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  489. 427.21 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  490. 427.21 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  491. 427.21 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  492. 427.21 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  493. 427.21 s [vector] include template-haskell-2.19.0.0
  494. 427.21 s [vector] include transformers-0.5.6.2
  495. 427.21 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  496. 427.21 s [vector] component vector-0.13.2.0-HvmzB5mUEm43fHZBv42gz1-vector-tests-O2
  497. 427.21 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  498. 427.21 s [vector] include base-4.17.2.1
  499. 427.21 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  500. 427.21 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  501. 427.21 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  502. 427.21 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  503. 427.21 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  504. 427.21 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  505. 427.21 s [vector] include template-haskell-2.19.0.0
  506. 427.21 s [vector] include transformers-0.5.6.2
  507. 427.21 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  508. 427.21 s [vector] Linked component graph:
  509. 427.21 s [vector] unit vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  510. 427.21 s [vector] include base-4.17.2.1
  511. 427.21 s [vector] include deepseq-1.4.8.0
  512. 427.21 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  513. 427.21 s [vector] include vector-stream-0.1.0.1-F03bfhC0HhqL26lQDSs4vb
  514. 427.21 s [vector] Data.Vector=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Unboxed.Mutable
  515. 427.21 s [vector] unit vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  516. 427.21 s [vector] include base-4.17.2.1
  517. 427.21 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  518. 427.21 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  519. 427.21 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  520. 427.21 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.TestData.ParenTree
  521. 427.21 s [vector] unit vector-0.13.2.0-BrHxLv2KUPv5Fn8v7eQoOx-vector-doctest
  522. 427.21 s [vector] include base-4.17.2.1
  523. 427.21 s [vector] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  524. 427.21 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  525. 427.21 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  526. 427.21 s [vector] unit vector-0.13.2.0-5Q4kMcUxhdwEKrCweElQP4-vector-inspection
  527. 427.21 s [vector] include base-4.17.2.1
  528. 427.21 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  529. 427.21 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  530. 427.21 s [vector] include tasty-inspection-testing-0.2.1-48CUMaIHGWv8RqzO1O1dns
  531. 427.21 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  532. 427.21 s [vector] unit vector-0.13.2.0-HRM4UhWJxA9CssEeWd3cIj-vector-tests-O0
  533. 427.21 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  534. 427.21 s [vector] include base-4.17.2.1
  535. 427.21 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  536. 427.21 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  537. 427.21 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  538. 427.21 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  539. 427.21 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  540. 427.21 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  541. 427.21 s [vector] include template-haskell-2.19.0.0
  542. 427.21 s [vector] include transformers-0.5.6.2
  543. 427.21 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  544. 427.21 s [vector] unit vector-0.13.2.0-HvmzB5mUEm43fHZBv42gz1-vector-tests-O2
  545. 427.21 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  546. 427.21 s [vector] include base-4.17.2.1
  547. 427.21 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  548. 427.35 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  549. 427.35 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  550. 427.35 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  551. 427.35 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  552. 427.35 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  553. 427.35 s [vector] include template-haskell-2.19.0.0
  554. 427.35 s [vector] include transformers-0.5.6.2
  555. 427.35 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  556. 427.35 s [vector] Ready component graph:
  557. 427.35 s [vector] definite vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  558. 427.35 s [vector] depends base-4.17.2.1
  559. 427.35 s [vector] depends deepseq-1.4.8.0
  560. 427.35 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  561. 427.35 s [vector] depends vector-stream-0.1.0.1-F03bfhC0HhqL26lQDSs4vb
  562. 427.35 s [vector] definite vector-0.13.2.0-BrHxLv2KUPv5Fn8v7eQoOx-vector-doctest
  563. 427.35 s [vector] depends base-4.17.2.1
  564. 427.35 s [vector] depends doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  565. 427.35 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  566. 427.35 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  567. 427.35 s [vector] definite vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  568. 427.35 s [vector] depends base-4.17.2.1
  569. 427.35 s [vector] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  570. 427.35 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  571. 427.35 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  572. 427.35 s [vector] definite vector-0.13.2.0-HRM4UhWJxA9CssEeWd3cIj-vector-tests-O0
  573. 427.35 s [vector] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  574. 427.35 s [vector] depends base-4.17.2.1
  575. 427.35 s [vector] depends base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  576. 427.35 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  577. 427.35 s [vector] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  578. 427.35 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  579. 427.35 s [vector] depends tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  580. 427.35 s [vector] depends tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  581. 427.35 s [vector] depends template-haskell-2.19.0.0
  582. 427.35 s [vector] depends transformers-0.5.6.2
  583. 427.35 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  584. 427.35 s [vector] definite vector-0.13.2.0-HvmzB5mUEm43fHZBv42gz1-vector-tests-O2
  585. 427.35 s [vector] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  586. 427.35 s [vector] depends base-4.17.2.1
  587. 427.35 s [vector] depends base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  588. 427.35 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  589. 427.35 s [vector] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  590. 427.35 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  591. 427.35 s [vector] depends tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  592. 427.35 s [vector] depends tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  593. 427.35 s [vector] depends template-haskell-2.19.0.0
  594. 427.35 s [vector] depends transformers-0.5.6.2
  595. 427.35 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  596. 427.35 s [vector] definite vector-0.13.2.0-5Q4kMcUxhdwEKrCweElQP4-vector-inspection
  597. 427.35 s [vector] depends base-4.17.2.1
  598. 427.35 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  599. 427.35 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  600. 427.35 s [vector] depends tasty-inspection-testing-0.2.1-48CUMaIHGWv8RqzO1O1dns
  601. 427.35 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  602. 427.35 s [vector] Using Cabal-3.8.1.0 compiled by ghc-9.4
  603. 427.35 s [vector] Using compiler: ghc-9.4.8
  604. 427.35 s [vector] Using install prefix:
  605. 427.35 s [vector] /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0
  606. 427.35 s [vector] Executables installed in:
  607. 427.35 s [vector] /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/bin
  608. 427.35 s [vector] Libraries installed in:
  609. 427.35 s [vector] /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  610. 427.35 s [vector] Dynamic Libraries installed in:
  611. 427.35 s [vector] /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  612. 427.35 s [vector] Private executables installed in:
  613. 427.35 s [vector] /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.4.8/vector-0.13.2.0
  614. 427.35 s [vector] Data files installed in:
  615. 427.35 s [vector] /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/share/x86_64-linux-ghc-9.4.8/vector-0.13.2.0
  616. 427.35 s [vector] Documentation installed in:
  617. 427.35 s [vector] /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.4.8/vector-0.13.2.0
  618. 427.35 s [vector] Configuration files installed in:
  619. 427.35 s [vector] /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/etc
  620. 427.35 s [vector] No alex found
  621. 427.35 s [vector] Using ar found on system at:
  622. 427.35 s [vector] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  623. 427.35 s [vector] No c2hs found
  624. 427.35 s [vector] No cpphs found
  625. 427.35 s [vector] Using doctest version 0.24.2 found on system at:
  626. 427.35 s [vector] /nix/store/iwqw5xnc7zqlhkh89a1v3r3jmwkfja1c-doctest-0.24.2/bin/doctest
  627. 427.35 s [vector] Using gcc version 14.3.0 given by user at:
  628. 427.35 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  629. 427.35 s [vector] Using ghc version 9.4.8 found on system at:
  630. 427.35 s [vector] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc
  631. 427.35 s [vector] Using ghc-pkg version 9.4.8 found on system at:
  632. 427.35 s [vector] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc-pkg-9.4.8
  633. 427.35 s [vector] No ghcjs found
  634. 427.35 s [vector] No ghcjs-pkg found
  635. 427.35 s [vector] No greencard found
  636. 427.35 s [vector] Using haddock version 2.27.0 found on system at:
  637. 427.35 s [vector] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/haddock-ghc-9.4.8
  638. 427.35 s [vector] No happy found
  639. 427.35 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  640. 427.35 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  641. 427.35 s [vector] No hmake found
  642. 427.35 s [vector] Using hpc version 0.68 found on system at:
  643. 427.35 s [vector] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hpc
  644. 427.35 s [vector] Using hsc2hs version 0.68.8 found on system at:
  645. 427.35 s [vector] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hsc2hs
  646. 427.35 s [vector] Using hscolour version 1.25 found on system at:
  647. 427.35 s [vector] /nix/store/iqxq9idsxcwnhgibgzzj6w82ba81jia4-hscolour-1.25/bin/HsColour
  648. 427.35 s [vector] No jhc found
  649. 427.35 s [vector] Using ld found on system at:
  650. 427.35 s [vector] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  651. 427.35 s [vector] No pkg-config found
  652. 427.35 s [vector] Using runghc version 9.4.8 found on system at:
  653. 427.35 s [vector] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/runghc-9.4.8
  654. 427.35 s [vector] Using strip version 2.44 found on system at:
  655. 427.35 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  656. 427.35 s [vector] Using tar found on system at:
  657. 427.35 s [vector] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  658. 427.35 s [vector] No uhc found
  659. 427.36 s [vector] Phase: buildPhase
  660. 427.44 s [vector] Preprocessing library for vector-0.13.2.0..
  661. 427.45 s [vector] Building library for vector-0.13.2.0..
  662. 428.17 s [vector] [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.o, dist/build/Data/Vector/Fusion/Stream/Monadic.dyn_o )
  663. 428.24 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 )
  664. 428.26 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 )
  665. 428.47 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 )
  666. 428.47 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 )
  667. 428.47 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 )
  668. 428.47 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 )
  669. 433.28 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 )
  670. 436.02 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 )
  671. 438.68 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 )
  672. 439.09 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 )
  673. 446.12 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 )
  674. 446.15 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  675. 453.17 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 )
  676. 453.20 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 )
  677. 453.20 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 )
  678. 453.20 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 )
  679. 453.20 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 )
  680. 453.20 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 )
  681. 453.20 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 )
  682. 459.47 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.o, dist/build/Data/Vector/Unboxed/Base.dyn_o )
  683. 464.47 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.o, dist/build/Data/Vector/Unboxed.dyn_o )
  684. 470.34 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 )
  685. 471.22 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 )
  686. 471.36 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  687. 471.37 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 )
  688. 471.65 s [vector] [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.p_o )
  689. 471.65 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  690. 471.65 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  691. 471.65 s [vector] [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.p_o )
  692. 476.01 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  693. 478.44 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  694. 480.93 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  695. 481.41 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  696. 488.36 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  697. 488.36 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  698. 494.66 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  699. 494.70 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  700. 494.70 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  701. 494.70 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  702. 494.70 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  703. 494.80 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  704. 494.80 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  705. 500.31 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  706. 505.61 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  707. 511.28 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  708. 512.61 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
  709. 512.61 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
  710. 512.69 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  711. 513.03 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  712. 514.43 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
  713. 514.43 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
  714. 514.51 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 )
  715. 515.67 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 )
  716. 515.67 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 )
  717. 515.76 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 )
  718. 515.76 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 )
  719. 515.76 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 )
  720. 515.76 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 )
  721. 515.76 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 )
  722. 515.76 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 )
  723. 515.76 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 )
  724. 515.76 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 )
  725. 515.76 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 )
  726. 515.76 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 )
  727. 515.76 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 )
  728. 515.96 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 )
  729. 517.42 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 )
  730. 517.46 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 )
  731. 517.52 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 )
  732. 517.52 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 )
  733. 517.52 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 )
  734. 517.52 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 )
  735. 517.52 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 )
  736. 517.53 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 )
  737. 517.53 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 )
  738. 517.53 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 )
  739. 517.53 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  740. 517.53 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 )
  741. 517.53 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 )
  742. 519.09 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
  743. 519.09 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
  744. 519.20 s [vector] [ 1 of 12] Compiling Boilerplater ( tests/Boilerplater.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.dyn_o )
  745. 519.32 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 )
  746. 520.29 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 )
  747. 520.29 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 )
  748. 521.10 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 )
  749. 521.21 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 )
  750. 521.21 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 )
  751. 521.21 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 )
  752. 521.21 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 )
  753. 521.21 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 )
  754. 521.21 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 )
  755. 521.21 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 )
  756. 521.69 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  757. 522.52 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
  758. 522.56 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
  759. 522.66 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 )
  760. 522.84 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 )
  761. 528.88 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 )
  762. 528.92 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 )
  763. 534.62 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 )
  764. 567.72 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 )
  765. 567.76 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 )
  766. 567.76 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 )
  767. 567.76 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 )
  768. 567.76 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 )
  769. 567.76 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 )
  770. 567.76 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 )
  771. 568.30 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  772. 569.15 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
  773. 569.15 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
  774. 569.31 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect.dyn_o )
  775. 569.82 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 )
  776. 569.82 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.dyn_o )
  777. 570.64 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  778. 571.29 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  779. 572.02 s [vector] buildPhase completed in 2 minutes 25 seconds
  780. 572.02 s [vector] Phase: checkPhase
  781. 572.05 s [vector] Running 2 test suites...
  782. 572.05 s [vector] Test suite vector-tests-O0: RUNNING...
  783. 572.17 s [vector] toplevel
  784. 572.17 s [vector] Data.Vector.Fusion.Bundle
  785. 572.17 s [vector] fromList.toList == id: OK
  786. 572.17 s [vector] +++ OK, passed 100 tests.
  787. 572.17 s [vector] toList.fromList == id: OK
  788. 572.17 s [vector] +++ OK, passed 100 tests.
  789. 572.17 s [vector] eq: OK
  790. 572.18 s [vector] +++ OK, passed 100 tests.
  791. 572.18 s [vector] length: OK
  792. 572.18 s [vector] +++ OK, passed 100 tests.
  793. 572.18 s [vector] null: OK
  794. 572.18 s [vector] +++ OK, passed 100 tests.
  795. 572.18 s [vector] empty: OK
  796. 572.18 s [vector] +++ OK, passed 100 tests.
  797. 572.18 s [vector] singleton: OK
  798. 572.18 s [vector] +++ OK, passed 100 tests.
  799. 572.18 s [vector] replicate: OK
  800. 572.18 s [vector] +++ OK, passed 100 tests.
  801. 572.18 s [vector] cons: OK
  802. 572.18 s [vector] +++ OK, passed 100 tests.
  803. 572.18 s [vector] snoc: OK
  804. 572.18 s [vector] +++ OK, passed 100 tests.
  805. 572.18 s [vector] append: OK
  806. 572.18 s [vector] +++ OK, passed 100 tests.
  807. 572.18 s [vector] head: OK
  808. 572.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  809. 572.18 s [vector] last: OK
  810. 572.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  811. 572.19 s [vector] index: OK
  812. 572.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  813. 572.19 s [vector] extract: OK
  814. 572.19 s [vector] +++ OK, passed 100 tests.
  815. 572.19 s [vector] init: OK
  816. 572.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  817. 572.19 s [vector] tail: OK
  818. 572.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  819. 572.19 s [vector] take: OK
  820. 572.19 s [vector] +++ OK, passed 100 tests.
  821. 572.19 s [vector] drop: OK
  822. 572.19 s [vector] +++ OK, passed 100 tests.
  823. 572.19 s [vector] map: OK
  824. 572.19 s [vector] +++ OK, passed 100 tests.
  825. 572.19 s [vector] zipWith: OK
  826. 572.19 s [vector] +++ OK, passed 100 tests.
  827. 572.19 s [vector] zipWith3: OK
  828. 572.20 s [vector] +++ OK, passed 100 tests.
  829. 572.20 s [vector] filter: OK
  830. 572.20 s [vector] +++ OK, passed 100 tests.
  831. 572.20 s [vector] takeWhile: OK
  832. 572.20 s [vector] +++ OK, passed 100 tests.
  833. 572.20 s [vector] dropWhile: OK
  834. 572.20 s [vector] +++ OK, passed 100 tests.
  835. 572.20 s [vector] elem: OK
  836. 572.20 s [vector] +++ OK, passed 100 tests.
  837. 572.20 s [vector] notElem: OK
  838. 572.21 s [vector] +++ OK, passed 100 tests.
  839. 572.21 s [vector] find: OK
  840. 572.21 s [vector] +++ OK, passed 100 tests.
  841. 572.21 s [vector] findIndex: OK
  842. 572.21 s [vector] +++ OK, passed 100 tests.
  843. 572.21 s [vector] foldl: OK
  844. 572.21 s [vector] +++ OK, passed 100 tests.
  845. 572.21 s [vector] foldl1: OK
  846. 572.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  847. 572.21 s [vector] foldl': OK
  848. 572.21 s [vector] +++ OK, passed 100 tests.
  849. 572.21 s [vector] foldl1': OK
  850. 572.21 s [vector] +++ OK, passed 100 tests; 21 discarded.
  851. 572.21 s [vector] foldr: OK
  852. 572.21 s [vector] +++ OK, passed 100 tests.
  853. 572.21 s [vector] foldr1: OK
  854. 572.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  855. 572.21 s [vector] prescanl: OK
  856. 572.22 s [vector] +++ OK, passed 100 tests.
  857. 572.22 s [vector] prescanl': OK
  858. 572.22 s [vector] +++ OK, passed 100 tests.
  859. 572.22 s [vector] postscanl: OK
  860. 572.22 s [vector] +++ OK, passed 100 tests.
  861. 572.22 s [vector] postscanl': OK
  862. 572.22 s [vector] +++ OK, passed 100 tests.
  863. 572.22 s [vector] scanl: OK
  864. 572.22 s [vector] +++ OK, passed 100 tests.
  865. 572.22 s [vector] scanl': OK
  866. 572.22 s [vector] +++ OK, passed 100 tests.
  867. 572.22 s [vector] scanl1: OK
  868. 572.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  869. 572.22 s [vector] scanl1': OK
  870. 572.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  871. 572.22 s [vector] concatMap: OK
  872. 572.22 s [vector] +++ OK, passed 100 tests.
  873. 572.22 s [vector] unfoldr: OK
  874. 572.22 s [vector] +++ OK, passed 100 tests.
  875. 572.22 s [vector] and: OK
  876. 572.22 s [vector] +++ OK, passed 100 tests.
  877. 572.22 s [vector] or: OK
  878. 572.23 s [vector] +++ OK, passed 100 tests.
  879. 572.23 s [vector] Tests.Vector.Boxed
  880. 572.23 s [vector] Bool
  881. 572.23 s [vector] fromList.toList == id: OK
  882. 572.23 s [vector] +++ OK, passed 100 tests.
  883. 572.23 s [vector] toList.fromList == id: OK
  884. 572.23 s [vector] +++ OK, passed 100 tests.
  885. 572.23 s [vector] unstream.stream == id: OK
  886. 572.23 s [vector] +++ OK, passed 100 tests.
  887. 572.23 s [vector] stream.unstream == id: OK
  888. 572.23 s [vector] +++ OK, passed 100 tests.
  889. 572.23 s [vector] eq: OK
  890. 572.23 s [vector] +++ OK, passed 100 tests.
  891. 572.23 s [vector] length: OK
  892. 572.23 s [vector] +++ OK, passed 100 tests.
  893. 572.23 s [vector] null: OK
  894. 572.23 s [vector] +++ OK, passed 100 tests.
  895. 572.23 s [vector] index: OK
  896. 572.23 s [vector] +++ OK, passed 100 tests; 12 discarded.
  897. 572.23 s [vector] safeIndex: OK
  898. 572.23 s [vector] +++ OK, passed 100 tests.
  899. 572.23 s [vector] head: OK
  900. 572.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  901. 572.23 s [vector] last: OK
  902. 572.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  903. 572.23 s [vector] unsafeIndex: OK
  904. 572.24 s [vector] +++ OK, passed 100 tests; 18 discarded.
  905. 572.24 s [vector] unsafeHead: OK
  906. 572.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  907. 572.24 s [vector] unsafeLast: OK
  908. 572.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  909. 572.24 s [vector] slice: OK
  910. 572.24 s [vector] +++ OK, passed 100 tests.
  911. 572.24 s [vector] init: OK
  912. 572.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  913. 572.24 s [vector] tail: OK
  914. 572.24 s [vector] +++ OK, passed 100 tests; 20 discarded.
  915. 572.24 s [vector] take: OK
  916. 572.25 s [vector] +++ OK, passed 100 tests.
  917. 572.25 s [vector] drop: OK
  918. 572.25 s [vector] +++ OK, passed 100 tests.
  919. 572.25 s [vector] splitAt: OK
  920. 572.25 s [vector] +++ OK, passed 100 tests.
  921. 572.25 s [vector] empty: OK
  922. 572.25 s [vector] +++ OK, passed 100 tests.
  923. 572.26 s [vector] singleton: OK
  924. 572.26 s [vector] +++ OK, passed 100 tests.
  925. 572.26 s [vector] replicate: OK
  926. 572.26 s [vector] +++ OK, passed 100 tests.
  927. 572.26 s [vector] generate: OK
  928. 572.26 s [vector] +++ OK, passed 100 tests.
  929. 572.26 s [vector] iterateN: OK
  930. 572.27 s [vector] +++ OK, passed 100 tests.
  931. 572.27 s [vector] iterateNM: OK (0.02s)
  932. 572.27 s [vector] +++ OK, passed 100 tests.
  933. 572.27 s [vector] generateM: OK
  934. 572.27 s [vector] +++ OK, passed 100 tests.
  935. 572.27 s [vector] replicateM: OK
  936. 572.27 s [vector] +++ OK, passed 100 tests.
  937. 572.27 s [vector] create: OK
  938. 572.27 s [vector] +++ OK, passed 100 tests.
  939. 572.27 s [vector] createT: OK
  940. 572.27 s [vector] +++ OK, passed 100 tests.
  941. 572.27 s [vector] unfoldr: OK
  942. 572.27 s [vector] +++ OK, passed 100 tests.
  943. 572.27 s [vector] unfoldrN: OK
  944. 572.27 s [vector] +++ OK, passed 100 tests.
  945. 572.27 s [vector] unfoldrExactN: OK
  946. 572.27 s [vector] +++ OK, passed 100 tests.
  947. 572.27 s [vector] unfoldrM: OK
  948. 572.27 s [vector] +++ OK, passed 100 tests.
  949. 572.27 s [vector] unfoldrNM: OK
  950. 572.27 s [vector] +++ OK, passed 100 tests.
  951. 572.27 s [vector] unfoldrExactNM: OK (0.04s)
  952. 572.27 s [vector] +++ OK, passed 100 tests.
  953. 572.27 s [vector] constructN: OK
  954. 572.27 s [vector] +++ OK, passed 100 tests.
  955. 572.28 s [vector] constructrN: OK
  956. 572.28 s [vector] +++ OK, passed 100 tests.
  957. 572.28 s [vector] cons: OK
  958. 572.28 s [vector] +++ OK, passed 100 tests.
  959. 572.28 s [vector] snoc: OK
  960. 572.28 s [vector] +++ OK, passed 100 tests.
  961. 572.29 s [vector] append: OK
  962. 572.29 s [vector] +++ OK, passed 100 tests.
  963. 572.29 s [vector] concat: OK
  964. 572.29 s [vector] +++ OK, passed 100 tests.
  965. 572.29 s [vector] force: OK
  966. 572.29 s [vector] +++ OK, passed 100 tests.
  967. 572.29 s [vector] upd: OK
  968. 572.29 s [vector] +++ OK, passed 100 tests.
  969. 572.29 s [vector] accum: OK
  970. 572.29 s [vector] +++ OK, passed 100 tests.
  971. 572.29 s [vector] reverse: OK
  972. 572.29 s [vector] +++ OK, passed 100 tests.
  973. 572.29 s [vector] backpermute: OK
  974. 572.29 s [vector] +++ OK, passed 100 tests.
  975. 572.29 s [vector] map: OK
  976. 572.29 s [vector] +++ OK, passed 100 tests.
  977. 572.29 s [vector] imap: OK
  978. 572.29 s [vector] +++ OK, passed 100 tests.
  979. 572.30 s [vector] concatMap: OK
  980. 572.30 s [vector] +++ OK, passed 100 tests.
  981. 572.31 s [vector] mapM: OK
  982. 572.31 s [vector] +++ OK, passed 100 tests.
  983. 572.31 s [vector] mapM_: OK (0.01s)
  984. 572.31 s [vector] +++ OK, passed 100 tests.
  985. 572.31 s [vector] forM: OK
  986. 572.31 s [vector] +++ OK, passed 100 tests.
  987. 572.32 s [vector] forM_: OK (0.01s)
  988. 572.32 s [vector] +++ OK, passed 100 tests.
  989. 572.32 s [vector] imapM: OK
  990. 572.32 s [vector] +++ OK, passed 100 tests.
  991. 572.34 s [vector] imapM_: OK
  992. 572.34 s [vector] +++ OK, passed 100 tests.
  993. 572.34 s [vector] zipWith: OK
  994. 572.34 s [vector] +++ OK, passed 100 tests.
  995. 572.34 s [vector] zipWith3: OK
  996. 572.34 s [vector] +++ OK, passed 100 tests.
  997. 572.34 s [vector] izipWith: OK
  998. 572.34 s [vector] +++ OK, passed 100 tests.
  999. 572.34 s [vector] izipWith3: OK
  1000. 572.35 s [vector] +++ OK, passed 100 tests.
  1001. 572.35 s [vector] izipWithM: OK
  1002. 572.35 s [vector] +++ OK, passed 100 tests.
  1003. 572.35 s [vector] izipWithM_: OK
  1004. 572.35 s [vector] +++ OK, passed 100 tests.
  1005. 572.35 s [vector] zipWithM: OK
  1006. 572.36 s [vector] +++ OK, passed 100 tests.
  1007. 572.36 s [vector] zipWithM_: OK
  1008. 572.36 s [vector] +++ OK, passed 100 tests.
  1009. 572.36 s [vector] filter: OK
  1010. 572.36 s [vector] +++ OK, passed 100 tests.
  1011. 572.37 s [vector] ifilter: OK
  1012. 572.37 s [vector] +++ OK, passed 100 tests.
  1013. 572.39 s [vector] filterM: OK (0.03s)
  1014. 572.39 s [vector] +++ OK, passed 100 tests.
  1015. 572.39 s [vector] uniq: OK
  1016. 572.39 s [vector] +++ OK, passed 100 tests.
  1017. 572.39 s [vector] mapMaybe: OK
  1018. 572.39 s [vector] +++ OK, passed 100 tests.
  1019. 572.39 s [vector] imapMaybe: OK
  1020. 572.39 s [vector] +++ OK, passed 100 tests.
  1021. 572.39 s [vector] takeWhile: OK
  1022. 572.39 s [vector] +++ OK, passed 100 tests.
  1023. 572.39 s [vector] dropWhile: OK
  1024. 572.39 s [vector] +++ OK, passed 100 tests.
  1025. 572.39 s [vector] partition: OK
  1026. 572.39 s [vector] +++ OK, passed 100 tests.
  1027. 572.39 s [vector] partitionWith: OK
  1028. 572.39 s [vector] +++ OK, passed 100 tests.
  1029. 572.40 s [vector] span: OK
  1030. 572.40 s [vector] +++ OK, passed 100 tests.
  1031. 572.40 s [vector] break: OK
  1032. 572.40 s [vector] +++ OK, passed 100 tests.
  1033. 572.40 s [vector] spanR: OK
  1034. 572.40 s [vector] +++ OK, passed 100 tests.
  1035. 572.40 s [vector] breakR: OK
  1036. 572.40 s [vector] +++ OK, passed 100 tests.
  1037. 572.40 s [vector] groupBy: OK
  1038. 572.40 s [vector] +++ OK, passed 100 tests.
  1039. 572.40 s [vector] elem: OK
  1040. 572.40 s [vector] +++ OK, passed 100 tests.
  1041. 572.40 s [vector] notElem: OK
  1042. 572.40 s [vector] +++ OK, passed 100 tests.
  1043. 572.40 s [vector] find: OK
  1044. 572.40 s [vector] +++ OK, passed 100 tests.
  1045. 572.40 s [vector] findIndex: OK
  1046. 572.40 s [vector] +++ OK, passed 100 tests.
  1047. 572.40 s [vector] findIndexR: OK
  1048. 572.40 s [vector] +++ OK, passed 100 tests.
  1049. 572.40 s [vector] findIndices: OK
  1050. 572.40 s [vector] +++ OK, passed 100 tests.
  1051. 572.40 s [vector] elemIndex: OK
  1052. 572.40 s [vector] +++ OK, passed 100 tests.
  1053. 572.40 s [vector] elemIndices: OK
  1054. 572.40 s [vector] +++ OK, passed 100 tests.
  1055. 572.40 s [vector] foldl: OK
  1056. 572.40 s [vector] +++ OK, passed 100 tests.
  1057. 572.40 s [vector] foldl1: OK
  1058. 572.41 s [vector] +++ OK, passed 100 tests; 20 discarded.
  1059. 572.41 s [vector] foldl': OK
  1060. 572.41 s [vector] +++ OK, passed 100 tests.
  1061. 572.41 s [vector] foldl1': OK
  1062. 572.41 s [vector] +++ OK, passed 100 tests; 11 discarded.
  1063. 572.41 s [vector] foldr: OK
  1064. 572.41 s [vector] +++ OK, passed 100 tests.
  1065. 572.41 s [vector] foldr1: OK
  1066. 572.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1067. 572.41 s [vector] foldr': OK
  1068. 572.41 s [vector] +++ OK, passed 100 tests.
  1069. 572.42 s [vector] foldr1': OK
  1070. 572.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1071. 572.42 s [vector] ifoldl: OK
  1072. 572.42 s [vector] +++ OK, passed 100 tests.
  1073. 572.42 s [vector] ifoldl': OK
  1074. 572.42 s [vector] +++ OK, passed 100 tests.
  1075. 572.42 s [vector] ifoldr: OK
  1076. 572.42 s [vector] +++ OK, passed 100 tests.
  1077. 572.42 s [vector] ifoldr': OK
  1078. 572.42 s [vector] +++ OK, passed 100 tests.
  1079. 572.42 s [vector] ifoldM: OK
  1080. 572.42 s [vector] +++ OK, passed 100 tests.
  1081. 572.43 s [vector] ifoldM': OK
  1082. 572.43 s [vector] +++ OK, passed 100 tests.
  1083. 572.44 s [vector] ifoldM_: OK (0.01s)
  1084. 572.44 s [vector] +++ OK, passed 100 tests.
  1085. 572.45 s [vector] ifoldM'_: OK
  1086. 572.45 s [vector] +++ OK, passed 100 tests.
  1087. 572.45 s [vector] all: OK
  1088. 572.45 s [vector] +++ OK, passed 100 tests.
  1089. 572.45 s [vector] any: OK
  1090. 572.45 s [vector] +++ OK, passed 100 tests.
  1091. 572.45 s [vector] prescanl: OK
  1092. 572.45 s [vector] +++ OK, passed 100 tests.
  1093. 572.45 s [vector] prescanl': OK
  1094. 572.45 s [vector] +++ OK, passed 100 tests.
  1095. 572.46 s [vector] postscanl: OK
  1096. 572.46 s [vector] +++ OK, passed 100 tests.
  1097. 572.46 s [vector] postscanl': OK
  1098. 572.46 s [vector] +++ OK, passed 100 tests.
  1099. 572.46 s [vector] scanl: OK
  1100. 572.46 s [vector] +++ OK, passed 100 tests.
  1101. 572.46 s [vector] scanl': OK
  1102. 572.46 s [vector] +++ OK, passed 100 tests.
  1103. 572.46 s [vector] scanl1: OK
  1104. 572.46 s [vector] +++ OK, passed 100 tests.
  1105. 572.46 s [vector] scanl1': OK
  1106. 572.46 s [vector] +++ OK, passed 100 tests.
  1107. 572.46 s [vector] iscanl: OK
  1108. 572.46 s [vector] +++ OK, passed 100 tests.
  1109. 572.47 s [vector] iscanl': OK
  1110. 572.47 s [vector] +++ OK, passed 100 tests.
  1111. 572.47 s [vector] prescanr: OK
  1112. 572.47 s [vector] +++ OK, passed 100 tests.
  1113. 572.47 s [vector] prescanr': OK
  1114. 572.47 s [vector] +++ OK, passed 100 tests.
  1115. 572.47 s [vector] postscanr: OK
  1116. 572.47 s [vector] +++ OK, passed 100 tests.
  1117. 572.47 s [vector] postscanr': OK
  1118. 572.47 s [vector] +++ OK, passed 100 tests.
  1119. 572.47 s [vector] scanr: OK
  1120. 572.47 s [vector] +++ OK, passed 100 tests.
  1121. 572.47 s [vector] scanr': OK
  1122. 572.47 s [vector] +++ OK, passed 100 tests.
  1123. 572.48 s [vector] scanr1: OK
  1124. 572.48 s [vector] +++ OK, passed 100 tests.
  1125. 572.48 s [vector] scanr1': OK
  1126. 572.48 s [vector] +++ OK, passed 100 tests.
  1127. 572.48 s [vector] iscanr: OK
  1128. 572.48 s [vector] +++ OK, passed 100 tests.
  1129. 572.48 s [vector] iscanr': OK
  1130. 572.48 s [vector] +++ OK, passed 100 tests.
  1131. 572.48 s [vector] mut_read: OK
  1132. 572.48 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1133. 572.48 s [vector] mut_write: OK
  1134. 572.48 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1135. 572.48 s [vector] mut_modify: OK
  1136. 572.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  1137. 572.48 s [vector] mut_generate: OK
  1138. 572.48 s [vector] +++ OK, passed 100 tests.
  1139. 572.49 s [vector] mut_generateM: OK
  1140. 572.49 s [vector] +++ OK, passed 100 tests.
  1141. 572.51 s [vector] mut_mapM_: OK (0.01s)
  1142. 572.51 s [vector] +++ OK, passed 100 tests.
  1143. 572.52 s [vector] mut_imapM_: OK (0.01s)
  1144. 572.52 s [vector] +++ OK, passed 100 tests.
  1145. 572.52 s [vector] mut_forM_: OK (0.01s)
  1146. 572.52 s [vector] +++ OK, passed 100 tests.
  1147. 572.53 s [vector] mut_iforM_: OK
  1148. 572.53 s [vector] +++ OK, passed 100 tests.
  1149. 572.54 s [vector] mut_foldr: OK
  1150. 572.54 s [vector] +++ OK, passed 100 tests.
  1151. 572.54 s [vector] mut_foldr': OK
  1152. 572.54 s [vector] +++ OK, passed 100 tests.
  1153. 572.54 s [vector] mut_foldl: OK
  1154. 572.54 s [vector] +++ OK, passed 100 tests.
  1155. 572.54 s [vector] mut_foldl': OK
  1156. 572.54 s [vector] +++ OK, passed 100 tests.
  1157. 572.55 s [vector] mut_ifoldr: OK
  1158. 572.55 s [vector] +++ OK, passed 100 tests.
  1159. 572.55 s [vector] mut_ifoldr': OK
  1160. 572.55 s [vector] +++ OK, passed 100 tests.
  1161. 572.55 s [vector] mut_ifoldl: OK
  1162. 572.55 s [vector] +++ OK, passed 100 tests.
  1163. 572.55 s [vector] mut_ifoldl': OK
  1164. 572.55 s [vector] +++ OK, passed 100 tests.
  1165. 572.55 s [vector] mut_foldM: OK
  1166. 572.55 s [vector] +++ OK, passed 100 tests.
  1167. 572.55 s [vector] mut_foldM': OK
  1168. 572.55 s [vector] +++ OK, passed 100 tests.
  1169. 572.55 s [vector] mut_foldrM: OK
  1170. 572.55 s [vector] +++ OK, passed 100 tests.
  1171. 572.56 s [vector] mut_foldrM': OK
  1172. 572.56 s [vector] +++ OK, passed 100 tests.
  1173. 572.56 s [vector] mut_ifoldM: OK
  1174. 572.56 s [vector] +++ OK, passed 100 tests.
  1175. 572.56 s [vector] mut_ifoldM': OK
  1176. 572.56 s [vector] +++ OK, passed 100 tests.
  1177. 572.56 s [vector] mut_ifoldrM: OK
  1178. 572.56 s [vector] +++ OK, passed 100 tests.
  1179. 572.56 s [vector] mut_ifoldrM': OK
  1180. 572.56 s [vector] +++ OK, passed 100 tests.
  1181. 572.56 s [vector] compare: OK
  1182. 572.56 s [vector] +++ OK, passed 100 tests.
  1183. 572.56 s [vector] maximum: OK
  1184. 572.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1185. 572.57 s [vector] minimum: OK
  1186. 572.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1187. 572.57 s [vector] minIndex: OK
  1188. 572.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  1189. 572.57 s [vector] maxIndex: OK
  1190. 572.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1191. 572.57 s [vector] maximumBy: OK
  1192. 572.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1193. 572.57 s [vector] minimumBy: OK
  1194. 572.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1195. 572.57 s [vector] maximumOn: OK
  1196. 572.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1197. 572.57 s [vector] minimumOn: OK
  1198. 572.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1199. 572.57 s [vector] maxIndexBy: OK
  1200. 572.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1201. 572.57 s [vector] minIndexBy: OK
  1202. 572.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1203. 572.57 s [vector] ListFirstMaxIndexWins: OK
  1204. 572.57 s [vector] +++ OK, passed 100 tests; 24 discarded.
  1205. 572.57 s [vector] FalseListFirstMaxIndexWins: OK
  1206. 572.57 s [vector] +++ OK, failed as expected. (after 1 test):
  1207. 572.57 s [vector] Exception:
  1208. 572.57 s [vector] Prelude.foldr1: empty list
  1209. 572.57 s [vector] CallStack (from HasCallStack):
  1210. 572.57 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  1211. 572.57 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  1212. 572.57 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  1213. 572.57 s [vector] []
  1214. 572.57 s [vector] zip: OK
  1215. 572.57 s [vector] +++ OK, passed 100 tests.
  1216. 572.57 s [vector] zip3: OK
  1217. 572.57 s [vector] +++ OK, passed 100 tests.
  1218. 572.57 s [vector] unzip: OK
  1219. 572.57 s [vector] +++ OK, passed 100 tests.
  1220. 572.57 s [vector] unzip3: OK
  1221. 572.57 s [vector] +++ OK, passed 100 tests.
  1222. 572.57 s [vector] indexed: OK
  1223. 572.57 s [vector] +++ OK, passed 100 tests.
  1224. 572.57 s [vector] update: OK
  1225. 572.57 s [vector] +++ OK, passed 100 tests.
  1226. 572.58 s [vector] concat: OK
  1227. 572.58 s [vector] +++ OK, passed 100 tests.
  1228. 572.58 s [vector] mempty: OK
  1229. 572.59 s [vector] +++ OK, passed 100 tests.
  1230. 572.59 s [vector] mappend: OK
  1231. 572.59 s [vector] +++ OK, passed 100 tests.
  1232. 572.59 s [vector] mconcat: OK
  1233. 572.59 s [vector] +++ OK, passed 100 tests.
  1234. 572.59 s [vector] fmap: OK
  1235. 572.59 s [vector] +++ OK, passed 100 tests.
  1236. 572.60 s [vector] return: OK
  1237. 572.60 s [vector] +++ OK, passed 100 tests.
  1238. 572.60 s [vector] bind: OK
  1239. 572.60 s [vector] +++ OK, passed 100 tests.
  1240. 572.60 s [vector] mzip: OK
  1241. 572.60 s [vector] +++ OK, passed 100 tests.
  1242. 572.60 s [vector] munzip: OK
  1243. 572.60 s [vector] +++ OK, passed 100 tests.
  1244. 572.60 s [vector] applicative_pure: OK
  1245. 572.60 s [vector] +++ OK, passed 100 tests.
  1246. 572.62 s [vector] applicative_appl: OK (0.01s)
  1247. 572.62 s [vector] +++ OK, passed 100 tests.
  1248. 572.63 s [vector] alternative_empty: OK
  1249. 572.63 s [vector] +++ OK, passed 100 tests.
  1250. 572.63 s [vector] alternative_or: OK
  1251. 572.63 s [vector] +++ OK, passed 100 tests.
  1252. 572.65 s [vector] sequence: OK (0.02s)
  1253. 572.65 s [vector] +++ OK, passed 100 tests.
  1254. 572.65 s [vector] sequence_: OK
  1255. 572.65 s [vector] +++ OK, passed 100 tests.
  1256. 572.65 s [vector] glength: OK
  1257. 572.65 s [vector] +++ OK, passed 100 tests.
  1258. 572.65 s [vector] and: OK
  1259. 572.65 s [vector] +++ OK, passed 100 tests.
  1260. 572.65 s [vector] or: OK
  1261. 572.65 s [vector] +++ OK, passed 100 tests.
  1262. 572.65 s [vector] Int
  1263. 572.65 s [vector] fromList.toList == id: OK
  1264. 572.65 s [vector] +++ OK, passed 100 tests.
  1265. 572.65 s [vector] toList.fromList == id: OK
  1266. 572.65 s [vector] +++ OK, passed 100 tests.
  1267. 572.66 s [vector] unstream.stream == id: OK
  1268. 572.66 s [vector] +++ OK, passed 100 tests.
  1269. 572.66 s [vector] stream.unstream == id: OK
  1270. 572.66 s [vector] +++ OK, passed 100 tests.
  1271. 572.66 s [vector] eq: OK
  1272. 572.66 s [vector] +++ OK, passed 100 tests.
  1273. 572.66 s [vector] length: OK
  1274. 572.66 s [vector] +++ OK, passed 100 tests.
  1275. 572.66 s [vector] null: OK
  1276. 572.66 s [vector] +++ OK, passed 100 tests.
  1277. 572.66 s [vector] index: OK
  1278. 572.66 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1279. 572.66 s [vector] safeIndex: OK
  1280. 572.66 s [vector] +++ OK, passed 100 tests.
  1281. 572.66 s [vector] head: OK
  1282. 572.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1283. 572.66 s [vector] last: OK
  1284. 572.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1285. 572.66 s [vector] unsafeIndex: OK
  1286. 572.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1287. 572.66 s [vector] unsafeHead: OK
  1288. 572.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1289. 572.66 s [vector] unsafeLast: OK
  1290. 572.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  1291. 572.66 s [vector] slice: OK
  1292. 572.66 s [vector] +++ OK, passed 100 tests.
  1293. 572.66 s [vector] init: OK
  1294. 572.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1295. 572.66 s [vector] tail: OK
  1296. 572.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1297. 572.66 s [vector] take: OK
  1298. 572.66 s [vector] +++ OK, passed 100 tests.
  1299. 572.66 s [vector] drop: OK
  1300. 572.66 s [vector] +++ OK, passed 100 tests.
  1301. 572.66 s [vector] splitAt: OK
  1302. 572.66 s [vector] +++ OK, passed 100 tests.
  1303. 572.66 s [vector] empty: OK
  1304. 572.66 s [vector] +++ OK, passed 100 tests.
  1305. 572.66 s [vector] singleton: OK
  1306. 572.66 s [vector] +++ OK, passed 100 tests.
  1307. 572.66 s [vector] replicate: OK
  1308. 572.66 s [vector] +++ OK, passed 100 tests.
  1309. 572.66 s [vector] generate: OK
  1310. 572.67 s [vector] +++ OK, passed 100 tests.
  1311. 572.67 s [vector] iterateN: OK
  1312. 572.67 s [vector] +++ OK, passed 100 tests.
  1313. 572.71 s [vector] iterateNM: OK (0.03s)
  1314. 572.71 s [vector] +++ OK, passed 100 tests.
  1315. 572.72 s [vector] generateM: OK (0.02s)
  1316. 572.85 s [vector] +++ OK, passed 100 tests.
  1317. 572.85 s [vector] replicateM: OK
  1318. 572.85 s [vector] +++ OK, passed 100 tests.
  1319. 572.85 s [vector] create: OK
  1320. 572.85 s [vector] +++ OK, passed 100 tests.
  1321. 572.85 s [vector] createT: OK
  1322. 572.85 s [vector] +++ OK, passed 100 tests.
  1323. 572.85 s [vector] unfoldr: OK
  1324. 572.85 s [vector] +++ OK, passed 100 tests.
  1325. 572.85 s [vector] unfoldrN: OK
  1326. 572.85 s [vector] +++ OK, passed 100 tests.
  1327. 572.85 s [vector] unfoldrExactN: OK
  1328. 572.85 s [vector] +++ OK, passed 100 tests.
  1329. 572.85 s [vector] unfoldrM: OK
  1330. 572.85 s [vector] +++ OK, passed 100 tests.
  1331. 572.85 s [vector] unfoldrNM: OK
  1332. 572.85 s [vector] +++ OK, passed 100 tests.
  1333. 572.85 s [vector] unfoldrExactNM: OK (0.01s)
  1334. 572.85 s [vector] +++ OK, passed 100 tests.
  1335. 572.85 s [vector] constructN: OK
  1336. 572.85 s [vector] +++ OK, passed 100 tests.
  1337. 572.85 s [vector] constructrN: OK
  1338. 572.85 s [vector] +++ OK, passed 100 tests.
  1339. 572.85 s [vector] cons: OK
  1340. 572.85 s [vector] +++ OK, passed 100 tests.
  1341. 572.85 s [vector] snoc: OK
  1342. 572.85 s [vector] +++ OK, passed 100 tests.
  1343. 572.85 s [vector] append: OK
  1344. 572.85 s [vector] +++ OK, passed 100 tests.
  1345. 572.85 s [vector] concat: OK
  1346. 572.85 s [vector] +++ OK, passed 100 tests.
  1347. 572.85 s [vector] force: OK
  1348. 572.85 s [vector] +++ OK, passed 100 tests.
  1349. 572.85 s [vector] upd: OK
  1350. 572.85 s [vector] +++ OK, passed 100 tests.
  1351. 572.85 s [vector] accum: OK
  1352. 572.85 s [vector] +++ OK, passed 100 tests.
  1353. 572.85 s [vector] reverse: OK
  1354. 572.85 s [vector] +++ OK, passed 100 tests.
  1355. 572.85 s [vector] backpermute: OK
  1356. 572.85 s [vector] +++ OK, passed 100 tests.
  1357. 572.85 s [vector] map: OK
  1358. 572.85 s [vector] +++ OK, passed 100 tests.
  1359. 572.85 s [vector] imap: OK
  1360. 572.85 s [vector] +++ OK, passed 100 tests.
  1361. 572.85 s [vector] concatMap: OK
  1362. 572.85 s [vector] +++ OK, passed 100 tests.
  1363. 572.85 s [vector] mapM: OK
  1364. 572.85 s [vector] +++ OK, passed 100 tests.
  1365. 572.85 s [vector] mapM_: OK (0.02s)
  1366. 572.85 s [vector] +++ OK, passed 100 tests.
  1367. 572.85 s [vector] forM: OK
  1368. 572.85 s [vector] +++ OK, passed 100 tests.
  1369. 572.85 s [vector] forM_: OK (0.02s)
  1370. 572.85 s [vector] +++ OK, passed 100 tests.
  1371. 572.85 s [vector] imapM: OK
  1372. 572.85 s [vector] +++ OK, passed 100 tests.
  1373. 572.85 s [vector] imapM_: OK (0.01s)
  1374. 572.85 s [vector] +++ OK, passed 100 tests.
  1375. 572.85 s [vector] zipWith: OK
  1376. 572.85 s [vector] +++ OK, passed 100 tests.
  1377. 572.85 s [vector] zipWith3: OK
  1378. 572.85 s [vector] +++ OK, passed 100 tests.
  1379. 572.85 s [vector] izipWith: OK
  1380. 572.85 s [vector] +++ OK, passed 100 tests.
  1381. 572.85 s [vector] izipWith3: OK
  1382. 572.85 s [vector] +++ OK, passed 100 tests.
  1383. 572.85 s [vector] izipWithM: OK
  1384. 572.85 s [vector] +++ OK, passed 100 tests.
  1385. 572.86 s [vector] izipWithM_: OK (0.01s)
  1386. 572.87 s [vector] +++ OK, passed 100 tests.
  1387. 572.87 s [vector] zipWithM: OK
  1388. 572.87 s [vector] +++ OK, passed 100 tests.
  1389. 572.87 s [vector] zipWithM_: OK (0.01s)
  1390. 572.87 s [vector] +++ OK, passed 100 tests.
  1391. 572.87 s [vector] filter: OK
  1392. 572.87 s [vector] +++ OK, passed 100 tests.
  1393. 572.87 s [vector] ifilter: OK
  1394. 572.87 s [vector] +++ OK, passed 100 tests.
  1395. 572.89 s [vector] filterM: OK (0.02s)
  1396. 572.89 s [vector] +++ OK, passed 100 tests.
  1397. 572.89 s [vector] uniq: OK
  1398. 572.89 s [vector] +++ OK, passed 100 tests.
  1399. 572.90 s [vector] mapMaybe: OK
  1400. 572.90 s [vector] +++ OK, passed 100 tests.
  1401. 572.90 s [vector] imapMaybe: OK
  1402. 572.90 s [vector] +++ OK, passed 100 tests.
  1403. 572.90 s [vector] takeWhile: OK
  1404. 572.90 s [vector] +++ OK, passed 100 tests.
  1405. 572.90 s [vector] dropWhile: OK
  1406. 572.90 s [vector] +++ OK, passed 100 tests.
  1407. 572.90 s [vector] partition: OK
  1408. 572.90 s [vector] +++ OK, passed 100 tests.
  1409. 572.90 s [vector] partitionWith: OK
  1410. 572.90 s [vector] +++ OK, passed 100 tests.
  1411. 572.91 s [vector] span: OK
  1412. 572.91 s [vector] +++ OK, passed 100 tests.
  1413. 572.91 s [vector] break: OK
  1414. 572.91 s [vector] +++ OK, passed 100 tests.
  1415. 572.91 s [vector] spanR: OK
  1416. 572.91 s [vector] +++ OK, passed 100 tests.
  1417. 572.91 s [vector] breakR: OK
  1418. 572.91 s [vector] +++ OK, passed 100 tests.
  1419. 572.91 s [vector] groupBy: OK
  1420. 572.91 s [vector] +++ OK, passed 100 tests.
  1421. 572.91 s [vector] elem: OK
  1422. 572.91 s [vector] +++ OK, passed 100 tests.
  1423. 572.91 s [vector] notElem: OK
  1424. 572.91 s [vector] +++ OK, passed 100 tests.
  1425. 572.91 s [vector] find: OK
  1426. 572.91 s [vector] +++ OK, passed 100 tests.
  1427. 572.91 s [vector] findIndex: OK
  1428. 572.91 s [vector] +++ OK, passed 100 tests.
  1429. 572.91 s [vector] findIndexR: OK
  1430. 572.91 s [vector] +++ OK, passed 100 tests.
  1431. 572.91 s [vector] findIndices: OK
  1432. 572.91 s [vector] +++ OK, passed 100 tests.
  1433. 572.91 s [vector] elemIndex: OK
  1434. 572.91 s [vector] +++ OK, passed 100 tests.
  1435. 572.91 s [vector] elemIndices: OK
  1436. 572.91 s [vector] +++ OK, passed 100 tests.
  1437. 572.91 s [vector] foldl: OK
  1438. 572.91 s [vector] +++ OK, passed 100 tests.
  1439. 572.92 s [vector] foldl1: OK
  1440. 572.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1441. 572.92 s [vector] foldl': OK
  1442. 572.92 s [vector] +++ OK, passed 100 tests.
  1443. 572.93 s [vector] foldl1': OK
  1444. 572.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1445. 572.93 s [vector] foldr: OK
  1446. 572.93 s [vector] +++ OK, passed 100 tests.
  1447. 572.93 s [vector] foldr1: OK
  1448. 572.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1449. 572.93 s [vector] foldr': OK
  1450. 572.93 s [vector] +++ OK, passed 100 tests.
  1451. 572.93 s [vector] foldr1': OK
  1452. 572.93 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1453. 572.93 s [vector] ifoldl: OK
  1454. 572.94 s [vector] +++ OK, passed 100 tests.
  1455. 572.94 s [vector] ifoldl': OK
  1456. 572.94 s [vector] +++ OK, passed 100 tests.
  1457. 572.94 s [vector] ifoldr: OK
  1458. 572.94 s [vector] +++ OK, passed 100 tests.
  1459. 572.94 s [vector] ifoldr': OK
  1460. 572.95 s [vector] +++ OK, passed 100 tests.
  1461. 572.95 s [vector] ifoldM: OK
  1462. 572.95 s [vector] +++ OK, passed 100 tests.
  1463. 572.95 s [vector] ifoldM': OK
  1464. 572.95 s [vector] +++ OK, passed 100 tests.
  1465. 572.97 s [vector] ifoldM_: OK (0.01s)
  1466. 572.97 s [vector] +++ OK, passed 100 tests.
  1467. 572.98 s [vector] ifoldM'_: OK (0.01s)
  1468. 572.98 s [vector] +++ OK, passed 100 tests.
  1469. 572.98 s [vector] all: OK
  1470. 572.98 s [vector] +++ OK, passed 100 tests.
  1471. 572.98 s [vector] any: OK
  1472. 572.98 s [vector] +++ OK, passed 100 tests.
  1473. 572.98 s [vector] prescanl: OK
  1474. 572.98 s [vector] +++ OK, passed 100 tests.
  1475. 572.99 s [vector] prescanl': OK
  1476. 572.99 s [vector] +++ OK, passed 100 tests.
  1477. 572.99 s [vector] postscanl: OK
  1478. 572.99 s [vector] +++ OK, passed 100 tests.
  1479. 572.99 s [vector] postscanl': OK
  1480. 572.99 s [vector] +++ OK, passed 100 tests.
  1481. 572.99 s [vector] scanl: OK
  1482. 572.99 s [vector] +++ OK, passed 100 tests.
  1483. 572.99 s [vector] scanl': OK
  1484. 572.99 s [vector] +++ OK, passed 100 tests.
  1485. 573.00 s [vector] scanl1: OK
  1486. 573.00 s [vector] +++ OK, passed 100 tests.
  1487. 573.00 s [vector] scanl1': OK
  1488. 573.01 s [vector] +++ OK, passed 100 tests.
  1489. 573.01 s [vector] iscanl: OK
  1490. 573.01 s [vector] +++ OK, passed 100 tests.
  1491. 573.01 s [vector] iscanl': OK
  1492. 573.01 s [vector] +++ OK, passed 100 tests.
  1493. 573.01 s [vector] prescanr: OK
  1494. 573.01 s [vector] +++ OK, passed 100 tests.
  1495. 573.01 s [vector] prescanr': OK
  1496. 573.01 s [vector] +++ OK, passed 100 tests.
  1497. 573.01 s [vector] postscanr: OK
  1498. 573.01 s [vector] +++ OK, passed 100 tests.
  1499. 573.01 s [vector] postscanr': OK
  1500. 573.01 s [vector] +++ OK, passed 100 tests.
  1501. 573.02 s [vector] scanr: OK
  1502. 573.02 s [vector] +++ OK, passed 100 tests.
  1503. 573.03 s [vector] scanr': OK
  1504. 573.03 s [vector] +++ OK, passed 100 tests.
  1505. 573.03 s [vector] scanr1: OK
  1506. 573.03 s [vector] +++ OK, passed 100 tests.
  1507. 573.03 s [vector] scanr1': OK
  1508. 573.03 s [vector] +++ OK, passed 100 tests.
  1509. 573.03 s [vector] iscanr: OK
  1510. 573.03 s [vector] +++ OK, passed 100 tests.
  1511. 573.03 s [vector] iscanr': OK
  1512. 573.03 s [vector] +++ OK, passed 100 tests.
  1513. 573.03 s [vector] mut_read: OK
  1514. 573.03 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1515. 573.03 s [vector] mut_write: OK
  1516. 573.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1517. 573.03 s [vector] mut_modify: OK
  1518. 573.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1519. 573.03 s [vector] mut_generate: OK
  1520. 573.03 s [vector] +++ OK, passed 100 tests.
  1521. 573.04 s [vector] mut_generateM: OK
  1522. 573.04 s [vector] +++ OK, passed 100 tests.
  1523. 573.07 s [vector] mut_mapM_: OK
  1524. 573.07 s [vector] +++ OK, passed 100 tests.
  1525. 573.09 s [vector] mut_imapM_: OK (0.01s)
  1526. 573.09 s [vector] +++ OK, passed 100 tests.
  1527. 573.09 s [vector] mut_forM_: OK (0.01s)
  1528. 573.09 s [vector] +++ OK, passed 100 tests.
  1529. 573.10 s [vector] mut_iforM_: OK (0.01s)
  1530. 573.10 s [vector] +++ OK, passed 100 tests.
  1531. 573.10 s [vector] mut_foldr: OK
  1532. 573.10 s [vector] +++ OK, passed 100 tests.
  1533. 573.11 s [vector] mut_foldr': OK
  1534. 573.11 s [vector] +++ OK, passed 100 tests.
  1535. 573.11 s [vector] mut_foldl: OK
  1536. 573.11 s [vector] +++ OK, passed 100 tests.
  1537. 573.11 s [vector] mut_foldl': OK
  1538. 573.11 s [vector] +++ OK, passed 100 tests.
  1539. 573.11 s [vector] mut_ifoldr: OK
  1540. 573.11 s [vector] +++ OK, passed 100 tests.
  1541. 573.11 s [vector] mut_ifoldr': OK
  1542. 573.11 s [vector] +++ OK, passed 100 tests.
  1543. 573.12 s [vector] mut_ifoldl: OK
  1544. 573.12 s [vector] +++ OK, passed 100 tests.
  1545. 573.12 s [vector] mut_ifoldl': OK
  1546. 573.12 s [vector] +++ OK, passed 100 tests.
  1547. 573.12 s [vector] mut_foldM: OK
  1548. 573.13 s [vector] +++ OK, passed 100 tests.
  1549. 573.13 s [vector] mut_foldM': OK
  1550. 573.13 s [vector] +++ OK, passed 100 tests.
  1551. 573.13 s [vector] mut_foldrM: OK
  1552. 573.13 s [vector] +++ OK, passed 100 tests.
  1553. 573.13 s [vector] mut_foldrM': OK
  1554. 573.13 s [vector] +++ OK, passed 100 tests.
  1555. 573.13 s [vector] mut_ifoldM: OK
  1556. 573.13 s [vector] +++ OK, passed 100 tests.
  1557. 573.13 s [vector] mut_ifoldM': OK
  1558. 573.13 s [vector] +++ OK, passed 100 tests.
  1559. 573.14 s [vector] mut_ifoldrM: OK
  1560. 573.14 s [vector] +++ OK, passed 100 tests.
  1561. 573.14 s [vector] mut_ifoldrM': OK
  1562. 573.14 s [vector] +++ OK, passed 100 tests.
  1563. 573.14 s [vector] compare: OK
  1564. 573.14 s [vector] +++ OK, passed 100 tests.
  1565. 573.14 s [vector] maximum: OK
  1566. 573.14 s [vector] +++ OK, passed 100 tests; 20 discarded.
  1567. 573.14 s [vector] minimum: OK
  1568. 573.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1569. 573.14 s [vector] minIndex: OK
  1570. 573.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1571. 573.14 s [vector] maxIndex: OK
  1572. 573.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1573. 573.14 s [vector] maximumBy: OK
  1574. 573.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1575. 573.15 s [vector] minimumBy: OK
  1576. 573.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1577. 573.15 s [vector] maximumOn: OK
  1578. 573.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1579. 573.15 s [vector] minimumOn: OK
  1580. 573.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1581. 573.15 s [vector] maxIndexBy: OK
  1582. 573.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1583. 573.15 s [vector] minIndexBy: OK
  1584. 573.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1585. 573.15 s [vector] ListFirstMaxIndexWins: OK
  1586. 573.15 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1587. 573.15 s [vector] FalseListFirstMaxIndexWins: OK
  1588. 573.15 s [vector] +++ OK, failed as expected. (after 1 test):
  1589. 573.15 s [vector] Exception:
  1590. 573.15 s [vector] Prelude.foldr1: empty list
  1591. 573.15 s [vector] CallStack (from HasCallStack):
  1592. 573.15 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  1593. 573.15 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  1594. 573.15 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  1595. 573.15 s [vector] []
  1596. 573.15 s [vector] zip: OK
  1597. 573.15 s [vector] +++ OK, passed 100 tests.
  1598. 573.15 s [vector] zip3: OK
  1599. 573.15 s [vector] +++ OK, passed 100 tests.
  1600. 573.15 s [vector] unzip: OK
  1601. 573.15 s [vector] +++ OK, passed 100 tests.
  1602. 573.15 s [vector] unzip3: OK
  1603. 573.15 s [vector] +++ OK, passed 100 tests.
  1604. 573.15 s [vector] indexed: OK
  1605. 573.15 s [vector] +++ OK, passed 100 tests.
  1606. 573.15 s [vector] update: OK
  1607. 573.15 s [vector] +++ OK, passed 100 tests.
  1608. 573.16 s [vector] concat: OK
  1609. 573.16 s [vector] +++ OK, passed 100 tests.
  1610. 573.16 s [vector] mempty: OK
  1611. 573.16 s [vector] +++ OK, passed 100 tests.
  1612. 573.17 s [vector] mappend: OK
  1613. 573.17 s [vector] +++ OK, passed 100 tests.
  1614. 573.17 s [vector] mconcat: OK (0.01s)
  1615. 573.17 s [vector] +++ OK, passed 100 tests.
  1616. 573.18 s [vector] fmap: OK
  1617. 573.18 s [vector] +++ OK, passed 100 tests.
  1618. 573.18 s [vector] return: OK
  1619. 573.18 s [vector] +++ OK, passed 100 tests.
  1620. 573.19 s [vector] bind: OK
  1621. 573.19 s [vector] +++ OK, passed 100 tests.
  1622. 573.19 s [vector] mzip: OK
  1623. 573.19 s [vector] +++ OK, passed 100 tests.
  1624. 573.19 s [vector] munzip: OK
  1625. 573.19 s [vector] +++ OK, passed 100 tests.
  1626. 573.19 s [vector] applicative_pure: OK
  1627. 573.20 s [vector] +++ OK, passed 100 tests.
  1628. 573.23 s [vector] applicative_appl: OK (0.02s)
  1629. 573.23 s [vector] +++ OK, passed 100 tests.
  1630. 573.23 s [vector] alternative_empty: OK
  1631. 573.23 s [vector] +++ OK, passed 100 tests.
  1632. 573.23 s [vector] alternative_or: OK
  1633. 573.23 s [vector] +++ OK, passed 100 tests.
  1634. 573.27 s [vector] sequence: OK (0.03s)
  1635. 573.27 s [vector] +++ OK, passed 100 tests.
  1636. 573.27 s [vector] sequence_: OK (0.01s)
  1637. 573.27 s [vector] +++ OK, passed 100 tests.
  1638. 573.27 s [vector] glength: OK
  1639. 573.27 s [vector] +++ OK, passed 100 tests.
  1640. 573.27 s [vector] sum: OK
  1641. 573.27 s [vector] +++ OK, passed 100 tests.
  1642. 573.27 s [vector] product: OK
  1643. 573.27 s [vector] +++ OK, passed 100 tests.
  1644. 573.27 s [vector] enumFromN: OK
  1645. 573.27 s [vector] +++ OK, passed 100 tests.
  1646. 573.27 s [vector] enumFromThenN: OK
  1647. 573.27 s [vector] +++ OK, passed 100 tests.
  1648. 573.27 s [vector] enumFromTo: OK
  1649. 573.27 s [vector] +++ OK, passed 100 tests.
  1650. 573.27 s [vector] enumFromThenTo: OK
  1651. 573.27 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1652. 573.27 s [vector] unstream
  1653. 573.27 s [vector] unstream == vunstream (exact): OK
  1654. 573.27 s [vector] +++ OK, passed 100 tests.
  1655. 573.28 s [vector] unstream == vunstream (unknown): OK
  1656. 573.28 s [vector] +++ OK, passed 100 tests.
  1657. 573.28 s [vector] unstreamR ~= vunstream (exact): OK
  1658. 573.28 s [vector] +++ OK, passed 100 tests.
  1659. 573.28 s [vector] unstreamR ~= vunstream (unknown): OK
  1660. 573.28 s [vector] +++ OK, passed 100 tests.
  1661. 573.28 s [vector] Tests.Vector.Primitive
  1662. 573.28 s [vector] Int
  1663. 573.28 s [vector] fromList.toList == id: OK
  1664. 573.28 s [vector] +++ OK, passed 100 tests.
  1665. 573.28 s [vector] toList.fromList == id: OK
  1666. 573.28 s [vector] +++ OK, passed 100 tests.
  1667. 573.28 s [vector] unstream.stream == id: OK
  1668. 573.28 s [vector] +++ OK, passed 100 tests.
  1669. 573.28 s [vector] stream.unstream == id: OK
  1670. 573.28 s [vector] +++ OK, passed 100 tests.
  1671. 573.28 s [vector] eq: OK
  1672. 573.28 s [vector] +++ OK, passed 100 tests.
  1673. 573.28 s [vector] length: OK
  1674. 573.28 s [vector] +++ OK, passed 100 tests.
  1675. 573.28 s [vector] null: OK
  1676. 573.28 s [vector] +++ OK, passed 100 tests.
  1677. 573.28 s [vector] index: OK
  1678. 573.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1679. 573.28 s [vector] safeIndex: OK
  1680. 573.28 s [vector] +++ OK, passed 100 tests.
  1681. 573.28 s [vector] head: OK
  1682. 573.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1683. 573.28 s [vector] last: OK
  1684. 573.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  1685. 573.28 s [vector] unsafeIndex: OK
  1686. 573.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1687. 573.28 s [vector] unsafeHead: OK
  1688. 573.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1689. 573.28 s [vector] unsafeLast: OK
  1690. 573.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1691. 573.28 s [vector] slice: OK
  1692. 573.28 s [vector] +++ OK, passed 100 tests.
  1693. 573.29 s [vector] init: OK
  1694. 573.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1695. 573.29 s [vector] tail: OK
  1696. 573.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1697. 573.29 s [vector] take: OK
  1698. 573.29 s [vector] +++ OK, passed 100 tests.
  1699. 573.29 s [vector] drop: OK
  1700. 573.29 s [vector] +++ OK, passed 100 tests.
  1701. 573.29 s [vector] splitAt: OK
  1702. 573.29 s [vector] +++ OK, passed 100 tests.
  1703. 573.29 s [vector] empty: OK
  1704. 573.29 s [vector] +++ OK, passed 100 tests.
  1705. 573.29 s [vector] singleton: OK
  1706. 573.29 s [vector] +++ OK, passed 100 tests.
  1707. 573.31 s [vector] replicate: OK
  1708. 573.31 s [vector] +++ OK, passed 100 tests.
  1709. 573.31 s [vector] generate: OK
  1710. 573.31 s [vector] +++ OK, passed 100 tests.
  1711. 573.31 s [vector] iterateN: OK
  1712. 573.31 s [vector] +++ OK, passed 100 tests.
  1713. 573.33 s [vector] iterateNM: OK (0.03s)
  1714. 573.33 s [vector] +++ OK, passed 100 tests.
  1715. 573.35 s [vector] generateM: OK (0.02s)
  1716. 573.35 s [vector] +++ OK, passed 100 tests.
  1717. 573.36 s [vector] replicateM: OK (0.02s)
  1718. 573.36 s [vector] +++ OK, passed 100 tests.
  1719. 573.36 s [vector] create: OK
  1720. 573.36 s [vector] +++ OK, passed 100 tests.
  1721. 573.36 s [vector] createT: OK
  1722. 573.37 s [vector] +++ OK, passed 100 tests.
  1723. 573.37 s [vector] unfoldr: OK
  1724. 573.37 s [vector] +++ OK, passed 100 tests.
  1725. 573.37 s [vector] unfoldrN: OK
  1726. 573.37 s [vector] +++ OK, passed 100 tests.
  1727. 573.37 s [vector] unfoldrExactN: OK
  1728. 573.37 s [vector] +++ OK, passed 100 tests.
  1729. 573.37 s [vector] unfoldrM: OK
  1730. 573.37 s [vector] +++ OK, passed 100 tests.
  1731. 573.37 s [vector] unfoldrNM: OK
  1732. 573.37 s [vector] +++ OK, passed 100 tests.
  1733. 573.41 s [vector] unfoldrExactNM: OK (0.05s)
  1734. 573.42 s [vector] +++ OK, passed 100 tests.
  1735. 573.42 s [vector] constructN: OK
  1736. 573.42 s [vector] +++ OK, passed 100 tests.
  1737. 573.42 s [vector] constructrN: OK
  1738. 573.42 s [vector] +++ OK, passed 100 tests.
  1739. 573.42 s [vector] cons: OK
  1740. 573.42 s [vector] +++ OK, passed 100 tests.
  1741. 573.42 s [vector] snoc: OK
  1742. 573.42 s [vector] +++ OK, passed 100 tests.
  1743. 573.43 s [vector] append: OK
  1744. 573.43 s [vector] +++ OK, passed 100 tests.
  1745. 573.44 s [vector] concat: OK (0.02s)
  1746. 573.44 s [vector] +++ OK, passed 100 tests.
  1747. 573.44 s [vector] force: OK
  1748. 573.45 s [vector] +++ OK, passed 100 tests.
  1749. 573.45 s [vector] upd: OK
  1750. 573.45 s [vector] +++ OK, passed 100 tests.
  1751. 573.45 s [vector] accum: OK
  1752. 573.45 s [vector] +++ OK, passed 100 tests.
  1753. 573.45 s [vector] reverse: OK
  1754. 573.45 s [vector] +++ OK, passed 100 tests.
  1755. 573.45 s [vector] backpermute: OK
  1756. 573.45 s [vector] +++ OK, passed 100 tests.
  1757. 573.45 s [vector] map: OK
  1758. 573.45 s [vector] +++ OK, passed 100 tests.
  1759. 573.45 s [vector] imap: OK
  1760. 573.45 s [vector] +++ OK, passed 100 tests.
  1761. 573.46 s [vector] concatMap: OK
  1762. 573.47 s [vector] +++ OK, passed 100 tests.
  1763. 573.47 s [vector] mapM: OK
  1764. 573.47 s [vector] +++ OK, passed 100 tests.
  1765. 573.47 s [vector] mapM_: OK (0.01s)
  1766. 573.49 s [vector] +++ OK, passed 100 tests.
  1767. 573.49 s [vector] forM: OK
  1768. 573.49 s [vector] +++ OK, passed 100 tests.
  1769. 573.51 s [vector] forM_: OK (0.01s)
  1770. 573.51 s [vector] +++ OK, passed 100 tests.
  1771. 573.51 s [vector] imapM: OK
  1772. 573.51 s [vector] +++ OK, passed 100 tests.
  1773. 573.51 s [vector] imapM_: OK (0.02s)
  1774. 573.51 s [vector] +++ OK, passed 100 tests.
  1775. 573.51 s [vector] zipWith: OK
  1776. 573.51 s [vector] +++ OK, passed 100 tests.
  1777. 573.51 s [vector] zipWith3: OK
  1778. 573.51 s [vector] +++ OK, passed 100 tests.
  1779. 573.52 s [vector] izipWith: OK
  1780. 573.52 s [vector] +++ OK, passed 100 tests.
  1781. 573.52 s [vector] izipWith3: OK
  1782. 573.52 s [vector] +++ OK, passed 100 tests.
  1783. 573.52 s [vector] izipWithM: OK
  1784. 573.52 s [vector] +++ OK, passed 100 tests.
  1785. 573.54 s [vector] izipWithM_: OK (0.01s)
  1786. 573.55 s [vector] +++ OK, passed 100 tests.
  1787. 573.55 s [vector] zipWithM: OK
  1788. 573.55 s [vector] +++ OK, passed 100 tests.
  1789. 573.55 s [vector] zipWithM_: OK
  1790. 573.57 s [vector] +++ OK, passed 100 tests.
  1791. 573.57 s [vector] filter: OK
  1792. 573.57 s [vector] +++ OK, passed 100 tests.
  1793. 573.57 s [vector] ifilter: OK
  1794. 573.57 s [vector] +++ OK, passed 100 tests.
  1795. 573.57 s [vector] filterM: OK (0.02s)
  1796. 573.58 s [vector] +++ OK, passed 100 tests.
  1797. 573.58 s [vector] uniq: OK
  1798. 573.58 s [vector] +++ OK, passed 100 tests.
  1799. 573.58 s [vector] mapMaybe: OK
  1800. 573.58 s [vector] +++ OK, passed 100 tests.
  1801. 573.58 s [vector] imapMaybe: OK
  1802. 573.58 s [vector] +++ OK, passed 100 tests.
  1803. 573.58 s [vector] takeWhile: OK
  1804. 573.58 s [vector] +++ OK, passed 100 tests.
  1805. 573.58 s [vector] dropWhile: OK
  1806. 573.58 s [vector] +++ OK, passed 100 tests.
  1807. 573.59 s [vector] partition: OK
  1808. 573.59 s [vector] +++ OK, passed 100 tests.
  1809. 573.59 s [vector] partitionWith: OK
  1810. 573.59 s [vector] +++ OK, passed 100 tests.
  1811. 573.59 s [vector] span: OK
  1812. 573.59 s [vector] +++ OK, passed 100 tests.
  1813. 573.59 s [vector] break: OK
  1814. 573.59 s [vector] +++ OK, passed 100 tests.
  1815. 573.59 s [vector] spanR: OK
  1816. 573.59 s [vector] +++ OK, passed 100 tests.
  1817. 573.59 s [vector] breakR: OK
  1818. 573.59 s [vector] +++ OK, passed 100 tests.
  1819. 573.59 s [vector] groupBy: OK
  1820. 573.59 s [vector] +++ OK, passed 100 tests.
  1821. 573.59 s [vector] elem: OK
  1822. 573.59 s [vector] +++ OK, passed 100 tests.
  1823. 573.59 s [vector] notElem: OK
  1824. 573.59 s [vector] +++ OK, passed 100 tests.
  1825. 573.59 s [vector] find: OK
  1826. 573.59 s [vector] +++ OK, passed 100 tests.
  1827. 573.59 s [vector] findIndex: OK
  1828. 573.59 s [vector] +++ OK, passed 100 tests.
  1829. 573.59 s [vector] findIndexR: OK
  1830. 573.59 s [vector] +++ OK, passed 100 tests.
  1831. 573.60 s [vector] findIndices: OK
  1832. 573.60 s [vector] +++ OK, passed 100 tests.
  1833. 573.60 s [vector] elemIndex: OK
  1834. 573.60 s [vector] +++ OK, passed 100 tests.
  1835. 573.60 s [vector] elemIndices: OK
  1836. 573.60 s [vector] +++ OK, passed 100 tests.
  1837. 573.60 s [vector] foldl: OK
  1838. 573.60 s [vector] +++ OK, passed 100 tests.
  1839. 573.60 s [vector] foldl1: OK
  1840. 573.60 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1841. 573.60 s [vector] foldl': OK
  1842. 573.60 s [vector] +++ OK, passed 100 tests.
  1843. 573.61 s [vector] foldl1': OK
  1844. 573.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1845. 573.61 s [vector] foldr: OK
  1846. 573.61 s [vector] +++ OK, passed 100 tests.
  1847. 573.61 s [vector] foldr1: OK
  1848. 573.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1849. 573.62 s [vector] foldr': OK
  1850. 573.62 s [vector] +++ OK, passed 100 tests.
  1851. 573.62 s [vector] foldr1': OK
  1852. 573.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1853. 573.62 s [vector] ifoldl: OK
  1854. 573.62 s [vector] +++ OK, passed 100 tests.
  1855. 573.62 s [vector] ifoldl': OK
  1856. 573.62 s [vector] +++ OK, passed 100 tests.
  1857. 573.63 s [vector] ifoldr: OK
  1858. 573.63 s [vector] +++ OK, passed 100 tests.
  1859. 573.63 s [vector] ifoldr': OK
  1860. 573.63 s [vector] +++ OK, passed 100 tests.
  1861. 573.65 s [vector] ifoldM: OK
  1862. 573.65 s [vector] +++ OK, passed 100 tests.
  1863. 573.67 s [vector] ifoldM': OK
  1864. 573.67 s [vector] +++ OK, passed 100 tests.
  1865. 573.67 s [vector] ifoldM_: OK (0.02s)
  1866. 573.67 s [vector] +++ OK, passed 100 tests.
  1867. 573.67 s [vector] ifoldM'_: OK (0.02s)
  1868. 573.67 s [vector] +++ OK, passed 100 tests.
  1869. 573.67 s [vector] all: OK
  1870. 573.67 s [vector] +++ OK, passed 100 tests.
  1871. 573.67 s [vector] any: OK
  1872. 573.67 s [vector] +++ OK, passed 100 tests.
  1873. 573.67 s [vector] prescanl: OK
  1874. 573.67 s [vector] +++ OK, passed 100 tests.
  1875. 573.67 s [vector] prescanl': OK
  1876. 573.67 s [vector] +++ OK, passed 100 tests.
  1877. 573.68 s [vector] postscanl: OK
  1878. 573.68 s [vector] +++ OK, passed 100 tests.
  1879. 573.68 s [vector] postscanl': OK
  1880. 573.69 s [vector] +++ OK, passed 100 tests.
  1881. 573.69 s [vector] scanl: OK
  1882. 573.69 s [vector] +++ OK, passed 100 tests.
  1883. 573.69 s [vector] scanl': OK
  1884. 573.69 s [vector] +++ OK, passed 100 tests.
  1885. 573.69 s [vector] scanl1: OK
  1886. 573.69 s [vector] +++ OK, passed 100 tests.
  1887. 573.69 s [vector] scanl1': OK
  1888. 573.69 s [vector] +++ OK, passed 100 tests.
  1889. 573.70 s [vector] iscanl: OK
  1890. 573.70 s [vector] +++ OK, passed 100 tests.
  1891. 573.70 s [vector] iscanl': OK
  1892. 573.70 s [vector] +++ OK, passed 100 tests.
  1893. 573.70 s [vector] prescanr: OK
  1894. 573.70 s [vector] +++ OK, passed 100 tests.
  1895. 573.70 s [vector] prescanr': OK
  1896. 573.71 s [vector] +++ OK, passed 100 tests.
  1897. 573.71 s [vector] postscanr: OK
  1898. 573.71 s [vector] +++ OK, passed 100 tests.
  1899. 573.71 s [vector] postscanr': OK
  1900. 573.71 s [vector] +++ OK, passed 100 tests.
  1901. 573.71 s [vector] scanr: OK
  1902. 573.71 s [vector] +++ OK, passed 100 tests.
  1903. 573.71 s [vector] scanr': OK
  1904. 573.71 s [vector] +++ OK, passed 100 tests.
  1905. 573.72 s [vector] scanr1: OK
  1906. 573.72 s [vector] +++ OK, passed 100 tests.
  1907. 573.73 s [vector] scanr1': OK
  1908. 573.73 s [vector] +++ OK, passed 100 tests.
  1909. 573.73 s [vector] iscanr: OK
  1910. 573.73 s [vector] +++ OK, passed 100 tests.
  1911. 573.73 s [vector] iscanr': OK
  1912. 573.73 s [vector] +++ OK, passed 100 tests.
  1913. 573.73 s [vector] mut_read: OK
  1914. 573.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1915. 573.73 s [vector] mut_write: OK
  1916. 573.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1917. 573.74 s [vector] mut_modify: OK
  1918. 573.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1919. 573.75 s [vector] mut_generate: OK
  1920. 573.75 s [vector] +++ OK, passed 100 tests.
  1921. 573.75 s [vector] mut_generateM: OK (0.01s)
  1922. 573.75 s [vector] +++ OK, passed 100 tests.
  1923. 573.76 s [vector] mut_mapM_: OK (0.01s)
  1924. 573.76 s [vector] +++ OK, passed 100 tests.
  1925. 573.78 s [vector] mut_imapM_: OK
  1926. 573.78 s [vector] +++ OK, passed 100 tests.
  1927. 573.81 s [vector] mut_forM_: OK
  1928. 573.81 s [vector] +++ OK, passed 100 tests.
  1929. 573.81 s [vector] mut_iforM_: OK (0.02s)
  1930. 573.81 s [vector] +++ OK, passed 100 tests.
  1931. 573.81 s [vector] mut_foldr: OK
  1932. 573.81 s [vector] +++ OK, passed 100 tests.
  1933. 573.81 s [vector] mut_foldr': OK
  1934. 573.82 s [vector] +++ OK, passed 100 tests.
  1935. 573.82 s [vector] mut_foldl: OK
  1936. 573.82 s [vector] +++ OK, passed 100 tests.
  1937. 573.82 s [vector] mut_foldl': OK
  1938. 573.82 s [vector] +++ OK, passed 100 tests.
  1939. 573.82 s [vector] mut_ifoldr: OK
  1940. 573.82 s [vector] +++ OK, passed 100 tests.
  1941. 573.82 s [vector] mut_ifoldr': OK
  1942. 573.82 s [vector] +++ OK, passed 100 tests.
  1943. 573.83 s [vector] mut_ifoldl: OK
  1944. 573.83 s [vector] +++ OK, passed 100 tests.
  1945. 573.83 s [vector] mut_ifoldl': OK
  1946. 573.83 s [vector] +++ OK, passed 100 tests.
  1947. 573.83 s [vector] mut_foldM: OK
  1948. 573.83 s [vector] +++ OK, passed 100 tests.
  1949. 573.84 s [vector] mut_foldM': OK
  1950. 573.84 s [vector] +++ OK, passed 100 tests.
  1951. 573.84 s [vector] mut_foldrM: OK
  1952. 573.84 s [vector] +++ OK, passed 100 tests.
  1953. 573.84 s [vector] mut_foldrM': OK
  1954. 573.84 s [vector] +++ OK, passed 100 tests.
  1955. 573.84 s [vector] mut_ifoldM: OK
  1956. 573.84 s [vector] +++ OK, passed 100 tests.
  1957. 573.85 s [vector] mut_ifoldM': OK
  1958. 573.85 s [vector] +++ OK, passed 100 tests.
  1959. 573.85 s [vector] mut_ifoldrM: OK
  1960. 573.85 s [vector] +++ OK, passed 100 tests.
  1961. 573.86 s [vector] mut_ifoldrM': OK
  1962. 573.86 s [vector] +++ OK, passed 100 tests.
  1963. 573.86 s [vector] compare: OK
  1964. 573.86 s [vector] +++ OK, passed 100 tests.
  1965. 573.86 s [vector] maximum: OK
  1966. 573.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1967. 573.86 s [vector] minimum: OK
  1968. 573.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1969. 573.86 s [vector] minIndex: OK
  1970. 573.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1971. 573.86 s [vector] maxIndex: OK
  1972. 573.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1973. 573.86 s [vector] maximumBy: OK
  1974. 573.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1975. 573.86 s [vector] minimumBy: OK
  1976. 573.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1977. 573.86 s [vector] maximumOn: OK
  1978. 573.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1979. 573.86 s [vector] minimumOn: OK
  1980. 573.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1981. 573.86 s [vector] maxIndexBy: OK
  1982. 573.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1983. 573.86 s [vector] minIndexBy: OK
  1984. 573.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1985. 573.86 s [vector] ListFirstMaxIndexWins: OK
  1986. 573.86 s [vector] +++ OK, passed 100 tests; 23 discarded.
  1987. 573.86 s [vector] FalseListFirstMaxIndexWins: OK
  1988. 573.86 s [vector] +++ OK, failed as expected. (after 1 test):
  1989. 573.87 s [vector] Exception:
  1990. 573.87 s [vector] Prelude.foldr1: empty list
  1991. 573.87 s [vector] CallStack (from HasCallStack):
  1992. 573.87 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  1993. 573.87 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  1994. 573.87 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  1995. 573.87 s [vector] []
  1996. 573.88 s [vector] mempty: OK
  1997. 573.88 s [vector] +++ OK, passed 100 tests.
  1998. 573.88 s [vector] mappend: OK
  1999. 573.88 s [vector] +++ OK, passed 100 tests.
  2000. 573.88 s [vector] mconcat: OK (0.02s)
  2001. 573.88 s [vector] +++ OK, passed 100 tests.
  2002. 573.89 s [vector] glength: OK
  2003. 573.89 s [vector] +++ OK, passed 100 tests.
  2004. 573.89 s [vector] sum: OK
  2005. 573.89 s [vector] +++ OK, passed 100 tests.
  2006. 573.89 s [vector] product: OK
  2007. 573.89 s [vector] +++ OK, passed 100 tests.
  2008. 573.89 s [vector] enumFromN: OK
  2009. 573.89 s [vector] +++ OK, passed 100 tests.
  2010. 573.89 s [vector] enumFromThenN: OK
  2011. 573.89 s [vector] +++ OK, passed 100 tests.
  2012. 573.89 s [vector] enumFromTo: OK
  2013. 573.89 s [vector] +++ OK, passed 100 tests.
  2014. 573.89 s [vector] enumFromThenTo: OK
  2015. 573.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2016. 573.89 s [vector] Double
  2017. 573.89 s [vector] fromList.toList == id: OK
  2018. 573.89 s [vector] +++ OK, passed 100 tests.
  2019. 573.89 s [vector] toList.fromList == id: OK
  2020. 573.89 s [vector] +++ OK, passed 100 tests.
  2021. 573.89 s [vector] unstream.stream == id: OK
  2022. 573.89 s [vector] +++ OK, passed 100 tests.
  2023. 573.89 s [vector] stream.unstream == id: OK
  2024. 573.90 s [vector] +++ OK, passed 100 tests.
  2025. 573.90 s [vector] eq: OK
  2026. 573.90 s [vector] +++ OK, passed 100 tests.
  2027. 573.90 s [vector] length: OK
  2028. 573.90 s [vector] +++ OK, passed 100 tests.
  2029. 573.90 s [vector] null: OK
  2030. 573.90 s [vector] +++ OK, passed 100 tests.
  2031. 573.90 s [vector] index: OK
  2032. 573.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2033. 573.90 s [vector] safeIndex: OK
  2034. 573.90 s [vector] +++ OK, passed 100 tests.
  2035. 573.90 s [vector] head: OK
  2036. 573.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2037. 573.90 s [vector] last: OK
  2038. 573.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2039. 573.90 s [vector] unsafeIndex: OK
  2040. 573.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2041. 573.90 s [vector] unsafeHead: OK
  2042. 573.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2043. 573.90 s [vector] unsafeLast: OK
  2044. 573.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2045. 573.90 s [vector] slice: OK
  2046. 573.90 s [vector] +++ OK, passed 100 tests.
  2047. 573.90 s [vector] init: OK
  2048. 573.90 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2049. 573.90 s [vector] tail: OK
  2050. 573.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2051. 573.90 s [vector] take: OK
  2052. 573.90 s [vector] +++ OK, passed 100 tests.
  2053. 573.90 s [vector] drop: OK
  2054. 573.90 s [vector] +++ OK, passed 100 tests.
  2055. 573.90 s [vector] splitAt: OK
  2056. 573.90 s [vector] +++ OK, passed 100 tests.
  2057. 573.90 s [vector] empty: OK
  2058. 573.90 s [vector] +++ OK, passed 100 tests.
  2059. 573.90 s [vector] singleton: OK
  2060. 573.90 s [vector] +++ OK, passed 100 tests.
  2061. 573.91 s [vector] replicate: OK
  2062. 573.91 s [vector] +++ OK, passed 100 tests.
  2063. 573.91 s [vector] generate: OK
  2064. 573.93 s [vector] +++ OK, passed 100 tests.
  2065. 573.93 s [vector] iterateN: OK
  2066. 573.93 s [vector] +++ OK, passed 100 tests.
  2067. 573.93 s [vector] iterateNM: OK (0.02s)
  2068. 573.93 s [vector] +++ OK, passed 100 tests.
  2069. 573.97 s [vector] generateM: OK (0.01s)
  2070. 573.97 s [vector] +++ OK, passed 100 tests.
  2071. 573.97 s [vector] replicateM: OK
  2072. 573.97 s [vector] +++ OK, passed 100 tests.
  2073. 573.97 s [vector] create: OK
  2074. 573.97 s [vector] +++ OK, passed 100 tests.
  2075. 573.97 s [vector] createT: OK
  2076. 573.97 s [vector] +++ OK, passed 100 tests.
  2077. 573.97 s [vector] unfoldr: OK
  2078. 573.97 s [vector] +++ OK, passed 100 tests.
  2079. 573.97 s [vector] unfoldrN: OK
  2080. 573.97 s [vector] +++ OK, passed 100 tests.
  2081. 573.97 s [vector] unfoldrExactN: OK
  2082. 573.97 s [vector] +++ OK, passed 100 tests.
  2083. 573.98 s [vector] unfoldrM: OK
  2084. 573.99 s [vector] +++ OK, passed 100 tests.
  2085. 573.99 s [vector] unfoldrNM: OK
  2086. 573.99 s [vector] +++ OK, passed 100 tests.
  2087. 574.03 s [vector] unfoldrExactNM: OK (0.05s)
  2088. 574.03 s [vector] +++ OK, passed 100 tests.
  2089. 574.05 s [vector] constructN: OK
  2090. 574.05 s [vector] +++ OK, passed 100 tests.
  2091. 574.05 s [vector] constructrN: OK (0.01s)
  2092. 574.05 s [vector] +++ OK, passed 100 tests.
  2093. 574.05 s [vector] cons: OK
  2094. 574.05 s [vector] +++ OK, passed 100 tests.
  2095. 574.05 s [vector] snoc: OK
  2096. 574.05 s [vector] +++ OK, passed 100 tests.
  2097. 574.05 s [vector] append: OK
  2098. 574.05 s [vector] +++ OK, passed 100 tests.
  2099. 574.07 s [vector] concat: OK
  2100. 574.07 s [vector] +++ OK, passed 100 tests.
  2101. 574.08 s [vector] force: OK
  2102. 574.08 s [vector] +++ OK, passed 100 tests.
  2103. 574.08 s [vector] upd: OK
  2104. 574.08 s [vector] +++ OK, passed 100 tests.
  2105. 574.09 s [vector] accum: OK
  2106. 574.09 s [vector] +++ OK, passed 100 tests.
  2107. 574.09 s [vector] reverse: OK
  2108. 574.09 s [vector] +++ OK, passed 100 tests.
  2109. 574.09 s [vector] backpermute: OK
  2110. 574.09 s [vector] +++ OK, passed 100 tests.
  2111. 574.11 s [vector] map: OK
  2112. 574.11 s [vector] +++ OK, passed 100 tests.
  2113. 574.11 s [vector] imap: OK
  2114. 574.11 s [vector] +++ OK, passed 100 tests.
  2115. 574.13 s [vector] concatMap: OK
  2116. 574.13 s [vector] +++ OK, passed 100 tests.
  2117. 574.13 s [vector] mapM: OK
  2118. 574.13 s [vector] +++ OK, passed 100 tests.
  2119. 574.16 s [vector] mapM_: OK (0.03s)
  2120. 574.17 s [vector] +++ OK, passed 100 tests.
  2121. 574.17 s [vector] forM: OK
  2122. 574.17 s [vector] +++ OK, passed 100 tests.
  2123. 574.19 s [vector] forM_: OK (0.03s)
  2124. 574.19 s [vector] +++ OK, passed 100 tests.
  2125. 574.21 s [vector] imapM: OK
  2126. 574.21 s [vector] +++ OK, passed 100 tests.
  2127. 574.24 s [vector] imapM_: OK (0.03s)
  2128. 574.25 s [vector] +++ OK, passed 100 tests.
  2129. 574.25 s [vector] zipWith: OK
  2130. 574.25 s [vector] +++ OK, passed 100 tests.
  2131. 574.25 s [vector] zipWith3: OK (0.01s)
  2132. 574.25 s [vector] +++ OK, passed 100 tests.
  2133. 574.26 s [vector] izipWith: OK
  2134. 574.26 s [vector] +++ OK, passed 100 tests.
  2135. 574.28 s [vector] izipWith3: OK
  2136. 574.29 s [vector] +++ OK, passed 100 tests.
  2137. 574.29 s [vector] izipWithM: OK
  2138. 574.29 s [vector] +++ OK, passed 100 tests.
  2139. 574.31 s [vector] izipWithM_: OK (0.02s)
  2140. 574.31 s [vector] +++ OK, passed 100 tests.
  2141. 574.33 s [vector] zipWithM: OK
  2142. 574.33 s [vector] +++ OK, passed 100 tests.
  2143. 574.34 s [vector] zipWithM_: OK (0.03s)
  2144. 574.34 s [vector] +++ OK, passed 100 tests.
  2145. 574.35 s [vector] filter: OK
  2146. 574.35 s [vector] +++ OK, passed 100 tests.
  2147. 574.37 s [vector] ifilter: OK
  2148. 574.37 s [vector] +++ OK, passed 100 tests.
  2149. 574.40 s [vector] filterM: OK (0.04s)
  2150. 574.40 s [vector] +++ OK, passed 100 tests.
  2151. 574.40 s [vector] uniq: OK
  2152. 574.40 s [vector] +++ OK, passed 100 tests.
  2153. 574.40 s [vector] mapMaybe: OK
  2154. 574.40 s [vector] +++ OK, passed 100 tests.
  2155. 574.41 s [vector] imapMaybe: OK
  2156. 574.41 s [vector] +++ OK, passed 100 tests.
  2157. 574.41 s [vector] takeWhile: OK
  2158. 574.42 s [vector] +++ OK, passed 100 tests.
  2159. 574.42 s [vector] dropWhile: OK
  2160. 574.42 s [vector] +++ OK, passed 100 tests.
  2161. 574.42 s [vector] partition: OK
  2162. 574.42 s [vector] +++ OK, passed 100 tests.
  2163. 574.43 s [vector] partitionWith: OK
  2164. 574.43 s [vector] +++ OK, passed 100 tests.
  2165. 574.43 s [vector] span: OK
  2166. 574.43 s [vector] +++ OK, passed 100 tests.
  2167. 574.43 s [vector] break: OK
  2168. 574.43 s [vector] +++ OK, passed 100 tests.
  2169. 574.43 s [vector] spanR: OK
  2170. 574.43 s [vector] +++ OK, passed 100 tests.
  2171. 574.43 s [vector] breakR: OK
  2172. 574.43 s [vector] +++ OK, passed 100 tests.
  2173. 574.44 s [vector] groupBy: OK
  2174. 574.44 s [vector] +++ OK, passed 100 tests.
  2175. 574.44 s [vector] elem: OK
  2176. 574.44 s [vector] +++ OK, passed 100 tests.
  2177. 574.44 s [vector] notElem: OK
  2178. 574.44 s [vector] +++ OK, passed 100 tests.
  2179. 574.44 s [vector] find: OK
  2180. 574.44 s [vector] +++ OK, passed 100 tests.
  2181. 574.44 s [vector] findIndex: OK
  2182. 574.44 s [vector] +++ OK, passed 100 tests.
  2183. 574.45 s [vector] findIndexR: OK
  2184. 574.45 s [vector] +++ OK, passed 100 tests.
  2185. 574.45 s [vector] findIndices: OK
  2186. 574.45 s [vector] +++ OK, passed 100 tests.
  2187. 574.45 s [vector] elemIndex: OK
  2188. 574.46 s [vector] +++ OK, passed 100 tests.
  2189. 574.46 s [vector] elemIndices: OK
  2190. 574.46 s [vector] +++ OK, passed 100 tests.
  2191. 574.47 s [vector] foldl: OK (0.01s)
  2192. 574.47 s [vector] +++ OK, passed 100 tests.
  2193. 574.49 s [vector] foldl1: OK (0.01s)
  2194. 574.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2195. 574.49 s [vector] foldl': OK (0.01s)
  2196. 574.49 s [vector] +++ OK, passed 100 tests.
  2197. 574.51 s [vector] foldl1': OK (0.01s)
  2198. 574.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2199. 574.51 s [vector] foldr: OK (0.01s)
  2200. 574.51 s [vector] +++ OK, passed 100 tests.
  2201. 574.53 s [vector] foldr1: OK
  2202. 574.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2203. 574.53 s [vector] foldr': OK
  2204. 574.53 s [vector] +++ OK, passed 100 tests.
  2205. 574.55 s [vector] foldr1': OK
  2206. 574.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2207. 574.55 s [vector] ifoldl: OK (0.01s)
  2208. 574.55 s [vector] +++ OK, passed 100 tests.
  2209. 574.57 s [vector] ifoldl': OK (0.01s)
  2210. 574.57 s [vector] +++ OK, passed 100 tests.
  2211. 574.59 s [vector] ifoldr: OK (0.01s)
  2212. 574.59 s [vector] +++ OK, passed 100 tests.
  2213. 574.59 s [vector] ifoldr': OK (0.01s)
  2214. 574.59 s [vector] +++ OK, passed 100 tests.
  2215. 574.60 s [vector] ifoldM: OK (0.01s)
  2216. 574.61 s [vector] +++ OK, passed 100 tests.
  2217. 574.61 s [vector] ifoldM': OK (0.01s)
  2218. 574.61 s [vector] +++ OK, passed 100 tests.
  2219. 574.65 s [vector] ifoldM_: OK (0.04s)
  2220. 574.65 s [vector] +++ OK, passed 100 tests.
  2221. 574.67 s [vector] ifoldM'_: OK (0.03s)
  2222. 574.68 s [vector] +++ OK, passed 100 tests.
  2223. 574.69 s [vector] all: OK
  2224. 574.69 s [vector] +++ OK, passed 100 tests.
  2225. 574.69 s [vector] any: OK
  2226. 574.69 s [vector] +++ OK, passed 100 tests.
  2227. 574.69 s [vector] prescanl: OK (0.01s)
  2228. 574.69 s [vector] +++ OK, passed 100 tests.
  2229. 574.71 s [vector] prescanl': OK
  2230. 574.71 s [vector] +++ OK, passed 100 tests.
  2231. 574.72 s [vector] postscanl: OK (0.01s)
  2232. 574.73 s [vector] +++ OK, passed 100 tests.
  2233. 574.73 s [vector] postscanl': OK (0.01s)
  2234. 574.73 s [vector] +++ OK, passed 100 tests.
  2235. 574.75 s [vector] scanl: OK (0.01s)
  2236. 574.75 s [vector] +++ OK, passed 100 tests.
  2237. 574.75 s [vector] scanl': OK (0.01s)
  2238. 574.75 s [vector] +++ OK, passed 100 tests.
  2239. 574.76 s [vector] scanl1: OK (0.01s)
  2240. 574.76 s [vector] +++ OK, passed 100 tests.
  2241. 574.77 s [vector] scanl1': OK
  2242. 574.77 s [vector] +++ OK, passed 100 tests.
  2243. 574.79 s [vector] iscanl: OK (0.01s)
  2244. 574.79 s [vector] +++ OK, passed 100 tests.
  2245. 574.79 s [vector] iscanl': OK (0.01s)
  2246. 574.79 s [vector] +++ OK, passed 100 tests.
  2247. 574.80 s [vector] prescanr: OK
  2248. 574.80 s [vector] +++ OK, passed 100 tests.
  2249. 574.83 s [vector] prescanr': OK
  2250. 574.83 s [vector] +++ OK, passed 100 tests.
  2251. 574.83 s [vector] postscanr: OK (0.01s)
  2252. 574.83 s [vector] +++ OK, passed 100 tests.
  2253. 574.85 s [vector] postscanr': OK (0.01s)
  2254. 574.85 s [vector] +++ OK, passed 100 tests.
  2255. 574.87 s [vector] scanr: OK (0.01s)
  2256. 574.87 s [vector] +++ OK, passed 100 tests.
  2257. 574.87 s [vector] scanr': OK (0.01s)
  2258. 574.87 s [vector] +++ OK, passed 100 tests.
  2259. 574.89 s [vector] scanr1: OK (0.01s)
  2260. 574.89 s [vector] +++ OK, passed 100 tests.
  2261. 574.89 s [vector] scanr1': OK (0.01s)
  2262. 574.89 s [vector] +++ OK, passed 100 tests.
  2263. 574.91 s [vector] iscanr: OK (0.01s)
  2264. 574.91 s [vector] +++ OK, passed 100 tests.
  2265. 574.91 s [vector] iscanr': OK (0.01s)
  2266. 574.91 s [vector] +++ OK, passed 100 tests.
  2267. 574.91 s [vector] mut_read: OK
  2268. 574.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2269. 574.91 s [vector] mut_write: OK
  2270. 574.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2271. 574.91 s [vector] mut_modify: OK
  2272. 574.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2273. 574.93 s [vector] mut_generate: OK
  2274. 574.93 s [vector] +++ OK, passed 100 tests.
  2275. 574.95 s [vector] mut_generateM: OK (0.02s)
  2276. 574.95 s [vector] +++ OK, passed 100 tests.
  2277. 574.97 s [vector] mut_mapM_: OK (0.03s)
  2278. 574.97 s [vector] +++ OK, passed 100 tests.
  2279. 574.99 s [vector] mut_imapM_: OK (0.03s)
  2280. 574.99 s [vector] +++ OK, passed 100 tests.
  2281. 575.03 s [vector] mut_forM_: OK (0.02s)
  2282. 575.03 s [vector] +++ OK, passed 100 tests.
  2283. 575.06 s [vector] mut_iforM_: OK (0.03s)
  2284. 575.06 s [vector] +++ OK, passed 100 tests.
  2285. 575.08 s [vector] mut_foldr: OK
  2286. 575.08 s [vector] +++ OK, passed 100 tests.
  2287. 575.09 s [vector] mut_foldr': OK (0.01s)
  2288. 575.09 s [vector] +++ OK, passed 100 tests.
  2289. 575.11 s [vector] mut_foldl: OK (0.01s)
  2290. 575.11 s [vector] +++ OK, passed 100 tests.
  2291. 575.11 s [vector] mut_foldl': OK (0.01s)
  2292. 575.11 s [vector] +++ OK, passed 100 tests.
  2293. 575.13 s [vector] mut_ifoldr: OK
  2294. 575.13 s [vector] +++ OK, passed 100 tests.
  2295. 575.14 s [vector] mut_ifoldr': OK (0.01s)
  2296. 575.15 s [vector] +++ OK, passed 100 tests.
  2297. 575.15 s [vector] mut_ifoldl: OK (0.01s)
  2298. 575.15 s [vector] +++ OK, passed 100 tests.
  2299. 575.17 s [vector] mut_ifoldl': OK (0.01s)
  2300. 575.17 s [vector] +++ OK, passed 100 tests.
  2301. 575.17 s [vector] mut_foldM: OK (0.01s)
  2302. 575.17 s [vector] +++ OK, passed 100 tests.
  2303. 575.19 s [vector] mut_foldM': OK (0.01s)
  2304. 575.19 s [vector] +++ OK, passed 100 tests.
  2305. 575.19 s [vector] mut_foldrM: OK (0.01s)
  2306. 575.19 s [vector] +++ OK, passed 100 tests.
  2307. 575.21 s [vector] mut_foldrM': OK (0.01s)
  2308. 575.21 s [vector] +++ OK, passed 100 tests.
  2309. 575.23 s [vector] mut_ifoldM: OK (0.01s)
  2310. 575.23 s [vector] +++ OK, passed 100 tests.
  2311. 575.23 s [vector] mut_ifoldM': OK (0.01s)
  2312. 575.23 s [vector] +++ OK, passed 100 tests.
  2313. 575.24 s [vector] mut_ifoldrM: OK (0.01s)
  2314. 575.24 s [vector] +++ OK, passed 100 tests.
  2315. 575.25 s [vector] mut_ifoldrM': OK
  2316. 575.25 s [vector] +++ OK, passed 100 tests.
  2317. 575.25 s [vector] compare: OK
  2318. 575.25 s [vector] +++ OK, passed 100 tests.
  2319. 575.25 s [vector] maximum: OK
  2320. 575.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2321. 575.26 s [vector] minimum: OK
  2322. 575.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2323. 575.26 s [vector] minIndex: OK
  2324. 575.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2325. 575.26 s [vector] maxIndex: OK
  2326. 575.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2327. 575.26 s [vector] maximumBy: OK
  2328. 575.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2329. 575.26 s [vector] minimumBy: OK
  2330. 575.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2331. 575.26 s [vector] maximumOn: OK
  2332. 575.26 s [vector] +++ OK, passed 100 tests; 25 discarded.
  2333. 575.26 s [vector] minimumOn: OK
  2334. 575.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2335. 575.26 s [vector] maxIndexBy: OK
  2336. 575.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2337. 575.26 s [vector] minIndexBy: OK
  2338. 575.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2339. 575.26 s [vector] ListFirstMaxIndexWins: OK
  2340. 575.26 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2341. 575.27 s [vector] FalseListFirstMaxIndexWins: OK
  2342. 575.27 s [vector] +++ OK, failed as expected. (after 1 test):
  2343. 575.27 s [vector] Exception:
  2344. 575.27 s [vector] Prelude.foldr1: empty list
  2345. 575.27 s [vector] CallStack (from HasCallStack):
  2346. 575.27 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  2347. 575.27 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  2348. 575.27 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  2349. 575.27 s [vector] []
  2350. 575.27 s [vector] mempty: OK
  2351. 575.27 s [vector] +++ OK, passed 100 tests.
  2352. 575.27 s [vector] mappend: OK
  2353. 575.27 s [vector] +++ OK, passed 100 tests.
  2354. 575.29 s [vector] mconcat: OK (0.02s)
  2355. 575.29 s [vector] +++ OK, passed 100 tests.
  2356. 575.29 s [vector] glength: OK
  2357. 575.29 s [vector] +++ OK, passed 100 tests.
  2358. 575.30 s [vector] sum: OK
  2359. 575.30 s [vector] +++ OK, passed 100 tests.
  2360. 575.30 s [vector] product: OK
  2361. 575.30 s [vector] +++ OK, passed 100 tests.
  2362. 575.30 s [vector] enumFromN: OK
  2363. 575.30 s [vector] +++ OK, passed 100 tests.
  2364. 575.30 s [vector] enumFromThenN: OK
  2365. 575.30 s [vector] +++ OK, passed 100 tests.
  2366. 575.30 s [vector] enumFromTo: OK
  2367. 575.30 s [vector] +++ OK, passed 100 tests.
  2368. 575.30 s [vector] enumFromThenTo: OK
  2369. 575.30 s [vector] +++ OK, passed 100 tests; 2 discarded.
  2370. 575.30 s [vector] unstream
  2371. 575.30 s [vector] unstream == vunstream (exact): OK
  2372. 575.30 s [vector] +++ OK, passed 100 tests.
  2373. 575.31 s [vector] unstream == vunstream (unknown): OK
  2374. 575.31 s [vector] +++ OK, passed 100 tests.
  2375. 575.31 s [vector] unstreamR ~= vunstream (exact): OK
  2376. 575.31 s [vector] +++ OK, passed 100 tests.
  2377. 575.31 s [vector] unstreamR ~= vunstream (unknown): OK
  2378. 575.31 s [vector] +++ OK, passed 100 tests.
  2379. 575.31 s [vector] Tests.Vector.Storable
  2380. 575.31 s [vector] Data.Vector.Storable.Vector (Int)
  2381. 575.31 s [vector] fromList.toList == id: OK
  2382. 575.31 s [vector] +++ OK, passed 100 tests.
  2383. 575.31 s [vector] toList.fromList == id: OK
  2384. 575.31 s [vector] +++ OK, passed 100 tests.
  2385. 575.31 s [vector] unstream.stream == id: OK
  2386. 575.31 s [vector] +++ OK, passed 100 tests.
  2387. 575.31 s [vector] stream.unstream == id: OK
  2388. 575.31 s [vector] +++ OK, passed 100 tests.
  2389. 575.31 s [vector] eq: OK
  2390. 575.31 s [vector] +++ OK, passed 100 tests.
  2391. 575.31 s [vector] length: OK
  2392. 575.31 s [vector] +++ OK, passed 100 tests.
  2393. 575.31 s [vector] null: OK
  2394. 575.31 s [vector] +++ OK, passed 100 tests.
  2395. 575.31 s [vector] index: OK
  2396. 575.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2397. 575.31 s [vector] safeIndex: OK
  2398. 575.31 s [vector] +++ OK, passed 100 tests.
  2399. 575.31 s [vector] head: OK
  2400. 575.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2401. 575.31 s [vector] last: OK
  2402. 575.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2403. 575.31 s [vector] unsafeIndex: OK
  2404. 575.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2405. 575.31 s [vector] unsafeHead: OK
  2406. 575.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2407. 575.31 s [vector] unsafeLast: OK
  2408. 575.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2409. 575.32 s [vector] slice: OK
  2410. 575.32 s [vector] +++ OK, passed 100 tests.
  2411. 575.32 s [vector] init: OK
  2412. 575.32 s [vector] +++ OK, passed 100 tests; 11 discarded.
  2413. 575.32 s [vector] tail: OK
  2414. 575.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2415. 575.32 s [vector] take: OK
  2416. 575.32 s [vector] +++ OK, passed 100 tests.
  2417. 575.32 s [vector] drop: OK
  2418. 575.32 s [vector] +++ OK, passed 100 tests.
  2419. 575.32 s [vector] splitAt: OK
  2420. 575.32 s [vector] +++ OK, passed 100 tests.
  2421. 575.32 s [vector] empty: OK
  2422. 575.32 s [vector] +++ OK, passed 100 tests.
  2423. 575.32 s [vector] singleton: OK
  2424. 575.32 s [vector] +++ OK, passed 100 tests.
  2425. 575.32 s [vector] replicate: OK
  2426. 575.33 s [vector] +++ OK, passed 100 tests.
  2427. 575.33 s [vector] generate: OK
  2428. 575.33 s [vector] +++ OK, passed 100 tests.
  2429. 575.33 s [vector] iterateN: OK
  2430. 575.33 s [vector] +++ OK, passed 100 tests.
  2431. 575.37 s [vector] iterateNM: OK (0.04s)
  2432. 575.37 s [vector] +++ OK, passed 100 tests.
  2433. 575.38 s [vector] generateM: OK (0.01s)
  2434. 575.38 s [vector] +++ OK, passed 100 tests.
  2435. 575.38 s [vector] replicateM: OK
  2436. 575.38 s [vector] +++ OK, passed 100 tests.
  2437. 575.38 s [vector] create: OK
  2438. 575.38 s [vector] +++ OK, passed 100 tests.
  2439. 575.38 s [vector] createT: OK
  2440. 575.38 s [vector] +++ OK, passed 100 tests.
  2441. 575.38 s [vector] unfoldr: OK
  2442. 575.38 s [vector] +++ OK, passed 100 tests.
  2443. 575.38 s [vector] unfoldrN: OK
  2444. 575.38 s [vector] +++ OK, passed 100 tests.
  2445. 575.38 s [vector] unfoldrExactN: OK
  2446. 575.38 s [vector] +++ OK, passed 100 tests.
  2447. 575.39 s [vector] unfoldrM: OK
  2448. 575.39 s [vector] +++ OK, passed 100 tests.
  2449. 575.39 s [vector] unfoldrNM: OK
  2450. 575.39 s [vector] +++ OK, passed 100 tests.
  2451. 575.41 s [vector] unfoldrExactNM: OK (0.02s)
  2452. 575.41 s [vector] +++ OK, passed 100 tests.
  2453. 575.42 s [vector] constructN: OK
  2454. 575.42 s [vector] +++ OK, passed 100 tests.
  2455. 575.42 s [vector] constructrN: OK
  2456. 575.42 s [vector] +++ OK, passed 100 tests.
  2457. 575.42 s [vector] cons: OK
  2458. 575.42 s [vector] +++ OK, passed 100 tests.
  2459. 575.42 s [vector] snoc: OK
  2460. 575.42 s [vector] +++ OK, passed 100 tests.
  2461. 575.42 s [vector] append: OK
  2462. 575.42 s [vector] +++ OK, passed 100 tests.
  2463. 575.43 s [vector] concat: OK
  2464. 575.43 s [vector] +++ OK, passed 100 tests.
  2465. 575.43 s [vector] force: OK
  2466. 575.43 s [vector] +++ OK, passed 100 tests.
  2467. 575.44 s [vector] upd: OK
  2468. 575.44 s [vector] +++ OK, passed 100 tests.
  2469. 575.44 s [vector] accum: OK
  2470. 575.44 s [vector] +++ OK, passed 100 tests.
  2471. 575.44 s [vector] reverse: OK
  2472. 575.44 s [vector] +++ OK, passed 100 tests.
  2473. 575.44 s [vector] backpermute: OK
  2474. 575.44 s [vector] +++ OK, passed 100 tests.
  2475. 575.45 s [vector] map: OK
  2476. 575.45 s [vector] +++ OK, passed 100 tests.
  2477. 575.45 s [vector] imap: OK
  2478. 575.45 s [vector] +++ OK, passed 100 tests.
  2479. 575.45 s [vector] concatMap: OK
  2480. 575.45 s [vector] +++ OK, passed 100 tests.
  2481. 575.45 s [vector] mapM: OK
  2482. 575.45 s [vector] +++ OK, passed 100 tests.
  2483. 575.46 s [vector] mapM_: OK (0.01s)
  2484. 575.47 s [vector] +++ OK, passed 100 tests.
  2485. 575.47 s [vector] forM: OK
  2486. 575.47 s [vector] +++ OK, passed 100 tests.
  2487. 575.48 s [vector] forM_: OK (0.02s)
  2488. 575.49 s [vector] +++ OK, passed 100 tests.
  2489. 575.49 s [vector] imapM: OK
  2490. 575.49 s [vector] +++ OK, passed 100 tests.
  2491. 575.50 s [vector] imapM_: OK (0.02s)
  2492. 575.50 s [vector] +++ OK, passed 100 tests.
  2493. 575.50 s [vector] zipWith: OK
  2494. 575.50 s [vector] +++ OK, passed 100 tests.
  2495. 575.51 s [vector] zipWith3: OK
  2496. 575.51 s [vector] +++ OK, passed 100 tests.
  2497. 575.51 s [vector] izipWith: OK
  2498. 575.51 s [vector] +++ OK, passed 100 tests.
  2499. 575.51 s [vector] izipWith3: OK
  2500. 575.51 s [vector] +++ OK, passed 100 tests.
  2501. 575.53 s [vector] izipWithM: OK
  2502. 575.53 s [vector] +++ OK, passed 100 tests.
  2503. 575.53 s [vector] izipWithM_: OK (0.01s)
  2504. 575.53 s [vector] +++ OK, passed 100 tests.
  2505. 575.53 s [vector] zipWithM: OK
  2506. 575.53 s [vector] +++ OK, passed 100 tests.
  2507. 575.54 s [vector] zipWithM_: OK
  2508. 575.54 s [vector] +++ OK, passed 100 tests.
  2509. 575.55 s [vector] filter: OK
  2510. 575.55 s [vector] +++ OK, passed 100 tests.
  2511. 575.55 s [vector] ifilter: OK
  2512. 575.55 s [vector] +++ OK, passed 100 tests.
  2513. 575.57 s [vector] filterM: OK (0.02s)
  2514. 575.57 s [vector] +++ OK, passed 100 tests.
  2515. 575.57 s [vector] uniq: OK
  2516. 575.57 s [vector] +++ OK, passed 100 tests.
  2517. 575.57 s [vector] mapMaybe: OK
  2518. 575.57 s [vector] +++ OK, passed 100 tests.
  2519. 575.57 s [vector] imapMaybe: OK
  2520. 575.57 s [vector] +++ OK, passed 100 tests.
  2521. 575.58 s [vector] takeWhile: OK
  2522. 575.58 s [vector] +++ OK, passed 100 tests.
  2523. 575.58 s [vector] dropWhile: OK
  2524. 575.58 s [vector] +++ OK, passed 100 tests.
  2525. 575.58 s [vector] partition: OK
  2526. 575.58 s [vector] +++ OK, passed 100 tests.
  2527. 575.58 s [vector] partitionWith: OK
  2528. 575.58 s [vector] +++ OK, passed 100 tests.
  2529. 575.58 s [vector] span: OK
  2530. 575.58 s [vector] +++ OK, passed 100 tests.
  2531. 575.58 s [vector] break: OK
  2532. 575.58 s [vector] +++ OK, passed 100 tests.
  2533. 575.58 s [vector] spanR: OK
  2534. 575.58 s [vector] +++ OK, passed 100 tests.
  2535. 575.59 s [vector] breakR: OK
  2536. 575.59 s [vector] +++ OK, passed 100 tests.
  2537. 575.59 s [vector] groupBy: OK
  2538. 575.59 s [vector] +++ OK, passed 100 tests.
  2539. 575.59 s [vector] elem: OK
  2540. 575.59 s [vector] +++ OK, passed 100 tests.
  2541. 575.59 s [vector] notElem: OK
  2542. 575.59 s [vector] +++ OK, passed 100 tests.
  2543. 575.59 s [vector] find: OK
  2544. 575.59 s [vector] +++ OK, passed 100 tests.
  2545. 575.59 s [vector] findIndex: OK
  2546. 575.59 s [vector] +++ OK, passed 100 tests.
  2547. 575.59 s [vector] findIndexR: OK
  2548. 575.59 s [vector] +++ OK, passed 100 tests.
  2549. 575.59 s [vector] findIndices: OK
  2550. 575.59 s [vector] +++ OK, passed 100 tests.
  2551. 575.59 s [vector] elemIndex: OK
  2552. 575.59 s [vector] +++ OK, passed 100 tests.
  2553. 575.59 s [vector] elemIndices: OK
  2554. 575.59 s [vector] +++ OK, passed 100 tests.
  2555. 575.60 s [vector] foldl: OK
  2556. 575.60 s [vector] +++ OK, passed 100 tests.
  2557. 575.60 s [vector] foldl1: OK
  2558. 575.60 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2559. 575.60 s [vector] foldl': OK
  2560. 575.60 s [vector] +++ OK, passed 100 tests.
  2561. 575.60 s [vector] foldl1': OK
  2562. 575.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2563. 575.60 s [vector] foldr: OK
  2564. 575.60 s [vector] +++ OK, passed 100 tests.
  2565. 575.60 s [vector] foldr1: OK
  2566. 575.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2567. 575.61 s [vector] foldr': OK
  2568. 575.61 s [vector] +++ OK, passed 100 tests.
  2569. 575.61 s [vector] foldr1': OK
  2570. 575.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2571. 575.62 s [vector] ifoldl: OK
  2572. 575.62 s [vector] +++ OK, passed 100 tests.
  2573. 575.62 s [vector] ifoldl': OK
  2574. 575.62 s [vector] +++ OK, passed 100 tests.
  2575. 575.62 s [vector] ifoldr: OK
  2576. 575.62 s [vector] +++ OK, passed 100 tests.
  2577. 575.63 s [vector] ifoldr': OK
  2578. 575.63 s [vector] +++ OK, passed 100 tests.
  2579. 575.63 s [vector] ifoldM: OK
  2580. 575.63 s [vector] +++ OK, passed 100 tests.
  2581. 575.63 s [vector] ifoldM': OK
  2582. 575.63 s [vector] +++ OK, passed 100 tests.
  2583. 575.64 s [vector] ifoldM_: OK (0.02s)
  2584. 575.64 s [vector] +++ OK, passed 100 tests.
  2585. 575.66 s [vector] ifoldM'_: OK (0.01s)
  2586. 575.66 s [vector] +++ OK, passed 100 tests.
  2587. 575.66 s [vector] all: OK
  2588. 575.66 s [vector] +++ OK, passed 100 tests.
  2589. 575.67 s [vector] any: OK
  2590. 575.67 s [vector] +++ OK, passed 100 tests.
  2591. 575.67 s [vector] prescanl: OK
  2592. 575.67 s [vector] +++ OK, passed 100 tests.
  2593. 575.67 s [vector] prescanl': OK
  2594. 575.67 s [vector] +++ OK, passed 100 tests.
  2595. 575.67 s [vector] postscanl: OK
  2596. 575.67 s [vector] +++ OK, passed 100 tests.
  2597. 575.68 s [vector] postscanl': OK
  2598. 575.68 s [vector] +++ OK, passed 100 tests.
  2599. 575.68 s [vector] scanl: OK
  2600. 575.68 s [vector] +++ OK, passed 100 tests.
  2601. 575.68 s [vector] scanl': OK
  2602. 575.68 s [vector] +++ OK, passed 100 tests.
  2603. 575.68 s [vector] scanl1: OK
  2604. 575.69 s [vector] +++ OK, passed 100 tests.
  2605. 575.69 s [vector] scanl1': OK
  2606. 575.69 s [vector] +++ OK, passed 100 tests.
  2607. 575.69 s [vector] iscanl: OK
  2608. 575.69 s [vector] +++ OK, passed 100 tests.
  2609. 575.69 s [vector] iscanl': OK
  2610. 575.69 s [vector] +++ OK, passed 100 tests.
  2611. 575.70 s [vector] prescanr: OK
  2612. 575.70 s [vector] +++ OK, passed 100 tests.
  2613. 575.70 s [vector] prescanr': OK
  2614. 575.70 s [vector] +++ OK, passed 100 tests.
  2615. 575.70 s [vector] postscanr: OK
  2616. 575.70 s [vector] +++ OK, passed 100 tests.
  2617. 575.70 s [vector] postscanr': OK
  2618. 575.70 s [vector] +++ OK, passed 100 tests.
  2619. 575.70 s [vector] scanr: OK
  2620. 575.71 s [vector] +++ OK, passed 100 tests.
  2621. 575.71 s [vector] scanr': OK
  2622. 575.71 s [vector] +++ OK, passed 100 tests.
  2623. 575.71 s [vector] scanr1: OK
  2624. 575.71 s [vector] +++ OK, passed 100 tests.
  2625. 575.71 s [vector] scanr1': OK
  2626. 575.71 s [vector] +++ OK, passed 100 tests.
  2627. 575.72 s [vector] iscanr: OK
  2628. 575.72 s [vector] +++ OK, passed 100 tests.
  2629. 575.72 s [vector] iscanr': OK
  2630. 575.72 s [vector] +++ OK, passed 100 tests.
  2631. 575.72 s [vector] mut_read: OK
  2632. 575.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2633. 575.72 s [vector] mut_write: OK
  2634. 575.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2635. 575.72 s [vector] mut_modify: OK
  2636. 575.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2637. 575.73 s [vector] mut_generate: OK
  2638. 575.73 s [vector] +++ OK, passed 100 tests.
  2639. 575.73 s [vector] mut_generateM: OK
  2640. 575.73 s [vector] +++ OK, passed 100 tests.
  2641. 575.75 s [vector] mut_mapM_: OK (0.01s)
  2642. 575.75 s [vector] +++ OK, passed 100 tests.
  2643. 575.77 s [vector] mut_imapM_: OK (0.02s)
  2644. 575.77 s [vector] +++ OK, passed 100 tests.
  2645. 575.79 s [vector] mut_forM_: OK (0.01s)
  2646. 575.79 s [vector] +++ OK, passed 100 tests.
  2647. 575.79 s [vector] mut_iforM_: OK (0.01s)
  2648. 575.79 s [vector] +++ OK, passed 100 tests.
  2649. 575.79 s [vector] mut_foldr: OK
  2650. 575.79 s [vector] +++ OK, passed 100 tests.
  2651. 575.79 s [vector] mut_foldr': OK
  2652. 575.79 s [vector] +++ OK, passed 100 tests.
  2653. 575.80 s [vector] mut_foldl: OK
  2654. 575.80 s [vector] +++ OK, passed 100 tests.
  2655. 575.80 s [vector] mut_foldl': OK
  2656. 575.80 s [vector] +++ OK, passed 100 tests.
  2657. 575.80 s [vector] mut_ifoldr: OK
  2658. 575.80 s [vector] +++ OK, passed 100 tests.
  2659. 575.81 s [vector] mut_ifoldr': OK
  2660. 575.81 s [vector] +++ OK, passed 100 tests.
  2661. 575.81 s [vector] mut_ifoldl: OK
  2662. 575.81 s [vector] +++ OK, passed 100 tests.
  2663. 575.81 s [vector] mut_ifoldl': OK
  2664. 575.81 s [vector] +++ OK, passed 100 tests.
  2665. 575.81 s [vector] mut_foldM: OK
  2666. 575.81 s [vector] +++ OK, passed 100 tests.
  2667. 575.81 s [vector] mut_foldM': OK
  2668. 575.81 s [vector] +++ OK, passed 100 tests.
  2669. 575.82 s [vector] mut_foldrM: OK
  2670. 575.82 s [vector] +++ OK, passed 100 tests.
  2671. 575.82 s [vector] mut_foldrM': OK
  2672. 575.82 s [vector] +++ OK, passed 100 tests.
  2673. 575.83 s [vector] mut_ifoldM: OK
  2674. 575.83 s [vector] +++ OK, passed 100 tests.
  2675. 575.83 s [vector] mut_ifoldM': OK
  2676. 575.83 s [vector] +++ OK, passed 100 tests.
  2677. 575.83 s [vector] mut_ifoldrM: OK
  2678. 575.83 s [vector] +++ OK, passed 100 tests.
  2679. 575.83 s [vector] mut_ifoldrM': OK
  2680. 575.83 s [vector] +++ OK, passed 100 tests.
  2681. 575.83 s [vector] compare: OK
  2682. 575.83 s [vector] +++ OK, passed 100 tests.
  2683. 575.83 s [vector] maximum: OK
  2684. 575.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2685. 575.83 s [vector] minimum: OK
  2686. 575.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2687. 575.84 s [vector] minIndex: OK
  2688. 575.84 s [vector] +++ OK, passed 100 tests; 11 discarded.
  2689. 575.84 s [vector] maxIndex: OK
  2690. 575.84 s [vector] +++ OK, passed 100 tests; 24 discarded.
  2691. 575.84 s [vector] maximumBy: OK
  2692. 575.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2693. 575.84 s [vector] minimumBy: OK
  2694. 575.84 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2695. 575.84 s [vector] maximumOn: OK
  2696. 575.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2697. 575.84 s [vector] minimumOn: OK
  2698. 575.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2699. 575.84 s [vector] maxIndexBy: OK
  2700. 575.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2701. 575.84 s [vector] minIndexBy: OK
  2702. 575.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2703. 575.84 s [vector] ListFirstMaxIndexWins: OK
  2704. 575.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2705. 575.84 s [vector] FalseListFirstMaxIndexWins: OK
  2706. 575.84 s [vector] +++ OK, failed as expected. (after 1 test):
  2707. 575.84 s [vector] Exception:
  2708. 575.84 s [vector] Prelude.foldr1: empty list
  2709. 575.84 s [vector] CallStack (from HasCallStack):
  2710. 575.84 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  2711. 575.85 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  2712. 575.85 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  2713. 575.85 s [vector] []
  2714. 575.85 s [vector] mempty: OK
  2715. 575.85 s [vector] +++ OK, passed 100 tests.
  2716. 575.85 s [vector] mappend: OK
  2717. 575.86 s [vector] +++ OK, passed 100 tests.
  2718. 575.86 s [vector] mconcat: OK (0.01s)
  2719. 575.86 s [vector] +++ OK, passed 100 tests.
  2720. 575.86 s [vector] glength: OK
  2721. 575.86 s [vector] +++ OK, passed 100 tests.
  2722. 575.86 s [vector] sum: OK
  2723. 575.86 s [vector] +++ OK, passed 100 tests.
  2724. 575.86 s [vector] product: OK
  2725. 575.86 s [vector] +++ OK, passed 100 tests.
  2726. 575.86 s [vector] enumFromN: OK
  2727. 575.86 s [vector] +++ OK, passed 100 tests.
  2728. 575.86 s [vector] enumFromThenN: OK
  2729. 575.86 s [vector] +++ OK, passed 100 tests.
  2730. 575.86 s [vector] enumFromTo: OK
  2731. 575.86 s [vector] +++ OK, passed 100 tests.
  2732. 575.86 s [vector] enumFromThenTo: OK
  2733. 575.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2734. 575.86 s [vector] Data.Vector.Storable.Vector (Double)
  2735. 575.86 s [vector] fromList.toList == id: OK
  2736. 575.86 s [vector] +++ OK, passed 100 tests.
  2737. 575.86 s [vector] toList.fromList == id: OK
  2738. 575.86 s [vector] +++ OK, passed 100 tests.
  2739. 575.86 s [vector] unstream.stream == id: OK
  2740. 575.86 s [vector] +++ OK, passed 100 tests.
  2741. 575.86 s [vector] stream.unstream == id: OK
  2742. 575.86 s [vector] +++ OK, passed 100 tests.
  2743. 575.86 s [vector] eq: OK
  2744. 575.86 s [vector] +++ OK, passed 100 tests.
  2745. 575.86 s [vector] length: OK
  2746. 575.86 s [vector] +++ OK, passed 100 tests.
  2747. 575.86 s [vector] null: OK
  2748. 575.86 s [vector] +++ OK, passed 100 tests.
  2749. 575.87 s [vector] index: OK
  2750. 575.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2751. 575.87 s [vector] safeIndex: OK
  2752. 575.87 s [vector] +++ OK, passed 100 tests.
  2753. 575.87 s [vector] head: OK
  2754. 575.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2755. 575.87 s [vector] last: OK
  2756. 575.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2757. 575.87 s [vector] unsafeIndex: OK
  2758. 575.87 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2759. 575.87 s [vector] unsafeHead: OK
  2760. 575.87 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2761. 575.87 s [vector] unsafeLast: OK
  2762. 575.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2763. 575.87 s [vector] slice: OK
  2764. 575.87 s [vector] +++ OK, passed 100 tests.
  2765. 575.87 s [vector] init: OK
  2766. 575.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2767. 575.87 s [vector] tail: OK
  2768. 575.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2769. 575.87 s [vector] take: OK
  2770. 575.87 s [vector] +++ OK, passed 100 tests.
  2771. 575.87 s [vector] drop: OK
  2772. 575.87 s [vector] +++ OK, passed 100 tests.
  2773. 575.87 s [vector] splitAt: OK
  2774. 575.87 s [vector] +++ OK, passed 100 tests.
  2775. 575.87 s [vector] empty: OK
  2776. 575.87 s [vector] +++ OK, passed 100 tests.
  2777. 575.88 s [vector] singleton: OK
  2778. 575.88 s [vector] +++ OK, passed 100 tests.
  2779. 575.88 s [vector] replicate: OK
  2780. 575.88 s [vector] +++ OK, passed 100 tests.
  2781. 575.88 s [vector] generate: OK
  2782. 575.88 s [vector] +++ OK, passed 100 tests.
  2783. 575.89 s [vector] iterateN: OK
  2784. 575.89 s [vector] +++ OK, passed 100 tests.
  2785. 575.92 s [vector] iterateNM: OK (0.04s)
  2786. 575.92 s [vector] +++ OK, passed 100 tests.
  2787. 575.95 s [vector] generateM: OK (0.02s)
  2788. 575.95 s [vector] +++ OK, passed 100 tests.
  2789. 575.96 s [vector] replicateM: OK
  2790. 575.96 s [vector] +++ OK, passed 100 tests.
  2791. 575.96 s [vector] create: OK
  2792. 575.96 s [vector] +++ OK, passed 100 tests.
  2793. 575.96 s [vector] createT: OK
  2794. 575.96 s [vector] +++ OK, passed 100 tests.
  2795. 575.96 s [vector] unfoldr: OK
  2796. 575.96 s [vector] +++ OK, passed 100 tests.
  2797. 575.96 s [vector] unfoldrN: OK
  2798. 575.96 s [vector] +++ OK, passed 100 tests.
  2799. 575.96 s [vector] unfoldrExactN: OK
  2800. 575.96 s [vector] +++ OK, passed 100 tests.
  2801. 575.97 s [vector] unfoldrM: OK
  2802. 575.97 s [vector] +++ OK, passed 100 tests.
  2803. 575.99 s [vector] unfoldrNM: OK
  2804. 575.99 s [vector] +++ OK, passed 100 tests.
  2805. 576.01 s [vector] unfoldrExactNM: OK (0.04s)
  2806. 576.01 s [vector] +++ OK, passed 100 tests.
  2807. 576.03 s [vector] constructN: OK (0.01s)
  2808. 576.03 s [vector] +++ OK, passed 100 tests.
  2809. 576.03 s [vector] constructrN: OK (0.01s)
  2810. 576.03 s [vector] +++ OK, passed 100 tests.
  2811. 576.03 s [vector] cons: OK
  2812. 576.03 s [vector] +++ OK, passed 100 tests.
  2813. 576.03 s [vector] snoc: OK
  2814. 576.03 s [vector] +++ OK, passed 100 tests.
  2815. 576.03 s [vector] append: OK
  2816. 576.03 s [vector] +++ OK, passed 100 tests.
  2817. 576.05 s [vector] concat: OK
  2818. 576.05 s [vector] +++ OK, passed 100 tests.
  2819. 576.05 s [vector] force: OK
  2820. 576.05 s [vector] +++ OK, passed 100 tests.
  2821. 576.05 s [vector] upd: OK
  2822. 576.05 s [vector] +++ OK, passed 100 tests.
  2823. 576.07 s [vector] accum: OK (0.01s)
  2824. 576.07 s [vector] +++ OK, passed 100 tests.
  2825. 576.07 s [vector] reverse: OK
  2826. 576.07 s [vector] +++ OK, passed 100 tests.
  2827. 576.08 s [vector] backpermute: OK
  2828. 576.08 s [vector] +++ OK, passed 100 tests.
  2829. 576.08 s [vector] map: OK
  2830. 576.08 s [vector] +++ OK, passed 100 tests.
  2831. 576.09 s [vector] imap: OK
  2832. 576.09 s [vector] +++ OK, passed 100 tests.
  2833. 576.10 s [vector] concatMap: OK
  2834. 576.10 s [vector] +++ OK, passed 100 tests.
  2835. 576.10 s [vector] mapM: OK
  2836. 576.10 s [vector] +++ OK, passed 100 tests.
  2837. 576.13 s [vector] mapM_: OK (0.02s)
  2838. 576.13 s [vector] +++ OK, passed 100 tests.
  2839. 576.15 s [vector] forM: OK
  2840. 576.15 s [vector] +++ OK, passed 100 tests.
  2841. 576.16 s [vector] forM_: OK (0.03s)
  2842. 576.16 s [vector] +++ OK, passed 100 tests.
  2843. 576.19 s [vector] imapM: OK
  2844. 576.19 s [vector] +++ OK, passed 100 tests.
  2845. 576.21 s [vector] imapM_: OK (0.03s)
  2846. 576.21 s [vector] +++ OK, passed 100 tests.
  2847. 576.22 s [vector] zipWith: OK
  2848. 576.22 s [vector] +++ OK, passed 100 tests.
  2849. 576.22 s [vector] zipWith3: OK
  2850. 576.22 s [vector] +++ OK, passed 100 tests.
  2851. 576.25 s [vector] izipWith: OK
  2852. 576.25 s [vector] +++ OK, passed 100 tests.
  2853. 576.25 s [vector] izipWith3: OK (0.01s)
  2854. 576.25 s [vector] +++ OK, passed 100 tests.
  2855. 576.27 s [vector] izipWithM: OK
  2856. 576.27 s [vector] +++ OK, passed 100 tests.
  2857. 576.29 s [vector] izipWithM_: OK (0.03s)
  2858. 576.29 s [vector] +++ OK, passed 100 tests.
  2859. 576.31 s [vector] zipWithM: OK
  2860. 576.31 s [vector] +++ OK, passed 100 tests.
  2861. 576.32 s [vector] zipWithM_: OK (0.03s)
  2862. 576.32 s [vector] +++ OK, passed 100 tests.
  2863. 576.33 s [vector] filter: OK
  2864. 576.33 s [vector] +++ OK, passed 100 tests.
  2865. 576.35 s [vector] ifilter: OK
  2866. 576.35 s [vector] +++ OK, passed 100 tests.
  2867. 576.37 s [vector] filterM: OK (0.04s)
  2868. 576.37 s [vector] +++ OK, passed 100 tests.
  2869. 576.38 s [vector] uniq: OK
  2870. 576.39 s [vector] +++ OK, passed 100 tests.
  2871. 576.39 s [vector] mapMaybe: OK
  2872. 576.39 s [vector] +++ OK, passed 100 tests.
  2873. 576.39 s [vector] imapMaybe: OK
  2874. 576.39 s [vector] +++ OK, passed 100 tests.
  2875. 576.39 s [vector] takeWhile: OK
  2876. 576.39 s [vector] +++ OK, passed 100 tests.
  2877. 576.39 s [vector] dropWhile: OK
  2878. 576.39 s [vector] +++ OK, passed 100 tests.
  2879. 576.40 s [vector] partition: OK
  2880. 576.40 s [vector] +++ OK, passed 100 tests.
  2881. 576.40 s [vector] partitionWith: OK
  2882. 576.40 s [vector] +++ OK, passed 100 tests.
  2883. 576.40 s [vector] span: OK
  2884. 576.41 s [vector] +++ OK, passed 100 tests.
  2885. 576.41 s [vector] break: OK
  2886. 576.41 s [vector] +++ OK, passed 100 tests.
  2887. 576.41 s [vector] spanR: OK
  2888. 576.42 s [vector] +++ OK, passed 100 tests.
  2889. 576.42 s [vector] breakR: OK
  2890. 576.42 s [vector] +++ OK, passed 100 tests.
  2891. 576.42 s [vector] groupBy: OK
  2892. 576.42 s [vector] +++ OK, passed 100 tests.
  2893. 576.42 s [vector] elem: OK
  2894. 576.42 s [vector] +++ OK, passed 100 tests.
  2895. 576.42 s [vector] notElem: OK
  2896. 576.42 s [vector] +++ OK, passed 100 tests.
  2897. 576.42 s [vector] find: OK
  2898. 576.42 s [vector] +++ OK, passed 100 tests.
  2899. 576.42 s [vector] findIndex: OK
  2900. 576.42 s [vector] +++ OK, passed 100 tests.
  2901. 576.43 s [vector] findIndexR: OK
  2902. 576.43 s [vector] +++ OK, passed 100 tests.
  2903. 576.43 s [vector] findIndices: OK
  2904. 576.43 s [vector] +++ OK, passed 100 tests.
  2905. 576.43 s [vector] elemIndex: OK
  2906. 576.44 s [vector] +++ OK, passed 100 tests.
  2907. 576.45 s [vector] elemIndices: OK
  2908. 576.45 s [vector] +++ OK, passed 100 tests.
  2909. 576.45 s [vector] foldl: OK
  2910. 576.45 s [vector] +++ OK, passed 100 tests.
  2911. 576.45 s [vector] foldl1: OK (0.01s)
  2912. 576.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2913. 576.47 s [vector] foldl': OK (0.01s)
  2914. 576.47 s [vector] +++ OK, passed 100 tests.
  2915. 576.47 s [vector] foldl1': OK (0.01s)
  2916. 576.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2917. 576.48 s [vector] foldr: OK
  2918. 576.48 s [vector] +++ OK, passed 100 tests.
  2919. 576.50 s [vector] foldr1: OK
  2920. 576.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2921. 576.50 s [vector] foldr': OK (0.01s)
  2922. 576.50 s [vector] +++ OK, passed 100 tests.
  2923. 576.52 s [vector] foldr1': OK
  2924. 576.53 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2925. 576.53 s [vector] ifoldl: OK (0.01s)
  2926. 576.54 s [vector] +++ OK, passed 100 tests.
  2927. 576.55 s [vector] ifoldl': OK (0.01s)
  2928. 576.55 s [vector] +++ OK, passed 100 tests.
  2929. 576.55 s [vector] ifoldr: OK (0.01s)
  2930. 576.55 s [vector] +++ OK, passed 100 tests.
  2931. 576.57 s [vector] ifoldr': OK (0.01s)
  2932. 576.57 s [vector] +++ OK, passed 100 tests.
  2933. 576.58 s [vector] ifoldM: OK (0.01s)
  2934. 576.59 s [vector] +++ OK, passed 100 tests.
  2935. 576.59 s [vector] ifoldM': OK (0.01s)
  2936. 576.59 s [vector] +++ OK, passed 100 tests.
  2937. 576.62 s [vector] ifoldM_: OK (0.03s)
  2938. 576.62 s [vector] +++ OK, passed 100 tests.
  2939. 576.65 s [vector] ifoldM'_: OK (0.02s)
  2940. 576.66 s [vector] +++ OK, passed 100 tests.
  2941. 576.67 s [vector] all: OK
  2942. 576.67 s [vector] +++ OK, passed 100 tests.
  2943. 576.67 s [vector] any: OK
  2944. 576.67 s [vector] +++ OK, passed 100 tests.
  2945. 576.67 s [vector] prescanl: OK (0.01s)
  2946. 576.67 s [vector] +++ OK, passed 100 tests.
  2947. 576.69 s [vector] prescanl': OK (0.01s)
  2948. 576.69 s [vector] +++ OK, passed 100 tests.
  2949. 576.69 s [vector] postscanl: OK (0.01s)
  2950. 576.69 s [vector] +++ OK, passed 100 tests.
  2951. 576.71 s [vector] postscanl': OK (0.01s)
  2952. 576.71 s [vector] +++ OK, passed 100 tests.
  2953. 576.72 s [vector] scanl: OK (0.01s)
  2954. 576.72 s [vector] +++ OK, passed 100 tests.
  2955. 576.73 s [vector] scanl': OK (0.01s)
  2956. 576.73 s [vector] +++ OK, passed 100 tests.
  2957. 576.75 s [vector] scanl1: OK (0.01s)
  2958. 576.75 s [vector] +++ OK, passed 100 tests.
  2959. 576.75 s [vector] scanl1': OK (0.01s)
  2960. 576.75 s [vector] +++ OK, passed 100 tests.
  2961. 576.76 s [vector] iscanl: OK (0.01s)
  2962. 576.76 s [vector] +++ OK, passed 100 tests.
  2963. 576.78 s [vector] iscanl': OK
  2964. 576.79 s [vector] +++ OK, passed 100 tests.
  2965. 576.79 s [vector] prescanr: OK (0.01s)
  2966. 576.79 s [vector] +++ OK, passed 100 tests.
  2967. 576.81 s [vector] prescanr': OK (0.01s)
  2968. 576.81 s [vector] +++ OK, passed 100 tests.
  2969. 576.81 s [vector] postscanr: OK (0.01s)
  2970. 576.83 s [vector] +++ OK, passed 100 tests.
  2971. 576.83 s [vector] postscanr': OK (0.01s)
  2972. 576.83 s [vector] +++ OK, passed 100 tests.
  2973. 576.84 s [vector] scanr: OK (0.01s)
  2974. 576.85 s [vector] +++ OK, passed 100 tests.
  2975. 576.85 s [vector] scanr': OK (0.01s)
  2976. 576.85 s [vector] +++ OK, passed 100 tests.
  2977. 576.85 s [vector] scanr1: OK (0.01s)
  2978. 576.85 s [vector] +++ OK, passed 100 tests.
  2979. 576.87 s [vector] scanr1': OK (0.01s)
  2980. 576.87 s [vector] +++ OK, passed 100 tests.
  2981. 576.88 s [vector] iscanr: OK (0.01s)
  2982. 576.88 s [vector] +++ OK, passed 100 tests.
  2983. 576.89 s [vector] iscanr': OK (0.01s)
  2984. 576.89 s [vector] +++ OK, passed 100 tests.
  2985. 576.89 s [vector] mut_read: OK
  2986. 576.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2987. 576.89 s [vector] mut_write: OK
  2988. 576.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2989. 576.90 s [vector] mut_modify: OK
  2990. 576.90 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2991. 576.90 s [vector] mut_generate: OK
  2992. 576.90 s [vector] +++ OK, passed 100 tests.
  2993. 576.91 s [vector] mut_generateM: OK (0.02s)
  2994. 576.91 s [vector] +++ OK, passed 100 tests.
  2995. 576.93 s [vector] mut_mapM_: OK (0.03s)
  2996. 576.93 s [vector] +++ OK, passed 100 tests.
  2997. 576.97 s [vector] mut_imapM_: OK (0.02s)
  2998. 576.97 s [vector] +++ OK, passed 100 tests.
  2999. 577.01 s [vector] mut_forM_: OK (0.03s)
  3000. 577.01 s [vector] +++ OK, passed 100 tests.
  3001. 577.03 s [vector] mut_iforM_: OK (0.03s)
  3002. 577.03 s [vector] +++ OK, passed 100 tests.
  3003. 577.05 s [vector] mut_foldr: OK
  3004. 577.05 s [vector] +++ OK, passed 100 tests.
  3005. 577.07 s [vector] mut_foldr': OK (0.01s)
  3006. 577.07 s [vector] +++ OK, passed 100 tests.
  3007. 577.07 s [vector] mut_foldl: OK (0.01s)
  3008. 577.08 s [vector] +++ OK, passed 100 tests.
  3009. 577.09 s [vector] mut_foldl': OK
  3010. 577.09 s [vector] +++ OK, passed 100 tests.
  3011. 577.09 s [vector] mut_ifoldr: OK (0.01s)
  3012. 577.10 s [vector] +++ OK, passed 100 tests.
  3013. 577.11 s [vector] mut_ifoldr': OK
  3014. 577.11 s [vector] +++ OK, passed 100 tests.
  3015. 577.12 s [vector] mut_ifoldl: OK (0.01s)
  3016. 577.13 s [vector] +++ OK, passed 100 tests.
  3017. 577.13 s [vector] mut_ifoldl': OK (0.01s)
  3018. 577.13 s [vector] +++ OK, passed 100 tests.
  3019. 577.15 s [vector] mut_foldM: OK (0.01s)
  3020. 577.15 s [vector] +++ OK, passed 100 tests.
  3021. 577.15 s [vector] mut_foldM': OK (0.01s)
  3022. 577.15 s [vector] +++ OK, passed 100 tests.
  3023. 577.17 s [vector] mut_foldrM: OK
  3024. 577.17 s [vector] +++ OK, passed 100 tests.
  3025. 577.18 s [vector] mut_foldrM': OK (0.01s)
  3026. 577.18 s [vector] +++ OK, passed 100 tests.
  3027. 577.18 s [vector] mut_ifoldM: OK (0.01s)
  3028. 577.18 s [vector] +++ OK, passed 100 tests.
  3029. 577.19 s [vector] mut_ifoldM': OK
  3030. 577.19 s [vector] +++ OK, passed 100 tests.
  3031. 577.21 s [vector] mut_ifoldrM: OK (0.01s)
  3032. 577.21 s [vector] +++ OK, passed 100 tests.
  3033. 577.22 s [vector] mut_ifoldrM': OK (0.01s)
  3034. 577.22 s [vector] +++ OK, passed 100 tests.
  3035. 577.22 s [vector] compare: OK
  3036. 577.22 s [vector] +++ OK, passed 100 tests.
  3037. 577.22 s [vector] maximum: OK
  3038. 577.22 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3039. 577.22 s [vector] minimum: OK
  3040. 577.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3041. 577.22 s [vector] minIndex: OK
  3042. 577.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3043. 577.22 s [vector] maxIndex: OK
  3044. 577.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3045. 577.22 s [vector] maximumBy: OK
  3046. 577.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3047. 577.22 s [vector] minimumBy: OK
  3048. 577.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3049. 577.22 s [vector] maximumOn: OK
  3050. 577.23 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3051. 577.23 s [vector] minimumOn: OK
  3052. 577.23 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3053. 577.23 s [vector] maxIndexBy: OK
  3054. 577.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3055. 577.23 s [vector] minIndexBy: OK
  3056. 577.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3057. 577.23 s [vector] ListFirstMaxIndexWins: OK
  3058. 577.23 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3059. 577.23 s [vector] FalseListFirstMaxIndexWins: OK
  3060. 577.23 s [vector] +++ OK, failed as expected. (after 1 test):
  3061. 577.23 s [vector] Exception:
  3062. 577.23 s [vector] Prelude.foldr1: empty list
  3063. 577.23 s [vector] CallStack (from HasCallStack):
  3064. 577.23 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  3065. 577.23 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  3066. 577.23 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  3067. 577.23 s [vector] []
  3068. 577.23 s [vector] mempty: OK
  3069. 577.23 s [vector] +++ OK, passed 100 tests.
  3070. 577.23 s [vector] mappend: OK
  3071. 577.23 s [vector] +++ OK, passed 100 tests.
  3072. 577.25 s [vector] mconcat: OK (0.02s)
  3073. 577.25 s [vector] +++ OK, passed 100 tests.
  3074. 577.25 s [vector] glength: OK
  3075. 577.25 s [vector] +++ OK, passed 100 tests.
  3076. 577.25 s [vector] sum: OK
  3077. 577.25 s [vector] +++ OK, passed 100 tests.
  3078. 577.25 s [vector] product: OK
  3079. 577.25 s [vector] +++ OK, passed 100 tests.
  3080. 577.25 s [vector] enumFromN: OK
  3081. 577.25 s [vector] +++ OK, passed 100 tests.
  3082. 577.25 s [vector] enumFromThenN: OK
  3083. 577.25 s [vector] +++ OK, passed 100 tests.
  3084. 577.25 s [vector] enumFromTo: OK
  3085. 577.25 s [vector] +++ OK, passed 100 tests.
  3086. 577.25 s [vector] enumFromThenTo: OK
  3087. 577.26 s [vector] +++ OK, passed 100 tests.
  3088. 577.26 s [vector] unstream
  3089. 577.26 s [vector] unstream == vunstream (exact): OK
  3090. 577.26 s [vector] +++ OK, passed 100 tests.
  3091. 577.26 s [vector] unstream == vunstream (unknown): OK
  3092. 577.26 s [vector] +++ OK, passed 100 tests.
  3093. 577.26 s [vector] unstreamR ~= vunstream (exact): OK
  3094. 577.26 s [vector] +++ OK, passed 100 tests.
  3095. 577.26 s [vector] unstreamR ~= vunstream (unknown): OK
  3096. 577.26 s [vector] +++ OK, passed 100 tests.
  3097. 577.26 s [vector] Tests.Vector.Strict
  3098. 577.26 s [vector] Bool
  3099. 577.27 s [vector] fromList.toList == id: OK
  3100. 577.27 s [vector] +++ OK, passed 100 tests.
  3101. 577.27 s [vector] toList.fromList == id: OK
  3102. 577.27 s [vector] +++ OK, passed 100 tests.
  3103. 577.27 s [vector] unstream.stream == id: OK
  3104. 577.27 s [vector] +++ OK, passed 100 tests.
  3105. 577.27 s [vector] stream.unstream == id: OK
  3106. 577.27 s [vector] +++ OK, passed 100 tests.
  3107. 577.27 s [vector] eq: OK
  3108. 577.27 s [vector] +++ OK, passed 100 tests.
  3109. 577.27 s [vector] length: OK
  3110. 577.27 s [vector] +++ OK, passed 100 tests.
  3111. 577.27 s [vector] null: OK
  3112. 577.27 s [vector] +++ OK, passed 100 tests.
  3113. 577.27 s [vector] index: OK
  3114. 577.27 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3115. 577.27 s [vector] safeIndex: OK
  3116. 577.27 s [vector] +++ OK, passed 100 tests.
  3117. 577.27 s [vector] head: OK
  3118. 577.27 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3119. 577.27 s [vector] last: OK
  3120. 577.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3121. 577.27 s [vector] unsafeIndex: OK
  3122. 577.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3123. 577.27 s [vector] unsafeHead: OK
  3124. 577.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3125. 577.27 s [vector] unsafeLast: OK
  3126. 577.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3127. 577.27 s [vector] slice: OK
  3128. 577.27 s [vector] +++ OK, passed 100 tests.
  3129. 577.27 s [vector] init: OK
  3130. 577.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3131. 577.27 s [vector] tail: OK
  3132. 577.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3133. 577.27 s [vector] take: OK
  3134. 577.27 s [vector] +++ OK, passed 100 tests.
  3135. 577.27 s [vector] drop: OK
  3136. 577.27 s [vector] +++ OK, passed 100 tests.
  3137. 577.27 s [vector] splitAt: OK
  3138. 577.27 s [vector] +++ OK, passed 100 tests.
  3139. 577.27 s [vector] empty: OK
  3140. 577.27 s [vector] +++ OK, passed 100 tests.
  3141. 577.27 s [vector] singleton: OK
  3142. 577.29 s [vector] +++ OK, passed 100 tests.
  3143. 577.29 s [vector] replicate: OK
  3144. 577.29 s [vector] +++ OK, passed 100 tests.
  3145. 577.29 s [vector] generate: OK
  3146. 577.29 s [vector] +++ OK, passed 100 tests.
  3147. 577.29 s [vector] iterateN: OK
  3148. 577.29 s [vector] +++ OK, passed 100 tests.
  3149. 577.31 s [vector] iterateNM: OK (0.02s)
  3150. 577.31 s [vector] +++ OK, passed 100 tests.
  3151. 577.32 s [vector] generateM: OK (0.02s)
  3152. 577.32 s [vector] +++ OK, passed 100 tests.
  3153. 577.32 s [vector] replicateM: OK
  3154. 577.32 s [vector] +++ OK, passed 100 tests.
  3155. 577.32 s [vector] create: OK
  3156. 577.32 s [vector] +++ OK, passed 100 tests.
  3157. 577.32 s [vector] createT: OK
  3158. 577.32 s [vector] +++ OK, passed 100 tests.
  3159. 577.32 s [vector] unfoldr: OK
  3160. 577.32 s [vector] +++ OK, passed 100 tests.
  3161. 577.32 s [vector] unfoldrN: OK
  3162. 577.32 s [vector] +++ OK, passed 100 tests.
  3163. 577.33 s [vector] unfoldrExactN: OK
  3164. 577.33 s [vector] +++ OK, passed 100 tests.
  3165. 577.33 s [vector] unfoldrM: OK
  3166. 577.33 s [vector] +++ OK, passed 100 tests.
  3167. 577.33 s [vector] unfoldrNM: OK
  3168. 577.33 s [vector] +++ OK, passed 100 tests.
  3169. 577.36 s [vector] unfoldrExactNM: OK (0.03s)
  3170. 577.36 s [vector] +++ OK, passed 100 tests.
  3171. 577.36 s [vector] constructN: OK
  3172. 577.36 s [vector] +++ OK, passed 100 tests.
  3173. 577.36 s [vector] constructrN: OK
  3174. 577.36 s [vector] +++ OK, passed 100 tests.
  3175. 577.37 s [vector] cons: OK
  3176. 577.37 s [vector] +++ OK, passed 100 tests.
  3177. 577.37 s [vector] snoc: OK
  3178. 577.37 s [vector] +++ OK, passed 100 tests.
  3179. 577.37 s [vector] append: OK
  3180. 577.37 s [vector] +++ OK, passed 100 tests.
  3181. 577.37 s [vector] concat: OK
  3182. 577.37 s [vector] +++ OK, passed 100 tests.
  3183. 577.37 s [vector] force: OK
  3184. 577.37 s [vector] +++ OK, passed 100 tests.
  3185. 577.38 s [vector] upd: OK
  3186. 577.38 s [vector] +++ OK, passed 100 tests.
  3187. 577.38 s [vector] accum: OK
  3188. 577.38 s [vector] +++ OK, passed 100 tests.
  3189. 577.38 s [vector] reverse: OK
  3190. 577.38 s [vector] +++ OK, passed 100 tests.
  3191. 577.38 s [vector] backpermute: OK
  3192. 577.38 s [vector] +++ OK, passed 100 tests.
  3193. 577.38 s [vector] map: OK
  3194. 577.38 s [vector] +++ OK, passed 100 tests.
  3195. 577.38 s [vector] imap: OK
  3196. 577.38 s [vector] +++ OK, passed 100 tests.
  3197. 577.38 s [vector] concatMap: OK
  3198. 577.39 s [vector] +++ OK, passed 100 tests.
  3199. 577.39 s [vector] mapM: OK
  3200. 577.39 s [vector] +++ OK, passed 100 tests.
  3201. 577.40 s [vector] mapM_: OK (0.01s)
  3202. 577.41 s [vector] +++ OK, passed 100 tests.
  3203. 577.41 s [vector] forM: OK
  3204. 577.41 s [vector] +++ OK, passed 100 tests.
  3205. 577.41 s [vector] forM_: OK
  3206. 577.41 s [vector] +++ OK, passed 100 tests.
  3207. 577.42 s [vector] imapM: OK
  3208. 577.42 s [vector] +++ OK, passed 100 tests.
  3209. 577.42 s [vector] imapM_: OK (0.01s)
  3210. 577.42 s [vector] +++ OK, passed 100 tests.
  3211. 577.43 s [vector] zipWith: OK
  3212. 577.43 s [vector] +++ OK, passed 100 tests.
  3213. 577.43 s [vector] zipWith3: OK
  3214. 577.43 s [vector] +++ OK, passed 100 tests.
  3215. 577.43 s [vector] izipWith: OK
  3216. 577.44 s [vector] +++ OK, passed 100 tests.
  3217. 577.44 s [vector] izipWith3: OK
  3218. 577.45 s [vector] +++ OK, passed 100 tests.
  3219. 577.45 s [vector] izipWithM: OK
  3220. 577.45 s [vector] +++ OK, passed 100 tests.
  3221. 577.45 s [vector] izipWithM_: OK
  3222. 577.45 s [vector] +++ OK, passed 100 tests.
  3223. 577.45 s [vector] zipWithM: OK
  3224. 577.45 s [vector] +++ OK, passed 100 tests.
  3225. 577.45 s [vector] zipWithM_: OK
  3226. 577.46 s [vector] +++ OK, passed 100 tests.
  3227. 577.47 s [vector] filter: OK
  3228. 577.47 s [vector] +++ OK, passed 100 tests.
  3229. 577.47 s [vector] ifilter: OK
  3230. 577.47 s [vector] +++ OK, passed 100 tests.
  3231. 577.48 s [vector] filterM: OK (0.02s)
  3232. 577.48 s [vector] +++ OK, passed 100 tests.
  3233. 577.48 s [vector] uniq: OK
  3234. 577.48 s [vector] +++ OK, passed 100 tests.
  3235. 577.48 s [vector] mapMaybe: OK
  3236. 577.48 s [vector] +++ OK, passed 100 tests.
  3237. 577.48 s [vector] imapMaybe: OK
  3238. 577.48 s [vector] +++ OK, passed 100 tests.
  3239. 577.48 s [vector] takeWhile: OK
  3240. 577.48 s [vector] +++ OK, passed 100 tests.
  3241. 577.49 s [vector] dropWhile: OK
  3242. 577.49 s [vector] +++ OK, passed 100 tests.
  3243. 577.49 s [vector] partition: OK
  3244. 577.49 s [vector] +++ OK, passed 100 tests.
  3245. 577.49 s [vector] partitionWith: OK
  3246. 577.49 s [vector] +++ OK, passed 100 tests.
  3247. 577.49 s [vector] span: OK
  3248. 577.49 s [vector] +++ OK, passed 100 tests.
  3249. 577.49 s [vector] break: OK
  3250. 577.49 s [vector] +++ OK, passed 100 tests.
  3251. 577.49 s [vector] spanR: OK
  3252. 577.49 s [vector] +++ OK, passed 100 tests.
  3253. 577.49 s [vector] breakR: OK
  3254. 577.49 s [vector] +++ OK, passed 100 tests.
  3255. 577.49 s [vector] groupBy: OK
  3256. 577.49 s [vector] +++ OK, passed 100 tests.
  3257. 577.49 s [vector] elem: OK
  3258. 577.49 s [vector] +++ OK, passed 100 tests.
  3259. 577.49 s [vector] notElem: OK
  3260. 577.49 s [vector] +++ OK, passed 100 tests.
  3261. 577.49 s [vector] find: OK
  3262. 577.49 s [vector] +++ OK, passed 100 tests.
  3263. 577.49 s [vector] findIndex: OK
  3264. 577.49 s [vector] +++ OK, passed 100 tests.
  3265. 577.49 s [vector] findIndexR: OK
  3266. 577.49 s [vector] +++ OK, passed 100 tests.
  3267. 577.49 s [vector] findIndices: OK
  3268. 577.49 s [vector] +++ OK, passed 100 tests.
  3269. 577.49 s [vector] elemIndex: OK
  3270. 577.50 s [vector] +++ OK, passed 100 tests.
  3271. 577.50 s [vector] elemIndices: OK
  3272. 577.50 s [vector] +++ OK, passed 100 tests.
  3273. 577.50 s [vector] foldl: OK
  3274. 577.50 s [vector] +++ OK, passed 100 tests.
  3275. 577.50 s [vector] foldl1: OK
  3276. 577.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3277. 577.50 s [vector] foldl': OK
  3278. 577.50 s [vector] +++ OK, passed 100 tests.
  3279. 577.50 s [vector] foldl1': OK
  3280. 577.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3281. 577.50 s [vector] foldr: OK
  3282. 577.50 s [vector] +++ OK, passed 100 tests.
  3283. 577.50 s [vector] foldr1: OK
  3284. 577.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3285. 577.50 s [vector] foldr': OK
  3286. 577.51 s [vector] +++ OK, passed 100 tests.
  3287. 577.51 s [vector] foldr1': OK
  3288. 577.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3289. 577.51 s [vector] ifoldl: OK
  3290. 577.51 s [vector] +++ OK, passed 100 tests.
  3291. 577.51 s [vector] ifoldl': OK
  3292. 577.52 s [vector] +++ OK, passed 100 tests.
  3293. 577.53 s [vector] ifoldr: OK
  3294. 577.53 s [vector] +++ OK, passed 100 tests.
  3295. 577.53 s [vector] ifoldr': OK
  3296. 577.53 s [vector] +++ OK, passed 100 tests.
  3297. 577.53 s [vector] ifoldM: OK
  3298. 577.53 s [vector] +++ OK, passed 100 tests.
  3299. 577.53 s [vector] ifoldM': OK
  3300. 577.53 s [vector] +++ OK, passed 100 tests.
  3301. 577.53 s [vector] ifoldM_: OK (0.01s)
  3302. 577.53 s [vector] +++ OK, passed 100 tests.
  3303. 577.54 s [vector] ifoldM'_: OK (0.01s)
  3304. 577.54 s [vector] +++ OK, passed 100 tests.
  3305. 577.55 s [vector] all: OK
  3306. 577.55 s [vector] +++ OK, passed 100 tests.
  3307. 577.55 s [vector] any: OK
  3308. 577.55 s [vector] +++ OK, passed 100 tests.
  3309. 577.55 s [vector] prescanl: OK
  3310. 577.55 s [vector] +++ OK, passed 100 tests.
  3311. 577.55 s [vector] prescanl': OK
  3312. 577.55 s [vector] +++ OK, passed 100 tests.
  3313. 577.55 s [vector] postscanl: OK
  3314. 577.55 s [vector] +++ OK, passed 100 tests.
  3315. 577.55 s [vector] postscanl': OK
  3316. 577.55 s [vector] +++ OK, passed 100 tests.
  3317. 577.55 s [vector] scanl: OK
  3318. 577.55 s [vector] +++ OK, passed 100 tests.
  3319. 577.55 s [vector] scanl': OK
  3320. 577.55 s [vector] +++ OK, passed 100 tests.
  3321. 577.55 s [vector] scanl1: OK
  3322. 577.56 s [vector] +++ OK, passed 100 tests.
  3323. 577.56 s [vector] scanl1': OK
  3324. 577.56 s [vector] +++ OK, passed 100 tests.
  3325. 577.56 s [vector] iscanl: OK
  3326. 577.56 s [vector] +++ OK, passed 100 tests.
  3327. 577.56 s [vector] iscanl': OK
  3328. 577.56 s [vector] +++ OK, passed 100 tests.
  3329. 577.56 s [vector] prescanr: OK
  3330. 577.56 s [vector] +++ OK, passed 100 tests.
  3331. 577.57 s [vector] prescanr': OK
  3332. 577.57 s [vector] +++ OK, passed 100 tests.
  3333. 577.57 s [vector] postscanr: OK
  3334. 577.57 s [vector] +++ OK, passed 100 tests.
  3335. 577.57 s [vector] postscanr': OK
  3336. 577.57 s [vector] +++ OK, passed 100 tests.
  3337. 577.57 s [vector] scanr: OK
  3338. 577.57 s [vector] +++ OK, passed 100 tests.
  3339. 577.57 s [vector] scanr': OK
  3340. 577.57 s [vector] +++ OK, passed 100 tests.
  3341. 577.57 s [vector] scanr1: OK
  3342. 577.57 s [vector] +++ OK, passed 100 tests.
  3343. 577.58 s [vector] scanr1': OK
  3344. 577.58 s [vector] +++ OK, passed 100 tests.
  3345. 577.58 s [vector] iscanr: OK
  3346. 577.58 s [vector] +++ OK, passed 100 tests.
  3347. 577.58 s [vector] iscanr': OK
  3348. 577.58 s [vector] +++ OK, passed 100 tests.
  3349. 577.58 s [vector] mut_read: OK
  3350. 577.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3351. 577.59 s [vector] mut_write: OK
  3352. 577.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3353. 577.59 s [vector] mut_modify: OK
  3354. 577.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3355. 577.59 s [vector] mut_generate: OK
  3356. 577.61 s [vector] +++ OK, passed 100 tests.
  3357. 577.61 s [vector] mut_generateM: OK
  3358. 577.61 s [vector] +++ OK, passed 100 tests.
  3359. 577.61 s [vector] mut_mapM_: OK (0.01s)
  3360. 577.61 s [vector] +++ OK, passed 100 tests.
  3361. 577.61 s [vector] mut_imapM_: OK (0.01s)
  3362. 577.61 s [vector] +++ OK, passed 100 tests.
  3363. 577.62 s [vector] mut_forM_: OK (0.01s)
  3364. 577.62 s [vector] +++ OK, passed 100 tests.
  3365. 577.63 s [vector] mut_iforM_: OK
  3366. 577.63 s [vector] +++ OK, passed 100 tests.
  3367. 577.63 s [vector] mut_foldr: OK
  3368. 577.63 s [vector] +++ OK, passed 100 tests.
  3369. 577.63 s [vector] mut_foldr': OK
  3370. 577.63 s [vector] +++ OK, passed 100 tests.
  3371. 577.63 s [vector] mut_foldl: OK
  3372. 577.63 s [vector] +++ OK, passed 100 tests.
  3373. 577.63 s [vector] mut_foldl': OK
  3374. 577.63 s [vector] +++ OK, passed 100 tests.
  3375. 577.64 s [vector] mut_ifoldr: OK
  3376. 577.64 s [vector] +++ OK, passed 100 tests.
  3377. 577.64 s [vector] mut_ifoldr': OK
  3378. 577.64 s [vector] +++ OK, passed 100 tests.
  3379. 577.64 s [vector] mut_ifoldl: OK
  3380. 577.64 s [vector] +++ OK, passed 100 tests.
  3381. 577.64 s [vector] mut_ifoldl': OK
  3382. 577.64 s [vector] +++ OK, passed 100 tests.
  3383. 577.65 s [vector] mut_foldM: OK
  3384. 577.65 s [vector] +++ OK, passed 100 tests.
  3385. 577.65 s [vector] mut_foldM': OK
  3386. 577.65 s [vector] +++ OK, passed 100 tests.
  3387. 577.65 s [vector] mut_foldrM: OK
  3388. 577.65 s [vector] +++ OK, passed 100 tests.
  3389. 577.65 s [vector] mut_foldrM': OK
  3390. 577.65 s [vector] +++ OK, passed 100 tests.
  3391. 577.65 s [vector] mut_ifoldM: OK
  3392. 577.65 s [vector] +++ OK, passed 100 tests.
  3393. 577.66 s [vector] mut_ifoldM': OK
  3394. 577.66 s [vector] +++ OK, passed 100 tests.
  3395. 577.66 s [vector] mut_ifoldrM: OK
  3396. 577.66 s [vector] +++ OK, passed 100 tests.
  3397. 577.66 s [vector] mut_ifoldrM': OK
  3398. 577.66 s [vector] +++ OK, passed 100 tests.
  3399. 577.66 s [vector] compare: OK
  3400. 577.66 s [vector] +++ OK, passed 100 tests.
  3401. 577.66 s [vector] maximum: OK
  3402. 577.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3403. 577.66 s [vector] minimum: OK
  3404. 577.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3405. 577.66 s [vector] minIndex: OK
  3406. 577.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3407. 577.66 s [vector] maxIndex: OK
  3408. 577.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3409. 577.67 s [vector] maximumBy: OK
  3410. 577.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3411. 577.67 s [vector] minimumBy: OK
  3412. 577.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3413. 577.67 s [vector] maximumOn: OK
  3414. 577.68 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3415. 577.68 s [vector] minimumOn: OK
  3416. 577.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3417. 577.69 s [vector] maxIndexBy: OK
  3418. 577.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3419. 577.69 s [vector] minIndexBy: OK
  3420. 577.69 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3421. 577.69 s [vector] ListFirstMaxIndexWins: OK
  3422. 577.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3423. 577.69 s [vector] FalseListFirstMaxIndexWins: OK
  3424. 577.69 s [vector] +++ OK, failed as expected. (after 1 test):
  3425. 577.69 s [vector] Exception:
  3426. 577.69 s [vector] Prelude.foldr1: empty list
  3427. 577.69 s [vector] CallStack (from HasCallStack):
  3428. 577.69 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  3429. 577.69 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  3430. 577.69 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  3431. 577.69 s [vector] []
  3432. 577.69 s [vector] zip: OK
  3433. 577.69 s [vector] +++ OK, passed 100 tests.
  3434. 577.69 s [vector] zip3: OK
  3435. 577.69 s [vector] +++ OK, passed 100 tests.
  3436. 577.69 s [vector] unzip: OK
  3437. 577.69 s [vector] +++ OK, passed 100 tests.
  3438. 577.69 s [vector] unzip3: OK
  3439. 577.69 s [vector] +++ OK, passed 100 tests.
  3440. 577.69 s [vector] indexed: OK
  3441. 577.69 s [vector] +++ OK, passed 100 tests.
  3442. 577.70 s [vector] update: OK
  3443. 577.70 s [vector] +++ OK, passed 100 tests.
  3444. 577.70 s [vector] concat: OK
  3445. 577.70 s [vector] +++ OK, passed 100 tests.
  3446. 577.70 s [vector] mempty: OK
  3447. 577.70 s [vector] +++ OK, passed 100 tests.
  3448. 577.70 s [vector] mappend: OK
  3449. 577.70 s [vector] +++ OK, passed 100 tests.
  3450. 577.70 s [vector] mconcat: OK
  3451. 577.70 s [vector] +++ OK, passed 100 tests.
  3452. 577.70 s [vector] fmap: OK
  3453. 577.71 s [vector] +++ OK, passed 100 tests.
  3454. 577.71 s [vector] return: OK
  3455. 577.71 s [vector] +++ OK, passed 100 tests.
  3456. 577.71 s [vector] bind: OK (0.01s)
  3457. 577.71 s [vector] +++ OK, passed 100 tests.
  3458. 577.72 s [vector] mzip: OK
  3459. 577.72 s [vector] +++ OK, passed 100 tests.
  3460. 577.72 s [vector] munzip: OK
  3461. 577.72 s [vector] +++ OK, passed 100 tests.
  3462. 577.72 s [vector] applicative_pure: OK
  3463. 577.72 s [vector] +++ OK, passed 100 tests.
  3464. 577.72 s [vector] applicative_appl: OK (0.02s)
  3465. 577.72 s [vector] +++ OK, passed 100 tests.
  3466. 577.73 s [vector] alternative_empty: OK
  3467. 577.73 s [vector] +++ OK, passed 100 tests.
  3468. 578.17 s [vector] alternative_or: OK
  3469. 578.17 s [vector] +++ OK, passed 100 tests.
  3470. 578.17 s [vector] sequence: OK (0.02s)
  3471. 578.17 s [vector] +++ OK, passed 100 tests.
  3472. 578.17 s [vector] sequence_: OK
  3473. 578.17 s [vector] +++ OK, passed 100 tests.
  3474. 578.17 s [vector] glength: OK
  3475. 578.17 s [vector] +++ OK, passed 100 tests.
  3476. 578.17 s [vector] and: OK
  3477. 578.17 s [vector] +++ OK, passed 100 tests.
  3478. 578.17 s [vector] or: OK
  3479. 578.17 s [vector] +++ OK, passed 100 tests.
  3480. 578.17 s [vector] Int
  3481. 578.17 s [vector] fromList.toList == id: OK
  3482. 578.17 s [vector] +++ OK, passed 100 tests.
  3483. 578.17 s [vector] toList.fromList == id: OK
  3484. 578.17 s [vector] +++ OK, passed 100 tests.
  3485. 578.17 s [vector] unstream.stream == id: OK
  3486. 578.17 s [vector] +++ OK, passed 100 tests.
  3487. 578.17 s [vector] stream.unstream == id: OK
  3488. 578.17 s [vector] +++ OK, passed 100 tests.
  3489. 578.17 s [vector] eq: OK
  3490. 578.17 s [vector] +++ OK, passed 100 tests.
  3491. 578.17 s [vector] length: OK
  3492. 578.17 s [vector] +++ OK, passed 100 tests.
  3493. 578.17 s [vector] null: OK
  3494. 578.17 s [vector] +++ OK, passed 100 tests.
  3495. 578.17 s [vector] index: OK
  3496. 578.17 s [vector] +++ OK, passed 100 tests; 27 discarded.
  3497. 578.17 s [vector] safeIndex: OK
  3498. 578.17 s [vector] +++ OK, passed 100 tests.
  3499. 578.17 s [vector] head: OK
  3500. 578.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3501. 578.17 s [vector] last: OK
  3502. 578.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3503. 578.17 s [vector] unsafeIndex: OK
  3504. 578.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3505. 578.17 s [vector] unsafeHead: OK
  3506. 578.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3507. 578.17 s [vector] unsafeLast: OK
  3508. 578.17 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3509. 578.17 s [vector] slice: OK
  3510. 578.17 s [vector] +++ OK, passed 100 tests.
  3511. 578.17 s [vector] init: OK
  3512. 578.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3513. 578.17 s [vector] tail: OK
  3514. 578.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3515. 578.17 s [vector] take: OK
  3516. 578.17 s [vector] +++ OK, passed 100 tests.
  3517. 578.17 s [vector] drop: OK
  3518. 578.17 s [vector] +++ OK, passed 100 tests.
  3519. 578.17 s [vector] splitAt: OK
  3520. 578.17 s [vector] +++ OK, passed 100 tests.
  3521. 578.17 s [vector] empty: OK
  3522. 578.17 s [vector] +++ OK, passed 100 tests.
  3523. 578.17 s [vector] singleton: OK
  3524. 578.17 s [vector] +++ OK, passed 100 tests.
  3525. 578.17 s [vector] replicate: OK
  3526. 578.17 s [vector] +++ OK, passed 100 tests.
  3527. 578.17 s [vector] generate: OK
  3528. 578.17 s [vector] +++ OK, passed 100 tests.
  3529. 578.17 s [vector] iterateN: OK
  3530. 578.17 s [vector] +++ OK, passed 100 tests.
  3531. 578.17 s [vector] iterateNM: OK (0.04s)
  3532. 578.17 s [vector] +++ OK, passed 100 tests.
  3533. 578.17 s [vector] generateM: OK (0.01s)
  3534. 578.17 s [vector] +++ OK, passed 100 tests.
  3535. 578.17 s [vector] replicateM: OK
  3536. 578.17 s [vector] +++ OK, passed 100 tests.
  3537. 578.17 s [vector] create: OK
  3538. 578.17 s [vector] +++ OK, passed 100 tests.
  3539. 578.17 s [vector] createT: OK
  3540. 578.17 s [vector] +++ OK, passed 100 tests.
  3541. 578.17 s [vector] unfoldr: OK
  3542. 578.17 s [vector] +++ OK, passed 100 tests.
  3543. 578.17 s [vector] unfoldrN: OK
  3544. 578.17 s [vector] +++ OK, passed 100 tests.
  3545. 578.17 s [vector] unfoldrExactN: OK
  3546. 578.17 s [vector] +++ OK, passed 100 tests.
  3547. 578.17 s [vector] unfoldrM: OK
  3548. 578.17 s [vector] +++ OK, passed 100 tests.
  3549. 578.17 s [vector] unfoldrNM: OK
  3550. 578.17 s [vector] +++ OK, passed 100 tests.
  3551. 578.17 s [vector] unfoldrExactNM: OK (0.02s)
  3552. 578.17 s [vector] +++ OK, passed 100 tests.
  3553. 578.17 s [vector] constructN: OK
  3554. 578.17 s [vector] +++ OK, passed 100 tests.
  3555. 578.17 s [vector] constructrN: OK
  3556. 578.17 s [vector] +++ OK, passed 100 tests.
  3557. 578.17 s [vector] cons: OK
  3558. 578.17 s [vector] +++ OK, passed 100 tests.
  3559. 578.17 s [vector] snoc: OK
  3560. 578.17 s [vector] +++ OK, passed 100 tests.
  3561. 578.17 s [vector] append: OK
  3562. 578.17 s [vector] +++ OK, passed 100 tests.
  3563. 578.17 s [vector] concat: OK
  3564. 578.17 s [vector] +++ OK, passed 100 tests.
  3565. 578.17 s [vector] force: OK
  3566. 578.17 s [vector] +++ OK, passed 100 tests.
  3567. 578.17 s [vector] upd: OK
  3568. 578.17 s [vector] +++ OK, passed 100 tests.
  3569. 578.17 s [vector] accum: OK
  3570. 578.17 s [vector] +++ OK, passed 100 tests.
  3571. 578.17 s [vector] reverse: OK
  3572. 578.17 s [vector] +++ OK, passed 100 tests.
  3573. 578.17 s [vector] backpermute: OK
  3574. 578.17 s [vector] +++ OK, passed 100 tests.
  3575. 578.17 s [vector] map: OK
  3576. 578.17 s [vector] +++ OK, passed 100 tests.
  3577. 578.17 s [vector] imap: OK
  3578. 578.17 s [vector] +++ OK, passed 100 tests.
  3579. 578.17 s [vector] concatMap: OK
  3580. 578.17 s [vector] +++ OK, passed 100 tests.
  3581. 578.17 s [vector] mapM: OK
  3582. 578.17 s [vector] +++ OK, passed 100 tests.
  3583. 578.17 s [vector] mapM_: OK (0.02s)
  3584. 578.17 s [vector] +++ OK, passed 100 tests.
  3585. 578.17 s [vector] forM: OK
  3586. 578.17 s [vector] +++ OK, passed 100 tests.
  3587. 578.17 s [vector] forM_: OK
  3588. 578.17 s [vector] +++ OK, passed 100 tests.
  3589. 578.17 s [vector] imapM: OK
  3590. 578.18 s [vector] +++ OK, passed 100 tests.
  3591. 578.18 s [vector] imapM_: OK (0.02s)
  3592. 578.18 s [vector] +++ OK, passed 100 tests.
  3593. 578.18 s [vector] zipWith: OK
  3594. 578.18 s [vector] +++ OK, passed 100 tests.
  3595. 578.18 s [vector] zipWith3: OK
  3596. 578.18 s [vector] +++ OK, passed 100 tests.
  3597. 578.18 s [vector] izipWith: OK
  3598. 578.18 s [vector] +++ OK, passed 100 tests.
  3599. 578.18 s [vector] izipWith3: OK
  3600. 578.18 s [vector] +++ OK, passed 100 tests.
  3601. 578.18 s [vector] izipWithM: OK
  3602. 578.18 s [vector] +++ OK, passed 100 tests.
  3603. 578.18 s [vector] izipWithM_: OK (0.01s)
  3604. 578.18 s [vector] +++ OK, passed 100 tests.
  3605. 578.18 s [vector] zipWithM: OK
  3606. 578.18 s [vector] +++ OK, passed 100 tests.
  3607. 578.18 s [vector] zipWithM_: OK (0.01s)
  3608. 578.18 s [vector] +++ OK, passed 100 tests.
  3609. 578.18 s [vector] filter: OK
  3610. 578.18 s [vector] +++ OK, passed 100 tests.
  3611. 578.18 s [vector] ifilter: OK
  3612. 578.18 s [vector] +++ OK, passed 100 tests.
  3613. 578.18 s [vector] filterM: OK (0.01s)
  3614. 578.18 s [vector] +++ OK, passed 100 tests.
  3615. 578.18 s [vector] uniq: OK
  3616. 578.18 s [vector] +++ OK, passed 100 tests.
  3617. 578.18 s [vector] mapMaybe: OK
  3618. 578.18 s [vector] +++ OK, passed 100 tests.
  3619. 578.18 s [vector] imapMaybe: OK
  3620. 578.18 s [vector] +++ OK, passed 100 tests.
  3621. 578.18 s [vector] takeWhile: OK
  3622. 578.18 s [vector] +++ OK, passed 100 tests.
  3623. 578.18 s [vector] dropWhile: OK
  3624. 578.18 s [vector] +++ OK, passed 100 tests.
  3625. 578.18 s [vector] partition: OK
  3626. 578.18 s [vector] +++ OK, passed 100 tests.
  3627. 578.18 s [vector] partitionWith: OK
  3628. 578.18 s [vector] +++ OK, passed 100 tests.
  3629. 578.18 s [vector] span: OK
  3630. 578.18 s [vector] +++ OK, passed 100 tests.
  3631. 578.18 s [vector] break: OK
  3632. 578.18 s [vector] +++ OK, passed 100 tests.
  3633. 578.18 s [vector] spanR: OK
  3634. 578.18 s [vector] +++ OK, passed 100 tests.
  3635. 578.18 s [vector] breakR: OK
  3636. 578.18 s [vector] +++ OK, passed 100 tests.
  3637. 578.18 s [vector] groupBy: OK
  3638. 578.18 s [vector] +++ OK, passed 100 tests.
  3639. 578.18 s [vector] elem: OK
  3640. 578.18 s [vector] +++ OK, passed 100 tests.
  3641. 578.18 s [vector] notElem: OK
  3642. 578.18 s [vector] +++ OK, passed 100 tests.
  3643. 578.18 s [vector] find: OK
  3644. 578.18 s [vector] +++ OK, passed 100 tests.
  3645. 578.18 s [vector] findIndex: OK
  3646. 578.18 s [vector] +++ OK, passed 100 tests.
  3647. 578.18 s [vector] findIndexR: OK
  3648. 578.18 s [vector] +++ OK, passed 100 tests.
  3649. 578.18 s [vector] findIndices: OK
  3650. 578.18 s [vector] +++ OK, passed 100 tests.
  3651. 578.18 s [vector] elemIndex: OK
  3652. 578.18 s [vector] +++ OK, passed 100 tests.
  3653. 578.18 s [vector] elemIndices: OK
  3654. 578.18 s [vector] +++ OK, passed 100 tests.
  3655. 578.18 s [vector] foldl: OK
  3656. 578.18 s [vector] +++ OK, passed 100 tests.
  3657. 578.18 s [vector] foldl1: OK
  3658. 578.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3659. 578.18 s [vector] foldl': OK
  3660. 578.18 s [vector] +++ OK, passed 100 tests.
  3661. 578.18 s [vector] foldl1': OK
  3662. 578.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3663. 578.18 s [vector] foldr: OK
  3664. 578.18 s [vector] +++ OK, passed 100 tests.
  3665. 578.18 s [vector] foldr1: OK
  3666. 578.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3667. 578.18 s [vector] foldr': OK
  3668. 578.18 s [vector] +++ OK, passed 100 tests.
  3669. 578.18 s [vector] foldr1': OK
  3670. 578.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3671. 578.18 s [vector] ifoldl: OK
  3672. 578.18 s [vector] +++ OK, passed 100 tests.
  3673. 578.18 s [vector] ifoldl': OK
  3674. 578.18 s [vector] +++ OK, passed 100 tests.
  3675. 578.18 s [vector] ifoldr: OK
  3676. 578.18 s [vector] +++ OK, passed 100 tests.
  3677. 578.18 s [vector] ifoldr': OK
  3678. 578.18 s [vector] +++ OK, passed 100 tests.
  3679. 578.18 s [vector] ifoldM: OK
  3680. 578.18 s [vector] +++ OK, passed 100 tests.
  3681. 578.18 s [vector] ifoldM': OK
  3682. 578.18 s [vector] +++ OK, passed 100 tests.
  3683. 578.18 s [vector] ifoldM_: OK (0.02s)
  3684. 578.18 s [vector] +++ OK, passed 100 tests.
  3685. 578.18 s [vector] ifoldM'_: OK (0.01s)
  3686. 578.18 s [vector] +++ OK, passed 100 tests.
  3687. 578.18 s [vector] all: OK
  3688. 578.18 s [vector] +++ OK, passed 100 tests.
  3689. 578.18 s [vector] any: OK
  3690. 578.18 s [vector] +++ OK, passed 100 tests.
  3691. 578.18 s [vector] prescanl: OK
  3692. 578.18 s [vector] +++ OK, passed 100 tests.
  3693. 578.18 s [vector] prescanl': OK
  3694. 578.18 s [vector] +++ OK, passed 100 tests.
  3695. 578.18 s [vector] postscanl: OK
  3696. 578.18 s [vector] +++ OK, passed 100 tests.
  3697. 578.18 s [vector] postscanl': OK
  3698. 578.18 s [vector] +++ OK, passed 100 tests.
  3699. 578.18 s [vector] scanl: OK
  3700. 578.18 s [vector] +++ OK, passed 100 tests.
  3701. 578.18 s [vector] scanl': OK
  3702. 578.18 s [vector] +++ OK, passed 100 tests.
  3703. 578.18 s [vector] scanl1: OK
  3704. 578.18 s [vector] +++ OK, passed 100 tests.
  3705. 578.18 s [vector] scanl1': OK
  3706. 578.18 s [vector] +++ OK, passed 100 tests.
  3707. 578.18 s [vector] iscanl: OK
  3708. 578.18 s [vector] +++ OK, passed 100 tests.
  3709. 578.18 s [vector] iscanl': OK
  3710. 578.18 s [vector] +++ OK, passed 100 tests.
  3711. 578.18 s [vector] prescanr: OK
  3712. 578.18 s [vector] +++ OK, passed 100 tests.
  3713. 578.18 s [vector] prescanr': OK
  3714. 578.18 s [vector] +++ OK, passed 100 tests.
  3715. 578.18 s [vector] postscanr: OK
  3716. 578.18 s [vector] +++ OK, passed 100 tests.
  3717. 578.18 s [vector] postscanr': OK
  3718. 578.18 s [vector] +++ OK, passed 100 tests.
  3719. 578.18 s [vector] scanr: OK
  3720. 578.18 s [vector] +++ OK, passed 100 tests.
  3721. 578.18 s [vector] scanr': OK
  3722. 578.18 s [vector] +++ OK, passed 100 tests.
  3723. 578.18 s [vector] scanr1: OK
  3724. 578.18 s [vector] +++ OK, passed 100 tests.
  3725. 578.18 s [vector] scanr1': OK
  3726. 578.18 s [vector] +++ OK, passed 100 tests.
  3727. 578.18 s [vector] iscanr: OK
  3728. 578.18 s [vector] +++ OK, passed 100 tests.
  3729. 578.18 s [vector] iscanr': OK
  3730. 578.18 s [vector] +++ OK, passed 100 tests.
  3731. 578.18 s [vector] mut_read: OK
  3732. 578.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3733. 578.18 s [vector] mut_write: OK
  3734. 578.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3735. 578.18 s [vector] mut_modify: OK
  3736. 578.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3737. 578.18 s [vector] mut_generate: OK
  3738. 578.18 s [vector] +++ OK, passed 100 tests.
  3739. 578.19 s [vector] mut_generateM: OK (0.01s)
  3740. 578.19 s [vector] +++ OK, passed 100 tests.
  3741. 578.21 s [vector] mut_mapM_: OK (0.02s)
  3742. 578.21 s [vector] +++ OK, passed 100 tests.
  3743. 578.21 s [vector] mut_imapM_: OK (0.02s)
  3744. 578.21 s [vector] +++ OK, passed 100 tests.
  3745. 578.23 s [vector] mut_forM_: OK (0.01s)
  3746. 578.23 s [vector] +++ OK, passed 100 tests.
  3747. 578.24 s [vector] mut_iforM_: OK (0.02s)
  3748. 578.24 s [vector] +++ OK, passed 100 tests.
  3749. 578.24 s [vector] mut_foldr: OK
  3750. 578.24 s [vector] +++ OK, passed 100 tests.
  3751. 578.24 s [vector] mut_foldr': OK
  3752. 578.24 s [vector] +++ OK, passed 100 tests.
  3753. 578.24 s [vector] mut_foldl: OK
  3754. 578.24 s [vector] +++ OK, passed 100 tests.
  3755. 578.25 s [vector] mut_foldl': OK
  3756. 578.25 s [vector] +++ OK, passed 100 tests.
  3757. 578.25 s [vector] mut_ifoldr: OK
  3758. 578.25 s [vector] +++ OK, passed 100 tests.
  3759. 578.26 s [vector] mut_ifoldr': OK
  3760. 578.26 s [vector] +++ OK, passed 100 tests.
  3761. 578.26 s [vector] mut_ifoldl: OK
  3762. 578.27 s [vector] +++ OK, passed 100 tests.
  3763. 578.27 s [vector] mut_ifoldl': OK
  3764. 578.27 s [vector] +++ OK, passed 100 tests.
  3765. 578.27 s [vector] mut_foldM: OK
  3766. 578.27 s [vector] +++ OK, passed 100 tests.
  3767. 578.27 s [vector] mut_foldM': OK
  3768. 578.27 s [vector] +++ OK, passed 100 tests.
  3769. 578.27 s [vector] mut_foldrM: OK
  3770. 578.27 s [vector] +++ OK, passed 100 tests.
  3771. 578.27 s [vector] mut_foldrM': OK
  3772. 578.27 s [vector] +++ OK, passed 100 tests.
  3773. 578.28 s [vector] mut_ifoldM: OK
  3774. 578.28 s [vector] +++ OK, passed 100 tests.
  3775. 578.28 s [vector] mut_ifoldM': OK
  3776. 578.28 s [vector] +++ OK, passed 100 tests.
  3777. 578.28 s [vector] mut_ifoldrM: OK
  3778. 578.28 s [vector] +++ OK, passed 100 tests.
  3779. 578.28 s [vector] mut_ifoldrM': OK
  3780. 578.28 s [vector] +++ OK, passed 100 tests.
  3781. 578.28 s [vector] compare: OK
  3782. 578.28 s [vector] +++ OK, passed 100 tests.
  3783. 578.28 s [vector] maximum: OK
  3784. 578.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3785. 578.28 s [vector] minimum: OK
  3786. 578.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3787. 578.28 s [vector] minIndex: OK
  3788. 578.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3789. 578.29 s [vector] maxIndex: OK
  3790. 578.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3791. 578.29 s [vector] maximumBy: OK
  3792. 578.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3793. 578.29 s [vector] minimumBy: OK
  3794. 578.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3795. 578.29 s [vector] maximumOn: OK
  3796. 578.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3797. 578.29 s [vector] minimumOn: OK
  3798. 578.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3799. 578.29 s [vector] maxIndexBy: OK
  3800. 578.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3801. 578.29 s [vector] minIndexBy: OK
  3802. 578.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3803. 578.29 s [vector] ListFirstMaxIndexWins: OK
  3804. 578.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3805. 578.29 s [vector] FalseListFirstMaxIndexWins: OK
  3806. 578.29 s [vector] +++ OK, failed as expected. (after 1 test):
  3807. 578.29 s [vector] Exception:
  3808. 578.29 s [vector] Prelude.foldr1: empty list
  3809. 578.29 s [vector] CallStack (from HasCallStack):
  3810. 578.29 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  3811. 578.29 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  3812. 578.29 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  3813. 578.29 s [vector] []
  3814. 578.29 s [vector] zip: OK
  3815. 578.29 s [vector] +++ OK, passed 100 tests.
  3816. 578.29 s [vector] zip3: OK
  3817. 578.29 s [vector] +++ OK, passed 100 tests.
  3818. 578.29 s [vector] unzip: OK
  3819. 578.29 s [vector] +++ OK, passed 100 tests.
  3820. 578.29 s [vector] unzip3: OK
  3821. 578.30 s [vector] +++ OK, passed 100 tests.
  3822. 578.30 s [vector] indexed: OK
  3823. 578.30 s [vector] +++ OK, passed 100 tests.
  3824. 578.31 s [vector] update: OK
  3825. 578.31 s [vector] +++ OK, passed 100 tests.
  3826. 578.31 s [vector] concat: OK
  3827. 578.31 s [vector] +++ OK, passed 100 tests.
  3828. 578.31 s [vector] mempty: OK
  3829. 578.31 s [vector] +++ OK, passed 100 tests.
  3830. 578.31 s [vector] mappend: OK
  3831. 578.31 s [vector] +++ OK, passed 100 tests.
  3832. 578.31 s [vector] mconcat: OK
  3833. 578.31 s [vector] +++ OK, passed 100 tests.
  3834. 578.32 s [vector] fmap: OK
  3835. 578.32 s [vector] +++ OK, passed 100 tests.
  3836. 578.33 s [vector] return: OK
  3837. 578.33 s [vector] +++ OK, passed 100 tests.
  3838. 578.33 s [vector] bind: OK (0.02s)
  3839. 578.33 s [vector] +++ OK, passed 100 tests.
  3840. 578.33 s [vector] mzip: OK
  3841. 578.33 s [vector] +++ OK, passed 100 tests.
  3842. 578.33 s [vector] munzip: OK
  3843. 578.35 s [vector] +++ OK, passed 100 tests.
  3844. 578.35 s [vector] applicative_pure: OK
  3845. 578.35 s [vector] +++ OK, passed 100 tests.
  3846. 578.37 s [vector] applicative_appl: OK (0.04s)
  3847. 578.37 s [vector] +++ OK, passed 100 tests.
  3848. 578.37 s [vector] alternative_empty: OK
  3849. 578.37 s [vector] +++ OK, passed 100 tests.
  3850. 578.37 s [vector] alternative_or: OK
  3851. 578.37 s [vector] +++ OK, passed 100 tests.
  3852. 578.41 s [vector] sequence: OK (0.01s)
  3853. 578.41 s [vector] +++ OK, passed 100 tests.
  3854. 578.41 s [vector] sequence_: OK
  3855. 578.41 s [vector] +++ OK, passed 100 tests.
  3856. 578.41 s [vector] glength: OK
  3857. 578.41 s [vector] +++ OK, passed 100 tests.
  3858. 578.41 s [vector] sum: OK
  3859. 578.41 s [vector] +++ OK, passed 100 tests.
  3860. 578.41 s [vector] product: OK
  3861. 578.41 s [vector] +++ OK, passed 100 tests.
  3862. 578.41 s [vector] enumFromN: OK
  3863. 578.41 s [vector] +++ OK, passed 100 tests.
  3864. 578.42 s [vector] enumFromThenN: OK
  3865. 578.42 s [vector] +++ OK, passed 100 tests.
  3866. 578.42 s [vector] enumFromTo: OK
  3867. 578.42 s [vector] +++ OK, passed 100 tests.
  3868. 578.42 s [vector] enumFromThenTo: OK
  3869. 578.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3870. 578.42 s [vector] unstream
  3871. 578.42 s [vector] unstream == vunstream (exact): OK
  3872. 578.42 s [vector] +++ OK, passed 100 tests.
  3873. 578.42 s [vector] unstream == vunstream (unknown): OK
  3874. 578.42 s [vector] +++ OK, passed 100 tests.
  3875. 578.42 s [vector] unstreamR ~= vunstream (exact): OK
  3876. 578.42 s [vector] +++ OK, passed 100 tests.
  3877. 578.42 s [vector] unstreamR ~= vunstream (unknown): OK
  3878. 578.42 s [vector] +++ OK, passed 100 tests.
  3879. 578.42 s [vector] Tests.Vector.Unboxed
  3880. 578.42 s [vector] ()
  3881. 578.42 s [vector] fromList.toList == id: OK
  3882. 578.42 s [vector] +++ OK, passed 100 tests.
  3883. 578.42 s [vector] toList.fromList == id: OK
  3884. 578.42 s [vector] +++ OK, passed 100 tests.
  3885. 578.42 s [vector] unstream.stream == id: OK
  3886. 578.42 s [vector] +++ OK, passed 100 tests.
  3887. 578.42 s [vector] stream.unstream == id: OK
  3888. 578.42 s [vector] +++ OK, passed 100 tests.
  3889. 578.42 s [vector] eq: OK
  3890. 578.42 s [vector] +++ OK, passed 100 tests.
  3891. 578.42 s [vector] length: OK
  3892. 578.42 s [vector] +++ OK, passed 100 tests.
  3893. 578.42 s [vector] null: OK
  3894. 578.42 s [vector] +++ OK, passed 100 tests.
  3895. 578.42 s [vector] index: OK
  3896. 578.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3897. 578.42 s [vector] safeIndex: OK
  3898. 578.42 s [vector] +++ OK, passed 100 tests.
  3899. 578.42 s [vector] head: OK
  3900. 578.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3901. 578.43 s [vector] last: OK
  3902. 578.43 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3903. 578.43 s [vector] unsafeIndex: OK
  3904. 578.43 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3905. 578.43 s [vector] unsafeHead: OK
  3906. 578.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3907. 578.43 s [vector] unsafeLast: OK
  3908. 578.43 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3909. 578.43 s [vector] slice: OK
  3910. 578.43 s [vector] +++ OK, passed 100 tests.
  3911. 578.43 s [vector] init: OK
  3912. 578.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3913. 578.43 s [vector] tail: OK
  3914. 578.43 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3915. 578.43 s [vector] take: OK
  3916. 578.43 s [vector] +++ OK, passed 100 tests.
  3917. 578.43 s [vector] drop: OK
  3918. 578.43 s [vector] +++ OK, passed 100 tests.
  3919. 578.43 s [vector] splitAt: OK
  3920. 578.43 s [vector] +++ OK, passed 100 tests.
  3921. 578.43 s [vector] empty: OK
  3922. 578.43 s [vector] +++ OK, passed 100 tests.
  3923. 578.43 s [vector] singleton: OK
  3924. 578.43 s [vector] +++ OK, passed 100 tests.
  3925. 578.43 s [vector] replicate: OK
  3926. 578.43 s [vector] +++ OK, passed 100 tests.
  3927. 578.45 s [vector] generate: OK
  3928. 578.45 s [vector] +++ OK, passed 100 tests.
  3929. 578.45 s [vector] iterateN: OK
  3930. 578.45 s [vector] +++ OK, passed 100 tests.
  3931. 578.46 s [vector] iterateNM: OK (0.03s)
  3932. 578.46 s [vector] +++ OK, passed 100 tests.
  3933. 578.48 s [vector] generateM: OK
  3934. 578.48 s [vector] +++ OK, passed 100 tests.
  3935. 578.48 s [vector] replicateM: OK
  3936. 578.48 s [vector] +++ OK, passed 100 tests.
  3937. 578.48 s [vector] create: OK
  3938. 578.48 s [vector] +++ OK, passed 100 tests.
  3939. 578.48 s [vector] createT: OK
  3940. 578.48 s [vector] +++ OK, passed 100 tests.
  3941. 578.48 s [vector] unfoldr: OK
  3942. 578.48 s [vector] +++ OK, passed 100 tests.
  3943. 578.49 s [vector] unfoldrN: OK
  3944. 578.49 s [vector] +++ OK, passed 100 tests.
  3945. 578.49 s [vector] unfoldrExactN: OK
  3946. 578.49 s [vector] +++ OK, passed 100 tests.
  3947. 578.49 s [vector] unfoldrM: OK
  3948. 578.49 s [vector] +++ OK, passed 100 tests.
  3949. 578.49 s [vector] unfoldrNM: OK
  3950. 578.49 s [vector] +++ OK, passed 100 tests.
  3951. 578.53 s [vector] unfoldrExactNM: OK (0.02s)
  3952. 578.53 s [vector] +++ OK, passed 100 tests.
  3953. 578.53 s [vector] constructN: OK
  3954. 578.53 s [vector] +++ OK, passed 100 tests.
  3955. 578.53 s [vector] constructrN: OK
  3956. 578.53 s [vector] +++ OK, passed 100 tests.
  3957. 578.53 s [vector] cons: OK
  3958. 578.53 s [vector] +++ OK, passed 100 tests.
  3959. 578.53 s [vector] snoc: OK
  3960. 578.53 s [vector] +++ OK, passed 100 tests.
  3961. 578.53 s [vector] append: OK
  3962. 578.53 s [vector] +++ OK, passed 100 tests.
  3963. 578.54 s [vector] concat: OK
  3964. 578.54 s [vector] +++ OK, passed 100 tests.
  3965. 578.54 s [vector] force: OK
  3966. 578.54 s [vector] +++ OK, passed 100 tests.
  3967. 578.54 s [vector] upd: OK
  3968. 578.54 s [vector] +++ OK, passed 100 tests.
  3969. 578.55 s [vector] accum: OK
  3970. 578.55 s [vector] +++ OK, passed 100 tests.
  3971. 578.55 s [vector] reverse: OK
  3972. 578.55 s [vector] +++ OK, passed 100 tests.
  3973. 578.55 s [vector] backpermute: OK
  3974. 578.55 s [vector] +++ OK, passed 100 tests.
  3975. 578.55 s [vector] map: OK
  3976. 578.56 s [vector] +++ OK, passed 100 tests.
  3977. 578.57 s [vector] imap: OK
  3978. 578.57 s [vector] +++ OK, passed 100 tests.
  3979. 578.57 s [vector] concatMap: OK
  3980. 578.57 s [vector] +++ OK, passed 100 tests.
  3981. 578.57 s [vector] mapM: OK
  3982. 578.57 s [vector] +++ OK, passed 100 tests.
  3983. 578.57 s [vector] mapM_: OK
  3984. 578.57 s [vector] +++ OK, passed 100 tests.
  3985. 578.57 s [vector] forM: OK
  3986. 578.57 s [vector] +++ OK, passed 100 tests.
  3987. 578.57 s [vector] forM_: OK
  3988. 578.57 s [vector] +++ OK, passed 100 tests.
  3989. 578.57 s [vector] imapM: OK
  3990. 578.57 s [vector] +++ OK, passed 100 tests.
  3991. 578.58 s [vector] imapM_: OK
  3992. 578.58 s [vector] +++ OK, passed 100 tests.
  3993. 578.59 s [vector] zipWith: OK
  3994. 578.59 s [vector] +++ OK, passed 100 tests.
  3995. 578.59 s [vector] zipWith3: OK
  3996. 578.59 s [vector] +++ OK, passed 100 tests.
  3997. 578.59 s [vector] izipWith: OK
  3998. 578.59 s [vector] +++ OK, passed 100 tests.
  3999. 578.59 s [vector] izipWith3: OK
  4000. 578.59 s [vector] +++ OK, passed 100 tests.
  4001. 578.59 s [vector] izipWithM: OK
  4002. 578.59 s [vector] +++ OK, passed 100 tests.
  4003. 578.60 s [vector] izipWithM_: OK
  4004. 578.60 s [vector] +++ OK, passed 100 tests.
  4005. 578.61 s [vector] zipWithM: OK
  4006. 578.61 s [vector] +++ OK, passed 100 tests.
  4007. 578.61 s [vector] zipWithM_: OK
  4008. 578.61 s [vector] +++ OK, passed 100 tests.
  4009. 578.61 s [vector] filter: OK
  4010. 578.61 s [vector] +++ OK, passed 100 tests.
  4011. 578.61 s [vector] ifilter: OK
  4012. 578.61 s [vector] +++ OK, passed 100 tests.
  4013. 578.63 s [vector] filterM: OK (0.02s)
  4014. 578.63 s [vector] +++ OK, passed 100 tests.
  4015. 578.63 s [vector] uniq: OK
  4016. 578.63 s [vector] +++ OK, passed 100 tests.
  4017. 578.63 s [vector] mapMaybe: OK
  4018. 578.63 s [vector] +++ OK, passed 100 tests.
  4019. 578.63 s [vector] imapMaybe: OK
  4020. 578.63 s [vector] +++ OK, passed 100 tests.
  4021. 578.63 s [vector] takeWhile: OK
  4022. 578.63 s [vector] +++ OK, passed 100 tests.
  4023. 578.63 s [vector] dropWhile: OK
  4024. 578.63 s [vector] +++ OK, passed 100 tests.
  4025. 578.63 s [vector] partition: OK
  4026. 578.63 s [vector] +++ OK, passed 100 tests.
  4027. 578.63 s [vector] partitionWith: OK
  4028. 578.63 s [vector] +++ OK, passed 100 tests.
  4029. 578.63 s [vector] span: OK
  4030. 578.63 s [vector] +++ OK, passed 100 tests.
  4031. 578.64 s [vector] break: OK
  4032. 578.64 s [vector] +++ OK, passed 100 tests.
  4033. 578.64 s [vector] spanR: OK
  4034. 578.64 s [vector] +++ OK, passed 100 tests.
  4035. 578.64 s [vector] breakR: OK
  4036. 578.64 s [vector] +++ OK, passed 100 tests.
  4037. 578.64 s [vector] groupBy: OK
  4038. 578.64 s [vector] +++ OK, passed 100 tests.
  4039. 578.64 s [vector] elem: OK
  4040. 578.64 s [vector] +++ OK, passed 100 tests.
  4041. 578.64 s [vector] notElem: OK
  4042. 578.64 s [vector] +++ OK, passed 100 tests.
  4043. 578.64 s [vector] find: OK
  4044. 578.64 s [vector] +++ OK, passed 100 tests.
  4045. 578.64 s [vector] findIndex: OK
  4046. 578.64 s [vector] +++ OK, passed 100 tests.
  4047. 578.64 s [vector] findIndexR: OK
  4048. 578.64 s [vector] +++ OK, passed 100 tests.
  4049. 578.64 s [vector] findIndices: OK
  4050. 578.64 s [vector] +++ OK, passed 100 tests.
  4051. 578.64 s [vector] elemIndex: OK
  4052. 578.64 s [vector] +++ OK, passed 100 tests.
  4053. 578.64 s [vector] elemIndices: OK
  4054. 578.64 s [vector] +++ OK, passed 100 tests.
  4055. 578.64 s [vector] foldl: OK
  4056. 578.64 s [vector] +++ OK, passed 100 tests.
  4057. 578.64 s [vector] foldl1: OK
  4058. 578.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4059. 578.64 s [vector] foldl': OK
  4060. 578.64 s [vector] +++ OK, passed 100 tests.
  4061. 578.64 s [vector] foldl1': OK
  4062. 578.64 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4063. 578.64 s [vector] foldr: OK
  4064. 578.64 s [vector] +++ OK, passed 100 tests.
  4065. 578.64 s [vector] foldr1: OK
  4066. 578.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4067. 578.65 s [vector] foldr': OK
  4068. 578.65 s [vector] +++ OK, passed 100 tests.
  4069. 578.65 s [vector] foldr1': OK
  4070. 578.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4071. 578.65 s [vector] ifoldl: OK
  4072. 578.65 s [vector] +++ OK, passed 100 tests.
  4073. 578.65 s [vector] ifoldl': OK
  4074. 578.65 s [vector] +++ OK, passed 100 tests.
  4075. 578.65 s [vector] ifoldr: OK
  4076. 578.65 s [vector] +++ OK, passed 100 tests.
  4077. 578.65 s [vector] ifoldr': OK
  4078. 578.65 s [vector] +++ OK, passed 100 tests.
  4079. 578.65 s [vector] ifoldM: OK
  4080. 578.65 s [vector] +++ OK, passed 100 tests.
  4081. 578.65 s [vector] ifoldM': OK
  4082. 578.65 s [vector] +++ OK, passed 100 tests.
  4083. 578.67 s [vector] ifoldM_: OK (0.01s)
  4084. 578.67 s [vector] +++ OK, passed 100 tests.
  4085. 578.67 s [vector] ifoldM'_: OK
  4086. 578.67 s [vector] +++ OK, passed 100 tests.
  4087. 578.67 s [vector] all: OK
  4088. 578.67 s [vector] +++ OK, passed 100 tests.
  4089. 578.67 s [vector] any: OK
  4090. 578.67 s [vector] +++ OK, passed 100 tests.
  4091. 578.67 s [vector] prescanl: OK
  4092. 578.67 s [vector] +++ OK, passed 100 tests.
  4093. 578.67 s [vector] prescanl': OK
  4094. 578.67 s [vector] +++ OK, passed 100 tests.
  4095. 578.67 s [vector] postscanl: OK
  4096. 578.67 s [vector] +++ OK, passed 100 tests.
  4097. 578.67 s [vector] postscanl': OK
  4098. 578.67 s [vector] +++ OK, passed 100 tests.
  4099. 578.67 s [vector] scanl: OK
  4100. 578.68 s [vector] +++ OK, passed 100 tests.
  4101. 578.68 s [vector] scanl': OK
  4102. 578.68 s [vector] +++ OK, passed 100 tests.
  4103. 578.68 s [vector] scanl1: OK
  4104. 578.68 s [vector] +++ OK, passed 100 tests.
  4105. 578.68 s [vector] scanl1': OK
  4106. 578.68 s [vector] +++ OK, passed 100 tests.
  4107. 578.68 s [vector] iscanl: OK
  4108. 578.68 s [vector] +++ OK, passed 100 tests.
  4109. 578.68 s [vector] iscanl': OK
  4110. 578.68 s [vector] +++ OK, passed 100 tests.
  4111. 578.68 s [vector] prescanr: OK
  4112. 578.68 s [vector] +++ OK, passed 100 tests.
  4113. 578.68 s [vector] prescanr': OK
  4114. 578.68 s [vector] +++ OK, passed 100 tests.
  4115. 578.68 s [vector] postscanr: OK
  4116. 578.68 s [vector] +++ OK, passed 100 tests.
  4117. 578.68 s [vector] postscanr': OK
  4118. 578.68 s [vector] +++ OK, passed 100 tests.
  4119. 578.68 s [vector] scanr: OK
  4120. 578.68 s [vector] +++ OK, passed 100 tests.
  4121. 578.68 s [vector] scanr': OK
  4122. 578.68 s [vector] +++ OK, passed 100 tests.
  4123. 578.69 s [vector] scanr1: OK
  4124. 578.69 s [vector] +++ OK, passed 100 tests.
  4125. 578.69 s [vector] scanr1': OK
  4126. 578.69 s [vector] +++ OK, passed 100 tests.
  4127. 578.69 s [vector] iscanr: OK
  4128. 578.69 s [vector] +++ OK, passed 100 tests.
  4129. 578.69 s [vector] iscanr': OK
  4130. 578.69 s [vector] +++ OK, passed 100 tests.
  4131. 578.69 s [vector] mut_read: OK
  4132. 578.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4133. 578.70 s [vector] mut_write: OK
  4134. 578.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4135. 578.70 s [vector] mut_modify: OK
  4136. 578.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4137. 578.70 s [vector] mut_generate: OK
  4138. 578.70 s [vector] +++ OK, passed 100 tests.
  4139. 578.70 s [vector] mut_generateM: OK
  4140. 578.70 s [vector] +++ OK, passed 100 tests.
  4141. 578.71 s [vector] mut_mapM_: OK
  4142. 578.71 s [vector] +++ OK, passed 100 tests.
  4143. 578.71 s [vector] mut_imapM_: OK
  4144. 578.71 s [vector] +++ OK, passed 100 tests.
  4145. 578.72 s [vector] mut_forM_: OK
  4146. 578.72 s [vector] +++ OK, passed 100 tests.
  4147. 578.73 s [vector] mut_iforM_: OK
  4148. 578.73 s [vector] +++ OK, passed 100 tests.
  4149. 578.73 s [vector] mut_foldr: OK
  4150. 578.73 s [vector] +++ OK, passed 100 tests.
  4151. 578.74 s [vector] mut_foldr': OK
  4152. 578.74 s [vector] +++ OK, passed 100 tests.
  4153. 578.74 s [vector] mut_foldl: OK
  4154. 578.74 s [vector] +++ OK, passed 100 tests.
  4155. 578.74 s [vector] mut_foldl': OK
  4156. 578.74 s [vector] +++ OK, passed 100 tests.
  4157. 578.74 s [vector] mut_ifoldr: OK
  4158. 578.74 s [vector] +++ OK, passed 100 tests.
  4159. 578.74 s [vector] mut_ifoldr': OK
  4160. 578.74 s [vector] +++ OK, passed 100 tests.
  4161. 578.74 s [vector] mut_ifoldl: OK
  4162. 578.74 s [vector] +++ OK, passed 100 tests.
  4163. 578.74 s [vector] mut_ifoldl': OK
  4164. 578.74 s [vector] +++ OK, passed 100 tests.
  4165. 578.74 s [vector] mut_foldM: OK
  4166. 578.74 s [vector] +++ OK, passed 100 tests.
  4167. 578.74 s [vector] mut_foldM': OK
  4168. 578.74 s [vector] +++ OK, passed 100 tests.
  4169. 578.74 s [vector] mut_foldrM: OK
  4170. 578.74 s [vector] +++ OK, passed 100 tests.
  4171. 578.74 s [vector] mut_foldrM': OK
  4172. 578.74 s [vector] +++ OK, passed 100 tests.
  4173. 578.74 s [vector] mut_ifoldM: OK
  4174. 578.74 s [vector] +++ OK, passed 100 tests.
  4175. 578.74 s [vector] mut_ifoldM': OK
  4176. 578.74 s [vector] +++ OK, passed 100 tests.
  4177. 578.74 s [vector] mut_ifoldrM: OK
  4178. 578.74 s [vector] +++ OK, passed 100 tests.
  4179. 578.74 s [vector] mut_ifoldrM': OK
  4180. 578.74 s [vector] +++ OK, passed 100 tests.
  4181. 578.75 s [vector] compare: OK
  4182. 578.75 s [vector] +++ OK, passed 100 tests.
  4183. 578.75 s [vector] maximum: OK
  4184. 578.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4185. 578.75 s [vector] minimum: OK
  4186. 578.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4187. 578.75 s [vector] minIndex: OK
  4188. 578.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4189. 578.75 s [vector] maxIndex: OK
  4190. 578.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4191. 578.75 s [vector] maximumBy: OK
  4192. 578.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4193. 578.75 s [vector] minimumBy: OK
  4194. 578.75 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4195. 578.75 s [vector] maximumOn: OK
  4196. 578.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4197. 578.75 s [vector] minimumOn: OK
  4198. 578.75 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4199. 578.75 s [vector] maxIndexBy: OK
  4200. 578.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4201. 578.75 s [vector] minIndexBy: OK
  4202. 578.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4203. 578.75 s [vector] ListFirstMaxIndexWins: OK
  4204. 578.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4205. 578.75 s [vector] FalseListFirstMaxIndexWins: OK
  4206. 578.75 s [vector] +++ OK, failed as expected. (after 1 test):
  4207. 578.75 s [vector] Exception:
  4208. 578.75 s [vector] Prelude.foldr1: empty list
  4209. 578.75 s [vector] CallStack (from HasCallStack):
  4210. 578.75 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  4211. 578.75 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  4212. 578.75 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4213. 578.75 s [vector] []
  4214. 578.76 s [vector] zip: OK
  4215. 578.76 s [vector] +++ OK, passed 100 tests.
  4216. 578.76 s [vector] zip3: OK
  4217. 578.76 s [vector] +++ OK, passed 100 tests.
  4218. 578.76 s [vector] unzip: OK
  4219. 578.76 s [vector] +++ OK, passed 100 tests.
  4220. 578.76 s [vector] unzip3: OK
  4221. 578.76 s [vector] +++ OK, passed 100 tests.
  4222. 578.76 s [vector] indexed: OK
  4223. 578.76 s [vector] +++ OK, passed 100 tests.
  4224. 578.76 s [vector] update: OK
  4225. 578.76 s [vector] +++ OK, passed 100 tests.
  4226. 578.76 s [vector] mempty: OK
  4227. 578.76 s [vector] +++ OK, passed 100 tests.
  4228. 578.77 s [vector] mappend: OK
  4229. 578.77 s [vector] +++ OK, passed 100 tests.
  4230. 578.77 s [vector] mconcat: OK
  4231. 578.77 s [vector] +++ OK, passed 100 tests.
  4232. 578.77 s [vector] glength: OK
  4233. 578.77 s [vector] +++ OK, passed 100 tests.
  4234. 578.77 s [vector] (Bool)
  4235. 578.77 s [vector] fromList.toList == id: OK
  4236. 578.77 s [vector] +++ OK, passed 100 tests.
  4237. 578.77 s [vector] toList.fromList == id: OK
  4238. 578.77 s [vector] +++ OK, passed 100 tests.
  4239. 578.77 s [vector] unstream.stream == id: OK
  4240. 578.77 s [vector] +++ OK, passed 100 tests.
  4241. 578.77 s [vector] stream.unstream == id: OK
  4242. 578.77 s [vector] +++ OK, passed 100 tests.
  4243. 578.77 s [vector] eq: OK
  4244. 578.77 s [vector] +++ OK, passed 100 tests.
  4245. 578.77 s [vector] length: OK
  4246. 578.77 s [vector] +++ OK, passed 100 tests.
  4247. 578.77 s [vector] null: OK
  4248. 578.77 s [vector] +++ OK, passed 100 tests.
  4249. 578.77 s [vector] index: OK
  4250. 578.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4251. 578.77 s [vector] safeIndex: OK
  4252. 578.77 s [vector] +++ OK, passed 100 tests.
  4253. 578.77 s [vector] head: OK
  4254. 578.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4255. 578.78 s [vector] last: OK
  4256. 578.78 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4257. 578.78 s [vector] unsafeIndex: OK
  4258. 578.78 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4259. 578.78 s [vector] unsafeHead: OK
  4260. 578.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4261. 578.78 s [vector] unsafeLast: OK
  4262. 578.78 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4263. 578.78 s [vector] slice: OK
  4264. 578.78 s [vector] +++ OK, passed 100 tests.
  4265. 578.78 s [vector] init: OK
  4266. 578.78 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4267. 578.78 s [vector] tail: OK
  4268. 578.78 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4269. 578.78 s [vector] take: OK
  4270. 578.79 s [vector] +++ OK, passed 100 tests.
  4271. 578.79 s [vector] drop: OK
  4272. 578.79 s [vector] +++ OK, passed 100 tests.
  4273. 578.79 s [vector] splitAt: OK
  4274. 578.79 s [vector] +++ OK, passed 100 tests.
  4275. 578.79 s [vector] empty: OK
  4276. 578.79 s [vector] +++ OK, passed 100 tests.
  4277. 578.79 s [vector] singleton: OK
  4278. 578.79 s [vector] +++ OK, passed 100 tests.
  4279. 578.79 s [vector] replicate: OK
  4280. 578.79 s [vector] +++ OK, passed 100 tests.
  4281. 578.79 s [vector] generate: OK
  4282. 578.79 s [vector] +++ OK, passed 100 tests.
  4283. 578.79 s [vector] iterateN: OK
  4284. 578.79 s [vector] +++ OK, passed 100 tests.
  4285. 578.80 s [vector] iterateNM: OK (0.02s)
  4286. 578.80 s [vector] +++ OK, passed 100 tests.
  4287. 578.83 s [vector] generateM: OK (0.01s)
  4288. 578.83 s [vector] +++ OK, passed 100 tests.
  4289. 578.84 s [vector] replicateM: OK (0.02s)
  4290. 578.84 s [vector] +++ OK, passed 100 tests.
  4291. 578.84 s [vector] create: OK
  4292. 578.84 s [vector] +++ OK, passed 100 tests.
  4293. 578.84 s [vector] createT: OK
  4294. 578.84 s [vector] +++ OK, passed 100 tests.
  4295. 578.84 s [vector] unfoldr: OK
  4296. 578.84 s [vector] +++ OK, passed 100 tests.
  4297. 578.85 s [vector] unfoldrN: OK
  4298. 578.85 s [vector] +++ OK, passed 100 tests.
  4299. 578.85 s [vector] unfoldrExactN: OK
  4300. 578.85 s [vector] +++ OK, passed 100 tests.
  4301. 578.85 s [vector] unfoldrM: OK
  4302. 578.85 s [vector] +++ OK, passed 100 tests.
  4303. 578.85 s [vector] unfoldrNM: OK
  4304. 578.85 s [vector] +++ OK, passed 100 tests.
  4305. 578.88 s [vector] unfoldrExactNM: OK (0.01s)
  4306. 578.88 s [vector] +++ OK, passed 100 tests.
  4307. 578.89 s [vector] constructN: OK
  4308. 578.89 s [vector] +++ OK, passed 100 tests.
  4309. 578.89 s [vector] constructrN: OK
  4310. 578.89 s [vector] +++ OK, passed 100 tests.
  4311. 578.89 s [vector] cons: OK
  4312. 578.89 s [vector] +++ OK, passed 100 tests.
  4313. 578.89 s [vector] snoc: OK
  4314. 578.89 s [vector] +++ OK, passed 100 tests.
  4315. 578.89 s [vector] append: OK
  4316. 578.89 s [vector] +++ OK, passed 100 tests.
  4317. 578.90 s [vector] concat: OK (0.01s)
  4318. 578.90 s [vector] +++ OK, passed 100 tests.
  4319. 578.90 s [vector] force: OK
  4320. 578.91 s [vector] +++ OK, passed 100 tests.
  4321. 578.91 s [vector] upd: OK
  4322. 578.91 s [vector] +++ OK, passed 100 tests.
  4323. 578.91 s [vector] accum: OK
  4324. 578.91 s [vector] +++ OK, passed 100 tests.
  4325. 578.91 s [vector] reverse: OK
  4326. 578.91 s [vector] +++ OK, passed 100 tests.
  4327. 578.91 s [vector] backpermute: OK
  4328. 578.91 s [vector] +++ OK, passed 100 tests.
  4329. 578.91 s [vector] map: OK
  4330. 578.91 s [vector] +++ OK, passed 100 tests.
  4331. 578.91 s [vector] imap: OK
  4332. 578.91 s [vector] +++ OK, passed 100 tests.
  4333. 578.91 s [vector] concatMap: OK
  4334. 578.91 s [vector] +++ OK, passed 100 tests.
  4335. 578.91 s [vector] mapM: OK
  4336. 578.91 s [vector] +++ OK, passed 100 tests.
  4337. 578.93 s [vector] mapM_: OK
  4338. 578.93 s [vector] +++ OK, passed 100 tests.
  4339. 578.93 s [vector] forM: OK
  4340. 578.93 s [vector] +++ OK, passed 100 tests.
  4341. 578.94 s [vector] forM_: OK (0.01s)
  4342. 578.94 s [vector] +++ OK, passed 100 tests.
  4343. 578.95 s [vector] imapM: OK
  4344. 578.95 s [vector] +++ OK, passed 100 tests.
  4345. 578.96 s [vector] imapM_: OK (0.01s)
  4346. 578.96 s [vector] +++ OK, passed 100 tests.
  4347. 578.96 s [vector] zipWith: OK
  4348. 578.96 s [vector] +++ OK, passed 100 tests.
  4349. 578.97 s [vector] zipWith3: OK
  4350. 578.97 s [vector] +++ OK, passed 100 tests.
  4351. 578.97 s [vector] izipWith: OK
  4352. 578.97 s [vector] +++ OK, passed 100 tests.
  4353. 578.97 s [vector] izipWith3: OK
  4354. 578.97 s [vector] +++ OK, passed 100 tests.
  4355. 578.97 s [vector] izipWithM: OK
  4356. 578.97 s [vector] +++ OK, passed 100 tests.
  4357. 578.97 s [vector] izipWithM_: OK
  4358. 578.97 s [vector] +++ OK, passed 100 tests.
  4359. 578.98 s [vector] zipWithM: OK
  4360. 578.99 s [vector] +++ OK, passed 100 tests.
  4361. 578.99 s [vector] zipWithM_: OK
  4362. 578.99 s [vector] +++ OK, passed 100 tests.
  4363. 578.99 s [vector] filter: OK
  4364. 578.99 s [vector] +++ OK, passed 100 tests.
  4365. 578.99 s [vector] ifilter: OK
  4366. 578.99 s [vector] +++ OK, passed 100 tests.
  4367. 579.02 s [vector] filterM: OK (0.03s)
  4368. 579.02 s [vector] +++ OK, passed 100 tests.
  4369. 579.02 s [vector] uniq: OK
  4370. 579.02 s [vector] +++ OK, passed 100 tests.
  4371. 579.02 s [vector] mapMaybe: OK
  4372. 579.02 s [vector] +++ OK, passed 100 tests.
  4373. 579.02 s [vector] imapMaybe: OK
  4374. 579.02 s [vector] +++ OK, passed 100 tests.
  4375. 579.02 s [vector] takeWhile: OK
  4376. 579.02 s [vector] +++ OK, passed 100 tests.
  4377. 579.02 s [vector] dropWhile: OK
  4378. 579.02 s [vector] +++ OK, passed 100 tests.
  4379. 579.03 s [vector] partition: OK
  4380. 579.03 s [vector] +++ OK, passed 100 tests.
  4381. 579.03 s [vector] partitionWith: OK
  4382. 579.03 s [vector] +++ OK, passed 100 tests.
  4383. 579.03 s [vector] span: OK
  4384. 579.03 s [vector] +++ OK, passed 100 tests.
  4385. 579.03 s [vector] break: OK
  4386. 579.03 s [vector] +++ OK, passed 100 tests.
  4387. 579.03 s [vector] spanR: OK
  4388. 579.03 s [vector] +++ OK, passed 100 tests.
  4389. 579.03 s [vector] breakR: OK
  4390. 579.03 s [vector] +++ OK, passed 100 tests.
  4391. 579.03 s [vector] groupBy: OK
  4392. 579.03 s [vector] +++ OK, passed 100 tests.
  4393. 579.03 s [vector] elem: OK
  4394. 579.03 s [vector] +++ OK, passed 100 tests.
  4395. 579.03 s [vector] notElem: OK
  4396. 579.03 s [vector] +++ OK, passed 100 tests.
  4397. 579.03 s [vector] find: OK
  4398. 579.03 s [vector] +++ OK, passed 100 tests.
  4399. 579.04 s [vector] findIndex: OK
  4400. 579.04 s [vector] +++ OK, passed 100 tests.
  4401. 579.04 s [vector] findIndexR: OK
  4402. 579.04 s [vector] +++ OK, passed 100 tests.
  4403. 579.04 s [vector] findIndices: OK
  4404. 579.04 s [vector] +++ OK, passed 100 tests.
  4405. 579.04 s [vector] elemIndex: OK
  4406. 579.05 s [vector] +++ OK, passed 100 tests.
  4407. 579.05 s [vector] elemIndices: OK
  4408. 579.05 s [vector] +++ OK, passed 100 tests.
  4409. 579.05 s [vector] foldl: OK
  4410. 579.05 s [vector] +++ OK, passed 100 tests.
  4411. 579.05 s [vector] foldl1: OK
  4412. 579.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4413. 579.05 s [vector] foldl': OK
  4414. 579.05 s [vector] +++ OK, passed 100 tests.
  4415. 579.05 s [vector] foldl1': OK
  4416. 579.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4417. 579.05 s [vector] foldr: OK
  4418. 579.05 s [vector] +++ OK, passed 100 tests.
  4419. 579.05 s [vector] foldr1: OK
  4420. 579.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4421. 579.06 s [vector] foldr': OK
  4422. 579.06 s [vector] +++ OK, passed 100 tests.
  4423. 579.06 s [vector] foldr1': OK
  4424. 579.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4425. 579.06 s [vector] ifoldl: OK
  4426. 579.06 s [vector] +++ OK, passed 100 tests.
  4427. 579.06 s [vector] ifoldl': OK
  4428. 579.06 s [vector] +++ OK, passed 100 tests.
  4429. 579.07 s [vector] ifoldr: OK
  4430. 579.07 s [vector] +++ OK, passed 100 tests.
  4431. 579.07 s [vector] ifoldr': OK
  4432. 579.07 s [vector] +++ OK, passed 100 tests.
  4433. 579.07 s [vector] ifoldM: OK
  4434. 579.07 s [vector] +++ OK, passed 100 tests.
  4435. 579.07 s [vector] ifoldM': OK
  4436. 579.07 s [vector] +++ OK, passed 100 tests.
  4437. 579.08 s [vector] ifoldM_: OK (0.01s)
  4438. 579.09 s [vector] +++ OK, passed 100 tests.
  4439. 579.09 s [vector] ifoldM'_: OK (0.01s)
  4440. 579.09 s [vector] +++ OK, passed 100 tests.
  4441. 579.09 s [vector] all: OK
  4442. 579.09 s [vector] +++ OK, passed 100 tests.
  4443. 579.09 s [vector] any: OK
  4444. 579.09 s [vector] +++ OK, passed 100 tests.
  4445. 579.09 s [vector] prescanl: OK
  4446. 579.09 s [vector] +++ OK, passed 100 tests.
  4447. 579.09 s [vector] prescanl': OK
  4448. 579.09 s [vector] +++ OK, passed 100 tests.
  4449. 579.09 s [vector] postscanl: OK
  4450. 579.09 s [vector] +++ OK, passed 100 tests.
  4451. 579.09 s [vector] postscanl': OK
  4452. 579.09 s [vector] +++ OK, passed 100 tests.
  4453. 579.10 s [vector] scanl: OK
  4454. 579.10 s [vector] +++ OK, passed 100 tests.
  4455. 579.10 s [vector] scanl': OK
  4456. 579.10 s [vector] +++ OK, passed 100 tests.
  4457. 579.10 s [vector] scanl1: OK
  4458. 579.10 s [vector] +++ OK, passed 100 tests.
  4459. 579.10 s [vector] scanl1': OK
  4460. 579.10 s [vector] +++ OK, passed 100 tests.
  4461. 579.11 s [vector] iscanl: OK
  4462. 579.11 s [vector] +++ OK, passed 100 tests.
  4463. 579.11 s [vector] iscanl': OK
  4464. 579.11 s [vector] +++ OK, passed 100 tests.
  4465. 579.11 s [vector] prescanr: OK
  4466. 579.11 s [vector] +++ OK, passed 100 tests.
  4467. 579.11 s [vector] prescanr': OK
  4468. 579.12 s [vector] +++ OK, passed 100 tests.
  4469. 579.12 s [vector] postscanr: OK
  4470. 579.12 s [vector] +++ OK, passed 100 tests.
  4471. 579.12 s [vector] postscanr': OK
  4472. 579.12 s [vector] +++ OK, passed 100 tests.
  4473. 579.12 s [vector] scanr: OK
  4474. 579.12 s [vector] +++ OK, passed 100 tests.
  4475. 579.12 s [vector] scanr': OK
  4476. 579.12 s [vector] +++ OK, passed 100 tests.
  4477. 579.12 s [vector] scanr1: OK
  4478. 579.12 s [vector] +++ OK, passed 100 tests.
  4479. 579.12 s [vector] scanr1': OK
  4480. 579.12 s [vector] +++ OK, passed 100 tests.
  4481. 579.12 s [vector] iscanr: OK
  4482. 579.12 s [vector] +++ OK, passed 100 tests.
  4483. 579.12 s [vector] iscanr': OK
  4484. 579.13 s [vector] +++ OK, passed 100 tests.
  4485. 579.13 s [vector] mut_read: OK
  4486. 579.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4487. 579.13 s [vector] mut_write: OK
  4488. 579.13 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4489. 579.13 s [vector] mut_modify: OK
  4490. 579.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4491. 579.13 s [vector] mut_generate: OK
  4492. 579.13 s [vector] +++ OK, passed 100 tests.
  4493. 579.13 s [vector] mut_generateM: OK
  4494. 579.13 s [vector] +++ OK, passed 100 tests.
  4495. 579.15 s [vector] mut_mapM_: OK
  4496. 579.15 s [vector] +++ OK, passed 100 tests.
  4497. 579.17 s [vector] mut_imapM_: OK (0.01s)
  4498. 579.17 s [vector] +++ OK, passed 100 tests.
  4499. 579.17 s [vector] mut_forM_: OK (0.01s)
  4500. 579.17 s [vector] +++ OK, passed 100 tests.
  4501. 579.18 s [vector] mut_iforM_: OK
  4502. 579.18 s [vector] +++ OK, passed 100 tests.
  4503. 579.18 s [vector] mut_foldr: OK
  4504. 579.18 s [vector] +++ OK, passed 100 tests.
  4505. 579.18 s [vector] mut_foldr': OK
  4506. 579.18 s [vector] +++ OK, passed 100 tests.
  4507. 579.18 s [vector] mut_foldl: OK
  4508. 579.18 s [vector] +++ OK, passed 100 tests.
  4509. 579.18 s [vector] mut_foldl': OK
  4510. 579.18 s [vector] +++ OK, passed 100 tests.
  4511. 579.19 s [vector] mut_ifoldr: OK
  4512. 579.19 s [vector] +++ OK, passed 100 tests.
  4513. 579.19 s [vector] mut_ifoldr': OK
  4514. 579.19 s [vector] +++ OK, passed 100 tests.
  4515. 579.19 s [vector] mut_ifoldl: OK
  4516. 579.19 s [vector] +++ OK, passed 100 tests.
  4517. 579.19 s [vector] mut_ifoldl': OK
  4518. 579.19 s [vector] +++ OK, passed 100 tests.
  4519. 579.20 s [vector] mut_foldM: OK
  4520. 579.20 s [vector] +++ OK, passed 100 tests.
  4521. 579.20 s [vector] mut_foldM': OK
  4522. 579.20 s [vector] +++ OK, passed 100 tests.
  4523. 579.20 s [vector] mut_foldrM: OK
  4524. 579.20 s [vector] +++ OK, passed 100 tests.
  4525. 579.20 s [vector] mut_foldrM': OK
  4526. 579.20 s [vector] +++ OK, passed 100 tests.
  4527. 579.20 s [vector] mut_ifoldM: OK
  4528. 579.21 s [vector] +++ OK, passed 100 tests.
  4529. 579.21 s [vector] mut_ifoldM': OK
  4530. 579.21 s [vector] +++ OK, passed 100 tests.
  4531. 579.21 s [vector] mut_ifoldrM: OK
  4532. 579.21 s [vector] +++ OK, passed 100 tests.
  4533. 579.21 s [vector] mut_ifoldrM': OK
  4534. 579.21 s [vector] +++ OK, passed 100 tests.
  4535. 579.21 s [vector] compare: OK
  4536. 579.21 s [vector] +++ OK, passed 100 tests.
  4537. 579.21 s [vector] maximum: OK
  4538. 579.21 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4539. 579.21 s [vector] minimum: OK
  4540. 579.21 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4541. 579.21 s [vector] minIndex: OK
  4542. 579.21 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4543. 579.22 s [vector] maxIndex: OK
  4544. 579.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4545. 579.22 s [vector] maximumBy: OK
  4546. 579.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4547. 579.22 s [vector] minimumBy: OK
  4548. 579.22 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4549. 579.22 s [vector] maximumOn: OK
  4550. 579.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4551. 579.22 s [vector] minimumOn: OK
  4552. 579.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4553. 579.22 s [vector] maxIndexBy: OK
  4554. 579.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4555. 579.22 s [vector] minIndexBy: OK
  4556. 579.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4557. 579.22 s [vector] ListFirstMaxIndexWins: OK
  4558. 579.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4559. 579.22 s [vector] FalseListFirstMaxIndexWins: OK
  4560. 579.23 s [vector] +++ OK, failed as expected. (after 1 test):
  4561. 579.23 s [vector] Exception:
  4562. 579.23 s [vector] Prelude.foldr1: empty list
  4563. 579.23 s [vector] CallStack (from HasCallStack):
  4564. 579.23 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  4565. 579.23 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  4566. 579.23 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4567. 579.23 s [vector] []
  4568. 579.23 s [vector] zip: OK
  4569. 579.23 s [vector] +++ OK, passed 100 tests.
  4570. 579.23 s [vector] zip3: OK
  4571. 579.23 s [vector] +++ OK, passed 100 tests.
  4572. 579.23 s [vector] unzip: OK
  4573. 579.23 s [vector] +++ OK, passed 100 tests.
  4574. 579.23 s [vector] unzip3: OK
  4575. 579.23 s [vector] +++ OK, passed 100 tests.
  4576. 579.23 s [vector] indexed: OK
  4577. 579.23 s [vector] +++ OK, passed 100 tests.
  4578. 579.23 s [vector] update: OK
  4579. 579.23 s [vector] +++ OK, passed 100 tests.
  4580. 579.23 s [vector] mempty: OK
  4581. 579.24 s [vector] +++ OK, passed 100 tests.
  4582. 579.24 s [vector] mappend: OK
  4583. 579.24 s [vector] +++ OK, passed 100 tests.
  4584. 579.24 s [vector] mconcat: OK (0.01s)
  4585. 579.24 s [vector] +++ OK, passed 100 tests.
  4586. 579.24 s [vector] glength: OK
  4587. 579.24 s [vector] +++ OK, passed 100 tests.
  4588. 579.24 s [vector] and: OK
  4589. 579.24 s [vector] +++ OK, passed 100 tests.
  4590. 579.24 s [vector] or: OK
  4591. 579.24 s [vector] +++ OK, passed 100 tests.
  4592. 579.24 s [vector] (Int)
  4593. 579.24 s [vector] fromList.toList == id: OK
  4594. 579.24 s [vector] +++ OK, passed 100 tests.
  4595. 579.24 s [vector] toList.fromList == id: OK
  4596. 579.24 s [vector] +++ OK, passed 100 tests.
  4597. 579.24 s [vector] unstream.stream == id: OK
  4598. 579.25 s [vector] +++ OK, passed 100 tests.
  4599. 579.25 s [vector] stream.unstream == id: OK
  4600. 579.25 s [vector] +++ OK, passed 100 tests.
  4601. 579.25 s [vector] eq: OK
  4602. 579.25 s [vector] +++ OK, passed 100 tests.
  4603. 579.25 s [vector] length: OK
  4604. 579.25 s [vector] +++ OK, passed 100 tests.
  4605. 579.25 s [vector] null: OK
  4606. 579.25 s [vector] +++ OK, passed 100 tests.
  4607. 579.25 s [vector] index: OK
  4608. 579.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4609. 579.25 s [vector] safeIndex: OK
  4610. 579.25 s [vector] +++ OK, passed 100 tests.
  4611. 579.25 s [vector] head: OK
  4612. 579.25 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4613. 579.25 s [vector] last: OK
  4614. 579.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4615. 579.25 s [vector] unsafeIndex: OK
  4616. 579.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4617. 579.25 s [vector] unsafeHead: OK
  4618. 579.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4619. 579.25 s [vector] unsafeLast: OK
  4620. 579.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4621. 579.25 s [vector] slice: OK
  4622. 579.25 s [vector] +++ OK, passed 100 tests.
  4623. 579.25 s [vector] init: OK
  4624. 579.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4625. 579.25 s [vector] tail: OK
  4626. 579.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4627. 579.25 s [vector] take: OK
  4628. 579.25 s [vector] +++ OK, passed 100 tests.
  4629. 579.25 s [vector] drop: OK
  4630. 579.25 s [vector] +++ OK, passed 100 tests.
  4631. 579.25 s [vector] splitAt: OK
  4632. 579.25 s [vector] +++ OK, passed 100 tests.
  4633. 579.25 s [vector] empty: OK
  4634. 579.25 s [vector] +++ OK, passed 100 tests.
  4635. 579.25 s [vector] singleton: OK
  4636. 579.25 s [vector] +++ OK, passed 100 tests.
  4637. 579.25 s [vector] replicate: OK
  4638. 579.26 s [vector] +++ OK, passed 100 tests.
  4639. 579.27 s [vector] generate: OK
  4640. 579.27 s [vector] +++ OK, passed 100 tests.
  4641. 579.27 s [vector] iterateN: OK
  4642. 579.27 s [vector] +++ OK, passed 100 tests.
  4643. 579.31 s [vector] iterateNM: OK (0.04s)
  4644. 579.31 s [vector] +++ OK, passed 100 tests.
  4645. 579.33 s [vector] generateM: OK (0.01s)
  4646. 579.33 s [vector] +++ OK, passed 100 tests.
  4647. 579.33 s [vector] replicateM: OK (0.02s)
  4648. 579.33 s [vector] +++ OK, passed 100 tests.
  4649. 579.33 s [vector] create: OK
  4650. 579.33 s [vector] +++ OK, passed 100 tests.
  4651. 579.33 s [vector] createT: OK
  4652. 579.33 s [vector] +++ OK, passed 100 tests.
  4653. 579.33 s [vector] unfoldr: OK
  4654. 579.33 s [vector] +++ OK, passed 100 tests.
  4655. 579.33 s [vector] unfoldrN: OK
  4656. 579.33 s [vector] +++ OK, passed 100 tests.
  4657. 579.34 s [vector] unfoldrExactN: OK
  4658. 579.34 s [vector] +++ OK, passed 100 tests.
  4659. 579.35 s [vector] unfoldrM: OK
  4660. 579.35 s [vector] +++ OK, passed 100 tests.
  4661. 579.35 s [vector] unfoldrNM: OK
  4662. 579.35 s [vector] +++ OK, passed 100 tests.
  4663. 579.35 s [vector] unfoldrExactNM: OK (0.01s)
  4664. 579.35 s [vector] +++ OK, passed 100 tests.
  4665. 579.35 s [vector] constructN: OK
  4666. 579.35 s [vector] +++ OK, passed 100 tests.
  4667. 579.36 s [vector] constructrN: OK
  4668. 579.36 s [vector] +++ OK, passed 100 tests.
  4669. 579.36 s [vector] cons: OK
  4670. 579.36 s [vector] +++ OK, passed 100 tests.
  4671. 579.36 s [vector] snoc: OK
  4672. 579.36 s [vector] +++ OK, passed 100 tests.
  4673. 579.36 s [vector] append: OK
  4674. 579.36 s [vector] +++ OK, passed 100 tests.
  4675. 579.37 s [vector] concat: OK
  4676. 579.37 s [vector] +++ OK, passed 100 tests.
  4677. 579.38 s [vector] force: OK
  4678. 579.38 s [vector] +++ OK, passed 100 tests.
  4679. 579.38 s [vector] upd: OK
  4680. 579.38 s [vector] +++ OK, passed 100 tests.
  4681. 579.38 s [vector] accum: OK
  4682. 579.38 s [vector] +++ OK, passed 100 tests.
  4683. 579.38 s [vector] reverse: OK
  4684. 579.38 s [vector] +++ OK, passed 100 tests.
  4685. 579.38 s [vector] backpermute: OK
  4686. 579.38 s [vector] +++ OK, passed 100 tests.
  4687. 579.38 s [vector] map: OK
  4688. 579.39 s [vector] +++ OK, passed 100 tests.
  4689. 579.39 s [vector] imap: OK
  4690. 579.39 s [vector] +++ OK, passed 100 tests.
  4691. 579.39 s [vector] concatMap: OK
  4692. 579.39 s [vector] +++ OK, passed 100 tests.
  4693. 579.39 s [vector] mapM: OK
  4694. 579.39 s [vector] +++ OK, passed 100 tests.
  4695. 579.41 s [vector] mapM_: OK (0.02s)
  4696. 579.41 s [vector] +++ OK, passed 100 tests.
  4697. 579.41 s [vector] forM: OK
  4698. 579.41 s [vector] +++ OK, passed 100 tests.
  4699. 579.42 s [vector] forM_: OK (0.02s)
  4700. 579.42 s [vector] +++ OK, passed 100 tests.
  4701. 579.43 s [vector] imapM: OK
  4702. 579.43 s [vector] +++ OK, passed 100 tests.
  4703. 579.44 s [vector] imapM_: OK (0.01s)
  4704. 579.44 s [vector] +++ OK, passed 100 tests.
  4705. 579.44 s [vector] zipWith: OK
  4706. 579.44 s [vector] +++ OK, passed 100 tests.
  4707. 579.45 s [vector] zipWith3: OK
  4708. 579.45 s [vector] +++ OK, passed 100 tests.
  4709. 579.45 s [vector] izipWith: OK
  4710. 579.45 s [vector] +++ OK, passed 100 tests.
  4711. 579.45 s [vector] izipWith3: OK
  4712. 579.47 s [vector] +++ OK, passed 100 tests.
  4713. 579.47 s [vector] izipWithM: OK
  4714. 579.47 s [vector] +++ OK, passed 100 tests.
  4715. 579.47 s [vector] izipWithM_: OK (0.01s)
  4716. 579.47 s [vector] +++ OK, passed 100 tests.
  4717. 579.47 s [vector] zipWithM: OK
  4718. 579.47 s [vector] +++ OK, passed 100 tests.
  4719. 579.48 s [vector] zipWithM_: OK (0.01s)
  4720. 579.48 s [vector] +++ OK, passed 100 tests.
  4721. 579.49 s [vector] filter: OK
  4722. 579.49 s [vector] +++ OK, passed 100 tests.
  4723. 579.49 s [vector] ifilter: OK
  4724. 579.49 s [vector] +++ OK, passed 100 tests.
  4725. 579.51 s [vector] filterM: OK (0.02s)
  4726. 579.51 s [vector] +++ OK, passed 100 tests.
  4727. 579.51 s [vector] uniq: OK
  4728. 579.51 s [vector] +++ OK, passed 100 tests.
  4729. 579.51 s [vector] mapMaybe: OK
  4730. 579.51 s [vector] +++ OK, passed 100 tests.
  4731. 579.51 s [vector] imapMaybe: OK
  4732. 579.51 s [vector] +++ OK, passed 100 tests.
  4733. 579.51 s [vector] takeWhile: OK
  4734. 579.51 s [vector] +++ OK, passed 100 tests.
  4735. 579.51 s [vector] dropWhile: OK
  4736. 579.51 s [vector] +++ OK, passed 100 tests.
  4737. 579.52 s [vector] partition: OK
  4738. 579.52 s [vector] +++ OK, passed 100 tests.
  4739. 579.52 s [vector] partitionWith: OK
  4740. 579.52 s [vector] +++ OK, passed 100 tests.
  4741. 579.52 s [vector] span: OK
  4742. 579.52 s [vector] +++ OK, passed 100 tests.
  4743. 579.52 s [vector] break: OK
  4744. 579.52 s [vector] +++ OK, passed 100 tests.
  4745. 579.52 s [vector] spanR: OK
  4746. 579.52 s [vector] +++ OK, passed 100 tests.
  4747. 579.52 s [vector] breakR: OK
  4748. 579.52 s [vector] +++ OK, passed 100 tests.
  4749. 579.52 s [vector] groupBy: OK
  4750. 579.52 s [vector] +++ OK, passed 100 tests.
  4751. 579.53 s [vector] elem: OK
  4752. 579.53 s [vector] +++ OK, passed 100 tests.
  4753. 579.53 s [vector] notElem: OK
  4754. 579.53 s [vector] +++ OK, passed 100 tests.
  4755. 579.53 s [vector] find: OK
  4756. 579.53 s [vector] +++ OK, passed 100 tests.
  4757. 579.53 s [vector] findIndex: OK
  4758. 579.53 s [vector] +++ OK, passed 100 tests.
  4759. 579.53 s [vector] findIndexR: OK
  4760. 579.53 s [vector] +++ OK, passed 100 tests.
  4761. 579.53 s [vector] findIndices: OK
  4762. 579.53 s [vector] +++ OK, passed 100 tests.
  4763. 579.53 s [vector] elemIndex: OK
  4764. 579.53 s [vector] +++ OK, passed 100 tests.
  4765. 579.53 s [vector] elemIndices: OK
  4766. 579.53 s [vector] +++ OK, passed 100 tests.
  4767. 579.53 s [vector] foldl: OK
  4768. 579.53 s [vector] +++ OK, passed 100 tests.
  4769. 579.54 s [vector] foldl1: OK
  4770. 579.54 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4771. 579.54 s [vector] foldl': OK
  4772. 579.54 s [vector] +++ OK, passed 100 tests.
  4773. 579.54 s [vector] foldl1': OK
  4774. 579.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4775. 579.54 s [vector] foldr: OK
  4776. 579.54 s [vector] +++ OK, passed 100 tests.
  4777. 579.55 s [vector] foldr1: OK
  4778. 579.55 s [vector] +++ OK, passed 100 tests; 10 discarded.
  4779. 579.55 s [vector] foldr': OK
  4780. 579.55 s [vector] +++ OK, passed 100 tests.
  4781. 579.56 s [vector] foldr1': OK
  4782. 579.56 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4783. 579.56 s [vector] ifoldl: OK
  4784. 579.57 s [vector] +++ OK, passed 100 tests.
  4785. 579.57 s [vector] ifoldl': OK
  4786. 579.57 s [vector] +++ OK, passed 100 tests.
  4787. 579.57 s [vector] ifoldr: OK
  4788. 579.57 s [vector] +++ OK, passed 100 tests.
  4789. 579.57 s [vector] ifoldr': OK
  4790. 579.57 s [vector] +++ OK, passed 100 tests.
  4791. 579.58 s [vector] ifoldM: OK
  4792. 579.58 s [vector] +++ OK, passed 100 tests.
  4793. 579.58 s [vector] ifoldM': OK
  4794. 579.58 s [vector] +++ OK, passed 100 tests.
  4795. 579.59 s [vector] ifoldM_: OK (0.02s)
  4796. 579.59 s [vector] +++ OK, passed 100 tests.
  4797. 579.61 s [vector] ifoldM'_: OK (0.02s)
  4798. 579.61 s [vector] +++ OK, passed 100 tests.
  4799. 579.61 s [vector] all: OK
  4800. 579.61 s [vector] +++ OK, passed 100 tests.
  4801. 579.61 s [vector] any: OK
  4802. 579.61 s [vector] +++ OK, passed 100 tests.
  4803. 579.61 s [vector] prescanl: OK
  4804. 579.61 s [vector] +++ OK, passed 100 tests.
  4805. 579.61 s [vector] prescanl': OK
  4806. 579.61 s [vector] +++ OK, passed 100 tests.
  4807. 579.61 s [vector] postscanl: OK
  4808. 579.61 s [vector] +++ OK, passed 100 tests.
  4809. 579.62 s [vector] postscanl': OK
  4810. 579.62 s [vector] +++ OK, passed 100 tests.
  4811. 579.62 s [vector] scanl: OK
  4812. 579.62 s [vector] +++ OK, passed 100 tests.
  4813. 579.62 s [vector] scanl': OK
  4814. 579.63 s [vector] +++ OK, passed 100 tests.
  4815. 579.63 s [vector] scanl1: OK
  4816. 579.63 s [vector] +++ OK, passed 100 tests.
  4817. 579.64 s [vector] scanl1': OK
  4818. 579.64 s [vector] +++ OK, passed 100 tests.
  4819. 579.64 s [vector] iscanl: OK
  4820. 579.64 s [vector] +++ OK, passed 100 tests.
  4821. 579.64 s [vector] iscanl': OK
  4822. 579.64 s [vector] +++ OK, passed 100 tests.
  4823. 579.64 s [vector] prescanr: OK
  4824. 579.64 s [vector] +++ OK, passed 100 tests.
  4825. 579.65 s [vector] prescanr': OK
  4826. 579.65 s [vector] +++ OK, passed 100 tests.
  4827. 579.65 s [vector] postscanr: OK
  4828. 579.66 s [vector] +++ OK, passed 100 tests.
  4829. 579.66 s [vector] postscanr': OK
  4830. 579.66 s [vector] +++ OK, passed 100 tests.
  4831. 579.66 s [vector] scanr: OK
  4832. 579.66 s [vector] +++ OK, passed 100 tests.
  4833. 579.66 s [vector] scanr': OK
  4834. 579.66 s [vector] +++ OK, passed 100 tests.
  4835. 579.66 s [vector] scanr1: OK
  4836. 579.66 s [vector] +++ OK, passed 100 tests.
  4837. 579.66 s [vector] scanr1': OK
  4838. 579.66 s [vector] +++ OK, passed 100 tests.
  4839. 579.67 s [vector] iscanr: OK
  4840. 579.67 s [vector] +++ OK, passed 100 tests.
  4841. 579.67 s [vector] iscanr': OK
  4842. 579.67 s [vector] +++ OK, passed 100 tests.
  4843. 579.67 s [vector] mut_read: OK
  4844. 579.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4845. 579.67 s [vector] mut_write: OK
  4846. 579.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4847. 579.68 s [vector] mut_modify: OK
  4848. 579.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4849. 579.69 s [vector] mut_generate: OK
  4850. 579.69 s [vector] +++ OK, passed 100 tests.
  4851. 579.69 s [vector] mut_generateM: OK (0.01s)
  4852. 579.69 s [vector] +++ OK, passed 100 tests.
  4853. 579.69 s [vector] mut_mapM_: OK (0.02s)
  4854. 579.69 s [vector] +++ OK, passed 100 tests.
  4855. 579.72 s [vector] mut_imapM_: OK
  4856. 579.73 s [vector] +++ OK, passed 100 tests.
  4857. 579.73 s [vector] mut_forM_: OK (0.02s)
  4858. 579.73 s [vector] +++ OK, passed 100 tests.
  4859. 579.74 s [vector] mut_iforM_: OK (0.01s)
  4860. 579.74 s [vector] +++ OK, passed 100 tests.
  4861. 579.75 s [vector] mut_foldr: OK
  4862. 579.75 s [vector] +++ OK, passed 100 tests.
  4863. 579.75 s [vector] mut_foldr': OK
  4864. 579.75 s [vector] +++ OK, passed 100 tests.
  4865. 579.75 s [vector] mut_foldl: OK
  4866. 579.75 s [vector] +++ OK, passed 100 tests.
  4867. 579.75 s [vector] mut_foldl': OK
  4868. 579.75 s [vector] +++ OK, passed 100 tests.
  4869. 579.75 s [vector] mut_ifoldr: OK
  4870. 579.76 s [vector] +++ OK, passed 100 tests.
  4871. 579.76 s [vector] mut_ifoldr': OK
  4872. 579.76 s [vector] +++ OK, passed 100 tests.
  4873. 579.76 s [vector] mut_ifoldl: OK
  4874. 579.76 s [vector] +++ OK, passed 100 tests.
  4875. 579.76 s [vector] mut_ifoldl': OK
  4876. 579.76 s [vector] +++ OK, passed 100 tests.
  4877. 579.77 s [vector] mut_foldM: OK
  4878. 579.77 s [vector] +++ OK, passed 100 tests.
  4879. 579.77 s [vector] mut_foldM': OK
  4880. 579.77 s [vector] +++ OK, passed 100 tests.
  4881. 579.78 s [vector] mut_foldrM: OK
  4882. 579.78 s [vector] +++ OK, passed 100 tests.
  4883. 579.79 s [vector] mut_foldrM': OK
  4884. 579.79 s [vector] +++ OK, passed 100 tests.
  4885. 579.79 s [vector] mut_ifoldM: OK
  4886. 579.79 s [vector] +++ OK, passed 100 tests.
  4887. 579.79 s [vector] mut_ifoldM': OK
  4888. 579.79 s [vector] +++ OK, passed 100 tests.
  4889. 579.79 s [vector] mut_ifoldrM: OK
  4890. 579.79 s [vector] +++ OK, passed 100 tests.
  4891. 579.79 s [vector] mut_ifoldrM': OK
  4892. 579.79 s [vector] +++ OK, passed 100 tests.
  4893. 579.79 s [vector] compare: OK
  4894. 579.79 s [vector] +++ OK, passed 100 tests.
  4895. 579.79 s [vector] maximum: OK
  4896. 579.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4897. 579.79 s [vector] minimum: OK
  4898. 579.79 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4899. 579.79 s [vector] minIndex: OK
  4900. 579.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4901. 579.79 s [vector] maxIndex: OK
  4902. 579.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4903. 579.79 s [vector] maximumBy: OK
  4904. 579.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4905. 579.80 s [vector] minimumBy: OK
  4906. 579.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4907. 579.80 s [vector] maximumOn: OK
  4908. 579.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4909. 579.80 s [vector] minimumOn: OK
  4910. 579.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4911. 579.81 s [vector] maxIndexBy: OK
  4912. 579.81 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4913. 579.81 s [vector] minIndexBy: OK
  4914. 579.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4915. 579.81 s [vector] ListFirstMaxIndexWins: OK
  4916. 579.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4917. 579.81 s [vector] FalseListFirstMaxIndexWins: OK
  4918. 579.81 s [vector] +++ OK, failed as expected. (after 1 test):
  4919. 579.81 s [vector] Exception:
  4920. 579.81 s [vector] Prelude.foldr1: empty list
  4921. 579.81 s [vector] CallStack (from HasCallStack):
  4922. 579.81 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  4923. 579.81 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  4924. 579.81 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4925. 579.81 s [vector] []
  4926. 579.81 s [vector] zip: OK
  4927. 579.81 s [vector] +++ OK, passed 100 tests.
  4928. 579.82 s [vector] zip3: OK
  4929. 579.82 s [vector] +++ OK, passed 100 tests.
  4930. 579.82 s [vector] unzip: OK
  4931. 579.82 s [vector] +++ OK, passed 100 tests.
  4932. 579.82 s [vector] unzip3: OK
  4933. 579.82 s [vector] +++ OK, passed 100 tests.
  4934. 579.82 s [vector] indexed: OK
  4935. 579.82 s [vector] +++ OK, passed 100 tests.
  4936. 579.82 s [vector] update: OK
  4937. 579.82 s [vector] +++ OK, passed 100 tests.
  4938. 579.82 s [vector] mempty: OK
  4939. 579.82 s [vector] +++ OK, passed 100 tests.
  4940. 579.82 s [vector] mappend: OK
  4941. 579.82 s [vector] +++ OK, passed 100 tests.
  4942. 579.82 s [vector] mconcat: OK (0.01s)
  4943. 579.83 s [vector] +++ OK, passed 100 tests.
  4944. 579.83 s [vector] glength: OK
  4945. 579.83 s [vector] +++ OK, passed 100 tests.
  4946. 579.83 s [vector] sum: OK
  4947. 579.83 s [vector] +++ OK, passed 100 tests.
  4948. 579.83 s [vector] product: OK
  4949. 579.83 s [vector] +++ OK, passed 100 tests.
  4950. 579.83 s [vector] enumFromN: OK
  4951. 579.83 s [vector] +++ OK, passed 100 tests.
  4952. 579.83 s [vector] enumFromThenN: OK
  4953. 579.83 s [vector] +++ OK, passed 100 tests.
  4954. 579.83 s [vector] enumFromTo: OK
  4955. 579.83 s [vector] +++ OK, passed 100 tests.
  4956. 579.83 s [vector] enumFromThenTo: OK
  4957. 579.83 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4958. 579.83 s [vector] (Float)
  4959. 579.83 s [vector] fromList.toList == id: OK
  4960. 579.83 s [vector] +++ OK, passed 100 tests.
  4961. 579.83 s [vector] toList.fromList == id: OK
  4962. 579.83 s [vector] +++ OK, passed 100 tests.
  4963. 579.83 s [vector] unstream.stream == id: OK
  4964. 579.83 s [vector] +++ OK, passed 100 tests.
  4965. 579.83 s [vector] stream.unstream == id: OK
  4966. 579.83 s [vector] +++ OK, passed 100 tests.
  4967. 579.83 s [vector] eq: OK
  4968. 579.83 s [vector] +++ OK, passed 100 tests.
  4969. 579.83 s [vector] length: OK
  4970. 579.84 s [vector] +++ OK, passed 100 tests.
  4971. 579.84 s [vector] null: OK
  4972. 579.84 s [vector] +++ OK, passed 100 tests.
  4973. 579.84 s [vector] index: OK
  4974. 579.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4975. 579.84 s [vector] safeIndex: OK
  4976. 579.84 s [vector] +++ OK, passed 100 tests.
  4977. 579.84 s [vector] head: OK
  4978. 579.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4979. 579.84 s [vector] last: OK
  4980. 579.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4981. 579.84 s [vector] unsafeIndex: OK
  4982. 579.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4983. 579.84 s [vector] unsafeHead: OK
  4984. 579.85 s [vector] +++ OK, passed 100 tests; 10 discarded.
  4985. 579.85 s [vector] unsafeLast: OK
  4986. 579.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4987. 579.85 s [vector] slice: OK
  4988. 579.85 s [vector] +++ OK, passed 100 tests.
  4989. 579.85 s [vector] init: OK
  4990. 579.85 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4991. 579.85 s [vector] tail: OK
  4992. 579.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4993. 579.86 s [vector] take: OK
  4994. 579.86 s [vector] +++ OK, passed 100 tests.
  4995. 579.86 s [vector] drop: OK
  4996. 579.86 s [vector] +++ OK, passed 100 tests.
  4997. 579.87 s [vector] splitAt: OK
  4998. 579.87 s [vector] +++ OK, passed 100 tests.
  4999. 579.87 s [vector] empty: OK
  5000. 579.87 s [vector] +++ OK, passed 100 tests.
  5001. 579.87 s [vector] singleton: OK
  5002. 579.87 s [vector] +++ OK, passed 100 tests.
  5003. 579.87 s [vector] replicate: OK
  5004. 579.87 s [vector] +++ OK, passed 100 tests.
  5005. 579.87 s [vector] generate: OK
  5006. 579.87 s [vector] +++ OK, passed 100 tests.
  5007. 579.87 s [vector] iterateN: OK
  5008. 579.87 s [vector] +++ OK, passed 100 tests.
  5009. 579.91 s [vector] iterateNM: OK (0.05s)
  5010. 579.91 s [vector] +++ OK, passed 100 tests.
  5011. 579.92 s [vector] generateM: OK (0.03s)
  5012. 579.92 s [vector] +++ OK, passed 100 tests.
  5013. 579.93 s [vector] replicateM: OK
  5014. 579.93 s [vector] +++ OK, passed 100 tests.
  5015. 579.94 s [vector] create: OK
  5016. 579.94 s [vector] +++ OK, passed 100 tests.
  5017. 579.94 s [vector] createT: OK
  5018. 579.94 s [vector] +++ OK, passed 100 tests.
  5019. 579.94 s [vector] unfoldr: OK
  5020. 579.94 s [vector] +++ OK, passed 100 tests.
  5021. 579.94 s [vector] unfoldrN: OK
  5022. 579.95 s [vector] +++ OK, passed 100 tests.
  5023. 579.95 s [vector] unfoldrExactN: OK
  5024. 579.95 s [vector] +++ OK, passed 100 tests.
  5025. 579.95 s [vector] unfoldrM: OK
  5026. 579.95 s [vector] +++ OK, passed 100 tests.
  5027. 579.95 s [vector] unfoldrNM: OK
  5028. 579.95 s [vector] +++ OK, passed 100 tests.
  5029. 579.98 s [vector] unfoldrExactNM: OK (0.04s)
  5030. 579.98 s [vector] +++ OK, passed 100 tests.
  5031. 579.99 s [vector] constructN: OK
  5032. 579.99 s [vector] +++ OK, passed 100 tests.
  5033. 580.00 s [vector] constructrN: OK
  5034. 580.00 s [vector] +++ OK, passed 100 tests.
  5035. 580.00 s [vector] cons: OK
  5036. 580.00 s [vector] +++ OK, passed 100 tests.
  5037. 580.00 s [vector] snoc: OK
  5038. 580.01 s [vector] +++ OK, passed 100 tests.
  5039. 580.01 s [vector] append: OK
  5040. 580.01 s [vector] +++ OK, passed 100 tests.
  5041. 580.02 s [vector] concat: OK (0.02s)
  5042. 580.03 s [vector] +++ OK, passed 100 tests.
  5043. 580.03 s [vector] force: OK
  5044. 580.03 s [vector] +++ OK, passed 100 tests.
  5045. 580.03 s [vector] upd: OK
  5046. 580.03 s [vector] +++ OK, passed 100 tests.
  5047. 580.04 s [vector] accum: OK
  5048. 580.04 s [vector] +++ OK, passed 100 tests.
  5049. 580.04 s [vector] reverse: OK
  5050. 580.04 s [vector] +++ OK, passed 100 tests.
  5051. 580.05 s [vector] backpermute: OK
  5052. 580.05 s [vector] +++ OK, passed 100 tests.
  5053. 580.05 s [vector] map: OK
  5054. 580.05 s [vector] +++ OK, passed 100 tests.
  5055. 580.05 s [vector] imap: OK
  5056. 580.05 s [vector] +++ OK, passed 100 tests.
  5057. 580.06 s [vector] concatMap: OK
  5058. 580.07 s [vector] +++ OK, passed 100 tests.
  5059. 580.07 s [vector] mapM: OK
  5060. 580.07 s [vector] +++ OK, passed 100 tests.
  5061. 580.09 s [vector] mapM_: OK (0.03s)
  5062. 580.09 s [vector] +++ OK, passed 100 tests.
  5063. 580.11 s [vector] forM: OK
  5064. 580.11 s [vector] +++ OK, passed 100 tests.
  5065. 580.12 s [vector] forM_: OK (0.03s)
  5066. 580.12 s [vector] +++ OK, passed 100 tests.
  5067. 580.12 s [vector] imapM: OK
  5068. 580.12 s [vector] +++ OK, passed 100 tests.
  5069. 580.15 s [vector] imapM_: OK (0.02s)
  5070. 580.15 s [vector] +++ OK, passed 100 tests.
  5071. 580.16 s [vector] zipWith: OK
  5072. 580.16 s [vector] +++ OK, passed 100 tests.
  5073. 580.17 s [vector] zipWith3: OK
  5074. 580.17 s [vector] +++ OK, passed 100 tests.
  5075. 580.18 s [vector] izipWith: OK
  5076. 580.18 s [vector] +++ OK, passed 100 tests.
  5077. 580.19 s [vector] izipWith3: OK
  5078. 580.19 s [vector] +++ OK, passed 100 tests.
  5079. 580.19 s [vector] izipWithM: OK
  5080. 580.19 s [vector] +++ OK, passed 100 tests.
  5081. 580.21 s [vector] izipWithM_: OK (0.02s)
  5082. 580.21 s [vector] +++ OK, passed 100 tests.
  5083. 580.21 s [vector] zipWithM: OK
  5084. 580.21 s [vector] +++ OK, passed 100 tests.
  5085. 580.24 s [vector] zipWithM_: OK
  5086. 580.24 s [vector] +++ OK, passed 100 tests.
  5087. 580.24 s [vector] filter: OK
  5088. 580.24 s [vector] +++ OK, passed 100 tests.
  5089. 580.24 s [vector] ifilter: OK
  5090. 580.24 s [vector] +++ OK, passed 100 tests.
  5091. 580.29 s [vector] filterM: OK (0.04s)
  5092. 580.29 s [vector] +++ OK, passed 100 tests.
  5093. 580.29 s [vector] uniq: OK
  5094. 580.29 s [vector] +++ OK, passed 100 tests.
  5095. 580.30 s [vector] mapMaybe: OK
  5096. 580.30 s [vector] +++ OK, passed 100 tests.
  5097. 580.30 s [vector] imapMaybe: OK
  5098. 580.30 s [vector] +++ OK, passed 100 tests.
  5099. 580.30 s [vector] takeWhile: OK
  5100. 580.31 s [vector] +++ OK, passed 100 tests.
  5101. 580.31 s [vector] dropWhile: OK
  5102. 580.31 s [vector] +++ OK, passed 100 tests.
  5103. 580.31 s [vector] partition: OK
  5104. 580.31 s [vector] +++ OK, passed 100 tests.
  5105. 580.31 s [vector] partitionWith: OK
  5106. 580.31 s [vector] +++ OK, passed 100 tests.
  5107. 580.31 s [vector] span: OK
  5108. 580.31 s [vector] +++ OK, passed 100 tests.
  5109. 580.32 s [vector] break: OK
  5110. 580.32 s [vector] +++ OK, passed 100 tests.
  5111. 580.32 s [vector] spanR: OK
  5112. 580.32 s [vector] +++ OK, passed 100 tests.
  5113. 580.32 s [vector] breakR: OK
  5114. 580.32 s [vector] +++ OK, passed 100 tests.
  5115. 580.32 s [vector] groupBy: OK
  5116. 580.32 s [vector] +++ OK, passed 100 tests.
  5117. 580.32 s [vector] elem: OK
  5118. 580.32 s [vector] +++ OK, passed 100 tests.
  5119. 580.32 s [vector] notElem: OK
  5120. 580.32 s [vector] +++ OK, passed 100 tests.
  5121. 580.33 s [vector] find: OK
  5122. 580.33 s [vector] +++ OK, passed 100 tests.
  5123. 580.33 s [vector] findIndex: OK
  5124. 580.33 s [vector] +++ OK, passed 100 tests.
  5125. 580.33 s [vector] findIndexR: OK
  5126. 580.33 s [vector] +++ OK, passed 100 tests.
  5127. 580.33 s [vector] findIndices: OK
  5128. 580.33 s [vector] +++ OK, passed 100 tests.
  5129. 580.33 s [vector] elemIndex: OK
  5130. 580.33 s [vector] +++ OK, passed 100 tests.
  5131. 580.33 s [vector] elemIndices: OK
  5132. 580.33 s [vector] +++ OK, passed 100 tests.
  5133. 580.34 s [vector] foldl: OK
  5134. 580.34 s [vector] +++ OK, passed 100 tests.
  5135. 580.35 s [vector] foldl1: OK
  5136. 580.35 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5137. 580.36 s [vector] foldl': OK
  5138. 580.37 s [vector] +++ OK, passed 100 tests.
  5139. 580.37 s [vector] foldl1': OK
  5140. 580.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5141. 580.38 s [vector] foldr: OK
  5142. 580.39 s [vector] +++ OK, passed 100 tests.
  5143. 580.39 s [vector] foldr1: OK
  5144. 580.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5145. 580.39 s [vector] foldr': OK
  5146. 580.39 s [vector] +++ OK, passed 100 tests.
  5147. 580.39 s [vector] foldr1': OK
  5148. 580.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5149. 580.39 s [vector] ifoldl: OK
  5150. 580.39 s [vector] +++ OK, passed 100 tests.
  5151. 580.41 s [vector] ifoldl': OK
  5152. 580.41 s [vector] +++ OK, passed 100 tests.
  5153. 580.41 s [vector] ifoldr: OK
  5154. 580.41 s [vector] +++ OK, passed 100 tests.
  5155. 580.42 s [vector] ifoldr': OK
  5156. 580.43 s [vector] +++ OK, passed 100 tests.
  5157. 580.43 s [vector] ifoldM: OK
  5158. 580.43 s [vector] +++ OK, passed 100 tests.
  5159. 580.45 s [vector] ifoldM': OK
  5160. 580.45 s [vector] +++ OK, passed 100 tests.
  5161. 580.47 s [vector] ifoldM_: OK (0.03s)
  5162. 580.47 s [vector] +++ OK, passed 100 tests.
  5163. 580.50 s [vector] ifoldM'_: OK (0.03s)
  5164. 580.50 s [vector] +++ OK, passed 100 tests.
  5165. 580.50 s [vector] all: OK
  5166. 580.50 s [vector] +++ OK, passed 100 tests.
  5167. 580.50 s [vector] any: OK
  5168. 580.50 s [vector] +++ OK, passed 100 tests.
  5169. 580.51 s [vector] prescanl: OK
  5170. 580.51 s [vector] +++ OK, passed 100 tests.
  5171. 580.52 s [vector] prescanl': OK
  5172. 580.52 s [vector] +++ OK, passed 100 tests.
  5173. 580.53 s [vector] postscanl: OK
  5174. 580.53 s [vector] +++ OK, passed 100 tests.
  5175. 580.53 s [vector] postscanl': OK
  5176. 580.53 s [vector] +++ OK, passed 100 tests.
  5177. 580.53 s [vector] scanl: OK
  5178. 580.53 s [vector] +++ OK, passed 100 tests.
  5179. 580.54 s [vector] scanl': OK
  5180. 580.54 s [vector] +++ OK, passed 100 tests.
  5181. 580.55 s [vector] scanl1: OK
  5182. 580.55 s [vector] +++ OK, passed 100 tests.
  5183. 580.56 s [vector] scanl1': OK
  5184. 580.56 s [vector] +++ OK, passed 100 tests.
  5185. 580.56 s [vector] iscanl: OK
  5186. 580.56 s [vector] +++ OK, passed 100 tests.
  5187. 580.57 s [vector] iscanl': OK
  5188. 580.57 s [vector] +++ OK, passed 100 tests.
  5189. 580.58 s [vector] prescanr: OK
  5190. 580.58 s [vector] +++ OK, passed 100 tests.
  5191. 580.59 s [vector] prescanr': OK
  5192. 580.59 s [vector] +++ OK, passed 100 tests.
  5193. 580.59 s [vector] postscanr: OK
  5194. 580.59 s [vector] +++ OK, passed 100 tests.
  5195. 580.61 s [vector] postscanr': OK
  5196. 580.61 s [vector] +++ OK, passed 100 tests.
  5197. 580.61 s [vector] scanr: OK
  5198. 580.61 s [vector] +++ OK, passed 100 tests.
  5199. 580.62 s [vector] scanr': OK
  5200. 580.62 s [vector] +++ OK, passed 100 tests.
  5201. 580.62 s [vector] scanr1: OK
  5202. 580.62 s [vector] +++ OK, passed 100 tests.
  5203. 580.63 s [vector] scanr1': OK
  5204. 580.63 s [vector] +++ OK, passed 100 tests.
  5205. 580.64 s [vector] iscanr: OK
  5206. 580.64 s [vector] +++ OK, passed 100 tests.
  5207. 580.64 s [vector] iscanr': OK
  5208. 580.64 s [vector] +++ OK, passed 100 tests.
  5209. 580.64 s [vector] mut_read: OK
  5210. 580.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5211. 580.65 s [vector] mut_write: OK
  5212. 580.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5213. 580.65 s [vector] mut_modify: OK
  5214. 580.65 s [vector] +++ OK, passed 100 tests; 25 discarded.
  5215. 580.65 s [vector] mut_generate: OK
  5216. 580.65 s [vector] +++ OK, passed 100 tests.
  5217. 580.67 s [vector] mut_generateM: OK (0.02s)
  5218. 580.67 s [vector] +++ OK, passed 100 tests.
  5219. 580.70 s [vector] mut_mapM_: OK (0.03s)
  5220. 580.70 s [vector] +++ OK, passed 100 tests.
  5221. 580.75 s [vector] mut_imapM_: OK (0.02s)
  5222. 580.75 s [vector] +++ OK, passed 100 tests.
  5223. 580.76 s [vector] mut_forM_: OK (0.03s)
  5224. 580.76 s [vector] +++ OK, passed 100 tests.
  5225. 580.80 s [vector] mut_iforM_: OK (0.02s)
  5226. 580.80 s [vector] +++ OK, passed 100 tests.
  5227. 580.80 s [vector] mut_foldr: OK
  5228. 580.80 s [vector] +++ OK, passed 100 tests.
  5229. 580.81 s [vector] mut_foldr': OK
  5230. 580.81 s [vector] +++ OK, passed 100 tests.
  5231. 580.82 s [vector] mut_foldl: OK
  5232. 580.82 s [vector] +++ OK, passed 100 tests.
  5233. 580.83 s [vector] mut_foldl': OK
  5234. 580.83 s [vector] +++ OK, passed 100 tests.
  5235. 580.83 s [vector] mut_ifoldr: OK
  5236. 580.83 s [vector] +++ OK, passed 100 tests.
  5237. 580.83 s [vector] mut_ifoldr': OK
  5238. 580.83 s [vector] +++ OK, passed 100 tests.
  5239. 580.85 s [vector] mut_ifoldl: OK
  5240. 580.85 s [vector] +++ OK, passed 100 tests.
  5241. 580.86 s [vector] mut_ifoldl': OK
  5242. 580.87 s [vector] +++ OK, passed 100 tests.
  5243. 580.87 s [vector] mut_foldM: OK
  5244. 580.87 s [vector] +++ OK, passed 100 tests.
  5245. 580.88 s [vector] mut_foldM': OK
  5246. 580.88 s [vector] +++ OK, passed 100 tests.
  5247. 580.88 s [vector] mut_foldrM: OK
  5248. 580.89 s [vector] +++ OK, passed 100 tests.
  5249. 580.89 s [vector] mut_foldrM': OK
  5250. 580.89 s [vector] +++ OK, passed 100 tests.
  5251. 580.89 s [vector] mut_ifoldM: OK
  5252. 580.89 s [vector] +++ OK, passed 100 tests.
  5253. 580.91 s [vector] mut_ifoldM': OK
  5254. 580.91 s [vector] +++ OK, passed 100 tests.
  5255. 580.92 s [vector] mut_ifoldrM: OK
  5256. 580.92 s [vector] +++ OK, passed 100 tests.
  5257. 580.92 s [vector] mut_ifoldrM': OK
  5258. 580.92 s [vector] +++ OK, passed 100 tests.
  5259. 580.92 s [vector] compare: OK
  5260. 580.92 s [vector] +++ OK, passed 100 tests.
  5261. 580.92 s [vector] maximum: OK
  5262. 580.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5263. 580.92 s [vector] minimum: OK
  5264. 580.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5265. 580.92 s [vector] minIndex: OK
  5266. 580.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5267. 580.93 s [vector] maxIndex: OK
  5268. 580.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5269. 580.93 s [vector] maximumBy: OK
  5270. 580.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5271. 580.93 s [vector] minimumBy: OK
  5272. 580.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5273. 580.93 s [vector] maximumOn: OK
  5274. 580.93 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5275. 580.93 s [vector] minimumOn: OK
  5276. 580.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5277. 580.93 s [vector] maxIndexBy: OK
  5278. 580.93 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5279. 580.93 s [vector] minIndexBy: OK
  5280. 580.93 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5281. 580.93 s [vector] ListFirstMaxIndexWins: OK
  5282. 580.93 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5283. 580.93 s [vector] FalseListFirstMaxIndexWins: OK
  5284. 580.93 s [vector] +++ OK, failed as expected. (after 1 test):
  5285. 580.93 s [vector] Exception:
  5286. 580.93 s [vector] Prelude.foldr1: empty list
  5287. 580.93 s [vector] CallStack (from HasCallStack):
  5288. 580.93 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  5289. 580.93 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  5290. 580.93 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5291. 580.93 s [vector] []
  5292. 580.93 s [vector] zip: OK
  5293. 580.93 s [vector] +++ OK, passed 100 tests.
  5294. 580.94 s [vector] zip3: OK
  5295. 580.94 s [vector] +++ OK, passed 100 tests.
  5296. 580.94 s [vector] unzip: OK
  5297. 580.94 s [vector] +++ OK, passed 100 tests.
  5298. 580.94 s [vector] unzip3: OK
  5299. 580.94 s [vector] +++ OK, passed 100 tests.
  5300. 580.94 s [vector] indexed: OK
  5301. 580.94 s [vector] +++ OK, passed 100 tests.
  5302. 580.94 s [vector] update: OK
  5303. 580.94 s [vector] +++ OK, passed 100 tests.
  5304. 580.95 s [vector] mempty: OK
  5305. 580.95 s [vector] +++ OK, passed 100 tests.
  5306. 580.95 s [vector] mappend: OK
  5307. 580.95 s [vector] +++ OK, passed 100 tests.
  5308. 580.97 s [vector] mconcat: OK (0.02s)
  5309. 580.97 s [vector] +++ OK, passed 100 tests.
  5310. 580.97 s [vector] glength: OK
  5311. 580.97 s [vector] +++ OK, passed 100 tests.
  5312. 580.97 s [vector] sum: OK
  5313. 580.97 s [vector] +++ OK, passed 100 tests.
  5314. 580.97 s [vector] product: OK
  5315. 580.97 s [vector] +++ OK, passed 100 tests.
  5316. 580.97 s [vector] enumFromN: OK
  5317. 580.97 s [vector] +++ OK, passed 100 tests.
  5318. 580.97 s [vector] enumFromThenN: OK
  5319. 580.97 s [vector] +++ OK, passed 100 tests.
  5320. 580.97 s [vector] enumFromTo: OK
  5321. 580.97 s [vector] +++ OK, passed 100 tests.
  5322. 580.97 s [vector] enumFromThenTo: OK
  5323. 580.97 s [vector] +++ OK, passed 100 tests; 2 discarded.
  5324. 580.97 s [vector] (Double)
  5325. 580.97 s [vector] fromList.toList == id: OK
  5326. 580.97 s [vector] +++ OK, passed 100 tests.
  5327. 580.97 s [vector] toList.fromList == id: OK
  5328. 580.97 s [vector] +++ OK, passed 100 tests.
  5329. 580.97 s [vector] unstream.stream == id: OK
  5330. 580.97 s [vector] +++ OK, passed 100 tests.
  5331. 580.98 s [vector] stream.unstream == id: OK
  5332. 580.98 s [vector] +++ OK, passed 100 tests.
  5333. 580.98 s [vector] eq: OK
  5334. 580.98 s [vector] +++ OK, passed 100 tests.
  5335. 580.98 s [vector] length: OK
  5336. 580.98 s [vector] +++ OK, passed 100 tests.
  5337. 580.98 s [vector] null: OK
  5338. 580.98 s [vector] +++ OK, passed 100 tests.
  5339. 580.98 s [vector] index: OK
  5340. 580.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5341. 580.98 s [vector] safeIndex: OK
  5342. 580.98 s [vector] +++ OK, passed 100 tests.
  5343. 580.98 s [vector] head: OK
  5344. 580.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5345. 580.98 s [vector] last: OK
  5346. 580.98 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5347. 580.98 s [vector] unsafeIndex: OK
  5348. 580.98 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5349. 580.98 s [vector] unsafeHead: OK
  5350. 580.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5351. 580.98 s [vector] unsafeLast: OK
  5352. 580.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5353. 580.99 s [vector] slice: OK
  5354. 580.99 s [vector] +++ OK, passed 100 tests.
  5355. 580.99 s [vector] init: OK
  5356. 580.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5357. 580.99 s [vector] tail: OK
  5358. 580.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5359. 580.99 s [vector] take: OK
  5360. 580.99 s [vector] +++ OK, passed 100 tests.
  5361. 580.99 s [vector] drop: OK
  5362. 580.99 s [vector] +++ OK, passed 100 tests.
  5363. 580.99 s [vector] splitAt: OK
  5364. 580.99 s [vector] +++ OK, passed 100 tests.
  5365. 580.99 s [vector] empty: OK
  5366. 580.99 s [vector] +++ OK, passed 100 tests.
  5367. 580.99 s [vector] singleton: OK
  5368. 580.99 s [vector] +++ OK, passed 100 tests.
  5369. 580.99 s [vector] replicate: OK
  5370. 580.99 s [vector] +++ OK, passed 100 tests.
  5371. 580.99 s [vector] generate: OK
  5372. 580.99 s [vector] +++ OK, passed 100 tests.
  5373. 580.99 s [vector] iterateN: OK
  5374. 580.99 s [vector] +++ OK, passed 100 tests.
  5375. 581.02 s [vector] iterateNM: OK (0.03s)
  5376. 581.02 s [vector] +++ OK, passed 100 tests.
  5377. 581.05 s [vector] generateM: OK (0.01s)
  5378. 581.05 s [vector] +++ OK, passed 100 tests.
  5379. 581.06 s [vector] replicateM: OK (0.02s)
  5380. 581.06 s [vector] +++ OK, passed 100 tests.
  5381. 581.06 s [vector] create: OK
  5382. 581.06 s [vector] +++ OK, passed 100 tests.
  5383. 581.06 s [vector] createT: OK
  5384. 581.06 s [vector] +++ OK, passed 100 tests.
  5385. 581.07 s [vector] unfoldr: OK
  5386. 581.07 s [vector] +++ OK, passed 100 tests.
  5387. 581.07 s [vector] unfoldrN: OK
  5388. 581.07 s [vector] +++ OK, passed 100 tests.
  5389. 581.07 s [vector] unfoldrExactN: OK
  5390. 581.07 s [vector] +++ OK, passed 100 tests.
  5391. 581.07 s [vector] unfoldrM: OK
  5392. 581.07 s [vector] +++ OK, passed 100 tests.
  5393. 581.07 s [vector] unfoldrNM: OK
  5394. 581.07 s [vector] +++ OK, passed 100 tests.
  5395. 581.09 s [vector] unfoldrExactNM: OK
  5396. 581.09 s [vector] +++ OK, passed 100 tests.
  5397. 581.11 s [vector] constructN: OK (0.01s)
  5398. 581.11 s [vector] +++ OK, passed 100 tests.
  5399. 581.11 s [vector] constructrN: OK (0.01s)
  5400. 581.11 s [vector] +++ OK, passed 100 tests.
  5401. 581.12 s [vector] cons: OK
  5402. 581.12 s [vector] +++ OK, passed 100 tests.
  5403. 581.12 s [vector] snoc: OK
  5404. 581.12 s [vector] +++ OK, passed 100 tests.
  5405. 581.12 s [vector] append: OK
  5406. 581.12 s [vector] +++ OK, passed 100 tests.
  5407. 581.14 s [vector] concat: OK (0.01s)
  5408. 581.14 s [vector] +++ OK, passed 100 tests.
  5409. 581.14 s [vector] force: OK
  5410. 581.14 s [vector] +++ OK, passed 100 tests.
  5411. 581.15 s [vector] upd: OK
  5412. 581.15 s [vector] +++ OK, passed 100 tests.
  5413. 581.16 s [vector] accum: OK (0.01s)
  5414. 581.16 s [vector] +++ OK, passed 100 tests.
  5415. 581.16 s [vector] reverse: OK
  5416. 581.16 s [vector] +++ OK, passed 100 tests.
  5417. 581.17 s [vector] backpermute: OK
  5418. 581.17 s [vector] +++ OK, passed 100 tests.
  5419. 581.17 s [vector] map: OK
  5420. 581.17 s [vector] +++ OK, passed 100 tests.
  5421. 581.18 s [vector] imap: OK
  5422. 581.19 s [vector] +++ OK, passed 100 tests.
  5423. 581.19 s [vector] concatMap: OK
  5424. 581.21 s [vector] +++ OK, passed 100 tests.
  5425. 581.21 s [vector] mapM: OK
  5426. 581.21 s [vector] +++ OK, passed 100 tests.
  5427. 581.23 s [vector] mapM_: OK (0.03s)
  5428. 581.23 s [vector] +++ OK, passed 100 tests.
  5429. 581.25 s [vector] forM: OK
  5430. 581.25 s [vector] +++ OK, passed 100 tests.
  5431. 581.28 s [vector] forM_: OK (0.04s)
  5432. 581.28 s [vector] +++ OK, passed 100 tests.
  5433. 581.29 s [vector] imapM: OK
  5434. 581.29 s [vector] +++ OK, passed 100 tests.
  5435. 581.32 s [vector] imapM_: OK (0.03s)
  5436. 581.32 s [vector] +++ OK, passed 100 tests.
  5437. 581.32 s [vector] zipWith: OK
  5438. 581.32 s [vector] +++ OK, passed 100 tests.
  5439. 581.33 s [vector] zipWith3: OK
  5440. 581.33 s [vector] +++ OK, passed 100 tests.
  5441. 581.35 s [vector] izipWith: OK (0.01s)
  5442. 581.35 s [vector] +++ OK, passed 100 tests.
  5443. 581.36 s [vector] izipWith3: OK (0.01s)
  5444. 581.37 s [vector] +++ OK, passed 100 tests.
  5445. 581.37 s [vector] izipWithM: OK
  5446. 581.37 s [vector] +++ OK, passed 100 tests.
  5447. 581.39 s [vector] izipWithM_: OK (0.02s)
  5448. 581.39 s [vector] +++ OK, passed 100 tests.
  5449. 581.41 s [vector] zipWithM: OK
  5450. 581.41 s [vector] +++ OK, passed 100 tests.
  5451. 581.43 s [vector] zipWithM_: OK (0.03s)
  5452. 581.43 s [vector] +++ OK, passed 100 tests.
  5453. 581.43 s [vector] filter: OK
  5454. 581.43 s [vector] +++ OK, passed 100 tests.
  5455. 581.45 s [vector] ifilter: OK
  5456. 581.45 s [vector] +++ OK, passed 100 tests.
  5457. 581.47 s [vector] filterM: OK (0.04s)
  5458. 581.47 s [vector] +++ OK, passed 100 tests.
  5459. 581.48 s [vector] uniq: OK
  5460. 581.48 s [vector] +++ OK, passed 100 tests.
  5461. 581.49 s [vector] mapMaybe: OK
  5462. 581.49 s [vector] +++ OK, passed 100 tests.
  5463. 581.49 s [vector] imapMaybe: OK
  5464. 581.49 s [vector] +++ OK, passed 100 tests.
  5465. 581.49 s [vector] takeWhile: OK
  5466. 581.49 s [vector] +++ OK, passed 100 tests.
  5467. 581.49 s [vector] dropWhile: OK
  5468. 581.49 s [vector] +++ OK, passed 100 tests.
  5469. 581.50 s [vector] partition: OK
  5470. 581.50 s [vector] +++ OK, passed 100 tests.
  5471. 581.50 s [vector] partitionWith: OK
  5472. 581.50 s [vector] +++ OK, passed 100 tests.
  5473. 581.50 s [vector] span: OK
  5474. 581.50 s [vector] +++ OK, passed 100 tests.
  5475. 581.51 s [vector] break: OK
  5476. 581.51 s [vector] +++ OK, passed 100 tests.
  5477. 581.51 s [vector] spanR: OK
  5478. 581.51 s [vector] +++ OK, passed 100 tests.
  5479. 581.51 s [vector] breakR: OK
  5480. 581.51 s [vector] +++ OK, passed 100 tests.
  5481. 581.52 s [vector] groupBy: OK
  5482. 581.52 s [vector] +++ OK, passed 100 tests.
  5483. 581.52 s [vector] elem: OK
  5484. 581.52 s [vector] +++ OK, passed 100 tests.
  5485. 581.52 s [vector] notElem: OK
  5486. 581.52 s [vector] +++ OK, passed 100 tests.
  5487. 581.52 s [vector] find: OK
  5488. 581.52 s [vector] +++ OK, passed 100 tests.
  5489. 581.52 s [vector] findIndex: OK
  5490. 581.52 s [vector] +++ OK, passed 100 tests.
  5491. 581.53 s [vector] findIndexR: OK
  5492. 581.53 s [vector] +++ OK, passed 100 tests.
  5493. 581.53 s [vector] findIndices: OK
  5494. 581.53 s [vector] +++ OK, passed 100 tests.
  5495. 581.53 s [vector] elemIndex: OK
  5496. 581.53 s [vector] +++ OK, passed 100 tests.
  5497. 581.53 s [vector] elemIndices: OK
  5498. 581.53 s [vector] +++ OK, passed 100 tests.
  5499. 581.55 s [vector] foldl: OK (0.01s)
  5500. 581.55 s [vector] +++ OK, passed 100 tests.
  5501. 581.56 s [vector] foldl1: OK (0.01s)
  5502. 581.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5503. 581.56 s [vector] foldl': OK (0.01s)
  5504. 581.56 s [vector] +++ OK, passed 100 tests.
  5505. 581.58 s [vector] foldl1': OK
  5506. 581.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5507. 581.59 s [vector] foldr: OK (0.01s)
  5508. 581.59 s [vector] +++ OK, passed 100 tests.
  5509. 581.60 s [vector] foldr1: OK (0.01s)
  5510. 581.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5511. 581.61 s [vector] foldr': OK (0.01s)
  5512. 581.61 s [vector] +++ OK, passed 100 tests.
  5513. 581.63 s [vector] foldr1': OK (0.01s)
  5514. 581.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5515. 581.63 s [vector] ifoldl: OK (0.01s)
  5516. 581.63 s [vector] +++ OK, passed 100 tests.
  5517. 581.64 s [vector] ifoldl': OK
  5518. 581.64 s [vector] +++ OK, passed 100 tests.
  5519. 581.65 s [vector] ifoldr: OK (0.01s)
  5520. 581.65 s [vector] +++ OK, passed 100 tests.
  5521. 581.66 s [vector] ifoldr': OK
  5522. 581.66 s [vector] +++ OK, passed 100 tests.
  5523. 581.69 s [vector] ifoldM: OK
  5524. 581.69 s [vector] +++ OK, passed 100 tests.
  5525. 581.69 s [vector] ifoldM': OK (0.01s)
  5526. 581.69 s [vector] +++ OK, passed 100 tests.
  5527. 581.73 s [vector] ifoldM_: OK (0.03s)
  5528. 581.73 s [vector] +++ OK, passed 100 tests.
  5529. 581.75 s [vector] ifoldM'_: OK (0.03s)
  5530. 581.75 s [vector] +++ OK, passed 100 tests.
  5531. 581.76 s [vector] all: OK
  5532. 581.76 s [vector] +++ OK, passed 100 tests.
  5533. 581.77 s [vector] any: OK
  5534. 581.77 s [vector] +++ OK, passed 100 tests.
  5535. 581.77 s [vector] prescanl: OK (0.01s)
  5536. 581.77 s [vector] +++ OK, passed 100 tests.
  5537. 581.79 s [vector] prescanl': OK (0.01s)
  5538. 581.79 s [vector] +++ OK, passed 100 tests.
  5539. 581.79 s [vector] postscanl: OK (0.01s)
  5540. 581.79 s [vector] +++ OK, passed 100 tests.
  5541. 581.80 s [vector] postscanl': OK (0.01s)
  5542. 581.80 s [vector] +++ OK, passed 100 tests.
  5543. 581.81 s [vector] scanl: OK
  5544. 581.81 s [vector] +++ OK, passed 100 tests.
  5545. 581.83 s [vector] scanl': OK
  5546. 581.83 s [vector] +++ OK, passed 100 tests.
  5547. 581.83 s [vector] scanl1: OK (0.01s)
  5548. 581.83 s [vector] +++ OK, passed 100 tests.
  5549. 581.84 s [vector] scanl1': OK
  5550. 581.84 s [vector] +++ OK, passed 100 tests.
  5551. 581.86 s [vector] iscanl: OK (0.01s)
  5552. 581.86 s [vector] +++ OK, passed 100 tests.
  5553. 581.86 s [vector] iscanl': OK (0.01s)
  5554. 581.86 s [vector] +++ OK, passed 100 tests.
  5555. 581.87 s [vector] prescanr: OK
  5556. 581.87 s [vector] +++ OK, passed 100 tests.
  5557. 581.89 s [vector] prescanr': OK (0.01s)
  5558. 581.89 s [vector] +++ OK, passed 100 tests.
  5559. 581.91 s [vector] postscanr: OK (0.01s)
  5560. 581.91 s [vector] +++ OK, passed 100 tests.
  5561. 581.91 s [vector] postscanr': OK
  5562. 581.91 s [vector] +++ OK, passed 100 tests.
  5563. 581.93 s [vector] scanr: OK (0.01s)
  5564. 581.93 s [vector] +++ OK, passed 100 tests.
  5565. 581.93 s [vector] scanr': OK (0.01s)
  5566. 581.93 s [vector] +++ OK, passed 100 tests.
  5567. 581.94 s [vector] scanr1: OK
  5568. 581.94 s [vector] +++ OK, passed 100 tests.
  5569. 581.95 s [vector] scanr1': OK
  5570. 581.95 s [vector] +++ OK, passed 100 tests.
  5571. 581.97 s [vector] iscanr: OK (0.01s)
  5572. 581.97 s [vector] +++ OK, passed 100 tests.
  5573. 581.97 s [vector] iscanr': OK (0.01s)
  5574. 581.97 s [vector] +++ OK, passed 100 tests.
  5575. 581.97 s [vector] mut_read: OK
  5576. 581.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5577. 581.98 s [vector] mut_write: OK
  5578. 581.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5579. 581.98 s [vector] mut_modify: OK
  5580. 581.98 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5581. 581.98 s [vector] mut_generate: OK
  5582. 581.99 s [vector] +++ OK, passed 100 tests.
  5583. 582.01 s [vector] mut_generateM: OK (0.01s)
  5584. 582.01 s [vector] +++ OK, passed 100 tests.
  5585. 582.03 s [vector] mut_mapM_: OK (0.03s)
  5586. 582.03 s [vector] +++ OK, passed 100 tests.
  5587. 582.07 s [vector] mut_imapM_: OK (0.03s)
  5588. 582.07 s [vector] +++ OK, passed 100 tests.
  5589. 582.11 s [vector] mut_forM_: OK (0.04s)
  5590. 582.11 s [vector] +++ OK, passed 100 tests.
  5591. 582.12 s [vector] mut_iforM_: OK (0.03s)
  5592. 582.12 s [vector] +++ OK, passed 100 tests.
  5593. 582.13 s [vector] mut_foldr: OK
  5594. 582.13 s [vector] +++ OK, passed 100 tests.
  5595. 582.15 s [vector] mut_foldr': OK
  5596. 582.15 s [vector] +++ OK, passed 100 tests.
  5597. 582.17 s [vector] mut_foldl: OK (0.01s)
  5598. 582.17 s [vector] +++ OK, passed 100 tests.
  5599. 582.17 s [vector] mut_foldl': OK
  5600. 582.17 s [vector] +++ OK, passed 100 tests.
  5601. 582.19 s [vector] mut_ifoldr: OK
  5602. 582.19 s [vector] +++ OK, passed 100 tests.
  5603. 582.20 s [vector] mut_ifoldr': OK (0.01s)
  5604. 582.20 s [vector] +++ OK, passed 100 tests.
  5605. 582.20 s [vector] mut_ifoldl: OK (0.01s)
  5606. 582.20 s [vector] +++ OK, passed 100 tests.
  5607. 582.22 s [vector] mut_ifoldl': OK
  5608. 582.22 s [vector] +++ OK, passed 100 tests.
  5609. 582.23 s [vector] mut_foldM: OK (0.01s)
  5610. 582.23 s [vector] +++ OK, passed 100 tests.
  5611. 582.25 s [vector] mut_foldM': OK (0.01s)
  5612. 582.25 s [vector] +++ OK, passed 100 tests.
  5613. 582.25 s [vector] mut_foldrM: OK (0.01s)
  5614. 582.25 s [vector] +++ OK, passed 100 tests.
  5615. 582.27 s [vector] mut_foldrM': OK
  5616. 582.27 s [vector] +++ OK, passed 100 tests.
  5617. 582.27 s [vector] mut_ifoldM: OK (0.01s)
  5618. 582.27 s [vector] +++ OK, passed 100 tests.
  5619. 582.29 s [vector] mut_ifoldM': OK
  5620. 582.29 s [vector] +++ OK, passed 100 tests.
  5621. 582.30 s [vector] mut_ifoldrM: OK (0.01s)
  5622. 582.30 s [vector] +++ OK, passed 100 tests.
  5623. 582.31 s [vector] mut_ifoldrM': OK
  5624. 582.31 s [vector] +++ OK, passed 100 tests.
  5625. 582.31 s [vector] compare: OK
  5626. 582.31 s [vector] +++ OK, passed 100 tests.
  5627. 582.31 s [vector] maximum: OK
  5628. 582.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5629. 582.31 s [vector] minimum: OK
  5630. 582.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5631. 582.31 s [vector] minIndex: OK
  5632. 582.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5633. 582.31 s [vector] maxIndex: OK
  5634. 582.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5635. 582.31 s [vector] maximumBy: OK
  5636. 582.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5637. 582.31 s [vector] minimumBy: OK
  5638. 582.31 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5639. 582.31 s [vector] maximumOn: OK
  5640. 582.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5641. 582.31 s [vector] minimumOn: OK
  5642. 582.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5643. 582.32 s [vector] maxIndexBy: OK
  5644. 582.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5645. 582.32 s [vector] minIndexBy: OK
  5646. 582.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5647. 582.32 s [vector] ListFirstMaxIndexWins: OK
  5648. 582.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5649. 582.32 s [vector] FalseListFirstMaxIndexWins: OK
  5650. 582.32 s [vector] +++ OK, failed as expected. (after 1 test):
  5651. 582.32 s [vector] Exception:
  5652. 582.32 s [vector] Prelude.foldr1: empty list
  5653. 582.32 s [vector] CallStack (from HasCallStack):
  5654. 582.32 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  5655. 582.32 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  5656. 582.32 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5657. 582.32 s [vector] []
  5658. 582.32 s [vector] zip: OK
  5659. 582.32 s [vector] +++ OK, passed 100 tests.
  5660. 582.32 s [vector] zip3: OK
  5661. 582.32 s [vector] +++ OK, passed 100 tests.
  5662. 582.32 s [vector] unzip: OK
  5663. 582.32 s [vector] +++ OK, passed 100 tests.
  5664. 582.33 s [vector] unzip3: OK
  5665. 582.33 s [vector] +++ OK, passed 100 tests.
  5666. 582.33 s [vector] indexed: OK
  5667. 582.33 s [vector] +++ OK, passed 100 tests.
  5668. 582.33 s [vector] update: OK
  5669. 582.33 s [vector] +++ OK, passed 100 tests.
  5670. 582.33 s [vector] mempty: OK
  5671. 582.33 s [vector] +++ OK, passed 100 tests.
  5672. 582.35 s [vector] mappend: OK
  5673. 582.35 s [vector] +++ OK, passed 100 tests.
  5674. 582.35 s [vector] mconcat: OK (0.02s)
  5675. 582.35 s [vector] +++ OK, passed 100 tests.
  5676. 582.36 s [vector] glength: OK
  5677. 582.36 s [vector] +++ OK, passed 100 tests.
  5678. 582.36 s [vector] sum: OK
  5679. 582.36 s [vector] +++ OK, passed 100 tests.
  5680. 582.36 s [vector] product: OK
  5681. 582.36 s [vector] +++ OK, passed 100 tests.
  5682. 582.36 s [vector] enumFromN: OK
  5683. 582.36 s [vector] +++ OK, passed 100 tests.
  5684. 582.36 s [vector] enumFromThenN: OK
  5685. 582.36 s [vector] +++ OK, passed 100 tests.
  5686. 582.36 s [vector] enumFromTo: OK
  5687. 582.36 s [vector] +++ OK, passed 100 tests.
  5688. 582.36 s [vector] enumFromThenTo: OK
  5689. 582.36 s [vector] +++ OK, passed 100 tests.
  5690. 582.36 s [vector] (Int,Bool)
  5691. 582.36 s [vector] fromList.toList == id: OK
  5692. 582.36 s [vector] +++ OK, passed 100 tests.
  5693. 582.36 s [vector] toList.fromList == id: OK
  5694. 582.36 s [vector] +++ OK, passed 100 tests.
  5695. 582.37 s [vector] unstream.stream == id: OK
  5696. 582.37 s [vector] +++ OK, passed 100 tests.
  5697. 582.37 s [vector] stream.unstream == id: OK
  5698. 582.37 s [vector] +++ OK, passed 100 tests.
  5699. 582.37 s [vector] eq: OK
  5700. 582.37 s [vector] +++ OK, passed 100 tests.
  5701. 582.37 s [vector] length: OK
  5702. 582.37 s [vector] +++ OK, passed 100 tests.
  5703. 582.37 s [vector] null: OK
  5704. 582.37 s [vector] +++ OK, passed 100 tests.
  5705. 582.37 s [vector] index: OK
  5706. 582.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5707. 582.37 s [vector] safeIndex: OK
  5708. 582.37 s [vector] +++ OK, passed 100 tests.
  5709. 582.37 s [vector] head: OK
  5710. 582.37 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5711. 582.37 s [vector] last: OK
  5712. 582.37 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5713. 582.37 s [vector] unsafeIndex: OK
  5714. 582.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5715. 582.37 s [vector] unsafeHead: OK
  5716. 582.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5717. 582.37 s [vector] unsafeLast: OK
  5718. 582.37 s [vector] +++ OK, passed 100 tests; 25 discarded.
  5719. 582.38 s [vector] slice: OK
  5720. 582.38 s [vector] +++ OK, passed 100 tests.
  5721. 582.38 s [vector] init: OK
  5722. 582.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5723. 582.38 s [vector] tail: OK
  5724. 582.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5725. 582.38 s [vector] take: OK
  5726. 582.38 s [vector] +++ OK, passed 100 tests.
  5727. 582.38 s [vector] drop: OK
  5728. 582.38 s [vector] +++ OK, passed 100 tests.
  5729. 582.38 s [vector] splitAt: OK
  5730. 582.38 s [vector] +++ OK, passed 100 tests.
  5731. 582.38 s [vector] empty: OK
  5732. 582.38 s [vector] +++ OK, passed 100 tests.
  5733. 582.38 s [vector] singleton: OK
  5734. 582.38 s [vector] +++ OK, passed 100 tests.
  5735. 582.38 s [vector] replicate: OK
  5736. 582.38 s [vector] +++ OK, passed 100 tests.
  5737. 582.39 s [vector] generate: OK
  5738. 582.39 s [vector] +++ OK, passed 100 tests.
  5739. 582.39 s [vector] iterateN: OK
  5740. 582.39 s [vector] +++ OK, passed 100 tests.
  5741. 582.43 s [vector] iterateNM: OK (0.03s)
  5742. 582.43 s [vector] +++ OK, passed 100 tests.
  5743. 582.47 s [vector] generateM: OK (0.04s)
  5744. 582.47 s [vector] +++ OK, passed 100 tests.
  5745. 582.47 s [vector] replicateM: OK (0.01s)
  5746. 582.47 s [vector] +++ OK, passed 100 tests.
  5747. 582.48 s [vector] create: OK
  5748. 582.48 s [vector] +++ OK, passed 100 tests.
  5749. 582.48 s [vector] createT: OK
  5750. 582.48 s [vector] +++ OK, passed 100 tests.
  5751. 582.48 s [vector] unfoldr: OK
  5752. 582.48 s [vector] +++ OK, passed 100 tests.
  5753. 582.48 s [vector] unfoldrN: OK
  5754. 582.48 s [vector] +++ OK, passed 100 tests.
  5755. 582.48 s [vector] unfoldrExactN: OK
  5756. 582.48 s [vector] +++ OK, passed 100 tests.
  5757. 582.48 s [vector] unfoldrM: OK
  5758. 582.48 s [vector] +++ OK, passed 100 tests.
  5759. 582.48 s [vector] unfoldrNM: OK
  5760. 582.48 s [vector] +++ OK, passed 100 tests.
  5761. 582.53 s [vector] unfoldrExactNM: OK (0.03s)
  5762. 582.53 s [vector] +++ OK, passed 100 tests.
  5763. 582.54 s [vector] constructN: OK
  5764. 582.54 s [vector] +++ OK, passed 100 tests.
  5765. 582.54 s [vector] constructrN: OK
  5766. 582.54 s [vector] +++ OK, passed 100 tests.
  5767. 582.54 s [vector] cons: OK
  5768. 582.54 s [vector] +++ OK, passed 100 tests.
  5769. 582.54 s [vector] snoc: OK
  5770. 582.54 s [vector] +++ OK, passed 100 tests.
  5771. 582.54 s [vector] append: OK
  5772. 582.55 s [vector] +++ OK, passed 100 tests.
  5773. 582.58 s [vector] concat: OK (0.03s)
  5774. 582.58 s [vector] +++ OK, passed 100 tests.
  5775. 582.58 s [vector] force: OK
  5776. 582.58 s [vector] +++ OK, passed 100 tests.
  5777. 582.58 s [vector] upd: OK
  5778. 582.58 s [vector] +++ OK, passed 100 tests.
  5779. 582.59 s [vector] accum: OK
  5780. 582.59 s [vector] +++ OK, passed 100 tests.
  5781. 582.59 s [vector] reverse: OK
  5782. 582.59 s [vector] +++ OK, passed 100 tests.
  5783. 582.59 s [vector] backpermute: OK
  5784. 582.59 s [vector] +++ OK, passed 100 tests.
  5785. 582.60 s [vector] map: OK
  5786. 582.60 s [vector] +++ OK, passed 100 tests.
  5787. 582.60 s [vector] imap: OK
  5788. 582.61 s [vector] +++ OK, passed 100 tests.
  5789. 582.61 s [vector] concatMap: OK
  5790. 582.61 s [vector] +++ OK, passed 100 tests.
  5791. 582.61 s [vector] mapM: OK
  5792. 582.61 s [vector] +++ OK, passed 100 tests.
  5793. 582.64 s [vector] mapM_: OK (0.01s)
  5794. 582.64 s [vector] +++ OK, passed 100 tests.
  5795. 582.65 s [vector] forM: OK
  5796. 582.65 s [vector] +++ OK, passed 100 tests.
  5797. 582.67 s [vector] forM_: OK (0.03s)
  5798. 582.67 s [vector] +++ OK, passed 100 tests.
  5799. 582.69 s [vector] imapM: OK
  5800. 582.69 s [vector] +++ OK, passed 100 tests.
  5801. 582.70 s [vector] imapM_: OK (0.03s)
  5802. 582.70 s [vector] +++ OK, passed 100 tests.
  5803. 582.71 s [vector] zipWith: OK
  5804. 582.71 s [vector] +++ OK, passed 100 tests.
  5805. 582.71 s [vector] zipWith3: OK
  5806. 582.71 s [vector] +++ OK, passed 100 tests.
  5807. 582.72 s [vector] izipWith: OK
  5808. 582.72 s [vector] +++ OK, passed 100 tests.
  5809. 582.72 s [vector] izipWith3: OK
  5810. 582.72 s [vector] +++ OK, passed 100 tests.
  5811. 582.73 s [vector] izipWithM: OK
  5812. 582.73 s [vector] +++ OK, passed 100 tests.
  5813. 582.76 s [vector] izipWithM_: OK (0.02s)
  5814. 583.05 s [vector] +++ OK, passed 100 tests.
  5815. 583.05 s [vector] zipWithM: OK
  5816. 583.05 s [vector] +++ OK, passed 100 tests.
  5817. 583.05 s [vector] zipWithM_: OK (0.01s)
  5818. 583.05 s [vector] +++ OK, passed 100 tests.
  5819. 583.05 s [vector] filter: OK
  5820. 583.05 s [vector] +++ OK, passed 100 tests.
  5821. 583.05 s [vector] ifilter: OK
  5822. 583.05 s [vector] +++ OK, passed 100 tests.
  5823. 583.05 s [vector] filterM: OK (0.04s)
  5824. 583.05 s [vector] +++ OK, passed 100 tests.
  5825. 583.05 s [vector] uniq: OK
  5826. 583.05 s [vector] +++ OK, passed 100 tests.
  5827. 583.05 s [vector] mapMaybe: OK
  5828. 583.06 s [vector] +++ OK, passed 100 tests.
  5829. 583.06 s [vector] imapMaybe: OK
  5830. 583.06 s [vector] +++ OK, passed 100 tests.
  5831. 583.06 s [vector] takeWhile: OK
  5832. 583.06 s [vector] +++ OK, passed 100 tests.
  5833. 583.06 s [vector] dropWhile: OK
  5834. 583.06 s [vector] +++ OK, passed 100 tests.
  5835. 583.06 s [vector] partition: OK
  5836. 583.06 s [vector] +++ OK, passed 100 tests.
  5837. 583.06 s [vector] partitionWith: OK
  5838. 583.06 s [vector] +++ OK, passed 100 tests.
  5839. 583.06 s [vector] span: OK
  5840. 583.06 s [vector] +++ OK, passed 100 tests.
  5841. 583.06 s [vector] break: OK
  5842. 583.06 s [vector] +++ OK, passed 100 tests.
  5843. 583.06 s [vector] spanR: OK
  5844. 583.06 s [vector] +++ OK, passed 100 tests.
  5845. 583.06 s [vector] breakR: OK
  5846. 583.06 s [vector] +++ OK, passed 100 tests.
  5847. 583.06 s [vector] groupBy: OK
  5848. 583.06 s [vector] +++ OK, passed 100 tests.
  5849. 583.06 s [vector] elem: OK
  5850. 583.06 s [vector] +++ OK, passed 100 tests.
  5851. 583.06 s [vector] notElem: OK
  5852. 583.06 s [vector] +++ OK, passed 100 tests.
  5853. 583.06 s [vector] find: OK
  5854. 583.06 s [vector] +++ OK, passed 100 tests.
  5855. 583.06 s [vector] findIndex: OK
  5856. 583.06 s [vector] +++ OK, passed 100 tests.
  5857. 583.06 s [vector] findIndexR: OK
  5858. 583.06 s [vector] +++ OK, passed 100 tests.
  5859. 583.06 s [vector] findIndices: OK
  5860. 583.06 s [vector] +++ OK, passed 100 tests.
  5861. 583.06 s [vector] elemIndex: OK
  5862. 583.06 s [vector] +++ OK, passed 100 tests.
  5863. 583.06 s [vector] elemIndices: OK
  5864. 583.06 s [vector] +++ OK, passed 100 tests.
  5865. 583.06 s [vector] foldl: OK
  5866. 583.06 s [vector] +++ OK, passed 100 tests.
  5867. 583.06 s [vector] foldl1: OK
  5868. 583.06 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5869. 583.06 s [vector] foldl': OK
  5870. 583.06 s [vector] +++ OK, passed 100 tests.
  5871. 583.06 s [vector] foldl1': OK
  5872. 583.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5873. 583.06 s [vector] foldr: OK
  5874. 583.06 s [vector] +++ OK, passed 100 tests.
  5875. 583.06 s [vector] foldr1: OK
  5876. 583.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5877. 583.06 s [vector] foldr': OK
  5878. 583.06 s [vector] +++ OK, passed 100 tests.
  5879. 583.06 s [vector] foldr1': OK
  5880. 583.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5881. 583.06 s [vector] ifoldl: OK
  5882. 583.06 s [vector] +++ OK, passed 100 tests.
  5883. 583.06 s [vector] ifoldl': OK
  5884. 583.06 s [vector] +++ OK, passed 100 tests.
  5885. 583.06 s [vector] ifoldr: OK
  5886. 583.06 s [vector] +++ OK, passed 100 tests.
  5887. 583.06 s [vector] ifoldr': OK
  5888. 583.06 s [vector] +++ OK, passed 100 tests.
  5889. 583.06 s [vector] ifoldM: OK
  5890. 583.06 s [vector] +++ OK, passed 100 tests.
  5891. 583.06 s [vector] ifoldM': OK
  5892. 583.06 s [vector] +++ OK, passed 100 tests.
  5893. 583.06 s [vector] ifoldM_: OK (0.03s)
  5894. 583.06 s [vector] +++ OK, passed 100 tests.
  5895. 583.06 s [vector] ifoldM'_: OK (0.03s)
  5896. 583.06 s [vector] +++ OK, passed 100 tests.
  5897. 583.06 s [vector] all: OK
  5898. 583.06 s [vector] +++ OK, passed 100 tests.
  5899. 583.06 s [vector] any: OK
  5900. 583.06 s [vector] +++ OK, passed 100 tests.
  5901. 583.06 s [vector] prescanl: OK
  5902. 583.06 s [vector] +++ OK, passed 100 tests.
  5903. 583.06 s [vector] prescanl': OK
  5904. 583.06 s [vector] +++ OK, passed 100 tests.
  5905. 583.06 s [vector] postscanl: OK
  5906. 583.06 s [vector] +++ OK, passed 100 tests.
  5907. 583.06 s [vector] postscanl': OK
  5908. 583.06 s [vector] +++ OK, passed 100 tests.
  5909. 583.06 s [vector] scanl: OK
  5910. 583.06 s [vector] +++ OK, passed 100 tests.
  5911. 583.06 s [vector] scanl': OK
  5912. 583.06 s [vector] +++ OK, passed 100 tests.
  5913. 583.06 s [vector] scanl1: OK
  5914. 583.06 s [vector] +++ OK, passed 100 tests.
  5915. 583.06 s [vector] scanl1': OK
  5916. 583.06 s [vector] +++ OK, passed 100 tests.
  5917. 583.06 s [vector] iscanl: OK
  5918. 583.06 s [vector] +++ OK, passed 100 tests.
  5919. 583.06 s [vector] iscanl': OK
  5920. 583.06 s [vector] +++ OK, passed 100 tests.
  5921. 583.06 s [vector] prescanr: OK
  5922. 583.07 s [vector] +++ OK, passed 100 tests.
  5923. 583.07 s [vector] prescanr': OK
  5924. 583.07 s [vector] +++ OK, passed 100 tests.
  5925. 583.08 s [vector] postscanr: OK
  5926. 583.08 s [vector] +++ OK, passed 100 tests.
  5927. 583.08 s [vector] postscanr': OK
  5928. 583.08 s [vector] +++ OK, passed 100 tests.
  5929. 583.09 s [vector] scanr: OK
  5930. 583.09 s [vector] +++ OK, passed 100 tests.
  5931. 583.09 s [vector] scanr': OK
  5932. 583.09 s [vector] +++ OK, passed 100 tests.
  5933. 583.09 s [vector] scanr1: OK
  5934. 583.09 s [vector] +++ OK, passed 100 tests.
  5935. 583.10 s [vector] scanr1': OK
  5936. 583.10 s [vector] +++ OK, passed 100 tests.
  5937. 583.11 s [vector] iscanr: OK
  5938. 583.11 s [vector] +++ OK, passed 100 tests.
  5939. 583.11 s [vector] iscanr': OK
  5940. 583.11 s [vector] +++ OK, passed 100 tests.
  5941. 583.11 s [vector] mut_read: OK
  5942. 583.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5943. 583.11 s [vector] mut_write: OK
  5944. 583.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5945. 583.11 s [vector] mut_modify: OK
  5946. 583.12 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5947. 583.13 s [vector] mut_generate: OK
  5948. 583.13 s [vector] +++ OK, passed 100 tests.
  5949. 583.13 s [vector] mut_generateM: OK (0.01s)
  5950. 583.13 s [vector] +++ OK, passed 100 tests.
  5951. 583.17 s [vector] mut_mapM_: OK (0.02s)
  5952. 583.17 s [vector] +++ OK, passed 100 tests.
  5953. 583.19 s [vector] mut_imapM_: OK (0.03s)
  5954. 583.19 s [vector] +++ OK, passed 100 tests.
  5955. 583.21 s [vector] mut_forM_: OK (0.03s)
  5956. 583.21 s [vector] +++ OK, passed 100 tests.
  5957. 583.24 s [vector] mut_iforM_: OK (0.03s)
  5958. 583.24 s [vector] +++ OK, passed 100 tests.
  5959. 583.24 s [vector] mut_foldr: OK
  5960. 583.25 s [vector] +++ OK, passed 100 tests.
  5961. 583.25 s [vector] mut_foldr': OK
  5962. 583.25 s [vector] +++ OK, passed 100 tests.
  5963. 583.25 s [vector] mut_foldl: OK
  5964. 583.25 s [vector] +++ OK, passed 100 tests.
  5965. 583.26 s [vector] mut_foldl': OK
  5966. 583.26 s [vector] +++ OK, passed 100 tests.
  5967. 583.26 s [vector] mut_ifoldr: OK
  5968. 583.26 s [vector] +++ OK, passed 100 tests.
  5969. 583.27 s [vector] mut_ifoldr': OK
  5970. 583.27 s [vector] +++ OK, passed 100 tests.
  5971. 583.28 s [vector] mut_ifoldl: OK
  5972. 583.28 s [vector] +++ OK, passed 100 tests.
  5973. 583.28 s [vector] mut_ifoldl': OK
  5974. 583.28 s [vector] +++ OK, passed 100 tests.
  5975. 583.28 s [vector] mut_foldM: OK
  5976. 583.28 s [vector] +++ OK, passed 100 tests.
  5977. 583.29 s [vector] mut_foldM': OK
  5978. 583.29 s [vector] +++ OK, passed 100 tests.
  5979. 583.29 s [vector] mut_foldrM: OK
  5980. 583.29 s [vector] +++ OK, passed 100 tests.
  5981. 583.30 s [vector] mut_foldrM': OK
  5982. 583.30 s [vector] +++ OK, passed 100 tests.
  5983. 583.30 s [vector] mut_ifoldM: OK
  5984. 583.30 s [vector] +++ OK, passed 100 tests.
  5985. 583.31 s [vector] mut_ifoldM': OK
  5986. 583.31 s [vector] +++ OK, passed 100 tests.
  5987. 583.32 s [vector] mut_ifoldrM: OK
  5988. 583.32 s [vector] +++ OK, passed 100 tests.
  5989. 583.32 s [vector] mut_ifoldrM': OK
  5990. 583.32 s [vector] +++ OK, passed 100 tests.
  5991. 583.32 s [vector] compare: OK
  5992. 583.32 s [vector] +++ OK, passed 100 tests.
  5993. 583.32 s [vector] maximum: OK
  5994. 583.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5995. 583.32 s [vector] minimum: OK
  5996. 583.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5997. 583.32 s [vector] minIndex: OK
  5998. 583.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5999. 583.32 s [vector] maxIndex: OK
  6000. 583.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6001. 583.33 s [vector] maximumBy: OK
  6002. 583.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6003. 583.33 s [vector] minimumBy: OK
  6004. 583.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6005. 583.33 s [vector] maximumOn: OK
  6006. 583.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6007. 583.33 s [vector] minimumOn: OK
  6008. 583.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6009. 583.33 s [vector] maxIndexBy: OK
  6010. 583.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6011. 583.33 s [vector] minIndexBy: OK
  6012. 583.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6013. 583.33 s [vector] ListFirstMaxIndexWins: OK
  6014. 583.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6015. 583.33 s [vector] FalseListFirstMaxIndexWins: OK
  6016. 583.33 s [vector] +++ OK, failed as expected. (after 1 test):
  6017. 583.33 s [vector] Exception:
  6018. 583.33 s [vector] Prelude.foldr1: empty list
  6019. 583.33 s [vector] CallStack (from HasCallStack):
  6020. 583.33 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  6021. 583.33 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  6022. 583.33 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6023. 583.33 s [vector] []
  6024. 583.33 s [vector] zip: OK
  6025. 583.33 s [vector] +++ OK, passed 100 tests.
  6026. 583.34 s [vector] zip3: OK
  6027. 583.34 s [vector] +++ OK, passed 100 tests.
  6028. 583.34 s [vector] unzip: OK
  6029. 583.35 s [vector] +++ OK, passed 100 tests.
  6030. 583.35 s [vector] unzip3: OK
  6031. 583.35 s [vector] +++ OK, passed 100 tests.
  6032. 583.35 s [vector] indexed: OK
  6033. 583.35 s [vector] +++ OK, passed 100 tests.
  6034. 583.35 s [vector] update: OK
  6035. 583.35 s [vector] +++ OK, passed 100 tests.
  6036. 583.37 s [vector] mempty: OK
  6037. 583.37 s [vector] +++ OK, passed 100 tests.
  6038. 583.37 s [vector] mappend: OK
  6039. 583.37 s [vector] +++ OK, passed 100 tests.
  6040. 583.39 s [vector] mconcat: OK (0.03s)
  6041. 583.39 s [vector] +++ OK, passed 100 tests.
  6042. 583.39 s [vector] glength: OK
  6043. 583.39 s [vector] +++ OK, passed 100 tests.
  6044. 583.39 s [vector] (Int,Bool,Int)
  6045. 583.39 s [vector] fromList.toList == id: OK
  6046. 583.39 s [vector] +++ OK, passed 100 tests.
  6047. 583.40 s [vector] toList.fromList == id: OK
  6048. 583.40 s [vector] +++ OK, passed 100 tests.
  6049. 583.40 s [vector] unstream.stream == id: OK
  6050. 583.40 s [vector] +++ OK, passed 100 tests.
  6051. 583.40 s [vector] stream.unstream == id: OK
  6052. 583.40 s [vector] +++ OK, passed 100 tests.
  6053. 583.40 s [vector] eq: OK
  6054. 583.40 s [vector] +++ OK, passed 100 tests.
  6055. 583.40 s [vector] length: OK
  6056. 583.40 s [vector] +++ OK, passed 100 tests.
  6057. 583.40 s [vector] null: OK
  6058. 583.40 s [vector] +++ OK, passed 100 tests.
  6059. 583.40 s [vector] index: OK
  6060. 583.40 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6061. 583.40 s [vector] safeIndex: OK
  6062. 583.40 s [vector] +++ OK, passed 100 tests.
  6063. 583.41 s [vector] head: OK
  6064. 583.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6065. 583.41 s [vector] last: OK
  6066. 583.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6067. 583.41 s [vector] unsafeIndex: OK
  6068. 583.41 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6069. 583.41 s [vector] unsafeHead: OK
  6070. 583.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6071. 583.41 s [vector] unsafeLast: OK
  6072. 583.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6073. 583.41 s [vector] slice: OK
  6074. 583.41 s [vector] +++ OK, passed 100 tests.
  6075. 583.41 s [vector] init: OK
  6076. 583.41 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6077. 583.42 s [vector] tail: OK
  6078. 583.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6079. 583.42 s [vector] take: OK
  6080. 583.42 s [vector] +++ OK, passed 100 tests.
  6081. 583.42 s [vector] drop: OK
  6082. 583.42 s [vector] +++ OK, passed 100 tests.
  6083. 583.42 s [vector] splitAt: OK
  6084. 583.42 s [vector] +++ OK, passed 100 tests.
  6085. 583.42 s [vector] empty: OK
  6086. 583.42 s [vector] +++ OK, passed 100 tests.
  6087. 583.42 s [vector] singleton: OK
  6088. 583.42 s [vector] +++ OK, passed 100 tests.
  6089. 583.42 s [vector] replicate: OK
  6090. 583.42 s [vector] +++ OK, passed 100 tests.
  6091. 583.42 s [vector] generate: OK
  6092. 583.42 s [vector] +++ OK, passed 100 tests.
  6093. 583.42 s [vector] iterateN: OK
  6094. 583.43 s [vector] +++ OK, passed 100 tests.
  6095. 583.47 s [vector] iterateNM: OK (0.04s)
  6096. 583.47 s [vector] +++ OK, passed 100 tests.
  6097. 583.50 s [vector] generateM: OK (0.03s)
  6098. 583.50 s [vector] +++ OK, passed 100 tests.
  6099. 583.51 s [vector] replicateM: OK
  6100. 583.51 s [vector] +++ OK, passed 100 tests.
  6101. 583.52 s [vector] create: OK
  6102. 583.52 s [vector] +++ OK, passed 100 tests.
  6103. 583.52 s [vector] createT: OK
  6104. 583.52 s [vector] +++ OK, passed 100 tests.
  6105. 583.52 s [vector] unfoldr: OK
  6106. 583.52 s [vector] +++ OK, passed 100 tests.
  6107. 583.52 s [vector] unfoldrN: OK
  6108. 583.52 s [vector] +++ OK, passed 100 tests.
  6109. 583.52 s [vector] unfoldrExactN: OK
  6110. 583.52 s [vector] +++ OK, passed 100 tests.
  6111. 583.52 s [vector] unfoldrM: OK
  6112. 583.52 s [vector] +++ OK, passed 100 tests.
  6113. 583.53 s [vector] unfoldrNM: OK
  6114. 583.53 s [vector] +++ OK, passed 100 tests.
  6115. 583.57 s [vector] unfoldrExactNM: OK (0.03s)
  6116. 583.57 s [vector] +++ OK, passed 100 tests.
  6117. 583.57 s [vector] constructN: OK
  6118. 583.57 s [vector] +++ OK, passed 100 tests.
  6119. 583.58 s [vector] constructrN: OK
  6120. 583.58 s [vector] +++ OK, passed 100 tests.
  6121. 583.58 s [vector] cons: OK
  6122. 583.58 s [vector] +++ OK, passed 100 tests.
  6123. 583.58 s [vector] snoc: OK
  6124. 583.58 s [vector] +++ OK, passed 100 tests.
  6125. 583.58 s [vector] append: OK
  6126. 583.58 s [vector] +++ OK, passed 100 tests.
  6127. 583.65 s [vector] concat: OK (0.06s)
  6128. 583.65 s [vector] +++ OK, passed 100 tests.
  6129. 583.65 s [vector] force: OK
  6130. 583.65 s [vector] +++ OK, passed 100 tests.
  6131. 583.65 s [vector] upd: OK
  6132. 583.66 s [vector] +++ OK, passed 100 tests.
  6133. 583.67 s [vector] accum: OK (0.01s)
  6134. 583.67 s [vector] +++ OK, passed 100 tests.
  6135. 583.67 s [vector] reverse: OK
  6136. 583.67 s [vector] +++ OK, passed 100 tests.
  6137. 583.68 s [vector] backpermute: OK
  6138. 583.68 s [vector] +++ OK, passed 100 tests.
  6139. 583.68 s [vector] map: OK
  6140. 583.69 s [vector] +++ OK, passed 100 tests.
  6141. 583.70 s [vector] imap: OK
  6142. 583.70 s [vector] +++ OK, passed 100 tests.
  6143. 583.70 s [vector] concatMap: OK
  6144. 583.70 s [vector] +++ OK, passed 100 tests.
  6145. 583.71 s [vector] mapM: OK
  6146. 583.71 s [vector] +++ OK, passed 100 tests.
  6147. 583.74 s [vector] mapM_: OK (0.04s)
  6148. 583.75 s [vector] +++ OK, passed 100 tests.
  6149. 583.75 s [vector] forM: OK
  6150. 583.75 s [vector] +++ OK, passed 100 tests.
  6151. 583.79 s [vector] forM_: OK (0.04s)
  6152. 583.79 s [vector] +++ OK, passed 100 tests.
  6153. 583.81 s [vector] imapM: OK
  6154. 583.81 s [vector] +++ OK, passed 100 tests.
  6155. 583.84 s [vector] imapM_: OK (0.04s)
  6156. 583.84 s [vector] +++ OK, passed 100 tests.
  6157. 583.85 s [vector] zipWith: OK
  6158. 583.85 s [vector] +++ OK, passed 100 tests.
  6159. 583.85 s [vector] zipWith3: OK
  6160. 583.85 s [vector] +++ OK, passed 100 tests.
  6161. 583.85 s [vector] izipWith: OK
  6162. 583.85 s [vector] +++ OK, passed 100 tests.
  6163. 583.86 s [vector] izipWith3: OK
  6164. 583.86 s [vector] +++ OK, passed 100 tests.
  6165. 583.87 s [vector] izipWithM: OK
  6166. 583.87 s [vector] +++ OK, passed 100 tests.
  6167. 583.91 s [vector] izipWithM_: OK (0.03s)
  6168. 583.91 s [vector] +++ OK, passed 100 tests.
  6169. 583.91 s [vector] zipWithM: OK
  6170. 583.91 s [vector] +++ OK, passed 100 tests.
  6171. 583.94 s [vector] zipWithM_: OK (0.01s)
  6172. 583.95 s [vector] +++ OK, passed 100 tests.
  6173. 583.95 s [vector] filter: OK
  6174. 583.95 s [vector] +++ OK, passed 100 tests.
  6175. 583.95 s [vector] ifilter: OK
  6176. 583.95 s [vector] +++ OK, passed 100 tests.
  6177. 584.01 s [vector] filterM: OK (0.06s)
  6178. 584.01 s [vector] +++ OK, passed 100 tests.
  6179. 584.01 s [vector] uniq: OK
  6180. 584.01 s [vector] +++ OK, passed 100 tests.
  6181. 584.02 s [vector] mapMaybe: OK
  6182. 584.02 s [vector] +++ OK, passed 100 tests.
  6183. 584.02 s [vector] imapMaybe: OK
  6184. 584.02 s [vector] +++ OK, passed 100 tests.
  6185. 584.02 s [vector] takeWhile: OK
  6186. 584.02 s [vector] +++ OK, passed 100 tests.
  6187. 584.02 s [vector] dropWhile: OK
  6188. 584.02 s [vector] +++ OK, passed 100 tests.
  6189. 584.03 s [vector] partition: OK
  6190. 584.03 s [vector] +++ OK, passed 100 tests.
  6191. 584.03 s [vector] partitionWith: OK
  6192. 584.04 s [vector] +++ OK, passed 100 tests.
  6193. 584.04 s [vector] span: OK
  6194. 584.04 s [vector] +++ OK, passed 100 tests.
  6195. 584.04 s [vector] break: OK
  6196. 584.04 s [vector] +++ OK, passed 100 tests.
  6197. 584.04 s [vector] spanR: OK
  6198. 584.04 s [vector] +++ OK, passed 100 tests.
  6199. 584.04 s [vector] breakR: OK
  6200. 584.04 s [vector] +++ OK, passed 100 tests.
  6201. 584.05 s [vector] groupBy: OK
  6202. 584.05 s [vector] +++ OK, passed 100 tests.
  6203. 584.05 s [vector] elem: OK
  6204. 584.05 s [vector] +++ OK, passed 100 tests.
  6205. 584.05 s [vector] notElem: OK
  6206. 584.05 s [vector] +++ OK, passed 100 tests.
  6207. 584.05 s [vector] find: OK
  6208. 584.05 s [vector] +++ OK, passed 100 tests.
  6209. 584.05 s [vector] findIndex: OK
  6210. 584.05 s [vector] +++ OK, passed 100 tests.
  6211. 584.06 s [vector] findIndexR: OK
  6212. 584.06 s [vector] +++ OK, passed 100 tests.
  6213. 584.06 s [vector] findIndices: OK
  6214. 584.06 s [vector] +++ OK, passed 100 tests.
  6215. 584.06 s [vector] elemIndex: OK
  6216. 584.06 s [vector] +++ OK, passed 100 tests.
  6217. 584.06 s [vector] elemIndices: OK
  6218. 584.06 s [vector] +++ OK, passed 100 tests.
  6219. 584.07 s [vector] foldl: OK
  6220. 584.07 s [vector] +++ OK, passed 100 tests.
  6221. 584.08 s [vector] foldl1: OK
  6222. 584.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6223. 584.08 s [vector] foldl': OK
  6224. 584.08 s [vector] +++ OK, passed 100 tests.
  6225. 584.08 s [vector] foldl1': OK
  6226. 584.08 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6227. 584.09 s [vector] foldr: OK
  6228. 584.09 s [vector] +++ OK, passed 100 tests.
  6229. 584.10 s [vector] foldr1: OK
  6230. 584.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6231. 584.10 s [vector] foldr': OK
  6232. 584.10 s [vector] +++ OK, passed 100 tests.
  6233. 584.11 s [vector] foldr1': OK
  6234. 584.11 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6235. 584.12 s [vector] ifoldl: OK
  6236. 584.12 s [vector] +++ OK, passed 100 tests.
  6237. 584.13 s [vector] ifoldl': OK (0.01s)
  6238. 584.13 s [vector] +++ OK, passed 100 tests.
  6239. 584.14 s [vector] ifoldr: OK
  6240. 584.15 s [vector] +++ OK, passed 100 tests.
  6241. 584.15 s [vector] ifoldr': OK
  6242. 584.15 s [vector] +++ OK, passed 100 tests.
  6243. 584.15 s [vector] ifoldM: OK
  6244. 584.15 s [vector] +++ OK, passed 100 tests.
  6245. 584.16 s [vector] ifoldM': OK
  6246. 584.16 s [vector] +++ OK, passed 100 tests.
  6247. 584.21 s [vector] ifoldM_: OK (0.05s)
  6248. 584.21 s [vector] +++ OK, passed 100 tests.
  6249. 584.24 s [vector] ifoldM'_: OK (0.04s)
  6250. 584.24 s [vector] +++ OK, passed 100 tests.
  6251. 584.24 s [vector] all: OK
  6252. 584.24 s [vector] +++ OK, passed 100 tests.
  6253. 584.24 s [vector] any: OK
  6254. 584.25 s [vector] +++ OK, passed 100 tests.
  6255. 584.26 s [vector] prescanl: OK
  6256. 584.26 s [vector] +++ OK, passed 100 tests.
  6257. 584.26 s [vector] prescanl': OK
  6258. 584.27 s [vector] +++ OK, passed 100 tests.
  6259. 584.27 s [vector] postscanl: OK
  6260. 584.27 s [vector] +++ OK, passed 100 tests.
  6261. 584.28 s [vector] postscanl': OK
  6262. 584.28 s [vector] +++ OK, passed 100 tests.
  6263. 584.29 s [vector] scanl: OK
  6264. 584.29 s [vector] +++ OK, passed 100 tests.
  6265. 584.29 s [vector] scanl': OK
  6266. 584.29 s [vector] +++ OK, passed 100 tests.
  6267. 584.30 s [vector] scanl1: OK
  6268. 584.30 s [vector] +++ OK, passed 100 tests.
  6269. 584.31 s [vector] scanl1': OK
  6270. 584.31 s [vector] +++ OK, passed 100 tests.
  6271. 584.32 s [vector] iscanl: OK
  6272. 584.32 s [vector] +++ OK, passed 100 tests.
  6273. 584.32 s [vector] iscanl': OK
  6274. 584.32 s [vector] +++ OK, passed 100 tests.
  6275. 584.34 s [vector] prescanr: OK
  6276. 584.34 s [vector] +++ OK, passed 100 tests.
  6277. 584.34 s [vector] prescanr': OK
  6278. 584.34 s [vector] +++ OK, passed 100 tests.
  6279. 584.35 s [vector] postscanr: OK
  6280. 584.35 s [vector] +++ OK, passed 100 tests.
  6281. 584.36 s [vector] postscanr': OK
  6282. 584.36 s [vector] +++ OK, passed 100 tests.
  6283. 584.36 s [vector] scanr: OK
  6284. 584.37 s [vector] +++ OK, passed 100 tests.
  6285. 584.37 s [vector] scanr': OK
  6286. 584.37 s [vector] +++ OK, passed 100 tests.
  6287. 584.37 s [vector] scanr1: OK
  6288. 584.37 s [vector] +++ OK, passed 100 tests.
  6289. 584.39 s [vector] scanr1': OK
  6290. 584.39 s [vector] +++ OK, passed 100 tests.
  6291. 584.40 s [vector] iscanr: OK (0.01s)
  6292. 584.40 s [vector] +++ OK, passed 100 tests.
  6293. 584.40 s [vector] iscanr': OK
  6294. 584.40 s [vector] +++ OK, passed 100 tests.
  6295. 584.40 s [vector] mut_read: OK
  6296. 584.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6297. 584.41 s [vector] mut_write: OK
  6298. 584.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6299. 584.41 s [vector] mut_modify: OK
  6300. 584.41 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6301. 584.41 s [vector] mut_generate: OK
  6302. 584.41 s [vector] +++ OK, passed 100 tests.
  6303. 584.45 s [vector] mut_generateM: OK (0.03s)
  6304. 584.45 s [vector] +++ OK, passed 100 tests.
  6305. 584.47 s [vector] mut_mapM_: OK (0.04s)
  6306. 584.47 s [vector] +++ OK, passed 100 tests.
  6307. 584.53 s [vector] mut_imapM_: OK (0.03s)
  6308. 584.53 s [vector] +++ OK, passed 100 tests.
  6309. 584.59 s [vector] mut_forM_: OK (0.05s)
  6310. 584.59 s [vector] +++ OK, passed 100 tests.
  6311. 584.62 s [vector] mut_iforM_: OK (0.04s)
  6312. 584.62 s [vector] +++ OK, passed 100 tests.
  6313. 584.62 s [vector] mut_foldr: OK
  6314. 584.62 s [vector] +++ OK, passed 100 tests.
  6315. 584.63 s [vector] mut_foldr': OK
  6316. 584.63 s [vector] +++ OK, passed 100 tests.
  6317. 584.64 s [vector] mut_foldl: OK
  6318. 584.64 s [vector] +++ OK, passed 100 tests.
  6319. 584.64 s [vector] mut_foldl': OK
  6320. 584.64 s [vector] +++ OK, passed 100 tests.
  6321. 584.66 s [vector] mut_ifoldr: OK
  6322. 584.66 s [vector] +++ OK, passed 100 tests.
  6323. 584.66 s [vector] mut_ifoldr': OK
  6324. 584.66 s [vector] +++ OK, passed 100 tests.
  6325. 584.67 s [vector] mut_ifoldl: OK
  6326. 584.67 s [vector] +++ OK, passed 100 tests.
  6327. 584.68 s [vector] mut_ifoldl': OK
  6328. 584.68 s [vector] +++ OK, passed 100 tests.
  6329. 584.68 s [vector] mut_foldM: OK
  6330. 584.68 s [vector] +++ OK, passed 100 tests.
  6331. 584.69 s [vector] mut_foldM': OK
  6332. 584.69 s [vector] +++ OK, passed 100 tests.
  6333. 584.70 s [vector] mut_foldrM: OK
  6334. 584.70 s [vector] +++ OK, passed 100 tests.
  6335. 584.71 s [vector] mut_foldrM': OK
  6336. 584.71 s [vector] +++ OK, passed 100 tests.
  6337. 584.73 s [vector] mut_ifoldM: OK (0.01s)
  6338. 584.73 s [vector] +++ OK, passed 100 tests.
  6339. 584.73 s [vector] mut_ifoldM': OK
  6340. 584.73 s [vector] +++ OK, passed 100 tests.
  6341. 584.74 s [vector] mut_ifoldrM: OK
  6342. 584.74 s [vector] +++ OK, passed 100 tests.
  6343. 584.74 s [vector] mut_ifoldrM': OK
  6344. 584.74 s [vector] +++ OK, passed 100 tests.
  6345. 584.75 s [vector] compare: OK
  6346. 584.75 s [vector] +++ OK, passed 100 tests.
  6347. 584.75 s [vector] maximum: OK
  6348. 584.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6349. 584.75 s [vector] minimum: OK
  6350. 584.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6351. 584.75 s [vector] minIndex: OK
  6352. 584.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6353. 584.75 s [vector] maxIndex: OK
  6354. 584.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6355. 584.75 s [vector] maximumBy: OK
  6356. 584.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6357. 584.76 s [vector] minimumBy: OK
  6358. 584.76 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6359. 584.76 s [vector] maximumOn: OK
  6360. 584.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6361. 584.76 s [vector] minimumOn: OK
  6362. 584.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6363. 584.76 s [vector] maxIndexBy: OK
  6364. 584.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6365. 584.76 s [vector] minIndexBy: OK
  6366. 584.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6367. 584.76 s [vector] ListFirstMaxIndexWins: OK
  6368. 584.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6369. 584.77 s [vector] FalseListFirstMaxIndexWins: OK
  6370. 584.77 s [vector] +++ OK, failed as expected. (after 1 test):
  6371. 584.77 s [vector] Exception:
  6372. 584.77 s [vector] Prelude.foldr1: empty list
  6373. 584.77 s [vector] CallStack (from HasCallStack):
  6374. 584.77 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  6375. 584.77 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  6376. 584.77 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6377. 584.77 s [vector] []
  6378. 584.77 s [vector] zip: OK
  6379. 584.77 s [vector] +++ OK, passed 100 tests.
  6380. 584.77 s [vector] zip3: OK
  6381. 584.77 s [vector] +++ OK, passed 100 tests.
  6382. 584.78 s [vector] unzip: OK
  6383. 584.78 s [vector] +++ OK, passed 100 tests.
  6384. 584.78 s [vector] unzip3: OK
  6385. 584.78 s [vector] +++ OK, passed 100 tests.
  6386. 584.79 s [vector] indexed: OK
  6387. 584.79 s [vector] +++ OK, passed 100 tests.
  6388. 584.79 s [vector] update: OK
  6389. 584.79 s [vector] +++ OK, passed 100 tests.
  6390. 584.79 s [vector] mempty: OK
  6391. 584.79 s [vector] +++ OK, passed 100 tests.
  6392. 584.81 s [vector] mappend: OK
  6393. 584.81 s [vector] +++ OK, passed 100 tests.
  6394. 584.84 s [vector] mconcat: OK (0.04s)
  6395. 584.84 s [vector] +++ OK, passed 100 tests.
  6396. 584.84 s [vector] glength: OK
  6397. 584.84 s [vector] +++ OK, passed 100 tests.
  6398. 584.84 s [vector] unstream
  6399. 584.84 s [vector] unstream == vunstream (exact): OK
  6400. 584.84 s [vector] +++ OK, passed 100 tests.
  6401. 584.84 s [vector] unstream == vunstream (unknown): OK
  6402. 584.84 s [vector] +++ OK, passed 100 tests.
  6403. 584.84 s [vector] unstreamR ~= vunstream (exact): OK
  6404. 584.84 s [vector] +++ OK, passed 100 tests.
  6405. 584.84 s [vector] unstreamR ~= vunstream (unknown): OK
  6406. 584.84 s [vector] +++ OK, passed 100 tests.
  6407. 584.85 s [vector] Data.Vector.Storable.Vector Alignment
  6408. 584.85 s [vector] Aligned Double: OK
  6409. 584.85 s [vector] Aligned Int: OK
  6410. 584.85 s [vector] Regression tests
  6411. 584.85 s [vector] enumFromTo crash #188
  6412. 584.85 s [vector] Word8: OK
  6413. 584.85 s [vector] Word16: OK
  6414. 584.85 s [vector] Word32: OK
  6415. 584.85 s [vector] Word64: OK
  6416. 584.85 s [vector] Word: OK
  6417. 584.85 s [vector] Int8: OK
  6418. 584.85 s [vector] Int16: OK
  6419. 584.85 s [vector] Int32: OK
  6420. 584.85 s [vector] Int64: OK
  6421. 584.85 s [vector] Int: OK
  6422. 584.85 s [vector] Char: OK
  6423. 584.85 s [vector] Negative tests
  6424. 584.85 s [vector] slice out of bounds #257
  6425. 584.85 s [vector] Boxed
  6426. 584.85 s [vector] Negative ix: OK
  6427. 584.85 s [vector] Negative size: OK
  6428. 584.85 s [vector] Negative ix and size: OK
  6429. 584.85 s [vector] Too large ix: OK
  6430. 584.85 s [vector] Too large size: OK
  6431. 584.85 s [vector] Too large ix and size: OK
  6432. 584.85 s [vector] Overflow: OK
  6433. 584.85 s [vector] OutOfMemory: OK
  6434. 584.85 s [vector] Primitive
  6435. 584.85 s [vector] Negative ix: OK
  6436. 584.85 s [vector] Negative size: OK
  6437. 584.85 s [vector] Negative ix and size: OK
  6438. 584.85 s [vector] Too large ix: OK
  6439. 584.85 s [vector] Too large size: OK
  6440. 584.85 s [vector] Too large ix and size: OK
  6441. 584.85 s [vector] Overflow: OK
  6442. 584.85 s [vector] OutOfMemory: OK
  6443. 584.85 s [vector] Storable
  6444. 584.85 s [vector] Negative ix: OK
  6445. 584.85 s [vector] Negative size: OK
  6446. 584.85 s [vector] Negative ix and size: OK
  6447. 584.85 s [vector] Too large ix: OK
  6448. 584.85 s [vector] Too large size: OK
  6449. 584.85 s [vector] Too large ix and size: OK
  6450. 584.85 s [vector] Overflow: OK
  6451. 584.85 s [vector] OutOfMemory: OK
  6452. 584.85 s [vector] Unboxed
  6453. 584.85 s [vector] Negative ix: OK
  6454. 584.85 s [vector] Negative size: OK
  6455. 584.85 s [vector] Negative ix and size: OK
  6456. 584.85 s [vector] Too large ix: OK
  6457. 584.85 s [vector] Too large size: OK
  6458. 584.85 s [vector] Too large ix and size: OK
  6459. 584.85 s [vector] Overflow: OK
  6460. 584.85 s [vector] OutOfMemory: OK
  6461. 584.85 s [vector] take #282
  6462. 584.85 s [vector] Boxed: OK
  6463. 584.85 s [vector] Primitive: OK
  6464. 584.85 s [vector] Storable: OK
  6465. 584.85 s [vector] Unboxed: OK
  6466. 584.85 s [vector] Data.Vector
  6467. 584.85 s [vector] MonadFix: OK
  6468. 584.85 s [vector] toFromArray: OK
  6469. 584.85 s [vector] toFromArraySlice: OK
  6470. 584.85 s [vector] toFromArraySliceUnsafe: OK
  6471. 584.85 s [vector] toFromMutableArray: OK
  6472. 584.85 s [vector] Data.Vector.Mutable (Move): OK
  6473. 584.85 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6474. 584.85 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  6475. 584.85 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6476. 584.86 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  6477. 584.86 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6478. 584.86 s [vector] Data.Vector.Storable.Mutable (Move): OK
  6479. 584.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6480. 584.86 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  6481. 584.86 s [vector] +++ OK, passed 100 tests.
  6482. 584.87 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  6483. 584.87 s [vector] +++ OK, passed 100 tests.
  6484. 584.87 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  6485. 584.87 s [vector] +++ OK, passed 100 tests.
  6486. 584.87 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  6487. 584.87 s [vector] +++ OK, passed 100 tests.
  6488. 584.87 s [vector]
  6489. 584.87 s [vector] All 2808 tests passed (12.80s)
  6490. 584.88 s [vector] Test suite vector-tests-O0: PASS
  6491. 584.88 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  6492. 584.88 s [vector] Test suite vector-tests-O2: RUNNING...
  6493. 585.02 s [vector] toplevel
  6494. 585.02 s [vector] Data.Vector.Fusion.Bundle
  6495. 585.02 s [vector] fromList.toList == id: OK
  6496. 585.02 s [vector] +++ OK, passed 100 tests.
  6497. 585.02 s [vector] toList.fromList == id: OK
  6498. 585.02 s [vector] +++ OK, passed 100 tests.
  6499. 585.02 s [vector] eq: OK
  6500. 585.02 s [vector] +++ OK, passed 100 tests.
  6501. 585.02 s [vector] length: OK
  6502. 585.02 s [vector] +++ OK, passed 100 tests.
  6503. 585.03 s [vector] null: OK
  6504. 585.03 s [vector] +++ OK, passed 100 tests.
  6505. 585.03 s [vector] empty: OK
  6506. 585.03 s [vector] +++ OK, passed 100 tests.
  6507. 585.03 s [vector] singleton: OK
  6508. 585.03 s [vector] +++ OK, passed 100 tests.
  6509. 585.03 s [vector] replicate: OK
  6510. 585.03 s [vector] +++ OK, passed 100 tests.
  6511. 585.04 s [vector] cons: OK
  6512. 585.04 s [vector] +++ OK, passed 100 tests.
  6513. 585.04 s [vector] snoc: OK
  6514. 585.04 s [vector] +++ OK, passed 100 tests.
  6515. 585.04 s [vector] append: OK
  6516. 585.04 s [vector] +++ OK, passed 100 tests.
  6517. 585.04 s [vector] head: OK
  6518. 585.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6519. 585.04 s [vector] last: OK
  6520. 585.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6521. 585.04 s [vector] index: OK
  6522. 585.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6523. 585.04 s [vector] extract: OK
  6524. 585.04 s [vector] +++ OK, passed 100 tests.
  6525. 585.04 s [vector] init: OK
  6526. 585.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6527. 585.04 s [vector] tail: OK
  6528. 585.04 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6529. 585.04 s [vector] take: OK
  6530. 585.05 s [vector] +++ OK, passed 100 tests.
  6531. 585.05 s [vector] drop: OK
  6532. 585.05 s [vector] +++ OK, passed 100 tests.
  6533. 585.05 s [vector] map: OK
  6534. 585.05 s [vector] +++ OK, passed 100 tests.
  6535. 585.05 s [vector] zipWith: OK
  6536. 585.05 s [vector] +++ OK, passed 100 tests.
  6537. 585.05 s [vector] zipWith3: OK
  6538. 585.05 s [vector] +++ OK, passed 100 tests.
  6539. 585.05 s [vector] filter: OK
  6540. 585.05 s [vector] +++ OK, passed 100 tests.
  6541. 585.05 s [vector] takeWhile: OK
  6542. 585.05 s [vector] +++ OK, passed 100 tests.
  6543. 585.05 s [vector] dropWhile: OK
  6544. 585.05 s [vector] +++ OK, passed 100 tests.
  6545. 585.05 s [vector] elem: OK
  6546. 585.05 s [vector] +++ OK, passed 100 tests.
  6547. 585.05 s [vector] notElem: OK
  6548. 585.05 s [vector] +++ OK, passed 100 tests.
  6549. 585.05 s [vector] find: OK
  6550. 585.05 s [vector] +++ OK, passed 100 tests.
  6551. 585.05 s [vector] findIndex: OK
  6552. 585.05 s [vector] +++ OK, passed 100 tests.
  6553. 585.05 s [vector] foldl: OK
  6554. 585.05 s [vector] +++ OK, passed 100 tests.
  6555. 585.05 s [vector] foldl1: OK
  6556. 585.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6557. 585.06 s [vector] foldl': OK
  6558. 585.06 s [vector] +++ OK, passed 100 tests.
  6559. 585.06 s [vector] foldl1': OK
  6560. 585.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6561. 585.06 s [vector] foldr: OK
  6562. 585.06 s [vector] +++ OK, passed 100 tests.
  6563. 585.06 s [vector] foldr1: OK
  6564. 585.06 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6565. 585.06 s [vector] prescanl: OK
  6566. 585.06 s [vector] +++ OK, passed 100 tests.
  6567. 585.06 s [vector] prescanl': OK
  6568. 585.06 s [vector] +++ OK, passed 100 tests.
  6569. 585.06 s [vector] postscanl: OK
  6570. 585.06 s [vector] +++ OK, passed 100 tests.
  6571. 585.06 s [vector] postscanl': OK
  6572. 585.06 s [vector] +++ OK, passed 100 tests.
  6573. 585.06 s [vector] scanl: OK
  6574. 585.06 s [vector] +++ OK, passed 100 tests.
  6575. 585.06 s [vector] scanl': OK
  6576. 585.06 s [vector] +++ OK, passed 100 tests.
  6577. 585.06 s [vector] scanl1: OK
  6578. 585.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6579. 585.06 s [vector] scanl1': OK
  6580. 585.06 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6581. 585.06 s [vector] concatMap: OK
  6582. 585.06 s [vector] +++ OK, passed 100 tests.
  6583. 585.06 s [vector] unfoldr: OK
  6584. 585.06 s [vector] +++ OK, passed 100 tests.
  6585. 585.07 s [vector] and: OK
  6586. 585.07 s [vector] +++ OK, passed 100 tests.
  6587. 585.07 s [vector] or: OK
  6588. 585.07 s [vector] +++ OK, passed 100 tests.
  6589. 585.07 s [vector] Tests.Vector.Boxed
  6590. 585.07 s [vector] Bool
  6591. 585.07 s [vector] fromList.toList == id: OK
  6592. 585.07 s [vector] +++ OK, passed 100 tests.
  6593. 585.07 s [vector] toList.fromList == id: OK
  6594. 585.07 s [vector] +++ OK, passed 100 tests.
  6595. 585.07 s [vector] unstream.stream == id: OK
  6596. 585.07 s [vector] +++ OK, passed 100 tests.
  6597. 585.07 s [vector] stream.unstream == id: OK
  6598. 585.07 s [vector] +++ OK, passed 100 tests.
  6599. 585.07 s [vector] eq: OK
  6600. 585.07 s [vector] +++ OK, passed 100 tests.
  6601. 585.07 s [vector] length: OK
  6602. 585.07 s [vector] +++ OK, passed 100 tests.
  6603. 585.07 s [vector] null: OK
  6604. 585.07 s [vector] +++ OK, passed 100 tests.
  6605. 585.07 s [vector] index: OK
  6606. 585.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6607. 585.07 s [vector] safeIndex: OK
  6608. 585.07 s [vector] +++ OK, passed 100 tests.
  6609. 585.07 s [vector] head: OK
  6610. 585.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6611. 585.07 s [vector] last: OK
  6612. 585.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6613. 585.07 s [vector] unsafeIndex: OK
  6614. 585.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6615. 585.07 s [vector] unsafeHead: OK
  6616. 585.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6617. 585.07 s [vector] unsafeLast: OK
  6618. 585.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6619. 585.07 s [vector] slice: OK
  6620. 585.07 s [vector] +++ OK, passed 100 tests.
  6621. 585.07 s [vector] init: OK
  6622. 585.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6623. 585.07 s [vector] tail: OK
  6624. 585.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6625. 585.08 s [vector] take: OK
  6626. 585.08 s [vector] +++ OK, passed 100 tests.
  6627. 585.08 s [vector] drop: OK
  6628. 585.08 s [vector] +++ OK, passed 100 tests.
  6629. 585.08 s [vector] splitAt: OK
  6630. 585.08 s [vector] +++ OK, passed 100 tests.
  6631. 585.08 s [vector] empty: OK
  6632. 585.08 s [vector] +++ OK, passed 100 tests.
  6633. 585.08 s [vector] singleton: OK
  6634. 585.08 s [vector] +++ OK, passed 100 tests.
  6635. 585.08 s [vector] replicate: OK
  6636. 585.08 s [vector] +++ OK, passed 100 tests.
  6637. 585.08 s [vector] generate: OK
  6638. 585.08 s [vector] +++ OK, passed 100 tests.
  6639. 585.08 s [vector] iterateN: OK
  6640. 585.08 s [vector] +++ OK, passed 100 tests.
  6641. 585.08 s [vector] iterateNM: OK (0.04s)
  6642. 585.08 s [vector] +++ OK, passed 100 tests.
  6643. 585.08 s [vector] generateM: OK (0.01s)
  6644. 585.08 s [vector] +++ OK, passed 100 tests.
  6645. 585.08 s [vector] replicateM: OK
  6646. 585.08 s [vector] +++ OK, passed 100 tests.
  6647. 585.08 s [vector] create: OK
  6648. 585.08 s [vector] +++ OK, passed 100 tests.
  6649. 585.08 s [vector] createT: OK
  6650. 585.08 s [vector] +++ OK, passed 100 tests.
  6651. 585.08 s [vector] unfoldr: OK
  6652. 585.08 s [vector] +++ OK, passed 100 tests.
  6653. 585.08 s [vector] unfoldrN: OK
  6654. 585.08 s [vector] +++ OK, passed 100 tests.
  6655. 585.08 s [vector] unfoldrExactN: OK
  6656. 585.09 s [vector] +++ OK, passed 100 tests.
  6657. 585.09 s [vector] unfoldrM: OK
  6658. 585.09 s [vector] +++ OK, passed 100 tests.
  6659. 585.10 s [vector] unfoldrNM: OK
  6660. 585.10 s [vector] +++ OK, passed 100 tests.
  6661. 585.10 s [vector] unfoldrExactNM: OK (0.02s)
  6662. 585.10 s [vector] +++ OK, passed 100 tests.
  6663. 585.10 s [vector] constructN: OK
  6664. 585.10 s [vector] +++ OK, passed 100 tests.
  6665. 585.10 s [vector] constructrN: OK
  6666. 585.10 s [vector] +++ OK, passed 100 tests.
  6667. 585.10 s [vector] cons: OK
  6668. 585.10 s [vector] +++ OK, passed 100 tests.
  6669. 585.10 s [vector] snoc: OK
  6670. 585.10 s [vector] +++ OK, passed 100 tests.
  6671. 585.10 s [vector] append: OK
  6672. 585.10 s [vector] +++ OK, passed 100 tests.
  6673. 585.10 s [vector] concat: OK
  6674. 585.10 s [vector] +++ OK, passed 100 tests.
  6675. 585.10 s [vector] force: OK
  6676. 585.10 s [vector] +++ OK, passed 100 tests.
  6677. 585.10 s [vector] upd: OK
  6678. 585.10 s [vector] +++ OK, passed 100 tests.
  6679. 585.10 s [vector] accum: OK
  6680. 585.10 s [vector] +++ OK, passed 100 tests.
  6681. 585.10 s [vector] reverse: OK
  6682. 585.10 s [vector] +++ OK, passed 100 tests.
  6683. 585.10 s [vector] backpermute: OK
  6684. 585.10 s [vector] +++ OK, passed 100 tests.
  6685. 585.10 s [vector] map: OK
  6686. 585.10 s [vector] +++ OK, passed 100 tests.
  6687. 585.10 s [vector] imap: OK
  6688. 585.10 s [vector] +++ OK, passed 100 tests.
  6689. 585.10 s [vector] concatMap: OK
  6690. 585.10 s [vector] +++ OK, passed 100 tests.
  6691. 585.10 s [vector] mapM: OK
  6692. 585.10 s [vector] +++ OK, passed 100 tests.
  6693. 585.10 s [vector] mapM_: OK (0.01s)
  6694. 585.10 s [vector] +++ OK, passed 100 tests.
  6695. 585.10 s [vector] forM: OK
  6696. 585.10 s [vector] +++ OK, passed 100 tests.
  6697. 585.10 s [vector] forM_: OK
  6698. 585.10 s [vector] +++ OK, passed 100 tests.
  6699. 585.10 s [vector] imapM: OK
  6700. 585.10 s [vector] +++ OK, passed 100 tests.
  6701. 585.10 s [vector] imapM_: OK (0.01s)
  6702. 585.10 s [vector] +++ OK, passed 100 tests.
  6703. 585.10 s [vector] zipWith: OK
  6704. 585.10 s [vector] +++ OK, passed 100 tests.
  6705. 585.10 s [vector] zipWith3: OK
  6706. 585.10 s [vector] +++ OK, passed 100 tests.
  6707. 585.10 s [vector] izipWith: OK
  6708. 585.10 s [vector] +++ OK, passed 100 tests.
  6709. 585.10 s [vector] izipWith3: OK
  6710. 585.10 s [vector] +++ OK, passed 100 tests.
  6711. 585.10 s [vector] izipWithM: OK
  6712. 585.10 s [vector] +++ OK, passed 100 tests.
  6713. 585.11 s [vector] izipWithM_: OK
  6714. 585.11 s [vector] +++ OK, passed 100 tests.
  6715. 585.11 s [vector] zipWithM: OK
  6716. 585.11 s [vector] +++ OK, passed 100 tests.
  6717. 585.12 s [vector] zipWithM_: OK
  6718. 585.12 s [vector] +++ OK, passed 100 tests.
  6719. 585.12 s [vector] filter: OK
  6720. 585.12 s [vector] +++ OK, passed 100 tests.
  6721. 585.12 s [vector] ifilter: OK
  6722. 585.12 s [vector] +++ OK, passed 100 tests.
  6723. 585.14 s [vector] filterM: OK (0.02s)
  6724. 585.14 s [vector] +++ OK, passed 100 tests.
  6725. 585.14 s [vector] uniq: OK
  6726. 585.14 s [vector] +++ OK, passed 100 tests.
  6727. 585.14 s [vector] mapMaybe: OK
  6728. 585.14 s [vector] +++ OK, passed 100 tests.
  6729. 585.14 s [vector] imapMaybe: OK
  6730. 585.14 s [vector] +++ OK, passed 100 tests.
  6731. 585.14 s [vector] takeWhile: OK
  6732. 585.14 s [vector] +++ OK, passed 100 tests.
  6733. 585.14 s [vector] dropWhile: OK
  6734. 585.14 s [vector] +++ OK, passed 100 tests.
  6735. 585.14 s [vector] partition: OK
  6736. 585.15 s [vector] +++ OK, passed 100 tests.
  6737. 585.15 s [vector] partitionWith: OK
  6738. 585.15 s [vector] +++ OK, passed 100 tests.
  6739. 585.15 s [vector] span: OK
  6740. 585.15 s [vector] +++ OK, passed 100 tests.
  6741. 585.15 s [vector] break: OK
  6742. 585.15 s [vector] +++ OK, passed 100 tests.
  6743. 585.15 s [vector] spanR: OK
  6744. 585.15 s [vector] +++ OK, passed 100 tests.
  6745. 585.15 s [vector] breakR: OK
  6746. 585.15 s [vector] +++ OK, passed 100 tests.
  6747. 585.15 s [vector] groupBy: OK
  6748. 585.15 s [vector] +++ OK, passed 100 tests.
  6749. 585.15 s [vector] elem: OK
  6750. 585.15 s [vector] +++ OK, passed 100 tests.
  6751. 585.15 s [vector] notElem: OK
  6752. 585.15 s [vector] +++ OK, passed 100 tests.
  6753. 585.15 s [vector] find: OK
  6754. 585.15 s [vector] +++ OK, passed 100 tests.
  6755. 585.15 s [vector] findIndex: OK
  6756. 585.15 s [vector] +++ OK, passed 100 tests.
  6757. 585.15 s [vector] findIndexR: OK
  6758. 585.15 s [vector] +++ OK, passed 100 tests.
  6759. 585.15 s [vector] findIndices: OK
  6760. 585.15 s [vector] +++ OK, passed 100 tests.
  6761. 585.15 s [vector] elemIndex: OK
  6762. 585.15 s [vector] +++ OK, passed 100 tests.
  6763. 585.15 s [vector] elemIndices: OK
  6764. 585.15 s [vector] +++ OK, passed 100 tests.
  6765. 585.15 s [vector] foldl: OK
  6766. 585.15 s [vector] +++ OK, passed 100 tests.
  6767. 585.16 s [vector] foldl1: OK
  6768. 585.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6769. 585.16 s [vector] foldl': OK
  6770. 585.16 s [vector] +++ OK, passed 100 tests.
  6771. 585.16 s [vector] foldl1': OK
  6772. 585.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6773. 585.16 s [vector] foldr: OK
  6774. 585.16 s [vector] +++ OK, passed 100 tests.
  6775. 585.16 s [vector] foldr1: OK
  6776. 585.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6777. 585.16 s [vector] foldr': OK
  6778. 585.16 s [vector] +++ OK, passed 100 tests.
  6779. 585.16 s [vector] foldr1': OK
  6780. 585.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6781. 585.16 s [vector] ifoldl: OK
  6782. 585.16 s [vector] +++ OK, passed 100 tests.
  6783. 585.16 s [vector] ifoldl': OK
  6784. 585.16 s [vector] +++ OK, passed 100 tests.
  6785. 585.16 s [vector] ifoldr: OK
  6786. 585.16 s [vector] +++ OK, passed 100 tests.
  6787. 585.16 s [vector] ifoldr': OK
  6788. 585.16 s [vector] +++ OK, passed 100 tests.
  6789. 585.17 s [vector] ifoldM: OK
  6790. 585.17 s [vector] +++ OK, passed 100 tests.
  6791. 585.18 s [vector] ifoldM': OK
  6792. 585.18 s [vector] +++ OK, passed 100 tests.
  6793. 585.18 s [vector] ifoldM_: OK (0.01s)
  6794. 585.18 s [vector] +++ OK, passed 100 tests.
  6795. 585.19 s [vector] ifoldM'_: OK
  6796. 585.19 s [vector] +++ OK, passed 100 tests.
  6797. 585.19 s [vector] all: OK
  6798. 585.19 s [vector] +++ OK, passed 100 tests.
  6799. 585.19 s [vector] any: OK
  6800. 585.19 s [vector] +++ OK, passed 100 tests.
  6801. 585.19 s [vector] prescanl: OK
  6802. 585.19 s [vector] +++ OK, passed 100 tests.
  6803. 585.19 s [vector] prescanl': OK
  6804. 585.20 s [vector] +++ OK, passed 100 tests.
  6805. 585.20 s [vector] postscanl: OK
  6806. 585.20 s [vector] +++ OK, passed 100 tests.
  6807. 585.20 s [vector] postscanl': OK
  6808. 585.20 s [vector] +++ OK, passed 100 tests.
  6809. 585.20 s [vector] scanl: OK
  6810. 585.20 s [vector] +++ OK, passed 100 tests.
  6811. 585.20 s [vector] scanl': OK
  6812. 585.20 s [vector] +++ OK, passed 100 tests.
  6813. 585.20 s [vector] scanl1: OK
  6814. 585.20 s [vector] +++ OK, passed 100 tests.
  6815. 585.20 s [vector] scanl1': OK
  6816. 585.20 s [vector] +++ OK, passed 100 tests.
  6817. 585.20 s [vector] iscanl: OK
  6818. 585.20 s [vector] +++ OK, passed 100 tests.
  6819. 585.20 s [vector] iscanl': OK
  6820. 585.20 s [vector] +++ OK, passed 100 tests.
  6821. 585.20 s [vector] prescanr: OK
  6822. 585.21 s [vector] +++ OK, passed 100 tests.
  6823. 585.21 s [vector] prescanr': OK
  6824. 585.21 s [vector] +++ OK, passed 100 tests.
  6825. 585.21 s [vector] postscanr: OK
  6826. 585.21 s [vector] +++ OK, passed 100 tests.
  6827. 585.21 s [vector] postscanr': OK
  6828. 585.21 s [vector] +++ OK, passed 100 tests.
  6829. 585.21 s [vector] scanr: OK
  6830. 585.21 s [vector] +++ OK, passed 100 tests.
  6831. 585.21 s [vector] scanr': OK
  6832. 585.21 s [vector] +++ OK, passed 100 tests.
  6833. 585.21 s [vector] scanr1: OK
  6834. 585.21 s [vector] +++ OK, passed 100 tests.
  6835. 585.21 s [vector] scanr1': OK
  6836. 585.21 s [vector] +++ OK, passed 100 tests.
  6837. 585.21 s [vector] iscanr: OK
  6838. 585.21 s [vector] +++ OK, passed 100 tests.
  6839. 585.22 s [vector] iscanr': OK
  6840. 585.22 s [vector] +++ OK, passed 100 tests.
  6841. 585.22 s [vector] mut_read: OK
  6842. 585.22 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6843. 585.22 s [vector] mut_write: OK
  6844. 585.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6845. 585.22 s [vector] mut_modify: OK
  6846. 585.22 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6847. 585.22 s [vector] mut_generate: OK
  6848. 585.22 s [vector] +++ OK, passed 100 tests.
  6849. 585.23 s [vector] mut_generateM: OK
  6850. 585.23 s [vector] +++ OK, passed 100 tests.
  6851. 585.23 s [vector] mut_mapM_: OK
  6852. 585.23 s [vector] +++ OK, passed 100 tests.
  6853. 585.25 s [vector] mut_imapM_: OK
  6854. 585.25 s [vector] +++ OK, passed 100 tests.
  6855. 585.25 s [vector] mut_forM_: OK (0.01s)
  6856. 585.25 s [vector] +++ OK, passed 100 tests.
  6857. 585.26 s [vector] mut_iforM_: OK
  6858. 585.26 s [vector] +++ OK, passed 100 tests.
  6859. 585.27 s [vector] mut_foldr: OK
  6860. 585.27 s [vector] +++ OK, passed 100 tests.
  6861. 585.27 s [vector] mut_foldr': OK
  6862. 585.27 s [vector] +++ OK, passed 100 tests.
  6863. 585.27 s [vector] mut_foldl: OK
  6864. 585.27 s [vector] +++ OK, passed 100 tests.
  6865. 585.27 s [vector] mut_foldl': OK
  6866. 585.27 s [vector] +++ OK, passed 100 tests.
  6867. 585.27 s [vector] mut_ifoldr: OK
  6868. 585.27 s [vector] +++ OK, passed 100 tests.
  6869. 585.27 s [vector] mut_ifoldr': OK
  6870. 585.27 s [vector] +++ OK, passed 100 tests.
  6871. 585.27 s [vector] mut_ifoldl: OK
  6872. 585.27 s [vector] +++ OK, passed 100 tests.
  6873. 585.27 s [vector] mut_ifoldl': OK
  6874. 585.27 s [vector] +++ OK, passed 100 tests.
  6875. 585.27 s [vector] mut_foldM: OK
  6876. 585.27 s [vector] +++ OK, passed 100 tests.
  6877. 585.27 s [vector] mut_foldM': OK
  6878. 585.28 s [vector] +++ OK, passed 100 tests.
  6879. 585.28 s [vector] mut_foldrM: OK
  6880. 585.28 s [vector] +++ OK, passed 100 tests.
  6881. 585.28 s [vector] mut_foldrM': OK
  6882. 585.28 s [vector] +++ OK, passed 100 tests.
  6883. 585.28 s [vector] mut_ifoldM: OK
  6884. 585.28 s [vector] +++ OK, passed 100 tests.
  6885. 585.28 s [vector] mut_ifoldM': OK
  6886. 585.28 s [vector] +++ OK, passed 100 tests.
  6887. 585.28 s [vector] mut_ifoldrM: OK
  6888. 585.28 s [vector] +++ OK, passed 100 tests.
  6889. 585.28 s [vector] mut_ifoldrM': OK
  6890. 585.28 s [vector] +++ OK, passed 100 tests.
  6891. 585.28 s [vector] compare: OK
  6892. 585.28 s [vector] +++ OK, passed 100 tests.
  6893. 585.28 s [vector] maximum: OK
  6894. 585.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6895. 585.28 s [vector] minimum: OK
  6896. 585.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6897. 585.28 s [vector] minIndex: OK
  6898. 585.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6899. 585.28 s [vector] maxIndex: OK
  6900. 585.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6901. 585.28 s [vector] maximumBy: OK
  6902. 585.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6903. 585.28 s [vector] minimumBy: OK
  6904. 585.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6905. 585.28 s [vector] maximumOn: OK
  6906. 585.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6907. 585.28 s [vector] minimumOn: OK
  6908. 585.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6909. 585.29 s [vector] maxIndexBy: OK
  6910. 585.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6911. 585.29 s [vector] minIndexBy: OK
  6912. 585.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6913. 585.29 s [vector] ListFirstMaxIndexWins: OK
  6914. 585.29 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6915. 585.30 s [vector] FalseListFirstMaxIndexWins: OK
  6916. 585.30 s [vector] +++ OK, failed as expected. (after 1 test):
  6917. 585.30 s [vector] Exception:
  6918. 585.30 s [vector] Prelude.foldr1: empty list
  6919. 585.30 s [vector] CallStack (from HasCallStack):
  6920. 585.30 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  6921. 585.30 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  6922. 585.30 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6923. 585.30 s [vector] []
  6924. 585.30 s [vector] zip: OK
  6925. 585.30 s [vector] +++ OK, passed 100 tests.
  6926. 585.30 s [vector] zip3: OK
  6927. 585.30 s [vector] +++ OK, passed 100 tests.
  6928. 585.30 s [vector] unzip: OK
  6929. 585.30 s [vector] +++ OK, passed 100 tests.
  6930. 585.30 s [vector] unzip3: OK
  6931. 585.30 s [vector] +++ OK, passed 100 tests.
  6932. 585.30 s [vector] indexed: OK
  6933. 585.30 s [vector] +++ OK, passed 100 tests.
  6934. 585.30 s [vector] update: OK
  6935. 585.30 s [vector] +++ OK, passed 100 tests.
  6936. 585.30 s [vector] concat: OK
  6937. 585.30 s [vector] +++ OK, passed 100 tests.
  6938. 585.30 s [vector] mempty: OK
  6939. 585.30 s [vector] +++ OK, passed 100 tests.
  6940. 585.30 s [vector] mappend: OK
  6941. 585.30 s [vector] +++ OK, passed 100 tests.
  6942. 585.30 s [vector] mconcat: OK
  6943. 585.30 s [vector] +++ OK, passed 100 tests.
  6944. 585.30 s [vector] fmap: OK
  6945. 585.30 s [vector] +++ OK, passed 100 tests.
  6946. 585.31 s [vector] return: OK
  6947. 585.31 s [vector] +++ OK, passed 100 tests.
  6948. 585.31 s [vector] bind: OK
  6949. 585.31 s [vector] +++ OK, passed 100 tests.
  6950. 585.31 s [vector] mzip: OK
  6951. 585.31 s [vector] +++ OK, passed 100 tests.
  6952. 585.31 s [vector] munzip: OK
  6953. 585.31 s [vector] +++ OK, passed 100 tests.
  6954. 585.31 s [vector] applicative_pure: OK
  6955. 585.31 s [vector] +++ OK, passed 100 tests.
  6956. 585.33 s [vector] applicative_appl: OK
  6957. 585.33 s [vector] +++ OK, passed 100 tests.
  6958. 585.33 s [vector] alternative_empty: OK
  6959. 585.33 s [vector] +++ OK, passed 100 tests.
  6960. 585.33 s [vector] alternative_or: OK
  6961. 585.33 s [vector] +++ OK, passed 100 tests.
  6962. 585.35 s [vector] sequence: OK (0.03s)
  6963. 585.36 s [vector] +++ OK, passed 100 tests.
  6964. 585.36 s [vector] sequence_: OK
  6965. 585.36 s [vector] +++ OK, passed 100 tests.
  6966. 585.36 s [vector] glength: OK
  6967. 585.37 s [vector] +++ OK, passed 100 tests.
  6968. 585.37 s [vector] and: OK
  6969. 585.37 s [vector] +++ OK, passed 100 tests.
  6970. 585.37 s [vector] or: OK
  6971. 585.37 s [vector] +++ OK, passed 100 tests.
  6972. 585.37 s [vector] Int
  6973. 585.37 s [vector] fromList.toList == id: OK
  6974. 585.37 s [vector] +++ OK, passed 100 tests.
  6975. 585.37 s [vector] toList.fromList == id: OK
  6976. 585.37 s [vector] +++ OK, passed 100 tests.
  6977. 585.37 s [vector] unstream.stream == id: OK
  6978. 585.37 s [vector] +++ OK, passed 100 tests.
  6979. 585.37 s [vector] stream.unstream == id: OK
  6980. 585.37 s [vector] +++ OK, passed 100 tests.
  6981. 585.37 s [vector] eq: OK
  6982. 585.37 s [vector] +++ OK, passed 100 tests.
  6983. 585.37 s [vector] length: OK
  6984. 585.37 s [vector] +++ OK, passed 100 tests.
  6985. 585.37 s [vector] null: OK
  6986. 585.37 s [vector] +++ OK, passed 100 tests.
  6987. 585.37 s [vector] index: OK
  6988. 585.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6989. 585.37 s [vector] safeIndex: OK
  6990. 585.37 s [vector] +++ OK, passed 100 tests.
  6991. 585.37 s [vector] head: OK
  6992. 585.37 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6993. 585.37 s [vector] last: OK
  6994. 585.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6995. 585.37 s [vector] unsafeIndex: OK
  6996. 585.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6997. 585.37 s [vector] unsafeHead: OK
  6998. 585.37 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6999. 585.37 s [vector] unsafeLast: OK
  7000. 585.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7001. 585.37 s [vector] slice: OK
  7002. 585.37 s [vector] +++ OK, passed 100 tests.
  7003. 585.37 s [vector] init: OK
  7004. 585.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7005. 585.37 s [vector] tail: OK
  7006. 585.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7007. 585.37 s [vector] take: OK
  7008. 585.37 s [vector] +++ OK, passed 100 tests.
  7009. 585.37 s [vector] drop: OK
  7010. 585.37 s [vector] +++ OK, passed 100 tests.
  7011. 585.38 s [vector] splitAt: OK
  7012. 585.38 s [vector] +++ OK, passed 100 tests.
  7013. 585.38 s [vector] empty: OK
  7014. 585.38 s [vector] +++ OK, passed 100 tests.
  7015. 585.38 s [vector] singleton: OK
  7016. 585.38 s [vector] +++ OK, passed 100 tests.
  7017. 585.38 s [vector] replicate: OK
  7018. 585.38 s [vector] +++ OK, passed 100 tests.
  7019. 585.38 s [vector] generate: OK
  7020. 585.38 s [vector] +++ OK, passed 100 tests.
  7021. 585.38 s [vector] iterateN: OK
  7022. 585.39 s [vector] +++ OK, passed 100 tests.
  7023. 585.40 s [vector] iterateNM: OK (0.01s)
  7024. 585.40 s [vector] +++ OK, passed 100 tests.
  7025. 585.42 s [vector] generateM: OK (0.02s)
  7026. 585.42 s [vector] +++ OK, passed 100 tests.
  7027. 585.42 s [vector] replicateM: OK (0.01s)
  7028. 585.42 s [vector] +++ OK, passed 100 tests.
  7029. 585.42 s [vector] create: OK
  7030. 585.42 s [vector] +++ OK, passed 100 tests.
  7031. 585.42 s [vector] createT: OK
  7032. 585.42 s [vector] +++ OK, passed 100 tests.
  7033. 585.42 s [vector] unfoldr: OK
  7034. 585.42 s [vector] +++ OK, passed 100 tests.
  7035. 585.42 s [vector] unfoldrN: OK
  7036. 585.42 s [vector] +++ OK, passed 100 tests.
  7037. 585.42 s [vector] unfoldrExactN: OK
  7038. 585.42 s [vector] +++ OK, passed 100 tests.
  7039. 585.43 s [vector] unfoldrM: OK
  7040. 585.43 s [vector] +++ OK, passed 100 tests.
  7041. 585.43 s [vector] unfoldrNM: OK
  7042. 585.43 s [vector] +++ OK, passed 100 tests.
  7043. 585.45 s [vector] unfoldrExactNM: OK (0.02s)
  7044. 585.45 s [vector] +++ OK, passed 100 tests.
  7045. 585.46 s [vector] constructN: OK
  7046. 585.46 s [vector] +++ OK, passed 100 tests.
  7047. 585.46 s [vector] constructrN: OK
  7048. 585.46 s [vector] +++ OK, passed 100 tests.
  7049. 585.46 s [vector] cons: OK
  7050. 585.46 s [vector] +++ OK, passed 100 tests.
  7051. 585.46 s [vector] snoc: OK
  7052. 585.46 s [vector] +++ OK, passed 100 tests.
  7053. 585.46 s [vector] append: OK
  7054. 585.46 s [vector] +++ OK, passed 100 tests.
  7055. 585.47 s [vector] concat: OK
  7056. 585.47 s [vector] +++ OK, passed 100 tests.
  7057. 585.47 s [vector] force: OK
  7058. 585.47 s [vector] +++ OK, passed 100 tests.
  7059. 585.47 s [vector] upd: OK
  7060. 585.47 s [vector] +++ OK, passed 100 tests.
  7061. 585.47 s [vector] accum: OK
  7062. 585.47 s [vector] +++ OK, passed 100 tests.
  7063. 585.47 s [vector] reverse: OK
  7064. 585.47 s [vector] +++ OK, passed 100 tests.
  7065. 585.47 s [vector] backpermute: OK
  7066. 585.47 s [vector] +++ OK, passed 100 tests.
  7067. 585.48 s [vector] map: OK
  7068. 585.48 s [vector] +++ OK, passed 100 tests.
  7069. 585.48 s [vector] imap: OK
  7070. 585.48 s [vector] +++ OK, passed 100 tests.
  7071. 585.48 s [vector] concatMap: OK
  7072. 585.48 s [vector] +++ OK, passed 100 tests.
  7073. 585.49 s [vector] mapM: OK
  7074. 585.49 s [vector] +++ OK, passed 100 tests.
  7075. 585.50 s [vector] mapM_: OK (0.01s)
  7076. 585.50 s [vector] +++ OK, passed 100 tests.
  7077. 585.50 s [vector] forM: OK
  7078. 585.50 s [vector] +++ OK, passed 100 tests.
  7079. 585.51 s [vector] forM_: OK (0.01s)
  7080. 585.52 s [vector] +++ OK, passed 100 tests.
  7081. 585.52 s [vector] imapM: OK
  7082. 585.52 s [vector] +++ OK, passed 100 tests.
  7083. 585.53 s [vector] imapM_: OK (0.01s)
  7084. 585.53 s [vector] +++ OK, passed 100 tests.
  7085. 585.53 s [vector] zipWith: OK
  7086. 585.53 s [vector] +++ OK, passed 100 tests.
  7087. 585.53 s [vector] zipWith3: OK
  7088. 585.53 s [vector] +++ OK, passed 100 tests.
  7089. 585.53 s [vector] izipWith: OK
  7090. 585.53 s [vector] +++ OK, passed 100 tests.
  7091. 585.53 s [vector] izipWith3: OK
  7092. 585.54 s [vector] +++ OK, passed 100 tests.
  7093. 585.54 s [vector] izipWithM: OK
  7094. 585.54 s [vector] +++ OK, passed 100 tests.
  7095. 585.55 s [vector] izipWithM_: OK (0.01s)
  7096. 585.56 s [vector] +++ OK, passed 100 tests.
  7097. 585.56 s [vector] zipWithM: OK
  7098. 585.56 s [vector] +++ OK, passed 100 tests.
  7099. 585.56 s [vector] zipWithM_: OK (0.01s)
  7100. 585.56 s [vector] +++ OK, passed 100 tests.
  7101. 585.56 s [vector] filter: OK
  7102. 585.56 s [vector] +++ OK, passed 100 tests.
  7103. 585.58 s [vector] ifilter: OK
  7104. 585.58 s [vector] +++ OK, passed 100 tests.
  7105. 585.58 s [vector] filterM: OK (0.02s)
  7106. 585.58 s [vector] +++ OK, passed 100 tests.
  7107. 585.58 s [vector] uniq: OK
  7108. 585.59 s [vector] +++ OK, passed 100 tests.
  7109. 585.59 s [vector] mapMaybe: OK
  7110. 585.59 s [vector] +++ OK, passed 100 tests.
  7111. 585.59 s [vector] imapMaybe: OK
  7112. 585.59 s [vector] +++ OK, passed 100 tests.
  7113. 585.59 s [vector] takeWhile: OK
  7114. 585.59 s [vector] +++ OK, passed 100 tests.
  7115. 585.59 s [vector] dropWhile: OK
  7116. 585.59 s [vector] +++ OK, passed 100 tests.
  7117. 585.59 s [vector] partition: OK
  7118. 585.59 s [vector] +++ OK, passed 100 tests.
  7119. 585.59 s [vector] partitionWith: OK
  7120. 585.59 s [vector] +++ OK, passed 100 tests.
  7121. 585.59 s [vector] span: OK
  7122. 585.59 s [vector] +++ OK, passed 100 tests.
  7123. 585.59 s [vector] break: OK
  7124. 585.59 s [vector] +++ OK, passed 100 tests.
  7125. 585.59 s [vector] spanR: OK
  7126. 585.59 s [vector] +++ OK, passed 100 tests.
  7127. 585.59 s [vector] breakR: OK
  7128. 585.59 s [vector] +++ OK, passed 100 tests.
  7129. 585.59 s [vector] groupBy: OK
  7130. 585.59 s [vector] +++ OK, passed 100 tests.
  7131. 585.59 s [vector] elem: OK
  7132. 585.60 s [vector] +++ OK, passed 100 tests.
  7133. 585.60 s [vector] notElem: OK
  7134. 585.60 s [vector] +++ OK, passed 100 tests.
  7135. 585.60 s [vector] find: OK
  7136. 585.60 s [vector] +++ OK, passed 100 tests.
  7137. 585.60 s [vector] findIndex: OK
  7138. 585.60 s [vector] +++ OK, passed 100 tests.
  7139. 585.60 s [vector] findIndexR: OK
  7140. 585.60 s [vector] +++ OK, passed 100 tests.
  7141. 585.60 s [vector] findIndices: OK
  7142. 585.60 s [vector] +++ OK, passed 100 tests.
  7143. 585.60 s [vector] elemIndex: OK
  7144. 585.60 s [vector] +++ OK, passed 100 tests.
  7145. 585.60 s [vector] elemIndices: OK
  7146. 585.60 s [vector] +++ OK, passed 100 tests.
  7147. 585.60 s [vector] foldl: OK
  7148. 585.60 s [vector] +++ OK, passed 100 tests.
  7149. 585.60 s [vector] foldl1: OK
  7150. 585.60 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7151. 585.60 s [vector] foldl': OK
  7152. 585.60 s [vector] +++ OK, passed 100 tests.
  7153. 585.60 s [vector] foldl1': OK
  7154. 585.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7155. 585.61 s [vector] foldr: OK
  7156. 585.61 s [vector] +++ OK, passed 100 tests.
  7157. 585.61 s [vector] foldr1: OK
  7158. 585.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7159. 585.62 s [vector] foldr': OK
  7160. 585.62 s [vector] +++ OK, passed 100 tests.
  7161. 585.62 s [vector] foldr1': OK
  7162. 585.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7163. 585.62 s [vector] ifoldl: OK
  7164. 585.63 s [vector] +++ OK, passed 100 tests.
  7165. 585.64 s [vector] ifoldl': OK
  7166. 585.64 s [vector] +++ OK, passed 100 tests.
  7167. 585.64 s [vector] ifoldr: OK
  7168. 585.64 s [vector] +++ OK, passed 100 tests.
  7169. 585.64 s [vector] ifoldr': OK
  7170. 585.64 s [vector] +++ OK, passed 100 tests.
  7171. 585.64 s [vector] ifoldM: OK
  7172. 585.64 s [vector] +++ OK, passed 100 tests.
  7173. 585.64 s [vector] ifoldM': OK
  7174. 585.64 s [vector] +++ OK, passed 100 tests.
  7175. 585.64 s [vector] ifoldM_: OK (0.02s)
  7176. 585.64 s [vector] +++ OK, passed 100 tests.
  7177. 585.66 s [vector] ifoldM'_: OK
  7178. 585.66 s [vector] +++ OK, passed 100 tests.
  7179. 585.66 s [vector] all: OK
  7180. 585.66 s [vector] +++ OK, passed 100 tests.
  7181. 585.66 s [vector] any: OK
  7182. 585.66 s [vector] +++ OK, passed 100 tests.
  7183. 585.66 s [vector] prescanl: OK
  7184. 585.66 s [vector] +++ OK, passed 100 tests.
  7185. 585.66 s [vector] prescanl': OK
  7186. 585.66 s [vector] +++ OK, passed 100 tests.
  7187. 585.66 s [vector] postscanl: OK
  7188. 585.66 s [vector] +++ OK, passed 100 tests.
  7189. 585.67 s [vector] postscanl': OK
  7190. 585.67 s [vector] +++ OK, passed 100 tests.
  7191. 585.67 s [vector] scanl: OK
  7192. 585.67 s [vector] +++ OK, passed 100 tests.
  7193. 585.67 s [vector] scanl': OK
  7194. 585.67 s [vector] +++ OK, passed 100 tests.
  7195. 585.67 s [vector] scanl1: OK
  7196. 585.67 s [vector] +++ OK, passed 100 tests.
  7197. 585.67 s [vector] scanl1': OK
  7198. 585.67 s [vector] +++ OK, passed 100 tests.
  7199. 585.68 s [vector] iscanl: OK
  7200. 585.68 s [vector] +++ OK, passed 100 tests.
  7201. 585.68 s [vector] iscanl': OK
  7202. 585.68 s [vector] +++ OK, passed 100 tests.
  7203. 585.69 s [vector] prescanr: OK
  7204. 585.69 s [vector] +++ OK, passed 100 tests.
  7205. 585.69 s [vector] prescanr': OK
  7206. 585.69 s [vector] +++ OK, passed 100 tests.
  7207. 585.69 s [vector] postscanr: OK
  7208. 585.69 s [vector] +++ OK, passed 100 tests.
  7209. 585.69 s [vector] postscanr': OK
  7210. 585.69 s [vector] +++ OK, passed 100 tests.
  7211. 585.69 s [vector] scanr: OK
  7212. 585.69 s [vector] +++ OK, passed 100 tests.
  7213. 585.69 s [vector] scanr': OK
  7214. 585.69 s [vector] +++ OK, passed 100 tests.
  7215. 585.69 s [vector] scanr1: OK
  7216. 585.69 s [vector] +++ OK, passed 100 tests.
  7217. 585.70 s [vector] scanr1': OK
  7218. 585.70 s [vector] +++ OK, passed 100 tests.
  7219. 585.70 s [vector] iscanr: OK
  7220. 585.70 s [vector] +++ OK, passed 100 tests.
  7221. 585.70 s [vector] iscanr': OK
  7222. 585.70 s [vector] +++ OK, passed 100 tests.
  7223. 585.70 s [vector] mut_read: OK
  7224. 585.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7225. 585.70 s [vector] mut_write: OK
  7226. 585.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7227. 585.70 s [vector] mut_modify: OK
  7228. 585.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7229. 585.71 s [vector] mut_generate: OK
  7230. 585.72 s [vector] +++ OK, passed 100 tests.
  7231. 585.72 s [vector] mut_generateM: OK
  7232. 585.72 s [vector] +++ OK, passed 100 tests.
  7233. 585.74 s [vector] mut_mapM_: OK (0.01s)
  7234. 585.74 s [vector] +++ OK, passed 100 tests.
  7235. 585.74 s [vector] mut_imapM_: OK (0.01s)
  7236. 585.74 s [vector] +++ OK, passed 100 tests.
  7237. 585.76 s [vector] mut_forM_: OK (0.01s)
  7238. 585.76 s [vector] +++ OK, passed 100 tests.
  7239. 585.76 s [vector] mut_iforM_: OK (0.01s)
  7240. 585.76 s [vector] +++ OK, passed 100 tests.
  7241. 585.76 s [vector] mut_foldr: OK
  7242. 585.76 s [vector] +++ OK, passed 100 tests.
  7243. 585.76 s [vector] mut_foldr': OK
  7244. 585.76 s [vector] +++ OK, passed 100 tests.
  7245. 585.77 s [vector] mut_foldl: OK
  7246. 585.77 s [vector] +++ OK, passed 100 tests.
  7247. 585.77 s [vector] mut_foldl': OK
  7248. 585.77 s [vector] +++ OK, passed 100 tests.
  7249. 585.78 s [vector] mut_ifoldr: OK
  7250. 585.78 s [vector] +++ OK, passed 100 tests.
  7251. 585.78 s [vector] mut_ifoldr': OK
  7252. 585.78 s [vector] +++ OK, passed 100 tests.
  7253. 585.78 s [vector] mut_ifoldl: OK
  7254. 585.78 s [vector] +++ OK, passed 100 tests.
  7255. 585.78 s [vector] mut_ifoldl': OK
  7256. 585.78 s [vector] +++ OK, passed 100 tests.
  7257. 585.78 s [vector] mut_foldM: OK
  7258. 585.78 s [vector] +++ OK, passed 100 tests.
  7259. 585.78 s [vector] mut_foldM': OK
  7260. 585.78 s [vector] +++ OK, passed 100 tests.
  7261. 585.78 s [vector] mut_foldrM: OK
  7262. 585.79 s [vector] +++ OK, passed 100 tests.
  7263. 585.79 s [vector] mut_foldrM': OK
  7264. 585.79 s [vector] +++ OK, passed 100 tests.
  7265. 585.79 s [vector] mut_ifoldM: OK
  7266. 585.79 s [vector] +++ OK, passed 100 tests.
  7267. 585.80 s [vector] mut_ifoldM': OK
  7268. 585.80 s [vector] +++ OK, passed 100 tests.
  7269. 585.80 s [vector] mut_ifoldrM: OK
  7270. 585.80 s [vector] +++ OK, passed 100 tests.
  7271. 585.80 s [vector] mut_ifoldrM': OK
  7272. 585.80 s [vector] +++ OK, passed 100 tests.
  7273. 585.80 s [vector] compare: OK
  7274. 585.80 s [vector] +++ OK, passed 100 tests.
  7275. 585.80 s [vector] maximum: OK
  7276. 585.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7277. 585.80 s [vector] minimum: OK
  7278. 585.80 s [vector] +++ OK, passed 100 tests; 23 discarded.
  7279. 585.80 s [vector] minIndex: OK
  7280. 585.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7281. 585.80 s [vector] maxIndex: OK
  7282. 585.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7283. 585.80 s [vector] maximumBy: OK
  7284. 585.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7285. 585.80 s [vector] minimumBy: OK
  7286. 585.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7287. 585.80 s [vector] maximumOn: OK
  7288. 585.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7289. 585.80 s [vector] minimumOn: OK
  7290. 585.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7291. 585.80 s [vector] maxIndexBy: OK
  7292. 585.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7293. 585.80 s [vector] minIndexBy: OK
  7294. 585.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7295. 585.80 s [vector] ListFirstMaxIndexWins: OK
  7296. 585.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7297. 585.80 s [vector] FalseListFirstMaxIndexWins: OK
  7298. 585.80 s [vector] +++ OK, failed as expected. (after 1 test):
  7299. 585.80 s [vector] Exception:
  7300. 585.80 s [vector] Prelude.foldr1: empty list
  7301. 585.80 s [vector] CallStack (from HasCallStack):
  7302. 585.80 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  7303. 585.80 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  7304. 585.80 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7305. 585.80 s [vector] []
  7306. 585.80 s [vector] zip: OK
  7307. 585.80 s [vector] +++ OK, passed 100 tests.
  7308. 585.80 s [vector] zip3: OK
  7309. 585.80 s [vector] +++ OK, passed 100 tests.
  7310. 585.80 s [vector] unzip: OK
  7311. 585.80 s [vector] +++ OK, passed 100 tests.
  7312. 585.80 s [vector] unzip3: OK
  7313. 585.80 s [vector] +++ OK, passed 100 tests.
  7314. 585.81 s [vector] indexed: OK
  7315. 585.81 s [vector] +++ OK, passed 100 tests.
  7316. 585.81 s [vector] update: OK
  7317. 585.81 s [vector] +++ OK, passed 100 tests.
  7318. 585.81 s [vector] concat: OK
  7319. 585.81 s [vector] +++ OK, passed 100 tests.
  7320. 585.81 s [vector] mempty: OK
  7321. 585.81 s [vector] +++ OK, passed 100 tests.
  7322. 585.82 s [vector] mappend: OK
  7323. 585.82 s [vector] +++ OK, passed 100 tests.
  7324. 585.82 s [vector] mconcat: OK
  7325. 585.82 s [vector] +++ OK, passed 100 tests.
  7326. 585.82 s [vector] fmap: OK
  7327. 585.82 s [vector] +++ OK, passed 100 tests.
  7328. 585.84 s [vector] return: OK
  7329. 585.84 s [vector] +++ OK, passed 100 tests.
  7330. 585.84 s [vector] bind: OK (0.01s)
  7331. 585.84 s [vector] +++ OK, passed 100 tests.
  7332. 585.84 s [vector] mzip: OK
  7333. 585.84 s [vector] +++ OK, passed 100 tests.
  7334. 585.84 s [vector] munzip: OK
  7335. 585.86 s [vector] +++ OK, passed 100 tests.
  7336. 585.86 s [vector] applicative_pure: OK
  7337. 585.86 s [vector] +++ OK, passed 100 tests.
  7338. 585.86 s [vector] applicative_appl: OK (0.02s)
  7339. 585.86 s [vector] +++ OK, passed 100 tests.
  7340. 585.86 s [vector] alternative_empty: OK
  7341. 585.86 s [vector] +++ OK, passed 100 tests.
  7342. 585.86 s [vector] alternative_or: OK
  7343. 585.86 s [vector] +++ OK, passed 100 tests.
  7344. 585.90 s [vector] sequence: OK (0.02s)
  7345. 585.90 s [vector] +++ OK, passed 100 tests.
  7346. 585.90 s [vector] sequence_: OK
  7347. 585.90 s [vector] +++ OK, passed 100 tests.
  7348. 585.90 s [vector] glength: OK
  7349. 585.90 s [vector] +++ OK, passed 100 tests.
  7350. 585.90 s [vector] sum: OK
  7351. 585.90 s [vector] +++ OK, passed 100 tests.
  7352. 585.90 s [vector] product: OK
  7353. 585.90 s [vector] +++ OK, passed 100 tests.
  7354. 585.90 s [vector] enumFromN: OK
  7355. 585.90 s [vector] +++ OK, passed 100 tests.
  7356. 585.90 s [vector] enumFromThenN: OK
  7357. 585.90 s [vector] +++ OK, passed 100 tests.
  7358. 585.90 s [vector] enumFromTo: OK
  7359. 585.90 s [vector] +++ OK, passed 100 tests.
  7360. 585.90 s [vector] enumFromThenTo: OK
  7361. 585.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7362. 585.90 s [vector] unstream
  7363. 585.90 s [vector] unstream == vunstream (exact): OK
  7364. 585.90 s [vector] +++ OK, passed 100 tests.
  7365. 585.90 s [vector] unstream == vunstream (unknown): OK
  7366. 585.90 s [vector] +++ OK, passed 100 tests.
  7367. 585.90 s [vector] unstreamR ~= vunstream (exact): OK
  7368. 585.90 s [vector] +++ OK, passed 100 tests.
  7369. 585.90 s [vector] unstreamR ~= vunstream (unknown): OK
  7370. 585.90 s [vector] +++ OK, passed 100 tests.
  7371. 585.91 s [vector] Tests.Vector.Primitive
  7372. 585.91 s [vector] Int
  7373. 585.91 s [vector] fromList.toList == id: OK
  7374. 585.91 s [vector] +++ OK, passed 100 tests.
  7375. 585.91 s [vector] toList.fromList == id: OK
  7376. 585.91 s [vector] +++ OK, passed 100 tests.
  7377. 585.91 s [vector] unstream.stream == id: OK
  7378. 585.91 s [vector] +++ OK, passed 100 tests.
  7379. 585.91 s [vector] stream.unstream == id: OK
  7380. 585.91 s [vector] +++ OK, passed 100 tests.
  7381. 585.91 s [vector] eq: OK
  7382. 585.91 s [vector] +++ OK, passed 100 tests.
  7383. 585.91 s [vector] length: OK
  7384. 585.91 s [vector] +++ OK, passed 100 tests.
  7385. 585.91 s [vector] null: OK
  7386. 585.91 s [vector] +++ OK, passed 100 tests.
  7387. 585.91 s [vector] index: OK
  7388. 585.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7389. 585.91 s [vector] safeIndex: OK
  7390. 585.91 s [vector] +++ OK, passed 100 tests.
  7391. 585.91 s [vector] head: OK
  7392. 585.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7393. 585.91 s [vector] last: OK
  7394. 585.91 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7395. 585.91 s [vector] unsafeIndex: OK
  7396. 585.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7397. 585.91 s [vector] unsafeHead: OK
  7398. 585.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7399. 585.91 s [vector] unsafeLast: OK
  7400. 585.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7401. 585.91 s [vector] slice: OK
  7402. 585.91 s [vector] +++ OK, passed 100 tests.
  7403. 585.91 s [vector] init: OK
  7404. 585.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7405. 585.91 s [vector] tail: OK
  7406. 585.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7407. 585.91 s [vector] take: OK
  7408. 585.91 s [vector] +++ OK, passed 100 tests.
  7409. 585.91 s [vector] drop: OK
  7410. 585.91 s [vector] +++ OK, passed 100 tests.
  7411. 585.91 s [vector] splitAt: OK
  7412. 585.91 s [vector] +++ OK, passed 100 tests.
  7413. 585.91 s [vector] empty: OK
  7414. 585.91 s [vector] +++ OK, passed 100 tests.
  7415. 585.91 s [vector] singleton: OK
  7416. 585.91 s [vector] +++ OK, passed 100 tests.
  7417. 585.91 s [vector] replicate: OK
  7418. 585.91 s [vector] +++ OK, passed 100 tests.
  7419. 585.91 s [vector] generate: OK
  7420. 585.91 s [vector] +++ OK, passed 100 tests.
  7421. 585.91 s [vector] iterateN: OK
  7422. 585.91 s [vector] +++ OK, passed 100 tests.
  7423. 585.95 s [vector] iterateNM: OK (0.02s)
  7424. 585.96 s [vector] +++ OK, passed 100 tests.
  7425. 585.96 s [vector] generateM: OK (0.01s)
  7426. 585.96 s [vector] +++ OK, passed 100 tests.
  7427. 585.96 s [vector] replicateM: OK
  7428. 585.96 s [vector] +++ OK, passed 100 tests.
  7429. 585.96 s [vector] create: OK
  7430. 585.96 s [vector] +++ OK, passed 100 tests.
  7431. 585.96 s [vector] createT: OK
  7432. 585.96 s [vector] +++ OK, passed 100 tests.
  7433. 585.96 s [vector] unfoldr: OK
  7434. 585.96 s [vector] +++ OK, passed 100 tests.
  7435. 585.96 s [vector] unfoldrN: OK
  7436. 585.96 s [vector] +++ OK, passed 100 tests.
  7437. 585.96 s [vector] unfoldrExactN: OK
  7438. 585.96 s [vector] +++ OK, passed 100 tests.
  7439. 585.97 s [vector] unfoldrM: OK
  7440. 585.98 s [vector] +++ OK, passed 100 tests.
  7441. 585.98 s [vector] unfoldrNM: OK
  7442. 585.98 s [vector] +++ OK, passed 100 tests.
  7443. 586.01 s [vector] unfoldrExactNM: OK (0.04s)
  7444. 586.01 s [vector] +++ OK, passed 100 tests.
  7445. 586.01 s [vector] constructN: OK
  7446. 586.01 s [vector] +++ OK, passed 100 tests.
  7447. 586.01 s [vector] constructrN: OK
  7448. 586.01 s [vector] +++ OK, passed 100 tests.
  7449. 586.01 s [vector] cons: OK
  7450. 586.01 s [vector] +++ OK, passed 100 tests.
  7451. 586.01 s [vector] snoc: OK
  7452. 586.02 s [vector] +++ OK, passed 100 tests.
  7453. 586.02 s [vector] append: OK
  7454. 586.02 s [vector] +++ OK, passed 100 tests.
  7455. 586.02 s [vector] concat: OK (0.01s)
  7456. 586.02 s [vector] +++ OK, passed 100 tests.
  7457. 586.02 s [vector] force: OK
  7458. 586.02 s [vector] +++ OK, passed 100 tests.
  7459. 586.02 s [vector] upd: OK
  7460. 586.02 s [vector] +++ OK, passed 100 tests.
  7461. 586.03 s [vector] accum: OK
  7462. 586.03 s [vector] +++ OK, passed 100 tests.
  7463. 586.03 s [vector] reverse: OK
  7464. 586.03 s [vector] +++ OK, passed 100 tests.
  7465. 586.04 s [vector] backpermute: OK
  7466. 586.04 s [vector] +++ OK, passed 100 tests.
  7467. 586.04 s [vector] map: OK
  7468. 586.04 s [vector] +++ OK, passed 100 tests.
  7469. 586.04 s [vector] imap: OK
  7470. 586.04 s [vector] +++ OK, passed 100 tests.
  7471. 586.04 s [vector] concatMap: OK
  7472. 586.04 s [vector] +++ OK, passed 100 tests.
  7473. 586.04 s [vector] mapM: OK
  7474. 586.04 s [vector] +++ OK, passed 100 tests.
  7475. 586.05 s [vector] mapM_: OK (0.01s)
  7476. 586.06 s [vector] +++ OK, passed 100 tests.
  7477. 586.06 s [vector] forM: OK
  7478. 586.06 s [vector] +++ OK, passed 100 tests.
  7479. 586.07 s [vector] forM_: OK (0.02s)
  7480. 586.08 s [vector] +++ OK, passed 100 tests.
  7481. 586.08 s [vector] imapM: OK
  7482. 586.08 s [vector] +++ OK, passed 100 tests.
  7483. 586.08 s [vector] imapM_: OK (0.01s)
  7484. 586.08 s [vector] +++ OK, passed 100 tests.
  7485. 586.08 s [vector] zipWith: OK
  7486. 586.09 s [vector] +++ OK, passed 100 tests.
  7487. 586.09 s [vector] zipWith3: OK
  7488. 586.09 s [vector] +++ OK, passed 100 tests.
  7489. 586.09 s [vector] izipWith: OK
  7490. 586.09 s [vector] +++ OK, passed 100 tests.
  7491. 586.09 s [vector] izipWith3: OK
  7492. 586.09 s [vector] +++ OK, passed 100 tests.
  7493. 586.10 s [vector] izipWithM: OK
  7494. 586.10 s [vector] +++ OK, passed 100 tests.
  7495. 586.10 s [vector] izipWithM_: OK
  7496. 586.10 s [vector] +++ OK, passed 100 tests.
  7497. 586.11 s [vector] zipWithM: OK
  7498. 586.11 s [vector] +++ OK, passed 100 tests.
  7499. 586.11 s [vector] zipWithM_: OK
  7500. 586.11 s [vector] +++ OK, passed 100 tests.
  7501. 586.12 s [vector] filter: OK
  7502. 586.12 s [vector] +++ OK, passed 100 tests.
  7503. 586.12 s [vector] ifilter: OK
  7504. 586.12 s [vector] +++ OK, passed 100 tests.
  7505. 586.14 s [vector] filterM: OK (0.02s)
  7506. 586.14 s [vector] +++ OK, passed 100 tests.
  7507. 586.14 s [vector] uniq: OK
  7508. 586.14 s [vector] +++ OK, passed 100 tests.
  7509. 586.15 s [vector] mapMaybe: OK
  7510. 586.15 s [vector] +++ OK, passed 100 tests.
  7511. 586.15 s [vector] imapMaybe: OK
  7512. 586.15 s [vector] +++ OK, passed 100 tests.
  7513. 586.15 s [vector] takeWhile: OK
  7514. 586.15 s [vector] +++ OK, passed 100 tests.
  7515. 586.15 s [vector] dropWhile: OK
  7516. 586.15 s [vector] +++ OK, passed 100 tests.
  7517. 586.15 s [vector] partition: OK
  7518. 586.15 s [vector] +++ OK, passed 100 tests.
  7519. 586.15 s [vector] partitionWith: OK
  7520. 586.15 s [vector] +++ OK, passed 100 tests.
  7521. 586.15 s [vector] span: OK
  7522. 586.15 s [vector] +++ OK, passed 100 tests.
  7523. 586.15 s [vector] break: OK
  7524. 586.15 s [vector] +++ OK, passed 100 tests.
  7525. 586.15 s [vector] spanR: OK
  7526. 586.16 s [vector] +++ OK, passed 100 tests.
  7527. 586.16 s [vector] breakR: OK
  7528. 586.16 s [vector] +++ OK, passed 100 tests.
  7529. 586.16 s [vector] groupBy: OK
  7530. 586.16 s [vector] +++ OK, passed 100 tests.
  7531. 586.16 s [vector] elem: OK
  7532. 586.16 s [vector] +++ OK, passed 100 tests.
  7533. 586.16 s [vector] notElem: OK
  7534. 586.16 s [vector] +++ OK, passed 100 tests.
  7535. 586.16 s [vector] find: OK
  7536. 586.16 s [vector] +++ OK, passed 100 tests.
  7537. 586.16 s [vector] findIndex: OK
  7538. 586.16 s [vector] +++ OK, passed 100 tests.
  7539. 586.16 s [vector] findIndexR: OK
  7540. 586.16 s [vector] +++ OK, passed 100 tests.
  7541. 586.16 s [vector] findIndices: OK
  7542. 586.16 s [vector] +++ OK, passed 100 tests.
  7543. 586.16 s [vector] elemIndex: OK
  7544. 586.16 s [vector] +++ OK, passed 100 tests.
  7545. 586.16 s [vector] elemIndices: OK
  7546. 586.16 s [vector] +++ OK, passed 100 tests.
  7547. 586.16 s [vector] foldl: OK
  7548. 586.16 s [vector] +++ OK, passed 100 tests.
  7549. 586.16 s [vector] foldl1: OK
  7550. 586.16 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7551. 586.16 s [vector] foldl': OK
  7552. 586.16 s [vector] +++ OK, passed 100 tests.
  7553. 586.17 s [vector] foldl1': OK
  7554. 586.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7555. 586.17 s [vector] foldr: OK
  7556. 586.17 s [vector] +++ OK, passed 100 tests.
  7557. 586.17 s [vector] foldr1: OK
  7558. 586.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7559. 586.17 s [vector] foldr': OK
  7560. 586.17 s [vector] +++ OK, passed 100 tests.
  7561. 586.17 s [vector] foldr1': OK
  7562. 586.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7563. 586.18 s [vector] ifoldl: OK
  7564. 586.18 s [vector] +++ OK, passed 100 tests.
  7565. 586.18 s [vector] ifoldl': OK
  7566. 586.18 s [vector] +++ OK, passed 100 tests.
  7567. 586.19 s [vector] ifoldr: OK
  7568. 586.19 s [vector] +++ OK, passed 100 tests.
  7569. 586.19 s [vector] ifoldr': OK
  7570. 586.19 s [vector] +++ OK, passed 100 tests.
  7571. 586.19 s [vector] ifoldM: OK
  7572. 586.19 s [vector] +++ OK, passed 100 tests.
  7573. 586.19 s [vector] ifoldM': OK
  7574. 586.19 s [vector] +++ OK, passed 100 tests.
  7575. 586.22 s [vector] ifoldM_: OK
  7576. 586.22 s [vector] +++ OK, passed 100 tests.
  7577. 586.22 s [vector] ifoldM'_: OK (0.01s)
  7578. 586.22 s [vector] +++ OK, passed 100 tests.
  7579. 586.22 s [vector] all: OK
  7580. 586.22 s [vector] +++ OK, passed 100 tests.
  7581. 586.22 s [vector] any: OK
  7582. 586.22 s [vector] +++ OK, passed 100 tests.
  7583. 586.22 s [vector] prescanl: OK
  7584. 586.22 s [vector] +++ OK, passed 100 tests.
  7585. 586.23 s [vector] prescanl': OK
  7586. 586.23 s [vector] +++ OK, passed 100 tests.
  7587. 586.23 s [vector] postscanl: OK
  7588. 586.23 s [vector] +++ OK, passed 100 tests.
  7589. 586.23 s [vector] postscanl': OK
  7590. 586.23 s [vector] +++ OK, passed 100 tests.
  7591. 586.23 s [vector] scanl: OK
  7592. 586.23 s [vector] +++ OK, passed 100 tests.
  7593. 586.24 s [vector] scanl': OK
  7594. 586.24 s [vector] +++ OK, passed 100 tests.
  7595. 586.24 s [vector] scanl1: OK
  7596. 586.24 s [vector] +++ OK, passed 100 tests.
  7597. 586.24 s [vector] scanl1': OK
  7598. 586.24 s [vector] +++ OK, passed 100 tests.
  7599. 586.24 s [vector] iscanl: OK
  7600. 586.25 s [vector] +++ OK, passed 100 tests.
  7601. 586.25 s [vector] iscanl': OK
  7602. 586.25 s [vector] +++ OK, passed 100 tests.
  7603. 586.25 s [vector] prescanr: OK
  7604. 586.25 s [vector] +++ OK, passed 100 tests.
  7605. 586.25 s [vector] prescanr': OK
  7606. 586.25 s [vector] +++ OK, passed 100 tests.
  7607. 586.25 s [vector] postscanr: OK
  7608. 586.26 s [vector] +++ OK, passed 100 tests.
  7609. 586.26 s [vector] postscanr': OK
  7610. 586.26 s [vector] +++ OK, passed 100 tests.
  7611. 586.26 s [vector] scanr: OK
  7612. 586.26 s [vector] +++ OK, passed 100 tests.
  7613. 586.26 s [vector] scanr': OK
  7614. 586.26 s [vector] +++ OK, passed 100 tests.
  7615. 586.26 s [vector] scanr1: OK
  7616. 586.26 s [vector] +++ OK, passed 100 tests.
  7617. 586.26 s [vector] scanr1': OK
  7618. 586.26 s [vector] +++ OK, passed 100 tests.
  7619. 586.26 s [vector] iscanr: OK
  7620. 586.26 s [vector] +++ OK, passed 100 tests.
  7621. 586.27 s [vector] iscanr': OK
  7622. 586.27 s [vector] +++ OK, passed 100 tests.
  7623. 586.27 s [vector] mut_read: OK
  7624. 586.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7625. 586.27 s [vector] mut_write: OK
  7626. 586.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7627. 586.27 s [vector] mut_modify: OK
  7628. 586.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7629. 586.28 s [vector] mut_generate: OK
  7630. 586.28 s [vector] +++ OK, passed 100 tests.
  7631. 586.29 s [vector] mut_generateM: OK
  7632. 586.30 s [vector] +++ OK, passed 100 tests.
  7633. 586.30 s [vector] mut_mapM_: OK (0.01s)
  7634. 586.30 s [vector] +++ OK, passed 100 tests.
  7635. 586.30 s [vector] mut_imapM_: OK (0.01s)
  7636. 586.30 s [vector] +++ OK, passed 100 tests.
  7637. 586.33 s [vector] mut_forM_: OK
  7638. 586.34 s [vector] +++ OK, passed 100 tests.
  7639. 586.34 s [vector] mut_iforM_: OK (0.01s)
  7640. 586.34 s [vector] +++ OK, passed 100 tests.
  7641. 586.34 s [vector] mut_foldr: OK
  7642. 586.34 s [vector] +++ OK, passed 100 tests.
  7643. 586.34 s [vector] mut_foldr': OK
  7644. 586.34 s [vector] +++ OK, passed 100 tests.
  7645. 586.34 s [vector] mut_foldl: OK
  7646. 586.34 s [vector] +++ OK, passed 100 tests.
  7647. 586.34 s [vector] mut_foldl': OK
  7648. 586.34 s [vector] +++ OK, passed 100 tests.
  7649. 586.35 s [vector] mut_ifoldr: OK
  7650. 586.35 s [vector] +++ OK, passed 100 tests.
  7651. 586.35 s [vector] mut_ifoldr': OK
  7652. 586.35 s [vector] +++ OK, passed 100 tests.
  7653. 586.35 s [vector] mut_ifoldl: OK
  7654. 586.35 s [vector] +++ OK, passed 100 tests.
  7655. 586.35 s [vector] mut_ifoldl': OK
  7656. 586.35 s [vector] +++ OK, passed 100 tests.
  7657. 586.35 s [vector] mut_foldM: OK
  7658. 586.35 s [vector] +++ OK, passed 100 tests.
  7659. 586.36 s [vector] mut_foldM': OK
  7660. 586.36 s [vector] +++ OK, passed 100 tests.
  7661. 586.36 s [vector] mut_foldrM: OK
  7662. 586.36 s [vector] +++ OK, passed 100 tests.
  7663. 586.36 s [vector] mut_foldrM': OK
  7664. 586.37 s [vector] +++ OK, passed 100 tests.
  7665. 586.37 s [vector] mut_ifoldM: OK
  7666. 586.37 s [vector] +++ OK, passed 100 tests.
  7667. 586.37 s [vector] mut_ifoldM': OK
  7668. 586.37 s [vector] +++ OK, passed 100 tests.
  7669. 586.37 s [vector] mut_ifoldrM: OK
  7670. 586.37 s [vector] +++ OK, passed 100 tests.
  7671. 586.37 s [vector] mut_ifoldrM': OK
  7672. 586.37 s [vector] +++ OK, passed 100 tests.
  7673. 586.37 s [vector] compare: OK
  7674. 586.37 s [vector] +++ OK, passed 100 tests.
  7675. 586.37 s [vector] maximum: OK
  7676. 586.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7677. 586.37 s [vector] minimum: OK
  7678. 586.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7679. 586.37 s [vector] minIndex: OK
  7680. 586.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7681. 586.37 s [vector] maxIndex: OK
  7682. 586.37 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7683. 586.37 s [vector] maximumBy: OK
  7684. 586.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7685. 586.37 s [vector] minimumBy: OK
  7686. 586.37 s [vector] +++ OK, passed 100 tests; 25 discarded.
  7687. 586.38 s [vector] maximumOn: OK
  7688. 586.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7689. 586.38 s [vector] minimumOn: OK
  7690. 586.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7691. 586.38 s [vector] maxIndexBy: OK
  7692. 586.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7693. 586.38 s [vector] minIndexBy: OK
  7694. 586.38 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7695. 586.38 s [vector] ListFirstMaxIndexWins: OK
  7696. 586.38 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7697. 586.38 s [vector] FalseListFirstMaxIndexWins: OK
  7698. 586.38 s [vector] +++ OK, failed as expected. (after 1 test):
  7699. 586.38 s [vector] Exception:
  7700. 586.38 s [vector] Prelude.foldr1: empty list
  7701. 586.38 s [vector] CallStack (from HasCallStack):
  7702. 586.38 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  7703. 586.38 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  7704. 586.38 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7705. 586.38 s [vector] []
  7706. 586.38 s [vector] mempty: OK
  7707. 586.38 s [vector] +++ OK, passed 100 tests.
  7708. 586.38 s [vector] mappend: OK
  7709. 586.38 s [vector] +++ OK, passed 100 tests.
  7710. 586.39 s [vector] mconcat: OK
  7711. 586.39 s [vector] +++ OK, passed 100 tests.
  7712. 586.39 s [vector] glength: OK
  7713. 586.39 s [vector] +++ OK, passed 100 tests.
  7714. 586.39 s [vector] sum: OK
  7715. 586.39 s [vector] +++ OK, passed 100 tests.
  7716. 586.39 s [vector] product: OK
  7717. 586.39 s [vector] +++ OK, passed 100 tests.
  7718. 586.39 s [vector] enumFromN: OK
  7719. 586.39 s [vector] +++ OK, passed 100 tests.
  7720. 586.39 s [vector] enumFromThenN: OK
  7721. 586.39 s [vector] +++ OK, passed 100 tests.
  7722. 586.39 s [vector] enumFromTo: OK
  7723. 586.39 s [vector] +++ OK, passed 100 tests.
  7724. 586.39 s [vector] enumFromThenTo: OK
  7725. 586.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7726. 586.39 s [vector] Double
  7727. 586.39 s [vector] fromList.toList == id: OK
  7728. 586.39 s [vector] +++ OK, passed 100 tests.
  7729. 586.39 s [vector] toList.fromList == id: OK
  7730. 586.39 s [vector] +++ OK, passed 100 tests.
  7731. 586.39 s [vector] unstream.stream == id: OK
  7732. 586.39 s [vector] +++ OK, passed 100 tests.
  7733. 586.39 s [vector] stream.unstream == id: OK
  7734. 586.39 s [vector] +++ OK, passed 100 tests.
  7735. 586.39 s [vector] eq: OK
  7736. 586.39 s [vector] +++ OK, passed 100 tests.
  7737. 586.39 s [vector] length: OK
  7738. 586.39 s [vector] +++ OK, passed 100 tests.
  7739. 586.39 s [vector] null: OK
  7740. 586.39 s [vector] +++ OK, passed 100 tests.
  7741. 586.40 s [vector] index: OK
  7742. 586.40 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7743. 586.40 s [vector] safeIndex: OK
  7744. 586.40 s [vector] +++ OK, passed 100 tests.
  7745. 586.40 s [vector] head: OK
  7746. 586.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7747. 586.40 s [vector] last: OK
  7748. 586.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7749. 586.40 s [vector] unsafeIndex: OK
  7750. 586.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7751. 586.40 s [vector] unsafeHead: OK
  7752. 586.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7753. 586.40 s [vector] unsafeLast: OK
  7754. 586.40 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7755. 586.40 s [vector] slice: OK
  7756. 586.40 s [vector] +++ OK, passed 100 tests.
  7757. 586.40 s [vector] init: OK
  7758. 586.40 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7759. 586.40 s [vector] tail: OK
  7760. 586.40 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7761. 586.40 s [vector] take: OK
  7762. 586.40 s [vector] +++ OK, passed 100 tests.
  7763. 586.40 s [vector] drop: OK
  7764. 586.40 s [vector] +++ OK, passed 100 tests.
  7765. 586.40 s [vector] splitAt: OK
  7766. 586.40 s [vector] +++ OK, passed 100 tests.
  7767. 586.40 s [vector] empty: OK
  7768. 586.40 s [vector] +++ OK, passed 100 tests.
  7769. 586.40 s [vector] singleton: OK
  7770. 586.41 s [vector] +++ OK, passed 100 tests.
  7771. 586.41 s [vector] replicate: OK
  7772. 586.41 s [vector] +++ OK, passed 100 tests.
  7773. 586.41 s [vector] generate: OK
  7774. 586.41 s [vector] +++ OK, passed 100 tests.
  7775. 586.41 s [vector] iterateN: OK
  7776. 586.41 s [vector] +++ OK, passed 100 tests.
  7777. 586.44 s [vector] iterateNM: OK (0.02s)
  7778. 586.44 s [vector] +++ OK, passed 100 tests.
  7779. 586.47 s [vector] generateM: OK (0.03s)
  7780. 586.47 s [vector] +++ OK, passed 100 tests.
  7781. 586.47 s [vector] replicateM: OK
  7782. 586.47 s [vector] +++ OK, passed 100 tests.
  7783. 586.47 s [vector] create: OK
  7784. 586.47 s [vector] +++ OK, passed 100 tests.
  7785. 586.47 s [vector] createT: OK
  7786. 586.47 s [vector] +++ OK, passed 100 tests.
  7787. 586.47 s [vector] unfoldr: OK
  7788. 586.47 s [vector] +++ OK, passed 100 tests.
  7789. 586.47 s [vector] unfoldrN: OK
  7790. 586.47 s [vector] +++ OK, passed 100 tests.
  7791. 586.47 s [vector] unfoldrExactN: OK
  7792. 586.47 s [vector] +++ OK, passed 100 tests.
  7793. 586.48 s [vector] unfoldrM: OK
  7794. 586.48 s [vector] +++ OK, passed 100 tests.
  7795. 586.48 s [vector] unfoldrNM: OK
  7796. 586.48 s [vector] +++ OK, passed 100 tests.
  7797. 586.51 s [vector] unfoldrExactNM: OK (0.02s)
  7798. 586.51 s [vector] +++ OK, passed 100 tests.
  7799. 586.51 s [vector] constructN: OK (0.01s)
  7800. 586.51 s [vector] +++ OK, passed 100 tests.
  7801. 586.52 s [vector] constructrN: OK
  7802. 586.52 s [vector] +++ OK, passed 100 tests.
  7803. 586.52 s [vector] cons: OK
  7804. 586.52 s [vector] +++ OK, passed 100 tests.
  7805. 586.52 s [vector] snoc: OK
  7806. 586.52 s [vector] +++ OK, passed 100 tests.
  7807. 586.52 s [vector] append: OK
  7808. 586.52 s [vector] +++ OK, passed 100 tests.
  7809. 586.55 s [vector] concat: OK (0.02s)
  7810. 586.55 s [vector] +++ OK, passed 100 tests.
  7811. 586.56 s [vector] force: OK
  7812. 586.56 s [vector] +++ OK, passed 100 tests.
  7813. 586.56 s [vector] upd: OK
  7814. 586.56 s [vector] +++ OK, passed 100 tests.
  7815. 586.56 s [vector] accum: OK (0.01s)
  7816. 586.56 s [vector] +++ OK, passed 100 tests.
  7817. 586.56 s [vector] reverse: OK
  7818. 586.56 s [vector] +++ OK, passed 100 tests.
  7819. 586.57 s [vector] backpermute: OK
  7820. 586.57 s [vector] +++ OK, passed 100 tests.
  7821. 586.57 s [vector] map: OK
  7822. 586.58 s [vector] +++ OK, passed 100 tests.
  7823. 586.58 s [vector] imap: OK
  7824. 586.58 s [vector] +++ OK, passed 100 tests.
  7825. 586.58 s [vector] concatMap: OK
  7826. 586.58 s [vector] +++ OK, passed 100 tests.
  7827. 586.60 s [vector] mapM: OK
  7828. 586.60 s [vector] +++ OK, passed 100 tests.
  7829. 586.63 s [vector] mapM_: OK (0.03s)
  7830. 586.64 s [vector] +++ OK, passed 100 tests.
  7831. 586.64 s [vector] forM: OK
  7832. 586.64 s [vector] +++ OK, passed 100 tests.
  7833. 586.66 s [vector] forM_: OK (0.03s)
  7834. 586.66 s [vector] +++ OK, passed 100 tests.
  7835. 586.68 s [vector] imapM: OK
  7836. 586.68 s [vector] +++ OK, passed 100 tests.
  7837. 586.69 s [vector] imapM_: OK (0.03s)
  7838. 586.69 s [vector] +++ OK, passed 100 tests.
  7839. 586.71 s [vector] zipWith: OK
  7840. 586.71 s [vector] +++ OK, passed 100 tests.
  7841. 586.71 s [vector] zipWith3: OK (0.01s)
  7842. 586.71 s [vector] +++ OK, passed 100 tests.
  7843. 586.72 s [vector] izipWith: OK
  7844. 586.72 s [vector] +++ OK, passed 100 tests.
  7845. 586.73 s [vector] izipWith3: OK
  7846. 586.73 s [vector] +++ OK, passed 100 tests.
  7847. 586.74 s [vector] izipWithM: OK
  7848. 586.74 s [vector] +++ OK, passed 100 tests.
  7849. 586.77 s [vector] izipWithM_: OK (0.02s)
  7850. 586.78 s [vector] +++ OK, passed 100 tests.
  7851. 586.78 s [vector] zipWithM: OK
  7852. 586.78 s [vector] +++ OK, passed 100 tests.
  7853. 586.79 s [vector] zipWithM_: OK (0.02s)
  7854. 586.79 s [vector] +++ OK, passed 100 tests.
  7855. 586.80 s [vector] filter: OK
  7856. 586.80 s [vector] +++ OK, passed 100 tests.
  7857. 586.82 s [vector] ifilter: OK
  7858. 586.82 s [vector] +++ OK, passed 100 tests.
  7859. 586.85 s [vector] filterM: OK (0.04s)
  7860. 586.85 s [vector] +++ OK, passed 100 tests.
  7861. 586.86 s [vector] uniq: OK
  7862. 586.86 s [vector] +++ OK, passed 100 tests.
  7863. 586.86 s [vector] mapMaybe: OK
  7864. 586.86 s [vector] +++ OK, passed 100 tests.
  7865. 586.86 s [vector] imapMaybe: OK
  7866. 586.86 s [vector] +++ OK, passed 100 tests.
  7867. 586.86 s [vector] takeWhile: OK
  7868. 586.87 s [vector] +++ OK, passed 100 tests.
  7869. 586.87 s [vector] dropWhile: OK
  7870. 586.87 s [vector] +++ OK, passed 100 tests.
  7871. 586.87 s [vector] partition: OK
  7872. 586.87 s [vector] +++ OK, passed 100 tests.
  7873. 586.87 s [vector] partitionWith: OK
  7874. 586.87 s [vector] +++ OK, passed 100 tests.
  7875. 586.87 s [vector] span: OK
  7876. 586.87 s [vector] +++ OK, passed 100 tests.
  7877. 586.88 s [vector] break: OK
  7878. 586.88 s [vector] +++ OK, passed 100 tests.
  7879. 586.88 s [vector] spanR: OK
  7880. 586.88 s [vector] +++ OK, passed 100 tests.
  7881. 586.89 s [vector] breakR: OK
  7882. 586.89 s [vector] +++ OK, passed 100 tests.
  7883. 586.89 s [vector] groupBy: OK
  7884. 586.89 s [vector] +++ OK, passed 100 tests.
  7885. 586.89 s [vector] elem: OK
  7886. 586.89 s [vector] +++ OK, passed 100 tests.
  7887. 586.89 s [vector] notElem: OK
  7888. 586.89 s [vector] +++ OK, passed 100 tests.
  7889. 586.89 s [vector] find: OK
  7890. 586.89 s [vector] +++ OK, passed 100 tests.
  7891. 586.89 s [vector] findIndex: OK
  7892. 586.89 s [vector] +++ OK, passed 100 tests.
  7893. 586.89 s [vector] findIndexR: OK
  7894. 586.90 s [vector] +++ OK, passed 100 tests.
  7895. 586.90 s [vector] findIndices: OK
  7896. 586.90 s [vector] +++ OK, passed 100 tests.
  7897. 586.90 s [vector] elemIndex: OK
  7898. 586.91 s [vector] +++ OK, passed 100 tests.
  7899. 586.91 s [vector] elemIndices: OK
  7900. 586.91 s [vector] +++ OK, passed 100 tests.
  7901. 586.92 s [vector] foldl: OK (0.01s)
  7902. 586.92 s [vector] +++ OK, passed 100 tests.
  7903. 586.94 s [vector] foldl1: OK (0.01s)
  7904. 586.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7905. 586.95 s [vector] foldl': OK
  7906. 586.96 s [vector] +++ OK, passed 100 tests.
  7907. 586.96 s [vector] foldl1': OK (0.01s)
  7908. 586.96 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7909. 586.96 s [vector] foldr: OK (0.01s)
  7910. 586.96 s [vector] +++ OK, passed 100 tests.
  7911. 586.97 s [vector] foldr1: OK (0.01s)
  7912. 586.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7913. 586.98 s [vector] foldr': OK (0.01s)
  7914. 586.98 s [vector] +++ OK, passed 100 tests.
  7915. 587.00 s [vector] foldr1': OK (0.01s)
  7916. 587.00 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7917. 587.01 s [vector] ifoldl: OK (0.01s)
  7918. 587.01 s [vector] +++ OK, passed 100 tests.
  7919. 587.01 s [vector] ifoldl': OK (0.01s)
  7920. 587.01 s [vector] +++ OK, passed 100 tests.
  7921. 587.04 s [vector] ifoldr: OK
  7922. 587.04 s [vector] +++ OK, passed 100 tests.
  7923. 587.04 s [vector] ifoldr': OK (0.01s)
  7924. 587.04 s [vector] +++ OK, passed 100 tests.
  7925. 587.05 s [vector] ifoldM: OK (0.01s)
  7926. 587.05 s [vector] +++ OK, passed 100 tests.
  7927. 587.08 s [vector] ifoldM': OK
  7928. 587.08 s [vector] +++ OK, passed 100 tests.
  7929. 587.10 s [vector] ifoldM_: OK (0.03s)
  7930. 587.10 s [vector] +++ OK, passed 100 tests.
  7931. 587.12 s [vector] ifoldM'_: OK (0.03s)
  7932. 587.12 s [vector] +++ OK, passed 100 tests.
  7933. 587.12 s [vector] all: OK
  7934. 587.12 s [vector] +++ OK, passed 100 tests.
  7935. 587.13 s [vector] any: OK
  7936. 587.14 s [vector] +++ OK, passed 100 tests.
  7937. 587.14 s [vector] prescanl: OK (0.01s)
  7938. 587.15 s [vector] +++ OK, passed 100 tests.
  7939. 587.16 s [vector] prescanl': OK (0.01s)
  7940. 587.16 s [vector] +++ OK, passed 100 tests.
  7941. 587.17 s [vector] postscanl: OK (0.01s)
  7942. 587.18 s [vector] +++ OK, passed 100 tests.
  7943. 587.18 s [vector] postscanl': OK (0.01s)
  7944. 587.18 s [vector] +++ OK, passed 100 tests.
  7945. 587.18 s [vector] scanl: OK (0.01s)
  7946. 587.18 s [vector] +++ OK, passed 100 tests.
  7947. 587.20 s [vector] scanl': OK (0.01s)
  7948. 587.20 s [vector] +++ OK, passed 100 tests.
  7949. 587.21 s [vector] scanl1: OK (0.01s)
  7950. 587.22 s [vector] +++ OK, passed 100 tests.
  7951. 587.22 s [vector] scanl1': OK (0.01s)
  7952. 587.22 s [vector] +++ OK, passed 100 tests.
  7953. 587.22 s [vector] iscanl: OK (0.01s)
  7954. 587.22 s [vector] +++ OK, passed 100 tests.
  7955. 587.24 s [vector] iscanl': OK
  7956. 587.24 s [vector] +++ OK, passed 100 tests.
  7957. 587.26 s [vector] prescanr: OK (0.01s)
  7958. 587.26 s [vector] +++ OK, passed 100 tests.
  7959. 587.26 s [vector] prescanr': OK (0.01s)
  7960. 587.26 s [vector] +++ OK, passed 100 tests.
  7961. 587.27 s [vector] postscanr: OK
  7962. 587.27 s [vector] +++ OK, passed 100 tests.
  7963. 587.28 s [vector] postscanr': OK
  7964. 587.28 s [vector] +++ OK, passed 100 tests.
  7965. 587.30 s [vector] scanr: OK (0.01s)
  7966. 587.30 s [vector] +++ OK, passed 100 tests.
  7967. 587.30 s [vector] scanr': OK (0.01s)
  7968. 587.30 s [vector] +++ OK, passed 100 tests.
  7969. 587.31 s [vector] scanr1: OK
  7970. 587.31 s [vector] +++ OK, passed 100 tests.
  7971. 587.32 s [vector] scanr1': OK
  7972. 587.32 s [vector] +++ OK, passed 100 tests.
  7973. 587.34 s [vector] iscanr: OK (0.01s)
  7974. 587.34 s [vector] +++ OK, passed 100 tests.
  7975. 587.34 s [vector] iscanr': OK (0.01s)
  7976. 587.34 s [vector] +++ OK, passed 100 tests.
  7977. 587.34 s [vector] mut_read: OK
  7978. 587.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7979. 587.34 s [vector] mut_write: OK
  7980. 587.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7981. 587.35 s [vector] mut_modify: OK
  7982. 587.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7983. 587.36 s [vector] mut_generate: OK
  7984. 587.38 s [vector] +++ OK, passed 100 tests.
  7985. 587.38 s [vector] mut_generateM: OK (0.01s)
  7986. 587.38 s [vector] +++ OK, passed 100 tests.
  7987. 587.40 s [vector] mut_mapM_: OK (0.03s)
  7988. 587.40 s [vector] +++ OK, passed 100 tests.
  7989. 587.42 s [vector] mut_imapM_: OK (0.03s)
  7990. 587.42 s [vector] +++ OK, passed 100 tests.
  7991. 587.45 s [vector] mut_forM_: OK (0.03s)
  7992. 587.45 s [vector] +++ OK, passed 100 tests.
  7993. 587.49 s [vector] mut_iforM_: OK (0.02s)
  7994. 587.49 s [vector] +++ OK, passed 100 tests.
  7995. 587.49 s [vector] mut_foldr: OK (0.01s)
  7996. 587.49 s [vector] +++ OK, passed 100 tests.
  7997. 587.52 s [vector] mut_foldr': OK
  7998. 587.52 s [vector] +++ OK, passed 100 tests.
  7999. 587.52 s [vector] mut_foldl: OK (0.01s)
  8000. 587.52 s [vector] +++ OK, passed 100 tests.
  8001. 587.54 s [vector] mut_foldl': OK
  8002. 587.54 s [vector] +++ OK, passed 100 tests.
  8003. 587.54 s [vector] mut_ifoldr: OK (0.01s)
  8004. 587.54 s [vector] +++ OK, passed 100 tests.
  8005. 587.55 s [vector] mut_ifoldr': OK (0.01s)
  8006. 587.55 s [vector] +++ OK, passed 100 tests.
  8007. 587.58 s [vector] mut_ifoldl: OK (0.01s)
  8008. 587.58 s [vector] +++ OK, passed 100 tests.
  8009. 587.58 s [vector] mut_ifoldl': OK (0.01s)
  8010. 587.58 s [vector] +++ OK, passed 100 tests.
  8011. 587.60 s [vector] mut_foldM: OK (0.01s)
  8012. 587.60 s [vector] +++ OK, passed 100 tests.
  8013. 587.61 s [vector] mut_foldM': OK (0.01s)
  8014. 587.62 s [vector] +++ OK, passed 100 tests.
  8015. 587.62 s [vector] mut_foldrM: OK (0.01s)
  8016. 587.62 s [vector] +++ OK, passed 100 tests.
  8017. 587.64 s [vector] mut_foldrM': OK (0.01s)
  8018. 587.64 s [vector] +++ OK, passed 100 tests.
  8019. 587.64 s [vector] mut_ifoldM: OK (0.01s)
  8020. 587.65 s [vector] +++ OK, passed 100 tests.
  8021. 587.65 s [vector] mut_ifoldM': OK (0.01s)
  8022. 587.65 s [vector] +++ OK, passed 100 tests.
  8023. 587.67 s [vector] mut_ifoldrM: OK
  8024. 587.67 s [vector] +++ OK, passed 100 tests.
  8025. 587.67 s [vector] mut_ifoldrM': OK (0.01s)
  8026. 587.67 s [vector] +++ OK, passed 100 tests.
  8027. 587.67 s [vector] compare: OK
  8028. 587.67 s [vector] +++ OK, passed 100 tests.
  8029. 587.67 s [vector] maximum: OK
  8030. 587.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8031. 587.67 s [vector] minimum: OK
  8032. 587.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8033. 587.68 s [vector] minIndex: OK
  8034. 587.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8035. 587.68 s [vector] maxIndex: OK
  8036. 587.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8037. 587.68 s [vector] maximumBy: OK
  8038. 587.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8039. 587.68 s [vector] minimumBy: OK
  8040. 587.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8041. 587.68 s [vector] maximumOn: OK
  8042. 587.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8043. 587.68 s [vector] minimumOn: OK
  8044. 587.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8045. 587.68 s [vector] maxIndexBy: OK
  8046. 587.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8047. 587.68 s [vector] minIndexBy: OK
  8048. 587.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8049. 587.68 s [vector] ListFirstMaxIndexWins: OK
  8050. 587.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8051. 587.68 s [vector] FalseListFirstMaxIndexWins: OK
  8052. 587.68 s [vector] +++ OK, failed as expected. (after 1 test):
  8053. 587.68 s [vector] Exception:
  8054. 587.68 s [vector] Prelude.foldr1: empty list
  8055. 587.68 s [vector] CallStack (from HasCallStack):
  8056. 587.68 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  8057. 587.68 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  8058. 587.68 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8059. 587.70 s [vector] []
  8060. 587.70 s [vector] mempty: OK
  8061. 587.70 s [vector] +++ OK, passed 100 tests.
  8062. 587.70 s [vector] mappend: OK
  8063. 587.70 s [vector] +++ OK, passed 100 tests.
  8064. 587.70 s [vector] mconcat: OK (0.02s)
  8065. 587.70 s [vector] +++ OK, passed 100 tests.
  8066. 587.70 s [vector] glength: OK
  8067. 587.70 s [vector] +++ OK, passed 100 tests.
  8068. 587.70 s [vector] sum: OK
  8069. 587.70 s [vector] +++ OK, passed 100 tests.
  8070. 587.70 s [vector] product: OK
  8071. 587.70 s [vector] +++ OK, passed 100 tests.
  8072. 587.70 s [vector] enumFromN: OK
  8073. 587.70 s [vector] +++ OK, passed 100 tests.
  8074. 587.70 s [vector] enumFromThenN: OK
  8075. 587.70 s [vector] +++ OK, passed 100 tests.
  8076. 587.70 s [vector] enumFromTo: OK
  8077. 587.70 s [vector] +++ OK, passed 100 tests.
  8078. 587.70 s [vector] enumFromThenTo: OK
  8079. 587.70 s [vector] +++ OK, passed 100 tests; 6 discarded.
  8080. 587.70 s [vector] unstream
  8081. 587.70 s [vector] unstream == vunstream (exact): OK
  8082. 587.71 s [vector] +++ OK, passed 100 tests.
  8083. 587.71 s [vector] unstream == vunstream (unknown): OK
  8084. 587.71 s [vector] +++ OK, passed 100 tests.
  8085. 587.71 s [vector] unstreamR ~= vunstream (exact): OK
  8086. 587.71 s [vector] +++ OK, passed 100 tests.
  8087. 587.71 s [vector] unstreamR ~= vunstream (unknown): OK
  8088. 587.71 s [vector] +++ OK, passed 100 tests.
  8089. 587.71 s [vector] Tests.Vector.Storable
  8090. 587.71 s [vector] Data.Vector.Storable.Vector (Int)
  8091. 587.71 s [vector] fromList.toList == id: OK
  8092. 587.71 s [vector] +++ OK, passed 100 tests.
  8093. 587.71 s [vector] toList.fromList == id: OK
  8094. 587.71 s [vector] +++ OK, passed 100 tests.
  8095. 587.71 s [vector] unstream.stream == id: OK
  8096. 587.71 s [vector] +++ OK, passed 100 tests.
  8097. 587.71 s [vector] stream.unstream == id: OK
  8098. 587.71 s [vector] +++ OK, passed 100 tests.
  8099. 587.71 s [vector] eq: OK
  8100. 587.71 s [vector] +++ OK, passed 100 tests.
  8101. 587.71 s [vector] length: OK
  8102. 587.71 s [vector] +++ OK, passed 100 tests.
  8103. 587.71 s [vector] null: OK
  8104. 587.71 s [vector] +++ OK, passed 100 tests.
  8105. 587.71 s [vector] index: OK
  8106. 587.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8107. 587.71 s [vector] safeIndex: OK
  8108. 587.71 s [vector] +++ OK, passed 100 tests.
  8109. 587.71 s [vector] head: OK
  8110. 587.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8111. 587.71 s [vector] last: OK
  8112. 587.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8113. 587.71 s [vector] unsafeIndex: OK
  8114. 587.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8115. 587.71 s [vector] unsafeHead: OK
  8116. 587.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8117. 587.71 s [vector] unsafeLast: OK
  8118. 587.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8119. 587.71 s [vector] slice: OK
  8120. 587.71 s [vector] +++ OK, passed 100 tests.
  8121. 587.71 s [vector] init: OK
  8122. 587.71 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8123. 587.71 s [vector] tail: OK
  8124. 587.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8125. 587.71 s [vector] take: OK
  8126. 587.71 s [vector] +++ OK, passed 100 tests.
  8127. 587.71 s [vector] drop: OK
  8128. 587.71 s [vector] +++ OK, passed 100 tests.
  8129. 587.71 s [vector] splitAt: OK
  8130. 587.71 s [vector] +++ OK, passed 100 tests.
  8131. 587.71 s [vector] empty: OK
  8132. 587.71 s [vector] +++ OK, passed 100 tests.
  8133. 587.71 s [vector] singleton: OK
  8134. 587.71 s [vector] +++ OK, passed 100 tests.
  8135. 587.71 s [vector] replicate: OK
  8136. 587.71 s [vector] +++ OK, passed 100 tests.
  8137. 587.71 s [vector] generate: OK
  8138. 587.71 s [vector] +++ OK, passed 100 tests.
  8139. 587.72 s [vector] iterateN: OK
  8140. 587.72 s [vector] +++ OK, passed 100 tests.
  8141. 587.76 s [vector] iterateNM: OK (0.03s)
  8142. 588.07 s [vector] +++ OK, passed 100 tests.
  8143. 588.07 s [vector] generateM: OK
  8144. 588.07 s [vector] +++ OK, passed 100 tests.
  8145. 588.07 s [vector] replicateM: OK (0.01s)
  8146. 588.07 s [vector] +++ OK, passed 100 tests.
  8147. 588.07 s [vector] create: OK
  8148. 588.07 s [vector] +++ OK, passed 100 tests.
  8149. 588.07 s [vector] createT: OK
  8150. 588.07 s [vector] +++ OK, passed 100 tests.
  8151. 588.07 s [vector] unfoldr: OK
  8152. 588.07 s [vector] +++ OK, passed 100 tests.
  8153. 588.07 s [vector] unfoldrN: OK
  8154. 588.07 s [vector] +++ OK, passed 100 tests.
  8155. 588.07 s [vector] unfoldrExactN: OK
  8156. 588.07 s [vector] +++ OK, passed 100 tests.
  8157. 588.07 s [vector] unfoldrM: OK
  8158. 588.07 s [vector] +++ OK, passed 100 tests.
  8159. 588.07 s [vector] unfoldrNM: OK
  8160. 588.07 s [vector] +++ OK, passed 100 tests.
  8161. 588.07 s [vector] unfoldrExactNM: OK (0.02s)
  8162. 588.07 s [vector] +++ OK, passed 100 tests.
  8163. 588.07 s [vector] constructN: OK
  8164. 588.07 s [vector] +++ OK, passed 100 tests.
  8165. 588.07 s [vector] constructrN: OK
  8166. 588.07 s [vector] +++ OK, passed 100 tests.
  8167. 588.07 s [vector] cons: OK
  8168. 588.07 s [vector] +++ OK, passed 100 tests.
  8169. 588.07 s [vector] snoc: OK
  8170. 588.07 s [vector] +++ OK, passed 100 tests.
  8171. 588.07 s [vector] append: OK
  8172. 588.07 s [vector] +++ OK, passed 100 tests.
  8173. 588.07 s [vector] concat: OK (0.01s)
  8174. 588.07 s [vector] +++ OK, passed 100 tests.
  8175. 588.07 s [vector] force: OK
  8176. 588.07 s [vector] +++ OK, passed 100 tests.
  8177. 588.07 s [vector] upd: OK
  8178. 588.07 s [vector] +++ OK, passed 100 tests.
  8179. 588.07 s [vector] accum: OK
  8180. 588.07 s [vector] +++ OK, passed 100 tests.
  8181. 588.07 s [vector] reverse: OK
  8182. 588.07 s [vector] +++ OK, passed 100 tests.
  8183. 588.07 s [vector] backpermute: OK
  8184. 588.07 s [vector] +++ OK, passed 100 tests.
  8185. 588.07 s [vector] map: OK
  8186. 588.07 s [vector] +++ OK, passed 100 tests.
  8187. 588.07 s [vector] imap: OK
  8188. 588.07 s [vector] +++ OK, passed 100 tests.
  8189. 588.07 s [vector] concatMap: OK
  8190. 588.07 s [vector] +++ OK, passed 100 tests.
  8191. 588.07 s [vector] mapM: OK
  8192. 588.07 s [vector] +++ OK, passed 100 tests.
  8193. 588.07 s [vector] mapM_: OK (0.01s)
  8194. 588.07 s [vector] +++ OK, passed 100 tests.
  8195. 588.07 s [vector] forM: OK
  8196. 588.07 s [vector] +++ OK, passed 100 tests.
  8197. 588.07 s [vector] forM_: OK (0.01s)
  8198. 588.07 s [vector] +++ OK, passed 100 tests.
  8199. 588.07 s [vector] imapM: OK
  8200. 588.07 s [vector] +++ OK, passed 100 tests.
  8201. 588.07 s [vector] imapM_: OK (0.01s)
  8202. 588.07 s [vector] +++ OK, passed 100 tests.
  8203. 588.07 s [vector] zipWith: OK
  8204. 588.07 s [vector] +++ OK, passed 100 tests.
  8205. 588.07 s [vector] zipWith3: OK
  8206. 588.07 s [vector] +++ OK, passed 100 tests.
  8207. 588.07 s [vector] izipWith: OK
  8208. 588.07 s [vector] +++ OK, passed 100 tests.
  8209. 588.07 s [vector] izipWith3: OK
  8210. 588.07 s [vector] +++ OK, passed 100 tests.
  8211. 588.07 s [vector] izipWithM: OK
  8212. 588.07 s [vector] +++ OK, passed 100 tests.
  8213. 588.07 s [vector] izipWithM_: OK
  8214. 588.07 s [vector] +++ OK, passed 100 tests.
  8215. 588.07 s [vector] zipWithM: OK
  8216. 588.07 s [vector] +++ OK, passed 100 tests.
  8217. 588.07 s [vector] zipWithM_: OK
  8218. 588.07 s [vector] +++ OK, passed 100 tests.
  8219. 588.07 s [vector] filter: OK
  8220. 588.07 s [vector] +++ OK, passed 100 tests.
  8221. 588.07 s [vector] ifilter: OK
  8222. 588.07 s [vector] +++ OK, passed 100 tests.
  8223. 588.07 s [vector] filterM: OK (0.02s)
  8224. 588.07 s [vector] +++ OK, passed 100 tests.
  8225. 588.07 s [vector] uniq: OK
  8226. 588.07 s [vector] +++ OK, passed 100 tests.
  8227. 588.07 s [vector] mapMaybe: OK
  8228. 588.07 s [vector] +++ OK, passed 100 tests.
  8229. 588.07 s [vector] imapMaybe: OK
  8230. 588.07 s [vector] +++ OK, passed 100 tests.
  8231. 588.07 s [vector] takeWhile: OK
  8232. 588.07 s [vector] +++ OK, passed 100 tests.
  8233. 588.07 s [vector] dropWhile: OK
  8234. 588.07 s [vector] +++ OK, passed 100 tests.
  8235. 588.07 s [vector] partition: OK
  8236. 588.07 s [vector] +++ OK, passed 100 tests.
  8237. 588.07 s [vector] partitionWith: OK
  8238. 588.07 s [vector] +++ OK, passed 100 tests.
  8239. 588.07 s [vector] span: OK
  8240. 588.07 s [vector] +++ OK, passed 100 tests.
  8241. 588.07 s [vector] break: OK
  8242. 588.07 s [vector] +++ OK, passed 100 tests.
  8243. 588.07 s [vector] spanR: OK
  8244. 588.07 s [vector] +++ OK, passed 100 tests.
  8245. 588.07 s [vector] breakR: OK
  8246. 588.07 s [vector] +++ OK, passed 100 tests.
  8247. 588.07 s [vector] groupBy: OK
  8248. 588.07 s [vector] +++ OK, passed 100 tests.
  8249. 588.08 s [vector] elem: OK
  8250. 588.08 s [vector] +++ OK, passed 100 tests.
  8251. 588.08 s [vector] notElem: OK
  8252. 588.08 s [vector] +++ OK, passed 100 tests.
  8253. 588.08 s [vector] find: OK
  8254. 588.08 s [vector] +++ OK, passed 100 tests.
  8255. 588.08 s [vector] findIndex: OK
  8256. 588.08 s [vector] +++ OK, passed 100 tests.
  8257. 588.08 s [vector] findIndexR: OK
  8258. 588.08 s [vector] +++ OK, passed 100 tests.
  8259. 588.08 s [vector] findIndices: OK
  8260. 588.08 s [vector] +++ OK, passed 100 tests.
  8261. 588.08 s [vector] elemIndex: OK
  8262. 588.08 s [vector] +++ OK, passed 100 tests.
  8263. 588.08 s [vector] elemIndices: OK
  8264. 588.08 s [vector] +++ OK, passed 100 tests.
  8265. 588.08 s [vector] foldl: OK
  8266. 588.08 s [vector] +++ OK, passed 100 tests.
  8267. 588.08 s [vector] foldl1: OK
  8268. 588.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8269. 588.08 s [vector] foldl': OK
  8270. 588.08 s [vector] +++ OK, passed 100 tests.
  8271. 588.08 s [vector] foldl1': OK
  8272. 588.08 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8273. 588.08 s [vector] foldr: OK
  8274. 588.08 s [vector] +++ OK, passed 100 tests.
  8275. 588.08 s [vector] foldr1: OK
  8276. 588.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8277. 588.08 s [vector] foldr': OK
  8278. 588.08 s [vector] +++ OK, passed 100 tests.
  8279. 588.08 s [vector] foldr1': OK
  8280. 588.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8281. 588.08 s [vector] ifoldl: OK
  8282. 588.08 s [vector] +++ OK, passed 100 tests.
  8283. 588.08 s [vector] ifoldl': OK
  8284. 588.08 s [vector] +++ OK, passed 100 tests.
  8285. 588.08 s [vector] ifoldr: OK
  8286. 588.08 s [vector] +++ OK, passed 100 tests.
  8287. 588.08 s [vector] ifoldr': OK
  8288. 588.08 s [vector] +++ OK, passed 100 tests.
  8289. 588.08 s [vector] ifoldM: OK
  8290. 588.08 s [vector] +++ OK, passed 100 tests.
  8291. 588.08 s [vector] ifoldM': OK
  8292. 588.08 s [vector] +++ OK, passed 100 tests.
  8293. 588.08 s [vector] ifoldM_: OK
  8294. 588.08 s [vector] +++ OK, passed 100 tests.
  8295. 588.08 s [vector] ifoldM'_: OK (0.01s)
  8296. 588.08 s [vector] +++ OK, passed 100 tests.
  8297. 588.08 s [vector] all: OK
  8298. 588.08 s [vector] +++ OK, passed 100 tests.
  8299. 588.08 s [vector] any: OK
  8300. 588.08 s [vector] +++ OK, passed 100 tests.
  8301. 588.08 s [vector] prescanl: OK
  8302. 588.08 s [vector] +++ OK, passed 100 tests.
  8303. 588.08 s [vector] prescanl': OK
  8304. 588.08 s [vector] +++ OK, passed 100 tests.
  8305. 588.08 s [vector] postscanl: OK
  8306. 588.08 s [vector] +++ OK, passed 100 tests.
  8307. 588.08 s [vector] postscanl': OK
  8308. 588.08 s [vector] +++ OK, passed 100 tests.
  8309. 588.08 s [vector] scanl: OK
  8310. 588.08 s [vector] +++ OK, passed 100 tests.
  8311. 588.08 s [vector] scanl': OK
  8312. 588.08 s [vector] +++ OK, passed 100 tests.
  8313. 588.08 s [vector] scanl1: OK
  8314. 588.08 s [vector] +++ OK, passed 100 tests.
  8315. 588.08 s [vector] scanl1': OK
  8316. 588.08 s [vector] +++ OK, passed 100 tests.
  8317. 588.08 s [vector] iscanl: OK
  8318. 588.08 s [vector] +++ OK, passed 100 tests.
  8319. 588.08 s [vector] iscanl': OK
  8320. 588.08 s [vector] +++ OK, passed 100 tests.
  8321. 588.08 s [vector] prescanr: OK
  8322. 588.08 s [vector] +++ OK, passed 100 tests.
  8323. 588.08 s [vector] prescanr': OK
  8324. 588.08 s [vector] +++ OK, passed 100 tests.
  8325. 588.08 s [vector] postscanr: OK
  8326. 588.08 s [vector] +++ OK, passed 100 tests.
  8327. 588.08 s [vector] postscanr': OK
  8328. 588.08 s [vector] +++ OK, passed 100 tests.
  8329. 588.08 s [vector] scanr: OK
  8330. 588.08 s [vector] +++ OK, passed 100 tests.
  8331. 588.08 s [vector] scanr': OK
  8332. 588.08 s [vector] +++ OK, passed 100 tests.
  8333. 588.08 s [vector] scanr1: OK
  8334. 588.08 s [vector] +++ OK, passed 100 tests.
  8335. 588.08 s [vector] scanr1': OK
  8336. 588.08 s [vector] +++ OK, passed 100 tests.
  8337. 588.08 s [vector] iscanr: OK
  8338. 588.08 s [vector] +++ OK, passed 100 tests.
  8339. 588.08 s [vector] iscanr': OK
  8340. 588.08 s [vector] +++ OK, passed 100 tests.
  8341. 588.08 s [vector] mut_read: OK
  8342. 588.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8343. 588.08 s [vector] mut_write: OK
  8344. 588.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8345. 588.08 s [vector] mut_modify: OK
  8346. 588.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8347. 588.08 s [vector] mut_generate: OK
  8348. 588.08 s [vector] +++ OK, passed 100 tests.
  8349. 588.08 s [vector] mut_generateM: OK
  8350. 588.08 s [vector] +++ OK, passed 100 tests.
  8351. 588.08 s [vector] mut_mapM_: OK (0.01s)
  8352. 588.08 s [vector] +++ OK, passed 100 tests.
  8353. 588.10 s [vector] mut_imapM_: OK
  8354. 588.10 s [vector] +++ OK, passed 100 tests.
  8355. 588.12 s [vector] mut_forM_: OK (0.01s)
  8356. 588.12 s [vector] +++ OK, passed 100 tests.
  8357. 588.12 s [vector] mut_iforM_: OK (0.01s)
  8358. 588.12 s [vector] +++ OK, passed 100 tests.
  8359. 588.13 s [vector] mut_foldr: OK
  8360. 588.13 s [vector] +++ OK, passed 100 tests.
  8361. 588.13 s [vector] mut_foldr': OK
  8362. 588.13 s [vector] +++ OK, passed 100 tests.
  8363. 588.13 s [vector] mut_foldl: OK
  8364. 588.13 s [vector] +++ OK, passed 100 tests.
  8365. 588.13 s [vector] mut_foldl': OK
  8366. 588.13 s [vector] +++ OK, passed 100 tests.
  8367. 588.13 s [vector] mut_ifoldr: OK
  8368. 588.14 s [vector] +++ OK, passed 100 tests.
  8369. 588.14 s [vector] mut_ifoldr': OK
  8370. 588.14 s [vector] +++ OK, passed 100 tests.
  8371. 588.14 s [vector] mut_ifoldl: OK
  8372. 588.14 s [vector] +++ OK, passed 100 tests.
  8373. 588.14 s [vector] mut_ifoldl': OK
  8374. 588.14 s [vector] +++ OK, passed 100 tests.
  8375. 588.14 s [vector] mut_foldM: OK
  8376. 588.14 s [vector] +++ OK, passed 100 tests.
  8377. 588.15 s [vector] mut_foldM': OK
  8378. 588.15 s [vector] +++ OK, passed 100 tests.
  8379. 588.15 s [vector] mut_foldrM: OK
  8380. 588.15 s [vector] +++ OK, passed 100 tests.
  8381. 588.15 s [vector] mut_foldrM': OK
  8382. 588.15 s [vector] +++ OK, passed 100 tests.
  8383. 588.15 s [vector] mut_ifoldM: OK
  8384. 588.15 s [vector] +++ OK, passed 100 tests.
  8385. 588.16 s [vector] mut_ifoldM': OK
  8386. 588.16 s [vector] +++ OK, passed 100 tests.
  8387. 588.16 s [vector] mut_ifoldrM: OK
  8388. 588.16 s [vector] +++ OK, passed 100 tests.
  8389. 588.16 s [vector] mut_ifoldrM': OK
  8390. 588.16 s [vector] +++ OK, passed 100 tests.
  8391. 588.16 s [vector] compare: OK
  8392. 588.16 s [vector] +++ OK, passed 100 tests.
  8393. 588.16 s [vector] maximum: OK
  8394. 588.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8395. 588.16 s [vector] minimum: OK
  8396. 588.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8397. 588.16 s [vector] minIndex: OK
  8398. 588.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8399. 588.16 s [vector] maxIndex: OK
  8400. 588.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8401. 588.16 s [vector] maximumBy: OK
  8402. 588.16 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8403. 588.16 s [vector] minimumBy: OK
  8404. 588.16 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8405. 588.16 s [vector] maximumOn: OK
  8406. 588.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8407. 588.16 s [vector] minimumOn: OK
  8408. 588.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8409. 588.17 s [vector] maxIndexBy: OK
  8410. 588.17 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8411. 588.17 s [vector] minIndexBy: OK
  8412. 588.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8413. 588.17 s [vector] ListFirstMaxIndexWins: OK
  8414. 588.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8415. 588.17 s [vector] FalseListFirstMaxIndexWins: OK
  8416. 588.17 s [vector] +++ OK, failed as expected. (after 1 test):
  8417. 588.17 s [vector] Exception:
  8418. 588.17 s [vector] Prelude.foldr1: empty list
  8419. 588.17 s [vector] CallStack (from HasCallStack):
  8420. 588.17 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  8421. 588.17 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  8422. 588.17 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8423. 588.17 s [vector] []
  8424. 588.17 s [vector] mempty: OK
  8425. 588.17 s [vector] +++ OK, passed 100 tests.
  8426. 588.18 s [vector] mappend: OK
  8427. 588.18 s [vector] +++ OK, passed 100 tests.
  8428. 588.18 s [vector] mconcat: OK (0.01s)
  8429. 588.18 s [vector] +++ OK, passed 100 tests.
  8430. 588.18 s [vector] glength: OK
  8431. 588.18 s [vector] +++ OK, passed 100 tests.
  8432. 588.18 s [vector] sum: OK
  8433. 588.18 s [vector] +++ OK, passed 100 tests.
  8434. 588.18 s [vector] product: OK
  8435. 588.18 s [vector] +++ OK, passed 100 tests.
  8436. 588.18 s [vector] enumFromN: OK
  8437. 588.18 s [vector] +++ OK, passed 100 tests.
  8438. 588.18 s [vector] enumFromThenN: OK
  8439. 588.18 s [vector] +++ OK, passed 100 tests.
  8440. 588.18 s [vector] enumFromTo: OK
  8441. 588.18 s [vector] +++ OK, passed 100 tests.
  8442. 588.18 s [vector] enumFromThenTo: OK
  8443. 588.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8444. 588.18 s [vector] Data.Vector.Storable.Vector (Double)
  8445. 588.18 s [vector] fromList.toList == id: OK
  8446. 588.18 s [vector] +++ OK, passed 100 tests.
  8447. 588.18 s [vector] toList.fromList == id: OK
  8448. 588.18 s [vector] +++ OK, passed 100 tests.
  8449. 588.18 s [vector] unstream.stream == id: OK
  8450. 588.19 s [vector] +++ OK, passed 100 tests.
  8451. 588.19 s [vector] stream.unstream == id: OK
  8452. 588.19 s [vector] +++ OK, passed 100 tests.
  8453. 588.19 s [vector] eq: OK
  8454. 588.19 s [vector] +++ OK, passed 100 tests.
  8455. 588.19 s [vector] length: OK
  8456. 588.19 s [vector] +++ OK, passed 100 tests.
  8457. 588.19 s [vector] null: OK
  8458. 588.19 s [vector] +++ OK, passed 100 tests.
  8459. 588.19 s [vector] index: OK
  8460. 588.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8461. 588.19 s [vector] safeIndex: OK
  8462. 588.19 s [vector] +++ OK, passed 100 tests.
  8463. 588.19 s [vector] head: OK
  8464. 588.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8465. 588.19 s [vector] last: OK
  8466. 588.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8467. 588.19 s [vector] unsafeIndex: OK
  8468. 588.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8469. 588.19 s [vector] unsafeHead: OK
  8470. 588.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8471. 588.19 s [vector] unsafeLast: OK
  8472. 588.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8473. 588.19 s [vector] slice: OK
  8474. 588.19 s [vector] +++ OK, passed 100 tests.
  8475. 588.19 s [vector] init: OK
  8476. 588.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8477. 588.19 s [vector] tail: OK
  8478. 588.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8479. 588.20 s [vector] take: OK
  8480. 588.20 s [vector] +++ OK, passed 100 tests.
  8481. 588.20 s [vector] drop: OK
  8482. 588.20 s [vector] +++ OK, passed 100 tests.
  8483. 588.20 s [vector] splitAt: OK
  8484. 588.20 s [vector] +++ OK, passed 100 tests.
  8485. 588.20 s [vector] empty: OK
  8486. 588.20 s [vector] +++ OK, passed 100 tests.
  8487. 588.20 s [vector] singleton: OK
  8488. 588.20 s [vector] +++ OK, passed 100 tests.
  8489. 588.20 s [vector] replicate: OK
  8490. 588.20 s [vector] +++ OK, passed 100 tests.
  8491. 588.20 s [vector] generate: OK
  8492. 588.20 s [vector] +++ OK, passed 100 tests.
  8493. 588.22 s [vector] iterateN: OK
  8494. 588.22 s [vector] +++ OK, passed 100 tests.
  8495. 588.24 s [vector] iterateNM: OK (0.02s)
  8496. 588.24 s [vector] +++ OK, passed 100 tests.
  8497. 588.25 s [vector] generateM: OK (0.03s)
  8498. 588.25 s [vector] +++ OK, passed 100 tests.
  8499. 588.25 s [vector] replicateM: OK (0.01s)
  8500. 588.25 s [vector] +++ OK, passed 100 tests.
  8501. 588.26 s [vector] create: OK
  8502. 588.26 s [vector] +++ OK, passed 100 tests.
  8503. 588.26 s [vector] createT: OK
  8504. 588.26 s [vector] +++ OK, passed 100 tests.
  8505. 588.26 s [vector] unfoldr: OK
  8506. 588.26 s [vector] +++ OK, passed 100 tests.
  8507. 588.26 s [vector] unfoldrN: OK
  8508. 588.26 s [vector] +++ OK, passed 100 tests.
  8509. 588.26 s [vector] unfoldrExactN: OK
  8510. 588.26 s [vector] +++ OK, passed 100 tests.
  8511. 588.26 s [vector] unfoldrM: OK
  8512. 588.26 s [vector] +++ OK, passed 100 tests.
  8513. 588.28 s [vector] unfoldrNM: OK
  8514. 588.28 s [vector] +++ OK, passed 100 tests.
  8515. 588.31 s [vector] unfoldrExactNM: OK (0.04s)
  8516. 588.32 s [vector] +++ OK, passed 100 tests.
  8517. 588.32 s [vector] constructN: OK (0.01s)
  8518. 588.32 s [vector] +++ OK, passed 100 tests.
  8519. 588.32 s [vector] constructrN: OK (0.01s)
  8520. 588.32 s [vector] +++ OK, passed 100 tests.
  8521. 588.34 s [vector] cons: OK
  8522. 588.34 s [vector] +++ OK, passed 100 tests.
  8523. 588.34 s [vector] snoc: OK
  8524. 588.34 s [vector] +++ OK, passed 100 tests.
  8525. 588.34 s [vector] append: OK
  8526. 588.34 s [vector] +++ OK, passed 100 tests.
  8527. 588.34 s [vector] concat: OK (0.02s)
  8528. 588.34 s [vector] +++ OK, passed 100 tests.
  8529. 588.34 s [vector] force: OK
  8530. 588.34 s [vector] +++ OK, passed 100 tests.
  8531. 588.36 s [vector] upd: OK
  8532. 588.36 s [vector] +++ OK, passed 100 tests.
  8533. 588.36 s [vector] accum: OK (0.01s)
  8534. 588.36 s [vector] +++ OK, passed 100 tests.
  8535. 588.36 s [vector] reverse: OK
  8536. 588.36 s [vector] +++ OK, passed 100 tests.
  8537. 588.36 s [vector] backpermute: OK
  8538. 588.36 s [vector] +++ OK, passed 100 tests.
  8539. 588.36 s [vector] map: OK
  8540. 588.36 s [vector] +++ OK, passed 100 tests.
  8541. 588.37 s [vector] imap: OK
  8542. 588.37 s [vector] +++ OK, passed 100 tests.
  8543. 588.38 s [vector] concatMap: OK
  8544. 588.38 s [vector] +++ OK, passed 100 tests.
  8545. 588.38 s [vector] mapM: OK
  8546. 588.38 s [vector] +++ OK, passed 100 tests.
  8547. 588.42 s [vector] mapM_: OK (0.02s)
  8548. 588.42 s [vector] +++ OK, passed 100 tests.
  8549. 588.42 s [vector] forM: OK
  8550. 588.42 s [vector] +++ OK, passed 100 tests.
  8551. 588.46 s [vector] forM_: OK (0.02s)
  8552. 588.46 s [vector] +++ OK, passed 100 tests.
  8553. 588.46 s [vector] imapM: OK
  8554. 588.46 s [vector] +++ OK, passed 100 tests.
  8555. 588.51 s [vector] imapM_: OK (0.02s)
  8556. 588.51 s [vector] +++ OK, passed 100 tests.
  8557. 588.51 s [vector] zipWith: OK
  8558. 588.51 s [vector] +++ OK, passed 100 tests.
  8559. 588.52 s [vector] zipWith3: OK
  8560. 588.52 s [vector] +++ OK, passed 100 tests.
  8561. 588.52 s [vector] izipWith: OK
  8562. 588.52 s [vector] +++ OK, passed 100 tests.
  8563. 588.54 s [vector] izipWith3: OK
  8564. 588.54 s [vector] +++ OK, passed 100 tests.
  8565. 588.56 s [vector] izipWithM: OK (0.01s)
  8566. 588.56 s [vector] +++ OK, passed 100 tests.
  8567. 588.59 s [vector] izipWithM_: OK (0.04s)
  8568. 588.59 s [vector] +++ OK, passed 100 tests.
  8569. 588.61 s [vector] zipWithM: OK
  8570. 588.61 s [vector] +++ OK, passed 100 tests.
  8571. 588.65 s [vector] zipWithM_: OK (0.03s)
  8572. 588.65 s [vector] +++ OK, passed 100 tests.
  8573. 588.65 s [vector] filter: OK
  8574. 588.65 s [vector] +++ OK, passed 100 tests.
  8575. 588.68 s [vector] ifilter: OK
  8576. 588.68 s [vector] +++ OK, passed 100 tests.
  8577. 588.72 s [vector] filterM: OK (0.06s)
  8578. 588.72 s [vector] +++ OK, passed 100 tests.
  8579. 588.73 s [vector] uniq: OK
  8580. 588.73 s [vector] +++ OK, passed 100 tests.
  8581. 588.73 s [vector] mapMaybe: OK
  8582. 588.73 s [vector] +++ OK, passed 100 tests.
  8583. 588.74 s [vector] imapMaybe: OK
  8584. 588.74 s [vector] +++ OK, passed 100 tests.
  8585. 588.74 s [vector] takeWhile: OK
  8586. 588.75 s [vector] +++ OK, passed 100 tests.
  8587. 588.76 s [vector] dropWhile: OK
  8588. 588.76 s [vector] +++ OK, passed 100 tests.
  8589. 588.76 s [vector] partition: OK (0.01s)
  8590. 588.76 s [vector] +++ OK, passed 100 tests.
  8591. 588.77 s [vector] partitionWith: OK
  8592. 588.77 s [vector] +++ OK, passed 100 tests.
  8593. 588.77 s [vector] span: OK
  8594. 588.77 s [vector] +++ OK, passed 100 tests.
  8595. 588.78 s [vector] break: OK
  8596. 588.78 s [vector] +++ OK, passed 100 tests.
  8597. 588.78 s [vector] spanR: OK
  8598. 588.79 s [vector] +++ OK, passed 100 tests.
  8599. 588.79 s [vector] breakR: OK
  8600. 588.79 s [vector] +++ OK, passed 100 tests.
  8601. 588.80 s [vector] groupBy: OK
  8602. 588.80 s [vector] +++ OK, passed 100 tests.
  8603. 588.80 s [vector] elem: OK
  8604. 588.80 s [vector] +++ OK, passed 100 tests.
  8605. 588.80 s [vector] notElem: OK
  8606. 588.80 s [vector] +++ OK, passed 100 tests.
  8607. 588.80 s [vector] find: OK
  8608. 588.80 s [vector] +++ OK, passed 100 tests.
  8609. 588.80 s [vector] findIndex: OK
  8610. 588.80 s [vector] +++ OK, passed 100 tests.
  8611. 588.80 s [vector] findIndexR: OK
  8612. 588.81 s [vector] +++ OK, passed 100 tests.
  8613. 588.81 s [vector] findIndices: OK
  8614. 588.81 s [vector] +++ OK, passed 100 tests.
  8615. 588.81 s [vector] elemIndex: OK
  8616. 588.81 s [vector] +++ OK, passed 100 tests.
  8617. 588.82 s [vector] elemIndices: OK
  8618. 588.82 s [vector] +++ OK, passed 100 tests.
  8619. 588.83 s [vector] foldl: OK (0.01s)
  8620. 588.83 s [vector] +++ OK, passed 100 tests.
  8621. 588.86 s [vector] foldl1: OK
  8622. 588.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8623. 588.86 s [vector] foldl': OK (0.02s)
  8624. 588.86 s [vector] +++ OK, passed 100 tests.
  8625. 588.88 s [vector] foldl1': OK
  8626. 588.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8627. 588.91 s [vector] foldr: OK
  8628. 588.92 s [vector] +++ OK, passed 100 tests.
  8629. 588.94 s [vector] foldr1: OK (0.02s)
  8630. 588.94 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8631. 588.96 s [vector] foldr': OK (0.02s)
  8632. 588.96 s [vector] +++ OK, passed 100 tests.
  8633. 588.96 s [vector] foldr1': OK (0.02s)
  8634. 588.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8635. 588.99 s [vector] ifoldl: OK
  8636. 589.00 s [vector] +++ OK, passed 100 tests.
  8637. 589.02 s [vector] ifoldl': OK (0.02s)
  8638. 589.02 s [vector] +++ OK, passed 100 tests.
  8639. 589.04 s [vector] ifoldr: OK (0.02s)
  8640. 589.04 s [vector] +++ OK, passed 100 tests.
  8641. 589.06 s [vector] ifoldr': OK (0.02s)
  8642. 589.06 s [vector] +++ OK, passed 100 tests.
  8643. 589.08 s [vector] ifoldM: OK (0.02s)
  8644. 589.08 s [vector] +++ OK, passed 100 tests.
  8645. 589.10 s [vector] ifoldM': OK (0.02s)
  8646. 589.10 s [vector] +++ OK, passed 100 tests.
  8647. 589.14 s [vector] ifoldM_: OK (0.04s)
  8648. 589.14 s [vector] +++ OK, passed 100 tests.
  8649. 589.16 s [vector] ifoldM'_: OK (0.04s)
  8650. 589.16 s [vector] +++ OK, passed 100 tests.
  8651. 589.16 s [vector] all: OK
  8652. 589.16 s [vector] +++ OK, passed 100 tests.
  8653. 589.17 s [vector] any: OK
  8654. 589.17 s [vector] +++ OK, passed 100 tests.
  8655. 589.18 s [vector] prescanl: OK (0.01s)
  8656. 589.18 s [vector] +++ OK, passed 100 tests.
  8657. 589.20 s [vector] prescanl': OK (0.02s)
  8658. 589.20 s [vector] +++ OK, passed 100 tests.
  8659. 589.21 s [vector] postscanl: OK (0.02s)
  8660. 589.21 s [vector] +++ OK, passed 100 tests.
  8661. 589.22 s [vector] postscanl': OK
  8662. 589.24 s [vector] +++ OK, passed 100 tests.
  8663. 589.25 s [vector] scanl: OK (0.01s)
  8664. 589.25 s [vector] +++ OK, passed 100 tests.
  8665. 589.26 s [vector] scanl': OK (0.02s)
  8666. 589.26 s [vector] +++ OK, passed 100 tests.
  8667. 589.28 s [vector] scanl1: OK (0.02s)
  8668. 589.28 s [vector] +++ OK, passed 100 tests.
  8669. 589.30 s [vector] scanl1': OK (0.02s)
  8670. 589.30 s [vector] +++ OK, passed 100 tests.
  8671. 589.32 s [vector] iscanl: OK (0.02s)
  8672. 589.32 s [vector] +++ OK, passed 100 tests.
  8673. 589.34 s [vector] iscanl': OK (0.02s)
  8674. 589.34 s [vector] +++ OK, passed 100 tests.
  8675. 589.36 s [vector] prescanr: OK (0.02s)
  8676. 589.36 s [vector] +++ OK, passed 100 tests.
  8677. 589.38 s [vector] prescanr': OK (0.02s)
  8678. 589.38 s [vector] +++ OK, passed 100 tests.
  8679. 589.39 s [vector] postscanr: OK (0.02s)
  8680. 589.39 s [vector] +++ OK, passed 100 tests.
  8681. 589.41 s [vector] postscanr': OK
  8682. 589.41 s [vector] +++ OK, passed 100 tests.
  8683. 589.44 s [vector] scanr: OK (0.02s)
  8684. 589.44 s [vector] +++ OK, passed 100 tests.
  8685. 589.46 s [vector] scanr': OK (0.02s)
  8686. 589.46 s [vector] +++ OK, passed 100 tests.
  8687. 589.46 s [vector] scanr1: OK (0.02s)
  8688. 589.46 s [vector] +++ OK, passed 100 tests.
  8689. 589.48 s [vector] scanr1': OK
  8690. 589.49 s [vector] +++ OK, passed 100 tests.
  8691. 589.49 s [vector] iscanr: OK (0.02s)
  8692. 589.49 s [vector] +++ OK, passed 100 tests.
  8693. 589.51 s [vector] iscanr': OK (0.01s)
  8694. 589.51 s [vector] +++ OK, passed 100 tests.
  8695. 589.51 s [vector] mut_read: OK
  8696. 589.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8697. 589.51 s [vector] mut_write: OK
  8698. 589.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8699. 589.52 s [vector] mut_modify: OK
  8700. 589.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8701. 589.52 s [vector] mut_generate: OK
  8702. 589.52 s [vector] +++ OK, passed 100 tests.
  8703. 589.53 s [vector] mut_generateM: OK (0.02s)
  8704. 589.53 s [vector] +++ OK, passed 100 tests.
  8705. 589.58 s [vector] mut_mapM_: OK (0.03s)
  8706. 589.58 s [vector] +++ OK, passed 100 tests.
  8707. 589.62 s [vector] mut_imapM_: OK (0.04s)
  8708. 589.62 s [vector] +++ OK, passed 100 tests.
  8709. 589.66 s [vector] mut_forM_: OK (0.04s)
  8710. 589.66 s [vector] +++ OK, passed 100 tests.
  8711. 589.70 s [vector] mut_iforM_: OK (0.04s)
  8712. 589.70 s [vector] +++ OK, passed 100 tests.
  8713. 589.72 s [vector] mut_foldr: OK (0.02s)
  8714. 589.72 s [vector] +++ OK, passed 100 tests.
  8715. 589.76 s [vector] mut_foldr': OK (0.03s)
  8716. 589.76 s [vector] +++ OK, passed 100 tests.
  8717. 589.78 s [vector] mut_foldl: OK (0.03s)
  8718. 589.78 s [vector] +++ OK, passed 100 tests.
  8719. 589.80 s [vector] mut_foldl': OK (0.02s)
  8720. 589.80 s [vector] +++ OK, passed 100 tests.
  8721. 589.84 s [vector] mut_ifoldr: OK (0.03s)
  8722. 589.84 s [vector] +++ OK, passed 100 tests.
  8723. 589.86 s [vector] mut_ifoldr': OK (0.02s)
  8724. 589.86 s [vector] +++ OK, passed 100 tests.
  8725. 589.86 s [vector] mut_ifoldl: OK (0.02s)
  8726. 589.86 s [vector] +++ OK, passed 100 tests.
  8727. 589.87 s [vector] mut_ifoldl': OK
  8728. 589.87 s [vector] +++ OK, passed 100 tests.
  8729. 589.90 s [vector] mut_foldM: OK
  8730. 589.90 s [vector] +++ OK, passed 100 tests.
  8731. 589.90 s [vector] mut_foldM': OK (0.01s)
  8732. 589.90 s [vector] +++ OK, passed 100 tests.
  8733. 589.92 s [vector] mut_foldrM: OK
  8734. 589.92 s [vector] +++ OK, passed 100 tests.
  8735. 589.93 s [vector] mut_foldrM': OK (0.01s)
  8736. 589.93 s [vector] +++ OK, passed 100 tests.
  8737. 589.94 s [vector] mut_ifoldM: OK
  8738. 589.94 s [vector] +++ OK, passed 100 tests.
  8739. 589.95 s [vector] mut_ifoldM': OK
  8740. 589.96 s [vector] +++ OK, passed 100 tests.
  8741. 589.98 s [vector] mut_ifoldrM: OK (0.01s)
  8742. 589.98 s [vector] +++ OK, passed 100 tests.
  8743. 589.98 s [vector] mut_ifoldrM': OK (0.01s)
  8744. 589.98 s [vector] +++ OK, passed 100 tests.
  8745. 589.98 s [vector] compare: OK
  8746. 589.98 s [vector] +++ OK, passed 100 tests.
  8747. 589.98 s [vector] maximum: OK
  8748. 589.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8749. 589.98 s [vector] minimum: OK
  8750. 589.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8751. 589.98 s [vector] minIndex: OK
  8752. 589.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8753. 589.98 s [vector] maxIndex: OK
  8754. 589.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8755. 589.98 s [vector] maximumBy: OK
  8756. 589.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8757. 589.98 s [vector] minimumBy: OK
  8758. 589.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8759. 589.98 s [vector] maximumOn: OK
  8760. 589.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8761. 589.98 s [vector] minimumOn: OK
  8762. 589.98 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8763. 589.98 s [vector] maxIndexBy: OK
  8764. 589.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8765. 589.98 s [vector] minIndexBy: OK
  8766. 589.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8767. 589.99 s [vector] ListFirstMaxIndexWins: OK
  8768. 589.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8769. 589.99 s [vector] FalseListFirstMaxIndexWins: OK
  8770. 589.99 s [vector] +++ OK, failed as expected. (after 1 test):
  8771. 589.99 s [vector] Exception:
  8772. 589.99 s [vector] Prelude.foldr1: empty list
  8773. 589.99 s [vector] CallStack (from HasCallStack):
  8774. 589.99 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  8775. 589.99 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  8776. 589.99 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8777. 589.99 s [vector] []
  8778. 589.99 s [vector] mempty: OK
  8779. 589.99 s [vector] +++ OK, passed 100 tests.
  8780. 589.99 s [vector] mappend: OK
  8781. 589.99 s [vector] +++ OK, passed 100 tests.
  8782. 590.01 s [vector] mconcat: OK (0.02s)
  8783. 590.01 s [vector] +++ OK, passed 100 tests.
  8784. 590.01 s [vector] glength: OK
  8785. 590.01 s [vector] +++ OK, passed 100 tests.
  8786. 590.01 s [vector] sum: OK
  8787. 590.01 s [vector] +++ OK, passed 100 tests.
  8788. 590.01 s [vector] product: OK
  8789. 590.01 s [vector] +++ OK, passed 100 tests.
  8790. 590.01 s [vector] enumFromN: OK
  8791. 590.01 s [vector] +++ OK, passed 100 tests.
  8792. 590.01 s [vector] enumFromThenN: OK
  8793. 590.01 s [vector] +++ OK, passed 100 tests.
  8794. 590.01 s [vector] enumFromTo: OK
  8795. 590.01 s [vector] +++ OK, passed 100 tests.
  8796. 590.01 s [vector] enumFromThenTo: OK
  8797. 590.01 s [vector] +++ OK, passed 100 tests; 1 discarded.
  8798. 590.01 s [vector] unstream
  8799. 590.02 s [vector] unstream == vunstream (exact): OK
  8800. 590.02 s [vector] +++ OK, passed 100 tests.
  8801. 590.02 s [vector] unstream == vunstream (unknown): OK
  8802. 590.02 s [vector] +++ OK, passed 100 tests.
  8803. 590.02 s [vector] unstreamR ~= vunstream (exact): OK
  8804. 590.02 s [vector] +++ OK, passed 100 tests.
  8805. 590.02 s [vector] unstreamR ~= vunstream (unknown): OK
  8806. 590.02 s [vector] +++ OK, passed 100 tests.
  8807. 590.02 s [vector] Tests.Vector.Strict
  8808. 590.02 s [vector] Bool
  8809. 590.02 s [vector] fromList.toList == id: OK
  8810. 590.02 s [vector] +++ OK, passed 100 tests.
  8811. 590.02 s [vector] toList.fromList == id: OK
  8812. 590.02 s [vector] +++ OK, passed 100 tests.
  8813. 590.02 s [vector] unstream.stream == id: OK
  8814. 590.02 s [vector] +++ OK, passed 100 tests.
  8815. 590.02 s [vector] stream.unstream == id: OK
  8816. 590.02 s [vector] +++ OK, passed 100 tests.
  8817. 590.02 s [vector] eq: OK
  8818. 590.02 s [vector] +++ OK, passed 100 tests.
  8819. 590.02 s [vector] length: OK
  8820. 590.02 s [vector] +++ OK, passed 100 tests.
  8821. 590.02 s [vector] null: OK
  8822. 590.02 s [vector] +++ OK, passed 100 tests.
  8823. 590.02 s [vector] index: OK
  8824. 590.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8825. 590.02 s [vector] safeIndex: OK
  8826. 590.02 s [vector] +++ OK, passed 100 tests.
  8827. 590.02 s [vector] head: OK
  8828. 590.02 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8829. 590.02 s [vector] last: OK
  8830. 590.02 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8831. 590.02 s [vector] unsafeIndex: OK
  8832. 590.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8833. 590.02 s [vector] unsafeHead: OK
  8834. 590.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8835. 590.02 s [vector] unsafeLast: OK
  8836. 590.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8837. 590.02 s [vector] slice: OK
  8838. 590.02 s [vector] +++ OK, passed 100 tests.
  8839. 590.02 s [vector] init: OK
  8840. 590.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8841. 590.02 s [vector] tail: OK
  8842. 590.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8843. 590.02 s [vector] take: OK
  8844. 590.02 s [vector] +++ OK, passed 100 tests.
  8845. 590.02 s [vector] drop: OK
  8846. 590.02 s [vector] +++ OK, passed 100 tests.
  8847. 590.02 s [vector] splitAt: OK
  8848. 590.02 s [vector] +++ OK, passed 100 tests.
  8849. 590.02 s [vector] empty: OK
  8850. 590.02 s [vector] +++ OK, passed 100 tests.
  8851. 590.02 s [vector] singleton: OK
  8852. 590.02 s [vector] +++ OK, passed 100 tests.
  8853. 590.02 s [vector] replicate: OK
  8854. 590.02 s [vector] +++ OK, passed 100 tests.
  8855. 590.03 s [vector] generate: OK
  8856. 590.04 s [vector] +++ OK, passed 100 tests.
  8857. 590.04 s [vector] iterateN: OK
  8858. 590.04 s [vector] +++ OK, passed 100 tests.
  8859. 590.06 s [vector] iterateNM: OK (0.02s)
  8860. 590.06 s [vector] +++ OK, passed 100 tests.
  8861. 590.07 s [vector] generateM: OK (0.01s)
  8862. 590.07 s [vector] +++ OK, passed 100 tests.
  8863. 590.07 s [vector] replicateM: OK
  8864. 590.07 s [vector] +++ OK, passed 100 tests.
  8865. 590.07 s [vector] create: OK
  8866. 590.07 s [vector] +++ OK, passed 100 tests.
  8867. 590.07 s [vector] createT: OK
  8868. 590.07 s [vector] +++ OK, passed 100 tests.
  8869. 590.07 s [vector] unfoldr: OK
  8870. 590.07 s [vector] +++ OK, passed 100 tests.
  8871. 590.07 s [vector] unfoldrN: OK
  8872. 590.07 s [vector] +++ OK, passed 100 tests.
  8873. 590.07 s [vector] unfoldrExactN: OK
  8874. 590.07 s [vector] +++ OK, passed 100 tests.
  8875. 590.08 s [vector] unfoldrM: OK
  8876. 590.08 s [vector] +++ OK, passed 100 tests.
  8877. 590.10 s [vector] unfoldrNM: OK
  8878. 590.10 s [vector] +++ OK, passed 100 tests.
  8879. 590.13 s [vector] unfoldrExactNM: OK (0.05s)
  8880. 590.13 s [vector] +++ OK, passed 100 tests.
  8881. 590.13 s [vector] constructN: OK
  8882. 590.13 s [vector] +++ OK, passed 100 tests.
  8883. 590.13 s [vector] constructrN: OK
  8884. 590.13 s [vector] +++ OK, passed 100 tests.
  8885. 590.13 s [vector] cons: OK
  8886. 590.14 s [vector] +++ OK, passed 100 tests.
  8887. 590.14 s [vector] snoc: OK
  8888. 590.14 s [vector] +++ OK, passed 100 tests.
  8889. 590.14 s [vector] append: OK
  8890. 590.14 s [vector] +++ OK, passed 100 tests.
  8891. 590.14 s [vector] concat: OK
  8892. 590.14 s [vector] +++ OK, passed 100 tests.
  8893. 590.15 s [vector] force: OK
  8894. 590.15 s [vector] +++ OK, passed 100 tests.
  8895. 590.15 s [vector] upd: OK
  8896. 590.15 s [vector] +++ OK, passed 100 tests.
  8897. 590.15 s [vector] accum: OK
  8898. 590.15 s [vector] +++ OK, passed 100 tests.
  8899. 590.15 s [vector] reverse: OK
  8900. 590.15 s [vector] +++ OK, passed 100 tests.
  8901. 590.15 s [vector] backpermute: OK
  8902. 590.15 s [vector] +++ OK, passed 100 tests.
  8903. 590.15 s [vector] map: OK
  8904. 590.15 s [vector] +++ OK, passed 100 tests.
  8905. 590.15 s [vector] imap: OK
  8906. 590.15 s [vector] +++ OK, passed 100 tests.
  8907. 590.15 s [vector] concatMap: OK
  8908. 590.15 s [vector] +++ OK, passed 100 tests.
  8909. 590.15 s [vector] mapM: OK
  8910. 590.15 s [vector] +++ OK, passed 100 tests.
  8911. 590.16 s [vector] mapM_: OK
  8912. 590.16 s [vector] +++ OK, passed 100 tests.
  8913. 590.16 s [vector] forM: OK
  8914. 590.16 s [vector] +++ OK, passed 100 tests.
  8915. 590.17 s [vector] forM_: OK
  8916. 590.17 s [vector] +++ OK, passed 100 tests.
  8917. 590.18 s [vector] imapM: OK
  8918. 590.18 s [vector] +++ OK, passed 100 tests.
  8919. 590.19 s [vector] imapM_: OK (0.01s)
  8920. 590.19 s [vector] +++ OK, passed 100 tests.
  8921. 590.19 s [vector] zipWith: OK
  8922. 590.19 s [vector] +++ OK, passed 100 tests.
  8923. 590.19 s [vector] zipWith3: OK
  8924. 590.19 s [vector] +++ OK, passed 100 tests.
  8925. 590.19 s [vector] izipWith: OK
  8926. 590.19 s [vector] +++ OK, passed 100 tests.
  8927. 590.19 s [vector] izipWith3: OK
  8928. 590.19 s [vector] +++ OK, passed 100 tests.
  8929. 590.20 s [vector] izipWithM: OK
  8930. 590.20 s [vector] +++ OK, passed 100 tests.
  8931. 590.20 s [vector] izipWithM_: OK
  8932. 590.20 s [vector] +++ OK, passed 100 tests.
  8933. 590.21 s [vector] zipWithM: OK
  8934. 590.21 s [vector] +++ OK, passed 100 tests.
  8935. 590.21 s [vector] zipWithM_: OK
  8936. 590.21 s [vector] +++ OK, passed 100 tests.
  8937. 590.21 s [vector] filter: OK
  8938. 590.21 s [vector] +++ OK, passed 100 tests.
  8939. 590.22 s [vector] ifilter: OK
  8940. 590.22 s [vector] +++ OK, passed 100 tests.
  8941. 590.25 s [vector] filterM: OK (0.03s)
  8942. 590.25 s [vector] +++ OK, passed 100 tests.
  8943. 590.25 s [vector] uniq: OK
  8944. 590.25 s [vector] +++ OK, passed 100 tests.
  8945. 590.26 s [vector] mapMaybe: OK
  8946. 590.26 s [vector] +++ OK, passed 100 tests.
  8947. 590.26 s [vector] imapMaybe: OK
  8948. 590.26 s [vector] +++ OK, passed 100 tests.
  8949. 590.26 s [vector] takeWhile: OK
  8950. 590.26 s [vector] +++ OK, passed 100 tests.
  8951. 590.26 s [vector] dropWhile: OK
  8952. 590.26 s [vector] +++ OK, passed 100 tests.
  8953. 590.26 s [vector] partition: OK
  8954. 590.26 s [vector] +++ OK, passed 100 tests.
  8955. 590.26 s [vector] partitionWith: OK
  8956. 590.26 s [vector] +++ OK, passed 100 tests.
  8957. 590.27 s [vector] span: OK
  8958. 590.27 s [vector] +++ OK, passed 100 tests.
  8959. 590.27 s [vector] break: OK
  8960. 590.27 s [vector] +++ OK, passed 100 tests.
  8961. 590.27 s [vector] spanR: OK
  8962. 590.27 s [vector] +++ OK, passed 100 tests.
  8963. 590.28 s [vector] breakR: OK
  8964. 590.28 s [vector] +++ OK, passed 100 tests.
  8965. 590.28 s [vector] groupBy: OK
  8966. 590.28 s [vector] +++ OK, passed 100 tests.
  8967. 590.28 s [vector] elem: OK
  8968. 590.28 s [vector] +++ OK, passed 100 tests.
  8969. 590.28 s [vector] notElem: OK
  8970. 590.28 s [vector] +++ OK, passed 100 tests.
  8971. 590.28 s [vector] find: OK
  8972. 590.28 s [vector] +++ OK, passed 100 tests.
  8973. 590.28 s [vector] findIndex: OK
  8974. 590.28 s [vector] +++ OK, passed 100 tests.
  8975. 590.28 s [vector] findIndexR: OK
  8976. 590.28 s [vector] +++ OK, passed 100 tests.
  8977. 590.28 s [vector] findIndices: OK
  8978. 590.28 s [vector] +++ OK, passed 100 tests.
  8979. 590.28 s [vector] elemIndex: OK
  8980. 590.28 s [vector] +++ OK, passed 100 tests.
  8981. 590.28 s [vector] elemIndices: OK
  8982. 590.28 s [vector] +++ OK, passed 100 tests.
  8983. 590.29 s [vector] foldl: OK
  8984. 590.29 s [vector] +++ OK, passed 100 tests.
  8985. 590.29 s [vector] foldl1: OK
  8986. 590.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8987. 590.29 s [vector] foldl': OK
  8988. 590.29 s [vector] +++ OK, passed 100 tests.
  8989. 590.29 s [vector] foldl1': OK
  8990. 590.29 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8991. 590.29 s [vector] foldr: OK
  8992. 590.29 s [vector] +++ OK, passed 100 tests.
  8993. 590.29 s [vector] foldr1: OK
  8994. 590.29 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8995. 590.29 s [vector] foldr': OK
  8996. 590.29 s [vector] +++ OK, passed 100 tests.
  8997. 590.29 s [vector] foldr1': OK
  8998. 590.29 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8999. 590.30 s [vector] ifoldl: OK
  9000. 590.30 s [vector] +++ OK, passed 100 tests.
  9001. 590.30 s [vector] ifoldl': OK
  9002. 590.30 s [vector] +++ OK, passed 100 tests.
  9003. 590.30 s [vector] ifoldr: OK
  9004. 590.30 s [vector] +++ OK, passed 100 tests.
  9005. 590.31 s [vector] ifoldr': OK
  9006. 590.31 s [vector] +++ OK, passed 100 tests.
  9007. 590.31 s [vector] ifoldM: OK
  9008. 590.31 s [vector] +++ OK, passed 100 tests.
  9009. 590.32 s [vector] ifoldM': OK
  9010. 590.32 s [vector] +++ OK, passed 100 tests.
  9011. 590.33 s [vector] ifoldM_: OK (0.01s)
  9012. 590.33 s [vector] +++ OK, passed 100 tests.
  9013. 590.34 s [vector] ifoldM'_: OK
  9014. 590.34 s [vector] +++ OK, passed 100 tests.
  9015. 590.34 s [vector] all: OK
  9016. 590.35 s [vector] +++ OK, passed 100 tests.
  9017. 590.35 s [vector] any: OK
  9018. 590.35 s [vector] +++ OK, passed 100 tests.
  9019. 590.35 s [vector] prescanl: OK
  9020. 590.35 s [vector] +++ OK, passed 100 tests.
  9021. 590.35 s [vector] prescanl': OK
  9022. 590.35 s [vector] +++ OK, passed 100 tests.
  9023. 590.35 s [vector] postscanl: OK
  9024. 590.35 s [vector] +++ OK, passed 100 tests.
  9025. 590.35 s [vector] postscanl': OK
  9026. 590.35 s [vector] +++ OK, passed 100 tests.
  9027. 590.35 s [vector] scanl: OK
  9028. 590.35 s [vector] +++ OK, passed 100 tests.
  9029. 590.35 s [vector] scanl': OK
  9030. 590.35 s [vector] +++ OK, passed 100 tests.
  9031. 590.35 s [vector] scanl1: OK
  9032. 590.35 s [vector] +++ OK, passed 100 tests.
  9033. 590.36 s [vector] scanl1': OK
  9034. 590.36 s [vector] +++ OK, passed 100 tests.
  9035. 590.36 s [vector] iscanl: OK
  9036. 590.36 s [vector] +++ OK, passed 100 tests.
  9037. 590.36 s [vector] iscanl': OK
  9038. 590.36 s [vector] +++ OK, passed 100 tests.
  9039. 590.36 s [vector] prescanr: OK
  9040. 590.36 s [vector] +++ OK, passed 100 tests.
  9041. 590.36 s [vector] prescanr': OK
  9042. 590.36 s [vector] +++ OK, passed 100 tests.
  9043. 590.36 s [vector] postscanr: OK
  9044. 590.36 s [vector] +++ OK, passed 100 tests.
  9045. 590.36 s [vector] postscanr': OK
  9046. 590.36 s [vector] +++ OK, passed 100 tests.
  9047. 590.36 s [vector] scanr: OK
  9048. 590.37 s [vector] +++ OK, passed 100 tests.
  9049. 590.37 s [vector] scanr': OK
  9050. 590.37 s [vector] +++ OK, passed 100 tests.
  9051. 590.37 s [vector] scanr1: OK
  9052. 590.37 s [vector] +++ OK, passed 100 tests.
  9053. 590.37 s [vector] scanr1': OK
  9054. 590.37 s [vector] +++ OK, passed 100 tests.
  9055. 590.37 s [vector] iscanr: OK
  9056. 590.37 s [vector] +++ OK, passed 100 tests.
  9057. 590.37 s [vector] iscanr': OK
  9058. 590.37 s [vector] +++ OK, passed 100 tests.
  9059. 590.37 s [vector] mut_read: OK
  9060. 590.37 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9061. 590.37 s [vector] mut_write: OK
  9062. 590.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9063. 590.37 s [vector] mut_modify: OK
  9064. 590.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9065. 590.37 s [vector] mut_generate: OK
  9066. 590.37 s [vector] +++ OK, passed 100 tests.
  9067. 590.38 s [vector] mut_generateM: OK
  9068. 590.38 s [vector] +++ OK, passed 100 tests.
  9069. 590.40 s [vector] mut_mapM_: OK
  9070. 590.40 s [vector] +++ OK, passed 100 tests.
  9071. 590.41 s [vector] mut_imapM_: OK (0.01s)
  9072. 590.42 s [vector] +++ OK, passed 100 tests.
  9073. 590.42 s [vector] mut_forM_: OK
  9074. 590.42 s [vector] +++ OK, passed 100 tests.
  9075. 590.42 s [vector] mut_iforM_: OK
  9076. 590.42 s [vector] +++ OK, passed 100 tests.
  9077. 590.42 s [vector] mut_foldr: OK
  9078. 590.42 s [vector] +++ OK, passed 100 tests.
  9079. 590.42 s [vector] mut_foldr': OK
  9080. 590.42 s [vector] +++ OK, passed 100 tests.
  9081. 590.42 s [vector] mut_foldl: OK
  9082. 590.42 s [vector] +++ OK, passed 100 tests.
  9083. 590.42 s [vector] mut_foldl': OK
  9084. 590.42 s [vector] +++ OK, passed 100 tests.
  9085. 590.43 s [vector] mut_ifoldr: OK
  9086. 590.43 s [vector] +++ OK, passed 100 tests.
  9087. 590.43 s [vector] mut_ifoldr': OK
  9088. 590.43 s [vector] +++ OK, passed 100 tests.
  9089. 590.43 s [vector] mut_ifoldl: OK
  9090. 590.43 s [vector] +++ OK, passed 100 tests.
  9091. 590.43 s [vector] mut_ifoldl': OK
  9092. 590.43 s [vector] +++ OK, passed 100 tests.
  9093. 590.43 s [vector] mut_foldM: OK
  9094. 590.43 s [vector] +++ OK, passed 100 tests.
  9095. 590.43 s [vector] mut_foldM': OK
  9096. 590.43 s [vector] +++ OK, passed 100 tests.
  9097. 590.43 s [vector] mut_foldrM: OK
  9098. 590.43 s [vector] +++ OK, passed 100 tests.
  9099. 590.43 s [vector] mut_foldrM': OK
  9100. 590.43 s [vector] +++ OK, passed 100 tests.
  9101. 590.43 s [vector] mut_ifoldM: OK
  9102. 590.43 s [vector] +++ OK, passed 100 tests.
  9103. 590.43 s [vector] mut_ifoldM': OK
  9104. 590.43 s [vector] +++ OK, passed 100 tests.
  9105. 590.43 s [vector] mut_ifoldrM: OK
  9106. 590.43 s [vector] +++ OK, passed 100 tests.
  9107. 590.44 s [vector] mut_ifoldrM': OK
  9108. 590.44 s [vector] +++ OK, passed 100 tests.
  9109. 590.44 s [vector] compare: OK
  9110. 590.44 s [vector] +++ OK, passed 100 tests.
  9111. 590.44 s [vector] maximum: OK
  9112. 590.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9113. 590.44 s [vector] minimum: OK
  9114. 590.44 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9115. 590.44 s [vector] minIndex: OK
  9116. 590.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9117. 590.44 s [vector] maxIndex: OK
  9118. 590.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9119. 590.44 s [vector] maximumBy: OK
  9120. 590.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9121. 590.44 s [vector] minimumBy: OK
  9122. 590.44 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9123. 590.44 s [vector] maximumOn: OK
  9124. 590.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9125. 590.44 s [vector] minimumOn: OK
  9126. 590.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9127. 590.44 s [vector] maxIndexBy: OK
  9128. 590.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9129. 590.44 s [vector] minIndexBy: OK
  9130. 590.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9131. 590.44 s [vector] ListFirstMaxIndexWins: OK
  9132. 590.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9133. 590.44 s [vector] FalseListFirstMaxIndexWins: OK
  9134. 590.44 s [vector] +++ OK, failed as expected. (after 1 test):
  9135. 590.44 s [vector] Exception:
  9136. 590.44 s [vector] Prelude.foldr1: empty list
  9137. 590.44 s [vector] CallStack (from HasCallStack):
  9138. 590.44 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  9139. 590.44 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  9140. 590.44 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9141. 590.44 s [vector] []
  9142. 590.44 s [vector] zip: OK
  9143. 590.44 s [vector] +++ OK, passed 100 tests.
  9144. 590.44 s [vector] zip3: OK
  9145. 590.44 s [vector] +++ OK, passed 100 tests.
  9146. 590.45 s [vector] unzip: OK
  9147. 590.45 s [vector] +++ OK, passed 100 tests.
  9148. 590.45 s [vector] unzip3: OK
  9149. 590.45 s [vector] +++ OK, passed 100 tests.
  9150. 590.45 s [vector] indexed: OK
  9151. 590.45 s [vector] +++ OK, passed 100 tests.
  9152. 590.45 s [vector] update: OK
  9153. 590.45 s [vector] +++ OK, passed 100 tests.
  9154. 590.45 s [vector] concat: OK
  9155. 590.45 s [vector] +++ OK, passed 100 tests.
  9156. 590.45 s [vector] mempty: OK
  9157. 590.45 s [vector] +++ OK, passed 100 tests.
  9158. 590.46 s [vector] mappend: OK
  9159. 590.46 s [vector] +++ OK, passed 100 tests.
  9160. 590.46 s [vector] mconcat: OK
  9161. 590.46 s [vector] +++ OK, passed 100 tests.
  9162. 590.46 s [vector] fmap: OK
  9163. 590.46 s [vector] +++ OK, passed 100 tests.
  9164. 590.47 s [vector] return: OK
  9165. 590.47 s [vector] +++ OK, passed 100 tests.
  9166. 590.47 s [vector] bind: OK
  9167. 590.47 s [vector] +++ OK, passed 100 tests.
  9168. 590.47 s [vector] mzip: OK
  9169. 590.47 s [vector] +++ OK, passed 100 tests.
  9170. 590.47 s [vector] munzip: OK
  9171. 590.47 s [vector] +++ OK, passed 100 tests.
  9172. 590.48 s [vector] applicative_pure: OK
  9173. 590.48 s [vector] +++ OK, passed 100 tests.
  9174. 590.48 s [vector] applicative_appl: OK (0.01s)
  9175. 590.48 s [vector] +++ OK, passed 100 tests.
  9176. 590.48 s [vector] alternative_empty: OK
  9177. 590.48 s [vector] +++ OK, passed 100 tests.
  9178. 590.48 s [vector] alternative_or: OK
  9179. 590.48 s [vector] +++ OK, passed 100 tests.
  9180. 590.50 s [vector] sequence: OK
  9181. 590.50 s [vector] +++ OK, passed 100 tests.
  9182. 590.51 s [vector] sequence_: OK
  9183. 590.51 s [vector] +++ OK, passed 100 tests.
  9184. 590.52 s [vector] glength: OK
  9185. 590.52 s [vector] +++ OK, passed 100 tests.
  9186. 590.52 s [vector] and: OK
  9187. 590.52 s [vector] +++ OK, passed 100 tests.
  9188. 590.52 s [vector] or: OK
  9189. 590.52 s [vector] +++ OK, passed 100 tests.
  9190. 590.52 s [vector] Int
  9191. 590.52 s [vector] fromList.toList == id: OK
  9192. 590.52 s [vector] +++ OK, passed 100 tests.
  9193. 590.52 s [vector] toList.fromList == id: OK
  9194. 590.52 s [vector] +++ OK, passed 100 tests.
  9195. 590.52 s [vector] unstream.stream == id: OK
  9196. 590.52 s [vector] +++ OK, passed 100 tests.
  9197. 590.52 s [vector] stream.unstream == id: OK
  9198. 590.52 s [vector] +++ OK, passed 100 tests.
  9199. 590.52 s [vector] eq: OK
  9200. 590.52 s [vector] +++ OK, passed 100 tests.
  9201. 590.52 s [vector] length: OK
  9202. 590.52 s [vector] +++ OK, passed 100 tests.
  9203. 590.52 s [vector] null: OK
  9204. 590.52 s [vector] +++ OK, passed 100 tests.
  9205. 590.52 s [vector] index: OK
  9206. 590.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9207. 590.52 s [vector] safeIndex: OK
  9208. 590.52 s [vector] +++ OK, passed 100 tests.
  9209. 590.52 s [vector] head: OK
  9210. 590.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9211. 590.52 s [vector] last: OK
  9212. 590.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9213. 590.52 s [vector] unsafeIndex: OK
  9214. 590.52 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9215. 590.52 s [vector] unsafeHead: OK
  9216. 590.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9217. 590.52 s [vector] unsafeLast: OK
  9218. 590.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9219. 590.52 s [vector] slice: OK
  9220. 590.52 s [vector] +++ OK, passed 100 tests.
  9221. 590.52 s [vector] init: OK
  9222. 590.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9223. 590.52 s [vector] tail: OK
  9224. 590.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9225. 590.53 s [vector] take: OK
  9226. 590.53 s [vector] +++ OK, passed 100 tests.
  9227. 590.53 s [vector] drop: OK
  9228. 590.53 s [vector] +++ OK, passed 100 tests.
  9229. 590.53 s [vector] splitAt: OK
  9230. 590.53 s [vector] +++ OK, passed 100 tests.
  9231. 590.53 s [vector] empty: OK
  9232. 590.53 s [vector] +++ OK, passed 100 tests.
  9233. 590.53 s [vector] singleton: OK
  9234. 590.53 s [vector] +++ OK, passed 100 tests.
  9235. 590.53 s [vector] replicate: OK
  9236. 590.53 s [vector] +++ OK, passed 100 tests.
  9237. 590.53 s [vector] generate: OK
  9238. 590.53 s [vector] +++ OK, passed 100 tests.
  9239. 590.54 s [vector] iterateN: OK
  9240. 590.54 s [vector] +++ OK, passed 100 tests.
  9241. 590.57 s [vector] iterateNM: OK (0.03s)
  9242. 590.57 s [vector] +++ OK, passed 100 tests.
  9243. 590.58 s [vector] generateM: OK
  9244. 590.58 s [vector] +++ OK, passed 100 tests.
  9245. 590.58 s [vector] replicateM: OK
  9246. 590.58 s [vector] +++ OK, passed 100 tests.
  9247. 590.58 s [vector] create: OK
  9248. 590.58 s [vector] +++ OK, passed 100 tests.
  9249. 590.58 s [vector] createT: OK
  9250. 590.58 s [vector] +++ OK, passed 100 tests.
  9251. 590.58 s [vector] unfoldr: OK
  9252. 590.58 s [vector] +++ OK, passed 100 tests.
  9253. 590.58 s [vector] unfoldrN: OK
  9254. 590.58 s [vector] +++ OK, passed 100 tests.
  9255. 590.59 s [vector] unfoldrExactN: OK
  9256. 590.59 s [vector] +++ OK, passed 100 tests.
  9257. 590.59 s [vector] unfoldrM: OK
  9258. 590.59 s [vector] +++ OK, passed 100 tests.
  9259. 590.60 s [vector] unfoldrNM: OK
  9260. 590.60 s [vector] +++ OK, passed 100 tests.
  9261. 590.64 s [vector] unfoldrExactNM: OK (0.04s)
  9262. 590.64 s [vector] +++ OK, passed 100 tests.
  9263. 590.64 s [vector] constructN: OK
  9264. 590.64 s [vector] +++ OK, passed 100 tests.
  9265. 590.64 s [vector] constructrN: OK
  9266. 590.64 s [vector] +++ OK, passed 100 tests.
  9267. 590.64 s [vector] cons: OK
  9268. 590.64 s [vector] +++ OK, passed 100 tests.
  9269. 590.64 s [vector] snoc: OK
  9270. 590.64 s [vector] +++ OK, passed 100 tests.
  9271. 590.65 s [vector] append: OK
  9272. 590.65 s [vector] +++ OK, passed 100 tests.
  9273. 590.65 s [vector] concat: OK (0.01s)
  9274. 590.65 s [vector] +++ OK, passed 100 tests.
  9275. 590.65 s [vector] force: OK
  9276. 590.66 s [vector] +++ OK, passed 100 tests.
  9277. 590.66 s [vector] upd: OK
  9278. 590.66 s [vector] +++ OK, passed 100 tests.
  9279. 590.66 s [vector] accum: OK
  9280. 590.66 s [vector] +++ OK, passed 100 tests.
  9281. 590.66 s [vector] reverse: OK
  9282. 590.66 s [vector] +++ OK, passed 100 tests.
  9283. 590.66 s [vector] backpermute: OK
  9284. 590.66 s [vector] +++ OK, passed 100 tests.
  9285. 590.66 s [vector] map: OK
  9286. 590.66 s [vector] +++ OK, passed 100 tests.
  9287. 590.66 s [vector] imap: OK
  9288. 590.67 s [vector] +++ OK, passed 100 tests.
  9289. 590.67 s [vector] concatMap: OK
  9290. 590.67 s [vector] +++ OK, passed 100 tests.
  9291. 590.67 s [vector] mapM: OK
  9292. 590.67 s [vector] +++ OK, passed 100 tests.
  9293. 590.68 s [vector] mapM_: OK (0.01s)
  9294. 590.68 s [vector] +++ OK, passed 100 tests.
  9295. 590.70 s [vector] forM: OK
  9296. 590.70 s [vector] +++ OK, passed 100 tests.
  9297. 590.70 s [vector] forM_: OK (0.01s)
  9298. 590.70 s [vector] +++ OK, passed 100 tests.
  9299. 590.72 s [vector] imapM: OK
  9300. 590.72 s [vector] +++ OK, passed 100 tests.
  9301. 590.72 s [vector] imapM_: OK (0.01s)
  9302. 590.72 s [vector] +++ OK, passed 100 tests.
  9303. 590.72 s [vector] zipWith: OK
  9304. 590.72 s [vector] +++ OK, passed 100 tests.
  9305. 590.72 s [vector] zipWith3: OK
  9306. 590.72 s [vector] +++ OK, passed 100 tests.
  9307. 590.73 s [vector] izipWith: OK
  9308. 590.73 s [vector] +++ OK, passed 100 tests.
  9309. 590.73 s [vector] izipWith3: OK
  9310. 590.73 s [vector] +++ OK, passed 100 tests.
  9311. 590.73 s [vector] izipWithM: OK
  9312. 590.73 s [vector] +++ OK, passed 100 tests.
  9313. 590.74 s [vector] izipWithM_: OK
  9314. 590.74 s [vector] +++ OK, passed 100 tests.
  9315. 590.74 s [vector] zipWithM: OK
  9316. 590.74 s [vector] +++ OK, passed 100 tests.
  9317. 590.76 s [vector] zipWithM_: OK
  9318. 590.76 s [vector] +++ OK, passed 100 tests.
  9319. 590.76 s [vector] filter: OK
  9320. 590.76 s [vector] +++ OK, passed 100 tests.
  9321. 590.76 s [vector] ifilter: OK
  9322. 590.76 s [vector] +++ OK, passed 100 tests.
  9323. 590.78 s [vector] filterM: OK (0.02s)
  9324. 590.78 s [vector] +++ OK, passed 100 tests.
  9325. 590.78 s [vector] uniq: OK
  9326. 590.79 s [vector] +++ OK, passed 100 tests.
  9327. 590.79 s [vector] mapMaybe: OK
  9328. 590.79 s [vector] +++ OK, passed 100 tests.
  9329. 590.79 s [vector] imapMaybe: OK
  9330. 590.79 s [vector] +++ OK, passed 100 tests.
  9331. 590.79 s [vector] takeWhile: OK
  9332. 590.79 s [vector] +++ OK, passed 100 tests.
  9333. 590.79 s [vector] dropWhile: OK
  9334. 590.79 s [vector] +++ OK, passed 100 tests.
  9335. 590.79 s [vector] partition: OK
  9336. 590.79 s [vector] +++ OK, passed 100 tests.
  9337. 590.79 s [vector] partitionWith: OK
  9338. 590.79 s [vector] +++ OK, passed 100 tests.
  9339. 590.79 s [vector] span: OK
  9340. 590.79 s [vector] +++ OK, passed 100 tests.
  9341. 590.79 s [vector] break: OK
  9342. 590.79 s [vector] +++ OK, passed 100 tests.
  9343. 590.79 s [vector] spanR: OK
  9344. 590.79 s [vector] +++ OK, passed 100 tests.
  9345. 590.79 s [vector] breakR: OK
  9346. 590.79 s [vector] +++ OK, passed 100 tests.
  9347. 590.79 s [vector] groupBy: OK
  9348. 590.79 s [vector] +++ OK, passed 100 tests.
  9349. 590.79 s [vector] elem: OK
  9350. 590.79 s [vector] +++ OK, passed 100 tests.
  9351. 590.79 s [vector] notElem: OK
  9352. 590.79 s [vector] +++ OK, passed 100 tests.
  9353. 590.79 s [vector] find: OK
  9354. 590.79 s [vector] +++ OK, passed 100 tests.
  9355. 590.80 s [vector] findIndex: OK
  9356. 590.80 s [vector] +++ OK, passed 100 tests.
  9357. 590.80 s [vector] findIndexR: OK
  9358. 590.80 s [vector] +++ OK, passed 100 tests.
  9359. 590.80 s [vector] findIndices: OK
  9360. 590.80 s [vector] +++ OK, passed 100 tests.
  9361. 590.80 s [vector] elemIndex: OK
  9362. 590.80 s [vector] +++ OK, passed 100 tests.
  9363. 590.80 s [vector] elemIndices: OK
  9364. 590.80 s [vector] +++ OK, passed 100 tests.
  9365. 590.80 s [vector] foldl: OK
  9366. 590.80 s [vector] +++ OK, passed 100 tests.
  9367. 590.81 s [vector] foldl1: OK
  9368. 590.81 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9369. 590.81 s [vector] foldl': OK
  9370. 590.81 s [vector] +++ OK, passed 100 tests.
  9371. 590.81 s [vector] foldl1': OK
  9372. 590.81 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9373. 590.81 s [vector] foldr: OK
  9374. 590.81 s [vector] +++ OK, passed 100 tests.
  9375. 590.82 s [vector] foldr1: OK
  9376. 590.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9377. 590.82 s [vector] foldr': OK
  9378. 590.82 s [vector] +++ OK, passed 100 tests.
  9379. 590.82 s [vector] foldr1': OK
  9380. 590.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9381. 590.82 s [vector] ifoldl: OK
  9382. 590.83 s [vector] +++ OK, passed 100 tests.
  9383. 590.83 s [vector] ifoldl': OK
  9384. 590.83 s [vector] +++ OK, passed 100 tests.
  9385. 590.83 s [vector] ifoldr: OK
  9386. 590.83 s [vector] +++ OK, passed 100 tests.
  9387. 590.83 s [vector] ifoldr': OK
  9388. 590.83 s [vector] +++ OK, passed 100 tests.
  9389. 590.84 s [vector] ifoldM: OK
  9390. 590.84 s [vector] +++ OK, passed 100 tests.
  9391. 590.84 s [vector] ifoldM': OK
  9392. 590.84 s [vector] +++ OK, passed 100 tests.
  9393. 590.86 s [vector] ifoldM_: OK (0.01s)
  9394. 590.86 s [vector] +++ OK, passed 100 tests.
  9395. 590.87 s [vector] ifoldM'_: OK (0.01s)
  9396. 590.87 s [vector] +++ OK, passed 100 tests.
  9397. 590.87 s [vector] all: OK
  9398. 590.87 s [vector] +++ OK, passed 100 tests.
  9399. 590.87 s [vector] any: OK
  9400. 590.87 s [vector] +++ OK, passed 100 tests.
  9401. 590.87 s [vector] prescanl: OK
  9402. 590.87 s [vector] +++ OK, passed 100 tests.
  9403. 590.87 s [vector] prescanl': OK
  9404. 590.88 s [vector] +++ OK, passed 100 tests.
  9405. 590.88 s [vector] postscanl: OK
  9406. 590.88 s [vector] +++ OK, passed 100 tests.
  9407. 590.88 s [vector] postscanl': OK
  9408. 590.88 s [vector] +++ OK, passed 100 tests.
  9409. 590.88 s [vector] scanl: OK
  9410. 590.88 s [vector] +++ OK, passed 100 tests.
  9411. 590.88 s [vector] scanl': OK
  9412. 590.88 s [vector] +++ OK, passed 100 tests.
  9413. 590.88 s [vector] scanl1: OK
  9414. 590.88 s [vector] +++ OK, passed 100 tests.
  9415. 590.88 s [vector] scanl1': OK
  9416. 590.88 s [vector] +++ OK, passed 100 tests.
  9417. 590.89 s [vector] iscanl: OK
  9418. 590.89 s [vector] +++ OK, passed 100 tests.
  9419. 590.89 s [vector] iscanl': OK
  9420. 590.89 s [vector] +++ OK, passed 100 tests.
  9421. 590.89 s [vector] prescanr: OK
  9422. 590.89 s [vector] +++ OK, passed 100 tests.
  9423. 590.90 s [vector] prescanr': OK
  9424. 590.90 s [vector] +++ OK, passed 100 tests.
  9425. 590.90 s [vector] postscanr: OK
  9426. 590.90 s [vector] +++ OK, passed 100 tests.
  9427. 590.90 s [vector] postscanr': OK
  9428. 590.90 s [vector] +++ OK, passed 100 tests.
  9429. 590.90 s [vector] scanr: OK
  9430. 590.90 s [vector] +++ OK, passed 100 tests.
  9431. 590.90 s [vector] scanr': OK
  9432. 590.90 s [vector] +++ OK, passed 100 tests.
  9433. 590.91 s [vector] scanr1: OK
  9434. 590.91 s [vector] +++ OK, passed 100 tests.
  9435. 590.91 s [vector] scanr1': OK
  9436. 590.91 s [vector] +++ OK, passed 100 tests.
  9437. 590.91 s [vector] iscanr: OK
  9438. 590.91 s [vector] +++ OK, passed 100 tests.
  9439. 590.91 s [vector] iscanr': OK
  9440. 590.91 s [vector] +++ OK, passed 100 tests.
  9441. 590.92 s [vector] mut_read: OK
  9442. 590.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9443. 590.92 s [vector] mut_write: OK
  9444. 590.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9445. 590.92 s [vector] mut_modify: OK
  9446. 590.92 s [vector] +++ OK, passed 100 tests; 26 discarded.
  9447. 590.93 s [vector] mut_generate: OK
  9448. 590.93 s [vector] +++ OK, passed 100 tests.
  9449. 590.93 s [vector] mut_generateM: OK
  9450. 590.94 s [vector] +++ OK, passed 100 tests.
  9451. 590.95 s [vector] mut_mapM_: OK (0.02s)
  9452. 590.95 s [vector] +++ OK, passed 100 tests.
  9453. 590.98 s [vector] mut_imapM_: OK
  9454. 590.98 s [vector] +++ OK, passed 100 tests.
  9455. 590.98 s [vector] mut_forM_: OK (0.02s)
  9456. 590.98 s [vector] +++ OK, passed 100 tests.
  9457. 591.00 s [vector] mut_iforM_: OK
  9458. 591.00 s [vector] +++ OK, passed 100 tests.
  9459. 591.00 s [vector] mut_foldr: OK
  9460. 591.00 s [vector] +++ OK, passed 100 tests.
  9461. 591.00 s [vector] mut_foldr': OK
  9462. 591.00 s [vector] +++ OK, passed 100 tests.
  9463. 591.01 s [vector] mut_foldl: OK
  9464. 591.01 s [vector] +++ OK, passed 100 tests.
  9465. 591.01 s [vector] mut_foldl': OK
  9466. 591.01 s [vector] +++ OK, passed 100 tests.
  9467. 591.01 s [vector] mut_ifoldr: OK
  9468. 591.01 s [vector] +++ OK, passed 100 tests.
  9469. 591.02 s [vector] mut_ifoldr': OK
  9470. 591.02 s [vector] +++ OK, passed 100 tests.
  9471. 591.02 s [vector] mut_ifoldl: OK
  9472. 591.02 s [vector] +++ OK, passed 100 tests.
  9473. 591.02 s [vector] mut_ifoldl': OK
  9474. 591.02 s [vector] +++ OK, passed 100 tests.
  9475. 591.02 s [vector] mut_foldM: OK
  9476. 591.02 s [vector] +++ OK, passed 100 tests.
  9477. 591.03 s [vector] mut_foldM': OK
  9478. 591.03 s [vector] +++ OK, passed 100 tests.
  9479. 591.04 s [vector] mut_foldrM: OK
  9480. 591.04 s [vector] +++ OK, passed 100 tests.
  9481. 591.04 s [vector] mut_foldrM': OK
  9482. 591.04 s [vector] +++ OK, passed 100 tests.
  9483. 591.04 s [vector] mut_ifoldM: OK
  9484. 591.04 s [vector] +++ OK, passed 100 tests.
  9485. 591.04 s [vector] mut_ifoldM': OK
  9486. 591.04 s [vector] +++ OK, passed 100 tests.
  9487. 591.04 s [vector] mut_ifoldrM: OK
  9488. 591.04 s [vector] +++ OK, passed 100 tests.
  9489. 591.04 s [vector] mut_ifoldrM': OK
  9490. 591.04 s [vector] +++ OK, passed 100 tests.
  9491. 591.04 s [vector] compare: OK
  9492. 591.04 s [vector] +++ OK, passed 100 tests.
  9493. 591.04 s [vector] maximum: OK
  9494. 591.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9495. 591.04 s [vector] minimum: OK
  9496. 591.04 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9497. 591.04 s [vector] minIndex: OK
  9498. 591.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9499. 591.04 s [vector] maxIndex: OK
  9500. 591.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9501. 591.04 s [vector] maximumBy: OK
  9502. 591.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9503. 591.05 s [vector] minimumBy: OK
  9504. 591.05 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9505. 591.05 s [vector] maximumOn: OK
  9506. 591.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9507. 591.05 s [vector] minimumOn: OK
  9508. 591.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9509. 591.05 s [vector] maxIndexBy: OK
  9510. 591.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9511. 591.05 s [vector] minIndexBy: OK
  9512. 591.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9513. 591.05 s [vector] ListFirstMaxIndexWins: OK
  9514. 591.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9515. 591.05 s [vector] FalseListFirstMaxIndexWins: OK
  9516. 591.05 s [vector] +++ OK, failed as expected. (after 1 test):
  9517. 591.05 s [vector] Exception:
  9518. 591.05 s [vector] Prelude.foldr1: empty list
  9519. 591.05 s [vector] CallStack (from HasCallStack):
  9520. 591.05 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  9521. 591.05 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  9522. 591.05 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9523. 591.05 s [vector] []
  9524. 591.05 s [vector] zip: OK
  9525. 591.05 s [vector] +++ OK, passed 100 tests.
  9526. 591.05 s [vector] zip3: OK
  9527. 591.05 s [vector] +++ OK, passed 100 tests.
  9528. 591.05 s [vector] unzip: OK
  9529. 591.05 s [vector] +++ OK, passed 100 tests.
  9530. 591.05 s [vector] unzip3: OK
  9531. 591.05 s [vector] +++ OK, passed 100 tests.
  9532. 591.05 s [vector] indexed: OK
  9533. 591.05 s [vector] +++ OK, passed 100 tests.
  9534. 591.05 s [vector] update: OK
  9535. 591.05 s [vector] +++ OK, passed 100 tests.
  9536. 591.07 s [vector] concat: OK
  9537. 591.07 s [vector] +++ OK, passed 100 tests.
  9538. 591.07 s [vector] mempty: OK
  9539. 591.07 s [vector] +++ OK, passed 100 tests.
  9540. 591.08 s [vector] mappend: OK
  9541. 591.08 s [vector] +++ OK, passed 100 tests.
  9542. 591.09 s [vector] mconcat: OK (0.01s)
  9543. 591.09 s [vector] +++ OK, passed 100 tests.
  9544. 591.09 s [vector] fmap: OK
  9545. 591.09 s [vector] +++ OK, passed 100 tests.
  9546. 591.10 s [vector] return: OK
  9547. 591.10 s [vector] +++ OK, passed 100 tests.
  9548. 591.11 s [vector] bind: OK (0.02s)
  9549. 591.11 s [vector] +++ OK, passed 100 tests.
  9550. 591.11 s [vector] mzip: OK
  9551. 591.11 s [vector] +++ OK, passed 100 tests.
  9552. 591.11 s [vector] munzip: OK
  9553. 591.11 s [vector] +++ OK, passed 100 tests.
  9554. 591.12 s [vector] applicative_pure: OK
  9555. 591.12 s [vector] +++ OK, passed 100 tests.
  9556. 591.15 s [vector] applicative_appl: OK (0.04s)
  9557. 591.15 s [vector] +++ OK, passed 100 tests.
  9558. 591.15 s [vector] alternative_empty: OK
  9559. 591.15 s [vector] +++ OK, passed 100 tests.
  9560. 591.16 s [vector] alternative_or: OK
  9561. 591.16 s [vector] +++ OK, passed 100 tests.
  9562. 591.19 s [vector] sequence: OK (0.03s)
  9563. 591.19 s [vector] +++ OK, passed 100 tests.
  9564. 591.20 s [vector] sequence_: OK
  9565. 591.20 s [vector] +++ OK, passed 100 tests.
  9566. 591.20 s [vector] glength: OK
  9567. 591.20 s [vector] +++ OK, passed 100 tests.
  9568. 591.20 s [vector] sum: OK
  9569. 591.20 s [vector] +++ OK, passed 100 tests.
  9570. 591.20 s [vector] product: OK
  9571. 591.20 s [vector] +++ OK, passed 100 tests.
  9572. 591.20 s [vector] enumFromN: OK
  9573. 591.20 s [vector] +++ OK, passed 100 tests.
  9574. 591.20 s [vector] enumFromThenN: OK
  9575. 591.20 s [vector] +++ OK, passed 100 tests.
  9576. 591.20 s [vector] enumFromTo: OK
  9577. 591.20 s [vector] +++ OK, passed 100 tests.
  9578. 591.20 s [vector] enumFromThenTo: OK
  9579. 591.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9580. 591.20 s [vector] unstream
  9581. 591.20 s [vector] unstream == vunstream (exact): OK
  9582. 591.20 s [vector] +++ OK, passed 100 tests.
  9583. 591.20 s [vector] unstream == vunstream (unknown): OK
  9584. 591.20 s [vector] +++ OK, passed 100 tests.
  9585. 591.20 s [vector] unstreamR ~= vunstream (exact): OK
  9586. 591.20 s [vector] +++ OK, passed 100 tests.
  9587. 591.20 s [vector] unstreamR ~= vunstream (unknown): OK
  9588. 591.20 s [vector] +++ OK, passed 100 tests.
  9589. 591.20 s [vector] Tests.Vector.Unboxed
  9590. 591.20 s [vector] ()
  9591. 591.20 s [vector] fromList.toList == id: OK
  9592. 591.20 s [vector] +++ OK, passed 100 tests.
  9593. 591.20 s [vector] toList.fromList == id: OK
  9594. 591.20 s [vector] +++ OK, passed 100 tests.
  9595. 591.20 s [vector] unstream.stream == id: OK
  9596. 591.20 s [vector] +++ OK, passed 100 tests.
  9597. 591.20 s [vector] stream.unstream == id: OK
  9598. 591.20 s [vector] +++ OK, passed 100 tests.
  9599. 591.20 s [vector] eq: OK
  9600. 591.20 s [vector] +++ OK, passed 100 tests.
  9601. 591.20 s [vector] length: OK
  9602. 591.20 s [vector] +++ OK, passed 100 tests.
  9603. 591.20 s [vector] null: OK
  9604. 591.20 s [vector] +++ OK, passed 100 tests.
  9605. 591.20 s [vector] index: OK
  9606. 591.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9607. 591.20 s [vector] safeIndex: OK
  9608. 591.20 s [vector] +++ OK, passed 100 tests.
  9609. 591.20 s [vector] head: OK
  9610. 591.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9611. 591.20 s [vector] last: OK
  9612. 591.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9613. 591.20 s [vector] unsafeIndex: OK
  9614. 591.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9615. 591.20 s [vector] unsafeHead: OK
  9616. 591.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9617. 591.20 s [vector] unsafeLast: OK
  9618. 591.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9619. 591.20 s [vector] slice: OK
  9620. 591.20 s [vector] +++ OK, passed 100 tests.
  9621. 591.20 s [vector] init: OK
  9622. 591.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9623. 591.20 s [vector] tail: OK
  9624. 591.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9625. 591.20 s [vector] take: OK
  9626. 591.20 s [vector] +++ OK, passed 100 tests.
  9627. 591.20 s [vector] drop: OK
  9628. 591.20 s [vector] +++ OK, passed 100 tests.
  9629. 591.20 s [vector] splitAt: OK
  9630. 591.20 s [vector] +++ OK, passed 100 tests.
  9631. 591.20 s [vector] empty: OK
  9632. 591.20 s [vector] +++ OK, passed 100 tests.
  9633. 591.20 s [vector] singleton: OK
  9634. 591.20 s [vector] +++ OK, passed 100 tests.
  9635. 591.20 s [vector] replicate: OK
  9636. 591.20 s [vector] +++ OK, passed 100 tests.
  9637. 591.20 s [vector] generate: OK
  9638. 591.20 s [vector] +++ OK, passed 100 tests.
  9639. 591.22 s [vector] iterateN: OK
  9640. 591.22 s [vector] +++ OK, passed 100 tests.
  9641. 591.24 s [vector] iterateNM: OK (0.04s)
  9642. 591.24 s [vector] +++ OK, passed 100 tests.
  9643. 591.26 s [vector] generateM: OK
  9644. 591.26 s [vector] +++ OK, passed 100 tests.
  9645. 591.26 s [vector] replicateM: OK
  9646. 591.26 s [vector] +++ OK, passed 100 tests.
  9647. 591.26 s [vector] create: OK
  9648. 591.26 s [vector] +++ OK, passed 100 tests.
  9649. 591.26 s [vector] createT: OK
  9650. 591.26 s [vector] +++ OK, passed 100 tests.
  9651. 591.26 s [vector] unfoldr: OK
  9652. 591.26 s [vector] +++ OK, passed 100 tests.
  9653. 591.26 s [vector] unfoldrN: OK
  9654. 591.26 s [vector] +++ OK, passed 100 tests.
  9655. 591.26 s [vector] unfoldrExactN: OK
  9656. 591.26 s [vector] +++ OK, passed 100 tests.
  9657. 591.27 s [vector] unfoldrM: OK
  9658. 591.28 s [vector] +++ OK, passed 100 tests.
  9659. 591.28 s [vector] unfoldrNM: OK
  9660. 591.28 s [vector] +++ OK, passed 100 tests.
  9661. 591.29 s [vector] unfoldrExactNM: OK (0.02s)
  9662. 591.29 s [vector] +++ OK, passed 100 tests.
  9663. 591.29 s [vector] constructN: OK
  9664. 591.29 s [vector] +++ OK, passed 100 tests.
  9665. 591.29 s [vector] constructrN: OK
  9666. 591.29 s [vector] +++ OK, passed 100 tests.
  9667. 591.29 s [vector] cons: OK
  9668. 591.29 s [vector] +++ OK, passed 100 tests.
  9669. 591.29 s [vector] snoc: OK
  9670. 591.29 s [vector] +++ OK, passed 100 tests.
  9671. 591.30 s [vector] append: OK
  9672. 591.30 s [vector] +++ OK, passed 100 tests.
  9673. 591.30 s [vector] concat: OK
  9674. 591.30 s [vector] +++ OK, passed 100 tests.
  9675. 591.30 s [vector] force: OK
  9676. 591.30 s [vector] +++ OK, passed 100 tests.
  9677. 591.30 s [vector] upd: OK
  9678. 591.30 s [vector] +++ OK, passed 100 tests.
  9679. 591.30 s [vector] accum: OK
  9680. 591.31 s [vector] +++ OK, passed 100 tests.
  9681. 591.31 s [vector] reverse: OK
  9682. 591.31 s [vector] +++ OK, passed 100 tests.
  9683. 591.31 s [vector] backpermute: OK
  9684. 591.31 s [vector] +++ OK, passed 100 tests.
  9685. 591.31 s [vector] map: OK
  9686. 591.31 s [vector] +++ OK, passed 100 tests.
  9687. 591.31 s [vector] imap: OK
  9688. 591.31 s [vector] +++ OK, passed 100 tests.
  9689. 591.31 s [vector] concatMap: OK
  9690. 591.31 s [vector] +++ OK, passed 100 tests.
  9691. 591.31 s [vector] mapM: OK
  9692. 591.31 s [vector] +++ OK, passed 100 tests.
  9693. 591.32 s [vector] mapM_: OK
  9694. 591.33 s [vector] +++ OK, passed 100 tests.
  9695. 591.33 s [vector] forM: OK
  9696. 591.33 s [vector] +++ OK, passed 100 tests.
  9697. 591.33 s [vector] forM_: OK
  9698. 591.33 s [vector] +++ OK, passed 100 tests.
  9699. 591.34 s [vector] imapM: OK
  9700. 591.34 s [vector] +++ OK, passed 100 tests.
  9701. 591.34 s [vector] imapM_: OK
  9702. 591.34 s [vector] +++ OK, passed 100 tests.
  9703. 591.34 s [vector] zipWith: OK
  9704. 591.34 s [vector] +++ OK, passed 100 tests.
  9705. 591.34 s [vector] zipWith3: OK
  9706. 591.34 s [vector] +++ OK, passed 100 tests.
  9707. 591.34 s [vector] izipWith: OK
  9708. 591.34 s [vector] +++ OK, passed 100 tests.
  9709. 591.34 s [vector] izipWith3: OK
  9710. 591.34 s [vector] +++ OK, passed 100 tests.
  9711. 591.34 s [vector] izipWithM: OK
  9712. 591.35 s [vector] +++ OK, passed 100 tests.
  9713. 591.35 s [vector] izipWithM_: OK
  9714. 591.35 s [vector] +++ OK, passed 100 tests.
  9715. 591.35 s [vector] zipWithM: OK
  9716. 591.35 s [vector] +++ OK, passed 100 tests.
  9717. 591.35 s [vector] zipWithM_: OK
  9718. 591.35 s [vector] +++ OK, passed 100 tests.
  9719. 591.35 s [vector] filter: OK
  9720. 591.35 s [vector] +++ OK, passed 100 tests.
  9721. 591.35 s [vector] ifilter: OK
  9722. 591.35 s [vector] +++ OK, passed 100 tests.
  9723. 591.38 s [vector] filterM: OK (0.02s)
  9724. 591.38 s [vector] +++ OK, passed 100 tests.
  9725. 591.38 s [vector] uniq: OK
  9726. 591.38 s [vector] +++ OK, passed 100 tests.
  9727. 591.38 s [vector] mapMaybe: OK
  9728. 591.38 s [vector] +++ OK, passed 100 tests.
  9729. 591.38 s [vector] imapMaybe: OK
  9730. 591.38 s [vector] +++ OK, passed 100 tests.
  9731. 591.38 s [vector] takeWhile: OK
  9732. 591.38 s [vector] +++ OK, passed 100 tests.
  9733. 591.38 s [vector] dropWhile: OK
  9734. 591.38 s [vector] +++ OK, passed 100 tests.
  9735. 591.38 s [vector] partition: OK
  9736. 591.38 s [vector] +++ OK, passed 100 tests.
  9737. 591.38 s [vector] partitionWith: OK
  9738. 591.38 s [vector] +++ OK, passed 100 tests.
  9739. 591.38 s [vector] span: OK
  9740. 591.38 s [vector] +++ OK, passed 100 tests.
  9741. 591.38 s [vector] break: OK
  9742. 591.38 s [vector] +++ OK, passed 100 tests.
  9743. 591.39 s [vector] spanR: OK
  9744. 591.39 s [vector] +++ OK, passed 100 tests.
  9745. 591.39 s [vector] breakR: OK
  9746. 591.39 s [vector] +++ OK, passed 100 tests.
  9747. 591.39 s [vector] groupBy: OK
  9748. 591.39 s [vector] +++ OK, passed 100 tests.
  9749. 591.39 s [vector] elem: OK
  9750. 591.39 s [vector] +++ OK, passed 100 tests.
  9751. 591.39 s [vector] notElem: OK
  9752. 591.39 s [vector] +++ OK, passed 100 tests.
  9753. 591.39 s [vector] find: OK
  9754. 591.39 s [vector] +++ OK, passed 100 tests.
  9755. 591.39 s [vector] findIndex: OK
  9756. 591.39 s [vector] +++ OK, passed 100 tests.
  9757. 591.39 s [vector] findIndexR: OK
  9758. 591.39 s [vector] +++ OK, passed 100 tests.
  9759. 591.39 s [vector] findIndices: OK
  9760. 591.39 s [vector] +++ OK, passed 100 tests.
  9761. 591.39 s [vector] elemIndex: OK
  9762. 591.39 s [vector] +++ OK, passed 100 tests.
  9763. 591.39 s [vector] elemIndices: OK
  9764. 591.39 s [vector] +++ OK, passed 100 tests.
  9765. 591.39 s [vector] foldl: OK
  9766. 591.39 s [vector] +++ OK, passed 100 tests.
  9767. 591.39 s [vector] foldl1: OK
  9768. 591.39 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9769. 591.39 s [vector] foldl': OK
  9770. 591.39 s [vector] +++ OK, passed 100 tests.
  9771. 591.39 s [vector] foldl1': OK
  9772. 591.39 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9773. 591.39 s [vector] foldr: OK
  9774. 591.39 s [vector] +++ OK, passed 100 tests.
  9775. 591.39 s [vector] foldr1: OK
  9776. 591.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9777. 591.39 s [vector] foldr': OK
  9778. 591.40 s [vector] +++ OK, passed 100 tests.
  9779. 591.40 s [vector] foldr1': OK
  9780. 591.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9781. 591.40 s [vector] ifoldl: OK
  9782. 591.40 s [vector] +++ OK, passed 100 tests.
  9783. 591.40 s [vector] ifoldl': OK
  9784. 591.40 s [vector] +++ OK, passed 100 tests.
  9785. 591.40 s [vector] ifoldr: OK
  9786. 591.40 s [vector] +++ OK, passed 100 tests.
  9787. 591.40 s [vector] ifoldr': OK
  9788. 591.40 s [vector] +++ OK, passed 100 tests.
  9789. 591.40 s [vector] ifoldM: OK
  9790. 591.40 s [vector] +++ OK, passed 100 tests.
  9791. 591.40 s [vector] ifoldM': OK
  9792. 591.41 s [vector] +++ OK, passed 100 tests.
  9793. 591.41 s [vector] ifoldM_: OK
  9794. 591.41 s [vector] +++ OK, passed 100 tests.
  9795. 591.41 s [vector] ifoldM'_: OK
  9796. 591.41 s [vector] +++ OK, passed 100 tests.
  9797. 591.41 s [vector] all: OK
  9798. 591.41 s [vector] +++ OK, passed 100 tests.
  9799. 591.41 s [vector] any: OK
  9800. 591.41 s [vector] +++ OK, passed 100 tests.
  9801. 591.41 s [vector] prescanl: OK
  9802. 591.41 s [vector] +++ OK, passed 100 tests.
  9803. 591.42 s [vector] prescanl': OK
  9804. 591.42 s [vector] +++ OK, passed 100 tests.
  9805. 591.42 s [vector] postscanl: OK
  9806. 591.42 s [vector] +++ OK, passed 100 tests.
  9807. 591.42 s [vector] postscanl': OK
  9808. 591.42 s [vector] +++ OK, passed 100 tests.
  9809. 591.42 s [vector] scanl: OK
  9810. 591.42 s [vector] +++ OK, passed 100 tests.
  9811. 591.42 s [vector] scanl': OK
  9812. 591.42 s [vector] +++ OK, passed 100 tests.
  9813. 591.42 s [vector] scanl1: OK
  9814. 591.42 s [vector] +++ OK, passed 100 tests.
  9815. 591.42 s [vector] scanl1': OK
  9816. 591.42 s [vector] +++ OK, passed 100 tests.
  9817. 591.42 s [vector] iscanl: OK
  9818. 591.42 s [vector] +++ OK, passed 100 tests.
  9819. 591.43 s [vector] iscanl': OK
  9820. 591.43 s [vector] +++ OK, passed 100 tests.
  9821. 591.43 s [vector] prescanr: OK
  9822. 591.43 s [vector] +++ OK, passed 100 tests.
  9823. 591.43 s [vector] prescanr': OK
  9824. 591.43 s [vector] +++ OK, passed 100 tests.
  9825. 591.43 s [vector] postscanr: OK
  9826. 591.43 s [vector] +++ OK, passed 100 tests.
  9827. 591.43 s [vector] postscanr': OK
  9828. 591.43 s [vector] +++ OK, passed 100 tests.
  9829. 591.43 s [vector] scanr: OK
  9830. 591.43 s [vector] +++ OK, passed 100 tests.
  9831. 591.43 s [vector] scanr': OK
  9832. 591.43 s [vector] +++ OK, passed 100 tests.
  9833. 591.43 s [vector] scanr1: OK
  9834. 591.43 s [vector] +++ OK, passed 100 tests.
  9835. 591.43 s [vector] scanr1': OK
  9836. 591.43 s [vector] +++ OK, passed 100 tests.
  9837. 591.43 s [vector] iscanr: OK
  9838. 591.43 s [vector] +++ OK, passed 100 tests.
  9839. 591.43 s [vector] iscanr': OK
  9840. 591.43 s [vector] +++ OK, passed 100 tests.
  9841. 591.43 s [vector] mut_read: OK
  9842. 591.43 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9843. 591.43 s [vector] mut_write: OK
  9844. 591.43 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9845. 591.43 s [vector] mut_modify: OK
  9846. 591.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9847. 591.43 s [vector] mut_generate: OK
  9848. 591.44 s [vector] +++ OK, passed 100 tests.
  9849. 591.45 s [vector] mut_generateM: OK
  9850. 591.45 s [vector] +++ OK, passed 100 tests.
  9851. 591.46 s [vector] mut_mapM_: OK
  9852. 591.46 s [vector] +++ OK, passed 100 tests.
  9853. 591.47 s [vector] mut_imapM_: OK
  9854. 591.47 s [vector] +++ OK, passed 100 tests.
  9855. 591.48 s [vector] mut_forM_: OK
  9856. 591.48 s [vector] +++ OK, passed 100 tests.
  9857. 591.48 s [vector] mut_iforM_: OK (0.01s)
  9858. 591.48 s [vector] +++ OK, passed 100 tests.
  9859. 591.48 s [vector] mut_foldr: OK
  9860. 591.48 s [vector] +++ OK, passed 100 tests.
  9861. 591.48 s [vector] mut_foldr': OK
  9862. 591.48 s [vector] +++ OK, passed 100 tests.
  9863. 591.48 s [vector] mut_foldl: OK
  9864. 591.48 s [vector] +++ OK, passed 100 tests.
  9865. 591.48 s [vector] mut_foldl': OK
  9866. 591.48 s [vector] +++ OK, passed 100 tests.
  9867. 591.48 s [vector] mut_ifoldr: OK
  9868. 591.48 s [vector] +++ OK, passed 100 tests.
  9869. 591.48 s [vector] mut_ifoldr': OK
  9870. 591.48 s [vector] +++ OK, passed 100 tests.
  9871. 591.48 s [vector] mut_ifoldl: OK
  9872. 591.48 s [vector] +++ OK, passed 100 tests.
  9873. 591.48 s [vector] mut_ifoldl': OK
  9874. 591.48 s [vector] +++ OK, passed 100 tests.
  9875. 591.48 s [vector] mut_foldM: OK
  9876. 591.48 s [vector] +++ OK, passed 100 tests.
  9877. 591.48 s [vector] mut_foldM': OK
  9878. 591.48 s [vector] +++ OK, passed 100 tests.
  9879. 591.48 s [vector] mut_foldrM: OK
  9880. 591.48 s [vector] +++ OK, passed 100 tests.
  9881. 591.48 s [vector] mut_foldrM': OK
  9882. 591.48 s [vector] +++ OK, passed 100 tests.
  9883. 591.48 s [vector] mut_ifoldM: OK
  9884. 591.48 s [vector] +++ OK, passed 100 tests.
  9885. 591.49 s [vector] mut_ifoldM': OK
  9886. 591.49 s [vector] +++ OK, passed 100 tests.
  9887. 591.49 s [vector] mut_ifoldrM: OK
  9888. 591.49 s [vector] +++ OK, passed 100 tests.
  9889. 591.49 s [vector] mut_ifoldrM': OK
  9890. 591.49 s [vector] +++ OK, passed 100 tests.
  9891. 591.49 s [vector] compare: OK
  9892. 591.49 s [vector] +++ OK, passed 100 tests.
  9893. 591.49 s [vector] maximum: OK
  9894. 591.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9895. 591.49 s [vector] minimum: OK
  9896. 591.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9897. 591.49 s [vector] minIndex: OK
  9898. 591.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9899. 591.49 s [vector] maxIndex: OK
  9900. 591.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9901. 591.49 s [vector] maximumBy: OK
  9902. 591.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9903. 591.49 s [vector] minimumBy: OK
  9904. 591.49 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9905. 591.49 s [vector] maximumOn: OK
  9906. 591.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9907. 591.49 s [vector] minimumOn: OK
  9908. 591.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9909. 591.49 s [vector] maxIndexBy: OK
  9910. 591.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9911. 591.49 s [vector] minIndexBy: OK
  9912. 591.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9913. 591.49 s [vector] ListFirstMaxIndexWins: OK
  9914. 591.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9915. 591.49 s [vector] FalseListFirstMaxIndexWins: OK
  9916. 591.49 s [vector] +++ OK, failed as expected. (after 1 test):
  9917. 591.49 s [vector] Exception:
  9918. 591.49 s [vector] Prelude.foldr1: empty list
  9919. 591.49 s [vector] CallStack (from HasCallStack):
  9920. 591.49 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  9921. 591.49 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  9922. 591.49 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9923. 591.49 s [vector] []
  9924. 591.49 s [vector] zip: OK
  9925. 591.49 s [vector] +++ OK, passed 100 tests.
  9926. 591.49 s [vector] zip3: OK
  9927. 591.49 s [vector] +++ OK, passed 100 tests.
  9928. 591.49 s [vector] unzip: OK
  9929. 591.49 s [vector] +++ OK, passed 100 tests.
  9930. 591.49 s [vector] unzip3: OK
  9931. 591.49 s [vector] +++ OK, passed 100 tests.
  9932. 591.49 s [vector] indexed: OK
  9933. 591.49 s [vector] +++ OK, passed 100 tests.
  9934. 591.50 s [vector] update: OK
  9935. 591.50 s [vector] +++ OK, passed 100 tests.
  9936. 591.50 s [vector] mempty: OK
  9937. 591.50 s [vector] +++ OK, passed 100 tests.
  9938. 591.50 s [vector] mappend: OK
  9939. 591.50 s [vector] +++ OK, passed 100 tests.
  9940. 591.50 s [vector] mconcat: OK
  9941. 591.50 s [vector] +++ OK, passed 100 tests.
  9942. 591.50 s [vector] glength: OK
  9943. 591.50 s [vector] +++ OK, passed 100 tests.
  9944. 591.50 s [vector] (Bool)
  9945. 591.50 s [vector] fromList.toList == id: OK
  9946. 591.50 s [vector] +++ OK, passed 100 tests.
  9947. 591.50 s [vector] toList.fromList == id: OK
  9948. 591.50 s [vector] +++ OK, passed 100 tests.
  9949. 591.50 s [vector] unstream.stream == id: OK
  9950. 591.50 s [vector] +++ OK, passed 100 tests.
  9951. 591.50 s [vector] stream.unstream == id: OK
  9952. 591.50 s [vector] +++ OK, passed 100 tests.
  9953. 591.50 s [vector] eq: OK
  9954. 591.50 s [vector] +++ OK, passed 100 tests.
  9955. 591.50 s [vector] length: OK
  9956. 591.50 s [vector] +++ OK, passed 100 tests.
  9957. 591.50 s [vector] null: OK
  9958. 591.50 s [vector] +++ OK, passed 100 tests.
  9959. 591.50 s [vector] index: OK
  9960. 591.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9961. 591.50 s [vector] safeIndex: OK
  9962. 591.50 s [vector] +++ OK, passed 100 tests.
  9963. 591.51 s [vector] head: OK
  9964. 591.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9965. 591.51 s [vector] last: OK
  9966. 591.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9967. 591.51 s [vector] unsafeIndex: OK
  9968. 591.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9969. 591.51 s [vector] unsafeHead: OK
  9970. 591.51 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9971. 591.51 s [vector] unsafeLast: OK
  9972. 591.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9973. 591.51 s [vector] slice: OK
  9974. 591.51 s [vector] +++ OK, passed 100 tests.
  9975. 591.51 s [vector] init: OK
  9976. 591.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9977. 591.51 s [vector] tail: OK
  9978. 591.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9979. 591.51 s [vector] take: OK
  9980. 591.51 s [vector] +++ OK, passed 100 tests.
  9981. 591.51 s [vector] drop: OK
  9982. 591.51 s [vector] +++ OK, passed 100 tests.
  9983. 591.51 s [vector] splitAt: OK
  9984. 591.51 s [vector] +++ OK, passed 100 tests.
  9985. 591.51 s [vector] empty: OK
  9986. 591.51 s [vector] +++ OK, passed 100 tests.
  9987. 591.51 s [vector] singleton: OK
  9988. 591.51 s [vector] +++ OK, passed 100 tests.
  9989. 591.51 s [vector] replicate: OK
  9990. 591.51 s [vector] +++ OK, passed 100 tests.
  9991. 591.51 s [vector] generate: OK
  9992. 591.51 s [vector] +++ OK, passed 100 tests.
  9993. 591.52 s [vector] iterateN: OK
  9994. 591.52 s [vector] +++ OK, passed 100 tests.
  9995. 591.55 s [vector] iterateNM: OK (0.03s)
  9996. 591.55 s [vector] +++ OK, passed 100 tests.
  9997. 591.56 s [vector] generateM: OK (0.01s)
  9998. 591.56 s [vector] +++ OK, passed 100 tests.
  9999. 591.56 s [vector] replicateM: OK
  10000. 591.56 s [vector] +++ OK, passed 100 tests.
  10001. 591.56 s [vector] create: OK
  10002. 591.56 s [vector] +++ OK, passed 100 tests.
  10003. 591.56 s [vector] createT: OK
  10004. 591.56 s [vector] +++ OK, passed 100 tests.
  10005. 591.56 s [vector] unfoldr: OK
  10006. 591.56 s [vector] +++ OK, passed 100 tests.
  10007. 591.56 s [vector] unfoldrN: OK
  10008. 591.56 s [vector] +++ OK, passed 100 tests.
  10009. 591.57 s [vector] unfoldrExactN: OK
  10010. 591.57 s [vector] +++ OK, passed 100 tests.
  10011. 591.57 s [vector] unfoldrM: OK
  10012. 591.57 s [vector] +++ OK, passed 100 tests.
  10013. 591.58 s [vector] unfoldrNM: OK
  10014. 591.58 s [vector] +++ OK, passed 100 tests.
  10015. 591.60 s [vector] unfoldrExactNM: OK (0.03s)
  10016. 591.60 s [vector] +++ OK, passed 100 tests.
  10017. 591.60 s [vector] constructN: OK
  10018. 591.60 s [vector] +++ OK, passed 100 tests.
  10019. 591.60 s [vector] constructrN: OK
  10020. 591.60 s [vector] +++ OK, passed 100 tests.
  10021. 591.61 s [vector] cons: OK
  10022. 591.61 s [vector] +++ OK, passed 100 tests.
  10023. 591.61 s [vector] snoc: OK
  10024. 591.61 s [vector] +++ OK, passed 100 tests.
  10025. 591.62 s [vector] append: OK
  10026. 591.62 s [vector] +++ OK, passed 100 tests.
  10027. 591.62 s [vector] concat: OK (0.01s)
  10028. 591.62 s [vector] +++ OK, passed 100 tests.
  10029. 591.62 s [vector] force: OK
  10030. 591.62 s [vector] +++ OK, passed 100 tests.
  10031. 591.62 s [vector] upd: OK
  10032. 591.62 s [vector] +++ OK, passed 100 tests.
  10033. 591.62 s [vector] accum: OK
  10034. 591.63 s [vector] +++ OK, passed 100 tests.
  10035. 591.63 s [vector] reverse: OK
  10036. 591.63 s [vector] +++ OK, passed 100 tests.
  10037. 591.63 s [vector] backpermute: OK
  10038. 591.63 s [vector] +++ OK, passed 100 tests.
  10039. 591.63 s [vector] map: OK
  10040. 591.63 s [vector] +++ OK, passed 100 tests.
  10041. 591.63 s [vector] imap: OK
  10042. 591.63 s [vector] +++ OK, passed 100 tests.
  10043. 591.63 s [vector] concatMap: OK
  10044. 591.63 s [vector] +++ OK, passed 100 tests.
  10045. 591.64 s [vector] mapM: OK
  10046. 591.64 s [vector] +++ OK, passed 100 tests.
  10047. 591.64 s [vector] mapM_: OK (0.01s)
  10048. 591.64 s [vector] +++ OK, passed 100 tests.
  10049. 591.65 s [vector] forM: OK
  10050. 591.65 s [vector] +++ OK, passed 100 tests.
  10051. 591.66 s [vector] forM_: OK
  10052. 591.66 s [vector] +++ OK, passed 100 tests.
  10053. 591.66 s [vector] imapM: OK
  10054. 591.66 s [vector] +++ OK, passed 100 tests.
  10055. 591.66 s [vector] imapM_: OK
  10056. 591.67 s [vector] +++ OK, passed 100 tests.
  10057. 591.67 s [vector] zipWith: OK
  10058. 591.67 s [vector] +++ OK, passed 100 tests.
  10059. 591.67 s [vector] zipWith3: OK
  10060. 591.67 s [vector] +++ OK, passed 100 tests.
  10061. 591.67 s [vector] izipWith: OK
  10062. 591.67 s [vector] +++ OK, passed 100 tests.
  10063. 591.67 s [vector] izipWith3: OK
  10064. 591.67 s [vector] +++ OK, passed 100 tests.
  10065. 591.67 s [vector] izipWithM: OK
  10066. 591.67 s [vector] +++ OK, passed 100 tests.
  10067. 591.68 s [vector] izipWithM_: OK
  10068. 591.68 s [vector] +++ OK, passed 100 tests.
  10069. 591.68 s [vector] zipWithM: OK
  10070. 591.69 s [vector] +++ OK, passed 100 tests.
  10071. 591.69 s [vector] zipWithM_: OK
  10072. 591.69 s [vector] +++ OK, passed 100 tests.
  10073. 591.69 s [vector] filter: OK
  10074. 591.69 s [vector] +++ OK, passed 100 tests.
  10075. 591.69 s [vector] ifilter: OK
  10076. 591.69 s [vector] +++ OK, passed 100 tests.
  10077. 591.70 s [vector] filterM: OK
  10078. 591.70 s [vector] +++ OK, passed 100 tests.
  10079. 591.71 s [vector] uniq: OK
  10080. 591.71 s [vector] +++ OK, passed 100 tests.
  10081. 591.71 s [vector] mapMaybe: OK
  10082. 591.71 s [vector] +++ OK, passed 100 tests.
  10083. 591.71 s [vector] imapMaybe: OK
  10084. 591.71 s [vector] +++ OK, passed 100 tests.
  10085. 591.71 s [vector] takeWhile: OK
  10086. 591.71 s [vector] +++ OK, passed 100 tests.
  10087. 591.71 s [vector] dropWhile: OK
  10088. 591.71 s [vector] +++ OK, passed 100 tests.
  10089. 591.71 s [vector] partition: OK
  10090. 591.71 s [vector] +++ OK, passed 100 tests.
  10091. 591.71 s [vector] partitionWith: OK
  10092. 591.71 s [vector] +++ OK, passed 100 tests.
  10093. 591.71 s [vector] span: OK
  10094. 591.71 s [vector] +++ OK, passed 100 tests.
  10095. 591.72 s [vector] break: OK
  10096. 591.72 s [vector] +++ OK, passed 100 tests.
  10097. 591.72 s [vector] spanR: OK
  10098. 591.72 s [vector] +++ OK, passed 100 tests.
  10099. 591.72 s [vector] breakR: OK
  10100. 591.72 s [vector] +++ OK, passed 100 tests.
  10101. 591.72 s [vector] groupBy: OK
  10102. 591.72 s [vector] +++ OK, passed 100 tests.
  10103. 591.72 s [vector] elem: OK
  10104. 591.72 s [vector] +++ OK, passed 100 tests.
  10105. 591.72 s [vector] notElem: OK
  10106. 591.72 s [vector] +++ OK, passed 100 tests.
  10107. 591.72 s [vector] find: OK
  10108. 591.72 s [vector] +++ OK, passed 100 tests.
  10109. 591.72 s [vector] findIndex: OK
  10110. 591.72 s [vector] +++ OK, passed 100 tests.
  10111. 591.72 s [vector] findIndexR: OK
  10112. 591.72 s [vector] +++ OK, passed 100 tests.
  10113. 591.72 s [vector] findIndices: OK
  10114. 591.72 s [vector] +++ OK, passed 100 tests.
  10115. 591.72 s [vector] elemIndex: OK
  10116. 591.72 s [vector] +++ OK, passed 100 tests.
  10117. 591.72 s [vector] elemIndices: OK
  10118. 591.72 s [vector] +++ OK, passed 100 tests.
  10119. 591.72 s [vector] foldl: OK
  10120. 591.72 s [vector] +++ OK, passed 100 tests.
  10121. 591.72 s [vector] foldl1: OK
  10122. 591.72 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10123. 591.73 s [vector] foldl': OK
  10124. 591.73 s [vector] +++ OK, passed 100 tests.
  10125. 591.73 s [vector] foldl1': OK
  10126. 591.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10127. 591.73 s [vector] foldr: OK
  10128. 591.73 s [vector] +++ OK, passed 100 tests.
  10129. 591.73 s [vector] foldr1: OK
  10130. 591.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10131. 591.73 s [vector] foldr': OK
  10132. 591.73 s [vector] +++ OK, passed 100 tests.
  10133. 591.73 s [vector] foldr1': OK
  10134. 591.73 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10135. 591.73 s [vector] ifoldl: OK
  10136. 591.73 s [vector] +++ OK, passed 100 tests.
  10137. 591.73 s [vector] ifoldl': OK
  10138. 591.73 s [vector] +++ OK, passed 100 tests.
  10139. 591.73 s [vector] ifoldr: OK
  10140. 591.73 s [vector] +++ OK, passed 100 tests.
  10141. 591.73 s [vector] ifoldr': OK
  10142. 591.73 s [vector] +++ OK, passed 100 tests.
  10143. 591.74 s [vector] ifoldM: OK
  10144. 591.74 s [vector] +++ OK, passed 100 tests.
  10145. 591.74 s [vector] ifoldM': OK
  10146. 591.74 s [vector] +++ OK, passed 100 tests.
  10147. 591.75 s [vector] ifoldM_: OK
  10148. 591.76 s [vector] +++ OK, passed 100 tests.
  10149. 591.76 s [vector] ifoldM'_: OK (0.01s)
  10150. 591.76 s [vector] +++ OK, passed 100 tests.
  10151. 591.76 s [vector] all: OK
  10152. 591.76 s [vector] +++ OK, passed 100 tests.
  10153. 591.76 s [vector] any: OK
  10154. 591.76 s [vector] +++ OK, passed 100 tests.
  10155. 591.76 s [vector] prescanl: OK
  10156. 591.76 s [vector] +++ OK, passed 100 tests.
  10157. 591.76 s [vector] prescanl': OK
  10158. 591.76 s [vector] +++ OK, passed 100 tests.
  10159. 591.76 s [vector] postscanl: OK
  10160. 591.76 s [vector] +++ OK, passed 100 tests.
  10161. 591.77 s [vector] postscanl': OK
  10162. 591.77 s [vector] +++ OK, passed 100 tests.
  10163. 591.77 s [vector] scanl: OK
  10164. 591.77 s [vector] +++ OK, passed 100 tests.
  10165. 591.77 s [vector] scanl': OK
  10166. 591.77 s [vector] +++ OK, passed 100 tests.
  10167. 591.77 s [vector] scanl1: OK
  10168. 591.77 s [vector] +++ OK, passed 100 tests.
  10169. 591.77 s [vector] scanl1': OK
  10170. 591.77 s [vector] +++ OK, passed 100 tests.
  10171. 591.77 s [vector] iscanl: OK
  10172. 591.78 s [vector] +++ OK, passed 100 tests.
  10173. 591.78 s [vector] iscanl': OK
  10174. 591.78 s [vector] +++ OK, passed 100 tests.
  10175. 591.78 s [vector] prescanr: OK
  10176. 591.78 s [vector] +++ OK, passed 100 tests.
  10177. 591.78 s [vector] prescanr': OK
  10178. 591.78 s [vector] +++ OK, passed 100 tests.
  10179. 591.78 s [vector] postscanr: OK
  10180. 591.78 s [vector] +++ OK, passed 100 tests.
  10181. 591.78 s [vector] postscanr': OK
  10182. 591.78 s [vector] +++ OK, passed 100 tests.
  10183. 591.78 s [vector] scanr: OK
  10184. 591.78 s [vector] +++ OK, passed 100 tests.
  10185. 591.78 s [vector] scanr': OK
  10186. 591.78 s [vector] +++ OK, passed 100 tests.
  10187. 591.79 s [vector] scanr1: OK
  10188. 591.79 s [vector] +++ OK, passed 100 tests.
  10189. 591.79 s [vector] scanr1': OK
  10190. 591.79 s [vector] +++ OK, passed 100 tests.
  10191. 591.79 s [vector] iscanr: OK
  10192. 591.79 s [vector] +++ OK, passed 100 tests.
  10193. 591.79 s [vector] iscanr': OK
  10194. 591.79 s [vector] +++ OK, passed 100 tests.
  10195. 591.79 s [vector] mut_read: OK
  10196. 591.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10197. 591.79 s [vector] mut_write: OK
  10198. 591.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10199. 591.79 s [vector] mut_modify: OK
  10200. 591.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10201. 591.79 s [vector] mut_generate: OK
  10202. 591.79 s [vector] +++ OK, passed 100 tests.
  10203. 591.81 s [vector] mut_generateM: OK
  10204. 591.81 s [vector] +++ OK, passed 100 tests.
  10205. 591.81 s [vector] mut_mapM_: OK
  10206. 591.81 s [vector] +++ OK, passed 100 tests.
  10207. 591.82 s [vector] mut_imapM_: OK
  10208. 591.82 s [vector] +++ OK, passed 100 tests.
  10209. 591.83 s [vector] mut_forM_: OK
  10210. 591.83 s [vector] +++ OK, passed 100 tests.
  10211. 591.83 s [vector] mut_iforM_: OK
  10212. 591.83 s [vector] +++ OK, passed 100 tests.
  10213. 591.84 s [vector] mut_foldr: OK
  10214. 591.84 s [vector] +++ OK, passed 100 tests.
  10215. 591.84 s [vector] mut_foldr': OK
  10216. 591.84 s [vector] +++ OK, passed 100 tests.
  10217. 591.84 s [vector] mut_foldl: OK
  10218. 591.84 s [vector] +++ OK, passed 100 tests.
  10219. 591.84 s [vector] mut_foldl': OK
  10220. 591.84 s [vector] +++ OK, passed 100 tests.
  10221. 591.84 s [vector] mut_ifoldr: OK
  10222. 591.84 s [vector] +++ OK, passed 100 tests.
  10223. 591.84 s [vector] mut_ifoldr': OK
  10224. 591.84 s [vector] +++ OK, passed 100 tests.
  10225. 591.84 s [vector] mut_ifoldl: OK
  10226. 591.84 s [vector] +++ OK, passed 100 tests.
  10227. 591.84 s [vector] mut_ifoldl': OK
  10228. 591.84 s [vector] +++ OK, passed 100 tests.
  10229. 591.85 s [vector] mut_foldM: OK
  10230. 591.85 s [vector] +++ OK, passed 100 tests.
  10231. 591.85 s [vector] mut_foldM': OK
  10232. 591.85 s [vector] +++ OK, passed 100 tests.
  10233. 591.85 s [vector] mut_foldrM: OK
  10234. 591.85 s [vector] +++ OK, passed 100 tests.
  10235. 591.85 s [vector] mut_foldrM': OK
  10236. 591.85 s [vector] +++ OK, passed 100 tests.
  10237. 591.85 s [vector] mut_ifoldM: OK
  10238. 591.85 s [vector] +++ OK, passed 100 tests.
  10239. 591.85 s [vector] mut_ifoldM': OK
  10240. 591.85 s [vector] +++ OK, passed 100 tests.
  10241. 591.85 s [vector] mut_ifoldrM: OK
  10242. 591.85 s [vector] +++ OK, passed 100 tests.
  10243. 591.86 s [vector] mut_ifoldrM': OK
  10244. 591.86 s [vector] +++ OK, passed 100 tests.
  10245. 591.86 s [vector] compare: OK
  10246. 591.86 s [vector] +++ OK, passed 100 tests.
  10247. 591.86 s [vector] maximum: OK
  10248. 591.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10249. 591.86 s [vector] minimum: OK
  10250. 591.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10251. 591.86 s [vector] minIndex: OK
  10252. 591.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10253. 591.86 s [vector] maxIndex: OK
  10254. 591.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10255. 591.86 s [vector] maximumBy: OK
  10256. 591.86 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10257. 591.86 s [vector] minimumBy: OK
  10258. 591.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10259. 591.86 s [vector] maximumOn: OK
  10260. 591.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10261. 591.86 s [vector] minimumOn: OK
  10262. 591.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10263. 591.86 s [vector] maxIndexBy: OK
  10264. 591.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10265. 591.86 s [vector] minIndexBy: OK
  10266. 591.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10267. 591.86 s [vector] ListFirstMaxIndexWins: OK
  10268. 591.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10269. 591.86 s [vector] FalseListFirstMaxIndexWins: OK
  10270. 591.86 s [vector] +++ OK, failed as expected. (after 1 test):
  10271. 591.86 s [vector] Exception:
  10272. 591.86 s [vector] Prelude.foldr1: empty list
  10273. 591.86 s [vector] CallStack (from HasCallStack):
  10274. 591.86 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  10275. 591.86 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  10276. 591.86 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10277. 591.86 s [vector] []
  10278. 591.86 s [vector] zip: OK
  10279. 591.86 s [vector] +++ OK, passed 100 tests.
  10280. 591.86 s [vector] zip3: OK
  10281. 591.86 s [vector] +++ OK, passed 100 tests.
  10282. 591.86 s [vector] unzip: OK
  10283. 591.86 s [vector] +++ OK, passed 100 tests.
  10284. 591.86 s [vector] unzip3: OK
  10285. 591.86 s [vector] +++ OK, passed 100 tests.
  10286. 591.86 s [vector] indexed: OK
  10287. 591.86 s [vector] +++ OK, passed 100 tests.
  10288. 591.86 s [vector] update: OK
  10289. 591.86 s [vector] +++ OK, passed 100 tests.
  10290. 591.87 s [vector] mempty: OK
  10291. 591.87 s [vector] +++ OK, passed 100 tests.
  10292. 591.87 s [vector] mappend: OK
  10293. 591.87 s [vector] +++ OK, passed 100 tests.
  10294. 591.87 s [vector] mconcat: OK
  10295. 591.87 s [vector] +++ OK, passed 100 tests.
  10296. 591.88 s [vector] glength: OK
  10297. 591.88 s [vector] +++ OK, passed 100 tests.
  10298. 591.88 s [vector] and: OK
  10299. 591.88 s [vector] +++ OK, passed 100 tests.
  10300. 591.88 s [vector] or: OK
  10301. 591.88 s [vector] +++ OK, passed 100 tests.
  10302. 591.88 s [vector] (Int)
  10303. 591.88 s [vector] fromList.toList == id: OK
  10304. 591.88 s [vector] +++ OK, passed 100 tests.
  10305. 591.88 s [vector] toList.fromList == id: OK
  10306. 591.88 s [vector] +++ OK, passed 100 tests.
  10307. 591.88 s [vector] unstream.stream == id: OK
  10308. 591.88 s [vector] +++ OK, passed 100 tests.
  10309. 591.88 s [vector] stream.unstream == id: OK
  10310. 591.88 s [vector] +++ OK, passed 100 tests.
  10311. 591.88 s [vector] eq: OK
  10312. 591.88 s [vector] +++ OK, passed 100 tests.
  10313. 591.88 s [vector] length: OK
  10314. 591.88 s [vector] +++ OK, passed 100 tests.
  10315. 591.88 s [vector] null: OK
  10316. 591.88 s [vector] +++ OK, passed 100 tests.
  10317. 591.88 s [vector] index: OK
  10318. 591.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10319. 591.88 s [vector] safeIndex: OK
  10320. 591.88 s [vector] +++ OK, passed 100 tests.
  10321. 591.88 s [vector] head: OK
  10322. 591.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10323. 591.88 s [vector] last: OK
  10324. 591.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10325. 591.88 s [vector] unsafeIndex: OK
  10326. 591.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10327. 591.88 s [vector] unsafeHead: OK
  10328. 591.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10329. 591.88 s [vector] unsafeLast: OK
  10330. 591.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10331. 591.88 s [vector] slice: OK
  10332. 591.88 s [vector] +++ OK, passed 100 tests.
  10333. 591.88 s [vector] init: OK
  10334. 591.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10335. 591.88 s [vector] tail: OK
  10336. 591.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10337. 591.88 s [vector] take: OK
  10338. 591.88 s [vector] +++ OK, passed 100 tests.
  10339. 591.88 s [vector] drop: OK
  10340. 591.88 s [vector] +++ OK, passed 100 tests.
  10341. 591.89 s [vector] splitAt: OK
  10342. 591.89 s [vector] +++ OK, passed 100 tests.
  10343. 591.89 s [vector] empty: OK
  10344. 591.89 s [vector] +++ OK, passed 100 tests.
  10345. 591.89 s [vector] singleton: OK
  10346. 591.89 s [vector] +++ OK, passed 100 tests.
  10347. 591.89 s [vector] replicate: OK
  10348. 591.89 s [vector] +++ OK, passed 100 tests.
  10349. 591.89 s [vector] generate: OK
  10350. 591.90 s [vector] +++ OK, passed 100 tests.
  10351. 591.90 s [vector] iterateN: OK
  10352. 591.90 s [vector] +++ OK, passed 100 tests.
  10353. 591.92 s [vector] iterateNM: OK (0.02s)
  10354. 591.92 s [vector] +++ OK, passed 100 tests.
  10355. 591.94 s [vector] generateM: OK (0.02s)
  10356. 591.94 s [vector] +++ OK, passed 100 tests.
  10357. 591.94 s [vector] replicateM: OK (0.01s)
  10358. 591.94 s [vector] +++ OK, passed 100 tests.
  10359. 591.94 s [vector] create: OK
  10360. 591.94 s [vector] +++ OK, passed 100 tests.
  10361. 591.94 s [vector] createT: OK
  10362. 591.94 s [vector] +++ OK, passed 100 tests.
  10363. 591.94 s [vector] unfoldr: OK
  10364. 591.94 s [vector] +++ OK, passed 100 tests.
  10365. 591.94 s [vector] unfoldrN: OK
  10366. 591.94 s [vector] +++ OK, passed 100 tests.
  10367. 591.94 s [vector] unfoldrExactN: OK
  10368. 591.94 s [vector] +++ OK, passed 100 tests.
  10369. 591.94 s [vector] unfoldrM: OK
  10370. 591.94 s [vector] +++ OK, passed 100 tests.
  10371. 591.95 s [vector] unfoldrNM: OK
  10372. 591.96 s [vector] +++ OK, passed 100 tests.
  10373. 591.97 s [vector] unfoldrExactNM: OK (0.02s)
  10374. 591.97 s [vector] +++ OK, passed 100 tests.
  10375. 591.97 s [vector] constructN: OK
  10376. 591.97 s [vector] +++ OK, passed 100 tests.
  10377. 591.98 s [vector] constructrN: OK
  10378. 591.98 s [vector] +++ OK, passed 100 tests.
  10379. 591.98 s [vector] cons: OK
  10380. 591.98 s [vector] +++ OK, passed 100 tests.
  10381. 591.98 s [vector] snoc: OK
  10382. 591.98 s [vector] +++ OK, passed 100 tests.
  10383. 591.98 s [vector] append: OK
  10384. 591.98 s [vector] +++ OK, passed 100 tests.
  10385. 591.99 s [vector] concat: OK (0.01s)
  10386. 591.99 s [vector] +++ OK, passed 100 tests.
  10387. 591.99 s [vector] force: OK
  10388. 591.99 s [vector] +++ OK, passed 100 tests.
  10389. 591.99 s [vector] upd: OK
  10390. 591.99 s [vector] +++ OK, passed 100 tests.
  10391. 591.99 s [vector] accum: OK
  10392. 591.99 s [vector] +++ OK, passed 100 tests.
  10393. 591.99 s [vector] reverse: OK
  10394. 591.99 s [vector] +++ OK, passed 100 tests.
  10395. 592.00 s [vector] backpermute: OK
  10396. 592.00 s [vector] +++ OK, passed 100 tests.
  10397. 592.00 s [vector] map: OK
  10398. 592.00 s [vector] +++ OK, passed 100 tests.
  10399. 592.00 s [vector] imap: OK
  10400. 592.00 s [vector] +++ OK, passed 100 tests.
  10401. 592.00 s [vector] concatMap: OK
  10402. 592.00 s [vector] +++ OK, passed 100 tests.
  10403. 592.02 s [vector] mapM: OK
  10404. 592.02 s [vector] +++ OK, passed 100 tests.
  10405. 592.03 s [vector] mapM_: OK (0.01s)
  10406. 592.03 s [vector] +++ OK, passed 100 tests.
  10407. 592.04 s [vector] forM: OK
  10408. 592.04 s [vector] +++ OK, passed 100 tests.
  10409. 592.04 s [vector] forM_: OK (0.01s)
  10410. 592.04 s [vector] +++ OK, passed 100 tests.
  10411. 592.04 s [vector] imapM: OK
  10412. 592.04 s [vector] +++ OK, passed 100 tests.
  10413. 592.05 s [vector] imapM_: OK (0.02s)
  10414. 592.05 s [vector] +++ OK, passed 100 tests.
  10415. 592.05 s [vector] zipWith: OK
  10416. 592.05 s [vector] +++ OK, passed 100 tests.
  10417. 592.06 s [vector] zipWith3: OK
  10418. 592.06 s [vector] +++ OK, passed 100 tests.
  10419. 592.06 s [vector] izipWith: OK
  10420. 592.06 s [vector] +++ OK, passed 100 tests.
  10421. 592.07 s [vector] izipWith3: OK
  10422. 592.07 s [vector] +++ OK, passed 100 tests.
  10423. 592.07 s [vector] izipWithM: OK
  10424. 592.07 s [vector] +++ OK, passed 100 tests.
  10425. 592.07 s [vector] izipWithM_: OK (0.01s)
  10426. 592.07 s [vector] +++ OK, passed 100 tests.
  10427. 592.08 s [vector] zipWithM: OK
  10428. 592.08 s [vector] +++ OK, passed 100 tests.
  10429. 592.09 s [vector] zipWithM_: OK (0.01s)
  10430. 592.09 s [vector] +++ OK, passed 100 tests.
  10431. 592.09 s [vector] filter: OK
  10432. 592.09 s [vector] +++ OK, passed 100 tests.
  10433. 592.09 s [vector] ifilter: OK
  10434. 592.09 s [vector] +++ OK, passed 100 tests.
  10435. 592.11 s [vector] filterM: OK (0.01s)
  10436. 592.11 s [vector] +++ OK, passed 100 tests.
  10437. 592.11 s [vector] uniq: OK
  10438. 592.11 s [vector] +++ OK, passed 100 tests.
  10439. 592.11 s [vector] mapMaybe: OK
  10440. 592.11 s [vector] +++ OK, passed 100 tests.
  10441. 592.12 s [vector] imapMaybe: OK
  10442. 592.12 s [vector] +++ OK, passed 100 tests.
  10443. 592.12 s [vector] takeWhile: OK
  10444. 592.12 s [vector] +++ OK, passed 100 tests.
  10445. 592.12 s [vector] dropWhile: OK
  10446. 592.12 s [vector] +++ OK, passed 100 tests.
  10447. 592.12 s [vector] partition: OK
  10448. 592.12 s [vector] +++ OK, passed 100 tests.
  10449. 592.13 s [vector] partitionWith: OK
  10450. 592.13 s [vector] +++ OK, passed 100 tests.
  10451. 592.13 s [vector] span: OK
  10452. 592.13 s [vector] +++ OK, passed 100 tests.
  10453. 592.13 s [vector] break: OK
  10454. 592.13 s [vector] +++ OK, passed 100 tests.
  10455. 592.13 s [vector] spanR: OK
  10456. 592.13 s [vector] +++ OK, passed 100 tests.
  10457. 592.13 s [vector] breakR: OK
  10458. 592.13 s [vector] +++ OK, passed 100 tests.
  10459. 592.13 s [vector] groupBy: OK
  10460. 592.13 s [vector] +++ OK, passed 100 tests.
  10461. 592.13 s [vector] elem: OK
  10462. 592.13 s [vector] +++ OK, passed 100 tests.
  10463. 592.13 s [vector] notElem: OK
  10464. 592.13 s [vector] +++ OK, passed 100 tests.
  10465. 592.13 s [vector] find: OK
  10466. 592.13 s [vector] +++ OK, passed 100 tests.
  10467. 592.13 s [vector] findIndex: OK
  10468. 592.13 s [vector] +++ OK, passed 100 tests.
  10469. 592.13 s [vector] findIndexR: OK
  10470. 592.13 s [vector] +++ OK, passed 100 tests.
  10471. 592.13 s [vector] findIndices: OK
  10472. 592.13 s [vector] +++ OK, passed 100 tests.
  10473. 592.13 s [vector] elemIndex: OK
  10474. 592.13 s [vector] +++ OK, passed 100 tests.
  10475. 592.14 s [vector] elemIndices: OK
  10476. 592.14 s [vector] +++ OK, passed 100 tests.
  10477. 592.14 s [vector] foldl: OK
  10478. 592.14 s [vector] +++ OK, passed 100 tests.
  10479. 592.14 s [vector] foldl1: OK
  10480. 592.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10481. 592.14 s [vector] foldl': OK
  10482. 592.14 s [vector] +++ OK, passed 100 tests.
  10483. 592.14 s [vector] foldl1': OK
  10484. 592.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10485. 592.14 s [vector] foldr: OK
  10486. 592.15 s [vector] +++ OK, passed 100 tests.
  10487. 592.15 s [vector] foldr1: OK
  10488. 592.15 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10489. 592.15 s [vector] foldr': OK
  10490. 592.15 s [vector] +++ OK, passed 100 tests.
  10491. 592.15 s [vector] foldr1': OK
  10492. 592.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10493. 592.15 s [vector] ifoldl: OK
  10494. 592.15 s [vector] +++ OK, passed 100 tests.
  10495. 592.16 s [vector] ifoldl': OK
  10496. 592.16 s [vector] +++ OK, passed 100 tests.
  10497. 592.16 s [vector] ifoldr: OK
  10498. 592.16 s [vector] +++ OK, passed 100 tests.
  10499. 592.16 s [vector] ifoldr': OK
  10500. 592.16 s [vector] +++ OK, passed 100 tests.
  10501. 592.16 s [vector] ifoldM: OK
  10502. 592.16 s [vector] +++ OK, passed 100 tests.
  10503. 592.16 s [vector] ifoldM': OK
  10504. 592.16 s [vector] +++ OK, passed 100 tests.
  10505. 592.17 s [vector] ifoldM_: OK
  10506. 592.18 s [vector] +++ OK, passed 100 tests.
  10507. 592.19 s [vector] ifoldM'_: OK (0.01s)
  10508. 592.19 s [vector] +++ OK, passed 100 tests.
  10509. 592.19 s [vector] all: OK
  10510. 592.19 s [vector] +++ OK, passed 100 tests.
  10511. 592.19 s [vector] any: OK
  10512. 592.19 s [vector] +++ OK, passed 100 tests.
  10513. 592.19 s [vector] prescanl: OK
  10514. 592.19 s [vector] +++ OK, passed 100 tests.
  10515. 592.19 s [vector] prescanl': OK
  10516. 592.19 s [vector] +++ OK, passed 100 tests.
  10517. 592.20 s [vector] postscanl: OK
  10518. 592.20 s [vector] +++ OK, passed 100 tests.
  10519. 592.20 s [vector] postscanl': OK
  10520. 592.20 s [vector] +++ OK, passed 100 tests.
  10521. 592.21 s [vector] scanl: OK
  10522. 592.21 s [vector] +++ OK, passed 100 tests.
  10523. 592.21 s [vector] scanl': OK
  10524. 592.21 s [vector] +++ OK, passed 100 tests.
  10525. 592.21 s [vector] scanl1: OK
  10526. 592.21 s [vector] +++ OK, passed 100 tests.
  10527. 592.21 s [vector] scanl1': OK
  10528. 592.21 s [vector] +++ OK, passed 100 tests.
  10529. 592.21 s [vector] iscanl: OK
  10530. 592.21 s [vector] +++ OK, passed 100 tests.
  10531. 592.21 s [vector] iscanl': OK
  10532. 592.21 s [vector] +++ OK, passed 100 tests.
  10533. 592.22 s [vector] prescanr: OK
  10534. 592.22 s [vector] +++ OK, passed 100 tests.
  10535. 592.22 s [vector] prescanr': OK
  10536. 592.22 s [vector] +++ OK, passed 100 tests.
  10537. 592.22 s [vector] postscanr: OK
  10538. 592.22 s [vector] +++ OK, passed 100 tests.
  10539. 592.22 s [vector] postscanr': OK
  10540. 592.22 s [vector] +++ OK, passed 100 tests.
  10541. 592.23 s [vector] scanr: OK
  10542. 592.23 s [vector] +++ OK, passed 100 tests.
  10543. 592.23 s [vector] scanr': OK
  10544. 592.23 s [vector] +++ OK, passed 100 tests.
  10545. 592.23 s [vector] scanr1: OK
  10546. 592.23 s [vector] +++ OK, passed 100 tests.
  10547. 592.23 s [vector] scanr1': OK
  10548. 592.23 s [vector] +++ OK, passed 100 tests.
  10549. 592.23 s [vector] iscanr: OK
  10550. 592.23 s [vector] +++ OK, passed 100 tests.
  10551. 592.24 s [vector] iscanr': OK
  10552. 592.24 s [vector] +++ OK, passed 100 tests.
  10553. 592.24 s [vector] mut_read: OK
  10554. 592.24 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10555. 592.24 s [vector] mut_write: OK
  10556. 592.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10557. 592.24 s [vector] mut_modify: OK
  10558. 592.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10559. 592.25 s [vector] mut_generate: OK
  10560. 592.25 s [vector] +++ OK, passed 100 tests.
  10561. 592.25 s [vector] mut_generateM: OK
  10562. 592.26 s [vector] +++ OK, passed 100 tests.
  10563. 592.27 s [vector] mut_mapM_: OK (0.01s)
  10564. 592.28 s [vector] +++ OK, passed 100 tests.
  10565. 592.28 s [vector] mut_imapM_: OK (0.01s)
  10566. 592.28 s [vector] +++ OK, passed 100 tests.
  10567. 592.29 s [vector] mut_forM_: OK (0.02s)
  10568. 592.29 s [vector] +++ OK, passed 100 tests.
  10569. 592.30 s [vector] mut_iforM_: OK
  10570. 592.30 s [vector] +++ OK, passed 100 tests.
  10571. 592.31 s [vector] mut_foldr: OK
  10572. 592.31 s [vector] +++ OK, passed 100 tests.
  10573. 592.32 s [vector] mut_foldr': OK
  10574. 592.32 s [vector] +++ OK, passed 100 tests.
  10575. 592.32 s [vector] mut_foldl: OK
  10576. 592.32 s [vector] +++ OK, passed 100 tests.
  10577. 592.32 s [vector] mut_foldl': OK
  10578. 592.32 s [vector] +++ OK, passed 100 tests.
  10579. 592.32 s [vector] mut_ifoldr: OK
  10580. 592.32 s [vector] +++ OK, passed 100 tests.
  10581. 592.32 s [vector] mut_ifoldr': OK
  10582. 592.32 s [vector] +++ OK, passed 100 tests.
  10583. 592.33 s [vector] mut_ifoldl: OK
  10584. 592.33 s [vector] +++ OK, passed 100 tests.
  10585. 592.33 s [vector] mut_ifoldl': OK
  10586. 592.33 s [vector] +++ OK, passed 100 tests.
  10587. 592.33 s [vector] mut_foldM: OK
  10588. 592.33 s [vector] +++ OK, passed 100 tests.
  10589. 592.33 s [vector] mut_foldM': OK
  10590. 592.33 s [vector] +++ OK, passed 100 tests.
  10591. 592.33 s [vector] mut_foldrM: OK
  10592. 592.33 s [vector] +++ OK, passed 100 tests.
  10593. 592.33 s [vector] mut_foldrM': OK
  10594. 592.33 s [vector] +++ OK, passed 100 tests.
  10595. 592.33 s [vector] mut_ifoldM: OK
  10596. 592.33 s [vector] +++ OK, passed 100 tests.
  10597. 592.34 s [vector] mut_ifoldM': OK
  10598. 592.34 s [vector] +++ OK, passed 100 tests.
  10599. 592.34 s [vector] mut_ifoldrM: OK
  10600. 592.34 s [vector] +++ OK, passed 100 tests.
  10601. 592.34 s [vector] mut_ifoldrM': OK
  10602. 592.34 s [vector] +++ OK, passed 100 tests.
  10603. 592.34 s [vector] compare: OK
  10604. 592.34 s [vector] +++ OK, passed 100 tests.
  10605. 592.34 s [vector] maximum: OK
  10606. 592.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10607. 592.34 s [vector] minimum: OK
  10608. 592.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10609. 592.34 s [vector] minIndex: OK
  10610. 592.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10611. 592.34 s [vector] maxIndex: OK
  10612. 592.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10613. 592.34 s [vector] maximumBy: OK
  10614. 592.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10615. 592.34 s [vector] minimumBy: OK
  10616. 592.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10617. 592.34 s [vector] maximumOn: OK
  10618. 592.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10619. 592.35 s [vector] minimumOn: OK
  10620. 592.35 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10621. 592.35 s [vector] maxIndexBy: OK
  10622. 592.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10623. 592.35 s [vector] minIndexBy: OK
  10624. 592.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10625. 592.35 s [vector] ListFirstMaxIndexWins: OK
  10626. 592.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10627. 592.35 s [vector] FalseListFirstMaxIndexWins: OK
  10628. 592.35 s [vector] +++ OK, failed as expected. (after 1 test):
  10629. 592.35 s [vector] Exception:
  10630. 592.35 s [vector] Prelude.foldr1: empty list
  10631. 592.35 s [vector] CallStack (from HasCallStack):
  10632. 592.35 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  10633. 592.35 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  10634. 592.35 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10635. 592.35 s [vector] []
  10636. 592.35 s [vector] zip: OK
  10637. 592.35 s [vector] +++ OK, passed 100 tests.
  10638. 592.35 s [vector] zip3: OK
  10639. 592.35 s [vector] +++ OK, passed 100 tests.
  10640. 592.35 s [vector] unzip: OK
  10641. 592.35 s [vector] +++ OK, passed 100 tests.
  10642. 592.35 s [vector] unzip3: OK
  10643. 592.35 s [vector] +++ OK, passed 100 tests.
  10644. 592.35 s [vector] indexed: OK
  10645. 592.35 s [vector] +++ OK, passed 100 tests.
  10646. 592.35 s [vector] update: OK
  10647. 592.35 s [vector] +++ OK, passed 100 tests.
  10648. 592.36 s [vector] mempty: OK
  10649. 592.36 s [vector] +++ OK, passed 100 tests.
  10650. 592.36 s [vector] mappend: OK
  10651. 592.36 s [vector] +++ OK, passed 100 tests.
  10652. 592.36 s [vector] mconcat: OK
  10653. 592.36 s [vector] +++ OK, passed 100 tests.
  10654. 592.36 s [vector] glength: OK
  10655. 592.36 s [vector] +++ OK, passed 100 tests.
  10656. 592.36 s [vector] sum: OK
  10657. 592.36 s [vector] +++ OK, passed 100 tests.
  10658. 592.36 s [vector] product: OK
  10659. 592.36 s [vector] +++ OK, passed 100 tests.
  10660. 592.36 s [vector] enumFromN: OK
  10661. 592.36 s [vector] +++ OK, passed 100 tests.
  10662. 592.36 s [vector] enumFromThenN: OK
  10663. 592.36 s [vector] +++ OK, passed 100 tests.
  10664. 592.36 s [vector] enumFromTo: OK
  10665. 592.36 s [vector] +++ OK, passed 100 tests.
  10666. 592.36 s [vector] enumFromThenTo: OK
  10667. 592.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10668. 592.36 s [vector] (Float)
  10669. 592.36 s [vector] fromList.toList == id: OK
  10670. 592.36 s [vector] +++ OK, passed 100 tests.
  10671. 592.36 s [vector] toList.fromList == id: OK
  10672. 592.36 s [vector] +++ OK, passed 100 tests.
  10673. 592.36 s [vector] unstream.stream == id: OK
  10674. 592.36 s [vector] +++ OK, passed 100 tests.
  10675. 592.36 s [vector] stream.unstream == id: OK
  10676. 592.36 s [vector] +++ OK, passed 100 tests.
  10677. 592.37 s [vector] eq: OK
  10678. 592.37 s [vector] +++ OK, passed 100 tests.
  10679. 592.37 s [vector] length: OK
  10680. 592.37 s [vector] +++ OK, passed 100 tests.
  10681. 592.37 s [vector] null: OK
  10682. 592.37 s [vector] +++ OK, passed 100 tests.
  10683. 592.37 s [vector] index: OK
  10684. 592.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10685. 592.37 s [vector] safeIndex: OK
  10686. 592.37 s [vector] +++ OK, passed 100 tests.
  10687. 592.37 s [vector] head: OK
  10688. 592.37 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10689. 592.37 s [vector] last: OK
  10690. 592.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10691. 592.37 s [vector] unsafeIndex: OK
  10692. 592.37 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10693. 592.37 s [vector] unsafeHead: OK
  10694. 592.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10695. 592.37 s [vector] unsafeLast: OK
  10696. 592.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10697. 592.37 s [vector] slice: OK
  10698. 592.37 s [vector] +++ OK, passed 100 tests.
  10699. 592.37 s [vector] init: OK
  10700. 592.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10701. 592.37 s [vector] tail: OK
  10702. 592.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10703. 592.38 s [vector] take: OK
  10704. 592.38 s [vector] +++ OK, passed 100 tests.
  10705. 592.38 s [vector] drop: OK
  10706. 592.38 s [vector] +++ OK, passed 100 tests.
  10707. 592.38 s [vector] splitAt: OK
  10708. 592.38 s [vector] +++ OK, passed 100 tests.
  10709. 592.38 s [vector] empty: OK
  10710. 592.38 s [vector] +++ OK, passed 100 tests.
  10711. 592.38 s [vector] singleton: OK
  10712. 592.38 s [vector] +++ OK, passed 100 tests.
  10713. 592.38 s [vector] replicate: OK
  10714. 592.38 s [vector] +++ OK, passed 100 tests.
  10715. 592.38 s [vector] generate: OK
  10716. 592.38 s [vector] +++ OK, passed 100 tests.
  10717. 592.40 s [vector] iterateN: OK
  10718. 592.40 s [vector] +++ OK, passed 100 tests.
  10719. 592.40 s [vector] iterateNM: OK (0.02s)
  10720. 592.40 s [vector] +++ OK, passed 100 tests.
  10721. 592.44 s [vector] generateM: OK (0.01s)
  10722. 592.44 s [vector] +++ OK, passed 100 tests.
  10723. 592.45 s [vector] replicateM: OK (0.01s)
  10724. 592.45 s [vector] +++ OK, passed 100 tests.
  10725. 592.45 s [vector] create: OK
  10726. 592.45 s [vector] +++ OK, passed 100 tests.
  10727. 592.45 s [vector] createT: OK
  10728. 592.45 s [vector] +++ OK, passed 100 tests.
  10729. 592.45 s [vector] unfoldr: OK
  10730. 592.45 s [vector] +++ OK, passed 100 tests.
  10731. 592.45 s [vector] unfoldrN: OK
  10732. 592.45 s [vector] +++ OK, passed 100 tests.
  10733. 592.45 s [vector] unfoldrExactN: OK
  10734. 592.45 s [vector] +++ OK, passed 100 tests.
  10735. 592.45 s [vector] unfoldrM: OK
  10736. 592.45 s [vector] +++ OK, passed 100 tests.
  10737. 592.46 s [vector] unfoldrNM: OK
  10738. 592.46 s [vector] +++ OK, passed 100 tests.
  10739. 592.49 s [vector] unfoldrExactNM: OK (0.03s)
  10740. 592.50 s [vector] +++ OK, passed 100 tests.
  10741. 592.50 s [vector] constructN: OK
  10742. 592.50 s [vector] +++ OK, passed 100 tests.
  10743. 592.50 s [vector] constructrN: OK
  10744. 592.50 s [vector] +++ OK, passed 100 tests.
  10745. 592.50 s [vector] cons: OK
  10746. 592.50 s [vector] +++ OK, passed 100 tests.
  10747. 592.50 s [vector] snoc: OK
  10748. 592.50 s [vector] +++ OK, passed 100 tests.
  10749. 592.52 s [vector] append: OK
  10750. 592.52 s [vector] +++ OK, passed 100 tests.
  10751. 592.52 s [vector] concat: OK (0.02s)
  10752. 592.52 s [vector] +++ OK, passed 100 tests.
  10753. 592.52 s [vector] force: OK
  10754. 592.52 s [vector] +++ OK, passed 100 tests.
  10755. 592.52 s [vector] upd: OK
  10756. 592.52 s [vector] +++ OK, passed 100 tests.
  10757. 592.53 s [vector] accum: OK
  10758. 592.53 s [vector] +++ OK, passed 100 tests.
  10759. 592.53 s [vector] reverse: OK
  10760. 592.53 s [vector] +++ OK, passed 100 tests.
  10761. 592.53 s [vector] backpermute: OK
  10762. 592.53 s [vector] +++ OK, passed 100 tests.
  10763. 592.54 s [vector] map: OK
  10764. 592.54 s [vector] +++ OK, passed 100 tests.
  10765. 592.54 s [vector] imap: OK
  10766. 592.54 s [vector] +++ OK, passed 100 tests.
  10767. 592.55 s [vector] concatMap: OK
  10768. 592.55 s [vector] +++ OK, passed 100 tests.
  10769. 592.55 s [vector] mapM: OK
  10770. 592.55 s [vector] +++ OK, passed 100 tests.
  10771. 592.58 s [vector] mapM_: OK (0.02s)
  10772. 592.60 s [vector] +++ OK, passed 100 tests.
  10773. 592.60 s [vector] forM: OK
  10774. 592.60 s [vector] +++ OK, passed 100 tests.
  10775. 592.62 s [vector] forM_: OK (0.03s)
  10776. 592.62 s [vector] +++ OK, passed 100 tests.
  10777. 592.62 s [vector] imapM: OK
  10778. 592.62 s [vector] +++ OK, passed 100 tests.
  10779. 592.65 s [vector] imapM_: OK (0.02s)
  10780. 592.65 s [vector] +++ OK, passed 100 tests.
  10781. 592.65 s [vector] zipWith: OK
  10782. 592.65 s [vector] +++ OK, passed 100 tests.
  10783. 592.66 s [vector] zipWith3: OK
  10784. 592.66 s [vector] +++ OK, passed 100 tests.
  10785. 592.66 s [vector] izipWith: OK
  10786. 592.66 s [vector] +++ OK, passed 100 tests.
  10787. 592.67 s [vector] izipWith3: OK
  10788. 592.67 s [vector] +++ OK, passed 100 tests.
  10789. 592.67 s [vector] izipWithM: OK
  10790. 592.67 s [vector] +++ OK, passed 100 tests.
  10791. 592.70 s [vector] izipWithM_: OK (0.02s)
  10792. 592.70 s [vector] +++ OK, passed 100 tests.
  10793. 592.70 s [vector] zipWithM: OK
  10794. 592.70 s [vector] +++ OK, passed 100 tests.
  10795. 592.73 s [vector] zipWithM_: OK
  10796. 592.73 s [vector] +++ OK, passed 100 tests.
  10797. 592.73 s [vector] filter: OK
  10798. 592.73 s [vector] +++ OK, passed 100 tests.
  10799. 592.73 s [vector] ifilter: OK
  10800. 592.73 s [vector] +++ OK, passed 100 tests.
  10801. 592.77 s [vector] filterM: OK (0.03s)
  10802. 592.78 s [vector] +++ OK, passed 100 tests.
  10803. 593.13 s [vector] uniq: OK
  10804. 593.13 s [vector] +++ OK, passed 100 tests.
  10805. 593.13 s [vector] mapMaybe: OK
  10806. 593.13 s [vector] +++ OK, passed 100 tests.
  10807. 593.13 s [vector] imapMaybe: OK
  10808. 593.13 s [vector] +++ OK, passed 100 tests.
  10809. 593.13 s [vector] takeWhile: OK
  10810. 593.13 s [vector] +++ OK, passed 100 tests.
  10811. 593.13 s [vector] dropWhile: OK
  10812. 593.13 s [vector] +++ OK, passed 100 tests.
  10813. 593.13 s [vector] partition: OK
  10814. 593.13 s [vector] +++ OK, passed 100 tests.
  10815. 593.13 s [vector] partitionWith: OK
  10816. 593.13 s [vector] +++ OK, passed 100 tests.
  10817. 593.13 s [vector] span: OK
  10818. 593.13 s [vector] +++ OK, passed 100 tests.
  10819. 593.13 s [vector] break: OK
  10820. 593.13 s [vector] +++ OK, passed 100 tests.
  10821. 593.13 s [vector] spanR: OK
  10822. 593.13 s [vector] +++ OK, passed 100 tests.
  10823. 593.13 s [vector] breakR: OK
  10824. 593.13 s [vector] +++ OK, passed 100 tests.
  10825. 593.13 s [vector] groupBy: OK
  10826. 593.13 s [vector] +++ OK, passed 100 tests.
  10827. 593.13 s [vector] elem: OK
  10828. 593.13 s [vector] +++ OK, passed 100 tests.
  10829. 593.13 s [vector] notElem: OK
  10830. 593.13 s [vector] +++ OK, passed 100 tests.
  10831. 593.13 s [vector] find: OK
  10832. 593.13 s [vector] +++ OK, passed 100 tests.
  10833. 593.13 s [vector] findIndex: OK
  10834. 593.13 s [vector] +++ OK, passed 100 tests.
  10835. 593.13 s [vector] findIndexR: OK
  10836. 593.13 s [vector] +++ OK, passed 100 tests.
  10837. 593.13 s [vector] findIndices: OK
  10838. 593.13 s [vector] +++ OK, passed 100 tests.
  10839. 593.14 s [vector] elemIndex: OK
  10840. 593.14 s [vector] +++ OK, passed 100 tests.
  10841. 593.14 s [vector] elemIndices: OK
  10842. 593.14 s [vector] +++ OK, passed 100 tests.
  10843. 593.14 s [vector] foldl: OK
  10844. 593.14 s [vector] +++ OK, passed 100 tests.
  10845. 593.14 s [vector] foldl1: OK
  10846. 593.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10847. 593.14 s [vector] foldl': OK
  10848. 593.14 s [vector] +++ OK, passed 100 tests.
  10849. 593.14 s [vector] foldl1': OK
  10850. 593.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10851. 593.14 s [vector] foldr: OK
  10852. 593.14 s [vector] +++ OK, passed 100 tests.
  10853. 593.14 s [vector] foldr1: OK
  10854. 593.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10855. 593.14 s [vector] foldr': OK
  10856. 593.14 s [vector] +++ OK, passed 100 tests.
  10857. 593.14 s [vector] foldr1': OK
  10858. 593.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10859. 593.14 s [vector] ifoldl: OK
  10860. 593.14 s [vector] +++ OK, passed 100 tests.
  10861. 593.14 s [vector] ifoldl': OK
  10862. 593.14 s [vector] +++ OK, passed 100 tests.
  10863. 593.14 s [vector] ifoldr: OK
  10864. 593.14 s [vector] +++ OK, passed 100 tests.
  10865. 593.14 s [vector] ifoldr': OK
  10866. 593.14 s [vector] +++ OK, passed 100 tests.
  10867. 593.14 s [vector] ifoldM: OK
  10868. 593.14 s [vector] +++ OK, passed 100 tests.
  10869. 593.14 s [vector] ifoldM': OK
  10870. 593.14 s [vector] +++ OK, passed 100 tests.
  10871. 593.14 s [vector] ifoldM_: OK (0.03s)
  10872. 593.14 s [vector] +++ OK, passed 100 tests.
  10873. 593.14 s [vector] ifoldM'_: OK (0.03s)
  10874. 593.14 s [vector] +++ OK, passed 100 tests.
  10875. 593.14 s [vector] all: OK
  10876. 593.14 s [vector] +++ OK, passed 100 tests.
  10877. 593.14 s [vector] any: OK
  10878. 593.14 s [vector] +++ OK, passed 100 tests.
  10879. 593.14 s [vector] prescanl: OK
  10880. 593.14 s [vector] +++ OK, passed 100 tests.
  10881. 593.14 s [vector] prescanl': OK
  10882. 593.14 s [vector] +++ OK, passed 100 tests.
  10883. 593.14 s [vector] postscanl: OK
  10884. 593.14 s [vector] +++ OK, passed 100 tests.
  10885. 593.14 s [vector] postscanl': OK
  10886. 593.14 s [vector] +++ OK, passed 100 tests.
  10887. 593.14 s [vector] scanl: OK
  10888. 593.14 s [vector] +++ OK, passed 100 tests.
  10889. 593.14 s [vector] scanl': OK
  10890. 593.14 s [vector] +++ OK, passed 100 tests.
  10891. 593.14 s [vector] scanl1: OK
  10892. 593.14 s [vector] +++ OK, passed 100 tests.
  10893. 593.14 s [vector] scanl1': OK
  10894. 593.14 s [vector] +++ OK, passed 100 tests.
  10895. 593.14 s [vector] iscanl: OK
  10896. 593.14 s [vector] +++ OK, passed 100 tests.
  10897. 593.14 s [vector] iscanl': OK
  10898. 593.14 s [vector] +++ OK, passed 100 tests.
  10899. 593.14 s [vector] prescanr: OK
  10900. 593.14 s [vector] +++ OK, passed 100 tests.
  10901. 593.14 s [vector] prescanr': OK
  10902. 593.14 s [vector] +++ OK, passed 100 tests.
  10903. 593.14 s [vector] postscanr: OK
  10904. 593.14 s [vector] +++ OK, passed 100 tests.
  10905. 593.14 s [vector] postscanr': OK
  10906. 593.14 s [vector] +++ OK, passed 100 tests.
  10907. 593.14 s [vector] scanr: OK
  10908. 593.14 s [vector] +++ OK, passed 100 tests.
  10909. 593.14 s [vector] scanr': OK
  10910. 593.14 s [vector] +++ OK, passed 100 tests.
  10911. 593.14 s [vector] scanr1: OK
  10912. 593.14 s [vector] +++ OK, passed 100 tests.
  10913. 593.14 s [vector] scanr1': OK
  10914. 593.14 s [vector] +++ OK, passed 100 tests.
  10915. 593.14 s [vector] iscanr: OK
  10916. 593.14 s [vector] +++ OK, passed 100 tests.
  10917. 593.14 s [vector] iscanr': OK
  10918. 593.14 s [vector] +++ OK, passed 100 tests.
  10919. 593.14 s [vector] mut_read: OK
  10920. 593.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10921. 593.14 s [vector] mut_write: OK
  10922. 593.14 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10923. 593.14 s [vector] mut_modify: OK
  10924. 593.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10925. 593.14 s [vector] mut_generate: OK
  10926. 593.14 s [vector] +++ OK, passed 100 tests.
  10927. 593.14 s [vector] mut_generateM: OK (0.02s)
  10928. 593.14 s [vector] +++ OK, passed 100 tests.
  10929. 593.16 s [vector] mut_mapM_: OK (0.03s)
  10930. 593.16 s [vector] +++ OK, passed 100 tests.
  10931. 593.20 s [vector] mut_imapM_: OK (0.03s)
  10932. 593.20 s [vector] +++ OK, passed 100 tests.
  10933. 593.22 s [vector] mut_forM_: OK (0.03s)
  10934. 593.22 s [vector] +++ OK, passed 100 tests.
  10935. 593.24 s [vector] mut_iforM_: OK (0.03s)
  10936. 593.24 s [vector] +++ OK, passed 100 tests.
  10937. 593.25 s [vector] mut_foldr: OK
  10938. 593.26 s [vector] +++ OK, passed 100 tests.
  10939. 593.26 s [vector] mut_foldr': OK
  10940. 593.26 s [vector] +++ OK, passed 100 tests.
  10941. 593.26 s [vector] mut_foldl: OK
  10942. 593.26 s [vector] +++ OK, passed 100 tests.
  10943. 593.26 s [vector] mut_foldl': OK
  10944. 593.26 s [vector] +++ OK, passed 100 tests.
  10945. 593.27 s [vector] mut_ifoldr: OK
  10946. 593.27 s [vector] +++ OK, passed 100 tests.
  10947. 593.28 s [vector] mut_ifoldr': OK
  10948. 593.28 s [vector] +++ OK, passed 100 tests.
  10949. 593.28 s [vector] mut_ifoldl: OK
  10950. 593.28 s [vector] +++ OK, passed 100 tests.
  10951. 593.30 s [vector] mut_ifoldl': OK
  10952. 593.30 s [vector] +++ OK, passed 100 tests.
  10953. 593.31 s [vector] mut_foldM: OK
  10954. 593.31 s [vector] +++ OK, passed 100 tests.
  10955. 593.31 s [vector] mut_foldM': OK
  10956. 593.31 s [vector] +++ OK, passed 100 tests.
  10957. 593.31 s [vector] mut_foldrM: OK
  10958. 593.31 s [vector] +++ OK, passed 100 tests.
  10959. 593.32 s [vector] mut_foldrM': OK
  10960. 593.32 s [vector] +++ OK, passed 100 tests.
  10961. 593.33 s [vector] mut_ifoldM: OK
  10962. 593.33 s [vector] +++ OK, passed 100 tests.
  10963. 593.34 s [vector] mut_ifoldM': OK
  10964. 593.34 s [vector] +++ OK, passed 100 tests.
  10965. 593.34 s [vector] mut_ifoldrM: OK
  10966. 593.35 s [vector] +++ OK, passed 100 tests.
  10967. 593.35 s [vector] mut_ifoldrM': OK
  10968. 593.35 s [vector] +++ OK, passed 100 tests.
  10969. 593.35 s [vector] compare: OK
  10970. 593.35 s [vector] +++ OK, passed 100 tests.
  10971. 593.35 s [vector] maximum: OK
  10972. 593.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10973. 593.35 s [vector] minimum: OK
  10974. 593.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10975. 593.35 s [vector] minIndex: OK
  10976. 593.35 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10977. 593.35 s [vector] maxIndex: OK
  10978. 593.35 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10979. 593.35 s [vector] maximumBy: OK
  10980. 593.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10981. 593.35 s [vector] minimumBy: OK
  10982. 593.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10983. 593.35 s [vector] maximumOn: OK
  10984. 593.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10985. 593.35 s [vector] minimumOn: OK
  10986. 593.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10987. 593.35 s [vector] maxIndexBy: OK
  10988. 593.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10989. 593.36 s [vector] minIndexBy: OK
  10990. 593.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10991. 593.36 s [vector] ListFirstMaxIndexWins: OK
  10992. 593.36 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10993. 593.36 s [vector] FalseListFirstMaxIndexWins: OK
  10994. 593.36 s [vector] +++ OK, failed as expected. (after 1 test):
  10995. 593.36 s [vector] Exception:
  10996. 593.36 s [vector] Prelude.foldr1: empty list
  10997. 593.36 s [vector] CallStack (from HasCallStack):
  10998. 593.36 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  10999. 593.36 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  11000. 593.36 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11001. 593.36 s [vector] []
  11002. 593.36 s [vector] zip: OK
  11003. 593.36 s [vector] +++ OK, passed 100 tests.
  11004. 593.36 s [vector] zip3: OK
  11005. 593.36 s [vector] +++ OK, passed 100 tests.
  11006. 593.36 s [vector] unzip: OK
  11007. 593.36 s [vector] +++ OK, passed 100 tests.
  11008. 593.36 s [vector] unzip3: OK
  11009. 593.36 s [vector] +++ OK, passed 100 tests.
  11010. 593.36 s [vector] indexed: OK
  11011. 593.36 s [vector] +++ OK, passed 100 tests.
  11012. 593.36 s [vector] update: OK
  11013. 593.36 s [vector] +++ OK, passed 100 tests.
  11014. 593.36 s [vector] mempty: OK
  11015. 593.36 s [vector] +++ OK, passed 100 tests.
  11016. 593.36 s [vector] mappend: OK
  11017. 593.36 s [vector] +++ OK, passed 100 tests.
  11018. 593.38 s [vector] mconcat: OK (0.01s)
  11019. 593.38 s [vector] +++ OK, passed 100 tests.
  11020. 593.38 s [vector] glength: OK
  11021. 593.38 s [vector] +++ OK, passed 100 tests.
  11022. 593.38 s [vector] sum: OK
  11023. 593.38 s [vector] +++ OK, passed 100 tests.
  11024. 593.38 s [vector] product: OK
  11025. 593.38 s [vector] +++ OK, passed 100 tests.
  11026. 593.38 s [vector] enumFromN: OK
  11027. 593.38 s [vector] +++ OK, passed 100 tests.
  11028. 593.38 s [vector] enumFromThenN: OK
  11029. 593.38 s [vector] +++ OK, passed 100 tests.
  11030. 593.38 s [vector] enumFromTo: OK
  11031. 593.38 s [vector] +++ OK, passed 100 tests.
  11032. 593.38 s [vector] enumFromThenTo: OK
  11033. 593.38 s [vector] +++ OK, passed 100 tests; 2 discarded.
  11034. 593.38 s [vector] (Double)
  11035. 593.38 s [vector] fromList.toList == id: OK
  11036. 593.38 s [vector] +++ OK, passed 100 tests.
  11037. 593.38 s [vector] toList.fromList == id: OK
  11038. 593.38 s [vector] +++ OK, passed 100 tests.
  11039. 593.38 s [vector] unstream.stream == id: OK
  11040. 593.38 s [vector] +++ OK, passed 100 tests.
  11041. 593.39 s [vector] stream.unstream == id: OK
  11042. 593.39 s [vector] +++ OK, passed 100 tests.
  11043. 593.39 s [vector] eq: OK
  11044. 593.39 s [vector] +++ OK, passed 100 tests.
  11045. 593.39 s [vector] length: OK
  11046. 593.39 s [vector] +++ OK, passed 100 tests.
  11047. 593.39 s [vector] null: OK
  11048. 593.39 s [vector] +++ OK, passed 100 tests.
  11049. 593.39 s [vector] index: OK
  11050. 593.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11051. 593.39 s [vector] safeIndex: OK
  11052. 593.39 s [vector] +++ OK, passed 100 tests.
  11053. 593.39 s [vector] head: OK
  11054. 593.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11055. 593.39 s [vector] last: OK
  11056. 593.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11057. 593.39 s [vector] unsafeIndex: OK
  11058. 593.39 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11059. 593.39 s [vector] unsafeHead: OK
  11060. 593.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11061. 593.39 s [vector] unsafeLast: OK
  11062. 593.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11063. 593.39 s [vector] slice: OK
  11064. 593.39 s [vector] +++ OK, passed 100 tests.
  11065. 593.39 s [vector] init: OK
  11066. 593.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11067. 593.40 s [vector] tail: OK
  11068. 593.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11069. 593.40 s [vector] take: OK
  11070. 593.40 s [vector] +++ OK, passed 100 tests.
  11071. 593.40 s [vector] drop: OK
  11072. 593.40 s [vector] +++ OK, passed 100 tests.
  11073. 593.40 s [vector] splitAt: OK
  11074. 593.40 s [vector] +++ OK, passed 100 tests.
  11075. 593.40 s [vector] empty: OK
  11076. 593.40 s [vector] +++ OK, passed 100 tests.
  11077. 593.40 s [vector] singleton: OK
  11078. 593.40 s [vector] +++ OK, passed 100 tests.
  11079. 593.40 s [vector] replicate: OK
  11080. 593.40 s [vector] +++ OK, passed 100 tests.
  11081. 593.40 s [vector] generate: OK
  11082. 593.40 s [vector] +++ OK, passed 100 tests.
  11083. 593.40 s [vector] iterateN: OK
  11084. 593.40 s [vector] +++ OK, passed 100 tests.
  11085. 593.43 s [vector] iterateNM: OK (0.02s)
  11086. 593.43 s [vector] +++ OK, passed 100 tests.
  11087. 593.46 s [vector] generateM: OK (0.02s)
  11088. 593.46 s [vector] +++ OK, passed 100 tests.
  11089. 593.46 s [vector] replicateM: OK
  11090. 593.46 s [vector] +++ OK, passed 100 tests.
  11091. 593.46 s [vector] create: OK
  11092. 593.46 s [vector] +++ OK, passed 100 tests.
  11093. 593.46 s [vector] createT: OK
  11094. 593.46 s [vector] +++ OK, passed 100 tests.
  11095. 593.46 s [vector] unfoldr: OK
  11096. 593.46 s [vector] +++ OK, passed 100 tests.
  11097. 593.46 s [vector] unfoldrN: OK
  11098. 593.46 s [vector] +++ OK, passed 100 tests.
  11099. 593.47 s [vector] unfoldrExactN: OK
  11100. 593.47 s [vector] +++ OK, passed 100 tests.
  11101. 593.47 s [vector] unfoldrM: OK
  11102. 593.47 s [vector] +++ OK, passed 100 tests.
  11103. 593.47 s [vector] unfoldrNM: OK
  11104. 593.47 s [vector] +++ OK, passed 100 tests.
  11105. 593.52 s [vector] unfoldrExactNM: OK (0.04s)
  11106. 593.52 s [vector] +++ OK, passed 100 tests.
  11107. 593.52 s [vector] constructN: OK (0.01s)
  11108. 593.52 s [vector] +++ OK, passed 100 tests.
  11109. 593.53 s [vector] constructrN: OK (0.01s)
  11110. 593.53 s [vector] +++ OK, passed 100 tests.
  11111. 593.53 s [vector] cons: OK
  11112. 593.53 s [vector] +++ OK, passed 100 tests.
  11113. 593.53 s [vector] snoc: OK
  11114. 593.54 s [vector] +++ OK, passed 100 tests.
  11115. 593.54 s [vector] append: OK
  11116. 593.54 s [vector] +++ OK, passed 100 tests.
  11117. 593.55 s [vector] concat: OK (0.01s)
  11118. 593.55 s [vector] +++ OK, passed 100 tests.
  11119. 593.56 s [vector] force: OK
  11120. 593.56 s [vector] +++ OK, passed 100 tests.
  11121. 593.56 s [vector] upd: OK
  11122. 593.56 s [vector] +++ OK, passed 100 tests.
  11123. 593.56 s [vector] accum: OK (0.01s)
  11124. 593.56 s [vector] +++ OK, passed 100 tests.
  11125. 593.56 s [vector] reverse: OK
  11126. 593.56 s [vector] +++ OK, passed 100 tests.
  11127. 593.57 s [vector] backpermute: OK
  11128. 593.57 s [vector] +++ OK, passed 100 tests.
  11129. 593.57 s [vector] map: OK
  11130. 593.57 s [vector] +++ OK, passed 100 tests.
  11131. 593.58 s [vector] imap: OK
  11132. 593.58 s [vector] +++ OK, passed 100 tests.
  11133. 593.58 s [vector] concatMap: OK
  11134. 593.58 s [vector] +++ OK, passed 100 tests.
  11135. 593.60 s [vector] mapM: OK
  11136. 593.60 s [vector] +++ OK, passed 100 tests.
  11137. 593.62 s [vector] mapM_: OK (0.03s)
  11138. 593.64 s [vector] +++ OK, passed 100 tests.
  11139. 593.64 s [vector] forM: OK
  11140. 593.64 s [vector] +++ OK, passed 100 tests.
  11141. 593.66 s [vector] forM_: OK (0.03s)
  11142. 593.66 s [vector] +++ OK, passed 100 tests.
  11143. 593.66 s [vector] imapM: OK
  11144. 593.66 s [vector] +++ OK, passed 100 tests.
  11145. 593.70 s [vector] imapM_: OK (0.03s)
  11146. 593.70 s [vector] +++ OK, passed 100 tests.
  11147. 593.71 s [vector] zipWith: OK
  11148. 593.72 s [vector] +++ OK, passed 100 tests.
  11149. 593.72 s [vector] zipWith3: OK
  11150. 593.73 s [vector] +++ OK, passed 100 tests.
  11151. 593.74 s [vector] izipWith: OK
  11152. 593.76 s [vector] +++ OK, passed 100 tests.
  11153. 593.76 s [vector] izipWith3: OK
  11154. 593.76 s [vector] +++ OK, passed 100 tests.
  11155. 593.77 s [vector] izipWithM: OK
  11156. 593.77 s [vector] +++ OK, passed 100 tests.
  11157. 593.77 s [vector] izipWithM_: OK (0.02s)
  11158. 593.77 s [vector] +++ OK, passed 100 tests.
  11159. 593.77 s [vector] zipWithM: OK
  11160. 593.77 s [vector] +++ OK, passed 100 tests.
  11161. 593.79 s [vector] zipWithM_: OK (0.02s)
  11162. 593.79 s [vector] +++ OK, passed 100 tests.
  11163. 593.80 s [vector] filter: OK
  11164. 593.80 s [vector] +++ OK, passed 100 tests.
  11165. 593.80 s [vector] ifilter: OK
  11166. 593.80 s [vector] +++ OK, passed 100 tests.
  11167. 593.85 s [vector] filterM: OK (0.04s)
  11168. 593.85 s [vector] +++ OK, passed 100 tests.
  11169. 593.85 s [vector] uniq: OK
  11170. 593.85 s [vector] +++ OK, passed 100 tests.
  11171. 593.85 s [vector] mapMaybe: OK
  11172. 593.85 s [vector] +++ OK, passed 100 tests.
  11173. 593.86 s [vector] imapMaybe: OK
  11174. 593.86 s [vector] +++ OK, passed 100 tests.
  11175. 593.86 s [vector] takeWhile: OK
  11176. 593.87 s [vector] +++ OK, passed 100 tests.
  11177. 593.87 s [vector] dropWhile: OK
  11178. 593.88 s [vector] +++ OK, passed 100 tests.
  11179. 593.88 s [vector] partition: OK
  11180. 593.88 s [vector] +++ OK, passed 100 tests.
  11181. 593.88 s [vector] partitionWith: OK
  11182. 593.88 s [vector] +++ OK, passed 100 tests.
  11183. 593.88 s [vector] span: OK
  11184. 593.88 s [vector] +++ OK, passed 100 tests.
  11185. 593.88 s [vector] break: OK
  11186. 593.88 s [vector] +++ OK, passed 100 tests.
  11187. 593.88 s [vector] spanR: OK
  11188. 593.88 s [vector] +++ OK, passed 100 tests.
  11189. 593.89 s [vector] breakR: OK
  11190. 593.89 s [vector] +++ OK, passed 100 tests.
  11191. 593.89 s [vector] groupBy: OK
  11192. 593.89 s [vector] +++ OK, passed 100 tests.
  11193. 593.89 s [vector] elem: OK
  11194. 593.89 s [vector] +++ OK, passed 100 tests.
  11195. 593.89 s [vector] notElem: OK
  11196. 593.89 s [vector] +++ OK, passed 100 tests.
  11197. 593.89 s [vector] find: OK
  11198. 593.89 s [vector] +++ OK, passed 100 tests.
  11199. 593.89 s [vector] findIndex: OK
  11200. 593.90 s [vector] +++ OK, passed 100 tests.
  11201. 593.90 s [vector] findIndexR: OK
  11202. 593.90 s [vector] +++ OK, passed 100 tests.
  11203. 593.91 s [vector] findIndices: OK
  11204. 593.91 s [vector] +++ OK, passed 100 tests.
  11205. 593.91 s [vector] elemIndex: OK
  11206. 593.91 s [vector] +++ OK, passed 100 tests.
  11207. 593.91 s [vector] elemIndices: OK
  11208. 593.91 s [vector] +++ OK, passed 100 tests.
  11209. 593.91 s [vector] foldl: OK
  11210. 593.92 s [vector] +++ OK, passed 100 tests.
  11211. 593.93 s [vector] foldl1: OK
  11212. 593.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11213. 593.94 s [vector] foldl': OK
  11214. 593.95 s [vector] +++ OK, passed 100 tests.
  11215. 593.95 s [vector] foldl1': OK (0.01s)
  11216. 593.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11217. 593.96 s [vector] foldr: OK (0.01s)
  11218. 593.96 s [vector] +++ OK, passed 100 tests.
  11219. 593.97 s [vector] foldr1: OK (0.01s)
  11220. 593.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11221. 593.98 s [vector] foldr': OK (0.01s)
  11222. 593.98 s [vector] +++ OK, passed 100 tests.
  11223. 593.99 s [vector] foldr1': OK (0.01s)
  11224. 593.99 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11225. 593.99 s [vector] ifoldl: OK (0.01s)
  11226. 593.99 s [vector] +++ OK, passed 100 tests.
  11227. 594.02 s [vector] ifoldl': OK
  11228. 594.02 s [vector] +++ OK, passed 100 tests.
  11229. 594.02 s [vector] ifoldr: OK (0.01s)
  11230. 594.02 s [vector] +++ OK, passed 100 tests.
  11231. 594.04 s [vector] ifoldr': OK (0.01s)
  11232. 594.04 s [vector] +++ OK, passed 100 tests.
  11233. 594.04 s [vector] ifoldM: OK
  11234. 594.04 s [vector] +++ OK, passed 100 tests.
  11235. 594.05 s [vector] ifoldM': OK (0.01s)
  11236. 594.05 s [vector] +++ OK, passed 100 tests.
  11237. 594.08 s [vector] ifoldM_: OK (0.02s)
  11238. 594.08 s [vector] +++ OK, passed 100 tests.
  11239. 594.11 s [vector] ifoldM'_: OK (0.01s)
  11240. 594.11 s [vector] +++ OK, passed 100 tests.
  11241. 594.11 s [vector] all: OK
  11242. 594.11 s [vector] +++ OK, passed 100 tests.
  11243. 594.11 s [vector] any: OK
  11244. 594.11 s [vector] +++ OK, passed 100 tests.
  11245. 594.14 s [vector] prescanl: OK
  11246. 594.14 s [vector] +++ OK, passed 100 tests.
  11247. 594.14 s [vector] prescanl': OK (0.01s)
  11248. 594.14 s [vector] +++ OK, passed 100 tests.
  11249. 594.16 s [vector] postscanl: OK
  11250. 594.16 s [vector] +++ OK, passed 100 tests.
  11251. 594.16 s [vector] postscanl': OK (0.01s)
  11252. 594.16 s [vector] +++ OK, passed 100 tests.
  11253. 594.18 s [vector] scanl: OK
  11254. 594.18 s [vector] +++ OK, passed 100 tests.
  11255. 594.20 s [vector] scanl': OK (0.01s)
  11256. 594.20 s [vector] +++ OK, passed 100 tests.
  11257. 594.21 s [vector] scanl1: OK (0.01s)
  11258. 594.22 s [vector] +++ OK, passed 100 tests.
  11259. 594.22 s [vector] scanl1': OK (0.01s)
  11260. 594.22 s [vector] +++ OK, passed 100 tests.
  11261. 594.24 s [vector] iscanl: OK (0.01s)
  11262. 594.24 s [vector] +++ OK, passed 100 tests.
  11263. 594.24 s [vector] iscanl': OK (0.01s)
  11264. 594.24 s [vector] +++ OK, passed 100 tests.
  11265. 594.25 s [vector] prescanr: OK
  11266. 594.26 s [vector] +++ OK, passed 100 tests.
  11267. 594.26 s [vector] prescanr': OK (0.01s)
  11268. 594.26 s [vector] +++ OK, passed 100 tests.
  11269. 594.26 s [vector] postscanr: OK
  11270. 594.27 s [vector] +++ OK, passed 100 tests.
  11271. 594.28 s [vector] postscanr': OK (0.01s)
  11272. 594.29 s [vector] +++ OK, passed 100 tests.
  11273. 594.29 s [vector] scanr: OK (0.01s)
  11274. 594.29 s [vector] +++ OK, passed 100 tests.
  11275. 594.29 s [vector] scanr': OK (0.01s)
  11276. 594.29 s [vector] +++ OK, passed 100 tests.
  11277. 594.30 s [vector] scanr1: OK
  11278. 594.30 s [vector] +++ OK, passed 100 tests.
  11279. 594.31 s [vector] scanr1': OK
  11280. 594.31 s [vector] +++ OK, passed 100 tests.
  11281. 594.33 s [vector] iscanr: OK
  11282. 594.33 s [vector] +++ OK, passed 100 tests.
  11283. 594.34 s [vector] iscanr': OK (0.01s)
  11284. 594.34 s [vector] +++ OK, passed 100 tests.
  11285. 594.34 s [vector] mut_read: OK
  11286. 594.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11287. 594.36 s [vector] mut_write: OK
  11288. 594.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11289. 594.36 s [vector] mut_modify: OK
  11290. 594.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11291. 594.36 s [vector] mut_generate: OK
  11292. 594.36 s [vector] +++ OK, passed 100 tests.
  11293. 594.37 s [vector] mut_generateM: OK (0.02s)
  11294. 594.37 s [vector] +++ OK, passed 100 tests.
  11295. 594.40 s [vector] mut_mapM_: OK (0.03s)
  11296. 594.40 s [vector] +++ OK, passed 100 tests.
  11297. 594.42 s [vector] mut_imapM_: OK (0.03s)
  11298. 594.42 s [vector] +++ OK, passed 100 tests.
  11299. 594.46 s [vector] mut_forM_: OK (0.03s)
  11300. 594.46 s [vector] +++ OK, passed 100 tests.
  11301. 594.48 s [vector] mut_iforM_: OK (0.03s)
  11302. 594.48 s [vector] +++ OK, passed 100 tests.
  11303. 594.49 s [vector] mut_foldr: OK (0.01s)
  11304. 594.49 s [vector] +++ OK, passed 100 tests.
  11305. 594.49 s [vector] mut_foldr': OK (0.01s)
  11306. 594.49 s [vector] +++ OK, passed 100 tests.
  11307. 594.51 s [vector] mut_foldl: OK (0.01s)
  11308. 594.52 s [vector] +++ OK, passed 100 tests.
  11309. 594.52 s [vector] mut_foldl': OK (0.01s)
  11310. 594.52 s [vector] +++ OK, passed 100 tests.
  11311. 594.55 s [vector] mut_ifoldr: OK (0.01s)
  11312. 594.55 s [vector] +++ OK, passed 100 tests.
  11313. 594.55 s [vector] mut_ifoldr': OK (0.01s)
  11314. 594.55 s [vector] +++ OK, passed 100 tests.
  11315. 594.55 s [vector] mut_ifoldl: OK (0.01s)
  11316. 594.55 s [vector] +++ OK, passed 100 tests.
  11317. 594.57 s [vector] mut_ifoldl': OK
  11318. 594.58 s [vector] +++ OK, passed 100 tests.
  11319. 594.58 s [vector] mut_foldM: OK (0.01s)
  11320. 594.58 s [vector] +++ OK, passed 100 tests.
  11321. 594.60 s [vector] mut_foldM': OK (0.01s)
  11322. 594.60 s [vector] +++ OK, passed 100 tests.
  11323. 594.60 s [vector] mut_foldrM: OK (0.01s)
  11324. 594.60 s [vector] +++ OK, passed 100 tests.
  11325. 594.62 s [vector] mut_foldrM': OK (0.01s)
  11326. 594.62 s [vector] +++ OK, passed 100 tests.
  11327. 594.62 s [vector] mut_ifoldM: OK (0.01s)
  11328. 594.63 s [vector] +++ OK, passed 100 tests.
  11329. 594.64 s [vector] mut_ifoldM': OK (0.01s)
  11330. 594.64 s [vector] +++ OK, passed 100 tests.
  11331. 594.65 s [vector] mut_ifoldrM: OK (0.01s)
  11332. 594.65 s [vector] +++ OK, passed 100 tests.
  11333. 594.65 s [vector] mut_ifoldrM': OK (0.01s)
  11334. 594.65 s [vector] +++ OK, passed 100 tests.
  11335. 594.65 s [vector] compare: OK
  11336. 594.65 s [vector] +++ OK, passed 100 tests.
  11337. 594.65 s [vector] maximum: OK
  11338. 594.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11339. 594.65 s [vector] minimum: OK
  11340. 594.65 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11341. 594.65 s [vector] minIndex: OK
  11342. 594.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11343. 594.65 s [vector] maxIndex: OK
  11344. 594.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11345. 594.65 s [vector] maximumBy: OK
  11346. 594.65 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11347. 594.65 s [vector] minimumBy: OK
  11348. 594.65 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11349. 594.65 s [vector] maximumOn: OK
  11350. 594.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11351. 594.66 s [vector] minimumOn: OK
  11352. 594.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11353. 594.66 s [vector] maxIndexBy: OK
  11354. 594.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11355. 594.66 s [vector] minIndexBy: OK
  11356. 594.66 s [vector] +++ OK, passed 100 tests; 24 discarded.
  11357. 594.66 s [vector] ListFirstMaxIndexWins: OK
  11358. 594.66 s [vector] +++ OK, passed 100 tests; 25 discarded.
  11359. 594.66 s [vector] FalseListFirstMaxIndexWins: OK
  11360. 594.66 s [vector] +++ OK, failed as expected. (after 1 test):
  11361. 594.66 s [vector] Exception:
  11362. 594.66 s [vector] Prelude.foldr1: empty list
  11363. 594.66 s [vector] CallStack (from HasCallStack):
  11364. 594.66 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  11365. 594.66 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  11366. 594.66 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11367. 594.66 s [vector] []
  11368. 594.66 s [vector] zip: OK
  11369. 594.66 s [vector] +++ OK, passed 100 tests.
  11370. 594.66 s [vector] zip3: OK
  11371. 594.66 s [vector] +++ OK, passed 100 tests.
  11372. 594.66 s [vector] unzip: OK
  11373. 594.66 s [vector] +++ OK, passed 100 tests.
  11374. 594.67 s [vector] unzip3: OK
  11375. 594.67 s [vector] +++ OK, passed 100 tests.
  11376. 594.67 s [vector] indexed: OK
  11377. 594.67 s [vector] +++ OK, passed 100 tests.
  11378. 594.67 s [vector] update: OK
  11379. 594.67 s [vector] +++ OK, passed 100 tests.
  11380. 594.67 s [vector] mempty: OK
  11381. 594.67 s [vector] +++ OK, passed 100 tests.
  11382. 594.67 s [vector] mappend: OK
  11383. 594.67 s [vector] +++ OK, passed 100 tests.
  11384. 594.68 s [vector] mconcat: OK
  11385. 594.68 s [vector] +++ OK, passed 100 tests.
  11386. 594.68 s [vector] glength: OK
  11387. 594.68 s [vector] +++ OK, passed 100 tests.
  11388. 594.68 s [vector] sum: OK
  11389. 594.68 s [vector] +++ OK, passed 100 tests.
  11390. 594.68 s [vector] product: OK
  11391. 594.68 s [vector] +++ OK, passed 100 tests.
  11392. 594.68 s [vector] enumFromN: OK
  11393. 594.68 s [vector] +++ OK, passed 100 tests.
  11394. 594.68 s [vector] enumFromThenN: OK
  11395. 594.68 s [vector] +++ OK, passed 100 tests.
  11396. 594.68 s [vector] enumFromTo: OK
  11397. 594.68 s [vector] +++ OK, passed 100 tests.
  11398. 594.68 s [vector] enumFromThenTo: OK
  11399. 594.68 s [vector] +++ OK, passed 100 tests; 3 discarded.
  11400. 594.68 s [vector] (Int,Bool)
  11401. 594.68 s [vector] fromList.toList == id: OK
  11402. 594.68 s [vector] +++ OK, passed 100 tests.
  11403. 594.68 s [vector] toList.fromList == id: OK
  11404. 594.68 s [vector] +++ OK, passed 100 tests.
  11405. 594.68 s [vector] unstream.stream == id: OK
  11406. 594.68 s [vector] +++ OK, passed 100 tests.
  11407. 594.69 s [vector] stream.unstream == id: OK
  11408. 594.69 s [vector] +++ OK, passed 100 tests.
  11409. 594.69 s [vector] eq: OK
  11410. 594.69 s [vector] +++ OK, passed 100 tests.
  11411. 594.69 s [vector] length: OK
  11412. 594.69 s [vector] +++ OK, passed 100 tests.
  11413. 594.69 s [vector] null: OK
  11414. 594.69 s [vector] +++ OK, passed 100 tests.
  11415. 594.69 s [vector] index: OK
  11416. 594.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11417. 594.69 s [vector] safeIndex: OK
  11418. 594.69 s [vector] +++ OK, passed 100 tests.
  11419. 594.69 s [vector] head: OK
  11420. 594.69 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11421. 594.69 s [vector] last: OK
  11422. 594.69 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11423. 594.69 s [vector] unsafeIndex: OK
  11424. 594.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11425. 594.69 s [vector] unsafeHead: OK
  11426. 594.69 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11427. 594.69 s [vector] unsafeLast: OK
  11428. 594.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11429. 594.69 s [vector] slice: OK
  11430. 594.69 s [vector] +++ OK, passed 100 tests.
  11431. 594.70 s [vector] init: OK
  11432. 594.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11433. 594.70 s [vector] tail: OK
  11434. 594.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11435. 594.70 s [vector] take: OK
  11436. 594.70 s [vector] +++ OK, passed 100 tests.
  11437. 594.70 s [vector] drop: OK
  11438. 594.70 s [vector] +++ OK, passed 100 tests.
  11439. 594.70 s [vector] splitAt: OK
  11440. 594.70 s [vector] +++ OK, passed 100 tests.
  11441. 594.72 s [vector] empty: OK
  11442. 594.72 s [vector] +++ OK, passed 100 tests.
  11443. 594.72 s [vector] singleton: OK
  11444. 594.72 s [vector] +++ OK, passed 100 tests.
  11445. 594.72 s [vector] replicate: OK
  11446. 594.72 s [vector] +++ OK, passed 100 tests.
  11447. 594.72 s [vector] generate: OK
  11448. 594.72 s [vector] +++ OK, passed 100 tests.
  11449. 594.72 s [vector] iterateN: OK
  11450. 594.73 s [vector] +++ OK, passed 100 tests.
  11451. 594.74 s [vector] iterateNM: OK (0.02s)
  11452. 594.74 s [vector] +++ OK, passed 100 tests.
  11453. 594.75 s [vector] generateM: OK (0.02s)
  11454. 594.75 s [vector] +++ OK, passed 100 tests.
  11455. 594.76 s [vector] replicateM: OK
  11456. 594.76 s [vector] +++ OK, passed 100 tests.
  11457. 594.76 s [vector] create: OK
  11458. 594.76 s [vector] +++ OK, passed 100 tests.
  11459. 594.76 s [vector] createT: OK
  11460. 594.76 s [vector] +++ OK, passed 100 tests.
  11461. 594.76 s [vector] unfoldr: OK
  11462. 594.76 s [vector] +++ OK, passed 100 tests.
  11463. 594.76 s [vector] unfoldrN: OK
  11464. 594.76 s [vector] +++ OK, passed 100 tests.
  11465. 594.77 s [vector] unfoldrExactN: OK
  11466. 594.77 s [vector] +++ OK, passed 100 tests.
  11467. 594.78 s [vector] unfoldrM: OK
  11468. 594.78 s [vector] +++ OK, passed 100 tests.
  11469. 594.78 s [vector] unfoldrNM: OK
  11470. 594.78 s [vector] +++ OK, passed 100 tests.
  11471. 594.79 s [vector] unfoldrExactNM: OK (0.02s)
  11472. 594.79 s [vector] +++ OK, passed 100 tests.
  11473. 594.80 s [vector] constructN: OK
  11474. 594.80 s [vector] +++ OK, passed 100 tests.
  11475. 594.80 s [vector] constructrN: OK
  11476. 594.80 s [vector] +++ OK, passed 100 tests.
  11477. 594.81 s [vector] cons: OK
  11478. 594.81 s [vector] +++ OK, passed 100 tests.
  11479. 594.81 s [vector] snoc: OK
  11480. 594.81 s [vector] +++ OK, passed 100 tests.
  11481. 594.81 s [vector] append: OK
  11482. 594.81 s [vector] +++ OK, passed 100 tests.
  11483. 594.84 s [vector] concat: OK (0.02s)
  11484. 594.84 s [vector] +++ OK, passed 100 tests.
  11485. 594.85 s [vector] force: OK
  11486. 594.85 s [vector] +++ OK, passed 100 tests.
  11487. 594.85 s [vector] upd: OK
  11488. 594.85 s [vector] +++ OK, passed 100 tests.
  11489. 594.85 s [vector] accum: OK
  11490. 594.85 s [vector] +++ OK, passed 100 tests.
  11491. 594.85 s [vector] reverse: OK
  11492. 594.85 s [vector] +++ OK, passed 100 tests.
  11493. 594.86 s [vector] backpermute: OK
  11494. 594.86 s [vector] +++ OK, passed 100 tests.
  11495. 594.86 s [vector] map: OK
  11496. 594.86 s [vector] +++ OK, passed 100 tests.
  11497. 594.87 s [vector] imap: OK
  11498. 594.87 s [vector] +++ OK, passed 100 tests.
  11499. 594.87 s [vector] concatMap: OK
  11500. 594.87 s [vector] +++ OK, passed 100 tests.
  11501. 594.87 s [vector] mapM: OK
  11502. 594.87 s [vector] +++ OK, passed 100 tests.
  11503. 594.90 s [vector] mapM_: OK (0.03s)
  11504. 594.90 s [vector] +++ OK, passed 100 tests.
  11505. 594.90 s [vector] forM: OK
  11506. 594.90 s [vector] +++ OK, passed 100 tests.
  11507. 594.92 s [vector] forM_: OK
  11508. 594.92 s [vector] +++ OK, passed 100 tests.
  11509. 594.94 s [vector] imapM: OK
  11510. 594.94 s [vector] +++ OK, passed 100 tests.
  11511. 594.95 s [vector] imapM_: OK (0.02s)
  11512. 594.95 s [vector] +++ OK, passed 100 tests.
  11513. 594.95 s [vector] zipWith: OK
  11514. 594.95 s [vector] +++ OK, passed 100 tests.
  11515. 594.96 s [vector] zipWith3: OK
  11516. 594.96 s [vector] +++ OK, passed 100 tests.
  11517. 594.96 s [vector] izipWith: OK
  11518. 594.96 s [vector] +++ OK, passed 100 tests.
  11519. 594.96 s [vector] izipWith3: OK
  11520. 594.96 s [vector] +++ OK, passed 100 tests.
  11521. 594.97 s [vector] izipWithM: OK
  11522. 594.97 s [vector] +++ OK, passed 100 tests.
  11523. 594.99 s [vector] izipWithM_: OK (0.01s)
  11524. 595.00 s [vector] +++ OK, passed 100 tests.
  11525. 595.00 s [vector] zipWithM: OK
  11526. 595.00 s [vector] +++ OK, passed 100 tests.
  11527. 595.02 s [vector] zipWithM_: OK (0.02s)
  11528. 595.02 s [vector] +++ OK, passed 100 tests.
  11529. 595.02 s [vector] filter: OK
  11530. 595.04 s [vector] +++ OK, passed 100 tests.
  11531. 595.04 s [vector] ifilter: OK
  11532. 595.04 s [vector] +++ OK, passed 100 tests.
  11533. 595.06 s [vector] filterM: OK (0.04s)
  11534. 595.06 s [vector] +++ OK, passed 100 tests.
  11535. 595.06 s [vector] uniq: OK
  11536. 595.06 s [vector] +++ OK, passed 100 tests.
  11537. 595.07 s [vector] mapMaybe: OK
  11538. 595.07 s [vector] +++ OK, passed 100 tests.
  11539. 595.07 s [vector] imapMaybe: OK
  11540. 595.07 s [vector] +++ OK, passed 100 tests.
  11541. 595.07 s [vector] takeWhile: OK
  11542. 595.07 s [vector] +++ OK, passed 100 tests.
  11543. 595.08 s [vector] dropWhile: OK
  11544. 595.08 s [vector] +++ OK, passed 100 tests.
  11545. 595.08 s [vector] partition: OK
  11546. 595.08 s [vector] +++ OK, passed 100 tests.
  11547. 595.08 s [vector] partitionWith: OK
  11548. 595.08 s [vector] +++ OK, passed 100 tests.
  11549. 595.08 s [vector] span: OK
  11550. 595.08 s [vector] +++ OK, passed 100 tests.
  11551. 595.08 s [vector] break: OK
  11552. 595.08 s [vector] +++ OK, passed 100 tests.
  11553. 595.08 s [vector] spanR: OK
  11554. 595.08 s [vector] +++ OK, passed 100 tests.
  11555. 595.09 s [vector] breakR: OK
  11556. 595.09 s [vector] +++ OK, passed 100 tests.
  11557. 595.09 s [vector] groupBy: OK
  11558. 595.09 s [vector] +++ OK, passed 100 tests.
  11559. 595.09 s [vector] elem: OK
  11560. 595.09 s [vector] +++ OK, passed 100 tests.
  11561. 595.09 s [vector] notElem: OK
  11562. 595.10 s [vector] +++ OK, passed 100 tests.
  11563. 595.10 s [vector] find: OK
  11564. 595.10 s [vector] +++ OK, passed 100 tests.
  11565. 595.10 s [vector] findIndex: OK
  11566. 595.10 s [vector] +++ OK, passed 100 tests.
  11567. 595.10 s [vector] findIndexR: OK
  11568. 595.10 s [vector] +++ OK, passed 100 tests.
  11569. 595.10 s [vector] findIndices: OK
  11570. 595.10 s [vector] +++ OK, passed 100 tests.
  11571. 595.10 s [vector] elemIndex: OK
  11572. 595.10 s [vector] +++ OK, passed 100 tests.
  11573. 595.10 s [vector] elemIndices: OK
  11574. 595.10 s [vector] +++ OK, passed 100 tests.
  11575. 595.10 s [vector] foldl: OK
  11576. 595.10 s [vector] +++ OK, passed 100 tests.
  11577. 595.11 s [vector] foldl1: OK
  11578. 595.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11579. 595.11 s [vector] foldl': OK
  11580. 595.11 s [vector] +++ OK, passed 100 tests.
  11581. 595.11 s [vector] foldl1': OK
  11582. 595.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11583. 595.11 s [vector] foldr: OK
  11584. 595.11 s [vector] +++ OK, passed 100 tests.
  11585. 595.12 s [vector] foldr1: OK
  11586. 595.12 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11587. 595.12 s [vector] foldr': OK
  11588. 595.12 s [vector] +++ OK, passed 100 tests.
  11589. 595.13 s [vector] foldr1': OK
  11590. 595.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11591. 595.13 s [vector] ifoldl: OK
  11592. 595.13 s [vector] +++ OK, passed 100 tests.
  11593. 595.13 s [vector] ifoldl': OK
  11594. 595.13 s [vector] +++ OK, passed 100 tests.
  11595. 595.14 s [vector] ifoldr: OK
  11596. 595.14 s [vector] +++ OK, passed 100 tests.
  11597. 595.14 s [vector] ifoldr': OK
  11598. 595.15 s [vector] +++ OK, passed 100 tests.
  11599. 595.15 s [vector] ifoldM: OK
  11600. 595.15 s [vector] +++ OK, passed 100 tests.
  11601. 595.15 s [vector] ifoldM': OK
  11602. 595.15 s [vector] +++ OK, passed 100 tests.
  11603. 595.18 s [vector] ifoldM_: OK (0.01s)
  11604. 595.18 s [vector] +++ OK, passed 100 tests.
  11605. 595.20 s [vector] ifoldM'_: OK (0.03s)
  11606. 595.20 s [vector] +++ OK, passed 100 tests.
  11607. 595.20 s [vector] all: OK
  11608. 595.20 s [vector] +++ OK, passed 100 tests.
  11609. 595.20 s [vector] any: OK
  11610. 595.20 s [vector] +++ OK, passed 100 tests.
  11611. 595.21 s [vector] prescanl: OK
  11612. 595.21 s [vector] +++ OK, passed 100 tests.
  11613. 595.21 s [vector] prescanl': OK
  11614. 595.21 s [vector] +++ OK, passed 100 tests.
  11615. 595.21 s [vector] postscanl: OK
  11616. 595.21 s [vector] +++ OK, passed 100 tests.
  11617. 595.22 s [vector] postscanl': OK
  11618. 595.22 s [vector] +++ OK, passed 100 tests.
  11619. 595.22 s [vector] scanl: OK
  11620. 595.22 s [vector] +++ OK, passed 100 tests.
  11621. 595.23 s [vector] scanl': OK
  11622. 595.23 s [vector] +++ OK, passed 100 tests.
  11623. 595.23 s [vector] scanl1: OK
  11624. 595.24 s [vector] +++ OK, passed 100 tests.
  11625. 595.24 s [vector] scanl1': OK
  11626. 595.24 s [vector] +++ OK, passed 100 tests.
  11627. 595.24 s [vector] iscanl: OK
  11628. 595.24 s [vector] +++ OK, passed 100 tests.
  11629. 595.25 s [vector] iscanl': OK
  11630. 595.25 s [vector] +++ OK, passed 100 tests.
  11631. 595.25 s [vector] prescanr: OK
  11632. 595.25 s [vector] +++ OK, passed 100 tests.
  11633. 595.25 s [vector] prescanr': OK
  11634. 595.25 s [vector] +++ OK, passed 100 tests.
  11635. 595.26 s [vector] postscanr: OK
  11636. 595.26 s [vector] +++ OK, passed 100 tests.
  11637. 595.26 s [vector] postscanr': OK
  11638. 595.26 s [vector] +++ OK, passed 100 tests.
  11639. 595.26 s [vector] scanr: OK
  11640. 595.26 s [vector] +++ OK, passed 100 tests.
  11641. 595.27 s [vector] scanr': OK
  11642. 595.27 s [vector] +++ OK, passed 100 tests.
  11643. 595.27 s [vector] scanr1: OK
  11644. 595.27 s [vector] +++ OK, passed 100 tests.
  11645. 595.28 s [vector] scanr1': OK
  11646. 595.28 s [vector] +++ OK, passed 100 tests.
  11647. 595.28 s [vector] iscanr: OK
  11648. 595.28 s [vector] +++ OK, passed 100 tests.
  11649. 595.28 s [vector] iscanr': OK
  11650. 595.29 s [vector] +++ OK, passed 100 tests.
  11651. 595.29 s [vector] mut_read: OK
  11652. 595.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11653. 595.29 s [vector] mut_write: OK
  11654. 595.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11655. 595.29 s [vector] mut_modify: OK
  11656. 595.30 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11657. 595.30 s [vector] mut_generate: OK
  11658. 595.30 s [vector] +++ OK, passed 100 tests.
  11659. 595.32 s [vector] mut_generateM: OK (0.01s)
  11660. 595.32 s [vector] +++ OK, passed 100 tests.
  11661. 595.34 s [vector] mut_mapM_: OK (0.02s)
  11662. 595.34 s [vector] +++ OK, passed 100 tests.
  11663. 595.36 s [vector] mut_imapM_: OK (0.03s)
  11664. 595.36 s [vector] +++ OK, passed 100 tests.
  11665. 595.38 s [vector] mut_forM_: OK (0.02s)
  11666. 595.38 s [vector] +++ OK, passed 100 tests.
  11667. 595.40 s [vector] mut_iforM_: OK (0.03s)
  11668. 595.40 s [vector] +++ OK, passed 100 tests.
  11669. 595.41 s [vector] mut_foldr: OK
  11670. 595.41 s [vector] +++ OK, passed 100 tests.
  11671. 595.41 s [vector] mut_foldr': OK
  11672. 595.41 s [vector] +++ OK, passed 100 tests.
  11673. 595.41 s [vector] mut_foldl: OK
  11674. 595.41 s [vector] +++ OK, passed 100 tests.
  11675. 595.42 s [vector] mut_foldl': OK
  11676. 595.42 s [vector] +++ OK, passed 100 tests.
  11677. 595.42 s [vector] mut_ifoldr: OK
  11678. 595.42 s [vector] +++ OK, passed 100 tests.
  11679. 595.42 s [vector] mut_ifoldr': OK
  11680. 595.43 s [vector] +++ OK, passed 100 tests.
  11681. 595.43 s [vector] mut_ifoldl: OK
  11682. 595.43 s [vector] +++ OK, passed 100 tests.
  11683. 595.44 s [vector] mut_ifoldl': OK
  11684. 595.44 s [vector] +++ OK, passed 100 tests.
  11685. 595.44 s [vector] mut_foldM: OK
  11686. 595.44 s [vector] +++ OK, passed 100 tests.
  11687. 595.45 s [vector] mut_foldM': OK
  11688. 595.45 s [vector] +++ OK, passed 100 tests.
  11689. 595.45 s [vector] mut_foldrM: OK
  11690. 595.45 s [vector] +++ OK, passed 100 tests.
  11691. 595.45 s [vector] mut_foldrM': OK
  11692. 595.45 s [vector] +++ OK, passed 100 tests.
  11693. 595.45 s [vector] mut_ifoldM: OK
  11694. 595.45 s [vector] +++ OK, passed 100 tests.
  11695. 595.46 s [vector] mut_ifoldM': OK
  11696. 595.46 s [vector] +++ OK, passed 100 tests.
  11697. 595.46 s [vector] mut_ifoldrM: OK
  11698. 595.46 s [vector] +++ OK, passed 100 tests.
  11699. 595.46 s [vector] mut_ifoldrM': OK
  11700. 595.46 s [vector] +++ OK, passed 100 tests.
  11701. 595.46 s [vector] compare: OK
  11702. 595.46 s [vector] +++ OK, passed 100 tests.
  11703. 595.46 s [vector] maximum: OK
  11704. 595.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11705. 595.46 s [vector] minimum: OK
  11706. 595.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11707. 595.46 s [vector] minIndex: OK
  11708. 595.46 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11709. 595.46 s [vector] maxIndex: OK
  11710. 595.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11711. 595.46 s [vector] maximumBy: OK
  11712. 595.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11713. 595.47 s [vector] minimumBy: OK
  11714. 595.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11715. 595.47 s [vector] maximumOn: OK
  11716. 595.47 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11717. 595.47 s [vector] minimumOn: OK
  11718. 595.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11719. 595.47 s [vector] maxIndexBy: OK
  11720. 595.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11721. 595.47 s [vector] minIndexBy: OK
  11722. 595.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11723. 595.47 s [vector] ListFirstMaxIndexWins: OK
  11724. 595.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11725. 595.47 s [vector] FalseListFirstMaxIndexWins: OK
  11726. 595.47 s [vector] +++ OK, failed as expected. (after 1 test):
  11727. 595.47 s [vector] Exception:
  11728. 595.47 s [vector] Prelude.foldr1: empty list
  11729. 595.47 s [vector] CallStack (from HasCallStack):
  11730. 595.47 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  11731. 595.47 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  11732. 595.47 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11733. 595.47 s [vector] []
  11734. 595.47 s [vector] zip: OK
  11735. 595.47 s [vector] +++ OK, passed 100 tests.
  11736. 595.47 s [vector] zip3: OK
  11737. 595.47 s [vector] +++ OK, passed 100 tests.
  11738. 595.47 s [vector] unzip: OK
  11739. 595.47 s [vector] +++ OK, passed 100 tests.
  11740. 595.47 s [vector] unzip3: OK
  11741. 595.47 s [vector] +++ OK, passed 100 tests.
  11742. 595.47 s [vector] indexed: OK
  11743. 595.47 s [vector] +++ OK, passed 100 tests.
  11744. 595.48 s [vector] update: OK
  11745. 595.48 s [vector] +++ OK, passed 100 tests.
  11746. 595.48 s [vector] mempty: OK
  11747. 595.48 s [vector] +++ OK, passed 100 tests.
  11748. 595.48 s [vector] mappend: OK
  11749. 595.48 s [vector] +++ OK, passed 100 tests.
  11750. 595.49 s [vector] mconcat: OK (0.02s)
  11751. 595.49 s [vector] +++ OK, passed 100 tests.
  11752. 595.49 s [vector] glength: OK
  11753. 595.49 s [vector] +++ OK, passed 100 tests.
  11754. 595.49 s [vector] (Int,Bool,Int)
  11755. 595.50 s [vector] fromList.toList == id: OK
  11756. 595.50 s [vector] +++ OK, passed 100 tests.
  11757. 595.50 s [vector] toList.fromList == id: OK
  11758. 595.50 s [vector] +++ OK, passed 100 tests.
  11759. 595.50 s [vector] unstream.stream == id: OK
  11760. 595.50 s [vector] +++ OK, passed 100 tests.
  11761. 595.50 s [vector] stream.unstream == id: OK
  11762. 595.50 s [vector] +++ OK, passed 100 tests.
  11763. 595.50 s [vector] eq: OK
  11764. 595.50 s [vector] +++ OK, passed 100 tests.
  11765. 595.50 s [vector] length: OK
  11766. 595.50 s [vector] +++ OK, passed 100 tests.
  11767. 595.50 s [vector] null: OK
  11768. 595.50 s [vector] +++ OK, passed 100 tests.
  11769. 595.50 s [vector] index: OK
  11770. 595.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11771. 595.50 s [vector] safeIndex: OK
  11772. 595.50 s [vector] +++ OK, passed 100 tests.
  11773. 595.50 s [vector] head: OK
  11774. 595.50 s [vector] +++ OK, passed 100 tests; 10 discarded.
  11775. 595.50 s [vector] last: OK
  11776. 595.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11777. 595.51 s [vector] unsafeIndex: OK
  11778. 595.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11779. 595.51 s [vector] unsafeHead: OK
  11780. 595.51 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11781. 595.51 s [vector] unsafeLast: OK
  11782. 595.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11783. 595.51 s [vector] slice: OK
  11784. 595.51 s [vector] +++ OK, passed 100 tests.
  11785. 595.51 s [vector] init: OK
  11786. 595.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11787. 595.51 s [vector] tail: OK
  11788. 595.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11789. 595.51 s [vector] take: OK
  11790. 595.51 s [vector] +++ OK, passed 100 tests.
  11791. 595.51 s [vector] drop: OK
  11792. 595.51 s [vector] +++ OK, passed 100 tests.
  11793. 595.52 s [vector] splitAt: OK
  11794. 595.52 s [vector] +++ OK, passed 100 tests.
  11795. 595.52 s [vector] empty: OK
  11796. 595.52 s [vector] +++ OK, passed 100 tests.
  11797. 595.52 s [vector] singleton: OK
  11798. 595.52 s [vector] +++ OK, passed 100 tests.
  11799. 595.52 s [vector] replicate: OK
  11800. 595.52 s [vector] +++ OK, passed 100 tests.
  11801. 595.52 s [vector] generate: OK
  11802. 595.52 s [vector] +++ OK, passed 100 tests.
  11803. 595.54 s [vector] iterateN: OK
  11804. 595.54 s [vector] +++ OK, passed 100 tests.
  11805. 595.56 s [vector] iterateNM: OK (0.03s)
  11806. 595.56 s [vector] +++ OK, passed 100 tests.
  11807. 595.60 s [vector] generateM: OK (0.04s)
  11808. 595.60 s [vector] +++ OK, passed 100 tests.
  11809. 595.60 s [vector] replicateM: OK
  11810. 595.60 s [vector] +++ OK, passed 100 tests.
  11811. 595.61 s [vector] create: OK
  11812. 595.61 s [vector] +++ OK, passed 100 tests.
  11813. 595.61 s [vector] createT: OK
  11814. 595.61 s [vector] +++ OK, passed 100 tests.
  11815. 595.61 s [vector] unfoldr: OK
  11816. 595.61 s [vector] +++ OK, passed 100 tests.
  11817. 595.61 s [vector] unfoldrN: OK
  11818. 595.61 s [vector] +++ OK, passed 100 tests.
  11819. 595.61 s [vector] unfoldrExactN: OK
  11820. 595.61 s [vector] +++ OK, passed 100 tests.
  11821. 595.62 s [vector] unfoldrM: OK
  11822. 595.62 s [vector] +++ OK, passed 100 tests.
  11823. 595.62 s [vector] unfoldrNM: OK
  11824. 595.62 s [vector] +++ OK, passed 100 tests.
  11825. 595.64 s [vector] unfoldrExactNM: OK (0.02s)
  11826. 595.64 s [vector] +++ OK, passed 100 tests.
  11827. 595.64 s [vector] constructN: OK
  11828. 595.64 s [vector] +++ OK, passed 100 tests.
  11829. 595.64 s [vector] constructrN: OK
  11830. 595.64 s [vector] +++ OK, passed 100 tests.
  11831. 595.65 s [vector] cons: OK
  11832. 595.65 s [vector] +++ OK, passed 100 tests.
  11833. 595.65 s [vector] snoc: OK
  11834. 595.65 s [vector] +++ OK, passed 100 tests.
  11835. 595.65 s [vector] append: OK
  11836. 595.66 s [vector] +++ OK, passed 100 tests.
  11837. 595.70 s [vector] concat: OK (0.05s)
  11838. 595.70 s [vector] +++ OK, passed 100 tests.
  11839. 595.70 s [vector] force: OK
  11840. 595.70 s [vector] +++ OK, passed 100 tests.
  11841. 595.71 s [vector] upd: OK
  11842. 595.71 s [vector] +++ OK, passed 100 tests.
  11843. 595.71 s [vector] accum: OK
  11844. 595.72 s [vector] +++ OK, passed 100 tests.
  11845. 595.72 s [vector] reverse: OK
  11846. 595.72 s [vector] +++ OK, passed 100 tests.
  11847. 595.72 s [vector] backpermute: OK
  11848. 595.72 s [vector] +++ OK, passed 100 tests.
  11849. 595.72 s [vector] map: OK
  11850. 595.72 s [vector] +++ OK, passed 100 tests.
  11851. 595.73 s [vector] imap: OK
  11852. 595.74 s [vector] +++ OK, passed 100 tests.
  11853. 595.74 s [vector] concatMap: OK
  11854. 595.74 s [vector] +++ OK, passed 100 tests.
  11855. 595.74 s [vector] mapM: OK
  11856. 595.74 s [vector] +++ OK, passed 100 tests.
  11857. 595.78 s [vector] mapM_: OK (0.03s)
  11858. 595.78 s [vector] +++ OK, passed 100 tests.
  11859. 595.78 s [vector] forM: OK
  11860. 595.78 s [vector] +++ OK, passed 100 tests.
  11861. 595.81 s [vector] forM_: OK (0.03s)
  11862. 595.81 s [vector] +++ OK, passed 100 tests.
  11863. 595.81 s [vector] imapM: OK
  11864. 595.81 s [vector] +++ OK, passed 100 tests.
  11865. 595.86 s [vector] imapM_: OK (0.04s)
  11866. 595.86 s [vector] +++ OK, passed 100 tests.
  11867. 595.86 s [vector] zipWith: OK
  11868. 595.87 s [vector] +++ OK, passed 100 tests.
  11869. 595.87 s [vector] zipWith3: OK
  11870. 595.87 s [vector] +++ OK, passed 100 tests.
  11871. 595.87 s [vector] izipWith: OK
  11872. 595.87 s [vector] +++ OK, passed 100 tests.
  11873. 595.88 s [vector] izipWith3: OK
  11874. 595.88 s [vector] +++ OK, passed 100 tests.
  11875. 595.90 s [vector] izipWithM: OK
  11876. 595.90 s [vector] +++ OK, passed 100 tests.
  11877. 595.92 s [vector] izipWithM_: OK (0.03s)
  11878. 595.92 s [vector] +++ OK, passed 100 tests.
  11879. 595.92 s [vector] zipWithM: OK
  11880. 595.92 s [vector] +++ OK, passed 100 tests.
  11881. 595.95 s [vector] zipWithM_: OK (0.01s)
  11882. 595.95 s [vector] +++ OK, passed 100 tests.
  11883. 595.95 s [vector] filter: OK
  11884. 595.95 s [vector] +++ OK, passed 100 tests.
  11885. 595.96 s [vector] ifilter: OK
  11886. 595.96 s [vector] +++ OK, passed 100 tests.
  11887. 596.00 s [vector] filterM: OK (0.04s)
  11888. 596.01 s [vector] +++ OK, passed 100 tests.
  11889. 596.01 s [vector] uniq: OK
  11890. 596.02 s [vector] +++ OK, passed 100 tests.
  11891. 596.02 s [vector] mapMaybe: OK
  11892. 596.02 s [vector] +++ OK, passed 100 tests.
  11893. 596.03 s [vector] imapMaybe: OK
  11894. 596.03 s [vector] +++ OK, passed 100 tests.
  11895. 596.03 s [vector] takeWhile: OK
  11896. 596.03 s [vector] +++ OK, passed 100 tests.
  11897. 596.03 s [vector] dropWhile: OK
  11898. 596.03 s [vector] +++ OK, passed 100 tests.
  11899. 596.03 s [vector] partition: OK
  11900. 596.03 s [vector] +++ OK, passed 100 tests.
  11901. 596.03 s [vector] partitionWith: OK
  11902. 596.03 s [vector] +++ OK, passed 100 tests.
  11903. 596.03 s [vector] span: OK
  11904. 596.03 s [vector] +++ OK, passed 100 tests.
  11905. 596.04 s [vector] break: OK
  11906. 596.04 s [vector] +++ OK, passed 100 tests.
  11907. 596.04 s [vector] spanR: OK
  11908. 596.04 s [vector] +++ OK, passed 100 tests.
  11909. 596.04 s [vector] breakR: OK
  11910. 596.04 s [vector] +++ OK, passed 100 tests.
  11911. 596.04 s [vector] groupBy: OK
  11912. 596.04 s [vector] +++ OK, passed 100 tests.
  11913. 596.04 s [vector] elem: OK
  11914. 596.04 s [vector] +++ OK, passed 100 tests.
  11915. 596.04 s [vector] notElem: OK
  11916. 596.04 s [vector] +++ OK, passed 100 tests.
  11917. 596.04 s [vector] find: OK
  11918. 596.04 s [vector] +++ OK, passed 100 tests.
  11919. 596.05 s [vector] findIndex: OK
  11920. 596.05 s [vector] +++ OK, passed 100 tests.
  11921. 596.05 s [vector] findIndexR: OK
  11922. 596.05 s [vector] +++ OK, passed 100 tests.
  11923. 596.05 s [vector] findIndices: OK
  11924. 596.05 s [vector] +++ OK, passed 100 tests.
  11925. 596.05 s [vector] elemIndex: OK
  11926. 596.05 s [vector] +++ OK, passed 100 tests.
  11927. 596.05 s [vector] elemIndices: OK
  11928. 596.05 s [vector] +++ OK, passed 100 tests.
  11929. 596.06 s [vector] foldl: OK
  11930. 596.06 s [vector] +++ OK, passed 100 tests.
  11931. 596.06 s [vector] foldl1: OK
  11932. 596.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11933. 596.07 s [vector] foldl': OK
  11934. 596.08 s [vector] +++ OK, passed 100 tests.
  11935. 596.08 s [vector] foldl1': OK
  11936. 596.08 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11937. 596.08 s [vector] foldr: OK
  11938. 596.09 s [vector] +++ OK, passed 100 tests.
  11939. 596.09 s [vector] foldr1: OK
  11940. 596.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11941. 596.09 s [vector] foldr': OK
  11942. 596.09 s [vector] +++ OK, passed 100 tests.
  11943. 596.10 s [vector] foldr1': OK
  11944. 596.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11945. 596.10 s [vector] ifoldl: OK
  11946. 596.10 s [vector] +++ OK, passed 100 tests.
  11947. 596.12 s [vector] ifoldl': OK
  11948. 596.12 s [vector] +++ OK, passed 100 tests.
  11949. 596.12 s [vector] ifoldr: OK
  11950. 596.12 s [vector] +++ OK, passed 100 tests.
  11951. 596.13 s [vector] ifoldr': OK
  11952. 596.14 s [vector] +++ OK, passed 100 tests.
  11953. 596.14 s [vector] ifoldM: OK
  11954. 596.14 s [vector] +++ OK, passed 100 tests.
  11955. 596.14 s [vector] ifoldM': OK
  11956. 596.14 s [vector] +++ OK, passed 100 tests.
  11957. 596.18 s [vector] ifoldM_: OK (0.03s)
  11958. 596.18 s [vector] +++ OK, passed 100 tests.
  11959. 596.19 s [vector] ifoldM'_: OK (0.03s)
  11960. 596.19 s [vector] +++ OK, passed 100 tests.
  11961. 596.19 s [vector] all: OK
  11962. 596.19 s [vector] +++ OK, passed 100 tests.
  11963. 596.19 s [vector] any: OK
  11964. 596.19 s [vector] +++ OK, passed 100 tests.
  11965. 596.20 s [vector] prescanl: OK
  11966. 596.20 s [vector] +++ OK, passed 100 tests.
  11967. 596.20 s [vector] prescanl': OK
  11968. 596.20 s [vector] +++ OK, passed 100 tests.
  11969. 596.22 s [vector] postscanl: OK
  11970. 596.22 s [vector] +++ OK, passed 100 tests.
  11971. 596.22 s [vector] postscanl': OK
  11972. 596.22 s [vector] +++ OK, passed 100 tests.
  11973. 596.23 s [vector] scanl: OK
  11974. 596.24 s [vector] +++ OK, passed 100 tests.
  11975. 596.24 s [vector] scanl': OK
  11976. 596.24 s [vector] +++ OK, passed 100 tests.
  11977. 596.24 s [vector] scanl1: OK
  11978. 596.25 s [vector] +++ OK, passed 100 tests.
  11979. 596.26 s [vector] scanl1': OK
  11980. 596.26 s [vector] +++ OK, passed 100 tests.
  11981. 596.26 s [vector] iscanl: OK
  11982. 596.26 s [vector] +++ OK, passed 100 tests.
  11983. 596.26 s [vector] iscanl': OK
  11984. 596.27 s [vector] +++ OK, passed 100 tests.
  11985. 596.27 s [vector] prescanr: OK
  11986. 596.27 s [vector] +++ OK, passed 100 tests.
  11987. 596.27 s [vector] prescanr': OK
  11988. 596.27 s [vector] +++ OK, passed 100 tests.
  11989. 596.28 s [vector] postscanr: OK
  11990. 596.28 s [vector] +++ OK, passed 100 tests.
  11991. 596.29 s [vector] postscanr': OK
  11992. 596.30 s [vector] +++ OK, passed 100 tests.
  11993. 596.30 s [vector] scanr: OK
  11994. 596.30 s [vector] +++ OK, passed 100 tests.
  11995. 596.30 s [vector] scanr': OK
  11996. 596.30 s [vector] +++ OK, passed 100 tests.
  11997. 596.30 s [vector] scanr1: OK
  11998. 596.30 s [vector] +++ OK, passed 100 tests.
  11999. 596.31 s [vector] scanr1': OK
  12000. 596.31 s [vector] +++ OK, passed 100 tests.
  12001. 596.32 s [vector] iscanr: OK
  12002. 596.32 s [vector] +++ OK, passed 100 tests.
  12003. 596.32 s [vector] iscanr': OK
  12004. 596.32 s [vector] +++ OK, passed 100 tests.
  12005. 596.32 s [vector] mut_read: OK
  12006. 596.33 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12007. 596.33 s [vector] mut_write: OK
  12008. 596.33 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12009. 596.33 s [vector] mut_modify: OK
  12010. 596.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12011. 596.33 s [vector] mut_generate: OK
  12012. 596.33 s [vector] +++ OK, passed 100 tests.
  12013. 596.36 s [vector] mut_generateM: OK (0.01s)
  12014. 596.36 s [vector] +++ OK, passed 100 tests.
  12015. 596.40 s [vector] mut_mapM_: OK (0.04s)
  12016. 596.40 s [vector] +++ OK, passed 100 tests.
  12017. 596.44 s [vector] mut_imapM_: OK (0.03s)
  12018. 596.44 s [vector] +++ OK, passed 100 tests.
  12019. 596.45 s [vector] mut_forM_: OK (0.03s)
  12020. 596.45 s [vector] +++ OK, passed 100 tests.
  12021. 596.49 s [vector] mut_iforM_: OK (0.03s)
  12022. 596.50 s [vector] +++ OK, passed 100 tests.
  12023. 596.50 s [vector] mut_foldr: OK
  12024. 596.50 s [vector] +++ OK, passed 100 tests.
  12025. 596.50 s [vector] mut_foldr': OK
  12026. 596.50 s [vector] +++ OK, passed 100 tests.
  12027. 596.50 s [vector] mut_foldl: OK
  12028. 596.50 s [vector] +++ OK, passed 100 tests.
  12029. 596.51 s [vector] mut_foldl': OK
  12030. 596.51 s [vector] +++ OK, passed 100 tests.
  12031. 596.52 s [vector] mut_ifoldr: OK
  12032. 596.52 s [vector] +++ OK, passed 100 tests.
  12033. 596.52 s [vector] mut_ifoldr': OK
  12034. 596.52 s [vector] +++ OK, passed 100 tests.
  12035. 596.53 s [vector] mut_ifoldl: OK
  12036. 596.53 s [vector] +++ OK, passed 100 tests.
  12037. 596.53 s [vector] mut_ifoldl': OK
  12038. 596.53 s [vector] +++ OK, passed 100 tests.
  12039. 596.54 s [vector] mut_foldM: OK
  12040. 596.54 s [vector] +++ OK, passed 100 tests.
  12041. 596.54 s [vector] mut_foldM': OK
  12042. 596.54 s [vector] +++ OK, passed 100 tests.
  12043. 596.55 s [vector] mut_foldrM: OK
  12044. 596.55 s [vector] +++ OK, passed 100 tests.
  12045. 596.55 s [vector] mut_foldrM': OK
  12046. 596.55 s [vector] +++ OK, passed 100 tests.
  12047. 596.56 s [vector] mut_ifoldM: OK
  12048. 596.56 s [vector] +++ OK, passed 100 tests.
  12049. 596.57 s [vector] mut_ifoldM': OK
  12050. 596.57 s [vector] +++ OK, passed 100 tests.
  12051. 596.57 s [vector] mut_ifoldrM: OK
  12052. 596.57 s [vector] +++ OK, passed 100 tests.
  12053. 596.57 s [vector] mut_ifoldrM': OK
  12054. 596.57 s [vector] +++ OK, passed 100 tests.
  12055. 596.58 s [vector] compare: OK
  12056. 596.58 s [vector] +++ OK, passed 100 tests.
  12057. 596.58 s [vector] maximum: OK
  12058. 596.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12059. 596.58 s [vector] minimum: OK
  12060. 596.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12061. 596.58 s [vector] minIndex: OK
  12062. 596.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12063. 596.58 s [vector] maxIndex: OK
  12064. 596.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12065. 596.58 s [vector] maximumBy: OK
  12066. 596.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12067. 596.58 s [vector] minimumBy: OK
  12068. 596.58 s [vector] +++ OK, passed 100 tests; 25 discarded.
  12069. 596.58 s [vector] maximumOn: OK
  12070. 596.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12071. 596.58 s [vector] minimumOn: OK
  12072. 596.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12073. 596.58 s [vector] maxIndexBy: OK
  12074. 596.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12075. 596.58 s [vector] minIndexBy: OK
  12076. 596.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12077. 596.58 s [vector] ListFirstMaxIndexWins: OK
  12078. 596.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12079. 596.58 s [vector] FalseListFirstMaxIndexWins: OK
  12080. 596.58 s [vector] +++ OK, failed as expected. (after 1 test):
  12081. 596.58 s [vector] Exception:
  12082. 596.58 s [vector] Prelude.foldr1: empty list
  12083. 596.58 s [vector] CallStack (from HasCallStack):
  12084. 596.58 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  12085. 596.58 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  12086. 596.58 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12087. 596.58 s [vector] []
  12088. 596.58 s [vector] zip: OK
  12089. 596.58 s [vector] +++ OK, passed 100 tests.
  12090. 596.59 s [vector] zip3: OK
  12091. 596.59 s [vector] +++ OK, passed 100 tests.
  12092. 596.59 s [vector] unzip: OK
  12093. 596.59 s [vector] +++ OK, passed 100 tests.
  12094. 596.59 s [vector] unzip3: OK
  12095. 596.59 s [vector] +++ OK, passed 100 tests.
  12096. 596.59 s [vector] indexed: OK
  12097. 596.59 s [vector] +++ OK, passed 100 tests.
  12098. 596.59 s [vector] update: OK
  12099. 596.59 s [vector] +++ OK, passed 100 tests.
  12100. 596.59 s [vector] mempty: OK
  12101. 596.59 s [vector] +++ OK, passed 100 tests.
  12102. 596.59 s [vector] mappend: OK
  12103. 596.59 s [vector] +++ OK, passed 100 tests.
  12104. 596.62 s [vector] mconcat: OK (0.02s)
  12105. 596.62 s [vector] +++ OK, passed 100 tests.
  12106. 596.62 s [vector] glength: OK
  12107. 596.62 s [vector] +++ OK, passed 100 tests.
  12108. 596.62 s [vector] unstream
  12109. 596.62 s [vector] unstream == vunstream (exact): OK
  12110. 596.62 s [vector] +++ OK, passed 100 tests.
  12111. 596.62 s [vector] unstream == vunstream (unknown): OK
  12112. 596.62 s [vector] +++ OK, passed 100 tests.
  12113. 596.62 s [vector] unstreamR ~= vunstream (exact): OK
  12114. 596.62 s [vector] +++ OK, passed 100 tests.
  12115. 596.62 s [vector] unstreamR ~= vunstream (unknown): OK
  12116. 596.62 s [vector] +++ OK, passed 100 tests.
  12117. 596.62 s [vector] Data.Vector.Storable.Vector Alignment
  12118. 596.62 s [vector] Aligned Double: OK
  12119. 596.62 s [vector] Aligned Int: OK
  12120. 596.62 s [vector] Regression tests
  12121. 596.62 s [vector] enumFromTo crash #188
  12122. 596.62 s [vector] Word8: OK
  12123. 596.62 s [vector] Word16: OK
  12124. 596.62 s [vector] Word32: OK
  12125. 596.62 s [vector] Word64: OK
  12126. 596.62 s [vector] Word: OK
  12127. 596.62 s [vector] Int8: OK
  12128. 596.62 s [vector] Int16: OK
  12129. 596.62 s [vector] Int32: OK
  12130. 596.62 s [vector] Int64: OK
  12131. 596.62 s [vector] Int: OK
  12132. 596.62 s [vector] Char: OK
  12133. 596.62 s [vector] Negative tests
  12134. 596.62 s [vector] slice out of bounds #257
  12135. 596.62 s [vector] Boxed
  12136. 596.62 s [vector] Negative ix: OK
  12137. 596.62 s [vector] Negative size: OK
  12138. 596.62 s [vector] Negative ix and size: OK
  12139. 596.62 s [vector] Too large ix: OK
  12140. 596.62 s [vector] Too large size: OK
  12141. 596.62 s [vector] Too large ix and size: OK
  12142. 596.62 s [vector] Overflow: OK
  12143. 596.62 s [vector] OutOfMemory: OK
  12144. 596.62 s [vector] Primitive
  12145. 596.62 s [vector] Negative ix: OK
  12146. 596.62 s [vector] Negative size: OK
  12147. 596.62 s [vector] Negative ix and size: OK
  12148. 596.62 s [vector] Too large ix: OK
  12149. 596.62 s [vector] Too large size: OK
  12150. 596.62 s [vector] Too large ix and size: OK
  12151. 596.62 s [vector] Overflow: OK
  12152. 596.62 s [vector] OutOfMemory: OK
  12153. 596.62 s [vector] Storable
  12154. 596.62 s [vector] Negative ix: OK
  12155. 596.62 s [vector] Negative size: OK
  12156. 596.62 s [vector] Negative ix and size: OK
  12157. 596.62 s [vector] Too large ix: OK
  12158. 596.62 s [vector] Too large size: OK
  12159. 596.62 s [vector] Too large ix and size: OK
  12160. 596.62 s [vector] Overflow: OK
  12161. 596.62 s [vector] OutOfMemory: OK
  12162. 596.62 s [vector] Unboxed
  12163. 596.62 s [vector] Negative ix: OK
  12164. 596.62 s [vector] Negative size: OK
  12165. 596.62 s [vector] Negative ix and size: OK
  12166. 596.62 s [vector] Too large ix: OK
  12167. 596.62 s [vector] Too large size: OK
  12168. 596.62 s [vector] Too large ix and size: OK
  12169. 596.62 s [vector] Overflow: OK
  12170. 596.62 s [vector] OutOfMemory: OK
  12171. 596.62 s [vector] take #282
  12172. 596.62 s [vector] Boxed: OK
  12173. 596.62 s [vector] Primitive: OK
  12174. 596.62 s [vector] Storable: OK
  12175. 596.62 s [vector] Unboxed: OK
  12176. 596.62 s [vector] Data.Vector
  12177. 596.62 s [vector] MonadFix: OK
  12178. 596.62 s [vector] toFromArray: OK
  12179. 596.62 s [vector] toFromArraySlice: OK
  12180. 596.62 s [vector] toFromArraySliceUnsafe: OK
  12181. 596.62 s [vector] toFromMutableArray: OK
  12182. 596.62 s [vector] Data.Vector.Mutable (Move): OK
  12183. 596.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12184. 596.62 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  12185. 596.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12186. 596.62 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  12187. 596.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12188. 596.63 s [vector] Data.Vector.Storable.Mutable (Move): OK
  12189. 596.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12190. 596.63 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  12191. 596.63 s [vector] +++ OK, passed 100 tests.
  12192. 596.63 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  12193. 596.63 s [vector] +++ OK, passed 100 tests.
  12194. 596.63 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  12195. 596.63 s [vector] +++ OK, passed 100 tests.
  12196. 596.63 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  12197. 596.63 s [vector] +++ OK, passed 100 tests.
  12198. 596.63 s [vector]
  12199. 596.63 s [vector] All 2808 tests passed (11.74s)
  12200. 596.64 s [vector] Test suite vector-tests-O2: PASS
  12201. 596.64 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  12202. 596.64 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  12203. 596.65 s [vector] Phase: haddockPhase
  12204. 596.65 s [vector] Phase: installPhase
  12205. 596.69 s [vector] Installing library in /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  12206. 597.28 s [vector] Installing internal library benchmarks-O2 in /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  12207. 597.59 s [vector] Phase: fixupPhase
  12208. 597.61 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0
  12209. 597.62 s [vector] shrinking /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSvector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2-ghc9.4.8.so
  12210. 597.64 s [vector] shrinking /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSvector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf-ghc9.4.8.so
  12211. 597.67 s [vector] checking for references to /build/ in /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0...
  12212. 597.74 s [vector] patching script interpreter paths in /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0
  12213. 597.74 s [vector] stripping (with command strip and flags -S -p) in /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0/lib
  12214. 598.44 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0
  12215. 599.11 s [post-build-hook] Pushing 1 paths (64 are already present) using zstd to cache sellout ⏳
  12216. 599.11 s [post-build-hook]
  12217. 599.50 s [post-build-hook] Pushing /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0 (59.30 MiB)
  12218. 602.07 s [post-build-hook]
  12219. 602.07 s [post-build-hook] All done.
  12220. 602.09 s [post-build-hook] Uploading to the NixCI cache: /nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0
  12221. 602.12 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12222. 602.13 s [post-build-hook] copying 1 paths...
  12223. 602.13 s [post-build-hook] copying path '/nix/store/p0vi2fj6fgpgrj4vbdp4ww3wphpakx03-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  12224. 612.90 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12225. 613.14 s [post-build-hook] copying 1 paths...
  12226. 613.14 s [post-build-hook] copying path '/nix/store/iw22y4xz1cqahb73hiraglz3xdg0ak1i-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  12227. 613.37 s Progress: 1 of 10 built, 152 of 152 downloaded from cache
  12228. 613.43 s Building nothunks
  12229. 613.57 s [nothunks] Phase: setupCompilerEnvironmentPhase
  12230. 613.58 s [nothunks] Build with /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8.
  12231. 613.77 s [nothunks] Phase: unpackPhase
  12232. 613.77 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  12233. 613.78 s [nothunks] source root is nothunks-0.3.1
  12234. 613.79 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  12235. 613.79 s [nothunks] Phase: patchPhase
  12236. 613.80 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  12237. 613.80 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  12238. 613.82 s [nothunks] Phase: compileBuildDriverPhase
  12239. 613.82 s [nothunks] setupCompileFlags: -package-db=/build/tmp.PavWK09lJS/setup-package.conf.d -threaded
  12240. 613.88 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.PavWK09lJS/Main.o )
  12241. 613.92 s [nothunks] [2 of 2] Linking Setup
  12242. 614.94 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  12243. 614.95 s [nothunks] Phase: configurePhase
  12244. 614.96 s [nothunks] configureFlags: --verbose --prefix=/nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/0mzwj93h3a4jdd8akc376q54yj85gfvi-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.PavWK09lJS/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  12245. 615.44 s [nothunks] Using Parsec parser
  12246. 615.44 s [nothunks] Configuring nothunks-0.3.1...
  12247. 615.44 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  12248. 615.44 s [nothunks] Dependency base: using base-4.17.2.1
  12249. 615.44 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.11.5.3
  12250. 615.44 s [nothunks] Dependency containers: using containers-0.6.7
  12251. 615.44 s [nothunks] Dependency ghc-heap: using ghc-heap-9.4.8
  12252. 615.44 s [nothunks] Dependency stm: using stm-2.5.1.0
  12253. 615.44 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.0.2
  12254. 615.44 s [nothunks] Dependency time: using time-1.12.2
  12255. 615.44 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  12256. 615.44 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  12257. 615.44 s [nothunks] Dependency base: using base-4.17.2.1
  12258. 615.44 s [nothunks] Dependency containers: using containers-0.6.7
  12259. 615.44 s [nothunks] Dependency ghc-prim: using ghc-prim-0.9.1
  12260. 615.44 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  12261. 615.44 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  12262. 615.44 s [nothunks] Dependency random: using random-1.2.1.3
  12263. 615.44 s [nothunks] Dependency stm: using stm-2.5.1.0
  12264. 615.44 s [nothunks] Dependency tasty: using tasty-1.5.3
  12265. 615.44 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  12266. 615.69 s [nothunks] Source component graph:
  12267. 615.69 s [nothunks] component lib
  12268. 615.69 s [nothunks] component test:nothunks-test dependency lib
  12269. 615.69 s [nothunks] Configured component graph:
  12270. 615.69 s [nothunks] component nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12271. 615.69 s [nothunks] include base-4.17.2.1
  12272. 615.69 s [nothunks] include bytestring-0.11.5.3
  12273. 615.69 s [nothunks] include containers-0.6.7
  12274. 615.69 s [nothunks] include ghc-heap-9.4.8
  12275. 615.69 s [nothunks] include stm-2.5.1.0
  12276. 615.69 s [nothunks] include text-2.0.2
  12277. 615.69 s [nothunks] include time-1.12.2
  12278. 615.69 s [nothunks] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  12279. 615.69 s [nothunks] include wherefrom-compat-0.1.1.1-Fap3ZmGHzdB3Wg273lxrCv
  12280. 615.69 s [nothunks] component nothunks-0.3.1-K9S0WIJxvqMEavxCiCjJ4h-nothunks-test
  12281. 615.69 s [nothunks] include base-4.17.2.1
  12282. 615.69 s [nothunks] include containers-0.6.7
  12283. 615.69 s [nothunks] include ghc-prim-0.9.1
  12284. 615.69 s [nothunks] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  12285. 615.69 s [nothunks] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12286. 615.69 s [nothunks] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  12287. 615.69 s [nothunks] include stm-2.5.1.0
  12288. 615.69 s [nothunks] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  12289. 615.69 s [nothunks] include tasty-hedgehog-1.4.0.2-BgX8W8M8oIwAdbpIwgsjQ3
  12290. 615.69 s [nothunks] Linked component graph:
  12291. 615.69 s [nothunks] unit nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12292. 615.69 s [nothunks] include base-4.17.2.1
  12293. 615.69 s [nothunks] include bytestring-0.11.5.3
  12294. 615.69 s [nothunks] include containers-0.6.7
  12295. 615.69 s [nothunks] include ghc-heap-9.4.8
  12296. 615.69 s [nothunks] include stm-2.5.1.0
  12297. 615.69 s [nothunks] include text-2.0.2
  12298. 615.69 s [nothunks] include time-1.12.2
  12299. 615.69 s [nothunks] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  12300. 615.69 s [nothunks] include wherefrom-compat-0.1.1.1-Fap3ZmGHzdB3Wg273lxrCv
  12301. 615.69 s [nothunks] NoThunks.Class=nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb:NoThunks.Class
  12302. 615.69 s [nothunks] unit nothunks-0.3.1-K9S0WIJxvqMEavxCiCjJ4h-nothunks-test
  12303. 615.69 s [nothunks] include base-4.17.2.1
  12304. 615.69 s [nothunks] include containers-0.6.7
  12305. 615.69 s [nothunks] include ghc-prim-0.9.1
  12306. 615.69 s [nothunks] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  12307. 615.69 s [nothunks] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12308. 615.69 s [nothunks] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  12309. 615.70 s [nothunks] include stm-2.5.1.0
  12310. 615.70 s [nothunks] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  12311. 615.70 s [nothunks] include tasty-hedgehog-1.4.0.2-BgX8W8M8oIwAdbpIwgsjQ3
  12312. 615.70 s [nothunks] Ready component graph:
  12313. 615.70 s [nothunks] definite nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12314. 615.70 s [nothunks] depends base-4.17.2.1
  12315. 615.70 s [nothunks] depends bytestring-0.11.5.3
  12316. 615.70 s [nothunks] depends containers-0.6.7
  12317. 615.70 s [nothunks] depends ghc-heap-9.4.8
  12318. 615.70 s [nothunks] depends stm-2.5.1.0
  12319. 615.70 s [nothunks] depends text-2.0.2
  12320. 615.70 s [nothunks] depends time-1.12.2
  12321. 615.70 s [nothunks] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  12322. 615.70 s [nothunks] depends wherefrom-compat-0.1.1.1-Fap3ZmGHzdB3Wg273lxrCv
  12323. 615.70 s [nothunks] definite nothunks-0.3.1-K9S0WIJxvqMEavxCiCjJ4h-nothunks-test
  12324. 615.70 s [nothunks] depends base-4.17.2.1
  12325. 615.70 s [nothunks] depends containers-0.6.7
  12326. 615.70 s [nothunks] depends ghc-prim-0.9.1
  12327. 615.70 s [nothunks] depends hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  12328. 615.70 s [nothunks] depends nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12329. 615.70 s [nothunks] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  12330. 615.70 s [nothunks] depends stm-2.5.1.0
  12331. 615.70 s [nothunks] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  12332. 615.70 s [nothunks] depends tasty-hedgehog-1.4.0.2-BgX8W8M8oIwAdbpIwgsjQ3
  12333. 615.70 s [nothunks] Using Cabal-3.8.1.0 compiled by ghc-9.4
  12334. 615.70 s [nothunks] Using compiler: ghc-9.4.8
  12335. 615.70 s [nothunks] Using install prefix:
  12336. 615.70 s [nothunks] /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1
  12337. 615.70 s [nothunks] Executables installed in:
  12338. 615.70 s [nothunks] /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1/bin
  12339. 615.70 s [nothunks] Libraries installed in:
  12340. 615.70 s [nothunks] /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12341. 615.70 s [nothunks] Dynamic Libraries installed in:
  12342. 615.70 s [nothunks] /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  12343. 615.70 s [nothunks] Private executables installed in:
  12344. 615.70 s [nothunks] /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.4.8/nothunks-0.3.1
  12345. 615.70 s [nothunks] Data files installed in:
  12346. 615.70 s [nothunks] /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1/share/x86_64-linux-ghc-9.4.8/nothunks-0.3.1
  12347. 615.70 s [nothunks] Documentation installed in:
  12348. 615.70 s [nothunks] /nix/store/0mzwj93h3a4jdd8akc376q54yj85gfvi-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  12349. 615.70 s [nothunks] Configuration files installed in:
  12350. 615.70 s [nothunks] /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1/etc
  12351. 615.70 s [nothunks] No alex found
  12352. 615.70 s [nothunks] Using ar found on system at:
  12353. 615.70 s [nothunks] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  12354. 615.70 s [nothunks] No c2hs found
  12355. 615.70 s [nothunks] No cpphs found
  12356. 615.70 s [nothunks] No doctest found
  12357. 615.70 s [nothunks] Using gcc version 14.3.0 given by user at:
  12358. 615.70 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  12359. 615.70 s [nothunks] Using ghc version 9.4.8 found on system at:
  12360. 615.70 s [nothunks] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc
  12361. 615.70 s [nothunks] Using ghc-pkg version 9.4.8 found on system at:
  12362. 615.70 s [nothunks] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc-pkg-9.4.8
  12363. 615.70 s [nothunks] No ghcjs found
  12364. 615.70 s [nothunks] No ghcjs-pkg found
  12365. 615.70 s [nothunks] No greencard found
  12366. 615.70 s [nothunks] Using haddock version 2.27.0 found on system at:
  12367. 615.70 s [nothunks] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/haddock-ghc-9.4.8
  12368. 615.70 s [nothunks] No happy found
  12369. 615.70 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  12370. 615.70 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  12371. 615.70 s [nothunks] No hmake found
  12372. 615.70 s [nothunks] Using hpc version 0.68 found on system at:
  12373. 615.70 s [nothunks] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hpc
  12374. 615.70 s [nothunks] Using hsc2hs version 0.68.8 found on system at:
  12375. 615.70 s [nothunks] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hsc2hs
  12376. 615.70 s [nothunks] Using hscolour version 1.25 found on system at:
  12377. 615.70 s [nothunks] /nix/store/iqxq9idsxcwnhgibgzzj6w82ba81jia4-hscolour-1.25/bin/HsColour
  12378. 615.70 s [nothunks] No jhc found
  12379. 615.70 s [nothunks] Using ld found on system at:
  12380. 615.70 s [nothunks] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  12381. 615.70 s [nothunks] No pkg-config found
  12382. 615.70 s [nothunks] Using runghc version 9.4.8 found on system at:
  12383. 615.70 s [nothunks] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/runghc-9.4.8
  12384. 615.70 s [nothunks] Using strip version 2.44 found on system at:
  12385. 615.70 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  12386. 615.70 s [nothunks] Using tar found on system at:
  12387. 615.70 s [nothunks] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  12388. 615.70 s [nothunks] No uhc found
  12389. 615.71 s [nothunks] Phase: buildPhase
  12390. 615.78 s [nothunks] Preprocessing library for nothunks-0.3.1..
  12391. 615.78 s [nothunks] Building library for nothunks-0.3.1..
  12392. 615.89 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  12393. 617.92 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  12394. 620.89 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  12395. 620.89 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1..
  12396. 621.02 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 )
  12397. 623.03 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  12398. 623.31 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  12399. 624.07 s [nothunks] Phase: checkPhase
  12400. 624.10 s [nothunks] Running 1 test suites...
  12401. 624.10 s [nothunks] Test suite nothunks-test: RUNNING...
  12402. 624.10 s [nothunks] Tests
  12403. 624.10 s [nothunks] NoThunks.Class
  12404. 624.10 s [nothunks] Sanity
  12405. 624.10 s [nothunks] IntNotNF: OK
  12406. 624.10 s [nothunks] ✓ <interactive> passed 1 test.
  12407. 624.10 s [nothunks] IntIsNF: OK
  12408. 624.10 s [nothunks] ✓ <interactive> passed 1 test.
  12409. 624.10 s [nothunks] Pair: OK
  12410. 624.10 s [nothunks] ✓ <interactive> passed 1 test.
  12411. 624.10 s [nothunks] Sum: OK
  12412. 624.10 s [nothunks] ✓ <interactive> passed 1 test.
  12413. 624.10 s [nothunks] Fn: OK
  12414. 624.10 s [nothunks] ✓ <interactive> passed 1 test.
  12415. 624.10 s [nothunks] IO: OK
  12416. 624.10 s [nothunks] ✓ <interactive> passed 1 test.
  12417. 624.10 s [nothunks] InspectHeap
  12418. 624.12 s [nothunks] Int: OK
  12419. 624.13 s [nothunks] ✓ <interactive> passed 1000 tests.
  12420. 624.13 s [nothunks] Just ["Int"] 48% █████████▌··········
  12421. 624.13 s [nothunks] Nothing 52% ██████████▍·········
  12422. 624.15 s [nothunks] IntInt: OK (0.02s)
  12423. 624.15 s [nothunks] ✓ <interactive> passed 1000 tests.
  12424. 624.15 s [nothunks] Just ["(,)"] 50% ██████████··········
  12425. 624.15 s [nothunks] Just ["Int","(,)"] 37% ███████▍············
  12426. 624.15 s [nothunks] Nothing 12% ██▍·················
  12427. 624.15 s [nothunks] SumInt: OK (0.01s)
  12428. 624.15 s [nothunks] ✓ <interactive> passed 1000 tests.
  12429. 624.15 s [nothunks] Just ["Either"] 32% ██████▍·············
  12430. 624.15 s [nothunks] Just ["Int","Either"] 34% ██████▋·············
  12431. 624.15 s [nothunks] Nothing 34% ██████▊·············
  12432. 624.17 s [nothunks] ListInt: OK
  12433. 624.17 s [nothunks] ✓ <interactive> passed 1000 tests.
  12434. 624.17 s [nothunks] Just ["Int","[]"] 23% ████▋···············
  12435. 624.17 s [nothunks] Just ["[]"] 43% ████████▌···········
  12436. 624.17 s [nothunks] Nothing 34% ██████▊·············
  12437. 624.20 s [nothunks] IntListInt: OK (0.02s)
  12438. 624.20 s [nothunks] ✓ <interactive> passed 1000 tests.
  12439. 624.20 s [nothunks] Just ["(,)"] 51% ██████████▏·········
  12440. 624.20 s [nothunks] Just ["Int","(,)"] 24% ████▊···············
  12441. 624.20 s [nothunks] Just ["Int","[]","(,)"] 5% ▉···················
  12442. 624.20 s [nothunks] Just ["[]","(,)"] 11% ██▏·················
  12443. 624.20 s [nothunks] Nothing 9% █▋··················
  12444. 624.21 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  12445. 624.21 s [nothunks] after 10 tests.
  12446. 624.21 s [nothunks] shrink path: 10:
  12447. 624.21 s [nothunks] Just ["Int","Seq"] 20% ████················
  12448. 624.21 s [nothunks] Nothing 70% ██████████████······
  12449. 624.21 s [nothunks]
  12450. 624.21 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  12451. 624.21 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  12452. 624.21 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  12453. 624.21 s [nothunks] 168 ┃ -> Proxy a
  12454. 624.21 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  12455. 624.21 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  12456. 624.21 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  12457. 624.21 s [nothunks] 172 ┃ -> Property
  12458. 624.21 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  12459. 624.21 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  12460. 624.21 s [nothunks] ┃ │ Wrap
  12461. 624.21 s [nothunks] ┃ │ { unwrap =
  12462. 624.21 s [nothunks] ┃ │ SeqEnqueue
  12463. 624.21 s [nothunks] ┃ │ (IntValue 0)
  12464. 624.21 s [nothunks] ┃ │ (SeqEnqueue
  12465. 624.21 s [nothunks] ┃ │ (IntValue 0)
  12466. 624.21 s [nothunks] ┃ │ (SeqEnqueue
  12467. 624.21 s [nothunks] ┃ │ (IntValue 0)
  12468. 624.21 s [nothunks] ┃ │ (SeqEnqueue
  12469. 624.21 s [nothunks] ┃ │ (IntValue 0)
  12470. 624.21 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  12471. 624.21 s [nothunks] ┃ │ }
  12472. 624.21 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  12473. 624.21 s [nothunks] 176 ┃ fromModel m $ \a -> do
  12474. 624.21 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  12475. 624.21 s [nothunks] ┃ │ IsNF
  12476. 624.21 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  12477. 624.21 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  12478. 624.21 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  12479. 624.21 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  12480. 624.21 s [nothunks] ┃ │ - Just
  12481. 624.21 s [nothunks] ┃ │ - ThunkInfo
  12482. 624.21 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  12483. 624.21 s [nothunks] ┃ │ + Nothing
  12484. 624.21 s [nothunks]
  12485. 624.21 s [nothunks] This failure can be reproduced by running:
  12486. 624.21 s [nothunks] > recheckAt (Seed 16231639746199804772 16616025332614045583) "10:" EXPECTED FAILURE
  12487. 624.21 s [nothunks]
  12488. 624.21 s [nothunks] OK (0.02s)
  12489. 624.21 s [nothunks] ✓ <interactive> passed 1 test.
  12490. 624.21 s [nothunks] Model
  12491. 624.23 s [nothunks] Int: OK (0.01s)
  12492. 624.23 s [nothunks] ✓ <interactive> passed 1000 tests.
  12493. 624.23 s [nothunks] Just ["Int"] 52% ██████████▎·········
  12494. 624.23 s [nothunks] Nothing 48% █████████▋··········
  12495. 624.25 s [nothunks] IntInt: OK (0.02s)
  12496. 624.25 s [nothunks] ✓ <interactive> passed 1000 tests.
  12497. 624.25 s [nothunks] Just ["(,)"] 48% █████████▋··········
  12498. 624.25 s [nothunks] Just ["Int","(,)"] 39% ███████▉············
  12499. 624.25 s [nothunks] Nothing 12% ██▍·················
  12500. 624.25 s [nothunks] SumInt: OK (0.01s)
  12501. 624.25 s [nothunks] ✓ <interactive> passed 1000 tests.
  12502. 624.25 s [nothunks] Just ["Either"] 34% ██████▋·············
  12503. 624.25 s [nothunks] Just ["Int","Either"] 34% ██████▉·············
  12504. 624.25 s [nothunks] Nothing 32% ██████▍·············
  12505. 624.27 s [nothunks] ListInt: OK
  12506. 624.27 s [nothunks] ✓ <interactive> passed 1000 tests.
  12507. 624.27 s [nothunks] Just ["Int","[]"] 24% ████▊···············
  12508. 624.27 s [nothunks] Just ["[]"] 44% ████████▊···········
  12509. 624.27 s [nothunks] Nothing 32% ██████▍·············
  12510. 624.31 s [nothunks] IntListInt: OK (0.02s)
  12511. 624.31 s [nothunks] ✓ <interactive> passed 1000 tests.
  12512. 624.31 s [nothunks] Just ["(,)"] 50% ██████████··········
  12513. 624.31 s [nothunks] Just ["Int","(,)"] 24% ████▉···············
  12514. 624.31 s [nothunks] Just ["Int","[]","(,)"] 5% █···················
  12515. 624.31 s [nothunks] Just ["[]","(,)"] 10% ██··················
  12516. 624.31 s [nothunks] Nothing 10% █▉··················
  12517. 624.38 s [nothunks] SeqInt: OK (0.07s)
  12518. 624.38 s [nothunks] ✓ <interactive> passed 1000 tests.
  12519. 624.38 s [nothunks] Just ["Int","Seq"] 47% █████████▍··········
  12520. 624.38 s [nothunks] Nothing 53% ██████████▌·········
  12521. 624.39 s [nothunks] AllowThunksIn: OK (0.03s)
  12522. 624.39 s [nothunks] ✓ <interactive> passed 1000 tests.
  12523. 624.39 s [nothunks] Just ["Int","field2","Record"] 24% ████▉···············
  12524. 624.39 s [nothunks] Just ["Record"] 49% █████████▋··········
  12525. 624.39 s [nothunks] Nothing 27% █████▍··············
  12526. 624.40 s [nothunks] Fn: OK
  12527. 624.41 s [nothunks] ✓ <interactive> passed 1000 tests.
  12528. 624.41 s [nothunks] Just ["->"] 25% █████···············
  12529. 624.41 s [nothunks] Nothing 75% ██████████████▉·····
  12530. 624.41 s [nothunks] IO: OK
  12531. 624.41 s [nothunks] ✓ <interactive> passed 1000 tests.
  12532. 624.41 s [nothunks] Just ["IO"] 23% ████▌···············
  12533. 624.41 s [nothunks] Nothing 77% ███████████████▍····
  12534. 624.43 s [nothunks] ThunkFreeFn: OK (0.01s)
  12535. 624.43 s [nothunks] ✓ <interactive> passed 1000 tests.
  12536. 624.43 s [nothunks] Just ["->"] 25% █████···············
  12537. 624.43 s [nothunks] Just ["...","->"] 38% ███████▌············
  12538. 624.43 s [nothunks] Nothing 37% ███████▍············
  12539. 624.43 s [nothunks] ThunkFreeIO: OK (0.01s)
  12540. 624.43 s [nothunks] ✓ <interactive> passed 1000 tests.
  12541. 624.43 s [nothunks] Just ["...","IO"] 38% ███████▌············
  12542. 624.43 s [nothunks] Just ["IO"] 24% ████▊···············
  12543. 624.43 s [nothunks] Nothing 39% ███████▋············
  12544. 624.43 s [nothunks] MutableVars
  12545. 624.43 s [nothunks] IORef
  12546. 624.43 s [nothunks] NotNF: OK
  12547. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12548. 624.43 s [nothunks] NF: OK
  12549. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12550. 624.43 s [nothunks] NotNFPure: OK
  12551. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12552. 624.43 s [nothunks] NFPure: OK
  12553. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12554. 624.43 s [nothunks] NotNFAtomically: OK
  12555. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12556. 624.43 s [nothunks] NFAtomically: OK
  12557. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12558. 624.43 s [nothunks] MVar
  12559. 624.43 s [nothunks] NotNF: OK
  12560. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12561. 624.43 s [nothunks] NF: OK
  12562. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12563. 624.43 s [nothunks] NotNFPure: OK
  12564. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12565. 624.43 s [nothunks] NFPure: OK
  12566. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12567. 624.43 s [nothunks] NotNFAtomically: OK
  12568. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12569. 624.43 s [nothunks] NFAtomically: OK
  12570. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12571. 624.43 s [nothunks] TVar
  12572. 624.43 s [nothunks] NotNF: OK
  12573. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12574. 624.43 s [nothunks] NF: OK
  12575. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12576. 624.43 s [nothunks] NotNFPure: OK
  12577. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12578. 624.43 s [nothunks] NFPure: OK
  12579. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12580. 624.43 s [nothunks] NotNFAtomically: OK
  12581. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12582. 624.43 s [nothunks] NFAtomically: OK
  12583. 624.43 s [nothunks] ✓ <interactive> passed 1 test.
  12584. 624.43 s [nothunks]
  12585. 624.43 s [nothunks] All 41 tests passed (0.33s)
  12586. 624.43 s [nothunks] Test suite nothunks-test: PASS
  12587. 624.43 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  12588. 624.43 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  12589. 624.46 s [nothunks] Phase: haddockPhase
  12590. 624.62 s [nothunks] Preprocessing library for nothunks-0.3.1..
  12591. 624.62 s [nothunks] Running Haddock on library for nothunks-0.3.1..
  12592. 624.62 s [nothunks] Warning: The documentation for the following packages are not installed. No
  12593. 624.62 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  12594. 624.68 s [nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  12595. 625.00 s [nothunks] Warning: 'GHC' is out of scope.
  12596. 625.00 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  12597. 625.00 s [nothunks] Warning: 'a' is out of scope.
  12598. 625.00 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  12599. 625.00 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  12600. 625.00 s [nothunks] Missing documentation for:
  12601. 625.00 s [nothunks] Module header
  12602. 625.23 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  12603. 625.23 s [nothunks]
  12604. 625.23 s [nothunks] - NoThunks.Class.GShowTypeOf
  12605. 625.24 s [nothunks] - NoThunks.Class.checkContainsThunks
  12606. 625.24 s [nothunks] - Data.Vector.Vector
  12607. 625.24 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  12608. 625.24 s [nothunks] - NoThunks.Class.HasFields
  12609. 625.24 s [nothunks] - NoThunks.Class.GWRecordField
  12610. 625.24 s [nothunks] - NoThunks.Class.Elem
  12611. 627.15 s [nothunks] Documentation created: dist/doc/html/nothunks/index.html,
  12612. 627.15 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  12613. 627.20 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  12614. 627.21 s [nothunks] Phase: installPhase
  12615. 627.27 s [nothunks] Installing library in /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12616. 627.50 s [nothunks] Phase: fixupPhase
  12617. 627.52 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1
  12618. 627.53 s [nothunks] shrinking /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSnothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb-ghc9.4.8.so
  12619. 627.54 s [nothunks] checking for references to /build/ in /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1...
  12620. 627.56 s [nothunks] patching script interpreter paths in /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1
  12621. 627.56 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1/lib
  12622. 627.64 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/0mzwj93h3a4jdd8akc376q54yj85gfvi-nothunks-0.3.1-doc
  12623. 627.65 s [nothunks] checking for references to /build/ in /nix/store/0mzwj93h3a4jdd8akc376q54yj85gfvi-nothunks-0.3.1-doc...
  12624. 627.67 s [nothunks] patching script interpreter paths in /nix/store/0mzwj93h3a4jdd8akc376q54yj85gfvi-nothunks-0.3.1-doc
  12625. 627.78 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/0mzwj93h3a4jdd8akc376q54yj85gfvi-nothunks-0.3.1-doc /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1
  12626. 628.27 s [post-build-hook] Pushing 2 paths (67 are already present) using zstd to cache sellout ⏳
  12627. 628.27 s [post-build-hook]
  12628. 628.71 s [post-build-hook] Pushing /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1 (2.96 MiB)
  12629. 628.80 s [post-build-hook] Pushing /nix/store/0mzwj93h3a4jdd8akc376q54yj85gfvi-nothunks-0.3.1-doc (889.48 KiB)
  12630. 629.77 s [post-build-hook]
  12631. 629.77 s [post-build-hook] All done.
  12632. 629.79 s [post-build-hook] Uploading to the NixCI cache: /nix/store/0mzwj93h3a4jdd8akc376q54yj85gfvi-nothunks-0.3.1-doc /nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1
  12633. 629.84 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12634. 630.04 s [post-build-hook] copying 2 paths...
  12635. 630.04 s [post-build-hook] copying path '/nix/store/0mzwj93h3a4jdd8akc376q54yj85gfvi-nothunks-0.3.1-doc' to 'https://cache.nix-ci.com'...
  12636. 630.40 s [post-build-hook] copying path '/nix/store/aykgc9x3ii3jyykr20kn08k172p753y2-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  12637. 631.21 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12638. 631.47 s [post-build-hook] copying 1 paths...
  12639. 631.47 s [post-build-hook] copying path '/nix/store/f9xjlcvphw4jf35k1bpnafzrdah4f9wq-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...
  12640. 631.70 s Progress: 2 of 10 built, 152 of 152 downloaded from cache
  12641. 631.74 s Building unordered-containers
  12642. 631.86 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  12643. 631.87 s [unordered-containers] Build with /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8.
  12644. 632.04 s [unordered-containers] Phase: unpackPhase
  12645. 632.05 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  12646. 632.06 s [unordered-containers] source root is unordered-containers-0.2.20.1
  12647. 632.06 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  12648. 632.07 s [unordered-containers] Phase: patchPhase
  12649. 632.08 s [unordered-containers] Phase: compileBuildDriverPhase
  12650. 632.08 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.azeczYGS8k/setup-package.conf.d -threaded
  12651. 632.12 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.azeczYGS8k/Main.o )
  12652. 632.18 s [unordered-containers] [2 of 2] Linking Setup
  12653. 633.16 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  12654. 633.17 s [unordered-containers] Phase: configurePhase
  12655. 633.18 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/0wgc8frd6vzqfl21i9q7ch8h4h6bhs3l-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.azeczYGS8k/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  12656. 633.60 s [unordered-containers] Using Parsec parser
  12657. 633.60 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  12658. 633.60 s [unordered-containers] Flags chosen: debug=False
  12659. 633.60 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.17.2.1
  12660. 633.60 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.4.8.0
  12661. 633.60 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
  12662. 633.60 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.19.0.0
  12663. 633.60 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  12664. 633.60 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  12665. 633.60 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  12666. 633.60 s [unordered-containers] Dependency base: using base-4.17.2.1
  12667. 633.60 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.6.7
  12668. 633.60 s [unordered-containers] Dependency hashable: using hashable-1.4.7.0
  12669. 633.60 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  12670. 633.60 s [unordered-containers] Dependency random: using random-1.2.1.3
  12671. 633.60 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  12672. 633.60 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  12673. 633.60 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  12674. 633.60 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  12675. 633.83 s [unordered-containers] Source component graph:
  12676. 633.83 s [unordered-containers] component lib
  12677. 633.83 s [unordered-containers] component test:unordered-containers-tests dependency lib
  12678. 633.87 s [unordered-containers] Configured component graph:
  12679. 633.88 s [unordered-containers] component unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  12680. 633.88 s [unordered-containers] include base-4.17.2.1
  12681. 633.88 s [unordered-containers] include deepseq-1.4.8.0
  12682. 633.88 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  12683. 633.88 s [unordered-containers] include template-haskell-2.19.0.0
  12684. 633.88 s [unordered-containers] component unordered-containers-0.2.20.1-67yuju4pA8f8jDWOVFHmAh-unordered-containers-tests
  12685. 633.88 s [unordered-containers] include ChasingBottoms-1.3.1.17-EahLsxrTNYO3WMAx9yFZkq
  12686. 633.88 s [unordered-containers] include HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  12687. 633.88 s [unordered-containers] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  12688. 633.88 s [unordered-containers] include base-4.17.2.1
  12689. 633.88 s [unordered-containers] include containers-0.6.7
  12690. 633.88 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  12691. 633.88 s [unordered-containers] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12692. 633.88 s [unordered-containers] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  12693. 633.88 s [unordered-containers] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  12694. 633.88 s [unordered-containers] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  12695. 633.88 s [unordered-containers] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  12696. 633.88 s [unordered-containers] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  12697. 633.88 s [unordered-containers] Linked component graph:
  12698. 633.88 s [unordered-containers] unit unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  12699. 633.88 s [unordered-containers] include base-4.17.2.1
  12700. 633.88 s [unordered-containers] include deepseq-1.4.8.0
  12701. 633.88 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  12702. 633.88 s [unordered-containers] include template-haskell-2.19.0.0
  12703. 633.88 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashSet.Internal
  12704. 633.88 s [unordered-containers] unit unordered-containers-0.2.20.1-67yuju4pA8f8jDWOVFHmAh-unordered-containers-tests
  12705. 633.88 s [unordered-containers] include ChasingBottoms-1.3.1.17-EahLsxrTNYO3WMAx9yFZkq
  12706. 633.88 s [unordered-containers] include HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  12707. 633.88 s [unordered-containers] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  12708. 633.88 s [unordered-containers] include base-4.17.2.1
  12709. 633.88 s [unordered-containers] include containers-0.6.7
  12710. 633.88 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  12711. 633.88 s [unordered-containers] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12712. 633.88 s [unordered-containers] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  12713. 633.88 s [unordered-containers] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  12714. 633.88 s [unordered-containers] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  12715. 633.88 s [unordered-containers] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  12716. 633.88 s [unordered-containers] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  12717. 633.88 s [unordered-containers] Ready component graph:
  12718. 633.88 s [unordered-containers] definite unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  12719. 633.88 s [unordered-containers] depends base-4.17.2.1
  12720. 633.88 s [unordered-containers] depends deepseq-1.4.8.0
  12721. 633.88 s [unordered-containers] depends hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  12722. 633.88 s [unordered-containers] depends template-haskell-2.19.0.0
  12723. 633.88 s [unordered-containers] definite unordered-containers-0.2.20.1-67yuju4pA8f8jDWOVFHmAh-unordered-containers-tests
  12724. 633.88 s [unordered-containers] depends ChasingBottoms-1.3.1.17-EahLsxrTNYO3WMAx9yFZkq
  12725. 633.88 s [unordered-containers] depends HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  12726. 633.88 s [unordered-containers] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  12727. 633.88 s [unordered-containers] depends base-4.17.2.1
  12728. 633.88 s [unordered-containers] depends containers-0.6.7
  12729. 633.88 s [unordered-containers] depends hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  12730. 633.88 s [unordered-containers] depends nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  12731. 633.88 s [unordered-containers] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  12732. 633.88 s [unordered-containers] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  12733. 633.88 s [unordered-containers] depends tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  12734. 633.88 s [unordered-containers] depends tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  12735. 633.88 s [unordered-containers] depends unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  12736. 633.88 s [unordered-containers] Using Cabal-3.8.1.0 compiled by ghc-9.4
  12737. 633.88 s [unordered-containers] Using compiler: ghc-9.4.8
  12738. 633.88 s [unordered-containers] Using install prefix:
  12739. 633.88 s [unordered-containers] /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1
  12740. 633.88 s [unordered-containers] Executables installed in:
  12741. 633.88 s [unordered-containers] /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1/bin
  12742. 633.88 s [unordered-containers] Libraries installed in:
  12743. 633.88 s [unordered-containers] /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  12744. 633.88 s [unordered-containers] Dynamic Libraries installed in:
  12745. 633.88 s [unordered-containers] /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  12746. 633.88 s [unordered-containers] Private executables installed in:
  12747. 633.88 s [unordered-containers] /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1
  12748. 633.88 s [unordered-containers] Data files installed in:
  12749. 633.88 s [unordered-containers] /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1
  12750. 633.88 s [unordered-containers] Documentation installed in:
  12751. 633.88 s [unordered-containers] /nix/store/0wgc8frd6vzqfl21i9q7ch8h4h6bhs3l-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  12752. 633.88 s [unordered-containers] Configuration files installed in:
  12753. 633.88 s [unordered-containers] /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1/etc
  12754. 633.88 s [unordered-containers] No alex found
  12755. 633.88 s [unordered-containers] Using ar found on system at:
  12756. 633.88 s [unordered-containers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  12757. 633.88 s [unordered-containers] No c2hs found
  12758. 633.88 s [unordered-containers] No cpphs found
  12759. 633.88 s [unordered-containers] No doctest found
  12760. 633.88 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  12761. 633.88 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  12762. 633.88 s [unordered-containers] Using ghc version 9.4.8 found on system at:
  12763. 633.88 s [unordered-containers] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc
  12764. 633.88 s [unordered-containers] Using ghc-pkg version 9.4.8 found on system at:
  12765. 633.88 s [unordered-containers] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc-pkg-9.4.8
  12766. 633.88 s [unordered-containers] No ghcjs found
  12767. 633.88 s [unordered-containers] No ghcjs-pkg found
  12768. 633.88 s [unordered-containers] No greencard found
  12769. 633.88 s [unordered-containers] Using haddock version 2.27.0 found on system at:
  12770. 633.88 s [unordered-containers] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/haddock-ghc-9.4.8
  12771. 633.88 s [unordered-containers] No happy found
  12772. 633.88 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  12773. 633.88 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  12774. 633.88 s [unordered-containers] No hmake found
  12775. 633.88 s [unordered-containers] Using hpc version 0.68 found on system at:
  12776. 633.88 s [unordered-containers] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hpc
  12777. 633.88 s [unordered-containers] Using hsc2hs version 0.68.8 found on system at:
  12778. 633.88 s [unordered-containers] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hsc2hs
  12779. 633.88 s [unordered-containers] Using hscolour version 1.25 found on system at:
  12780. 633.88 s [unordered-containers] /nix/store/iqxq9idsxcwnhgibgzzj6w82ba81jia4-hscolour-1.25/bin/HsColour
  12781. 633.88 s [unordered-containers] No jhc found
  12782. 633.88 s [unordered-containers] Using ld found on system at:
  12783. 633.88 s [unordered-containers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  12784. 633.88 s [unordered-containers] No pkg-config found
  12785. 633.88 s [unordered-containers] Using runghc version 9.4.8 found on system at:
  12786. 633.88 s [unordered-containers] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/runghc-9.4.8
  12787. 633.88 s [unordered-containers] Using strip version 2.44 found on system at:
  12788. 633.88 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  12789. 633.88 s [unordered-containers] Using tar found on system at:
  12790. 633.88 s [unordered-containers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  12791. 633.88 s [unordered-containers] No uhc found
  12792. 633.88 s [unordered-containers] Phase: buildPhase
  12793. 633.91 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  12794. 633.91 s [unordered-containers] Building library for unordered-containers-0.2.20.1..
  12795. 634.16 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 )
  12796. 634.78 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 )
  12797. 634.78 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 )
  12798. 640.82 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 )
  12799. 641.09 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 )
  12800. 642.50 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 )
  12801. 642.50 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  12802. 642.50 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 )
  12803. 642.52 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o, dist/build/Data/HashMap/Lazy.dyn_o )
  12804. 642.93 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  12805. 643.66 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  12806. 643.66 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  12807. 650.41 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  12808. 650.89 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  12809. 652.64 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  12810. 652.64 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  12811. 652.64 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  12812. 652.75 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  12813. 654.04 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  12814. 654.04 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  12815. 654.23 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 )
  12816. 654.47 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  12817. 656.39 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 )
  12818. 656.43 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  12819. 656.43 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 )
  12820. 656.43 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 )
  12821. 661.50 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 )
  12822. 661.53 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  12823. 661.53 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  12824. 661.97 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  12825. 662.80 s [unordered-containers] Phase: checkPhase
  12826. 662.82 s [unordered-containers] Running 1 test suites...
  12827. 662.82 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  12828. 662.83 s [unordered-containers] All
  12829. 662.83 s [unordered-containers] Properties
  12830. 662.83 s [unordered-containers] Data.HashMap.Lazy
  12831. 662.83 s [unordered-containers] instances
  12832. 662.83 s [unordered-containers] Eq
  12833. 662.84 s [unordered-containers] ==: OK (0.01s)
  12834. 662.84 s [unordered-containers] +++ OK, passed 100 tests.
  12835. 662.84 s [unordered-containers] /=: OK (0.01s)
  12836. 662.84 s [unordered-containers] +++ OK, passed 100 tests.
  12837. 662.84 s [unordered-containers] Ord
  12838. 662.84 s [unordered-containers] compare reflexive: OK
  12839. 662.84 s [unordered-containers] +++ OK, passed 100 tests.
  12840. 662.84 s [unordered-containers] compare transitive: OK (0.01s)
  12841. 662.84 s [unordered-containers] +++ OK, passed 100 tests.
  12842. 662.84 s [unordered-containers] compare antisymmetric: OK
  12843. 662.84 s [unordered-containers] +++ OK, passed 100 tests.
  12844. 662.84 s [unordered-containers] Ord => Eq: OK
  12845. 662.84 s [unordered-containers] +++ OK, passed 100 tests.
  12846. 663.00 s [unordered-containers] Read/Show: OK (0.14s)
  12847. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12848. 663.00 s [unordered-containers] Functor: OK (0.02s)
  12849. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12850. 663.00 s [unordered-containers] Foldable: OK (0.01s)
  12851. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12852. 663.00 s [unordered-containers] Bifoldable
  12853. 663.00 s [unordered-containers] bifoldMap: OK
  12854. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12855. 663.00 s [unordered-containers] bifoldr: OK (0.01s)
  12856. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12857. 663.00 s [unordered-containers] bifoldl: OK (0.01s)
  12858. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12859. 663.00 s [unordered-containers] Hashable: OK (0.02s)
  12860. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12861. 663.00 s [unordered-containers] empty
  12862. 663.00 s [unordered-containers] valid: OK
  12863. 663.00 s [unordered-containers] +++ OK, passed 1 test.
  12864. 663.00 s [unordered-containers] singleton
  12865. 663.00 s [unordered-containers] valid: OK
  12866. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12867. 663.00 s [unordered-containers] size: OK
  12868. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12869. 663.00 s [unordered-containers] member: OK
  12870. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12871. 663.00 s [unordered-containers] lookup: OK
  12872. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12873. 663.00 s [unordered-containers] !?: OK
  12874. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12875. 663.00 s [unordered-containers] insert
  12876. 663.00 s [unordered-containers] model: OK
  12877. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12878. 663.00 s [unordered-containers] valid: OK
  12879. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12880. 663.00 s [unordered-containers] insertWith
  12881. 663.00 s [unordered-containers] insertWith: OK
  12882. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12883. 663.00 s [unordered-containers] valid: OK
  12884. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12885. 663.00 s [unordered-containers] delete
  12886. 663.00 s [unordered-containers] model: OK
  12887. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12888. 663.00 s [unordered-containers] valid: OK
  12889. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12890. 663.00 s [unordered-containers] adjust
  12891. 663.00 s [unordered-containers] model: OK
  12892. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12893. 663.00 s [unordered-containers] valid: OK
  12894. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12895. 663.00 s [unordered-containers] update
  12896. 663.00 s [unordered-containers] model: OK
  12897. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12898. 663.00 s [unordered-containers] valid: OK
  12899. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12900. 663.00 s [unordered-containers] alter
  12901. 663.00 s [unordered-containers] model: OK
  12902. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12903. 663.00 s [unordered-containers] valid: OK
  12904. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12905. 663.00 s [unordered-containers] alterF
  12906. 663.00 s [unordered-containers] model
  12907. 663.00 s [unordered-containers] []: OK (0.03s)
  12908. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12909. 663.00 s [unordered-containers] adjust: OK
  12910. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12911. 663.00 s [unordered-containers] insert: OK
  12912. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12913. 663.00 s [unordered-containers] insertWith: OK
  12914. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12915. 663.00 s [unordered-containers] delete: OK
  12916. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12917. 663.00 s [unordered-containers] lookup: OK
  12918. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12919. 663.00 s [unordered-containers] valid: OK (0.01s)
  12920. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12921. 663.00 s [unordered-containers] isSubmapOf
  12922. 663.00 s [unordered-containers] model: OK
  12923. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12924. 663.00 s [unordered-containers] m ⊆ m: OK
  12925. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12926. 663.00 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK
  12927. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12928. 663.00 s [unordered-containers] m1\m2 ⊆ m1: OK
  12929. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12930. 663.00 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK
  12931. 663.00 s [unordered-containers] +++ OK, passed 100 tests; 156 discarded.
  12932. 663.00 s [unordered-containers] delete k m ⊆ m: OK
  12933. 663.00 s [unordered-containers] +++ OK, passed 100 tests; 11 discarded.
  12934. 663.00 s [unordered-containers] m ⊈ delete k m : OK
  12935. 663.00 s [unordered-containers] +++ OK, passed 100 tests; 18 discarded.
  12936. 663.00 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  12937. 663.00 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  12938. 663.00 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  12939. 663.00 s [unordered-containers] +++ OK, passed 100 tests; 5 discarded.
  12940. 663.00 s [unordered-containers] union
  12941. 663.00 s [unordered-containers] model: OK (0.01s)
  12942. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12943. 663.00 s [unordered-containers] valid: OK (0.01s)
  12944. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12945. 663.00 s [unordered-containers] unionWith
  12946. 663.00 s [unordered-containers] model: OK (0.03s)
  12947. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12948. 663.00 s [unordered-containers] valid: OK
  12949. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12950. 663.00 s [unordered-containers] unionWithKey
  12951. 663.00 s [unordered-containers] model: OK (0.03s)
  12952. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12953. 663.00 s [unordered-containers] valid: OK
  12954. 663.00 s [unordered-containers] +++ OK, passed 100 tests.
  12955. 663.00 s [unordered-containers] unions
  12956. 663.27 s [unordered-containers] model: OK (0.42s)
  12957. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12958. 663.27 s [unordered-containers] valid: OK (0.24s)
  12959. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12960. 663.27 s [unordered-containers] difference
  12961. 663.27 s [unordered-containers] model: OK
  12962. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12963. 663.27 s [unordered-containers] valid: OK
  12964. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12965. 663.27 s [unordered-containers] differenceWith
  12966. 663.27 s [unordered-containers] model: OK
  12967. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12968. 663.27 s [unordered-containers] valid: OK
  12969. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12970. 663.27 s [unordered-containers] intersection
  12971. 663.27 s [unordered-containers] model: OK
  12972. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12973. 663.27 s [unordered-containers] valid: OK
  12974. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12975. 663.27 s [unordered-containers] intersectionWith
  12976. 663.27 s [unordered-containers] model: OK (0.01s)
  12977. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12978. 663.27 s [unordered-containers] valid: OK
  12979. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12980. 663.27 s [unordered-containers] intersectionWithKey
  12981. 663.27 s [unordered-containers] model: OK (0.01s)
  12982. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12983. 663.27 s [unordered-containers] valid: OK
  12984. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12985. 663.27 s [unordered-containers] compose
  12986. 663.27 s [unordered-containers] valid: OK (0.01s)
  12987. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12988. 663.27 s [unordered-containers] map
  12989. 663.27 s [unordered-containers] model: OK
  12990. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12991. 663.27 s [unordered-containers] valid: OK
  12992. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12993. 663.27 s [unordered-containers] traverseWithKey
  12994. 663.27 s [unordered-containers] model: OK (0.06s)
  12995. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12996. 663.27 s [unordered-containers] valid: OK
  12997. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  12998. 663.27 s [unordered-containers] mapKeys
  12999. 663.27 s [unordered-containers] model: OK
  13000. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13001. 663.27 s [unordered-containers] valid: OK (0.11s)
  13002. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13003. 663.27 s [unordered-containers] foldr: OK
  13004. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13005. 663.27 s [unordered-containers] foldl: OK
  13006. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13007. 663.27 s [unordered-containers] foldrWithKey: OK
  13008. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13009. 663.27 s [unordered-containers] foldlWithKey: OK (0.01s)
  13010. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13011. 663.27 s [unordered-containers] foldrWithKey': OK
  13012. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13013. 663.27 s [unordered-containers] foldlWithKey': OK
  13014. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13015. 663.27 s [unordered-containers] foldl': OK
  13016. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13017. 663.27 s [unordered-containers] foldr': OK
  13018. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13019. 663.27 s [unordered-containers] foldMapWithKey: OK
  13020. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13021. 663.27 s [unordered-containers] filter
  13022. 663.27 s [unordered-containers] model: OK (0.02s)
  13023. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13024. 663.27 s [unordered-containers] valid: OK
  13025. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13026. 663.27 s [unordered-containers] filterWithKey
  13027. 663.27 s [unordered-containers] model: OK (0.24s)
  13028. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13029. 663.27 s [unordered-containers] valid: OK (0.14s)
  13030. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13031. 663.27 s [unordered-containers] mapMaybe
  13032. 663.27 s [unordered-containers] model: OK (0.03s)
  13033. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13034. 663.27 s [unordered-containers] valid: OK (0.02s)
  13035. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13036. 663.27 s [unordered-containers] mapMaybeWithKey
  13037. 663.27 s [unordered-containers] model: OK (0.22s)
  13038. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13039. 663.27 s [unordered-containers] valid: OK (0.17s)
  13040. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13041. 663.27 s [unordered-containers] elems: OK (0.01s)
  13042. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13043. 663.27 s [unordered-containers] keys: OK (0.01s)
  13044. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13045. 663.27 s [unordered-containers] fromList
  13046. 663.27 s [unordered-containers] model: OK (0.02s)
  13047. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13048. 663.27 s [unordered-containers] valid: OK
  13049. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13050. 663.27 s [unordered-containers] fromListWith
  13051. 663.27 s [unordered-containers] model: OK
  13052. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13053. 663.27 s [unordered-containers] valid: OK (0.01s)
  13054. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13055. 663.27 s [unordered-containers] fromListWithKey
  13056. 663.27 s [unordered-containers] model: OK (0.01s)
  13057. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13058. 663.27 s [unordered-containers] valid: OK
  13059. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13060. 663.27 s [unordered-containers] toList: OK
  13061. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13062. 663.27 s [unordered-containers] Data.HashMap.Strict
  13063. 663.27 s [unordered-containers] instances
  13064. 663.27 s [unordered-containers] Eq
  13065. 663.27 s [unordered-containers] ==: OK (0.02s)
  13066. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13067. 663.27 s [unordered-containers] /=: OK
  13068. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13069. 663.27 s [unordered-containers] Ord
  13070. 663.27 s [unordered-containers] compare reflexive: OK (0.01s)
  13071. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13072. 663.27 s [unordered-containers] compare transitive: OK (0.01s)
  13073. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13074. 663.27 s [unordered-containers] compare antisymmetric: OK (0.02s)
  13075. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13076. 663.27 s [unordered-containers] Ord => Eq: OK (0.02s)
  13077. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13078. 663.27 s [unordered-containers] Read/Show: OK (0.15s)
  13079. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13080. 663.27 s [unordered-containers] Functor: OK (0.05s)
  13081. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13082. 663.27 s [unordered-containers] Foldable: OK (0.01s)
  13083. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13084. 663.27 s [unordered-containers] Bifoldable
  13085. 663.27 s [unordered-containers] bifoldMap: OK
  13086. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13087. 663.27 s [unordered-containers] bifoldr: OK (0.03s)
  13088. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13089. 663.27 s [unordered-containers] bifoldl: OK
  13090. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13091. 663.27 s [unordered-containers] Hashable: OK (0.01s)
  13092. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13093. 663.27 s [unordered-containers] empty
  13094. 663.27 s [unordered-containers] valid: OK
  13095. 663.27 s [unordered-containers] +++ OK, passed 1 test.
  13096. 663.27 s [unordered-containers] singleton
  13097. 663.27 s [unordered-containers] valid: OK
  13098. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13099. 663.27 s [unordered-containers] size: OK (0.01s)
  13100. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13101. 663.27 s [unordered-containers] member: OK
  13102. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13103. 663.27 s [unordered-containers] lookup: OK (0.01s)
  13104. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13105. 663.27 s [unordered-containers] !?: OK
  13106. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13107. 663.27 s [unordered-containers] insert
  13108. 663.27 s [unordered-containers] model: OK (0.01s)
  13109. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13110. 663.27 s [unordered-containers] valid: OK (0.01s)
  13111. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13112. 663.27 s [unordered-containers] insertWith
  13113. 663.27 s [unordered-containers] insertWith: OK (0.02s)
  13114. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13115. 663.27 s [unordered-containers] valid: OK
  13116. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13117. 663.27 s [unordered-containers] delete
  13118. 663.27 s [unordered-containers] model: OK
  13119. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13120. 663.27 s [unordered-containers] valid: OK (0.02s)
  13121. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13122. 663.27 s [unordered-containers] adjust
  13123. 663.27 s [unordered-containers] model: OK (0.02s)
  13124. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13125. 663.27 s [unordered-containers] valid: OK (0.01s)
  13126. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13127. 663.27 s [unordered-containers] update
  13128. 663.27 s [unordered-containers] model: OK (0.02s)
  13129. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13130. 663.27 s [unordered-containers] valid: OK (0.01s)
  13131. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13132. 663.27 s [unordered-containers] alter
  13133. 663.27 s [unordered-containers] model: OK (0.01s)
  13134. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13135. 663.27 s [unordered-containers] valid: OK (0.02s)
  13136. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13137. 663.27 s [unordered-containers] alterF
  13138. 663.27 s [unordered-containers] model
  13139. 663.27 s [unordered-containers] []: OK (0.06s)
  13140. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13141. 663.27 s [unordered-containers] adjust: OK (0.02s)
  13142. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13143. 663.27 s [unordered-containers] insert: OK (0.02s)
  13144. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13145. 663.27 s [unordered-containers] insertWith: OK
  13146. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13147. 663.27 s [unordered-containers] delete: OK
  13148. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13149. 663.27 s [unordered-containers] lookup: OK
  13150. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13151. 663.27 s [unordered-containers] valid: OK (0.02s)
  13152. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13153. 663.27 s [unordered-containers] isSubmapOf
  13154. 663.27 s [unordered-containers] model: OK (0.01s)
  13155. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13156. 663.27 s [unordered-containers] m ⊆ m: OK
  13157. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13158. 663.27 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.04s)
  13159. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13160. 663.27 s [unordered-containers] m1\m2 ⊆ m1: OK (0.02s)
  13161. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13162. 663.27 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.03s)
  13163. 663.27 s [unordered-containers] +++ OK, passed 100 tests; 174 discarded.
  13164. 663.27 s [unordered-containers] delete k m ⊆ m: OK
  13165. 663.27 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  13166. 663.27 s [unordered-containers] m ⊈ delete k m : OK
  13167. 663.27 s [unordered-containers] +++ OK, passed 100 tests; 20 discarded.
  13168. 663.27 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.01s)
  13169. 663.27 s [unordered-containers] +++ OK, passed 100 tests; 10 discarded.
  13170. 663.27 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  13171. 663.27 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  13172. 663.27 s [unordered-containers] union
  13173. 663.27 s [unordered-containers] model: OK (0.03s)
  13174. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13175. 663.27 s [unordered-containers] valid: OK
  13176. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13177. 663.27 s [unordered-containers] unionWith
  13178. 663.27 s [unordered-containers] model: OK (0.05s)
  13179. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13180. 663.27 s [unordered-containers] valid: OK (0.03s)
  13181. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13182. 663.27 s [unordered-containers] unionWithKey
  13183. 663.27 s [unordered-containers] model: OK (0.05s)
  13184. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13185. 663.27 s [unordered-containers] valid: OK (0.03s)
  13186. 663.27 s [unordered-containers] +++ OK, passed 100 tests.
  13187. 663.27 s [unordered-containers] unions
  13188. 663.33 s [unordered-containers] model: OK (0.31s)
  13189. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13190. 663.33 s [unordered-containers] valid: OK (0.20s)
  13191. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13192. 663.33 s [unordered-containers] difference
  13193. 663.33 s [unordered-containers] model: OK (0.03s)
  13194. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13195. 663.33 s [unordered-containers] valid: OK (0.03s)
  13196. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13197. 663.33 s [unordered-containers] differenceWith
  13198. 663.33 s [unordered-containers] model: OK
  13199. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13200. 663.33 s [unordered-containers] valid: OK (0.01s)
  13201. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13202. 663.33 s [unordered-containers] intersection
  13203. 663.33 s [unordered-containers] model: OK (0.02s)
  13204. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13205. 663.33 s [unordered-containers] valid: OK (0.02s)
  13206. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13207. 663.33 s [unordered-containers] intersectionWith
  13208. 663.33 s [unordered-containers] model: OK (0.04s)
  13209. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13210. 663.33 s [unordered-containers] valid: OK (0.01s)
  13211. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13212. 663.33 s [unordered-containers] intersectionWithKey
  13213. 663.33 s [unordered-containers] model: OK (0.02s)
  13214. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13215. 663.33 s [unordered-containers] valid: OK (0.03s)
  13216. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13217. 663.33 s [unordered-containers] compose
  13218. 663.33 s [unordered-containers] valid: OK (0.02s)
  13219. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13220. 663.33 s [unordered-containers] map
  13221. 663.33 s [unordered-containers] model: OK (0.05s)
  13222. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13223. 663.33 s [unordered-containers] valid: OK (0.01s)
  13224. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13225. 663.33 s [unordered-containers] traverseWithKey
  13226. 663.33 s [unordered-containers] model: OK (0.05s)
  13227. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13228. 663.33 s [unordered-containers] valid: OK (0.01s)
  13229. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13230. 663.33 s [unordered-containers] mapKeys
  13231. 663.33 s [unordered-containers] model: OK
  13232. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13233. 663.33 s [unordered-containers] valid: OK (0.07s)
  13234. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13235. 663.33 s [unordered-containers] foldr: OK
  13236. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13237. 663.33 s [unordered-containers] foldl: OK (0.01s)
  13238. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13239. 663.33 s [unordered-containers] foldrWithKey: OK (0.01s)
  13240. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13241. 663.33 s [unordered-containers] foldlWithKey: OK (0.01s)
  13242. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13243. 663.33 s [unordered-containers] foldrWithKey': OK
  13244. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13245. 663.33 s [unordered-containers] foldlWithKey': OK
  13246. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13247. 663.33 s [unordered-containers] foldl': OK (0.02s)
  13248. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13249. 663.33 s [unordered-containers] foldr': OK
  13250. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13251. 663.33 s [unordered-containers] foldMapWithKey: OK
  13252. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13253. 663.33 s [unordered-containers] filter
  13254. 663.33 s [unordered-containers] model: OK (0.03s)
  13255. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13256. 663.33 s [unordered-containers] valid: OK
  13257. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13258. 663.33 s [unordered-containers] filterWithKey
  13259. 663.33 s [unordered-containers] model: OK (0.25s)
  13260. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13261. 663.33 s [unordered-containers] valid: OK (0.16s)
  13262. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13263. 663.33 s [unordered-containers] mapMaybe
  13264. 663.33 s [unordered-containers] model: OK
  13265. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13266. 663.33 s [unordered-containers] valid: OK (0.02s)
  13267. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13268. 663.33 s [unordered-containers] mapMaybeWithKey
  13269. 663.33 s [unordered-containers] model: OK (0.23s)
  13270. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13271. 663.33 s [unordered-containers] valid: OK (0.15s)
  13272. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13273. 663.33 s [unordered-containers] elems: OK (0.01s)
  13274. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13275. 663.33 s [unordered-containers] keys: OK
  13276. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13277. 663.33 s [unordered-containers] fromList
  13278. 663.33 s [unordered-containers] model: OK
  13279. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13280. 663.33 s [unordered-containers] valid: OK
  13281. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13282. 663.33 s [unordered-containers] fromListWith
  13283. 663.33 s [unordered-containers] model: OK
  13284. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13285. 663.33 s [unordered-containers] valid: OK
  13286. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13287. 663.33 s [unordered-containers] fromListWithKey
  13288. 663.33 s [unordered-containers] model: OK
  13289. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13290. 663.33 s [unordered-containers] valid: OK
  13291. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13292. 663.33 s [unordered-containers] toList: OK
  13293. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13294. 663.33 s [unordered-containers] Data.HashSet
  13295. 663.33 s [unordered-containers] instances
  13296. 663.33 s [unordered-containers] Eq
  13297. 663.33 s [unordered-containers] ==: OK (0.01s)
  13298. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13299. 663.33 s [unordered-containers] == permutations: OK
  13300. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13301. 663.33 s [unordered-containers] /=: OK
  13302. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13303. 663.33 s [unordered-containers] Ord
  13304. 663.33 s [unordered-containers] compare reflexive: OK
  13305. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13306. 663.33 s [unordered-containers] compare transitive: OK (0.02s)
  13307. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13308. 663.33 s [unordered-containers] compare antisymmetric: OK
  13309. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13310. 663.33 s [unordered-containers] Ord => Eq: OK
  13311. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13312. 663.33 s [unordered-containers] Read/Show: OK (0.11s)
  13313. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13314. 663.33 s [unordered-containers] Foldable: OK
  13315. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13316. 663.33 s [unordered-containers] Hashable: OK
  13317. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13318. 663.33 s [unordered-containers] size: OK
  13319. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13320. 663.33 s [unordered-containers] member: OK
  13321. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13322. 663.33 s [unordered-containers] insert: OK
  13323. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13324. 663.33 s [unordered-containers] delete: OK
  13325. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13326. 663.33 s [unordered-containers] union: OK (0.02s)
  13327. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13328. 663.33 s [unordered-containers] map: OK (0.13s)
  13329. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13330. 663.33 s [unordered-containers] foldr: OK
  13331. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13332. 663.33 s [unordered-containers] foldl': OK
  13333. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13334. 663.33 s [unordered-containers] filter: OK (0.13s)
  13335. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13336. 663.33 s [unordered-containers] toList: OK
  13337. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13338. 663.33 s [unordered-containers] Data.HashMap.Internal.List
  13339. 663.33 s [unordered-containers] isPermutationBy: OK
  13340. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13341. 663.33 s [unordered-containers] isPermutationBy of different length: OK
  13342. 663.33 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  13343. 663.33 s [unordered-containers] pUnorderedCompare: OK (0.03s)
  13344. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13345. 663.33 s [unordered-containers] modelUnorderedCompare
  13346. 663.33 s [unordered-containers] reflexive: OK
  13347. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13348. 663.33 s [unordered-containers] anti-symmetric: OK
  13349. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13350. 663.33 s [unordered-containers] transitive: OK
  13351. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13352. 663.33 s [unordered-containers] Regression tests
  13353. 663.33 s [unordered-containers] issue32: OK
  13354. 663.33 s [unordered-containers] issue39a: OK
  13355. 663.33 s [unordered-containers] issue39b: OK
  13356. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13357. 663.33 s [unordered-containers] issue254 lazy: OK
  13358. 663.33 s [unordered-containers] issue254 strict: OK
  13359. 663.33 s [unordered-containers] issue379
  13360. 663.33 s [unordered-containers] Lazy.unionWith: OK
  13361. 663.33 s [unordered-containers] union: OK
  13362. 663.33 s [unordered-containers] Strict.unionWith: OK
  13363. 663.33 s [unordered-containers] Strict.unionWithKey: OK
  13364. 663.33 s [unordered-containers] issue381
  13365. 663.33 s [unordered-containers] mapMaybe: OK
  13366. 663.33 s [unordered-containers] mapMaybeWithKey: OK
  13367. 663.33 s [unordered-containers] issue382: OK
  13368. 663.33 s [unordered-containers] issue383: OK
  13369. 663.33 s [unordered-containers] issue420: OK
  13370. 663.33 s [unordered-containers] issue491
  13371. 663.33 s [unordered-containers] 1: OK
  13372. 663.33 s [unordered-containers] 2: OK
  13373. 663.33 s [unordered-containers] 3: OK
  13374. 663.33 s [unordered-containers] Strictness
  13375. 663.33 s [unordered-containers] HashMap.Strict
  13376. 663.33 s [unordered-containers] singleton is key-strict: OK
  13377. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13378. 663.33 s [unordered-containers] singleton is value-strict: OK
  13379. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13380. 663.33 s [unordered-containers] member is key-strict: OK
  13381. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13382. 663.33 s [unordered-containers] lookup is key-strict: OK
  13383. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13384. 663.33 s [unordered-containers] lookupDefault is key-strict: OK
  13385. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13386. 663.33 s [unordered-containers] findWithDefault is key-strict: OK
  13387. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13388. 663.33 s [unordered-containers] ! is key-strict: OK
  13389. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13390. 663.33 s [unordered-containers] delete is key-strict: OK
  13391. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13392. 663.33 s [unordered-containers] adjust is key-strict: OK
  13393. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13394. 663.33 s [unordered-containers] adjust is value-strict: OK
  13395. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13396. 663.33 s [unordered-containers] insert is key-strict: OK
  13397. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13398. 663.33 s [unordered-containers] insert is value-strict: OK
  13399. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13400. 663.33 s [unordered-containers] insertWith is key-strict: OK
  13401. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13402. 663.33 s [unordered-containers] insertWith is value-strict: OK
  13403. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13404. 663.33 s [unordered-containers] fromList is key-strict: OK
  13405. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13406. 663.33 s [unordered-containers] fromList is value-strict: OK
  13407. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13408. 663.33 s [unordered-containers] fromListWith is key-strict: OK
  13409. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13410. 663.33 s [unordered-containers] fromListWith is value-strict: OK
  13411. 663.33 s [unordered-containers] +++ OK, passed 100 tests.
  13412. 663.33 s [unordered-containers]
  13413. 663.33 s [unordered-containers] All 257 tests passed (0.50s)
  13414. 663.34 s [unordered-containers] Test suite unordered-containers-tests: PASS
  13415. 663.34 s [unordered-containers] Test suite logged to:
  13416. 663.34 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  13417. 663.34 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  13418. 663.36 s [unordered-containers] Phase: haddockPhase
  13419. 663.49 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  13420. 663.50 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1..
  13421. 663.57 s [unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  13422. 663.93 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  13423. 663.93 s [unordered-containers] Missing documentation for:
  13424. 663.93 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  13425. 663.93 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  13426. 663.93 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:207)
  13427. 663.93 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:224)
  13428. 663.93 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:228)
  13429. 663.93 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:232)
  13430. 663.93 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:241)
  13431. 663.93 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:153)
  13432. 663.93 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:161)
  13433. 663.93 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:248)
  13434. 663.93 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:254)
  13435. 663.93 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:261)
  13436. 663.93 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:273)
  13437. 663.93 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:267)
  13438. 663.93 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:139)
  13439. 663.93 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:279)
  13440. 663.93 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:285)
  13441. 663.93 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:135)
  13442. 663.93 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:291)
  13443. 663.93 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:313)
  13444. 663.93 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:403)
  13445. 663.93 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:374)
  13446. 663.93 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:393)
  13447. 663.93 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:384)
  13448. 663.93 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:416)
  13449. 663.93 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:435)
  13450. 663.93 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:460)
  13451. 663.93 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:536)
  13452. 663.93 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:552)
  13453. 663.93 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:528)
  13454. 663.93 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:493)
  13455. 663.93 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:505)
  13456. 664.03 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  13457. 664.03 s [unordered-containers] Missing documentation for:
  13458. 664.03 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:39)
  13459. 664.03 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:82)
  13460. 664.03 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:67)
  13461. 664.28 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  13462. 664.28 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  13463. 664.28 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  13464. 664.28 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  13465. 664.28 s [unordered-containers] by specifying the type/value namespace explicitly.
  13466. 664.28 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  13467. 664.28 s [unordered-containers] Warning: 'at' is out of scope.
  13468. 664.28 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  13469. 664.28 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  13470. 664.28 s [unordered-containers] Missing documentation for:
  13471. 664.28 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  13472. 664.28 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1858)
  13473. 664.28 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2372)
  13474. 664.28 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:512)
  13475. 664.28 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:496)
  13476. 664.28 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:679)
  13477. 664.28 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  13478. 664.28 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:661)
  13479. 664.28 s [unordered-containers] insert' (Data/HashMap/Internal.hs:807)
  13480. 664.28 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1125)
  13481. 664.28 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:849)
  13482. 664.28 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:884)
  13483. 664.61 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  13484. 664.61 s [unordered-containers] Missing documentation for:
  13485. 664.61 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:97)
  13486. 664.61 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  13487. 664.61 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  13488. 664.65 s [unordered-containers] Warning: 'lookup' is out of scope.
  13489. 664.65 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  13490. 664.65 s [unordered-containers] Warning: 'at' is out of scope.
  13491. 664.65 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  13492. 664.65 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  13493. 664.72 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  13494. 664.74 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  13495. 664.74 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  13496. 664.75 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  13497. 667.39 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/index.html,
  13498. 667.39 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  13499. 667.53 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  13500. 667.53 s [unordered-containers] Phase: installPhase
  13501. 667.55 s [unordered-containers] Installing library in /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  13502. 667.95 s [unordered-containers] Phase: fixupPhase
  13503. 667.98 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1
  13504. 667.98 s [unordered-containers] shrinking /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSunordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF-ghc9.4.8.so
  13505. 668.00 s [unordered-containers] checking for references to /build/ in /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1...
  13506. 668.02 s [unordered-containers] patching script interpreter paths in /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1
  13507. 668.03 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1/lib
  13508. 668.19 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/0wgc8frd6vzqfl21i9q7ch8h4h6bhs3l-unordered-containers-0.2.20.1-doc
  13509. 668.21 s [unordered-containers] checking for references to /build/ in /nix/store/0wgc8frd6vzqfl21i9q7ch8h4h6bhs3l-unordered-containers-0.2.20.1-doc...
  13510. 668.25 s [unordered-containers] patching script interpreter paths in /nix/store/0wgc8frd6vzqfl21i9q7ch8h4h6bhs3l-unordered-containers-0.2.20.1-doc
  13511. 668.38 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/0wgc8frd6vzqfl21i9q7ch8h4h6bhs3l-unordered-containers-0.2.20.1-doc /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1
  13512. 668.93 s [post-build-hook] Pushing 2 paths (41 are already present) using zstd to cache sellout ⏳
  13513. 668.93 s [post-build-hook]
  13514. 669.38 s [post-build-hook] Pushing /nix/store/0wgc8frd6vzqfl21i9q7ch8h4h6bhs3l-unordered-containers-0.2.20.1-doc (4.81 MiB)
  13515. 669.40 s [post-build-hook] Pushing /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1 (9.59 MiB)
  13516. 671.09 s [post-build-hook]
  13517. 671.09 s [post-build-hook] All done.
  13518. 671.12 s [post-build-hook] Uploading to the NixCI cache: /nix/store/0wgc8frd6vzqfl21i9q7ch8h4h6bhs3l-unordered-containers-0.2.20.1-doc /nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1
  13519. 671.18 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13520. 671.39 s [post-build-hook] copying 2 paths...
  13521. 671.39 s [post-build-hook] copying path '/nix/store/0wgc8frd6vzqfl21i9q7ch8h4h6bhs3l-unordered-containers-0.2.20.1-doc' to 'https://cache.nix-ci.com'...
  13522. 672.10 s [post-build-hook] copying path '/nix/store/r3z4d0wszgxkygghdjyz500p4ldf8nwc-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  13523. 674.07 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13524. 674.34 s [post-build-hook] copying 1 paths...
  13525. 674.39 s [post-build-hook] copying path '/nix/store/kfr6h56nzkzxw0d84ib5abipr7gdc8q7-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...
  13526. 674.58 s Progress: 3 of 10 built, 152 of 152 downloaded from cache
  13527. 674.64 s Building quickcheck-instances
  13528. 674.77 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  13529. 674.78 s [quickcheck-instances] Build with /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8.
  13530. 675.00 s [quickcheck-instances] Phase: unpackPhase
  13531. 675.00 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  13532. 675.01 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  13533. 675.02 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  13534. 675.02 s [quickcheck-instances] Phase: patchPhase
  13535. 675.03 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  13536. 675.04 s [quickcheck-instances] Phase: compileBuildDriverPhase
  13537. 675.04 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.vw76BZELPb/setup-package.conf.d -threaded
  13538. 675.11 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.vw76BZELPb/Main.o )
  13539. 675.18 s [quickcheck-instances] [2 of 2] Linking Setup
  13540. 676.25 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  13541. 676.26 s [quickcheck-instances] Phase: configurePhase
  13542. 676.27 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/jnwixibidhrymvxn8dddv9pz1z310f89-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.vw76BZELPb/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  13543. 676.80 s [quickcheck-instances] Using Parsec parser
  13544. 676.80 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  13545. 676.80 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  13546. 676.80 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  13547. 676.80 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.4.0
  13548. 676.80 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.17.2.1
  13549. 676.80 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.11.5.3
  13550. 676.80 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  13551. 676.80 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.7
  13552. 676.80 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  13553. 676.80 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
  13554. 676.80 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  13555. 676.80 s [quickcheck-instances] integer-logarithms-1.0.4
  13556. 676.80 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  13557. 676.80 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  13558. 676.80 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  13559. 676.80 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  13560. 676.80 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  13561. 676.80 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  13562. 676.80 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.0.2
  13563. 676.80 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  13564. 676.80 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  13565. 676.80 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  13566. 676.80 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.5.6.2
  13567. 676.80 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  13568. 676.80 s [quickcheck-instances] unordered-containers-0.2.20.1
  13569. 676.80 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  13570. 676.80 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  13571. 676.80 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  13572. 676.80 s [quickcheck-instances] Dependency base: using base-4.17.2.1
  13573. 676.80 s [quickcheck-instances] Dependency containers: using containers-0.6.7
  13574. 676.80 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  13575. 676.80 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  13576. 676.80 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  13577. 676.80 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  13578. 676.95 s [quickcheck-instances] Source component graph:
  13579. 676.95 s [quickcheck-instances] component lib
  13580. 676.95 s [quickcheck-instances] component test:self-test dependency lib
  13581. 676.95 s [quickcheck-instances] Configured component graph:
  13582. 676.95 s [quickcheck-instances] component quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  13583. 676.95 s [quickcheck-instances] include OneTuple-0.4.2-1qNCJdsVRsJDqD4lsm4n6x
  13584. 676.95 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  13585. 676.95 s [quickcheck-instances] include array-0.5.4.0
  13586. 676.95 s [quickcheck-instances] include base-4.17.2.1
  13587. 676.95 s [quickcheck-instances] include bytestring-0.11.5.3
  13588. 676.95 s [quickcheck-instances] include case-insensitive-1.2.1.0-3POgu6RVhJnIExPH4NIHY6
  13589. 676.95 s [quickcheck-instances] include containers-0.6.7
  13590. 676.95 s [quickcheck-instances] include data-fix-0.3.4-EXaUt9ZWYJVKId4auerdzD
  13591. 676.95 s [quickcheck-instances] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  13592. 676.95 s [quickcheck-instances] include integer-logarithms-1.0.4-2UdkECKTVE99Cdcd46YJ5h
  13593. 676.95 s [quickcheck-instances] include old-time-1.1.0.4-JCK1cuUA8uoGpLymN8cquI
  13594. 676.95 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  13595. 676.95 s [quickcheck-instances] include scientific-0.3.8.0-GvGwmF7EL59B4HGbGJmnI
  13596. 676.95 s [quickcheck-instances] include splitmix-0.1.3.1-GyE00mUD5GrGc7M9pXZzrh
  13597. 676.95 s [quickcheck-instances] include strict-0.5.1-J2JTQGR4MtH99TeEdgQVXd
  13598. 676.95 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  13599. 676.95 s [quickcheck-instances] include text-2.0.2
  13600. 676.95 s [quickcheck-instances] include text-short-0.1.6-746hHyaAgVO47s9DKqHa5a
  13601. 676.95 s [quickcheck-instances] include these-1.2.1-FSMxiwnoUcjLDvhbSYo7wq
  13602. 676.95 s [quickcheck-instances] include time-compat-1.9.8-ABavUctu5Y0BahPH45lQWm
  13603. 676.95 s [quickcheck-instances] include transformers-0.5.6.2
  13604. 676.95 s [quickcheck-instances] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  13605. 676.95 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  13606. 676.95 s [quickcheck-instances] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  13607. 676.95 s [quickcheck-instances] component quickcheck-instances-0.3.33-AXjKe9ynNR226iwrbrlnxm-self-test
  13608. 676.95 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  13609. 676.95 s [quickcheck-instances] include base-4.17.2.1
  13610. 676.95 s [quickcheck-instances] include containers-0.6.7
  13611. 676.95 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  13612. 676.95 s [quickcheck-instances] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  13613. 676.95 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  13614. 676.95 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  13615. 676.95 s [quickcheck-instances] Linked component graph:
  13616. 676.95 s [quickcheck-instances] unit quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  13617. 676.95 s [quickcheck-instances] include OneTuple-0.4.2-1qNCJdsVRsJDqD4lsm4n6x
  13618. 676.95 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  13619. 676.95 s [quickcheck-instances] include array-0.5.4.0
  13620. 676.95 s [quickcheck-instances] include base-4.17.2.1
  13621. 676.95 s [quickcheck-instances] include bytestring-0.11.5.3
  13622. 676.95 s [quickcheck-instances] include case-insensitive-1.2.1.0-3POgu6RVhJnIExPH4NIHY6
  13623. 676.95 s [quickcheck-instances] include containers-0.6.7
  13624. 676.95 s [quickcheck-instances] include data-fix-0.3.4-EXaUt9ZWYJVKId4auerdzD
  13625. 676.95 s [quickcheck-instances] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  13626. 676.95 s [quickcheck-instances] include integer-logarithms-1.0.4-2UdkECKTVE99Cdcd46YJ5h
  13627. 676.95 s [quickcheck-instances] include old-time-1.1.0.4-JCK1cuUA8uoGpLymN8cquI
  13628. 676.95 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  13629. 676.95 s [quickcheck-instances] include scientific-0.3.8.0-GvGwmF7EL59B4HGbGJmnI
  13630. 676.95 s [quickcheck-instances] include splitmix-0.1.3.1-GyE00mUD5GrGc7M9pXZzrh
  13631. 676.95 s [quickcheck-instances] include strict-0.5.1-J2JTQGR4MtH99TeEdgQVXd
  13632. 676.95 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  13633. 676.95 s [quickcheck-instances] include text-2.0.2
  13634. 676.95 s [quickcheck-instances] include text-short-0.1.6-746hHyaAgVO47s9DKqHa5a
  13635. 676.95 s [quickcheck-instances] include these-1.2.1-FSMxiwnoUcjLDvhbSYo7wq
  13636. 676.95 s [quickcheck-instances] include time-compat-1.9.8-ABavUctu5Y0BahPH45lQWm
  13637. 676.95 s [quickcheck-instances] include transformers-0.5.6.2
  13638. 676.95 s [quickcheck-instances] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  13639. 676.95 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  13640. 676.95 s [quickcheck-instances] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  13641. 676.95 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Void
  13642. 676.95 s [quickcheck-instances] unit quickcheck-instances-0.3.33-AXjKe9ynNR226iwrbrlnxm-self-test
  13643. 676.95 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  13644. 676.95 s [quickcheck-instances] include base-4.17.2.1
  13645. 676.95 s [quickcheck-instances] include containers-0.6.7
  13646. 676.95 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  13647. 676.95 s [quickcheck-instances] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  13648. 676.95 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  13649. 676.95 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  13650. 676.95 s [quickcheck-instances] Ready component graph:
  13651. 676.95 s [quickcheck-instances] definite quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  13652. 676.95 s [quickcheck-instances] depends OneTuple-0.4.2-1qNCJdsVRsJDqD4lsm4n6x
  13653. 676.95 s [quickcheck-instances] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  13654. 676.95 s [quickcheck-instances] depends array-0.5.4.0
  13655. 676.95 s [quickcheck-instances] depends base-4.17.2.1
  13656. 676.95 s [quickcheck-instances] depends bytestring-0.11.5.3
  13657. 676.95 s [quickcheck-instances] depends case-insensitive-1.2.1.0-3POgu6RVhJnIExPH4NIHY6
  13658. 676.95 s [quickcheck-instances] depends containers-0.6.7
  13659. 676.95 s [quickcheck-instances] depends data-fix-0.3.4-EXaUt9ZWYJVKId4auerdzD
  13660. 676.95 s [quickcheck-instances] depends hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  13661. 676.95 s [quickcheck-instances] depends integer-logarithms-1.0.4-2UdkECKTVE99Cdcd46YJ5h
  13662. 676.95 s [quickcheck-instances] depends old-time-1.1.0.4-JCK1cuUA8uoGpLymN8cquI
  13663. 676.95 s [quickcheck-instances] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  13664. 676.95 s [quickcheck-instances] depends scientific-0.3.8.0-GvGwmF7EL59B4HGbGJmnI
  13665. 676.95 s [quickcheck-instances] depends splitmix-0.1.3.1-GyE00mUD5GrGc7M9pXZzrh
  13666. 676.95 s [quickcheck-instances] depends strict-0.5.1-J2JTQGR4MtH99TeEdgQVXd
  13667. 676.95 s [quickcheck-instances] depends tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  13668. 676.95 s [quickcheck-instances] depends text-2.0.2
  13669. 676.95 s [quickcheck-instances] depends text-short-0.1.6-746hHyaAgVO47s9DKqHa5a
  13670. 676.95 s [quickcheck-instances] depends these-1.2.1-FSMxiwnoUcjLDvhbSYo7wq
  13671. 676.95 s [quickcheck-instances] depends time-compat-1.9.8-ABavUctu5Y0BahPH45lQWm
  13672. 676.95 s [quickcheck-instances] depends transformers-0.5.6.2
  13673. 676.95 s [quickcheck-instances] depends unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  13674. 676.95 s [quickcheck-instances] depends uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  13675. 676.95 s [quickcheck-instances] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  13676. 676.95 s [quickcheck-instances] definite quickcheck-instances-0.3.33-AXjKe9ynNR226iwrbrlnxm-self-test
  13677. 676.95 s [quickcheck-instances] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  13678. 676.95 s [quickcheck-instances] depends base-4.17.2.1
  13679. 676.95 s [quickcheck-instances] depends containers-0.6.7
  13680. 676.95 s [quickcheck-instances] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  13681. 676.95 s [quickcheck-instances] depends quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  13682. 677.09 s [quickcheck-instances] depends tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  13683. 677.09 s [quickcheck-instances] depends uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  13684. 677.09 s [quickcheck-instances] Using Cabal-3.8.1.0 compiled by ghc-9.4
  13685. 677.09 s [quickcheck-instances] Using compiler: ghc-9.4.8
  13686. 677.09 s [quickcheck-instances] Using install prefix:
  13687. 677.09 s [quickcheck-instances] /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33
  13688. 677.09 s [quickcheck-instances] Executables installed in:
  13689. 677.09 s [quickcheck-instances] /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33/bin
  13690. 677.09 s [quickcheck-instances] Libraries installed in:
  13691. 677.09 s [quickcheck-instances] /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  13692. 677.09 s [quickcheck-instances] Dynamic Libraries installed in:
  13693. 677.09 s [quickcheck-instances] /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  13694. 677.09 s [quickcheck-instances] Private executables installed in:
  13695. 677.09 s [quickcheck-instances] /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33
  13696. 677.09 s [quickcheck-instances] Data files installed in:
  13697. 677.09 s [quickcheck-instances] /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33
  13698. 677.09 s [quickcheck-instances] Documentation installed in:
  13699. 677.09 s [quickcheck-instances] /nix/store/jnwixibidhrymvxn8dddv9pz1z310f89-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  13700. 677.09 s [quickcheck-instances] Configuration files installed in:
  13701. 677.09 s [quickcheck-instances] /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33/etc
  13702. 677.09 s [quickcheck-instances] No alex found
  13703. 677.09 s [quickcheck-instances] Using ar found on system at:
  13704. 677.09 s [quickcheck-instances] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  13705. 677.09 s [quickcheck-instances] No c2hs found
  13706. 677.09 s [quickcheck-instances] No cpphs found
  13707. 677.09 s [quickcheck-instances] No doctest found
  13708. 677.09 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  13709. 677.09 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  13710. 677.09 s [quickcheck-instances] Using ghc version 9.4.8 found on system at:
  13711. 677.09 s [quickcheck-instances] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc
  13712. 677.09 s [quickcheck-instances] Using ghc-pkg version 9.4.8 found on system at:
  13713. 677.09 s [quickcheck-instances] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc-pkg-9.4.8
  13714. 677.09 s [quickcheck-instances] No ghcjs found
  13715. 677.09 s [quickcheck-instances] No ghcjs-pkg found
  13716. 677.09 s [quickcheck-instances] No greencard found
  13717. 677.09 s [quickcheck-instances] Using haddock version 2.27.0 found on system at:
  13718. 677.09 s [quickcheck-instances] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/haddock-ghc-9.4.8
  13719. 677.09 s [quickcheck-instances] No happy found
  13720. 677.09 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  13721. 677.09 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  13722. 677.09 s [quickcheck-instances] No hmake found
  13723. 677.09 s [quickcheck-instances] Using hpc version 0.68 found on system at:
  13724. 677.09 s [quickcheck-instances] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hpc
  13725. 677.09 s [quickcheck-instances] Using hsc2hs version 0.68.8 found on system at:
  13726. 677.09 s [quickcheck-instances] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hsc2hs
  13727. 677.09 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  13728. 677.09 s [quickcheck-instances] /nix/store/iqxq9idsxcwnhgibgzzj6w82ba81jia4-hscolour-1.25/bin/HsColour
  13729. 677.09 s [quickcheck-instances] No jhc found
  13730. 677.09 s [quickcheck-instances] Using ld found on system at:
  13731. 677.09 s [quickcheck-instances] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  13732. 677.09 s [quickcheck-instances] No pkg-config found
  13733. 677.09 s [quickcheck-instances] Using runghc version 9.4.8 found on system at:
  13734. 677.09 s [quickcheck-instances] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/runghc-9.4.8
  13735. 677.09 s [quickcheck-instances] Using strip version 2.44 found on system at:
  13736. 677.09 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  13737. 677.09 s [quickcheck-instances] Using tar found on system at:
  13738. 677.09 s [quickcheck-instances] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  13739. 677.09 s [quickcheck-instances] No uhc found
  13740. 677.10 s [quickcheck-instances] Phase: buildPhase
  13741. 677.17 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  13742. 677.18 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33..
  13743. 677.29 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 )
  13744. 677.36 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 )
  13745. 677.58 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 )
  13746. 677.67 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 )
  13747. 677.67 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 )
  13748. 677.81 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 )
  13749. 677.81 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 )
  13750. 677.81 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 )
  13751. 677.81 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 )
  13752. 677.81 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 )
  13753. 677.81 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 )
  13754. 677.81 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 )
  13755. 677.81 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 )
  13756. 677.81 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 )
  13757. 677.81 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 )
  13758. 677.85 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 )
  13759. 677.85 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 )
  13760. 677.85 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 )
  13761. 677.85 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 )
  13762. 677.85 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 )
  13763. 678.17 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 )
  13764. 678.17 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 )
  13765. 678.17 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 )
  13766. 678.17 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 )
  13767. 678.17 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 )
  13768. 678.17 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 )
  13769. 678.45 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 )
  13770. 678.61 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 )
  13771. 678.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 )
  13772. 678.90 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 )
  13773. 679.08 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 )
  13774. 679.08 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 )
  13775. 679.08 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 )
  13776. 679.08 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 )
  13777. 679.08 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 )
  13778. 679.08 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 )
  13779. 679.08 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 )
  13780. 679.09 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 )
  13781. 679.09 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 )
  13782. 679.09 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 )
  13783. 679.09 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 )
  13784. 679.09 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 )
  13785. 679.09 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 )
  13786. 679.09 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 )
  13787. 679.09 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 )
  13788. 679.09 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 )
  13789. 679.36 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 )
  13790. 679.45 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 )
  13791. 679.45 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 )
  13792. 679.45 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 )
  13793. 679.45 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 )
  13794. 679.45 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  13795. 681.15 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  13796. 681.15 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33..
  13797. 681.23 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  13798. 681.58 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  13799. 682.24 s [quickcheck-instances] Phase: checkPhase
  13800. 682.27 s [quickcheck-instances] Running 1 test suites...
  13801. 682.27 s [quickcheck-instances] Test suite self-test: RUNNING...
  13802. 682.28 s [quickcheck-instances] +++ OK, passed 100 tests.
  13803. 682.28 s [quickcheck-instances] +++ OK, passed 100 tests.
  13804. 682.28 s [quickcheck-instances] +++ OK, passed 100 tests.
  13805. 682.28 s [quickcheck-instances] +++ OK, passed 100 tests.
  13806. 682.28 s [quickcheck-instances] +++ OK, passed 100 tests.
  13807. 682.29 s [quickcheck-instances] Test suite self-test: PASS
  13808. 682.29 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  13809. 682.29 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  13810. 682.30 s [quickcheck-instances] Phase: haddockPhase
  13811. 682.48 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  13812. 682.49 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33..
  13813. 682.49 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  13814. 682.49 s [quickcheck-instances] links will be generated to these packages: foldable1-classes-compat-0.1.2,
  13815. 682.49 s [quickcheck-instances] vector-0.13.2.0
  13816. 682.56 s [quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  13817. 682.69 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  13818. 682.69 s [quickcheck-instances] Missing documentation for:
  13819. 682.69 s [quickcheck-instances] Module header
  13820. 682.74 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  13821. 682.74 s [quickcheck-instances] Missing documentation for:
  13822. 682.74 s [quickcheck-instances] Module header
  13823. 682.79 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  13824. 682.79 s [quickcheck-instances] Missing documentation for:
  13825. 682.79 s [quickcheck-instances] Module header
  13826. 682.80 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  13827. 682.80 s [quickcheck-instances] Missing documentation for:
  13828. 682.80 s [quickcheck-instances] Module header
  13829. 682.81 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  13830. 682.81 s [quickcheck-instances] Missing documentation for:
  13831. 682.81 s [quickcheck-instances] Module header
  13832. 682.81 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  13833. 682.81 s [quickcheck-instances] Missing documentation for:
  13834. 682.81 s [quickcheck-instances] Module header
  13835. 682.81 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  13836. 682.81 s [quickcheck-instances] Missing documentation for:
  13837. 682.81 s [quickcheck-instances] Module header
  13838. 682.82 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  13839. 682.82 s [quickcheck-instances] Missing documentation for:
  13840. 682.82 s [quickcheck-instances] Module header
  13841. 682.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  13842. 682.85 s [quickcheck-instances] Missing documentation for:
  13843. 682.85 s [quickcheck-instances] Module header
  13844. 682.86 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  13845. 682.86 s [quickcheck-instances] Missing documentation for:
  13846. 682.86 s [quickcheck-instances] Module header
  13847. 682.86 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  13848. 682.86 s [quickcheck-instances] Missing documentation for:
  13849. 682.86 s [quickcheck-instances] Module header
  13850. 682.87 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  13851. 682.87 s [quickcheck-instances] Missing documentation for:
  13852. 682.87 s [quickcheck-instances] Module header
  13853. 682.94 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  13854. 682.94 s [quickcheck-instances] Missing documentation for:
  13855. 682.94 s [quickcheck-instances] Module header
  13856. 682.96 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  13857. 682.96 s [quickcheck-instances] Missing documentation for:
  13858. 682.96 s [quickcheck-instances] Module header
  13859. 682.99 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  13860. 682.99 s [quickcheck-instances] Missing documentation for:
  13861. 682.99 s [quickcheck-instances] Module header
  13862. 682.99 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  13863. 682.99 s [quickcheck-instances] Missing documentation for:
  13864. 682.99 s [quickcheck-instances] Module header
  13865. 683.00 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  13866. 683.00 s [quickcheck-instances] Missing documentation for:
  13867. 683.00 s [quickcheck-instances] Module header
  13868. 683.00 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  13869. 683.00 s [quickcheck-instances] Missing documentation for:
  13870. 683.00 s [quickcheck-instances] Module header
  13871. 683.03 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  13872. 683.03 s [quickcheck-instances] Missing documentation for:
  13873. 683.03 s [quickcheck-instances] Module header
  13874. 683.06 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  13875. 683.06 s [quickcheck-instances] Missing documentation for:
  13876. 683.06 s [quickcheck-instances] Module header
  13877. 683.07 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  13878. 683.07 s [quickcheck-instances] Missing documentation for:
  13879. 683.07 s [quickcheck-instances] Module header
  13880. 683.08 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  13881. 683.08 s [quickcheck-instances] Missing documentation for:
  13882. 683.08 s [quickcheck-instances] Module header
  13883. 683.19 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  13884. 683.19 s [quickcheck-instances] Missing documentation for:
  13885. 683.19 s [quickcheck-instances] Module header
  13886. 683.20 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  13887. 683.20 s [quickcheck-instances] Missing documentation for:
  13888. 683.20 s [quickcheck-instances] Module header
  13889. 683.20 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  13890. 683.32 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  13891. 683.32 s [quickcheck-instances]
  13892. 683.32 s [quickcheck-instances] - Data.Vector.Vector
  13893. 683.32 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  13894. 683.32 s [quickcheck-instances] - Data.Vector.Storable.Vector
  13895. 683.32 s [quickcheck-instances] - Data.Vector.Strict.Vector
  13896. 683.32 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  13897. 683.32 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  13898. 685.75 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/index.html,
  13899. 685.75 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  13900. 685.82 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  13901. 685.82 s [quickcheck-instances] Phase: installPhase
  13902. 685.86 s [quickcheck-instances] Installing library in /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  13903. 686.48 s [quickcheck-instances] Phase: fixupPhase
  13904. 686.51 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33
  13905. 686.51 s [quickcheck-instances] shrinking /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSquickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv-ghc9.4.8.so
  13906. 686.55 s [quickcheck-instances] checking for references to /build/ in /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33...
  13907. 686.60 s [quickcheck-instances] patching script interpreter paths in /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33
  13908. 686.61 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33/lib
  13909. 686.76 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/jnwixibidhrymvxn8dddv9pz1z310f89-quickcheck-instances-0.3.33-doc
  13910. 686.78 s [quickcheck-instances] checking for references to /build/ in /nix/store/jnwixibidhrymvxn8dddv9pz1z310f89-quickcheck-instances-0.3.33-doc...
  13911. 686.81 s [quickcheck-instances] patching script interpreter paths in /nix/store/jnwixibidhrymvxn8dddv9pz1z310f89-quickcheck-instances-0.3.33-doc
  13912. 686.94 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/jnwixibidhrymvxn8dddv9pz1z310f89-quickcheck-instances-0.3.33-doc /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33
  13913. 687.54 s [post-build-hook] Pushing 2 paths (102 are already present) using zstd to cache sellout ⏳
  13914. 687.54 s [post-build-hook]
  13915. 687.99 s [post-build-hook] Pushing /nix/store/jnwixibidhrymvxn8dddv9pz1z310f89-quickcheck-instances-0.3.33-doc (1.61 MiB)
  13916. 688.04 s [post-build-hook] Pushing /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33 (5.57 MiB)
  13917. 689.44 s [post-build-hook]
  13918. 689.44 s [post-build-hook] All done.
  13919. 689.46 s [post-build-hook] Uploading to the NixCI cache: /nix/store/jnwixibidhrymvxn8dddv9pz1z310f89-quickcheck-instances-0.3.33-doc /nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33
  13920. 689.52 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13921. 689.73 s [post-build-hook] copying 2 paths...
  13922. 689.73 s [post-build-hook] copying path '/nix/store/jnwixibidhrymvxn8dddv9pz1z310f89-quickcheck-instances-0.3.33-doc' to 'https://cache.nix-ci.com'...
  13923. 690.13 s [post-build-hook] copying path '/nix/store/nqvhz2m3p0pyx89060sb6yknxm94dprm-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  13924. 691.43 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13925. 691.67 s [post-build-hook] copying 1 paths...
  13926. 691.71 s [post-build-hook] copying path '/nix/store/8v28gbz7k8ili52am3q2n2954kdnvckw-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...
  13927. 691.91 s Progress: 4 of 10 built, 152 of 152 downloaded from cache
  13928. 691.96 s Building extra
  13929. 692.10 s [extra] Phase: setupCompilerEnvironmentPhase
  13930. 692.10 s [extra] Build with /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8.
  13931. 692.32 s [extra] Phase: unpackPhase
  13932. 692.32 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  13933. 692.33 s [extra] source root is extra-1.8.1
  13934. 692.34 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  13935. 692.35 s [extra] Phase: patchPhase
  13936. 692.36 s [extra] Phase: compileBuildDriverPhase
  13937. 692.37 s [extra] setupCompileFlags: -package-db=/build/tmp.JsyU9Hwpu4/setup-package.conf.d -threaded
  13938. 692.42 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.JsyU9Hwpu4/Main.o )
  13939. 692.48 s [extra] [2 of 2] Linking Setup
  13940. 693.55 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  13941. 693.56 s [extra] Phase: configurePhase
  13942. 693.57 s [extra] configureFlags: --verbose --prefix=/nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/g138q7w85yggm8rrfqcqnadpszb5z3zb-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.JsyU9Hwpu4/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  13943. 694.09 s [extra] Using Parsec parser
  13944. 694.09 s [extra] Configuring extra-1.8.1...
  13945. 694.09 s [extra] Dependency base >=4.9 && <5: using base-4.17.2.1
  13946. 694.09 s [extra] Dependency clock >=0.7: using clock-0.8.4
  13947. 694.09 s [extra] Dependency directory: using directory-1.3.7.1
  13948. 694.09 s [extra] Dependency filepath: using filepath-1.4.2.2
  13949. 694.09 s [extra] Dependency process: using process-1.6.18.0
  13950. 694.09 s [extra] Dependency time: using time-1.12.2
  13951. 694.09 s [extra] Dependency unix: using unix-2.7.3
  13952. 694.09 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  13953. 694.09 s [extra] Dependency base >=4 && <5: using base-4.17.2.1
  13954. 694.09 s [extra] Dependency directory: using directory-1.3.7.1
  13955. 694.09 s [extra] Dependency extra: using extra-1.8.1
  13956. 694.09 s [extra] Dependency filepath: using filepath-1.4.2.2
  13957. 694.09 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  13958. 694.09 s [extra] Dependency unix: using unix-2.7.3
  13959. 694.34 s [extra] Source component graph:
  13960. 694.34 s [extra] component lib
  13961. 694.34 s [extra] component test:extra-test dependency lib
  13962. 694.34 s [extra] Configured component graph:
  13963. 694.34 s [extra] component extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  13964. 694.34 s [extra] include base-4.17.2.1
  13965. 694.34 s [extra] include clock-0.8.4-BfeoV556mf87NJyLkMXuRF
  13966. 694.34 s [extra] include directory-1.3.7.1
  13967. 694.34 s [extra] include filepath-1.4.2.2
  13968. 694.34 s [extra] include process-1.6.18.0
  13969. 694.34 s [extra] include time-1.12.2
  13970. 694.34 s [extra] include unix-2.7.3
  13971. 694.34 s [extra] component extra-1.8.1-EMlICjHujfzJ7Uu7yvyGlk-extra-test
  13972. 694.34 s [extra] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  13973. 694.34 s [extra] include base-4.17.2.1
  13974. 694.34 s [extra] include directory-1.3.7.1
  13975. 694.34 s [extra] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  13976. 694.34 s [extra] include filepath-1.4.2.2
  13977. 694.34 s [extra] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  13978. 694.34 s [extra] include unix-2.7.3
  13979. 694.34 s [extra] Linked component graph:
  13980. 694.34 s [extra] unit extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  13981. 694.34 s [extra] include base-4.17.2.1
  13982. 694.34 s [extra] include clock-0.8.4-BfeoV556mf87NJyLkMXuRF
  13983. 694.34 s [extra] include directory-1.3.7.1
  13984. 694.34 s [extra] include filepath-1.4.2.2
  13985. 694.34 s [extra] include process-1.6.18.0
  13986. 694.34 s [extra] include time-1.12.2
  13987. 694.34 s [extra] include unix-2.7.3
  13988. 694.34 s [extra] Control.Concurrent.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Version.Extra,Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Extra,Numeric.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Numeric.Extra,System.Directory.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Environment.Extra,System.IO.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.IO.Extra,System.Info.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Info.Extra,System.Process.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Process.Extra,System.Time.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Time.Extra,Text.Read.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Text.Read.Extra
  13989. 694.34 s [extra] unit extra-1.8.1-EMlICjHujfzJ7Uu7yvyGlk-extra-test
  13990. 694.34 s [extra] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  13991. 694.34 s [extra] include base-4.17.2.1
  13992. 694.34 s [extra] include directory-1.3.7.1
  13993. 694.34 s [extra] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  13994. 694.34 s [extra] include filepath-1.4.2.2
  13995. 694.34 s [extra] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  13996. 694.34 s [extra] include unix-2.7.3
  13997. 694.34 s [extra] Ready component graph:
  13998. 694.34 s [extra] definite extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  13999. 694.34 s [extra] depends base-4.17.2.1
  14000. 694.34 s [extra] depends clock-0.8.4-BfeoV556mf87NJyLkMXuRF
  14001. 694.34 s [extra] depends directory-1.3.7.1
  14002. 694.34 s [extra] depends filepath-1.4.2.2
  14003. 694.34 s [extra] depends process-1.6.18.0
  14004. 694.34 s [extra] depends time-1.12.2
  14005. 694.34 s [extra] depends unix-2.7.3
  14006. 694.34 s [extra] definite extra-1.8.1-EMlICjHujfzJ7Uu7yvyGlk-extra-test
  14007. 694.34 s [extra] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  14008. 694.34 s [extra] depends base-4.17.2.1
  14009. 694.34 s [extra] depends directory-1.3.7.1
  14010. 694.34 s [extra] depends extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  14011. 694.34 s [extra] depends filepath-1.4.2.2
  14012. 694.34 s [extra] depends quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  14013. 694.34 s [extra] depends unix-2.7.3
  14014. 694.34 s [extra] Using Cabal-3.8.1.0 compiled by ghc-9.4
  14015. 694.34 s [extra] Using compiler: ghc-9.4.8
  14016. 694.34 s [extra] Using install prefix: /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1
  14017. 694.34 s [extra] Executables installed in:
  14018. 694.34 s [extra] /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1/bin
  14019. 694.34 s [extra] Libraries installed in:
  14020. 694.34 s [extra] /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  14021. 694.34 s [extra] Dynamic Libraries installed in:
  14022. 694.34 s [extra] /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  14023. 694.34 s [extra] Private executables installed in:
  14024. 694.34 s [extra] /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1/libexec/x86_64-linux-ghc-9.4.8/extra-1.8.1
  14025. 694.34 s [extra] Data files installed in:
  14026. 694.34 s [extra] /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1/share/x86_64-linux-ghc-9.4.8/extra-1.8.1
  14027. 694.34 s [extra] Documentation installed in:
  14028. 694.34 s [extra] /nix/store/g138q7w85yggm8rrfqcqnadpszb5z3zb-extra-1.8.1-doc/share/doc/extra-1.8.1
  14029. 694.34 s [extra] Configuration files installed in:
  14030. 694.34 s [extra] /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1/etc
  14031. 694.34 s [extra] No alex found
  14032. 694.34 s [extra] Using ar found on system at:
  14033. 694.34 s [extra] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  14034. 694.34 s [extra] No c2hs found
  14035. 694.34 s [extra] No cpphs found
  14036. 694.34 s [extra] No doctest found
  14037. 694.34 s [extra] Using gcc version 14.3.0 given by user at:
  14038. 694.34 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  14039. 694.34 s [extra] Using ghc version 9.4.8 found on system at:
  14040. 694.34 s [extra] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc
  14041. 694.34 s [extra] Using ghc-pkg version 9.4.8 found on system at:
  14042. 694.34 s [extra] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc-pkg-9.4.8
  14043. 694.34 s [extra] No ghcjs found
  14044. 694.34 s [extra] No ghcjs-pkg found
  14045. 694.34 s [extra] No greencard found
  14046. 694.34 s [extra] Using haddock version 2.27.0 found on system at:
  14047. 694.34 s [extra] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/haddock-ghc-9.4.8
  14048. 694.34 s [extra] No happy found
  14049. 694.34 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  14050. 694.34 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14051. 694.34 s [extra] No hmake found
  14052. 694.34 s [extra] Using hpc version 0.68 found on system at:
  14053. 694.34 s [extra] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hpc
  14054. 694.34 s [extra] Using hsc2hs version 0.68.8 found on system at:
  14055. 694.34 s [extra] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hsc2hs
  14056. 694.34 s [extra] Using hscolour version 1.25 found on system at:
  14057. 694.34 s [extra] /nix/store/iqxq9idsxcwnhgibgzzj6w82ba81jia4-hscolour-1.25/bin/HsColour
  14058. 694.34 s [extra] No jhc found
  14059. 694.34 s [extra] Using ld found on system at:
  14060. 694.34 s [extra] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  14061. 694.34 s [extra] No pkg-config found
  14062. 694.34 s [extra] Using runghc version 9.4.8 found on system at:
  14063. 694.34 s [extra] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/runghc-9.4.8
  14064. 694.34 s [extra] Using strip version 2.44 found on system at:
  14065. 694.34 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  14066. 694.34 s [extra] Using tar found on system at:
  14067. 694.34 s [extra] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  14068. 694.34 s [extra] No uhc found
  14069. 694.35 s [extra] Phase: buildPhase
  14070. 694.43 s [extra] Preprocessing library for extra-1.8.1..
  14071. 694.44 s [extra] Building library for extra-1.8.1..
  14072. 694.79 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 )
  14073. 694.90 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 )
  14074. 694.90 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 )
  14075. 694.92 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 )
  14076. 694.92 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  14077. 694.92 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  14078. 694.92 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 )
  14079. 695.84 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 )
  14080. 695.90 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 )
  14081. 695.97 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 )
  14082. 695.97 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 )
  14083. 695.97 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 )
  14084. 696.16 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 )
  14085. 696.25 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.o, dist/build/Control/Concurrent/Extra.dyn_o )
  14086. 696.38 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 )
  14087. 696.38 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 )
  14088. 696.38 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 )
  14089. 696.54 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 )
  14090. 696.54 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 )
  14091. 696.62 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 )
  14092. 696.62 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  14093. 696.67 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 )
  14094. 697.12 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  14095. 697.30 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  14096. 697.30 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  14097. 697.31 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  14098. 697.32 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  14099. 697.32 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  14100. 697.32 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  14101. 698.25 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  14102. 698.38 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  14103. 698.43 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  14104. 698.43 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  14105. 698.43 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  14106. 698.71 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  14107. 698.88 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  14108. 699.03 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  14109. 699.03 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  14110. 699.03 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  14111. 699.26 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  14112. 699.26 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  14113. 699.40 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  14114. 699.40 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  14115. 699.53 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  14116. 700.70 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  14117. 700.70 s [extra] Building test suite 'extra-test' for extra-1.8.1..
  14118. 700.79 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  14119. 701.07 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  14120. 702.60 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  14121. 702.67 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  14122. 702.90 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  14123. 703.59 s [extra] Phase: checkPhase
  14124. 703.63 s [extra] Running 1 test suites...
  14125. 703.63 s [extra] Test suite extra-test: RUNNING...
  14126. 703.63 s [extra] withTempFile
  14127. 703.63 s [extra] +++ OK, passed 100 tests.
  14128. 703.63 s [extra] captureOutput
  14129. 703.64 s [extra] +++ OK, passed 100 tests.
  14130. 703.64 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  14131. 703.68 s [extra] +++ OK, passed 100 tests.
  14132. 703.68 s [extra] \(x :: IO Int) -> join (once x) == x
  14133. 703.70 s [extra] +++ OK, passed 100 tests.
  14134. 703.70 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  14135. 703.72 s [extra] +++ OK, passed 100 tests.
  14136. 703.72 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  14137. 703.75 s [extra] +++ OK, passed 100 tests.
  14138. 703.75 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  14139. 703.78 s [extra] +++ OK, passed 100 tests.
  14140. 703.78 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  14141. 703.80 s [extra] +++ OK, passed 100 tests.
  14142. 703.80 s [extra] stringException "test" == pure "test"
  14143. 703.80 s [extra] +++ OK, passed 100 tests.
  14144. 703.80 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  14145. 703.80 s [extra] +++ OK, passed 100 tests.
  14146. 703.80 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  14147. 703.80 s [extra] +++ OK, passed 100 tests.
  14148. 703.80 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  14149. 703.80 s [extra] +++ OK, passed 100 tests.
  14150. 703.80 s [extra] ignore (print 1) == print 1
  14151. 703.80 s [extra] +++ OK, passed 100 tests.
  14152. 703.80 s [extra] ignore (fail "die") == pure ()
  14153. 703.80 s [extra] +++ OK, passed 100 tests.
  14154. 703.80 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  14155. 703.81 s [extra] +++ OK, passed 100 tests.
  14156. 703.81 s [extra] seq (errorIO "foo") (print 1) == print 1
  14157. 703.81 s [extra] +++ OK, passed 100 tests.
  14158. 703.81 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  14159. 703.81 s [extra] +++ OK, passed 100 tests.
  14160. 703.81 s [extra] seq (assertIO False) (print 1) == print 1
  14161. 703.81 s [extra] +++ OK, passed 100 tests.
  14162. 703.81 s [extra] retry 1 (print "x") == print "x"
  14163. 703.81 s [extra] +++ OK, passed 100 tests.
  14164. 703.81 s [extra] retry 3 (fail "die") == fail "die"
  14165. 703.81 s [extra] +++ OK, passed 100 tests.
  14166. 703.81 s [extra] whenJust Nothing print == pure ()
  14167. 703.81 s [extra] +++ OK, passed 100 tests.
  14168. 703.81 s [extra] whenJust (Just 1) print == print 1
  14169. 703.81 s [extra] +++ OK, passed 100 tests.
  14170. 703.81 s [extra] pureIf @Maybe True 5 == Just 5
  14171. 703.81 s [extra] +++ OK, passed 100 tests.
  14172. 703.81 s [extra] pureIf @Maybe False 5 == Nothing
  14173. 703.81 s [extra] +++ OK, passed 100 tests.
  14174. 703.81 s [extra] pureIf @[] True 5 == [5]
  14175. 703.81 s [extra] +++ OK, passed 100 tests.
  14176. 703.81 s [extra] pureIf @[] False 5 == []
  14177. 703.81 s [extra] +++ OK, passed 100 tests.
  14178. 703.81 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  14179. 703.81 s [extra] +++ OK, passed 100 tests.
  14180. 703.81 s [extra] whenMaybe False (print 1) == pure Nothing
  14181. 703.81 s [extra] +++ OK, passed 100 tests.
  14182. 703.81 s [extra] \(x :: Maybe ()) -> unit x == x
  14183. 703.81 s [extra] +++ OK, passed 100 tests.
  14184. 703.81 s [extra] guarded even 2 == [2]
  14185. 703.81 s [extra] +++ OK, passed 100 tests.
  14186. 703.81 s [extra] guarded odd 2 == Nothing
  14187. 703.81 s [extra] +++ OK, passed 100 tests.
  14188. 703.81 s [extra] guarded (not.null) "My Name" == Just "My Name"
  14189. 703.81 s [extra] +++ OK, passed 100 tests.
  14190. 703.81 s [extra] guardedA (return . even) 42 == Just [42]
  14191. 703.81 s [extra] +++ OK, passed 100 tests.
  14192. 703.81 s [extra] guardedA (return . odd) 42 == Just []
  14193. 703.81 s [extra] +++ OK, passed 100 tests.
  14194. 703.81 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  14195. 703.81 s [extra] +++ OK, passed 100 tests.
  14196. 703.81 s [extra] fold1M (\x y -> Just x) [] == undefined
  14197. 703.81 s [extra] +++ OK, passed 100 tests.
  14198. 703.81 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  14199. 703.81 s [extra] +++ OK, passed 100 tests.
  14200. 703.81 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  14201. 703.81 s [extra] +++ OK, passed 100 tests.
  14202. 703.81 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  14203. 703.81 s [extra] +++ OK, passed 100 tests.
  14204. 703.81 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  14205. 703.81 s [extra] +++ OK, passed 100 tests.
  14206. 703.81 s [extra] Just True ||^ undefined == Just True
  14207. 703.81 s [extra] +++ OK, passed 100 tests.
  14208. 703.81 s [extra] Just False ||^ Just True == Just True
  14209. 703.81 s [extra] +++ OK, passed 100 tests.
  14210. 703.81 s [extra] Just False ||^ Just False == Just False
  14211. 703.81 s [extra] +++ OK, passed 100 tests.
  14212. 703.81 s [extra] Just False &&^ undefined == Just False
  14213. 703.81 s [extra] +++ OK, passed 100 tests.
  14214. 703.81 s [extra] Just True &&^ Just True == Just True
  14215. 703.81 s [extra] +++ OK, passed 100 tests.
  14216. 703.81 s [extra] Just True &&^ Just False == Just False
  14217. 703.81 s [extra] +++ OK, passed 100 tests.
  14218. 703.81 s [extra] anyM Just [False,True ,undefined] == Just True
  14219. 703.81 s [extra] +++ OK, passed 100 tests.
  14220. 703.81 s [extra] anyM Just [False,False,undefined] == undefined
  14221. 703.81 s [extra] +++ OK, passed 100 tests.
  14222. 703.81 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  14223. 703.81 s [extra] +++ OK, passed 100 tests.
  14224. 703.81 s [extra] allM Just [True,False,undefined] == Just False
  14225. 703.81 s [extra] +++ OK, passed 100 tests.
  14226. 703.81 s [extra] allM Just [True,True ,undefined] == undefined
  14227. 703.81 s [extra] +++ OK, passed 100 tests.
  14228. 703.81 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  14229. 703.81 s [extra] +++ OK, passed 100 tests.
  14230. 703.81 s [extra] orM [Just False,Just True ,undefined] == Just True
  14231. 703.81 s [extra] +++ OK, passed 100 tests.
  14232. 703.81 s [extra] orM [Just False,Just False,undefined] == undefined
  14233. 703.81 s [extra] +++ OK, passed 100 tests.
  14234. 703.81 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  14235. 703.81 s [extra] +++ OK, passed 100 tests.
  14236. 703.81 s [extra] andM [Just True,Just False,undefined] == Just False
  14237. 703.81 s [extra] +++ OK, passed 100 tests.
  14238. 703.81 s [extra] andM [Just True,Just True ,undefined] == undefined
  14239. 703.81 s [extra] +++ OK, passed 100 tests.
  14240. 703.81 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  14241. 703.81 s [extra] +++ OK, passed 100 tests.
  14242. 703.81 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  14243. 703.81 s [extra] +++ OK, passed 100 tests.
  14244. 703.81 s [extra] findM (Just . isUpper) "test" == Just Nothing
  14245. 703.81 s [extra] +++ OK, passed 100 tests.
  14246. 703.81 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  14247. 703.81 s [extra] +++ OK, passed 100 tests.
  14248. 703.81 s [extra] fromLeft 1 (Left 3) == 3
  14249. 703.81 s [extra] +++ OK, passed 100 tests.
  14250. 703.81 s [extra] fromLeft 1 (Right "foo") == 1
  14251. 703.81 s [extra] +++ OK, passed 100 tests.
  14252. 703.81 s [extra] fromRight 1 (Right 3) == 3
  14253. 703.81 s [extra] +++ OK, passed 100 tests.
  14254. 703.81 s [extra] fromRight 1 (Left "foo") == 1
  14255. 703.81 s [extra] +++ OK, passed 100 tests.
  14256. 703.81 s [extra] \x -> fromLeft' (Left x) == x
  14257. 703.82 s [extra] +++ OK, passed 100 tests.
  14258. 703.82 s [extra] \x -> fromLeft' (Right x) == undefined
  14259. 703.82 s [extra] +++ OK, passed 100 tests.
  14260. 703.82 s [extra] \x -> fromRight' (Right x) == x
  14261. 703.82 s [extra] +++ OK, passed 100 tests.
  14262. 703.82 s [extra] \x -> fromRight' (Left x) == undefined
  14263. 703.82 s [extra] +++ OK, passed 100 tests.
  14264. 703.82 s [extra] \x -> fromEither (Left x ) == x
  14265. 703.82 s [extra] +++ OK, passed 100 tests.
  14266. 703.82 s [extra] \x -> fromEither (Right x) == x
  14267. 703.82 s [extra] +++ OK, passed 100 tests.
  14268. 703.82 s [extra] \a b -> maybeToEither a (Just b) == Right b
  14269. 703.82 s [extra] +++ OK, passed 100 tests.
  14270. 703.82 s [extra] \a -> maybeToEither a Nothing == Left a
  14271. 703.82 s [extra] +++ OK, passed 100 tests.
  14272. 703.82 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  14273. 703.82 s [extra] +++ OK, passed 100 tests.
  14274. 703.82 s [extra] \x -> eitherToMaybe (Right x) == Just x
  14275. 703.82 s [extra] +++ OK, passed 100 tests.
  14276. 703.82 s [extra] mapLeft show (Left 1) == Left "1"
  14277. 703.82 s [extra] +++ OK, passed 100 tests.
  14278. 703.82 s [extra] mapLeft show (Right True) == Right True
  14279. 703.82 s [extra] +++ OK, passed 100 tests.
  14280. 703.82 s [extra] mapRight show (Left 1) == Left 1
  14281. 703.82 s [extra] +++ OK, passed 100 tests.
  14282. 703.82 s [extra] mapRight show (Right True) == Right "True"
  14283. 703.82 s [extra] +++ OK, passed 100 tests.
  14284. 703.82 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  14285. 703.82 s [extra] +++ OK, passed 100 tests.
  14286. 703.82 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  14287. 703.82 s [extra] +++ OK, passed 100 tests.
  14288. 703.82 s [extra] \xs -> repeatedly line1 xs == lines xs
  14289. 703.82 s [extra] +++ OK, passed 100 tests.
  14290. 703.82 s [extra] disjoint [1,2,3] [4,5] == True
  14291. 703.82 s [extra] +++ OK, passed 100 tests.
  14292. 703.82 s [extra] disjoint [1,2,3] [4,1] == False
  14293. 703.82 s [extra] +++ OK, passed 100 tests.
  14294. 703.82 s [extra] disjointOrd [1,2,3] [4,5] == True
  14295. 703.82 s [extra] +++ OK, passed 100 tests.
  14296. 703.82 s [extra] disjointOrd [1,2,3] [4,1] == False
  14297. 703.82 s [extra] +++ OK, passed 100 tests.
  14298. 703.82 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  14299. 703.82 s [extra] +++ OK, passed 100 tests.
  14300. 703.82 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  14301. 703.82 s [extra] +++ OK, passed 100 tests.
  14302. 703.82 s [extra] anySame [1,1,2] == True
  14303. 703.82 s [extra] +++ OK, passed 100 tests.
  14304. 703.82 s [extra] anySame [1,2,3] == False
  14305. 703.82 s [extra] +++ OK, passed 100 tests.
  14306. 703.82 s [extra] anySame (1:2:1:undefined) == True
  14307. 703.82 s [extra] +++ OK, passed 100 tests.
  14308. 703.82 s [extra] anySame [] == False
  14309. 703.82 s [extra] +++ OK, passed 100 tests.
  14310. 703.82 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  14311. 703.82 s [extra] +++ OK, passed 100 tests.
  14312. 703.82 s [extra] allSame [1,1,2] == False
  14313. 703.82 s [extra] +++ OK, passed 100 tests.
  14314. 703.82 s [extra] allSame [1,1,1] == True
  14315. 703.82 s [extra] +++ OK, passed 100 tests.
  14316. 703.82 s [extra] allSame [1] == True
  14317. 703.82 s [extra] +++ OK, passed 100 tests.
  14318. 703.82 s [extra] allSame [] == True
  14319. 703.82 s [extra] +++ OK, passed 100 tests.
  14320. 703.82 s [extra] allSame (1:1:2:undefined) == False
  14321. 703.82 s [extra] +++ OK, passed 100 tests.
  14322. 703.82 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  14323. 703.82 s [extra] +++ OK, passed 100 tests.
  14324. 703.82 s [extra] headDef 1 [] == 1
  14325. 703.82 s [extra] +++ OK, passed 100 tests.
  14326. 703.82 s [extra] headDef 1 [2,3,4] == 2
  14327. 703.82 s [extra] +++ OK, passed 100 tests.
  14328. 703.82 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  14329. 703.82 s [extra] +++ OK, passed 100 tests.
  14330. 703.82 s [extra] lastDef 1 [] == 1
  14331. 703.82 s [extra] +++ OK, passed 100 tests.
  14332. 703.82 s [extra] lastDef 1 [2,3,4] == 4
  14333. 703.82 s [extra] +++ OK, passed 100 tests.
  14334. 703.82 s [extra] \x xs -> lastDef x xs == last (x:xs)
  14335. 703.82 s [extra] +++ OK, passed 100 tests.
  14336. 703.82 s [extra] [2,3,4] !? 1 == Just 3
  14337. 703.82 s [extra] +++ OK, passed 100 tests.
  14338. 703.82 s [extra] [2,3,4] !? (-1) == Nothing
  14339. 703.82 s [extra] +++ OK, passed 100 tests.
  14340. 703.82 s [extra] [] !? 0 == Nothing
  14341. 703.82 s [extra] +++ OK, passed 100 tests.
  14342. 703.82 s [extra] notNull [] == False
  14343. 703.82 s [extra] +++ OK, passed 100 tests.
  14344. 703.82 s [extra] notNull [1] == True
  14345. 703.82 s [extra] +++ OK, passed 100 tests.
  14346. 703.82 s [extra] \xs -> notNull xs == not (null xs)
  14347. 703.82 s [extra] +++ OK, passed 100 tests.
  14348. 703.82 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  14349. 703.82 s [extra] +++ OK, passed 100 tests.
  14350. 703.82 s [extra] list 1 (\v _ -> v - 2) [] == 1
  14351. 703.82 s [extra] +++ OK, passed 100 tests.
  14352. 703.82 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  14353. 703.83 s [extra] +++ OK, passed 100 tests.
  14354. 703.83 s [extra] unsnoc "test" == Just ("tes",'t')
  14355. 703.83 s [extra] +++ OK, passed 100 tests.
  14356. 703.83 s [extra] unsnoc "" == Nothing
  14357. 703.83 s [extra] +++ OK, passed 100 tests.
  14358. 703.83 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  14359. 703.83 s [extra] +++ OK, passed 100 tests.
  14360. 703.83 s [extra] cons 't' "est" == "test"
  14361. 703.83 s [extra] +++ OK, passed 100 tests.
  14362. 703.83 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  14363. 703.83 s [extra] +++ OK, passed 100 tests.
  14364. 703.83 s [extra] snoc "tes" 't' == "test"
  14365. 703.83 s [extra] +++ OK, passed 100 tests.
  14366. 703.83 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  14367. 703.83 s [extra] +++ OK, passed 100 tests.
  14368. 703.83 s [extra] enumerate == [False, True]
  14369. 703.83 s [extra] +++ OK, passed 100 tests.
  14370. 703.83 s [extra] takeEnd 3 "hello" == "llo"
  14371. 703.83 s [extra] +++ OK, passed 100 tests.
  14372. 703.83 s [extra] takeEnd 5 "bye" == "bye"
  14373. 703.83 s [extra] +++ OK, passed 100 tests.
  14374. 703.83 s [extra] takeEnd (-1) "bye" == ""
  14375. 703.83 s [extra] +++ OK, passed 100 tests.
  14376. 703.83 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  14377. 703.83 s [extra] +++ OK, passed 100 tests.
  14378. 703.83 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  14379. 703.83 s [extra] +++ OK, passed 100 tests.
  14380. 703.83 s [extra] dropEnd 3 "hello" == "he"
  14381. 703.83 s [extra] +++ OK, passed 100 tests.
  14382. 703.83 s [extra] dropEnd 5 "bye" == ""
  14383. 703.83 s [extra] +++ OK, passed 100 tests.
  14384. 703.83 s [extra] dropEnd (-1) "bye" == "bye"
  14385. 703.83 s [extra] +++ OK, passed 100 tests.
  14386. 703.83 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  14387. 703.83 s [extra] +++ OK, passed 100 tests.
  14388. 703.83 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  14389. 703.83 s [extra] +++ OK, passed 100 tests.
  14390. 703.83 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  14391. 703.83 s [extra] +++ OK, passed 100 tests.
  14392. 703.83 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  14393. 703.83 s [extra] +++ OK, passed 100 tests.
  14394. 703.83 s [extra] splitAtEnd 3 "he" == ("", "he")
  14395. 703.83 s [extra] +++ OK, passed 100 tests.
  14396. 703.83 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  14397. 703.83 s [extra] +++ OK, passed 100 tests.
  14398. 703.83 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  14399. 703.83 s [extra] +++ OK, passed 100 tests.
  14400. 703.83 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  14401. 703.83 s [extra] +++ OK, passed 100 tests.
  14402. 703.83 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  14403. 703.83 s [extra] +++ OK, passed 100 tests.
  14404. 703.83 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  14405. 703.83 s [extra] +++ OK, passed 100 tests.
  14406. 703.83 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  14407. 703.83 s [extra] +++ OK, passed 100 tests.
  14408. 703.83 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  14409. 703.83 s [extra] +++ OK, passed 100 tests.
  14410. 703.83 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  14411. 703.83 s [extra] +++ OK, passed 100 tests.
  14412. 703.83 s [extra] trim " hello " == "hello"
  14413. 703.83 s [extra] +++ OK, passed 100 tests.
  14414. 703.83 s [extra] trimStart " hello " == "hello "
  14415. 703.83 s [extra] +++ OK, passed 100 tests.
  14416. 703.83 s [extra] trimEnd " hello " == " hello"
  14417. 703.83 s [extra] +++ OK, passed 100 tests.
  14418. 703.83 s [extra] \s -> trim s == trimEnd (trimStart s)
  14419. 703.83 s [extra] +++ OK, passed 100 tests.
  14420. 703.83 s [extra] lower "This is A TEST" == "this is a test"
  14421. 703.83 s [extra] +++ OK, passed 100 tests.
  14422. 703.83 s [extra] lower "" == ""
  14423. 703.83 s [extra] +++ OK, passed 100 tests.
  14424. 703.83 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  14425. 703.83 s [extra] +++ OK, passed 100 tests.
  14426. 703.83 s [extra] upper "" == ""
  14427. 703.83 s [extra] +++ OK, passed 100 tests.
  14428. 703.83 s [extra] word1 "" == ("", "")
  14429. 703.83 s [extra] +++ OK, passed 100 tests.
  14430. 703.83 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  14431. 703.83 s [extra] +++ OK, passed 100 tests.
  14432. 703.84 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  14433. 703.84 s [extra] +++ OK, passed 100 tests.
  14434. 703.84 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  14435. 703.84 s [extra] +++ OK, passed 100 tests.
  14436. 703.84 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  14437. 703.84 s [extra] +++ OK, passed 100 tests.
  14438. 703.84 s [extra] line1 "" == ("", "")
  14439. 703.84 s [extra] +++ OK, passed 100 tests.
  14440. 703.84 s [extra] line1 "test" == ("test","")
  14441. 703.84 s [extra] +++ OK, passed 100 tests.
  14442. 703.84 s [extra] line1 "test\n" == ("test","")
  14443. 703.84 s [extra] +++ OK, passed 100 tests.
  14444. 703.84 s [extra] line1 "test\nrest" == ("test","rest")
  14445. 703.84 s [extra] +++ OK, passed 100 tests.
  14446. 703.84 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  14447. 703.84 s [extra] +++ OK, passed 100 tests.
  14448. 703.84 s [extra] escapeHTML "this is a test" == "this is a test"
  14449. 703.84 s [extra] +++ OK, passed 100 tests.
  14450. 703.84 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  14451. 703.84 s [extra] +++ OK, passed 100 tests.
  14452. 703.84 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  14453. 703.84 s [extra] +++ OK, passed 100 tests.
  14454. 703.84 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  14455. 703.84 s [extra] +++ OK, passed 100 tests.
  14456. 703.84 s [extra] escapeJSON "this is a test" == "this is a test"
  14457. 703.84 s [extra] +++ OK, passed 100 tests.
  14458. 703.84 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  14459. 703.84 s [extra] +++ OK, passed 100 tests.
  14460. 703.84 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  14461. 703.84 s [extra] +++ OK, passed 100 tests.
  14462. 703.84 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  14463. 703.84 s [extra] +++ OK, passed 100 tests.
  14464. 703.84 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  14465. 703.84 s [extra] +++ OK, passed 100 tests.
  14466. 703.84 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  14467. 703.84 s [extra] +++ OK, passed 100 tests.
  14468. 703.84 s [extra] maximumOn id [] == undefined
  14469. 703.84 s [extra] +++ OK, passed 100 tests.
  14470. 703.84 s [extra] maximumOn length ["test","extra","a"] == "extra"
  14471. 703.84 s [extra] +++ OK, passed 100 tests.
  14472. 703.84 s [extra] minimumOn id [] == undefined
  14473. 703.84 s [extra] +++ OK, passed 100 tests.
  14474. 703.84 s [extra] minimumOn length ["test","extra","a"] == "a"
  14475. 703.84 s [extra] +++ OK, passed 100 tests.
  14476. 703.84 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  14477. 703.84 s [extra] +++ OK, passed 100 tests.
  14478. 703.84 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  14479. 703.84 s [extra] +++ OK, passed 100 tests.
  14480. 703.84 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  14481. 703.84 s [extra] +++ OK, passed 100 tests.
  14482. 703.84 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  14483. 703.84 s [extra] +++ OK, passed 100 tests.
  14484. 703.84 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  14485. 703.84 s [extra] +++ OK, passed 100 tests.
  14486. 703.84 s [extra] sum' [1, 2, 3] == 6
  14487. 703.84 s [extra] +++ OK, passed 100 tests.
  14488. 703.84 s [extra] sumOn' read ["1", "2", "3"] == 6
  14489. 703.84 s [extra] +++ OK, passed 100 tests.
  14490. 703.84 s [extra] product' [1, 2, 4] == 8
  14491. 703.84 s [extra] +++ OK, passed 100 tests.
  14492. 703.84 s [extra] productOn' read ["1", "2", "4"] == 8
  14493. 703.84 s [extra] +++ OK, passed 100 tests.
  14494. 703.84 s [extra] merge "ace" "bd" == "abcde"
  14495. 703.84 s [extra] +++ OK, passed 100 tests.
  14496. 703.84 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  14497. 703.84 s [extra] +++ OK, passed 100 tests.
  14498. 703.84 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  14499. 703.84 s [extra] +++ OK, passed 100 tests.
  14500. 703.84 s [extra] replace "el" "e" "Hello" == "Helo"
  14501. 703.84 s [extra] +++ OK, passed 100 tests.
  14502. 703.84 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  14503. 703.84 s [extra] +++ OK, passed 100 tests.
  14504. 703.84 s [extra] replace "" "x" "" == "x"
  14505. 703.84 s [extra] +++ OK, passed 100 tests.
  14506. 703.84 s [extra] \xs ys -> replace xs xs ys == ys
  14507. 703.84 s [extra] +++ OK, passed 100 tests.
  14508. 703.84 s [extra] breakEnd isLower "youRE" == ("you","RE")
  14509. 703.84 s [extra] +++ OK, passed 100 tests.
  14510. 703.84 s [extra] breakEnd isLower "youre" == ("youre","")
  14511. 703.84 s [extra] +++ OK, passed 100 tests.
  14512. 703.84 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  14513. 703.84 s [extra] +++ OK, passed 100 tests.
  14514. 703.84 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  14515. 703.84 s [extra] +++ OK, passed 100 tests.
  14516. 703.84 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  14517. 703.84 s [extra] +++ OK, passed 100 tests.
  14518. 703.84 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  14519. 703.84 s [extra] +++ OK, passed 100 tests.
  14520. 703.84 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  14521. 703.84 s [extra] +++ OK, passed 100 tests.
  14522. 703.84 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  14523. 703.85 s [extra] +++ OK, passed 100 tests.
  14524. 703.85 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  14525. 703.85 s [extra] +++ OK, passed 100 tests.
  14526. 703.85 s [extra] \s -> wordsBy isSpace s == words s
  14527. 703.85 s [extra] +++ OK, passed 100 tests.
  14528. 703.85 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  14529. 703.85 s [extra] +++ OK, passed 100 tests.
  14530. 703.85 s [extra] \s -> linesBy (== '\n') s == lines s
  14531. 703.85 s [extra] +++ OK, passed 100 tests.
  14532. 703.85 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  14533. 703.85 s [extra] +++ OK, passed 100 tests.
  14534. 703.85 s [extra] firstJust id [Nothing,Just 3] == Just 3
  14535. 703.85 s [extra] +++ OK, passed 100 tests.
  14536. 703.85 s [extra] firstJust id [Nothing,Nothing] == Nothing
  14537. 703.85 s [extra] +++ OK, passed 100 tests.
  14538. 703.85 s [extra] drop1 "" == ""
  14539. 703.85 s [extra] +++ OK, passed 100 tests.
  14540. 703.85 s [extra] drop1 "test" == "est"
  14541. 703.85 s [extra] +++ OK, passed 100 tests.
  14542. 703.85 s [extra] \xs -> drop 1 xs == drop1 xs
  14543. 703.85 s [extra] +++ OK, passed 100 tests.
  14544. 703.85 s [extra] dropEnd1 "" == ""
  14545. 703.85 s [extra] +++ OK, passed 100 tests.
  14546. 703.85 s [extra] dropEnd1 "test" == "tes"
  14547. 703.85 s [extra] +++ OK, passed 100 tests.
  14548. 703.85 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  14549. 703.85 s [extra] +++ OK, passed 100 tests.
  14550. 703.85 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  14551. 703.85 s [extra] +++ OK, passed 100 tests.
  14552. 703.85 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  14553. 703.86 s [extra] +++ OK, passed 100 tests.
  14554. 703.86 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  14555. 703.86 s [extra] +++ OK, passed 100 tests.
  14556. 703.86 s [extra] breakOn "/" "foobar" == ("foobar", "")
  14557. 703.86 s [extra] +++ OK, passed 100 tests.
  14558. 703.86 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  14559. 703.86 s [extra] +++ OK, passed 100 tests.
  14560. 703.86 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  14561. 703.86 s [extra] +++ OK, passed 100 tests.
  14562. 703.86 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  14563. 703.86 s [extra] +++ OK, passed 100 tests.
  14564. 703.86 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  14565. 703.86 s [extra] +++ OK, passed 100 tests.
  14566. 703.86 s [extra] splitOn "x" "x" == ["",""]
  14567. 703.86 s [extra] +++ OK, passed 100 tests.
  14568. 703.86 s [extra] splitOn "x" "" == [""]
  14569. 703.86 s [extra] +++ OK, passed 100 tests.
  14570. 703.86 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  14571. 703.86 s [extra] +++ OK, passed 100 tests; 12 discarded.
  14572. 703.86 s [extra] \c x -> splitOn [c] x == split (==c) x
  14573. 703.86 s [extra] +++ OK, passed 100 tests.
  14574. 703.86 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  14575. 703.86 s [extra] +++ OK, passed 100 tests.
  14576. 703.86 s [extra] split (== 'a') "" == [""]
  14577. 703.86 s [extra] +++ OK, passed 100 tests.
  14578. 703.86 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  14579. 703.86 s [extra] +++ OK, passed 100 tests.
  14580. 703.86 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  14581. 703.86 s [extra] +++ OK, passed 100 tests.
  14582. 703.86 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  14583. 703.86 s [extra] +++ OK, passed 100 tests.
  14584. 703.86 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  14585. 703.86 s [extra] +++ OK, passed 100 tests.
  14586. 703.86 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  14587. 703.86 s [extra] +++ OK, passed 100 tests.
  14588. 703.86 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  14589. 703.86 s [extra] +++ OK, passed 100 tests.
  14590. 703.86 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  14591. 703.86 s [extra] +++ OK, passed 100 tests.
  14592. 703.86 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  14593. 703.86 s [extra] +++ OK, passed 100 tests.
  14594. 703.86 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  14595. 703.86 s [extra] +++ OK, passed 100 tests.
  14596. 703.86 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  14597. 703.86 s [extra] +++ OK, passed 100 tests.
  14598. 703.86 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  14599. 703.86 s [extra] +++ OK, passed 100 tests.
  14600. 703.86 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  14601. 703.86 s [extra] +++ OK, passed 100 tests.
  14602. 703.86 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  14603. 703.86 s [extra] +++ OK, passed 100 tests.
  14604. 703.86 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  14605. 703.86 s [extra] +++ OK, passed 100 tests.
  14606. 703.86 s [extra] stripSuffix "" "baz" == Just "baz"
  14607. 703.86 s [extra] +++ OK, passed 100 tests.
  14608. 703.86 s [extra] stripSuffix "foo" "quux" == Nothing
  14609. 703.86 s [extra] +++ OK, passed 100 tests.
  14610. 703.86 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  14611. 703.86 s [extra] +++ OK, passed 100 tests.
  14612. 703.86 s [extra] stripInfix "/" "foobar" == Nothing
  14613. 703.86 s [extra] +++ OK, passed 100 tests.
  14614. 703.86 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  14615. 703.86 s [extra] +++ OK, passed 100 tests.
  14616. 703.86 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  14617. 703.86 s [extra] +++ OK, passed 100 tests.
  14618. 703.86 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  14619. 703.86 s [extra] +++ OK, passed 100 tests.
  14620. 703.86 s [extra] chunksOf 8 "" == []
  14621. 703.86 s [extra] +++ OK, passed 100 tests.
  14622. 703.86 s [extra] chunksOf 0 "test" == undefined
  14623. 703.86 s [extra] +++ OK, passed 100 tests.
  14624. 703.86 s [extra] nubSort "this is a test" == " aehist"
  14625. 703.86 s [extra] +++ OK, passed 100 tests.
  14626. 703.86 s [extra] \xs -> nubSort xs == nub (sort xs)
  14627. 703.87 s [extra] +++ OK, passed 100 tests.
  14628. 703.87 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  14629. 703.87 s [extra] +++ OK, passed 100 tests.
  14630. 703.87 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  14631. 703.87 s [extra] +++ OK, passed 100 tests.
  14632. 703.87 s [extra] nubOrd "this is a test" == "this ae"
  14633. 703.87 s [extra] +++ OK, passed 100 tests.
  14634. 703.87 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  14635. 703.87 s [extra] +++ OK, passed 100 tests.
  14636. 703.87 s [extra] \xs -> nubOrd xs == nub xs
  14637. 703.87 s [extra] +++ OK, passed 100 tests.
  14638. 703.87 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  14639. 703.87 s [extra] +++ OK, passed 100 tests.
  14640. 703.87 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  14641. 703.87 s [extra] +++ OK, passed 100 tests.
  14642. 703.87 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  14643. 703.87 s [extra] +++ OK, passed 100 tests.
  14644. 703.87 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  14645. 703.87 s [extra] +++ OK, passed 100 tests.
  14646. 703.87 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  14647. 703.87 s [extra] +++ OK, passed 100 tests.
  14648. 703.87 s [extra] comparingLength [1,2,3] [False] == GT
  14649. 703.87 s [extra] +++ OK, passed 100 tests.
  14650. 703.87 s [extra] comparingLength [1,2] "ab" == EQ
  14651. 703.87 s [extra] +++ OK, passed 100 tests.
  14652. 703.87 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  14653. 703.87 s [extra] +++ OK, passed 100 tests.
  14654. 703.87 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  14655. 703.87 s [extra] +++ OK, passed 100 tests.
  14656. 703.87 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  14657. 703.87 s [extra] +++ OK, passed 100 tests.
  14658. 703.87 s [extra] mwhen True "test" == "test"
  14659. 703.87 s [extra] +++ OK, passed 100 tests.
  14660. 703.87 s [extra] mwhen False "test" == ""
  14661. 703.87 s [extra] +++ OK, passed 100 tests.
  14662. 703.87 s [extra] first succ (1,"test") == (2,"test")
  14663. 703.87 s [extra] +++ OK, passed 100 tests.
  14664. 703.87 s [extra] second reverse (1,"test") == (1,"tset")
  14665. 703.87 s [extra] +++ OK, passed 100 tests.
  14666. 703.87 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  14667. 703.87 s [extra] +++ OK, passed 100 tests.
  14668. 703.87 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  14669. 703.87 s [extra] +++ OK, passed 100 tests.
  14670. 703.87 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  14671. 703.87 s [extra] +++ OK, passed 100 tests.
  14672. 703.87 s [extra] (succ &&& pred) 1 == (2,0)
  14673. 703.87 s [extra] +++ OK, passed 100 tests.
  14674. 703.87 s [extra] dupe 12 == (12, 12)
  14675. 703.87 s [extra] +++ OK, passed 100 tests.
  14676. 703.87 s [extra] both succ (1,2) == (2,3)
  14677. 703.87 s [extra] +++ OK, passed 100 tests.
  14678. 703.87 s [extra] first3 succ (1,1,1) == (2,1,1)
  14679. 703.87 s [extra] +++ OK, passed 100 tests.
  14680. 703.87 s [extra] second3 succ (1,1,1) == (1,2,1)
  14681. 703.87 s [extra] +++ OK, passed 100 tests.
  14682. 703.87 s [extra] third3 succ (1,1,1) == (1,1,2)
  14683. 703.87 s [extra] +++ OK, passed 100 tests.
  14684. 703.87 s [extra] \x -> readVersion (showVersion x) == x
  14685. 703.87 s [extra] +++ OK, passed 100 tests.
  14686. 703.87 s [extra] readVersion "hello" == undefined
  14687. 703.87 s [extra] +++ OK, passed 100 tests.
  14688. 703.87 s [extra] showDP 4 pi == "3.1416"
  14689. 703.87 s [extra] +++ OK, passed 100 tests.
  14690. 703.87 s [extra] showDP 0 pi == "3"
  14691. 703.87 s [extra] +++ OK, passed 100 tests.
  14692. 703.87 s [extra] showDP 2 3 == "3.00"
  14693. 703.87 s [extra] +++ OK, passed 100 tests.
  14694. 703.87 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  14695. 703.87 s [extra] +++ OK, passed 100 tests.
  14696. 703.87 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  14697. 703.87 s [extra] +++ OK, passed 100 tests.
  14698. 703.87 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  14699. 703.87 s [extra] +++ OK, passed 100 tests.
  14700. 703.87 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  14701. 703.87 s [extra] +++ OK, passed 100 tests.
  14702. 703.87 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  14703. 703.87 s [extra] +++ OK, passed 100 tests.
  14704. 703.87 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  14705. 703.87 s [extra] +++ OK, passed 100 tests.
  14706. 703.87 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  14707. 703.87 s [extra] +++ OK, passed 100 tests.
  14708. 703.87 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  14709. 703.87 s [extra] +++ OK, passed 100 tests.
  14710. 703.87 s [extra] isWindows == (os == "mingw32")
  14711. 703.87 s [extra] +++ OK, passed 100 tests.
  14712. 703.87 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  14713. 703.89 s [extra] +++ OK, passed 100 tests.
  14714. 703.89 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  14715. 703.90 s [extra] +++ OK, passed 100 tests.
  14716. 703.90 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  14717. 703.92 s [extra] +++ OK, passed 100 tests.
  14718. 703.92 s [extra] captureOutput (print 1) == pure ("1\n",())
  14719. 703.92 s [extra] +++ OK, passed 100 tests.
  14720. 703.92 s [extra] withTempFile doesFileExist == pure True
  14721. 703.92 s [extra] +++ OK, passed 100 tests.
  14722. 703.92 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  14723. 703.92 s [extra] +++ OK, passed 100 tests.
  14724. 703.92 s [extra] withTempFile readFile' == pure ""
  14725. 703.92 s [extra] +++ OK, passed 100 tests.
  14726. 703.92 s [extra] withTempDir doesDirectoryExist == pure True
  14727. 703.92 s [extra] +++ OK, passed 100 tests.
  14728. 703.92 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  14729. 703.92 s [extra] +++ OK, passed 100 tests.
  14730. 703.92 s [extra] withTempDir listFiles == pure []
  14731. 703.92 s [extra] +++ OK, passed 100 tests.
  14732. 703.92 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  14733. 703.92 s [extra] +++ OK, passed 100 tests.
  14734. 703.92 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  14735. 703.92 s [extra] +++ OK, passed 100 tests.
  14736. 703.92 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  14737. 703.92 s [extra] +++ OK, passed 100 tests.
  14738. 703.92 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  14739. 703.92 s [extra] +++ OK, passed 100 tests.
  14740. 703.92 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  14741. 703.92 s [extra] +++ OK, passed 100 tests.
  14742. 703.92 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  14743. 703.92 s [extra] +++ OK, passed 100 tests.
  14744. 703.92 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  14745. 704.92 s [extra] +++ OK, passed 100 tests.
  14746. 704.92 s [extra] timeout (-3) (print 1) == pure Nothing
  14747. 704.93 s [extra] +++ OK, passed 100 tests.
  14748. 704.93 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  14749. 704.93 s [extra] +++ OK, passed 100 tests.
  14750. 704.93 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  14751. 705.03 s [extra] 0.100381725
  14752. 705.03 s [extra] +++ OK, passed 100 tests.
  14753. 705.03 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  14754. 705.13 s [extra] +++ OK, passed 100 tests.
  14755. 705.13 s [extra] showDuration 3.435 == "3.44s"
  14756. 705.13 s [extra] +++ OK, passed 100 tests.
  14757. 705.13 s [extra] showDuration 623.8 == "10m24s"
  14758. 705.13 s [extra] +++ OK, passed 100 tests.
  14759. 705.13 s [extra] showDuration 62003.8 == "17h13m"
  14760. 705.13 s [extra] +++ OK, passed 100 tests.
  14761. 705.13 s [extra] showDuration 1e8 == "27777h47m"
  14762. 705.13 s [extra] +++ OK, passed 100 tests.
  14763. 705.13 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  14764. 705.13 s [extra] +++ OK, passed 100 tests.
  14765. 705.13 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  14766. 706.13 s [extra] +++ OK, passed 100 tests.
  14767. 706.13 s [extra] Extra export
  14768. 706.13 s [extra] +++ OK, passed 100 tests.
  14769. 706.13 s [extra] withTempFile
  14770. 706.14 s [extra] ....done
  14771. 706.14 s [extra] withTempDir
  14772. 706.17 s [extra] ....done
  14773. 706.17 s [extra] retry
  14774. 706.17 s [extra] +++ OK, passed 100 tests.
  14775. 706.17 s [extra] barrier
  14776. 706.17 s [extra] Success (325 tests)
  14777. 706.20 s [extra] Test suite extra-test: PASS
  14778. 706.20 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  14779. 706.20 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  14780. 706.21 s [extra] Phase: haddockPhase
  14781. 706.39 s [extra] Preprocessing library for extra-1.8.1..
  14782. 706.40 s [extra] Running Haddock on library for extra-1.8.1..
  14783. 706.47 s [extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  14784. 706.76 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  14785. 706.80 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  14786. 706.80 s [extra] Warning: 'Arrow' is out of scope.
  14787. 706.80 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  14788. 706.80 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  14789. 706.81 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  14790. 706.82 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  14791. 706.87 s [extra] Warning: '(:)' is out of scope.
  14792. 706.87 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  14793. 706.87 s [extra] Warning: 'firstJustM' is out of scope.
  14794. 706.87 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  14795. 706.87 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  14796. 706.95 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  14797. 706.96 s [extra] Warning: 'length' is ambiguous. It is defined
  14798. 706.96 s [extra] * in ‘Data.Foldable’
  14799. 706.96 s [extra] * in ‘Data.List.NonEmpty’
  14800. 706.96 s [extra] You may be able to disambiguate the identifier by qualifying it or
  14801. 706.96 s [extra] by specifying the type/value namespace explicitly.
  14802. 706.96 s [extra] Defaulting to the one defined in ‘Data.Foldable’
  14803. 706.96 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  14804. 706.97 s [extra] Warning: 'fromJust' is out of scope.
  14805. 706.97 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  14806. 706.97 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  14807. 706.99 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  14808. 707.01 s [extra] Warning: 'partition' is out of scope.
  14809. 707.01 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  14810. 707.01 s [extra] Warning: 'mconcatMap' is out of scope.
  14811. 707.01 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  14812. 707.01 s [extra] Warning: 'find' is out of scope.
  14813. 707.01 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  14814. 707.01 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  14815. 707.07 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  14816. 707.07 s [extra] Missing documentation for:
  14817. 707.07 s [extra] Module header
  14818. 707.09 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  14819. 707.11 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  14820. 707.11 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  14821. 707.14 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  14822. 707.15 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  14823. 707.15 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  14824. 707.16 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  14825. 707.24 s [extra] 100% (270 /270) in 'Extra'
  14826. 707.24 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  14827. 709.24 s [extra] Documentation created: dist/doc/html/extra/index.html,
  14828. 709.24 s [extra] dist/doc/html/extra/extra.txt
  14829. 709.40 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  14830. 709.40 s [extra] Phase: installPhase
  14831. 709.40 s [extra] Installing library in /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  14832. 709.84 s [extra] Phase: fixupPhase
  14833. 709.87 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1
  14834. 709.87 s [extra] shrinking /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSextra-1.8.1-BqjEmdQfbI9KG2nXkLylMj-ghc9.4.8.so
  14835. 709.90 s [extra] checking for references to /build/ in /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1...
  14836. 709.94 s [extra] patching script interpreter paths in /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1
  14837. 709.95 s [extra] stripping (with command strip and flags -S -p) in /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1/lib
  14838. 710.09 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/g138q7w85yggm8rrfqcqnadpszb5z3zb-extra-1.8.1-doc
  14839. 710.11 s [extra] checking for references to /build/ in /nix/store/g138q7w85yggm8rrfqcqnadpszb5z3zb-extra-1.8.1-doc...
  14840. 710.15 s [extra] patching script interpreter paths in /nix/store/g138q7w85yggm8rrfqcqnadpszb5z3zb-extra-1.8.1-doc
  14841. 710.29 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/g138q7w85yggm8rrfqcqnadpszb5z3zb-extra-1.8.1-doc /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1
  14842. 722.42 s [post-build-hook] Pushing 2 paths (39 are already present) using zstd to cache sellout ⏳
  14843. 722.42 s [post-build-hook]
  14844. 727.38 s [post-build-hook] Pushing /nix/store/g138q7w85yggm8rrfqcqnadpszb5z3zb-extra-1.8.1-doc (3.22 MiB)
  14845. 727.58 s [post-build-hook] Pushing /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1 (4.30 MiB)
  14846. 737.54 s [post-build-hook]
  14847. 737.54 s [post-build-hook] All done.
  14848. 737.58 s [post-build-hook] Uploading to the NixCI cache: /nix/store/g138q7w85yggm8rrfqcqnadpszb5z3zb-extra-1.8.1-doc /nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1
  14849. 737.64 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14850. 737.96 s [post-build-hook] copying 2 paths...
  14851. 737.96 s [post-build-hook] copying path '/nix/store/g138q7w85yggm8rrfqcqnadpszb5z3zb-extra-1.8.1-doc' to 'https://cache.nix-ci.com'...
  14852. 738.55 s [post-build-hook] copying path '/nix/store/ihfs3fw2q3r8vfwd2paijyzn14rx2hwz-extra-1.8.1' to 'https://cache.nix-ci.com'...
  14853. 739.73 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14854. 739.98 s [post-build-hook] copying 1 paths...
  14855. 739.98 s [post-build-hook] copying path '/nix/store/9hpl9z447dj5k65ghf36jg0kaw0ar7bj-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...
  14856. 740.20 s Progress: 5 of 10 built, 152 of 152 downloaded from cache
  14857. 740.25 s Building algebraic-graphs
  14858. 740.34 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  14859. 740.34 s [algebraic-graphs] Build with /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8.
  14860. 740.49 s [algebraic-graphs] Phase: unpackPhase
  14861. 740.50 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  14862. 740.51 s [algebraic-graphs] source root is algebraic-graphs-0.7
  14863. 740.52 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  14864. 740.52 s [algebraic-graphs] Phase: patchPhase
  14865. 740.53 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  14866. 740.54 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  14867. 740.54 s [algebraic-graphs] patching file algebraic-graphs.cabal
  14868. 740.54 s [algebraic-graphs] Phase: compileBuildDriverPhase
  14869. 740.55 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.IKqtPiztIt/setup-package.conf.d -threaded
  14870. 740.61 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.IKqtPiztIt/Main.o )
  14871. 740.66 s [algebraic-graphs] [2 of 2] Linking Setup
  14872. 741.72 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  14873. 741.73 s [algebraic-graphs] Phase: configurePhase
  14874. 741.74 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/bd0rv8qd20dfba7jwqs33dcw23plc5jq-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.IKqtPiztIt/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/lib
  14875. 742.29 s [algebraic-graphs] Using Parsec parser
  14876. 742.29 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  14877. 742.29 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.4.0
  14878. 742.29 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.17.2.1
  14879. 742.29 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  14880. 742.29 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.0
  14881. 742.29 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.5.6.2
  14882. 742.29 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  14883. 742.29 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  14884. 742.29 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.4.0
  14885. 742.29 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.17.2.1
  14886. 742.29 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  14887. 742.29 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.0
  14888. 742.29 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  14889. 742.29 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  14890. 742.29 s [algebraic-graphs] inspection-testing-0.6.2
  14891. 742.29 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.5.6.2
  14892. 742.58 s [algebraic-graphs] Source component graph:
  14893. 743.14 s [algebraic-graphs] component lib
  14894. 743.14 s [algebraic-graphs] component test:main dependency lib
  14895. 743.14 s [algebraic-graphs] Configured component graph:
  14896. 743.14 s [algebraic-graphs] component algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  14897. 743.14 s [algebraic-graphs] include array-0.5.4.0
  14898. 743.14 s [algebraic-graphs] include base-4.17.2.1
  14899. 743.14 s [algebraic-graphs] include containers-0.6.7
  14900. 743.14 s [algebraic-graphs] include deepseq-1.4.8.0
  14901. 743.14 s [algebraic-graphs] include transformers-0.5.6.2
  14902. 743.14 s [algebraic-graphs] component algebraic-graphs-0.7-CDF05JauRV59ivFa6tjL5p-main
  14903. 743.14 s [algebraic-graphs] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  14904. 743.14 s [algebraic-graphs] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  14905. 743.14 s [algebraic-graphs] include array-0.5.4.0
  14906. 743.14 s [algebraic-graphs] include base-4.17.2.1
  14907. 743.14 s [algebraic-graphs] include containers-0.6.7
  14908. 743.14 s [algebraic-graphs] include deepseq-1.4.8.0
  14909. 743.14 s [algebraic-graphs] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  14910. 743.14 s [algebraic-graphs] include inspection-testing-0.6.2-6gWzQuOn6w33uuxsSUSZFy
  14911. 743.14 s [algebraic-graphs] include transformers-0.5.6.2
  14912. 743.14 s [algebraic-graphs] Linked component graph:
  14913. 743.14 s [algebraic-graphs] unit algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  14914. 743.14 s [algebraic-graphs] include array-0.5.4.0
  14915. 743.14 s [algebraic-graphs] include base-4.17.2.1
  14916. 743.14 s [algebraic-graphs] include containers-0.6.7
  14917. 743.14 s [algebraic-graphs] include deepseq-1.4.8.0
  14918. 743.14 s [algebraic-graphs] include transformers-0.5.6.2
  14919. 743.14 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Data.Graph.Typed
  14920. 743.14 s [algebraic-graphs] unit algebraic-graphs-0.7-CDF05JauRV59ivFa6tjL5p-main
  14921. 743.14 s [algebraic-graphs] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  14922. 743.14 s [algebraic-graphs] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  14923. 743.14 s [algebraic-graphs] include array-0.5.4.0
  14924. 743.14 s [algebraic-graphs] include base-4.17.2.1
  14925. 743.14 s [algebraic-graphs] include containers-0.6.7
  14926. 743.14 s [algebraic-graphs] include deepseq-1.4.8.0
  14927. 743.14 s [algebraic-graphs] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  14928. 743.14 s [algebraic-graphs] include inspection-testing-0.6.2-6gWzQuOn6w33uuxsSUSZFy
  14929. 743.14 s [algebraic-graphs] include transformers-0.5.6.2
  14930. 743.14 s [algebraic-graphs] Ready component graph:
  14931. 743.14 s [algebraic-graphs] definite algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  14932. 743.14 s [algebraic-graphs] depends array-0.5.4.0
  14933. 743.14 s [algebraic-graphs] depends base-4.17.2.1
  14934. 743.14 s [algebraic-graphs] depends containers-0.6.7
  14935. 743.14 s [algebraic-graphs] depends deepseq-1.4.8.0
  14936. 743.14 s [algebraic-graphs] depends transformers-0.5.6.2
  14937. 743.14 s [algebraic-graphs] definite algebraic-graphs-0.7-CDF05JauRV59ivFa6tjL5p-main
  14938. 743.14 s [algebraic-graphs] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  14939. 743.14 s [algebraic-graphs] depends algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  14940. 743.14 s [algebraic-graphs] depends array-0.5.4.0
  14941. 743.14 s [algebraic-graphs] depends base-4.17.2.1
  14942. 743.14 s [algebraic-graphs] depends containers-0.6.7
  14943. 743.14 s [algebraic-graphs] depends deepseq-1.4.8.0
  14944. 743.14 s [algebraic-graphs] depends extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  14945. 743.14 s [algebraic-graphs] depends inspection-testing-0.6.2-6gWzQuOn6w33uuxsSUSZFy
  14946. 743.14 s [algebraic-graphs] depends transformers-0.5.6.2
  14947. 743.14 s [algebraic-graphs] Using Cabal-3.8.1.0 compiled by ghc-9.4
  14948. 743.14 s [algebraic-graphs] Using compiler: ghc-9.4.8
  14949. 743.14 s [algebraic-graphs] Using install prefix:
  14950. 743.14 s [algebraic-graphs] /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7
  14951. 743.14 s [algebraic-graphs] Executables installed in:
  14952. 743.14 s [algebraic-graphs] /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/bin
  14953. 743.14 s [algebraic-graphs] Libraries installed in:
  14954. 743.14 s [algebraic-graphs] /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  14955. 743.14 s [algebraic-graphs] Dynamic Libraries installed in:
  14956. 743.14 s [algebraic-graphs] /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  14957. 743.14 s [algebraic-graphs] Private executables installed in:
  14958. 743.14 s [algebraic-graphs] /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7
  14959. 743.14 s [algebraic-graphs] Data files installed in:
  14960. 743.14 s [algebraic-graphs] /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7
  14961. 743.14 s [algebraic-graphs] Documentation installed in:
  14962. 743.14 s [algebraic-graphs] /nix/store/bd0rv8qd20dfba7jwqs33dcw23plc5jq-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  14963. 743.14 s [algebraic-graphs] Configuration files installed in:
  14964. 743.14 s [algebraic-graphs] /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/etc
  14965. 743.14 s [algebraic-graphs] No alex found
  14966. 743.14 s [algebraic-graphs] Using ar found on system at:
  14967. 743.14 s [algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  14968. 743.14 s [algebraic-graphs] No c2hs found
  14969. 743.14 s [algebraic-graphs] No cpphs found
  14970. 743.14 s [algebraic-graphs] No doctest found
  14971. 743.14 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  14972. 743.14 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  14973. 743.14 s [algebraic-graphs] Using ghc version 9.4.8 found on system at:
  14974. 743.14 s [algebraic-graphs] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc
  14975. 743.14 s [algebraic-graphs] Using ghc-pkg version 9.4.8 found on system at:
  14976. 743.14 s [algebraic-graphs] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/ghc-pkg-9.4.8
  14977. 743.14 s [algebraic-graphs] No ghcjs found
  14978. 743.14 s [algebraic-graphs] No ghcjs-pkg found
  14979. 743.14 s [algebraic-graphs] No greencard found
  14980. 743.14 s [algebraic-graphs] Using haddock version 2.27.0 found on system at:
  14981. 743.14 s [algebraic-graphs] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/haddock-ghc-9.4.8
  14982. 743.14 s [algebraic-graphs] No happy found
  14983. 743.14 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  14984. 743.14 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14985. 743.14 s [algebraic-graphs] No hmake found
  14986. 743.14 s [algebraic-graphs] Using hpc version 0.68 found on system at:
  14987. 743.14 s [algebraic-graphs] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hpc
  14988. 743.14 s [algebraic-graphs] Using hsc2hs version 0.68.8 found on system at:
  14989. 743.14 s [algebraic-graphs] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/hsc2hs
  14990. 743.14 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  14991. 743.14 s [algebraic-graphs] /nix/store/iqxq9idsxcwnhgibgzzj6w82ba81jia4-hscolour-1.25/bin/HsColour
  14992. 743.14 s [algebraic-graphs] No jhc found
  14993. 743.14 s [algebraic-graphs] Using ld found on system at:
  14994. 743.14 s [algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  14995. 743.14 s [algebraic-graphs] No pkg-config found
  14996. 743.14 s [algebraic-graphs] Using runghc version 9.4.8 found on system at:
  14997. 743.14 s [algebraic-graphs] /nix/store/zjcf3fn8z875ar3hm0lpxsd2a5p5f5p9-ghc-9.4.8/bin/runghc-9.4.8
  14998. 743.14 s [algebraic-graphs] Using strip version 2.44 found on system at:
  14999. 743.14 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  15000. 743.14 s [algebraic-graphs] Using tar found on system at:
  15001. 743.14 s [algebraic-graphs] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  15002. 743.14 s [algebraic-graphs] No uhc found
  15003. 743.14 s [algebraic-graphs] Phase: buildPhase
  15004. 743.14 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  15005. 743.14 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  15006. 743.14 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 )
  15007. 743.55 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 )
  15008. 744.04 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 )
  15009. 744.35 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 )
  15010. 744.35 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  15011. 745.39 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 )
  15012. 745.62 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 )
  15013. 746.05 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 )
  15014. 746.62 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 )
  15015. 746.62 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 )
  15016. 746.62 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 )
  15017. 746.62 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 )
  15018. 746.62 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 )
  15019. 746.62 s [algebraic-graphs]
  15020. 746.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [-Wtype-equality-requires-operators]
  15021. 746.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15022. 746.62 s [algebraic-graphs] will become an error in a future GHC release.
  15023. 746.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15024. 746.62 s [algebraic-graphs] |
  15025. 746.62 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  15026. 746.62 s [algebraic-graphs] | ^
  15027. 746.62 s [algebraic-graphs]
  15028. 746.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [-Wtype-equality-requires-operators]
  15029. 746.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15030. 746.62 s [algebraic-graphs] will become an error in a future GHC release.
  15031. 746.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15032. 746.62 s [algebraic-graphs] |
  15033. 746.62 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  15034. 746.62 s [algebraic-graphs] | ^
  15035. 746.62 s [algebraic-graphs]
  15036. 746.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [-Wtype-equality-requires-operators]
  15037. 746.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15038. 746.62 s [algebraic-graphs] will become an error in a future GHC release.
  15039. 746.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15040. 746.62 s [algebraic-graphs] |
  15041. 746.62 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  15042. 746.62 s [algebraic-graphs] | ^
  15043. 746.62 s [algebraic-graphs]
  15044. 746.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [-Wtype-equality-requires-operators]
  15045. 746.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15046. 746.62 s [algebraic-graphs] will become an error in a future GHC release.
  15047. 746.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15048. 746.62 s [algebraic-graphs] |
  15049. 746.62 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  15050. 746.62 s [algebraic-graphs] | ^
  15051. 746.62 s [algebraic-graphs]
  15052. 746.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [-Wtype-equality-requires-operators]
  15053. 746.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15054. 746.62 s [algebraic-graphs] will become an error in a future GHC release.
  15055. 746.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15056. 746.62 s [algebraic-graphs] |
  15057. 746.62 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  15058. 746.62 s [algebraic-graphs] | ^
  15059. 746.62 s [algebraic-graphs]
  15060. 746.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [-Wtype-equality-requires-operators]
  15061. 746.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15062. 746.62 s [algebraic-graphs] will become an error in a future GHC release.
  15063. 746.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15064. 746.62 s [algebraic-graphs] |
  15065. 746.62 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  15066. 746.62 s [algebraic-graphs] | ^
  15067. 746.62 s [algebraic-graphs]
  15068. 746.62 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [-Wtype-equality-requires-operators]
  15069. 746.62 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15070. 746.62 s [algebraic-graphs] will become an error in a future GHC release.
  15071. 746.62 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15072. 746.62 s [algebraic-graphs] |
  15073. 746.62 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  15074. 746.62 s [algebraic-graphs] | ^
  15075. 746.62 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 )
  15076. 746.75 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 )
  15077. 747.04 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 )
  15078. 747.08 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 )
  15079. 747.08 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 )
  15080. 747.08 s [algebraic-graphs]
  15081. 747.08 s [algebraic-graphs] src/Algebra/Graph/Labelled.hs:74:10: warning: [-Wredundant-constraints]
  15082. 747.08 s [algebraic-graphs] • Redundant constraint: Eq e
  15083. 747.08 s [algebraic-graphs] • In the instance declaration for ‘Ord (Graph e a)’
  15084. 747.08 s [algebraic-graphs] |
  15085. 747.08 s [algebraic-graphs] 74 | instance (Eq e, Monoid e, Ord a, Ord e) => Ord (Graph e a) where
  15086. 747.08 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  15087. 747.43 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 )
  15088. 747.57 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 )
  15089. 747.73 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 )
  15090. 747.81 s [algebraic-graphs]
  15091. 747.81 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [-Wtype-equality-requires-operators]
  15092. 747.81 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15093. 747.81 s [algebraic-graphs] will become an error in a future GHC release.
  15094. 747.81 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15095. 747.81 s [algebraic-graphs] |
  15096. 747.81 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  15097. 747.81 s [algebraic-graphs] | ^
  15098. 747.81 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 )
  15099. 747.81 s [algebraic-graphs]
  15100. 747.81 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [-Wtype-equality-requires-operators]
  15101. 747.81 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15102. 747.82 s [algebraic-graphs] will become an error in a future GHC release.
  15103. 747.82 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15104. 747.82 s [algebraic-graphs] |
  15105. 747.82 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  15106. 747.82 s [algebraic-graphs] | ^
  15107. 747.82 s [algebraic-graphs]
  15108. 747.82 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [-Wtype-equality-requires-operators]
  15109. 747.82 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15110. 747.82 s [algebraic-graphs] will become an error in a future GHC release.
  15111. 747.82 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15112. 747.82 s [algebraic-graphs] |
  15113. 747.82 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  15114. 747.82 s [algebraic-graphs] | ^
  15115. 747.82 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 )
  15116. 747.82 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 )
  15117. 747.82 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 )
  15118. 747.82 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 )
  15119. 747.82 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 )
  15120. 747.82 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 )
  15121. 747.82 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 )
  15122. 747.98 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  15123. 748.73 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  15124. 749.21 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 )
  15125. 749.55 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  15126. 749.55 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  15127. 750.48 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 )
  15128. 750.84 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 )
  15129. 751.16 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 )
  15130. 751.73 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  15131. 751.73 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 )
  15132. 751.73 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 )
  15133. 751.73 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 )
  15134. 751.73 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  15135. 751.73 s [algebraic-graphs]
  15136. 751.73 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [-Wtype-equality-requires-operators]
  15137. 751.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15138. 751.73 s [algebraic-graphs] will become an error in a future GHC release.
  15139. 751.73 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15140. 751.73 s [algebraic-graphs] |
  15141. 751.73 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  15142. 751.73 s [algebraic-graphs] | ^
  15143. 751.73 s [algebraic-graphs]
  15144. 751.73 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [-Wtype-equality-requires-operators]
  15145. 751.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15146. 751.73 s [algebraic-graphs] will become an error in a future GHC release.
  15147. 751.73 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15148. 751.73 s [algebraic-graphs] |
  15149. 751.73 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  15150. 751.73 s [algebraic-graphs] | ^
  15151. 751.73 s [algebraic-graphs]
  15152. 751.73 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [-Wtype-equality-requires-operators]
  15153. 751.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15154. 751.73 s [algebraic-graphs] will become an error in a future GHC release.
  15155. 751.73 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15156. 751.73 s [algebraic-graphs] |
  15157. 751.73 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  15158. 751.73 s [algebraic-graphs] | ^
  15159. 751.73 s [algebraic-graphs]
  15160. 751.73 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [-Wtype-equality-requires-operators]
  15161. 751.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15162. 751.73 s [algebraic-graphs] will become an error in a future GHC release.
  15163. 751.73 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15164. 751.73 s [algebraic-graphs] |
  15165. 751.73 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  15166. 751.73 s [algebraic-graphs] | ^
  15167. 751.73 s [algebraic-graphs]
  15168. 751.73 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [-Wtype-equality-requires-operators]
  15169. 751.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15170. 751.73 s [algebraic-graphs] will become an error in a future GHC release.
  15171. 751.73 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15172. 751.73 s [algebraic-graphs] |
  15173. 751.73 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  15174. 751.73 s [algebraic-graphs] | ^
  15175. 751.73 s [algebraic-graphs]
  15176. 751.73 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [-Wtype-equality-requires-operators]
  15177. 751.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15178. 751.73 s [algebraic-graphs] will become an error in a future GHC release.
  15179. 751.73 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15180. 751.73 s [algebraic-graphs] |
  15181. 751.73 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  15182. 751.73 s [algebraic-graphs] | ^
  15183. 751.73 s [algebraic-graphs]
  15184. 751.73 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [-Wtype-equality-requires-operators]
  15185. 751.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15186. 751.73 s [algebraic-graphs] will become an error in a future GHC release.
  15187. 751.73 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15188. 751.73 s [algebraic-graphs] |
  15189. 751.73 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  15190. 751.73 s [algebraic-graphs] | ^
  15191. 751.73 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  15192. 751.84 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 )
  15193. 752.22 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  15194. 752.22 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 )
  15195. 752.22 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  15196. 752.22 s [algebraic-graphs]
  15197. 752.22 s [algebraic-graphs] src/Algebra/Graph/Labelled.hs:74:10: warning: [-Wredundant-constraints]
  15198. 752.22 s [algebraic-graphs] • Redundant constraint: Eq e
  15199. 752.22 s [algebraic-graphs] • In the instance declaration for ‘Ord (Graph e a)’
  15200. 752.22 s [algebraic-graphs] |
  15201. 752.22 s [algebraic-graphs] 74 | instance (Eq e, Monoid e, Ord a, Ord e) => Ord (Graph e a) where
  15202. 752.22 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  15203. 752.62 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 )
  15204. 752.83 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 )
  15205. 752.97 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  15206. 752.97 s [algebraic-graphs]
  15207. 752.97 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [-Wtype-equality-requires-operators]
  15208. 752.97 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15209. 752.97 s [algebraic-graphs] will become an error in a future GHC release.
  15210. 752.97 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15211. 752.97 s [algebraic-graphs] |
  15212. 752.97 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  15213. 752.97 s [algebraic-graphs] | ^
  15214. 752.97 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 )
  15215. 752.98 s [algebraic-graphs]
  15216. 752.98 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [-Wtype-equality-requires-operators]
  15217. 752.98 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15218. 752.98 s [algebraic-graphs] will become an error in a future GHC release.
  15219. 752.98 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15220. 752.98 s [algebraic-graphs] |
  15221. 752.98 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  15222. 752.98 s [algebraic-graphs] | ^
  15223. 752.98 s [algebraic-graphs]
  15224. 752.98 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [-Wtype-equality-requires-operators]
  15225. 752.98 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15226. 752.98 s [algebraic-graphs] will become an error in a future GHC release.
  15227. 752.98 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  15228. 752.98 s [algebraic-graphs] |
  15229. 752.98 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  15230. 752.98 s [algebraic-graphs] | ^
  15231. 752.98 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  15232. 752.98 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  15233. 752.98 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 )
  15234. 753.10 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 )
  15235. 753.10 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 )
  15236. 753.10 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 )
  15237. 753.14 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  15238. 754.34 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  15239. 754.34 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  15240. 754.48 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 )
  15241. 755.62 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 )
  15242. 758.00 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 )
  15243. 758.04 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 )
  15244. 758.15 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 )
  15245. 760.05 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 )
  15246. 760.05 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 )
  15247. 760.05 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 )
  15248. 762.88 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 )
  15249. 763.01 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 )
  15250. 763.05 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 )
  15251. 763.50 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 )
  15252. 763.50 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 )
  15253. 763.50 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 )
  15254. 764.40 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 )
  15255. 764.40 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 )
  15256. 764.40 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 )
  15257. 764.40 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 )
  15258. 764.40 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 )
  15259. 764.40 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 )
  15260. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  15261. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  15262. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  15263. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  15264. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.[] passed.
  15265. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  15266. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.[] passed.
  15267. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  15268. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.[] passed.
  15269. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  15270. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  15271. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.[] passed.
  15272. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  15273. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.[] passed.
  15274. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  15275. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.[] passed.
  15276. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  15277. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  15278. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  15279. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  15280. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  15281. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  15282. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  15283. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  15284. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  15285. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  15286. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  15287. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  15288. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  15289. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  15290. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  15291. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  15292. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  15293. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  15294. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.[] passed.
  15295. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  15296. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  15297. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  15298. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  15299. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.[] passed.
  15300. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  15301. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  15302. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  15303. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  15304. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  15305. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  15306. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.[] passed.
  15307. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  15308. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  15309. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  15310. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.[] passed.
  15311. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  15312. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  15313. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  15314. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  15315. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  15316. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  15317. 764.40 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  15318. 764.40 s [algebraic-graphs] inspection testing successful
  15319. 764.40 s [algebraic-graphs] expected successes: 58
  15320. 764.40 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 )
  15321. 764.40 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 )
  15322. 764.40 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 )
  15323. 765.10 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  15324. 765.87 s [algebraic-graphs] Phase: checkPhase
  15325. 765.90 s [algebraic-graphs] Running 1 test suites...
  15326. 765.90 s [algebraic-graphs] Test suite main: RUNNING...
  15327. 771.24 s [algebraic-graphs]
  15328. 771.24 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  15329. 771.28 s [algebraic-graphs] OK: show empty == "empty"
  15330. 771.28 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  15331. 771.28 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  15332. 771.28 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  15333. 771.28 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  15334. 771.28 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  15335. 771.28 s [algebraic-graphs]
  15336. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  15337. 771.28 s [algebraic-graphs] OK: fromAcyclic empty == empty
  15338. 771.28 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  15339. 771.28 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  15340. 771.28 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  15341. 771.28 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  15342. 771.28 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  15343. 771.28 s [algebraic-graphs]
  15344. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  15345. 771.28 s [algebraic-graphs] OK: isEmpty empty == True
  15346. 771.28 s [algebraic-graphs] OK: hasVertex x empty == False
  15347. 771.28 s [algebraic-graphs] OK: vertexCount empty == 0
  15348. 771.28 s [algebraic-graphs] OK: edgeCount empty == 0
  15349. 771.28 s [algebraic-graphs]
  15350. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  15351. 771.28 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  15352. 771.28 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  15353. 771.28 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  15354. 771.28 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  15355. 771.28 s [algebraic-graphs]
  15356. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  15357. 771.28 s [algebraic-graphs] OK: vertices [] == empty
  15358. 771.28 s [algebraic-graphs] OK: vertices [x] == vertex x
  15359. 771.28 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  15360. 771.28 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  15361. 771.28 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  15362. 771.28 s [algebraic-graphs]
  15363. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  15364. 771.28 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  15365. 771.28 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  15366. 771.28 s [algebraic-graphs]
  15367. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  15368. 771.28 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  15369. 771.28 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  15370. 771.28 s [algebraic-graphs]
  15371. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  15372. 771.28 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  15373. 771.28 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  15374. 771.28 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  15375. 771.28 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  15376. 771.28 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  15377. 771.28 s [algebraic-graphs]
  15378. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  15379. 771.28 s [algebraic-graphs] OK: isEmpty empty == True
  15380. 771.28 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  15381. 771.28 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  15382. 771.28 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  15383. 771.28 s [algebraic-graphs]
  15384. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  15385. 771.28 s [algebraic-graphs] OK: hasVertex x empty == False
  15386. 771.28 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  15387. 771.28 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  15388. 771.28 s [algebraic-graphs]
  15389. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  15390. 771.28 s [algebraic-graphs] OK: hasEdge x y empty == False
  15391. 771.28 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  15392. 771.28 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  15393. 771.28 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  15394. 771.28 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  15395. 771.28 s [algebraic-graphs]
  15396. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  15397. 771.28 s [algebraic-graphs] OK: vertexCount empty == 0
  15398. 771.28 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  15399. 771.28 s [algebraic-graphs] OK: vertexCount == length . vertexList
  15400. 771.28 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  15401. 771.28 s [algebraic-graphs]
  15402. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  15403. 771.28 s [algebraic-graphs] OK: edgeCount empty == 0
  15404. 771.28 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  15405. 771.28 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  15406. 771.28 s [algebraic-graphs] OK: edgeCount == length . edgeList
  15407. 771.28 s [algebraic-graphs]
  15408. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  15409. 771.28 s [algebraic-graphs] OK: vertexList empty == []
  15410. 771.28 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  15411. 771.28 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  15412. 771.28 s [algebraic-graphs]
  15413. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  15414. 771.28 s [algebraic-graphs] OK: edgeList empty == []
  15415. 771.28 s [algebraic-graphs] OK: edgeList (vertex x) == []
  15416. 771.28 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  15417. 771.28 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  15418. 771.28 s [algebraic-graphs]
  15419. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  15420. 771.28 s [algebraic-graphs] OK: adjacencyList empty == []
  15421. 771.28 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  15422. 771.28 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  15423. 771.28 s [algebraic-graphs]
  15424. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  15425. 771.28 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  15426. 771.28 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  15427. 771.28 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  15428. 771.28 s [algebraic-graphs]
  15429. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  15430. 771.28 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  15431. 771.28 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  15432. 771.28 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  15433. 771.28 s [algebraic-graphs]
  15434. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  15435. 771.28 s [algebraic-graphs] OK: preSet x empty == Set.empty
  15436. 771.28 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  15437. 771.28 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  15438. 771.28 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  15439. 771.28 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  15440. 771.28 s [algebraic-graphs]
  15441. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  15442. 771.28 s [algebraic-graphs] OK: postSet x empty == Set.empty
  15443. 771.28 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  15444. 771.28 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  15445. 771.28 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  15446. 771.28 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  15447. 771.28 s [algebraic-graphs]
  15448. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  15449. 771.28 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  15450. 771.28 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  15451. 771.28 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  15452. 771.28 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  15453. 771.28 s [algebraic-graphs]
  15454. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  15455. 771.28 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  15456. 771.28 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  15457. 771.28 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  15458. 771.28 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  15459. 771.28 s [algebraic-graphs]
  15460. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  15461. 771.28 s [algebraic-graphs] OK: transpose empty == empty
  15462. 771.28 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  15463. 771.28 s [algebraic-graphs] OK: transpose . transpose == id
  15464. 771.28 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  15465. 771.28 s [algebraic-graphs]
  15466. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  15467. 771.28 s [algebraic-graphs] OK: induce (const True ) x == x
  15468. 771.28 s [algebraic-graphs] OK: induce (const False) x == empty
  15469. 771.28 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  15470. 771.28 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  15471. 771.28 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  15472. 771.28 s [algebraic-graphs]
  15473. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  15474. 771.28 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  15475. 771.28 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  15476. 771.28 s [algebraic-graphs]
  15477. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  15478. 771.28 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  15479. 771.28 s [algebraic-graphs]
  15480. 771.28 s [algebraic-graphs] OK: box x y ~~ box y x
  15481. 771.28 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  15482. 771.28 s [algebraic-graphs] OK: box x empty ~~ empty
  15483. 771.28 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  15484. 771.28 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  15485. 771.28 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  15486. 771.28 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  15487. 771.28 s [algebraic-graphs]
  15488. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  15489. 771.28 s [algebraic-graphs] OK: transitiveClosure empty == empty
  15490. 771.28 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  15491. 771.28 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  15492. 771.28 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  15493. 771.28 s [algebraic-graphs]
  15494. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  15495. 771.28 s [algebraic-graphs] OK: topSort empty == []
  15496. 771.28 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  15497. 771.28 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  15498. 771.28 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  15499. 771.28 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  15500. 771.28 s [algebraic-graphs]
  15501. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  15502. 771.28 s [algebraic-graphs] OK: scc empty == empty
  15503. 771.28 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  15504. 771.28 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  15505. 771.28 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  15506. 771.28 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  15507. 771.28 s [algebraic-graphs]
  15508. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  15509. 771.28 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  15510. 771.28 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  15511. 771.28 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  15512. 771.28 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  15513. 771.28 s [algebraic-graphs]
  15514. 771.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  15515. 771.28 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  15516. 771.28 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  15517. 771.28 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  15518. 771.28 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  15519. 771.28 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  15520. 771.28 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  15521. 774.00 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  15522. 774.00 s [algebraic-graphs]
  15523. 774.00 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  15524. 774.00 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  15525. 774.00 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  15526. 774.00 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  15527. 774.00 s [algebraic-graphs]
  15528. 774.00 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  15529. 774.00 s [algebraic-graphs] OK: Arbitrary
  15530. 774.00 s [algebraic-graphs] OK: empty
  15531. 774.00 s [algebraic-graphs] OK: vertex
  15532. 774.00 s [algebraic-graphs] OK: vertices
  15533. 774.00 s [algebraic-graphs] OK: union
  15534. 774.00 s [algebraic-graphs] OK: join
  15535. 774.00 s [algebraic-graphs] OK: transpose
  15536. 774.00 s [algebraic-graphs] OK: box
  15537. 774.00 s [algebraic-graphs] OK: transitiveClosure
  15538. 774.00 s [algebraic-graphs] OK: scc
  15539. 774.00 s [algebraic-graphs] OK: toAcyclic
  15540. 774.00 s [algebraic-graphs] OK: toAcyclicOrd
  15541. 774.00 s [algebraic-graphs]
  15542. 774.00 s [algebraic-graphs] ============ AdjacencyIntMap ============
  15543. 774.00 s [algebraic-graphs] OK: Axioms of graphs
  15544. 774.00 s [algebraic-graphs]
  15545. 774.00 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  15546. 774.00 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  15547. 774.00 s [algebraic-graphs]
  15548. 774.00 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  15549. 774.00 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  15550. 774.00 s [algebraic-graphs]
  15551. 774.00 s [algebraic-graphs] OK: consistent empty == True
  15552. 774.00 s [algebraic-graphs] OK: consistent (vertex x) == True
  15553. 774.00 s [algebraic-graphs] OK: consistent (overlay x y) == True
  15554. 774.00 s [algebraic-graphs] OK: consistent (connect x y) == True
  15555. 774.00 s [algebraic-graphs] OK: consistent (edge x y) == True
  15556. 774.00 s [algebraic-graphs] OK: consistent (edges xs) == True
  15557. 774.00 s [algebraic-graphs] OK: consistent (stars xs) == True
  15558. 774.01 s [algebraic-graphs]
  15559. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  15560. 774.01 s [algebraic-graphs] OK: show (empty ) == "empty"
  15561. 774.01 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  15562. 774.01 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  15563. 774.01 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  15564. 774.01 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  15565. 774.01 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  15566. 774.01 s [algebraic-graphs]
  15567. 774.01 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  15568. 774.01 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  15569. 774.01 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  15570. 774.01 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  15571. 774.01 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  15572. 774.01 s [algebraic-graphs]
  15573. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  15574. 774.01 s [algebraic-graphs] OK: vertex 1 < vertex 2
  15575. 774.01 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  15576. 774.01 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  15577. 774.01 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  15578. 774.01 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  15579. 774.01 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  15580. 774.01 s [algebraic-graphs] OK: x <= x + y
  15581. 774.01 s [algebraic-graphs] OK: x + y <= x * y
  15582. 774.01 s [algebraic-graphs]
  15583. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  15584. 774.01 s [algebraic-graphs] OK: isEmpty empty == True
  15585. 774.01 s [algebraic-graphs] OK: hasVertex x empty == False
  15586. 774.01 s [algebraic-graphs] OK: vertexCount empty == 0
  15587. 774.01 s [algebraic-graphs] OK: edgeCount empty == 0
  15588. 774.01 s [algebraic-graphs]
  15589. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  15590. 774.01 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  15591. 774.01 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  15592. 774.01 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  15593. 774.01 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  15594. 774.01 s [algebraic-graphs]
  15595. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  15596. 774.01 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  15597. 774.01 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  15598. 774.01 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  15599. 774.01 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  15600. 774.01 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  15601. 774.01 s [algebraic-graphs]
  15602. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  15603. 774.01 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  15604. 774.01 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  15605. 774.01 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  15606. 774.01 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  15607. 774.01 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  15608. 774.01 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  15609. 774.01 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  15610. 774.01 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  15611. 774.01 s [algebraic-graphs]
  15612. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  15613. 774.01 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  15614. 774.01 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  15615. 774.01 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  15616. 774.01 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  15617. 774.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  15618. 774.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  15619. 774.01 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  15620. 774.01 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  15621. 774.01 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  15622. 774.01 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  15623. 774.01 s [algebraic-graphs]
  15624. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  15625. 774.01 s [algebraic-graphs] OK: vertices [] == empty
  15626. 774.01 s [algebraic-graphs] OK: vertices [x] == vertex x
  15627. 774.01 s [algebraic-graphs] OK: vertices == overlays . map vertex
  15628. 774.01 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  15629. 774.01 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  15630. 774.01 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  15631. 774.01 s [algebraic-graphs]
  15632. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  15633. 774.01 s [algebraic-graphs] OK: edges [] == empty
  15634. 774.01 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  15635. 774.01 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  15636. 774.01 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  15637. 774.01 s [algebraic-graphs]
  15638. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  15639. 774.01 s [algebraic-graphs] OK: overlays [] == empty
  15640. 774.01 s [algebraic-graphs] OK: overlays [x] == x
  15641. 774.01 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  15642. 774.01 s [algebraic-graphs] OK: overlays == foldr overlay empty
  15643. 774.01 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  15644. 774.01 s [algebraic-graphs]
  15645. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  15646. 774.01 s [algebraic-graphs] OK: connects [] == empty
  15647. 774.01 s [algebraic-graphs] OK: connects [x] == x
  15648. 774.01 s [algebraic-graphs] OK: connects [x,y] == connect x y
  15649. 774.01 s [algebraic-graphs] OK: connects == foldr connect empty
  15650. 774.01 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  15651. 774.01 s [algebraic-graphs]
  15652. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  15653. 774.01 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  15654. 774.01 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  15655. 774.01 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  15656. 774.01 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  15657. 774.01 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  15658. 774.01 s [algebraic-graphs]
  15659. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  15660. 774.01 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  15661. 774.01 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  15662. 774.01 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  15663. 774.01 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  15664. 774.01 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  15665. 774.01 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  15666. 774.01 s [algebraic-graphs]
  15667. 774.01 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  15668. 774.01 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  15669. 774.01 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  15670. 774.01 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  15671. 774.01 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  15672. 774.01 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  15673. 774.01 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  15674. 774.01 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  15675. 774.01 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  15676. 774.01 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  15677. 774.01 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  15678. 774.01 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  15679. 774.01 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  15680. 774.01 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  15681. 774.01 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  15682. 774.01 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  15683. 774.01 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  15684. 774.01 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  15685. 774.01 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  15686. 774.01 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  15687. 774.01 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  15688. 774.01 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  15689. 774.01 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  15690. 774.01 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  15691. 774.01 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  15692. 774.01 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  15693. 774.01 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  15694. 774.01 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  15695. 774.01 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  15696. 774.01 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  15697. 774.01 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  15698. 774.01 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  15699. 774.01 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  15700. 774.01 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  15701. 774.01 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  15702. 774.68 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  15703. 774.68 s [algebraic-graphs]
  15704. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  15705. 774.68 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  15706. 774.68 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  15707. 774.68 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  15708. 774.68 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  15709. 774.68 s [algebraic-graphs]
  15710. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  15711. 774.68 s [algebraic-graphs] OK: isEmpty empty == True
  15712. 774.68 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  15713. 774.68 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  15714. 774.68 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  15715. 774.68 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  15716. 774.68 s [algebraic-graphs]
  15717. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  15718. 774.68 s [algebraic-graphs] OK: hasVertex x empty == False
  15719. 774.68 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  15720. 774.68 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  15721. 774.68 s [algebraic-graphs]
  15722. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  15723. 774.68 s [algebraic-graphs] OK: hasEdge x y empty == False
  15724. 774.68 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  15725. 774.68 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  15726. 774.68 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  15727. 774.68 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  15728. 774.68 s [algebraic-graphs]
  15729. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  15730. 774.68 s [algebraic-graphs] OK: vertexCount empty == 0
  15731. 774.68 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  15732. 774.68 s [algebraic-graphs] OK: vertexCount == length . vertexList
  15733. 774.68 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  15734. 774.68 s [algebraic-graphs]
  15735. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  15736. 774.68 s [algebraic-graphs] OK: edgeCount empty == 0
  15737. 774.68 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  15738. 774.68 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  15739. 774.68 s [algebraic-graphs] OK: edgeCount == length . edgeList
  15740. 774.68 s [algebraic-graphs]
  15741. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  15742. 774.68 s [algebraic-graphs] OK: vertexList empty == []
  15743. 774.68 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  15744. 774.68 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  15745. 774.68 s [algebraic-graphs]
  15746. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  15747. 774.68 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  15748. 774.68 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  15749. 774.68 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  15750. 774.68 s [algebraic-graphs]
  15751. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  15752. 774.68 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  15753. 774.68 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  15754. 774.68 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  15755. 774.68 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  15756. 774.68 s [algebraic-graphs]
  15757. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  15758. 774.68 s [algebraic-graphs] OK: edgeList empty == []
  15759. 774.68 s [algebraic-graphs] OK: edgeList (vertex x) == []
  15760. 774.68 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  15761. 774.68 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  15762. 774.68 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  15763. 774.68 s [algebraic-graphs]
  15764. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  15765. 774.68 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  15766. 774.68 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  15767. 774.68 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  15768. 774.68 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  15769. 774.68 s [algebraic-graphs]
  15770. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  15771. 774.68 s [algebraic-graphs] OK: adjacencyList empty == []
  15772. 774.68 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  15773. 774.68 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  15774. 774.68 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  15775. 774.68 s [algebraic-graphs]
  15776. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  15777. 774.68 s [algebraic-graphs] OK: preSet x empty == Set.empty
  15778. 774.68 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  15779. 774.68 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  15780. 774.68 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  15781. 774.68 s [algebraic-graphs]
  15782. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  15783. 774.68 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  15784. 774.68 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  15785. 774.68 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  15786. 774.68 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  15787. 774.68 s [algebraic-graphs]
  15788. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  15789. 774.68 s [algebraic-graphs] OK: postSet x empty == Set.empty
  15790. 774.68 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  15791. 774.68 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  15792. 774.68 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  15793. 774.68 s [algebraic-graphs]
  15794. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  15795. 774.68 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  15796. 774.68 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  15797. 774.68 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  15798. 774.68 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  15799. 774.68 s [algebraic-graphs]
  15800. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  15801. 774.68 s [algebraic-graphs] OK: path [] == empty
  15802. 774.68 s [algebraic-graphs] OK: path [x] == vertex x
  15803. 774.68 s [algebraic-graphs] OK: path [x,y] == edge x y
  15804. 774.68 s [algebraic-graphs]
  15805. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  15806. 774.68 s [algebraic-graphs] OK: circuit [] == empty
  15807. 774.68 s [algebraic-graphs] OK: circuit [x] == edge x x
  15808. 774.68 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  15809. 774.68 s [algebraic-graphs]
  15810. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  15811. 774.68 s [algebraic-graphs] OK: clique [] == empty
  15812. 774.68 s [algebraic-graphs] OK: clique [x] == vertex x
  15813. 774.68 s [algebraic-graphs] OK: clique [x,y] == edge x y
  15814. 774.68 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  15815. 774.68 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  15816. 774.68 s [algebraic-graphs]
  15817. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  15818. 774.68 s [algebraic-graphs] OK: biclique [] [] == empty
  15819. 774.68 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  15820. 774.68 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  15821. 774.68 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  15822. 774.68 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  15823. 774.68 s [algebraic-graphs]
  15824. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  15825. 774.68 s [algebraic-graphs] OK: star x [] == vertex x
  15826. 774.68 s [algebraic-graphs] OK: star x [y] == edge x y
  15827. 774.68 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  15828. 774.68 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  15829. 774.68 s [algebraic-graphs]
  15830. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  15831. 774.68 s [algebraic-graphs] OK: stars [] == empty
  15832. 774.68 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  15833. 774.68 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  15834. 774.68 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  15835. 774.68 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  15836. 774.68 s [algebraic-graphs] OK: stars . adjacencyList == id
  15837. 774.68 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  15838. 774.68 s [algebraic-graphs]
  15839. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  15840. 774.68 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  15841. 774.68 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  15842. 774.68 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  15843. 774.68 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  15844. 774.68 s [algebraic-graphs]
  15845. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  15846. 774.68 s [algebraic-graphs] OK: forest [] == empty
  15847. 774.68 s [algebraic-graphs] OK: forest [x] == tree x
  15848. 774.68 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  15849. 774.68 s [algebraic-graphs] OK: forest == overlays . map tree
  15850. 774.68 s [algebraic-graphs]
  15851. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  15852. 774.68 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  15853. 774.68 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  15854. 774.68 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  15855. 774.68 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  15856. 774.68 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  15857. 774.68 s [algebraic-graphs]
  15858. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  15859. 774.68 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  15860. 774.68 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  15861. 774.68 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  15862. 774.68 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  15863. 774.68 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  15864. 774.68 s [algebraic-graphs]
  15865. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  15866. 774.68 s [algebraic-graphs] OK: replaceVertex x x == id
  15867. 774.68 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  15868. 774.68 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  15869. 774.68 s [algebraic-graphs]
  15870. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  15871. 774.68 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  15872. 774.68 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  15873. 774.68 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  15874. 774.68 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  15875. 774.68 s [algebraic-graphs]
  15876. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  15877. 774.68 s [algebraic-graphs] OK: transpose empty == empty
  15878. 774.68 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  15879. 774.68 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  15880. 774.68 s [algebraic-graphs] OK: transpose . transpose == id
  15881. 774.68 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  15882. 774.68 s [algebraic-graphs]
  15883. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  15884. 774.68 s [algebraic-graphs] OK: gmap f empty == empty
  15885. 774.68 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  15886. 774.68 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  15887. 774.68 s [algebraic-graphs] OK: gmap id == id
  15888. 774.68 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  15889. 774.68 s [algebraic-graphs]
  15890. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  15891. 774.68 s [algebraic-graphs] OK: induce (const True ) x == x
  15892. 774.68 s [algebraic-graphs] OK: induce (const False) x == empty
  15893. 774.68 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  15894. 774.68 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  15895. 774.68 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  15896. 774.68 s [algebraic-graphs]
  15897. 774.68 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  15898. 774.68 s [algebraic-graphs] OK: compose empty x == empty
  15899. 774.68 s [algebraic-graphs] OK: compose x empty == empty
  15900. 774.68 s [algebraic-graphs] OK: compose (vertex x) y == empty
  15901. 774.68 s [algebraic-graphs] OK: compose x (vertex y) == empty
  15902. 774.68 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  15903. 774.68 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  15904. 774.89 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  15905. 774.89 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  15906. 774.89 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  15907. 774.89 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  15908. 774.89 s [algebraic-graphs]
  15909. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  15910. 774.89 s [algebraic-graphs] OK: closure empty == empty
  15911. 774.89 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  15912. 774.89 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  15913. 774.89 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  15914. 774.89 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  15915. 774.89 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  15916. 774.89 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  15917. 774.89 s [algebraic-graphs] OK: closure . closure == closure
  15918. 774.89 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  15919. 774.89 s [algebraic-graphs]
  15920. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  15921. 774.89 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  15922. 774.89 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  15923. 774.89 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  15924. 774.89 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  15925. 774.89 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  15926. 774.89 s [algebraic-graphs]
  15927. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  15928. 774.89 s [algebraic-graphs] OK: symmetricClosure empty == empty
  15929. 774.89 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  15930. 774.89 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  15931. 774.89 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  15932. 774.89 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  15933. 774.89 s [algebraic-graphs]
  15934. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  15935. 774.89 s [algebraic-graphs] OK: transitiveClosure empty == empty
  15936. 774.89 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  15937. 774.89 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  15938. 774.89 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  15939. 774.89 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  15940. 774.89 s [algebraic-graphs]
  15941. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  15942. 774.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  15943. 774.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  15944. 774.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  15945. 774.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  15946. 774.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  15947. 774.89 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  15948. 774.89 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  15949. 774.89 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  15950. 774.89 s [algebraic-graphs] OK: bfsForest x [] == []
  15951. 774.89 s [algebraic-graphs] OK: bfsForest empty vs == []
  15952. 774.89 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  15953. 774.89 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  15954. 774.89 s [algebraic-graphs]
  15955. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  15956. 774.89 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  15957. 774.89 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  15958. 774.89 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  15959. 774.89 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  15960. 774.89 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  15961. 774.89 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  15962. 774.89 s [algebraic-graphs] OK: bfs empty vs == []
  15963. 774.89 s [algebraic-graphs] OK: bfs x [] == []
  15964. 774.89 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  15965. 774.89 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  15966. 774.89 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  15967. 774.89 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  15968. 774.89 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  15969. 774.89 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  15970. 774.89 s [algebraic-graphs]
  15971. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  15972. 774.89 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  15973. 774.89 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  15974. 774.89 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  15975. 774.89 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  15976. 774.89 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  15977. 774.89 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  15978. 774.89 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  15979. 774.89 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  15980. 774.89 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  15981. 774.89 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  15982. 774.89 s [algebraic-graphs]
  15983. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  15984. 774.89 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  15985. 774.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  15986. 774.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  15987. 774.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  15988. 774.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  15989. 774.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  15990. 774.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  15991. 774.89 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  15992. 774.89 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  15993. 774.89 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  15994. 774.89 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  15995. 774.89 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  15996. 774.89 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  15997. 774.89 s [algebraic-graphs]
  15998. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  15999. 774.89 s [algebraic-graphs] OK: dfs empty vs == []
  16000. 774.89 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  16001. 774.89 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  16002. 774.89 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  16003. 774.89 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  16004. 774.89 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  16005. 774.89 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  16006. 774.89 s [algebraic-graphs] OK: dfs x [] == []
  16007. 774.89 s [algebraic-graphs]
  16008. 774.89 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  16009. 774.89 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  16010. 774.89 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  16011. 774.89 s [algebraic-graphs]
  16012. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  16013. 774.89 s [algebraic-graphs] OK: reachable empty x == []
  16014. 774.89 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  16015. 774.89 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  16016. 774.89 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  16017. 774.89 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  16018. 774.89 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  16019. 774.89 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  16020. 774.89 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  16021. 774.89 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  16022. 774.89 s [algebraic-graphs]
  16023. 774.89 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  16024. 774.89 s [algebraic-graphs]
  16025. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  16026. 774.89 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  16027. 774.89 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  16028. 774.89 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  16029. 774.89 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  16030. 774.89 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  16031. 774.89 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  16032. 774.89 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  16033. 774.89 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  16034. 774.89 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  16035. 774.89 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  16036. 774.89 s [algebraic-graphs]
  16037. 774.89 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  16038. 774.89 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  16039. 774.90 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  16040. 774.90 s [algebraic-graphs] OK: isAcyclic . circuit == null
  16041. 774.90 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  16042. 774.90 s [algebraic-graphs]
  16043. 774.90 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  16044. 774.90 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  16045. 774.90 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  16046. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  16047. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  16048. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  16049. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  16050. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  16051. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  16052. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  16053. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  16054. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  16055. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  16056. 774.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  16057. 778.68 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  16058. 778.68 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  16059. 778.82 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  16060. 778.82 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  16061. 778.82 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  16062. 778.82 s [algebraic-graphs]
  16063. 778.82 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  16064. 778.82 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  16065. 778.82 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  16066. 778.82 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  16067. 778.82 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  16068. 778.82 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  16069. 778.82 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  16070. 778.82 s [algebraic-graphs]
  16071. 778.82 s [algebraic-graphs] ============ AdjacencyMap ============
  16072. 778.82 s [algebraic-graphs] OK: Axioms of graphs
  16073. 778.82 s [algebraic-graphs]
  16074. 778.82 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  16075. 778.82 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  16076. 778.82 s [algebraic-graphs]
  16077. 778.82 s [algebraic-graphs] OK: consistent empty == True
  16078. 778.82 s [algebraic-graphs] OK: consistent (vertex x) == True
  16079. 778.82 s [algebraic-graphs] OK: consistent (overlay x y) == True
  16080. 778.82 s [algebraic-graphs] OK: consistent (connect x y) == True
  16081. 778.82 s [algebraic-graphs] OK: consistent (edge x y) == True
  16082. 778.82 s [algebraic-graphs] OK: consistent (edges xs) == True
  16083. 778.82 s [algebraic-graphs] OK: consistent (stars xs) == True
  16084. 778.82 s [algebraic-graphs]
  16085. 778.82 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  16086. 778.82 s [algebraic-graphs] OK: show (empty ) == "empty"
  16087. 778.82 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  16088. 778.82 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  16089. 778.82 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  16090. 778.82 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  16091. 778.82 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  16092. 778.82 s [algebraic-graphs]
  16093. 778.82 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  16094. 778.82 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  16095. 778.82 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  16096. 778.82 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  16097. 778.82 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  16098. 778.82 s [algebraic-graphs]
  16099. 778.82 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  16100. 778.82 s [algebraic-graphs] OK: vertex 1 < vertex 2
  16101. 778.82 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  16102. 778.82 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  16103. 778.82 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  16104. 778.82 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  16105. 778.82 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  16106. 778.82 s [algebraic-graphs] OK: x <= x + y
  16107. 778.82 s [algebraic-graphs] OK: x + y <= x * y
  16108. 778.82 s [algebraic-graphs]
  16109. 778.82 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  16110. 778.82 s [algebraic-graphs] OK: isEmpty empty == True
  16111. 778.82 s [algebraic-graphs] OK: hasVertex x empty == False
  16112. 778.82 s [algebraic-graphs] OK: vertexCount empty == 0
  16113. 778.82 s [algebraic-graphs] OK: edgeCount empty == 0
  16114. 778.82 s [algebraic-graphs]
  16115. 778.82 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  16116. 778.82 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16117. 778.82 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16118. 778.82 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16119. 778.82 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16120. 778.82 s [algebraic-graphs]
  16121. 778.82 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  16122. 778.82 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  16123. 778.82 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  16124. 778.82 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  16125. 778.82 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  16126. 778.82 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  16127. 778.82 s [algebraic-graphs]
  16128. 778.82 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  16129. 778.82 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  16130. 778.82 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  16131. 778.82 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  16132. 778.82 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  16133. 778.82 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  16134. 778.82 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  16135. 778.82 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  16136. 778.82 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  16137. 778.82 s [algebraic-graphs]
  16138. 778.82 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  16139. 778.82 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  16140. 778.82 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  16141. 778.82 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  16142. 778.82 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  16143. 778.82 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  16144. 778.82 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  16145. 778.82 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  16146. 778.82 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  16147. 778.82 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  16148. 778.82 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  16149. 778.82 s [algebraic-graphs]
  16150. 778.82 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  16151. 778.82 s [algebraic-graphs] OK: vertices [] == empty
  16152. 778.82 s [algebraic-graphs] OK: vertices [x] == vertex x
  16153. 778.82 s [algebraic-graphs] OK: vertices == overlays . map vertex
  16154. 778.82 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  16155. 778.82 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  16156. 778.82 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16157. 778.82 s [algebraic-graphs]
  16158. 778.82 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  16159. 778.82 s [algebraic-graphs] OK: edges [] == empty
  16160. 778.82 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  16161. 778.82 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  16162. 778.82 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  16163. 778.82 s [algebraic-graphs]
  16164. 778.82 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  16165. 778.82 s [algebraic-graphs] OK: overlays [] == empty
  16166. 778.82 s [algebraic-graphs] OK: overlays [x] == x
  16167. 778.82 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  16168. 778.82 s [algebraic-graphs] OK: overlays == foldr overlay empty
  16169. 778.82 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  16170. 778.82 s [algebraic-graphs]
  16171. 778.82 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  16172. 778.82 s [algebraic-graphs] OK: connects [] == empty
  16173. 778.82 s [algebraic-graphs] OK: connects [x] == x
  16174. 778.82 s [algebraic-graphs] OK: connects [x,y] == connect x y
  16175. 778.82 s [algebraic-graphs] OK: connects == foldr connect empty
  16176. 778.82 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  16177. 778.82 s [algebraic-graphs]
  16178. 778.82 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  16179. 778.82 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  16180. 778.82 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  16181. 778.82 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  16182. 778.82 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  16183. 778.82 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  16184. 778.82 s [algebraic-graphs]
  16185. 778.82 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  16186. 778.82 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  16187. 778.82 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  16188. 778.82 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  16189. 778.82 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  16190. 778.82 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  16191. 778.82 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  16192. 778.82 s [algebraic-graphs]
  16193. 778.82 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  16194. 778.82 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  16195. 778.82 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  16196. 778.82 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  16197. 778.82 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  16198. 778.82 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  16199. 778.82 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  16200. 778.82 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  16201. 778.82 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  16202. 778.82 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  16203. 778.82 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  16204. 778.82 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  16205. 778.82 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  16206. 778.82 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  16207. 778.82 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  16208. 778.82 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  16209. 778.82 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  16210. 778.82 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  16211. 778.82 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  16212. 778.82 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  16213. 778.82 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  16214. 778.82 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  16215. 778.82 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  16216. 778.82 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  16217. 778.82 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  16218. 778.82 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  16219. 778.82 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  16220. 778.82 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  16221. 778.82 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  16222. 778.82 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  16223. 778.82 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  16224. 778.82 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  16225. 778.82 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  16226. 778.82 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  16227. 780.19 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  16228. 780.19 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  16229. 780.19 s [algebraic-graphs]
  16230. 780.19 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  16231. 780.19 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  16232. 780.19 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  16233. 780.19 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  16234. 780.19 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  16235. 780.19 s [algebraic-graphs]
  16236. 780.19 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  16237. 780.19 s [algebraic-graphs] OK: isEmpty empty == True
  16238. 780.19 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  16239. 780.19 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16240. 780.19 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  16241. 780.19 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  16242. 780.19 s [algebraic-graphs]
  16243. 780.19 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  16244. 780.19 s [algebraic-graphs] OK: hasVertex x empty == False
  16245. 780.19 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16246. 780.19 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  16247. 780.19 s [algebraic-graphs]
  16248. 780.19 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  16249. 780.19 s [algebraic-graphs] OK: hasEdge x y empty == False
  16250. 780.19 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  16251. 780.19 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  16252. 780.19 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  16253. 780.19 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  16254. 780.19 s [algebraic-graphs]
  16255. 780.19 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  16256. 780.19 s [algebraic-graphs] OK: vertexCount empty == 0
  16257. 780.19 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16258. 780.19 s [algebraic-graphs] OK: vertexCount == length . vertexList
  16259. 780.19 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  16260. 780.19 s [algebraic-graphs]
  16261. 780.19 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  16262. 780.19 s [algebraic-graphs] OK: edgeCount empty == 0
  16263. 780.19 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16264. 780.19 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  16265. 780.19 s [algebraic-graphs] OK: edgeCount == length . edgeList
  16266. 780.19 s [algebraic-graphs]
  16267. 780.19 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  16268. 780.19 s [algebraic-graphs] OK: vertexList empty == []
  16269. 780.19 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  16270. 780.19 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  16271. 780.19 s [algebraic-graphs]
  16272. 780.19 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  16273. 780.19 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  16274. 780.19 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  16275. 780.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16276. 780.19 s [algebraic-graphs]
  16277. 780.19 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  16278. 780.19 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  16279. 780.19 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  16280. 780.19 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  16281. 780.19 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  16282. 780.19 s [algebraic-graphs]
  16283. 780.19 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  16284. 780.19 s [algebraic-graphs] OK: edgeList empty == []
  16285. 780.19 s [algebraic-graphs] OK: edgeList (vertex x) == []
  16286. 780.19 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  16287. 780.19 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  16288. 780.19 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  16289. 780.19 s [algebraic-graphs]
  16290. 780.19 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  16291. 780.19 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  16292. 780.19 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  16293. 780.19 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  16294. 780.19 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  16295. 780.19 s [algebraic-graphs]
  16296. 780.19 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  16297. 780.19 s [algebraic-graphs] OK: adjacencyList empty == []
  16298. 780.19 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  16299. 780.19 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  16300. 780.19 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  16301. 780.19 s [algebraic-graphs]
  16302. 780.19 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  16303. 780.19 s [algebraic-graphs] OK: preSet x empty == Set.empty
  16304. 780.19 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  16305. 780.19 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  16306. 780.19 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  16307. 780.19 s [algebraic-graphs]
  16308. 780.19 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  16309. 780.19 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  16310. 780.19 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  16311. 780.19 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  16312. 780.19 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  16313. 780.19 s [algebraic-graphs]
  16314. 780.19 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  16315. 780.19 s [algebraic-graphs] OK: postSet x empty == Set.empty
  16316. 780.19 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  16317. 780.19 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  16318. 780.19 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  16319. 780.19 s [algebraic-graphs]
  16320. 780.19 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  16321. 780.19 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  16322. 780.19 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  16323. 780.19 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  16324. 780.19 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  16325. 780.19 s [algebraic-graphs]
  16326. 780.19 s [algebraic-graphs] ============ AdjacencyMap.path ============
  16327. 780.19 s [algebraic-graphs] OK: path [] == empty
  16328. 780.19 s [algebraic-graphs] OK: path [x] == vertex x
  16329. 780.19 s [algebraic-graphs] OK: path [x,y] == edge x y
  16330. 780.19 s [algebraic-graphs]
  16331. 780.19 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  16332. 780.19 s [algebraic-graphs] OK: circuit [] == empty
  16333. 780.19 s [algebraic-graphs] OK: circuit [x] == edge x x
  16334. 780.19 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  16335. 780.19 s [algebraic-graphs]
  16336. 780.19 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  16337. 780.19 s [algebraic-graphs] OK: clique [] == empty
  16338. 780.19 s [algebraic-graphs] OK: clique [x] == vertex x
  16339. 780.19 s [algebraic-graphs] OK: clique [x,y] == edge x y
  16340. 780.19 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  16341. 780.19 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  16342. 780.19 s [algebraic-graphs]
  16343. 780.19 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  16344. 780.19 s [algebraic-graphs] OK: biclique [] [] == empty
  16345. 780.19 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  16346. 780.19 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  16347. 780.19 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  16348. 780.19 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  16349. 780.19 s [algebraic-graphs]
  16350. 780.19 s [algebraic-graphs] ============ AdjacencyMap.star ============
  16351. 780.19 s [algebraic-graphs] OK: star x [] == vertex x
  16352. 780.19 s [algebraic-graphs] OK: star x [y] == edge x y
  16353. 780.19 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  16354. 780.19 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  16355. 780.19 s [algebraic-graphs]
  16356. 780.19 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  16357. 780.19 s [algebraic-graphs] OK: stars [] == empty
  16358. 780.19 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  16359. 780.19 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  16360. 780.19 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  16361. 780.19 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  16362. 780.19 s [algebraic-graphs] OK: stars . adjacencyList == id
  16363. 780.19 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  16364. 780.19 s [algebraic-graphs]
  16365. 780.19 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  16366. 780.19 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  16367. 780.19 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  16368. 780.19 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  16369. 780.19 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  16370. 780.19 s [algebraic-graphs]
  16371. 780.19 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  16372. 780.19 s [algebraic-graphs] OK: forest [] == empty
  16373. 780.19 s [algebraic-graphs] OK: forest [x] == tree x
  16374. 780.19 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  16375. 780.19 s [algebraic-graphs] OK: forest == overlays . map tree
  16376. 780.19 s [algebraic-graphs]
  16377. 780.19 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  16378. 780.19 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  16379. 780.19 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  16380. 780.19 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  16381. 780.19 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  16382. 780.19 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  16383. 780.19 s [algebraic-graphs]
  16384. 780.19 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  16385. 780.19 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  16386. 780.19 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  16387. 780.19 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  16388. 780.19 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  16389. 780.19 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  16390. 780.19 s [algebraic-graphs]
  16391. 780.19 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  16392. 780.19 s [algebraic-graphs] OK: replaceVertex x x == id
  16393. 780.19 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  16394. 780.19 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  16395. 780.19 s [algebraic-graphs]
  16396. 780.19 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  16397. 780.19 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  16398. 780.19 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  16399. 780.19 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  16400. 780.19 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  16401. 780.19 s [algebraic-graphs]
  16402. 780.19 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  16403. 780.19 s [algebraic-graphs] OK: transpose empty == empty
  16404. 780.19 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  16405. 780.19 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  16406. 780.19 s [algebraic-graphs] OK: transpose . transpose == id
  16407. 780.19 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  16408. 780.19 s [algebraic-graphs]
  16409. 780.19 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  16410. 780.19 s [algebraic-graphs] OK: gmap f empty == empty
  16411. 780.19 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  16412. 780.19 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  16413. 780.19 s [algebraic-graphs] OK: gmap id == id
  16414. 780.19 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  16415. 780.19 s [algebraic-graphs]
  16416. 780.19 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  16417. 780.19 s [algebraic-graphs] OK: induce (const True ) x == x
  16418. 780.19 s [algebraic-graphs] OK: induce (const False) x == empty
  16419. 780.19 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  16420. 780.19 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  16421. 780.19 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  16422. 780.19 s [algebraic-graphs]
  16423. 780.19 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  16424. 780.19 s [algebraic-graphs] OK: compose empty x == empty
  16425. 780.19 s [algebraic-graphs] OK: compose x empty == empty
  16426. 780.19 s [algebraic-graphs] OK: compose (vertex x) y == empty
  16427. 780.19 s [algebraic-graphs] OK: compose x (vertex y) == empty
  16428. 780.19 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  16429. 780.19 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  16430. 781.81 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  16431. 781.81 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  16432. 781.81 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  16433. 781.81 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  16434. 781.81 s [algebraic-graphs]
  16435. 781.81 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  16436. 781.81 s [algebraic-graphs] OK: closure empty == empty
  16437. 781.81 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  16438. 781.81 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  16439. 781.81 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  16440. 781.81 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  16441. 781.81 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  16442. 781.81 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  16443. 781.81 s [algebraic-graphs] OK: closure . closure == closure
  16444. 781.81 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  16445. 781.81 s [algebraic-graphs]
  16446. 781.81 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  16447. 781.81 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  16448. 781.81 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  16449. 781.81 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  16450. 781.81 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  16451. 781.81 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  16452. 781.81 s [algebraic-graphs]
  16453. 781.81 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  16454. 781.81 s [algebraic-graphs] OK: symmetricClosure empty == empty
  16455. 781.81 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  16456. 781.81 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  16457. 781.81 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  16458. 781.81 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  16459. 781.81 s [algebraic-graphs]
  16460. 781.81 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  16461. 781.81 s [algebraic-graphs] OK: transitiveClosure empty == empty
  16462. 781.81 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  16463. 781.81 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  16464. 781.81 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  16465. 781.81 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  16466. 781.81 s [algebraic-graphs]
  16467. 781.81 s [algebraic-graphs] ============ AdjacencyMap.box ============
  16468. 781.81 s [algebraic-graphs] OK: box x y ~~ box y x
  16469. 781.81 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  16470. 781.81 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  16471. 781.81 s [algebraic-graphs] OK: box x empty ~~ empty
  16472. 781.81 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  16473. 781.81 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  16474. 781.81 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  16475. 781.81 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  16476. 781.81 s [algebraic-graphs]
  16477. 781.81 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  16478. 781.81 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  16479. 781.81 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  16480. 781.81 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  16481. 781.81 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  16482. 781.81 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  16483. 781.81 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  16484. 781.81 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  16485. 781.81 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  16486. 781.81 s [algebraic-graphs] OK: bfsForest x [] == []
  16487. 781.81 s [algebraic-graphs] OK: bfsForest empty vs == []
  16488. 781.81 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  16489. 781.81 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  16490. 781.81 s [algebraic-graphs]
  16491. 781.81 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  16492. 781.81 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  16493. 781.81 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  16494. 781.81 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  16495. 781.81 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  16496. 781.81 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  16497. 781.81 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  16498. 781.81 s [algebraic-graphs] OK: bfs empty vs == []
  16499. 781.81 s [algebraic-graphs] OK: bfs x [] == []
  16500. 781.81 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  16501. 781.81 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  16502. 781.81 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  16503. 781.81 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  16504. 781.81 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  16505. 781.81 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  16506. 781.81 s [algebraic-graphs]
  16507. 781.81 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  16508. 781.81 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  16509. 781.81 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  16510. 781.81 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  16511. 781.81 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  16512. 781.81 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  16513. 781.81 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  16514. 781.81 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  16515. 781.81 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  16516. 781.81 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  16517. 781.81 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  16518. 781.81 s [algebraic-graphs]
  16519. 781.81 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  16520. 781.81 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  16521. 781.81 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  16522. 781.81 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  16523. 781.81 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  16524. 781.81 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  16525. 781.81 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  16526. 781.81 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  16527. 781.81 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  16528. 781.81 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  16529. 781.81 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  16530. 781.81 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  16531. 781.81 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  16532. 781.81 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  16533. 781.81 s [algebraic-graphs]
  16534. 781.81 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  16535. 781.81 s [algebraic-graphs] OK: dfs empty vs == []
  16536. 781.81 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  16537. 781.81 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  16538. 781.81 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  16539. 781.81 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  16540. 781.81 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  16541. 781.81 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  16542. 781.81 s [algebraic-graphs] OK: dfs x [] == []
  16543. 781.81 s [algebraic-graphs]
  16544. 781.81 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  16545. 781.81 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  16546. 781.81 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  16547. 781.81 s [algebraic-graphs]
  16548. 781.81 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  16549. 781.81 s [algebraic-graphs] OK: reachable empty x == []
  16550. 781.81 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  16551. 781.81 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  16552. 781.81 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  16553. 781.81 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  16554. 781.81 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  16555. 781.81 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  16556. 781.81 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  16557. 781.81 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  16558. 781.81 s [algebraic-graphs]
  16559. 781.81 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  16560. 781.81 s [algebraic-graphs]
  16561. 781.81 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  16562. 781.81 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  16563. 781.81 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  16564. 781.81 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  16565. 781.81 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  16566. 781.81 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  16567. 781.81 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  16568. 781.81 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  16569. 781.81 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  16570. 781.81 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  16571. 781.81 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  16572. 781.81 s [algebraic-graphs]
  16573. 781.81 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  16574. 781.81 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  16575. 781.81 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  16576. 781.81 s [algebraic-graphs] OK: isAcyclic . circuit == null
  16577. 781.81 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  16578. 781.81 s [algebraic-graphs]
  16579. 781.81 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  16580. 781.81 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  16581. 781.81 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  16582. 781.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  16583. 781.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  16584. 781.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  16585. 781.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  16586. 781.81 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  16587. 786.34 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  16588. 786.34 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  16589. 786.47 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  16590. 786.47 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  16591. 786.47 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  16592. 786.47 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  16593. 786.47 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  16594. 786.47 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  16595. 786.47 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  16596. 786.47 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  16597. 786.47 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  16598. 786.47 s [algebraic-graphs]
  16599. 786.47 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  16600. 786.47 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  16601. 786.47 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  16602. 786.47 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  16603. 786.47 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  16604. 786.47 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  16605. 786.47 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  16606. 786.47 s [algebraic-graphs]
  16607. 786.47 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  16608. 786.47 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  16609. 786.47 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  16610. 786.47 s [algebraic-graphs] OK: induceJust . gmap Just == id
  16611. 786.47 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  16612. 786.47 s [algebraic-graphs]
  16613. 786.47 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  16614. 786.47 s [algebraic-graphs] OK: scc empty == empty
  16615. 786.47 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  16616. 786.47 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  16617. 786.47 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  16618. 786.47 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  16619. 786.47 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  16620. 786.47 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  16621. 786.47 s [algebraic-graphs] OK: isAcyclic . scc == const True
  16622. 786.47 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  16623. 786.47 s [algebraic-graphs] OK: scc g == KL.scc g
  16624. 786.47 s [algebraic-graphs]
  16625. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  16626. 786.47 s [algebraic-graphs] OK: 0 == rightVertex 0
  16627. 786.47 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  16628. 786.47 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  16629. 786.47 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  16630. 786.47 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  16631. 786.47 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  16632. 786.47 s [algebraic-graphs]
  16633. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  16634. 786.47 s [algebraic-graphs] OK: show empty == "empty"
  16635. 786.47 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  16636. 786.47 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  16637. 786.47 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  16638. 786.47 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  16639. 786.47 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  16640. 786.47 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  16641. 786.47 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  16642. 786.47 s [algebraic-graphs]
  16643. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  16644. 786.47 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  16645. 786.47 s [algebraic-graphs]
  16646. 786.47 s [algebraic-graphs] OK: x + y == y + x
  16647. 786.47 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  16648. 786.47 s [algebraic-graphs] OK: x * empty == x
  16649. 786.47 s [algebraic-graphs] OK: empty * x == x
  16650. 786.47 s [algebraic-graphs] OK: x * y == y * x
  16651. 786.47 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  16652. 786.47 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  16653. 786.47 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  16654. 786.47 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  16655. 786.47 s [algebraic-graphs] OK: x + empty == x
  16656. 786.47 s [algebraic-graphs] OK: empty + x == x
  16657. 786.47 s [algebraic-graphs] OK: x + x == x
  16658. 786.47 s [algebraic-graphs] OK: x * y + x + y == x * y
  16659. 786.47 s [algebraic-graphs] OK: x * x * x == x * x
  16660. 786.47 s [algebraic-graphs]
  16661. 786.47 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  16662. 786.47 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  16663. 786.47 s [algebraic-graphs]
  16664. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  16665. 786.47 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  16666. 786.47 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  16667. 786.47 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  16668. 786.47 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  16669. 786.47 s [algebraic-graphs]
  16670. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  16671. 786.47 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  16672. 786.47 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  16673. 786.47 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  16674. 786.47 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  16675. 786.47 s [algebraic-graphs]
  16676. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  16677. 786.47 s [algebraic-graphs] OK: isEmpty empty == True
  16678. 786.47 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  16679. 786.47 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  16680. 786.47 s [algebraic-graphs] OK: hasVertex x empty == False
  16681. 786.47 s [algebraic-graphs]
  16682. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  16683. 786.47 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  16684. 786.47 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  16685. 786.47 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  16686. 786.47 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  16687. 786.47 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  16688. 786.47 s [algebraic-graphs]
  16689. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  16690. 786.47 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  16691. 786.47 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  16692. 786.47 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  16693. 786.47 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  16694. 786.47 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  16695. 786.47 s [algebraic-graphs]
  16696. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  16697. 786.47 s [algebraic-graphs] OK: vertex . Left == leftVertex
  16698. 786.47 s [algebraic-graphs] OK: vertex . Right == rightVertex
  16699. 786.47 s [algebraic-graphs]
  16700. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  16701. 786.47 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  16702. 786.47 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  16703. 786.47 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  16704. 786.47 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  16705. 786.47 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  16706. 786.47 s [algebraic-graphs]
  16707. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  16708. 786.47 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  16709. 786.47 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  16710. 786.47 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  16711. 786.47 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  16712. 786.47 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  16713. 786.47 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  16714. 786.47 s [algebraic-graphs]
  16715. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  16716. 786.47 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  16717. 786.47 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  16718. 786.47 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  16719. 786.47 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  16720. 786.47 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  16721. 786.47 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  16722. 786.47 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  16723. 786.47 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  16724. 786.47 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  16725. 786.47 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  16726. 786.47 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  16727. 786.47 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  16728. 786.47 s [algebraic-graphs]
  16729. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  16730. 786.47 s [algebraic-graphs] OK: vertices [] [] == empty
  16731. 786.47 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  16732. 786.47 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  16733. 786.47 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  16734. 786.47 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  16735. 786.47 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  16736. 786.47 s [algebraic-graphs]
  16737. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  16738. 786.47 s [algebraic-graphs] OK: edges [] == empty
  16739. 786.47 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  16740. 786.47 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  16741. 786.47 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  16742. 786.47 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  16743. 786.47 s [algebraic-graphs]
  16744. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  16745. 786.47 s [algebraic-graphs] OK: overlays [] == empty
  16746. 786.47 s [algebraic-graphs] OK: overlays [x] == x
  16747. 786.47 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  16748. 786.47 s [algebraic-graphs] OK: overlays == foldr overlay empty
  16749. 786.47 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  16750. 786.47 s [algebraic-graphs]
  16751. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  16752. 786.47 s [algebraic-graphs] OK: connects [] == empty
  16753. 786.47 s [algebraic-graphs] OK: connects [x] == x
  16754. 786.47 s [algebraic-graphs] OK: connects [x,y] == connect x y
  16755. 786.47 s [algebraic-graphs] OK: connects == foldr connect empty
  16756. 786.47 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  16757. 786.47 s [algebraic-graphs]
  16758. 786.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  16759. 787.35 s [algebraic-graphs] OK: swap empty == empty
  16760. 787.35 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  16761. 787.35 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  16762. 787.35 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  16763. 787.35 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  16764. 787.35 s [algebraic-graphs] OK: swap . swap == id
  16765. 787.35 s [algebraic-graphs]
  16766. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  16767. 787.35 s [algebraic-graphs] OK: toBipartite empty == empty
  16768. 787.35 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  16769. 787.35 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  16770. 787.35 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  16771. 787.35 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  16772. 787.35 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  16773. 787.35 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  16774. 787.35 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  16775. 787.35 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  16776. 787.35 s [algebraic-graphs]
  16777. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  16778. 787.35 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  16779. 787.35 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  16780. 787.35 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  16781. 787.35 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  16782. 787.35 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  16783. 787.35 s [algebraic-graphs]
  16784. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  16785. 787.35 s [algebraic-graphs] OK: fromBipartite empty == empty
  16786. 787.35 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  16787. 787.35 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  16788. 787.35 s [algebraic-graphs]
  16789. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  16790. 787.35 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  16791. 787.35 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  16792. 787.35 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  16793. 787.35 s [algebraic-graphs]
  16794. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  16795. 787.35 s [algebraic-graphs] OK: isEmpty empty == True
  16796. 787.35 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  16797. 787.35 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16798. 787.35 s [algebraic-graphs] OK: isEmpty == (==) empty
  16799. 787.35 s [algebraic-graphs]
  16800. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  16801. 787.35 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  16802. 787.35 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  16803. 787.35 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  16804. 787.35 s [algebraic-graphs]
  16805. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  16806. 787.35 s [algebraic-graphs] OK: hasRightVertex x empty == False
  16807. 787.35 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  16808. 787.35 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  16809. 787.35 s [algebraic-graphs]
  16810. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  16811. 787.35 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  16812. 787.35 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  16813. 787.35 s [algebraic-graphs]
  16814. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  16815. 787.35 s [algebraic-graphs] OK: hasEdge x y empty == False
  16816. 787.35 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  16817. 787.35 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  16818. 787.35 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  16819. 787.35 s [algebraic-graphs]
  16820. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  16821. 787.35 s [algebraic-graphs] OK: leftVertexCount empty == 0
  16822. 787.35 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  16823. 787.35 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  16824. 787.35 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  16825. 787.35 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  16826. 787.35 s [algebraic-graphs]
  16827. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  16828. 787.35 s [algebraic-graphs] OK: rightVertexCount empty == 0
  16829. 787.35 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  16830. 787.35 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  16831. 787.35 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  16832. 787.35 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  16833. 787.35 s [algebraic-graphs]
  16834. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  16835. 787.35 s [algebraic-graphs] OK: vertexCount empty == 0
  16836. 787.35 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16837. 787.35 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  16838. 787.35 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  16839. 787.35 s [algebraic-graphs]
  16840. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  16841. 787.35 s [algebraic-graphs] OK: edgeCount empty == 0
  16842. 787.35 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16843. 787.35 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  16844. 787.35 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  16845. 787.35 s [algebraic-graphs]
  16846. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  16847. 787.35 s [algebraic-graphs] OK: leftVertexList empty == []
  16848. 787.35 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  16849. 787.35 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  16850. 787.35 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  16851. 787.35 s [algebraic-graphs]
  16852. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  16853. 787.35 s [algebraic-graphs] OK: rightVertexList empty == []
  16854. 787.35 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  16855. 787.35 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  16856. 787.35 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  16857. 787.35 s [algebraic-graphs]
  16858. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  16859. 787.35 s [algebraic-graphs] OK: vertexList empty == []
  16860. 787.35 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  16861. 787.35 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  16862. 787.35 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  16863. 787.35 s [algebraic-graphs]
  16864. 787.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  16865. 787.35 s [algebraic-graphs] OK: edgeList empty == []
  16866. 787.35 s [algebraic-graphs] OK: edgeList (vertex x) == []
  16867. 787.35 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  16868. 787.35 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  16869. 787.36 s [algebraic-graphs]
  16870. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  16871. 787.36 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  16872. 787.36 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  16873. 787.36 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  16874. 787.36 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  16875. 787.36 s [algebraic-graphs]
  16876. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  16877. 787.36 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  16878. 787.36 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  16879. 787.36 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  16880. 787.36 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  16881. 787.36 s [algebraic-graphs]
  16882. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  16883. 787.36 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  16884. 787.36 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  16885. 787.36 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  16886. 787.36 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  16887. 787.36 s [algebraic-graphs]
  16888. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  16889. 787.36 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  16890. 787.36 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  16891. 787.36 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  16892. 787.36 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  16893. 787.36 s [algebraic-graphs]
  16894. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  16895. 787.36 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  16896. 787.36 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  16897. 787.36 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  16898. 787.36 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  16899. 787.36 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  16900. 787.36 s [algebraic-graphs]
  16901. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  16902. 787.36 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  16903. 787.36 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  16904. 787.36 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  16905. 787.36 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  16906. 787.36 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  16907. 787.36 s [algebraic-graphs]
  16908. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  16909. 787.36 s [algebraic-graphs] OK: evenList [] == Nil
  16910. 787.36 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  16911. 787.36 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  16912. 787.36 s [algebraic-graphs]
  16913. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  16914. 787.36 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  16915. 787.36 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  16916. 787.36 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  16917. 787.36 s [algebraic-graphs]
  16918. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  16919. 787.36 s [algebraic-graphs] OK: path Nil == empty
  16920. 787.36 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  16921. 787.36 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  16922. 787.36 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  16923. 787.36 s [algebraic-graphs]
  16924. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  16925. 787.36 s [algebraic-graphs] OK: circuit [] == empty
  16926. 787.36 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  16927. 787.36 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  16928. 787.36 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  16929. 787.36 s [algebraic-graphs]
  16930. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  16931. 787.36 s [algebraic-graphs] OK: biclique [] [] == empty
  16932. 787.36 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  16933. 787.36 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  16934. 787.36 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  16935. 787.36 s [algebraic-graphs]
  16936. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  16937. 787.36 s [algebraic-graphs] OK: star x [] == leftVertex x
  16938. 787.36 s [algebraic-graphs] OK: star x [y] == edge x y
  16939. 787.36 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  16940. 787.36 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  16941. 787.36 s [algebraic-graphs]
  16942. 787.36 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  16943. 787.36 s [algebraic-graphs] OK: stars [] == empty
  16944. 787.36 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  16945. 787.36 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  16946. 787.36 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  16947. 796.29 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  16948. 796.33 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  16949. 796.33 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  16950. 796.33 s [algebraic-graphs]
  16951. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  16952. 796.33 s [algebraic-graphs] OK: mesh xs [] == empty
  16953. 796.33 s [algebraic-graphs] OK: mesh [] ys == empty
  16954. 796.33 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  16955. 796.33 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  16956. 796.33 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  16957. 796.33 s [algebraic-graphs]
  16958. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  16959. 796.33 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  16960. 796.33 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  16961. 796.33 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  16962. 796.33 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  16963. 796.33 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  16964. 796.33 s [algebraic-graphs]
  16965. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  16966. 796.33 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  16967. 796.33 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  16968. 796.33 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  16969. 796.33 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  16970. 796.33 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  16971. 796.33 s [algebraic-graphs]
  16972. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  16973. 796.33 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  16974. 796.33 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  16975. 796.33 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  16976. 796.33 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  16977. 796.33 s [algebraic-graphs]
  16978. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  16979. 796.33 s [algebraic-graphs] OK: bimap f g empty == empty
  16980. 796.33 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  16981. 796.33 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  16982. 796.33 s [algebraic-graphs] OK: bimap id id == id
  16983. 796.33 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  16984. 796.33 s [algebraic-graphs]
  16985. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  16986. 796.33 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  16987. 796.33 s [algebraic-graphs]
  16988. 796.33 s [algebraic-graphs] OK: box x y ~~ box y x
  16989. 796.33 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  16990. 796.33 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  16991. 796.33 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  16992. 796.33 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  16993. 796.33 s [algebraic-graphs] OK: box x empty ~~ empty
  16994. 796.33 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  16995. 796.33 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  16996. 796.33 s [algebraic-graphs]
  16997. 796.33 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  16998. 796.33 s [algebraic-graphs]
  16999. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  17000. 796.33 s [algebraic-graphs] OK: consistent empty == True
  17001. 796.33 s [algebraic-graphs] OK: consistent (vertex x) == True
  17002. 796.33 s [algebraic-graphs] OK: consistent (edge x y) == True
  17003. 796.33 s [algebraic-graphs] OK: consistent (edges x) == True
  17004. 796.33 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  17005. 796.33 s [algebraic-graphs] OK: consistent (swap x) == True
  17006. 796.33 s [algebraic-graphs] OK: consistent (circuit xs) == True
  17007. 796.33 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  17008. 796.33 s [algebraic-graphs]
  17009. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  17010. 796.33 s [algebraic-graphs] OK: detectParts empty == Right empty
  17011. 796.33 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  17012. 796.33 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  17013. 796.33 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  17014. 796.33 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  17015. 796.33 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  17016. 796.33 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  17017. 796.33 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  17018. 796.33 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  17019. 796.33 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  17020. 796.33 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  17021. 796.33 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  17022. 796.33 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  17023. 796.33 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  17024. 796.33 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  17025. 796.33 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  17026. 796.33 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  17027. 796.33 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  17028. 796.33 s [algebraic-graphs]
  17029. 796.33 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  17030. 796.33 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  17031. 796.33 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  17032. 796.33 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  17033. 796.33 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  17034. 796.33 s [algebraic-graphs]
  17035. 796.33 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  17036. 796.33 s [algebraic-graphs] OK: show (matching []) == "matching []"
  17037. 796.33 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  17038. 796.33 s [algebraic-graphs]
  17039. 796.33 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  17040. 796.33 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  17041. 796.33 s [algebraic-graphs]
  17042. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  17043. 796.33 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  17044. 796.33 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  17045. 796.33 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  17046. 796.33 s [algebraic-graphs]
  17047. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  17048. 796.33 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  17049. 796.33 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  17050. 796.33 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  17051. 796.33 s [algebraic-graphs]
  17052. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  17053. 796.33 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  17054. 796.33 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  17055. 796.33 s [algebraic-graphs]
  17056. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  17057. 796.33 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  17058. 796.33 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  17059. 796.33 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  17060. 796.33 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  17061. 796.33 s [algebraic-graphs]
  17062. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  17063. 796.33 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  17064. 796.33 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  17065. 796.33 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  17066. 796.33 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  17067. 796.33 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  17068. 796.33 s [algebraic-graphs]
  17069. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  17070. 796.33 s [algebraic-graphs] OK: maxMatching empty == matching []
  17071. 796.33 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  17072. 796.33 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  17073. 796.33 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  17074. 796.33 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  17075. 796.33 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  17076. 796.33 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  17077. 796.33 s [algebraic-graphs]
  17078. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  17079. 796.33 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  17080. 796.33 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  17081. 796.33 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  17082. 796.33 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  17083. 796.33 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  17084. 796.33 s [algebraic-graphs]
  17085. 796.33 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  17086. 796.33 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  17087. 798.20 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  17088. 798.20 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  17089. 798.20 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  17090. 798.20 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  17091. 798.20 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  17092. 798.20 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  17093. 798.20 s [algebraic-graphs]
  17094. 798.20 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  17095. 798.20 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  17096. 798.20 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  17097. 798.20 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  17098. 798.20 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  17099. 798.20 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  17100. 798.20 s [algebraic-graphs]
  17101. 798.20 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  17102. 798.20 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  17103. 798.20 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  17104. 798.20 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  17105. 798.20 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  17106. 798.20 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  17107. 798.20 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  17108. 798.20 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  17109. 798.20 s [algebraic-graphs]
  17110. 798.20 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  17111. 798.20 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  17112. 798.20 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  17113. 798.20 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  17114. 798.20 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  17115. 798.20 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  17116. 798.20 s [algebraic-graphs]
  17117. 798.20 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  17118. 798.20 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  17119. 798.20 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  17120. 798.20 s [algebraic-graphs]
  17121. 798.20 s [algebraic-graphs] ============ Export.Eq ============
  17122. 798.20 s [algebraic-graphs] OK: mempty /= literal ""
  17123. 798.20 s [algebraic-graphs]
  17124. 798.20 s [algebraic-graphs] ============ Export.Ord ============
  17125. 798.20 s [algebraic-graphs] OK: mempty < literal ""
  17126. 798.20 s [algebraic-graphs]
  17127. 798.20 s [algebraic-graphs] ============ Export.isEmpty ============
  17128. 798.20 s [algebraic-graphs] OK: isEmpty mempty == True
  17129. 798.20 s [algebraic-graphs] OK: isEmpty (literal "") == False
  17130. 798.20 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  17131. 798.20 s [algebraic-graphs]
  17132. 798.20 s [algebraic-graphs] ============ Export.literal ============
  17133. 798.20 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  17134. 798.20 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  17135. 798.20 s [algebraic-graphs] OK: render . literal == id
  17136. 798.20 s [algebraic-graphs]
  17137. 798.20 s [algebraic-graphs] ============ Export.render ============
  17138. 798.20 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  17139. 798.20 s [algebraic-graphs] OK: render mempty == mempty
  17140. 798.20 s [algebraic-graphs]
  17141. 798.20 s [algebraic-graphs] ============ Export.<+> ============
  17142. 798.20 s [algebraic-graphs] OK: x <+> mempty == x
  17143. 798.20 s [algebraic-graphs] OK: mempty <+> x == x
  17144. 798.20 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  17145. 798.20 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  17146. 798.20 s [algebraic-graphs]
  17147. 798.20 s [algebraic-graphs] ============ Export.brackets ============
  17148. 798.20 s [algebraic-graphs] OK: brackets "i" == "[i]"
  17149. 798.20 s [algebraic-graphs] OK: brackets mempty == "[]"
  17150. 798.20 s [algebraic-graphs]
  17151. 798.20 s [algebraic-graphs] ============ Export.doubleQuotes ============
  17152. 798.20 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  17153. 798.20 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  17154. 798.20 s [algebraic-graphs]
  17155. 798.20 s [algebraic-graphs] ============ Export.indent ============
  17156. 798.20 s [algebraic-graphs] OK: indent 0 == id
  17157. 798.20 s [algebraic-graphs] OK: indent 1 mempty == " "
  17158. 798.20 s [algebraic-graphs]
  17159. 798.20 s [algebraic-graphs] ============ Export.unlines ============
  17160. 798.20 s [algebraic-graphs] OK: unlines [] == mempty
  17161. 798.20 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  17162. 798.20 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  17163. 798.20 s [algebraic-graphs]
  17164. 798.20 s [algebraic-graphs] ============ Export.export ============
  17165. 798.20 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  17166. 798.20 s [algebraic-graphs]
  17167. 798.20 s [algebraic-graphs] ============ Export.Dot.export ============
  17168. 798.20 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  17169. 798.20 s [algebraic-graphs]
  17170. 798.20 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  17171. 798.20 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  17172. 798.20 s [algebraic-graphs]
  17173. 798.20 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  17174. 798.20 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  17175. 798.20 s [algebraic-graphs]
  17176. 798.20 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  17177. 798.20 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  17178. 798.20 s [algebraic-graphs]
  17179. 798.20 s [algebraic-graphs] ============ Graph ============
  17180. 798.20 s [algebraic-graphs] OK: Axioms of graphs
  17181. 798.20 s [algebraic-graphs] OK: Theorems of graphs
  17182. 798.20 s [algebraic-graphs]
  17183. 798.20 s [algebraic-graphs] ============ Graph.Ord ============
  17184. 798.20 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17185. 798.20 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17186. 798.20 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17187. 798.20 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17188. 798.20 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17189. 798.20 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17190. 798.20 s [algebraic-graphs] OK: x <= x + y
  17191. 798.20 s [algebraic-graphs] OK: x + y <= x * y
  17192. 798.20 s [algebraic-graphs]
  17193. 798.20 s [algebraic-graphs] ============ Graph.empty ============
  17194. 798.20 s [algebraic-graphs] OK: isEmpty empty == True
  17195. 798.20 s [algebraic-graphs] OK: hasVertex x empty == False
  17196. 798.20 s [algebraic-graphs] OK: vertexCount empty == 0
  17197. 798.20 s [algebraic-graphs] OK: edgeCount empty == 0
  17198. 798.20 s [algebraic-graphs]
  17199. 798.20 s [algebraic-graphs] ============ Graph.vertex ============
  17200. 798.20 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17201. 798.20 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17202. 798.20 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17203. 798.20 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17204. 798.20 s [algebraic-graphs]
  17205. 798.20 s [algebraic-graphs] ============ Graph.edge ============
  17206. 798.20 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17207. 798.20 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17208. 798.20 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17209. 798.20 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17210. 798.20 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17211. 798.20 s [algebraic-graphs]
  17212. 798.20 s [algebraic-graphs] ============ Graph.overlay ============
  17213. 798.20 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17214. 798.20 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17215. 798.20 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17216. 798.20 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17217. 798.20 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17218. 798.20 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17219. 798.20 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17220. 798.20 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17221. 798.20 s [algebraic-graphs]
  17222. 798.20 s [algebraic-graphs] ============ Graph.connect ============
  17223. 798.20 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17224. 798.20 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17225. 798.20 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17226. 798.20 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17227. 798.20 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17228. 798.20 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17229. 798.20 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17230. 798.20 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17231. 798.20 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17232. 798.20 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17233. 798.20 s [algebraic-graphs]
  17234. 798.20 s [algebraic-graphs] ============ Graph.vertices ============
  17235. 798.20 s [algebraic-graphs] OK: vertices [] == empty
  17236. 798.20 s [algebraic-graphs] OK: vertices [x] == vertex x
  17237. 798.20 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17238. 798.20 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17239. 798.20 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17240. 798.20 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17241. 798.20 s [algebraic-graphs]
  17242. 798.20 s [algebraic-graphs] ============ Graph.edges ============
  17243. 798.20 s [algebraic-graphs] OK: edges [] == empty
  17244. 798.20 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17245. 798.20 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17246. 798.20 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17247. 798.20 s [algebraic-graphs]
  17248. 798.20 s [algebraic-graphs] ============ Graph.overlays ============
  17249. 798.20 s [algebraic-graphs] OK: overlays [] == empty
  17250. 798.20 s [algebraic-graphs] OK: overlays [x] == x
  17251. 798.20 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17252. 798.20 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17253. 798.20 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17254. 798.20 s [algebraic-graphs]
  17255. 798.20 s [algebraic-graphs] ============ Graph.connects ============
  17256. 798.20 s [algebraic-graphs] OK: connects [] == empty
  17257. 798.20 s [algebraic-graphs] OK: connects [x] == x
  17258. 798.20 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17259. 798.20 s [algebraic-graphs] OK: connects == foldr connect empty
  17260. 798.20 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17261. 798.20 s [algebraic-graphs]
  17262. 798.20 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  17263. 798.20 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17264. 798.20 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17265. 798.20 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17266. 798.20 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17267. 798.20 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17268. 798.20 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17269. 798.20 s [algebraic-graphs]
  17270. 798.20 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  17271. 798.20 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17272. 798.20 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17273. 798.20 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17274. 798.20 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17275. 798.20 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17276. 798.20 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17277. 798.20 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17278. 798.20 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17279. 798.20 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17280. 798.83 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17281. 798.83 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17282. 798.83 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17283. 798.83 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17284. 798.83 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17285. 798.83 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17286. 798.83 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17287. 798.83 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17288. 798.83 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17289. 798.83 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17290. 798.83 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17291. 798.83 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17292. 798.83 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17293. 798.83 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17294. 798.83 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17295. 798.83 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17296. 798.83 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17297. 798.83 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17298. 798.83 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17299. 798.83 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17300. 798.83 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17301. 798.83 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17302. 798.83 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17303. 798.83 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17304. 798.83 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17305. 798.83 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17306. 798.83 s [algebraic-graphs]
  17307. 798.83 s [algebraic-graphs] ============ Graph.foldg ============
  17308. 798.83 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17309. 798.83 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17310. 798.83 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17311. 798.83 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17312. 798.83 s [algebraic-graphs]
  17313. 798.83 s [algebraic-graphs] ============ Graph.isEmpty ============
  17314. 798.83 s [algebraic-graphs] OK: isEmpty empty == True
  17315. 798.83 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17316. 798.83 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17317. 798.83 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17318. 798.83 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17319. 798.83 s [algebraic-graphs]
  17320. 798.83 s [algebraic-graphs] ============ Graph.hasVertex ============
  17321. 798.83 s [algebraic-graphs] OK: hasVertex x empty == False
  17322. 798.83 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17323. 798.83 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17324. 798.83 s [algebraic-graphs]
  17325. 798.83 s [algebraic-graphs] ============ Graph.hasEdge ============
  17326. 798.83 s [algebraic-graphs] OK: hasEdge x y empty == False
  17327. 798.83 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17328. 798.83 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17329. 798.83 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17330. 798.83 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17331. 798.83 s [algebraic-graphs]
  17332. 798.83 s [algebraic-graphs] ============ Graph.vertexCount ============
  17333. 798.83 s [algebraic-graphs] OK: vertexCount empty == 0
  17334. 798.83 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17335. 798.83 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17336. 798.83 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17337. 798.83 s [algebraic-graphs]
  17338. 798.83 s [algebraic-graphs] ============ Graph.edgeCount ============
  17339. 798.83 s [algebraic-graphs] OK: edgeCount empty == 0
  17340. 798.83 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17341. 798.83 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17342. 798.83 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17343. 798.83 s [algebraic-graphs]
  17344. 798.83 s [algebraic-graphs] ============ Graph.vertexList ============
  17345. 798.83 s [algebraic-graphs] OK: vertexList empty == []
  17346. 798.83 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17347. 798.83 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17348. 798.83 s [algebraic-graphs]
  17349. 798.83 s [algebraic-graphs] ============ Graph.vertexSet ============
  17350. 798.83 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17351. 798.83 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17352. 798.83 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17353. 798.83 s [algebraic-graphs]
  17354. 798.83 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  17355. 798.83 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17356. 798.83 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17357. 798.83 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17358. 798.83 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17359. 798.83 s [algebraic-graphs]
  17360. 798.83 s [algebraic-graphs] ============ Graph.edgeList ============
  17361. 798.83 s [algebraic-graphs] OK: edgeList empty == []
  17362. 798.83 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17363. 798.83 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17364. 798.83 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17365. 798.83 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17366. 798.83 s [algebraic-graphs]
  17367. 798.83 s [algebraic-graphs] ============ Graph.edgeSet ============
  17368. 798.83 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17369. 798.83 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17370. 798.83 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17371. 798.83 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17372. 798.83 s [algebraic-graphs]
  17373. 798.83 s [algebraic-graphs] ============ Graph.adjacencyList ============
  17374. 798.83 s [algebraic-graphs] OK: adjacencyList empty == []
  17375. 798.83 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17376. 798.83 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17377. 798.83 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17378. 798.83 s [algebraic-graphs]
  17379. 798.83 s [algebraic-graphs] ============ Graph.preSet ============
  17380. 798.83 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17381. 798.83 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17382. 798.83 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17383. 798.83 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17384. 798.83 s [algebraic-graphs]
  17385. 798.84 s [algebraic-graphs] ============ Graph.preIntSet ============
  17386. 798.84 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17387. 798.84 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17388. 798.84 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17389. 798.84 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17390. 798.84 s [algebraic-graphs]
  17391. 798.84 s [algebraic-graphs] ============ Graph.postSet ============
  17392. 798.84 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17393. 798.84 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17394. 798.84 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17395. 798.84 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17396. 798.84 s [algebraic-graphs]
  17397. 798.84 s [algebraic-graphs] ============ Graph.postIntSet ============
  17398. 798.84 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17399. 798.84 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17400. 798.84 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17401. 798.84 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17402. 798.84 s [algebraic-graphs]
  17403. 798.84 s [algebraic-graphs] ============ Graph.size ============
  17404. 798.84 s [algebraic-graphs] OK: size empty == 1
  17405. 798.84 s [algebraic-graphs] OK: size (vertex x) == 1
  17406. 798.84 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  17407. 798.84 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  17408. 798.84 s [algebraic-graphs] OK: size x >= 1
  17409. 798.84 s [algebraic-graphs] OK: size x >= vertexCount x
  17410. 798.84 s [algebraic-graphs]
  17411. 798.84 s [algebraic-graphs] ============ Graph.path ============
  17412. 798.84 s [algebraic-graphs] OK: path [] == empty
  17413. 798.84 s [algebraic-graphs] OK: path [x] == vertex x
  17414. 798.84 s [algebraic-graphs] OK: path [x,y] == edge x y
  17415. 798.84 s [algebraic-graphs]
  17416. 798.84 s [algebraic-graphs] ============ Graph.circuit ============
  17417. 798.84 s [algebraic-graphs] OK: circuit [] == empty
  17418. 798.84 s [algebraic-graphs] OK: circuit [x] == edge x x
  17419. 798.84 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17420. 798.84 s [algebraic-graphs]
  17421. 798.84 s [algebraic-graphs] ============ Graph.clique ============
  17422. 798.84 s [algebraic-graphs] OK: clique [] == empty
  17423. 798.84 s [algebraic-graphs] OK: clique [x] == vertex x
  17424. 798.84 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17425. 798.84 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17426. 798.84 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17427. 798.84 s [algebraic-graphs]
  17428. 798.84 s [algebraic-graphs] ============ Graph.biclique ============
  17429. 798.84 s [algebraic-graphs] OK: biclique [] [] == empty
  17430. 798.84 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17431. 798.84 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17432. 798.84 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17433. 798.84 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17434. 798.84 s [algebraic-graphs]
  17435. 798.84 s [algebraic-graphs] ============ Graph.star ============
  17436. 798.84 s [algebraic-graphs] OK: star x [] == vertex x
  17437. 798.84 s [algebraic-graphs] OK: star x [y] == edge x y
  17438. 798.84 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17439. 798.84 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17440. 798.84 s [algebraic-graphs]
  17441. 798.84 s [algebraic-graphs] ============ Graph.stars ============
  17442. 798.84 s [algebraic-graphs] OK: stars [] == empty
  17443. 798.84 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17444. 798.84 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17445. 798.84 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17446. 798.84 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17447. 798.84 s [algebraic-graphs] OK: stars . adjacencyList == id
  17448. 798.84 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17449. 798.84 s [algebraic-graphs]
  17450. 798.84 s [algebraic-graphs] ============ Graph.tree ============
  17451. 798.84 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17452. 798.84 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17453. 798.84 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17454. 798.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)]
  17455. 798.84 s [algebraic-graphs]
  17456. 798.84 s [algebraic-graphs] ============ Graph.forest ============
  17457. 798.84 s [algebraic-graphs] OK: forest [] == empty
  17458. 798.84 s [algebraic-graphs] OK: forest [x] == tree x
  17459. 798.84 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17460. 798.84 s [algebraic-graphs] OK: forest == overlays . map tree
  17461. 798.84 s [algebraic-graphs]
  17462. 798.84 s [algebraic-graphs] ============ Graph.removeVertex ============
  17463. 801.90 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17464. 801.90 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17465. 801.90 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17466. 802.02 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17467. 802.02 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17468. 802.02 s [algebraic-graphs]
  17469. 802.02 s [algebraic-graphs] ============ Graph.removeEdge ============
  17470. 802.02 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17471. 802.02 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17472. 802.02 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17473. 802.02 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17474. 802.02 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17475. 802.02 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  17476. 802.02 s [algebraic-graphs]
  17477. 802.02 s [algebraic-graphs] ============ Graph.replaceVertex ============
  17478. 802.02 s [algebraic-graphs] OK: replaceVertex x x == id
  17479. 802.02 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17480. 802.02 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17481. 802.02 s [algebraic-graphs]
  17482. 802.02 s [algebraic-graphs] ============ Graph.mergeVertices ============
  17483. 802.02 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17484. 802.02 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17485. 802.02 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17486. 802.02 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17487. 802.02 s [algebraic-graphs]
  17488. 802.02 s [algebraic-graphs] ============ Graph.transpose ============
  17489. 802.02 s [algebraic-graphs] OK: transpose empty == empty
  17490. 802.02 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17491. 802.02 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17492. 802.02 s [algebraic-graphs] OK: transpose . transpose == id
  17493. 802.02 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17494. 802.02 s [algebraic-graphs]
  17495. 802.02 s [algebraic-graphs] ============ Graph.gmap ============
  17496. 802.02 s [algebraic-graphs] OK: gmap f empty == empty
  17497. 802.02 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17498. 802.02 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17499. 802.02 s [algebraic-graphs] OK: gmap id == id
  17500. 802.02 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17501. 802.02 s [algebraic-graphs]
  17502. 802.02 s [algebraic-graphs] ============ Graph.induce ============
  17503. 802.02 s [algebraic-graphs] OK: induce (const True ) x == x
  17504. 802.02 s [algebraic-graphs] OK: induce (const False) x == empty
  17505. 802.02 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17506. 802.02 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17507. 802.02 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17508. 802.02 s [algebraic-graphs]
  17509. 802.02 s [algebraic-graphs] ============ Graph.induceJust ============
  17510. 802.02 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17511. 802.02 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  17512. 802.02 s [algebraic-graphs] OK: induceJust . gmap Just == id
  17513. 802.02 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  17514. 802.02 s [algebraic-graphs]
  17515. 802.02 s [algebraic-graphs] ============ Graph.compose ============
  17516. 802.02 s [algebraic-graphs] OK: compose empty x == empty
  17517. 802.02 s [algebraic-graphs] OK: compose x empty == empty
  17518. 802.02 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17519. 802.02 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17520. 802.02 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17521. 802.02 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17522. 802.02 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17523. 802.02 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17524. 802.02 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17525. 802.02 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17526. 802.02 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  17527. 802.02 s [algebraic-graphs]
  17528. 802.02 s [algebraic-graphs] ============ Graph.(===) ============
  17529. 802.02 s [algebraic-graphs] OK: x === x == True
  17530. 802.02 s [algebraic-graphs] OK: x === x + empty == False
  17531. 802.02 s [algebraic-graphs] OK: x + y === x + y == True
  17532. 802.02 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  17533. 802.02 s [algebraic-graphs] OK: x + y === x * y == False
  17534. 802.02 s [algebraic-graphs]
  17535. 802.02 s [algebraic-graphs] ============ Graph.mesh ============
  17536. 802.02 s [algebraic-graphs] OK: mesh xs [] == empty
  17537. 802.02 s [algebraic-graphs] OK: mesh [] ys == empty
  17538. 802.02 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  17539. 802.02 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  17540. 802.02 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  17541. 802.02 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  17542. 802.02 s [algebraic-graphs]
  17543. 802.02 s [algebraic-graphs] ============ Graph.torus ============
  17544. 802.02 s [algebraic-graphs] OK: torus xs [] == empty
  17545. 802.02 s [algebraic-graphs] OK: torus [] ys == empty
  17546. 802.02 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  17547. 802.02 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  17548. 802.02 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  17549. 802.02 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  17550. 802.02 s [algebraic-graphs]
  17551. 802.02 s [algebraic-graphs] ============ Graph.deBruijn ============
  17552. 802.02 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  17553. 802.02 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  17554. 802.02 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  17555. 802.02 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  17556. 802.02 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  17557. 802.02 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  17558. 802.02 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  17559. 802.02 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  17560. 802.02 s [algebraic-graphs]
  17561. 802.02 s [algebraic-graphs] ============ Graph.splitVertex ============
  17562. 802.02 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  17563. 802.02 s [algebraic-graphs] OK: splitVertex x [x] == id
  17564. 802.02 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  17565. 802.02 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  17566. 802.02 s [algebraic-graphs]
  17567. 802.02 s [algebraic-graphs] ============ Graph.bind ============
  17568. 802.02 s [algebraic-graphs] OK: bind empty f == empty
  17569. 802.02 s [algebraic-graphs] OK: bind (vertex x) f == f x
  17570. 802.02 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  17571. 802.02 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  17572. 802.02 s [algebraic-graphs] OK: bind x (const empty) == empty
  17573. 802.02 s [algebraic-graphs] OK: bind x vertex == x
  17574. 802.02 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  17575. 802.02 s [algebraic-graphs]
  17576. 802.02 s [algebraic-graphs] ============ Graph.simplify ============
  17577. 802.02 s [algebraic-graphs] OK: simplify == id
  17578. 802.02 s [algebraic-graphs] OK: size (simplify x) <= size x
  17579. 802.02 s [algebraic-graphs]
  17580. 802.02 s [algebraic-graphs] ============ Graph.box ============
  17581. 802.02 s [algebraic-graphs] OK: box x y ~~ box y x
  17582. 802.02 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  17583. 802.02 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  17584. 802.02 s [algebraic-graphs] OK: box x empty ~~ empty
  17585. 802.02 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  17586. 802.02 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  17587. 802.02 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  17588. 802.02 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  17589. 802.02 s [algebraic-graphs]
  17590. 802.02 s [algebraic-graphs] ============ Graph.sparsify ============
  17591. 802.02 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  17592. 802.02 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  17593. 802.02 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  17594. 802.02 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  17595. 802.02 s [algebraic-graphs]
  17596. 802.02 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  17597. 802.02 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  17598. 802.02 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  17599. 802.02 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  17600. 802.02 s [algebraic-graphs]
  17601. 802.02 s [algebraic-graphs] ============ Graph.context ============
  17602. 802.02 s [algebraic-graphs] OK: context (const False) x == Nothing
  17603. 802.02 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  17604. 802.02 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  17605. 802.02 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  17606. 802.02 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  17607. 802.02 s [algebraic-graphs]
  17608. 802.02 s [algebraic-graphs] ============ Graph.buildg ============
  17609. 802.02 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  17610. 802.02 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  17611. 802.02 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
  17612. 802.02 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
  17613. 802.02 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  17614. 802.02 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  17615. 802.02 s [algebraic-graphs]
  17616. 802.02 s [algebraic-graphs] ============ Internal.List ============
  17617. 802.02 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  17618. 802.02 s [algebraic-graphs]
  17619. 802.02 s [algebraic-graphs] ============ Graph.Label ============
  17620. 802.02 s [algebraic-graphs]
  17621. 802.02 s [algebraic-graphs] ============ Any: instances ============
  17622. 802.02 s [algebraic-graphs] OK: Semiring
  17623. 802.02 s [algebraic-graphs] OK: StarSemiring
  17624. 802.02 s [algebraic-graphs] OK: Dioid
  17625. 802.02 s [algebraic-graphs]
  17626. 802.02 s [algebraic-graphs] ============ Distance Int: instances ============
  17627. 802.02 s [algebraic-graphs] OK: Semiring
  17628. 802.02 s [algebraic-graphs] OK: StarSemiring
  17629. 802.02 s [algebraic-graphs] OK: Dioid
  17630. 802.02 s [algebraic-graphs]
  17631. 802.02 s [algebraic-graphs] ============ Capacity Int: instances ============
  17632. 802.02 s [algebraic-graphs] OK: Semiring
  17633. 802.02 s [algebraic-graphs] OK: StarSemiring
  17634. 802.02 s [algebraic-graphs] OK: Dioid
  17635. 802.02 s [algebraic-graphs]
  17636. 802.02 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  17637. 802.02 s [algebraic-graphs] OK: LeftNearRing
  17638. 802.02 s [algebraic-graphs]
  17639. 802.02 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  17640. 802.02 s [algebraic-graphs] OK: Semiring
  17641. 802.02 s [algebraic-graphs] OK: Dioid
  17642. 802.02 s [algebraic-graphs]
  17643. 802.02 s [algebraic-graphs] ============ Count Int: instances ============
  17644. 802.02 s [algebraic-graphs] OK: Semiring
  17645. 802.02 s [algebraic-graphs] OK: StarSemiring
  17646. 802.02 s [algebraic-graphs]
  17647. 802.02 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  17648. 802.02 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  17649. 802.02 s [algebraic-graphs] OK: empty
  17650. 802.02 s [algebraic-graphs] OK: vertex
  17651. 802.02 s [algebraic-graphs] OK: edge
  17652. 802.02 s [algebraic-graphs] OK: overlay
  17653. 802.02 s [algebraic-graphs] OK: connect
  17654. 802.02 s [algebraic-graphs] OK: vertices
  17655. 802.02 s [algebraic-graphs] OK: edges
  17656. 802.02 s [algebraic-graphs] OK: overlays
  17657. 802.02 s [algebraic-graphs] OK: fromAdjacencyMaps
  17658. 802.02 s [algebraic-graphs] OK: removeVertex
  17659. 802.02 s [algebraic-graphs] OK: removeEdge
  17660. 802.02 s [algebraic-graphs] OK: replaceVertex
  17661. 802.02 s [algebraic-graphs] OK: replaceEdge
  17662. 802.02 s [algebraic-graphs] OK: transpose
  17663. 802.02 s [algebraic-graphs] OK: gmap
  17664. 802.02 s [algebraic-graphs] OK: emap
  17665. 802.02 s [algebraic-graphs] OK: induce
  17666. 802.02 s [algebraic-graphs] OK: closure
  17667. 802.02 s [algebraic-graphs] OK: reflexiveClosure
  17668. 802.02 s [algebraic-graphs] OK: symmetricClosure
  17669. 802.02 s [algebraic-graphs] OK: transitiveClosure
  17670. 802.02 s [algebraic-graphs]
  17671. 802.02 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  17672. 802.02 s [algebraic-graphs] OK: isEmpty empty == True
  17673. 802.02 s [algebraic-graphs] OK: hasVertex x empty == False
  17674. 802.02 s [algebraic-graphs] OK: vertexCount empty == 0
  17675. 802.02 s [algebraic-graphs] OK: edgeCount empty == 0
  17676. 802.02 s [algebraic-graphs]
  17677. 802.02 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  17678. 802.02 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17679. 802.02 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17680. 802.02 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17681. 802.02 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17682. 802.02 s [algebraic-graphs]
  17683. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  17684. 804.22 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  17685. 804.22 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  17686. 804.22 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  17687. 804.22 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  17688. 804.22 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  17689. 804.22 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  17690. 804.22 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  17691. 804.22 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  17692. 804.22 s [algebraic-graphs]
  17693. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  17694. 804.22 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17695. 804.22 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17696. 804.22 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17697. 804.22 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17698. 804.22 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17699. 804.22 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17700. 804.22 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17701. 804.22 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17702. 804.22 s [algebraic-graphs]
  17703. 804.22 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  17704. 804.22 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  17705. 804.22 s [algebraic-graphs]
  17706. 804.22 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  17707. 804.22 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  17708. 804.22 s [algebraic-graphs]
  17709. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  17710. 804.22 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  17711. 804.22 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  17712. 804.22 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  17713. 804.22 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  17714. 804.22 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17715. 804.22 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  17716. 804.22 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  17717. 804.22 s [algebraic-graphs]
  17718. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  17719. 804.22 s [algebraic-graphs] OK: vertices [] == empty
  17720. 804.22 s [algebraic-graphs] OK: vertices [x] == vertex x
  17721. 804.22 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17722. 804.22 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17723. 804.22 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17724. 804.22 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17725. 804.22 s [algebraic-graphs]
  17726. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  17727. 804.22 s [algebraic-graphs] OK: edges [] == empty
  17728. 804.22 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  17729. 804.22 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  17730. 804.22 s [algebraic-graphs]
  17731. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  17732. 804.22 s [algebraic-graphs] OK: overlays [] == empty
  17733. 804.22 s [algebraic-graphs] OK: overlays [x] == x
  17734. 804.22 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17735. 804.22 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17736. 804.22 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17737. 804.22 s [algebraic-graphs]
  17738. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  17739. 804.22 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  17740. 804.22 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  17741. 804.22 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  17742. 804.22 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  17743. 804.22 s [algebraic-graphs]
  17744. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  17745. 804.22 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17746. 804.22 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17747. 804.22 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17748. 804.22 s [algebraic-graphs]
  17749. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  17750. 804.22 s [algebraic-graphs] OK: isEmpty empty == True
  17751. 804.22 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17752. 804.22 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17753. 804.22 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17754. 804.22 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  17755. 804.22 s [algebraic-graphs]
  17756. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  17757. 804.22 s [algebraic-graphs] OK: hasVertex x empty == False
  17758. 804.22 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17759. 804.22 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17760. 804.22 s [algebraic-graphs]
  17761. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  17762. 804.22 s [algebraic-graphs] OK: hasEdge x y empty == False
  17763. 804.22 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17764. 804.22 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  17765. 804.22 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17766. 804.22 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  17767. 804.22 s [algebraic-graphs]
  17768. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  17769. 804.22 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  17770. 804.22 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  17771. 804.22 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  17772. 804.22 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  17773. 804.22 s [algebraic-graphs]
  17774. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  17775. 804.22 s [algebraic-graphs] OK: vertexCount empty == 0
  17776. 804.22 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17777. 804.22 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17778. 804.22 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17779. 804.22 s [algebraic-graphs]
  17780. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  17781. 804.22 s [algebraic-graphs] OK: edgeCount empty == 0
  17782. 804.22 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17783. 804.22 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  17784. 804.22 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17785. 804.22 s [algebraic-graphs]
  17786. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  17787. 804.22 s [algebraic-graphs] OK: vertexList empty == []
  17788. 804.22 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17789. 804.22 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17790. 804.22 s [algebraic-graphs]
  17791. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  17792. 804.22 s [algebraic-graphs] OK: edgeList empty == []
  17793. 804.22 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17794. 804.22 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  17795. 804.22 s [algebraic-graphs]
  17796. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  17797. 804.22 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17798. 804.22 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17799. 804.22 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17800. 804.22 s [algebraic-graphs]
  17801. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  17802. 804.22 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17803. 804.22 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17804. 804.22 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  17805. 804.22 s [algebraic-graphs]
  17806. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  17807. 804.22 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17808. 804.22 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17809. 804.22 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  17810. 804.22 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  17811. 804.22 s [algebraic-graphs]
  17812. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  17813. 804.22 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17814. 804.22 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17815. 804.22 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  17816. 804.22 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  17817. 804.22 s [algebraic-graphs]
  17818. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  17819. 804.22 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  17820. 804.22 s [algebraic-graphs]
  17821. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  17822. 804.22 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17823. 804.22 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17824. 804.22 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  17825. 804.22 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  17826. 804.22 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17827. 804.22 s [algebraic-graphs]
  17828. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  17829. 804.22 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  17830. 804.22 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17831. 804.22 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17832. 804.22 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17833. 804.22 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17834. 804.22 s [algebraic-graphs]
  17835. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  17836. 804.22 s [algebraic-graphs] OK: replaceVertex x x == id
  17837. 804.22 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17838. 804.22 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  17839. 804.22 s [algebraic-graphs]
  17840. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  17841. 804.22 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  17842. 804.22 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  17843. 804.22 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  17844. 804.22 s [algebraic-graphs]
  17845. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  17846. 804.22 s [algebraic-graphs] OK: transpose empty == empty
  17847. 804.22 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17848. 804.22 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  17849. 804.22 s [algebraic-graphs] OK: transpose . transpose == id
  17850. 804.22 s [algebraic-graphs]
  17851. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  17852. 804.22 s [algebraic-graphs] OK: gmap f empty == empty
  17853. 804.22 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17854. 804.22 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  17855. 804.22 s [algebraic-graphs] OK: gmap id == id
  17856. 804.22 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17857. 804.22 s [algebraic-graphs]
  17858. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  17859. 804.22 s [algebraic-graphs] OK: emap h empty == empty
  17860. 804.22 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  17861. 804.22 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  17862. 804.22 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  17863. 804.22 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  17864. 804.22 s [algebraic-graphs] OK: emap id == id
  17865. 804.22 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  17866. 804.22 s [algebraic-graphs]
  17867. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  17868. 804.22 s [algebraic-graphs] OK: induce (const True ) x == x
  17869. 804.22 s [algebraic-graphs] OK: induce (const False) x == empty
  17870. 804.22 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17871. 804.22 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17872. 804.22 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17873. 804.22 s [algebraic-graphs]
  17874. 804.22 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  17875. 805.33 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17876. 805.33 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  17877. 805.33 s [algebraic-graphs] OK: induceJust . gmap Just == id
  17878. 805.33 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  17879. 805.33 s [algebraic-graphs]
  17880. 805.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  17881. 805.33 s [algebraic-graphs] OK: closure empty == empty
  17882. 805.33 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  17883. 805.33 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  17884. 805.33 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  17885. 805.33 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  17886. 805.33 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  17887. 805.33 s [algebraic-graphs] OK: closure . closure == closure
  17888. 805.33 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  17889. 805.33 s [algebraic-graphs]
  17890. 805.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  17891. 805.33 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  17892. 805.33 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  17893. 805.33 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  17894. 805.33 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  17895. 805.33 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  17896. 805.33 s [algebraic-graphs]
  17897. 805.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  17898. 805.33 s [algebraic-graphs] OK: symmetricClosure empty == empty
  17899. 805.33 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  17900. 805.33 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  17901. 805.33 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  17902. 805.33 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  17903. 805.33 s [algebraic-graphs]
  17904. 805.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  17905. 805.33 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17906. 805.33 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17907. 805.33 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  17908. 805.33 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17909. 805.33 s [algebraic-graphs]
  17910. 805.33 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  17911. 805.33 s [algebraic-graphs] OK: isEmpty empty == True
  17912. 805.33 s [algebraic-graphs] OK: hasVertex x empty == False
  17913. 805.33 s [algebraic-graphs] OK: vertexCount empty == 0
  17914. 805.33 s [algebraic-graphs] OK: edgeCount empty == 0
  17915. 805.33 s [algebraic-graphs]
  17916. 805.33 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  17917. 805.33 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17918. 805.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17919. 805.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17920. 805.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17921. 805.33 s [algebraic-graphs]
  17922. 805.33 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  17923. 805.33 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  17924. 805.33 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  17925. 805.33 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  17926. 805.33 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  17927. 805.33 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  17928. 805.33 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  17929. 805.33 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  17930. 805.33 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  17931. 805.33 s [algebraic-graphs]
  17932. 805.33 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  17933. 805.33 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17934. 805.33 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17935. 805.33 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17936. 805.33 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17937. 805.33 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17938. 805.33 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17939. 805.33 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17940. 805.33 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17941. 805.33 s [algebraic-graphs]
  17942. 805.33 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  17943. 805.33 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  17944. 805.33 s [algebraic-graphs]
  17945. 805.33 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  17946. 805.33 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  17947. 805.33 s [algebraic-graphs]
  17948. 805.33 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  17949. 805.33 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  17950. 805.33 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  17951. 805.33 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  17952. 805.33 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  17953. 805.33 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17954. 805.33 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  17955. 805.33 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  17956. 805.33 s [algebraic-graphs]
  17957. 805.33 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  17958. 805.33 s [algebraic-graphs] OK: vertices [] == empty
  17959. 805.33 s [algebraic-graphs] OK: vertices [x] == vertex x
  17960. 805.33 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17961. 805.33 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17962. 805.33 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17963. 805.33 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17964. 805.33 s [algebraic-graphs]
  17965. 805.33 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  17966. 805.33 s [algebraic-graphs] OK: edges [] == empty
  17967. 805.33 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  17968. 805.33 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  17969. 805.33 s [algebraic-graphs]
  17970. 805.33 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  17971. 805.33 s [algebraic-graphs] OK: overlays [] == empty
  17972. 805.33 s [algebraic-graphs] OK: overlays [x] == x
  17973. 805.33 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17974. 805.33 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17975. 805.33 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17976. 805.33 s [algebraic-graphs]
  17977. 805.33 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  17978. 805.33 s [algebraic-graphs] OK: foldg empty vertex connect == id
  17979. 805.33 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  17980. 805.33 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  17981. 805.33 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  17982. 805.33 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  17983. 805.33 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  17984. 805.33 s [algebraic-graphs]
  17985. 805.33 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  17986. 805.33 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  17987. 805.33 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  17988. 805.33 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  17989. 805.33 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  17990. 805.33 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  17991. 805.33 s [algebraic-graphs]
  17992. 805.33 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  17993. 805.33 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17994. 805.33 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17995. 805.33 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17996. 805.33 s [algebraic-graphs]
  17997. 805.33 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  17998. 805.33 s [algebraic-graphs] OK: isEmpty empty == True
  17999. 805.33 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18000. 805.33 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18001. 805.33 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18002. 805.33 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  18003. 805.33 s [algebraic-graphs]
  18004. 805.33 s [algebraic-graphs] ============ Labelled.Graph.size ============
  18005. 805.33 s [algebraic-graphs] OK: size empty == 1
  18006. 805.33 s [algebraic-graphs] OK: size (vertex x) == 1
  18007. 805.33 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  18008. 805.33 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  18009. 805.33 s [algebraic-graphs] OK: size x >= 1
  18010. 805.33 s [algebraic-graphs] OK: size x >= vertexCount x
  18011. 805.33 s [algebraic-graphs]
  18012. 805.33 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  18013. 805.33 s [algebraic-graphs] OK: hasVertex x empty == False
  18014. 805.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18015. 805.33 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18016. 805.33 s [algebraic-graphs]
  18017. 805.33 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  18018. 805.33 s [algebraic-graphs] OK: hasEdge x y empty == False
  18019. 805.33 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18020. 805.33 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  18021. 805.33 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18022. 805.33 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  18023. 805.33 s [algebraic-graphs]
  18024. 805.33 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  18025. 805.33 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  18026. 805.33 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  18027. 805.33 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  18028. 805.33 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  18029. 805.33 s [algebraic-graphs]
  18030. 805.33 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  18031. 805.33 s [algebraic-graphs] OK: vertexCount empty == 0
  18032. 805.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18033. 805.33 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18034. 805.33 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18035. 805.33 s [algebraic-graphs]
  18036. 805.33 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  18037. 805.33 s [algebraic-graphs] OK: edgeCount empty == 0
  18038. 805.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18039. 805.33 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  18040. 805.33 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18041. 805.33 s [algebraic-graphs]
  18042. 805.33 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  18043. 805.33 s [algebraic-graphs] OK: vertexList empty == []
  18044. 805.33 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18045. 805.33 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18046. 805.33 s [algebraic-graphs]
  18047. 805.33 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  18048. 805.33 s [algebraic-graphs] OK: edgeList empty == []
  18049. 805.33 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18050. 805.33 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  18051. 805.33 s [algebraic-graphs]
  18052. 805.33 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  18053. 805.33 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18054. 805.33 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18055. 805.33 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18056. 805.33 s [algebraic-graphs]
  18057. 805.33 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  18058. 805.33 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18059. 805.33 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18060. 805.33 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  18061. 805.33 s [algebraic-graphs]
  18062. 805.33 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  18063. 805.33 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18064. 805.33 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18065. 807.77 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  18066. 807.93 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  18067. 807.93 s [algebraic-graphs]
  18068. 807.93 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  18069. 807.93 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18070. 807.93 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18071. 807.93 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  18072. 807.93 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  18073. 807.93 s [algebraic-graphs]
  18074. 807.93 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  18075. 807.93 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18076. 807.93 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18077. 807.93 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  18078. 807.93 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  18079. 807.93 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18080. 807.93 s [algebraic-graphs]
  18081. 807.93 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  18082. 807.93 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  18083. 807.93 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18084. 807.93 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18085. 807.93 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18086. 807.93 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18087. 807.93 s [algebraic-graphs]
  18088. 807.93 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  18089. 807.93 s [algebraic-graphs] OK: replaceVertex x x == id
  18090. 807.93 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18091. 807.93 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  18092. 807.93 s [algebraic-graphs]
  18093. 807.93 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  18094. 807.93 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  18095. 807.93 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  18096. 807.93 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  18097. 807.93 s [algebraic-graphs]
  18098. 807.93 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  18099. 807.93 s [algebraic-graphs] OK: transpose empty == empty
  18100. 807.93 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18101. 807.93 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  18102. 807.93 s [algebraic-graphs] OK: transpose . transpose == id
  18103. 807.93 s [algebraic-graphs]
  18104. 807.93 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  18105. 807.93 s [algebraic-graphs] OK: fmap f empty == empty
  18106. 807.93 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  18107. 807.93 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  18108. 807.93 s [algebraic-graphs] OK: fmap id == id
  18109. 807.93 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  18110. 807.93 s [algebraic-graphs]
  18111. 807.93 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  18112. 807.93 s [algebraic-graphs] OK: emap h empty == empty
  18113. 807.93 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  18114. 807.93 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  18115. 807.93 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  18116. 807.93 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  18117. 807.93 s [algebraic-graphs] OK: emap id == id
  18118. 807.93 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  18119. 807.93 s [algebraic-graphs]
  18120. 807.93 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  18121. 807.93 s [algebraic-graphs] OK: induce (const True ) x == x
  18122. 807.93 s [algebraic-graphs] OK: induce (const False) x == empty
  18123. 807.93 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18124. 807.93 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18125. 807.93 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18126. 807.93 s [algebraic-graphs]
  18127. 807.93 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  18128. 807.93 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18129. 807.93 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18130. 807.93 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18131. 807.93 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18132. 807.93 s [algebraic-graphs]
  18133. 807.93 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  18134. 807.93 s [algebraic-graphs] OK: closure empty == empty
  18135. 807.93 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  18136. 807.93 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  18137. 807.93 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  18138. 807.93 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18139. 807.93 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18140. 807.93 s [algebraic-graphs] OK: closure . closure == closure
  18141. 807.93 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18142. 807.93 s [algebraic-graphs]
  18143. 807.93 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  18144. 807.93 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  18145. 807.93 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  18146. 807.93 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  18147. 807.93 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  18148. 807.93 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18149. 807.93 s [algebraic-graphs]
  18150. 807.93 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  18151. 807.93 s [algebraic-graphs] OK: symmetricClosure empty == empty
  18152. 807.93 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18153. 807.93 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  18154. 807.93 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18155. 807.93 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18156. 807.93 s [algebraic-graphs]
  18157. 807.93 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  18158. 807.93 s [algebraic-graphs] OK: transitiveClosure empty == empty
  18159. 807.93 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18160. 807.93 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  18161. 807.93 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18162. 807.93 s [algebraic-graphs]
  18163. 807.93 s [algebraic-graphs] ============ Labelled.Graph.context ============
  18164. 807.93 s [algebraic-graphs] OK: context (const False) x == Nothing
  18165. 807.93 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  18166. 807.93 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  18167. 807.93 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  18168. 807.93 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  18169. 807.93 s [algebraic-graphs]
  18170. 807.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  18171. 807.93 s [algebraic-graphs] OK: Axioms of non-empty graphs
  18172. 807.93 s [algebraic-graphs] OK: Theorems of non-empty graphs
  18173. 807.93 s [algebraic-graphs]
  18174. 807.93 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  18175. 807.93 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18176. 807.93 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18177. 807.93 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18178. 807.93 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18179. 807.93 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18180. 807.93 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18181. 807.93 s [algebraic-graphs] OK: x <= x + y
  18182. 807.93 s [algebraic-graphs] OK: x + y <= x * y
  18183. 807.93 s [algebraic-graphs]
  18184. 807.93 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  18185. 807.93 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  18186. 807.93 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  18187. 807.93 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  18188. 807.93 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  18189. 807.93 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  18190. 807.93 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  18191. 807.93 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  18192. 807.93 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  18193. 807.93 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  18194. 807.93 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  18195. 807.93 s [algebraic-graphs]
  18196. 807.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  18197. 807.93 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  18198. 807.93 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  18199. 807.93 s [algebraic-graphs]
  18200. 807.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  18201. 807.93 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  18202. 807.93 s [algebraic-graphs]
  18203. 807.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  18204. 807.93 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18205. 807.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18206. 807.93 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18207. 807.93 s [algebraic-graphs]
  18208. 807.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  18209. 807.93 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18210. 807.93 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18211. 807.93 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18212. 807.93 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18213. 807.93 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18214. 807.93 s [algebraic-graphs]
  18215. 807.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  18216. 807.93 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18217. 807.93 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18218. 807.93 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18219. 807.93 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18220. 807.93 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18221. 807.93 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18222. 807.93 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18223. 807.93 s [algebraic-graphs]
  18224. 807.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  18225. 807.93 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18226. 807.93 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18227. 807.93 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18228. 807.93 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18229. 807.93 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18230. 807.93 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18231. 807.93 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18232. 807.93 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18233. 807.93 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18234. 807.93 s [algebraic-graphs]
  18235. 807.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  18236. 807.93 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  18237. 807.93 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  18238. 807.93 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  18239. 807.93 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  18240. 807.93 s [algebraic-graphs]
  18241. 807.93 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  18242. 807.93 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  18243. 807.93 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  18244. 807.93 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  18245. 807.93 s [algebraic-graphs]
  18246. 810.49 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  18247. 810.49 s [algebraic-graphs] OK: overlays1 [x] == x
  18248. 810.49 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  18249. 810.49 s [algebraic-graphs]
  18250. 810.49 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  18251. 810.50 s [algebraic-graphs] OK: connects1 [x] == x
  18252. 810.50 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  18253. 810.50 s [algebraic-graphs]
  18254. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  18255. 810.50 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18256. 810.50 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18257. 810.50 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  18258. 810.50 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18259. 810.50 s [algebraic-graphs]
  18260. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  18261. 810.50 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18262. 810.50 s [algebraic-graphs]
  18263. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  18264. 810.50 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18265. 810.50 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18266. 810.50 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18267. 810.50 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18268. 810.50 s [algebraic-graphs]
  18269. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  18270. 810.50 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18271. 810.50 s [algebraic-graphs] OK: vertexCount x >= 1
  18272. 810.50 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  18273. 810.50 s [algebraic-graphs]
  18274. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  18275. 810.50 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18276. 810.50 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18277. 810.50 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18278. 810.50 s [algebraic-graphs]
  18279. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  18280. 810.50 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  18281. 810.50 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  18282. 810.50 s [algebraic-graphs]
  18283. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  18284. 810.50 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18285. 810.50 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18286. 810.50 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18287. 810.50 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  18288. 810.50 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18289. 810.50 s [algebraic-graphs]
  18290. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  18291. 810.50 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18292. 810.50 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  18293. 810.50 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  18294. 810.50 s [algebraic-graphs]
  18295. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  18296. 810.50 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18297. 810.50 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18298. 810.50 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  18299. 810.50 s [algebraic-graphs]
  18300. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  18301. 810.50 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18302. 810.50 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18303. 810.50 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18304. 810.50 s [algebraic-graphs]
  18305. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  18306. 810.50 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18307. 810.50 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18308. 810.50 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18309. 810.50 s [algebraic-graphs]
  18310. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  18311. 810.50 s [algebraic-graphs] OK: path1 [x] == vertex x
  18312. 810.50 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  18313. 810.50 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  18314. 810.50 s [algebraic-graphs]
  18315. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  18316. 810.50 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  18317. 810.50 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  18318. 810.50 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  18319. 810.50 s [algebraic-graphs]
  18320. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  18321. 810.50 s [algebraic-graphs] OK: clique1 [x] == vertex x
  18322. 810.50 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  18323. 810.50 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  18324. 810.50 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  18325. 810.50 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  18326. 810.50 s [algebraic-graphs]
  18327. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  18328. 810.50 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18329. 810.50 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  18330. 810.50 s [algebraic-graphs]
  18331. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  18332. 810.50 s [algebraic-graphs] OK: star x [] == vertex x
  18333. 810.50 s [algebraic-graphs] OK: star x [y] == edge x y
  18334. 810.50 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  18335. 810.50 s [algebraic-graphs]
  18336. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  18337. 810.50 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  18338. 810.50 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  18339. 810.50 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  18340. 810.50 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  18341. 810.50 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  18342. 810.50 s [algebraic-graphs]
  18343. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  18344. 810.50 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18345. 810.50 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  18346. 810.50 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18347. 810.50 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  18348. 810.50 s [algebraic-graphs]
  18349. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  18350. 810.50 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  18351. 810.50 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  18352. 810.50 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  18353. 810.50 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  18354. 810.50 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  18355. 810.50 s [algebraic-graphs]
  18356. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  18357. 810.50 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  18358. 810.50 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18359. 810.50 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18360. 810.50 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18361. 810.50 s [algebraic-graphs]
  18362. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  18363. 810.50 s [algebraic-graphs] OK: replaceVertex x x == id
  18364. 810.50 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18365. 810.50 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18366. 810.50 s [algebraic-graphs]
  18367. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  18368. 810.50 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18369. 810.50 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18370. 810.50 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18371. 810.50 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18372. 810.50 s [algebraic-graphs]
  18373. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  18374. 810.50 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18375. 810.50 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18376. 810.50 s [algebraic-graphs] OK: transpose . transpose == id
  18377. 810.50 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18378. 810.50 s [algebraic-graphs]
  18379. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  18380. 810.50 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18381. 810.50 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18382. 810.50 s [algebraic-graphs] OK: gmap id == id
  18383. 810.50 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18384. 810.50 s [algebraic-graphs]
  18385. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  18386. 810.50 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  18387. 810.50 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  18388. 810.50 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  18389. 810.50 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  18390. 810.50 s [algebraic-graphs]
  18391. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  18392. 810.50 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  18393. 810.50 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  18394. 810.50 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  18395. 810.50 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  18396. 810.50 s [algebraic-graphs]
  18397. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  18398. 810.50 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  18399. 810.50 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  18400. 810.50 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  18401. 810.50 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  18402. 810.50 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18403. 810.50 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18404. 810.50 s [algebraic-graphs] OK: closure . closure == closure
  18405. 810.50 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18406. 810.50 s [algebraic-graphs]
  18407. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  18408. 810.50 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  18409. 810.50 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  18410. 810.50 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  18411. 810.50 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18412. 810.50 s [algebraic-graphs]
  18413. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  18414. 810.50 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18415. 810.50 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  18416. 810.50 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18417. 810.50 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18418. 810.50 s [algebraic-graphs]
  18419. 810.50 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  18420. 810.50 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18421. 810.50 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  18422. 810.50 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  18423. 810.50 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18424. 810.50 s [algebraic-graphs]
  18425. 810.50 s [algebraic-graphs] ============ NonEmpty.Graph.============
  18426. 810.50 s [algebraic-graphs] OK: Axioms of non-empty graphs
  18427. 810.50 s [algebraic-graphs] OK: Theorems of non-empty graphs
  18428. 810.50 s [algebraic-graphs]
  18429. 810.50 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  18430. 810.50 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18431. 810.50 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18432. 810.50 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18433. 810.50 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18434. 810.50 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18435. 810.50 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18436. 810.50 s [algebraic-graphs] OK: x <= x + y
  18437. 810.50 s [algebraic-graphs] OK: x + y <= x * y
  18438. 810.50 s [algebraic-graphs]
  18439. 810.50 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  18440. 810.50 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  18441. 810.50 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  18442. 810.50 s [algebraic-graphs] OK: fmap id == id
  18443. 810.50 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  18444. 810.50 s [algebraic-graphs]
  18445. 810.50 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  18446. 810.50 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  18447. 811.83 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  18448. 811.83 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  18449. 811.83 s [algebraic-graphs] OK: (x >>= vertex) == x
  18450. 811.83 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  18451. 811.83 s [algebraic-graphs]
  18452. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  18453. 811.83 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  18454. 811.83 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  18455. 811.83 s [algebraic-graphs]
  18456. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  18457. 811.83 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18458. 811.83 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18459. 811.83 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18460. 811.83 s [algebraic-graphs] OK: size (vertex x) == 1
  18461. 811.83 s [algebraic-graphs]
  18462. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  18463. 811.83 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18464. 811.83 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18465. 811.83 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18466. 811.83 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18467. 811.83 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18468. 811.83 s [algebraic-graphs]
  18469. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  18470. 811.83 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18471. 811.83 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18472. 811.83 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18473. 811.83 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18474. 811.83 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18475. 811.83 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  18476. 811.83 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18477. 811.83 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18478. 811.83 s [algebraic-graphs]
  18479. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  18480. 811.83 s [algebraic-graphs] OK: overlay1 empty x == x
  18481. 811.83 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  18482. 811.83 s [algebraic-graphs]
  18483. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  18484. 811.83 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18485. 811.83 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18486. 811.83 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18487. 811.83 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18488. 811.83 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18489. 811.83 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18490. 811.83 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18491. 811.83 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  18492. 811.83 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18493. 811.83 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18494. 811.83 s [algebraic-graphs]
  18495. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  18496. 811.83 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  18497. 811.83 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  18498. 811.83 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  18499. 811.83 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  18500. 811.83 s [algebraic-graphs]
  18501. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  18502. 811.83 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  18503. 811.83 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  18504. 811.83 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  18505. 811.83 s [algebraic-graphs]
  18506. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  18507. 811.83 s [algebraic-graphs] OK: overlays1 [x] == x
  18508. 811.83 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  18509. 811.83 s [algebraic-graphs]
  18510. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  18511. 811.83 s [algebraic-graphs] OK: connects1 [x] == x
  18512. 811.83 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  18513. 811.83 s [algebraic-graphs]
  18514. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  18515. 811.83 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  18516. 811.83 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  18517. 811.83 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  18518. 811.83 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  18519. 811.83 s [algebraic-graphs]
  18520. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  18521. 811.83 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18522. 811.83 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18523. 811.83 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  18524. 811.83 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18525. 811.83 s [algebraic-graphs]
  18526. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  18527. 811.83 s [algebraic-graphs] OK: x === x == True
  18528. 811.83 s [algebraic-graphs] OK: x + y === x + y == True
  18529. 811.83 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  18530. 811.83 s [algebraic-graphs] OK: x + y === x * y == False
  18531. 811.83 s [algebraic-graphs]
  18532. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  18533. 811.83 s [algebraic-graphs] OK: size (vertex x) == 1
  18534. 811.83 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  18535. 811.83 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  18536. 811.83 s [algebraic-graphs] OK: size x >= 1
  18537. 811.83 s [algebraic-graphs] OK: size x >= vertexCount x
  18538. 811.83 s [algebraic-graphs]
  18539. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  18540. 811.83 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18541. 811.83 s [algebraic-graphs]
  18542. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  18543. 811.83 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18544. 811.83 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18545. 811.83 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18546. 811.83 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18547. 811.83 s [algebraic-graphs]
  18548. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  18549. 811.83 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18550. 811.83 s [algebraic-graphs] OK: vertexCount x >= 1
  18551. 811.83 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  18552. 811.83 s [algebraic-graphs]
  18553. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  18554. 811.83 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18555. 811.83 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18556. 811.83 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18557. 811.83 s [algebraic-graphs]
  18558. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  18559. 811.83 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  18560. 811.83 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  18561. 811.83 s [algebraic-graphs]
  18562. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  18563. 811.83 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18564. 811.83 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18565. 811.83 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18566. 811.83 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  18567. 811.83 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18568. 811.83 s [algebraic-graphs]
  18569. 811.83 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  18570. 811.83 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18571. 811.84 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  18572. 811.84 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  18573. 811.84 s [algebraic-graphs]
  18574. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  18575. 811.84 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18576. 811.84 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18577. 811.84 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  18578. 811.84 s [algebraic-graphs]
  18579. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  18580. 811.84 s [algebraic-graphs] OK: path1 [x] == vertex x
  18581. 811.84 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  18582. 811.84 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  18583. 811.84 s [algebraic-graphs]
  18584. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  18585. 811.84 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  18586. 811.84 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  18587. 811.84 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  18588. 811.84 s [algebraic-graphs]
  18589. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  18590. 811.84 s [algebraic-graphs] OK: clique1 [x] == vertex x
  18591. 811.84 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  18592. 811.84 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  18593. 811.84 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  18594. 811.84 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  18595. 811.84 s [algebraic-graphs]
  18596. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  18597. 811.84 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18598. 811.84 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  18599. 811.84 s [algebraic-graphs]
  18600. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  18601. 811.84 s [algebraic-graphs] OK: star x [] == vertex x
  18602. 811.84 s [algebraic-graphs] OK: star x [y] == edge x y
  18603. 811.84 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  18604. 811.84 s [algebraic-graphs]
  18605. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  18606. 811.84 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  18607. 811.84 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  18608. 811.84 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  18609. 811.84 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  18610. 811.84 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  18611. 811.84 s [algebraic-graphs]
  18612. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  18613. 811.84 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18614. 811.84 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  18615. 811.84 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18616. 811.84 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  18617. 811.84 s [algebraic-graphs]
  18618. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  18619. 811.84 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  18620. 811.84 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  18621. 811.84 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  18622. 811.84 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  18623. 811.84 s [algebraic-graphs]
  18624. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  18625. 811.84 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  18626. 811.84 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  18627. 811.84 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  18628. 811.84 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  18629. 811.84 s [algebraic-graphs]
  18630. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  18631. 811.84 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  18632. 811.84 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  18633. 811.84 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  18634. 811.84 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  18635. 811.84 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  18636. 811.84 s [algebraic-graphs]
  18637. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  18638. 811.84 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  18639. 811.84 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18640. 811.84 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18641. 811.84 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18642. 811.84 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  18643. 811.84 s [algebraic-graphs]
  18644. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  18645. 811.84 s [algebraic-graphs] OK: replaceVertex x x == id
  18646. 811.84 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18647. 811.84 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18648. 811.84 s [algebraic-graphs]
  18649. 811.84 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  18650. 811.84 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18651. 817.00 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18652. 817.00 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18653. 817.04 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18654. 817.04 s [algebraic-graphs]
  18655. 817.04 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  18656. 817.04 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  18657. 817.04 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  18658. 817.04 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  18659. 817.04 s [algebraic-graphs]
  18660. 817.04 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  18661. 817.04 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18662. 817.04 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18663. 817.04 s [algebraic-graphs] OK: transpose . transpose == id
  18664. 817.04 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18665. 817.04 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18666. 817.04 s [algebraic-graphs]
  18667. 817.04 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  18668. 817.04 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  18669. 817.04 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  18670. 817.04 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  18671. 817.04 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  18672. 817.04 s [algebraic-graphs]
  18673. 817.04 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  18674. 817.04 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  18675. 817.04 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  18676. 817.04 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  18677. 817.04 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  18678. 817.04 s [algebraic-graphs]
  18679. 817.04 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  18680. 817.04 s [algebraic-graphs] OK: simplify == id
  18681. 817.04 s [algebraic-graphs] OK: size (simplify x) <= size x
  18682. 817.04 s [algebraic-graphs] OK: simplify 1 === 1
  18683. 817.04 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  18684. 817.04 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  18685. 817.04 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  18686. 817.04 s [algebraic-graphs]
  18687. 817.04 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  18688. 817.04 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  18689. 817.04 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  18690. 817.04 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  18691. 817.04 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  18692. 817.04 s [algebraic-graphs]
  18693. 817.04 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  18694. 817.04 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  18695. 817.04 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  18696. 817.04 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  18697. 817.04 s [algebraic-graphs]
  18698. 817.04 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  18699. 817.04 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  18700. 817.04 s [algebraic-graphs] OK: box x y ~~ box y x
  18701. 817.04 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  18702. 817.04 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  18703. 817.04 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18704. 817.04 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18705. 817.04 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  18706. 817.04 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18707. 817.04 s [algebraic-graphs]
  18708. 817.04 s [algebraic-graphs] ============ Relation ============
  18709. 817.04 s [algebraic-graphs] OK: Axioms of graphs
  18710. 817.04 s [algebraic-graphs]
  18711. 817.04 s [algebraic-graphs] ============ Relation.consistent ============
  18712. 817.04 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  18713. 817.04 s [algebraic-graphs]
  18714. 817.04 s [algebraic-graphs] OK: consistent empty == True
  18715. 817.04 s [algebraic-graphs] OK: consistent (vertex x) == True
  18716. 817.04 s [algebraic-graphs] OK: consistent (overlay x y) == True
  18717. 817.04 s [algebraic-graphs] OK: consistent (connect x y) == True
  18718. 817.04 s [algebraic-graphs] OK: consistent (edge x y) == True
  18719. 817.04 s [algebraic-graphs] OK: consistent (edges xs) == True
  18720. 817.04 s [algebraic-graphs] OK: consistent (stars xs) == True
  18721. 817.04 s [algebraic-graphs]
  18722. 817.04 s [algebraic-graphs] ============ Relation.Show ============
  18723. 817.04 s [algebraic-graphs] OK: show (empty ) == "empty"
  18724. 817.04 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  18725. 817.04 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  18726. 817.04 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  18727. 817.04 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  18728. 817.04 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  18729. 817.04 s [algebraic-graphs]
  18730. 817.04 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  18731. 817.04 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  18732. 817.04 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  18733. 817.04 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  18734. 817.04 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  18735. 817.04 s [algebraic-graphs]
  18736. 817.04 s [algebraic-graphs] ============ Relation.Ord ============
  18737. 817.04 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18738. 817.04 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18739. 817.04 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18740. 817.04 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18741. 817.04 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18742. 817.04 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18743. 817.04 s [algebraic-graphs] OK: x <= x + y
  18744. 817.04 s [algebraic-graphs] OK: x + y <= x * y
  18745. 817.04 s [algebraic-graphs]
  18746. 817.04 s [algebraic-graphs] ============ Relation.empty ============
  18747. 817.04 s [algebraic-graphs] OK: isEmpty empty == True
  18748. 817.04 s [algebraic-graphs] OK: hasVertex x empty == False
  18749. 817.04 s [algebraic-graphs] OK: vertexCount empty == 0
  18750. 817.04 s [algebraic-graphs] OK: edgeCount empty == 0
  18751. 817.04 s [algebraic-graphs]
  18752. 817.04 s [algebraic-graphs] ============ Relation.vertex ============
  18753. 817.04 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18754. 817.04 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18755. 817.04 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18756. 817.04 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18757. 817.04 s [algebraic-graphs]
  18758. 817.05 s [algebraic-graphs] ============ Relation.edge ============
  18759. 817.05 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18760. 817.05 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18761. 817.05 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18762. 817.05 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18763. 817.05 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18764. 817.05 s [algebraic-graphs]
  18765. 817.05 s [algebraic-graphs] ============ Relation.overlay ============
  18766. 817.05 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18767. 817.05 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18768. 817.05 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18769. 817.05 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18770. 817.05 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18771. 817.05 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18772. 817.05 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18773. 817.05 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18774. 817.05 s [algebraic-graphs]
  18775. 817.05 s [algebraic-graphs] ============ Relation.connect ============
  18776. 817.05 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18777. 817.05 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18778. 817.05 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18779. 817.05 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18780. 817.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18781. 817.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18782. 817.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18783. 817.05 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18784. 817.05 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18785. 817.05 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18786. 817.05 s [algebraic-graphs]
  18787. 817.05 s [algebraic-graphs] ============ Relation.vertices ============
  18788. 817.05 s [algebraic-graphs] OK: vertices [] == empty
  18789. 817.05 s [algebraic-graphs] OK: vertices [x] == vertex x
  18790. 817.05 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18791. 817.05 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18792. 817.05 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18793. 817.05 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18794. 817.05 s [algebraic-graphs]
  18795. 817.05 s [algebraic-graphs] ============ Relation.edges ============
  18796. 817.05 s [algebraic-graphs] OK: edges [] == empty
  18797. 817.05 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18798. 817.05 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18799. 817.05 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18800. 817.05 s [algebraic-graphs]
  18801. 817.05 s [algebraic-graphs] ============ Relation.overlays ============
  18802. 817.05 s [algebraic-graphs] OK: overlays [] == empty
  18803. 817.05 s [algebraic-graphs] OK: overlays [x] == x
  18804. 817.05 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18805. 817.05 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18806. 817.05 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18807. 817.05 s [algebraic-graphs]
  18808. 817.05 s [algebraic-graphs] ============ Relation.connects ============
  18809. 817.05 s [algebraic-graphs] OK: connects [] == empty
  18810. 817.05 s [algebraic-graphs] OK: connects [x] == x
  18811. 817.05 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18812. 817.05 s [algebraic-graphs] OK: connects == foldr connect empty
  18813. 817.05 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18814. 817.05 s [algebraic-graphs]
  18815. 817.05 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  18816. 817.05 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18817. 817.05 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18818. 817.05 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18819. 817.05 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18820. 817.05 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  18821. 817.05 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18822. 817.05 s [algebraic-graphs]
  18823. 817.05 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  18824. 817.05 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  18825. 817.05 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  18826. 817.05 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  18827. 817.05 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  18828. 817.05 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  18829. 817.05 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  18830. 817.05 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  18831. 817.05 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  18832. 817.05 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  18833. 817.05 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  18834. 817.05 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  18835. 817.05 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  18836. 817.05 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  18837. 817.05 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  18838. 817.05 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  18839. 817.05 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  18840. 817.05 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  18841. 819.85 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  18842. 819.85 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  18843. 819.85 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  18844. 819.85 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  18845. 819.85 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  18846. 819.85 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  18847. 819.85 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  18848. 819.85 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  18849. 819.85 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  18850. 819.85 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  18851. 819.86 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  18852. 819.86 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18853. 819.86 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  18854. 819.86 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  18855. 819.86 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  18856. 819.86 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  18857. 819.86 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  18858. 819.86 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18859. 819.86 s [algebraic-graphs]
  18860. 819.86 s [algebraic-graphs] ============ Relation.foldg ============
  18861. 819.86 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  18862. 819.86 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  18863. 819.86 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  18864. 819.86 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  18865. 819.86 s [algebraic-graphs]
  18866. 819.86 s [algebraic-graphs] ============ Relation.isEmpty ============
  18867. 819.86 s [algebraic-graphs] OK: isEmpty empty == True
  18868. 819.86 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18869. 819.86 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18870. 819.86 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18871. 819.86 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  18872. 819.86 s [algebraic-graphs]
  18873. 819.86 s [algebraic-graphs] ============ Relation.hasVertex ============
  18874. 819.86 s [algebraic-graphs] OK: hasVertex x empty == False
  18875. 819.86 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18876. 819.86 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18877. 819.86 s [algebraic-graphs]
  18878. 819.86 s [algebraic-graphs] ============ Relation.hasEdge ============
  18879. 819.86 s [algebraic-graphs] OK: hasEdge x y empty == False
  18880. 819.86 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18881. 819.86 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18882. 819.86 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18883. 819.86 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18884. 819.86 s [algebraic-graphs]
  18885. 819.86 s [algebraic-graphs] ============ Relation.vertexCount ============
  18886. 819.86 s [algebraic-graphs] OK: vertexCount empty == 0
  18887. 819.86 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18888. 819.86 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18889. 819.86 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18890. 819.86 s [algebraic-graphs]
  18891. 819.86 s [algebraic-graphs] ============ Relation.edgeCount ============
  18892. 819.86 s [algebraic-graphs] OK: edgeCount empty == 0
  18893. 819.86 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18894. 819.86 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18895. 819.86 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18896. 819.86 s [algebraic-graphs]
  18897. 819.86 s [algebraic-graphs] ============ Relation.vertexList ============
  18898. 819.86 s [algebraic-graphs] OK: vertexList empty == []
  18899. 819.86 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18900. 819.86 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18901. 819.86 s [algebraic-graphs]
  18902. 819.86 s [algebraic-graphs] ============ Relation.vertexSet ============
  18903. 819.86 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18904. 819.86 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18905. 819.86 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18906. 819.86 s [algebraic-graphs]
  18907. 819.86 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  18908. 819.86 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  18909. 819.86 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18910. 819.86 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18911. 819.86 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18912. 819.86 s [algebraic-graphs]
  18913. 819.86 s [algebraic-graphs] ============ Relation.edgeList ============
  18914. 819.86 s [algebraic-graphs] OK: edgeList empty == []
  18915. 819.86 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18916. 819.86 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18917. 819.86 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18918. 819.86 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18919. 819.86 s [algebraic-graphs]
  18920. 819.86 s [algebraic-graphs] ============ Relation.edgeSet ============
  18921. 819.86 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18922. 819.86 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18923. 819.86 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18924. 819.86 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18925. 819.86 s [algebraic-graphs]
  18926. 819.86 s [algebraic-graphs] ============ Relation.adjacencyList ============
  18927. 819.86 s [algebraic-graphs] OK: adjacencyList empty == []
  18928. 819.86 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  18929. 819.86 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  18930. 819.86 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  18931. 819.86 s [algebraic-graphs]
  18932. 819.86 s [algebraic-graphs] ============ Relation.preSet ============
  18933. 819.86 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18934. 819.86 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18935. 819.86 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18936. 819.86 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18937. 819.86 s [algebraic-graphs]
  18938. 819.86 s [algebraic-graphs] ============ Relation.preIntSet ============
  18939. 819.86 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18940. 819.86 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18941. 819.86 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18942. 819.86 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18943. 819.86 s [algebraic-graphs]
  18944. 819.86 s [algebraic-graphs] ============ Relation.postSet ============
  18945. 819.86 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18946. 819.86 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18947. 819.86 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18948. 819.86 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18949. 819.86 s [algebraic-graphs]
  18950. 819.86 s [algebraic-graphs] ============ Relation.postIntSet ============
  18951. 819.86 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18952. 819.86 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18953. 819.86 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18954. 819.86 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18955. 819.86 s [algebraic-graphs]
  18956. 819.86 s [algebraic-graphs] ============ Relation.path ============
  18957. 819.86 s [algebraic-graphs] OK: path [] == empty
  18958. 819.86 s [algebraic-graphs] OK: path [x] == vertex x
  18959. 819.86 s [algebraic-graphs] OK: path [x,y] == edge x y
  18960. 819.86 s [algebraic-graphs]
  18961. 819.86 s [algebraic-graphs] ============ Relation.circuit ============
  18962. 819.86 s [algebraic-graphs] OK: circuit [] == empty
  18963. 819.86 s [algebraic-graphs] OK: circuit [x] == edge x x
  18964. 819.86 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18965. 819.86 s [algebraic-graphs]
  18966. 819.86 s [algebraic-graphs] ============ Relation.clique ============
  18967. 819.86 s [algebraic-graphs] OK: clique [] == empty
  18968. 819.86 s [algebraic-graphs] OK: clique [x] == vertex x
  18969. 819.86 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18970. 819.86 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18971. 819.86 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18972. 819.86 s [algebraic-graphs]
  18973. 819.86 s [algebraic-graphs] ============ Relation.biclique ============
  18974. 819.86 s [algebraic-graphs] OK: biclique [] [] == empty
  18975. 819.86 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18976. 819.86 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18977. 819.86 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18978. 819.86 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18979. 819.86 s [algebraic-graphs]
  18980. 819.86 s [algebraic-graphs] ============ Relation.star ============
  18981. 819.86 s [algebraic-graphs] OK: star x [] == vertex x
  18982. 819.86 s [algebraic-graphs] OK: star x [y] == edge x y
  18983. 819.86 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18984. 819.86 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  18985. 819.86 s [algebraic-graphs]
  18986. 819.86 s [algebraic-graphs] ============ Relation.stars ============
  18987. 819.86 s [algebraic-graphs] OK: stars [] == empty
  18988. 819.86 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  18989. 819.86 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18990. 819.86 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18991. 819.86 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18992. 819.86 s [algebraic-graphs] OK: stars . adjacencyList == id
  18993. 819.86 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18994. 819.86 s [algebraic-graphs]
  18995. 819.86 s [algebraic-graphs] ============ Relation.tree ============
  18996. 819.86 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18997. 819.86 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  18998. 819.86 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18999. 819.86 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  19000. 819.86 s [algebraic-graphs]
  19001. 819.86 s [algebraic-graphs] ============ Relation.forest ============
  19002. 819.86 s [algebraic-graphs] OK: forest [] == empty
  19003. 819.86 s [algebraic-graphs] OK: forest [x] == tree x
  19004. 819.86 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  19005. 819.86 s [algebraic-graphs] OK: forest == overlays . map tree
  19006. 819.86 s [algebraic-graphs]
  19007. 819.86 s [algebraic-graphs] ============ Relation.removeVertex ============
  19008. 819.86 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19009. 819.86 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19010. 819.86 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  19011. 819.86 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  19012. 819.86 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19013. 819.86 s [algebraic-graphs]
  19014. 819.86 s [algebraic-graphs] ============ Relation.removeEdge ============
  19015. 819.86 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  19016. 819.86 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19017. 819.86 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19018. 819.86 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19019. 819.86 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19020. 819.86 s [algebraic-graphs]
  19021. 819.86 s [algebraic-graphs] ============ Relation.replaceVertex ============
  19022. 819.86 s [algebraic-graphs] OK: replaceVertex x x == id
  19023. 819.86 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19024. 819.86 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19025. 819.86 s [algebraic-graphs]
  19026. 819.86 s [algebraic-graphs] ============ Relation.mergeVertices ============
  19027. 819.86 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19028. 837.85 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19029. 837.85 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19030. 837.89 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19031. 837.89 s [algebraic-graphs]
  19032. 837.89 s [algebraic-graphs] ============ Relation.transpose ============
  19033. 837.89 s [algebraic-graphs] OK: transpose empty == empty
  19034. 837.89 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19035. 837.89 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19036. 837.89 s [algebraic-graphs] OK: transpose . transpose == id
  19037. 837.89 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19038. 837.89 s [algebraic-graphs]
  19039. 837.89 s [algebraic-graphs] ============ Relation.gmap ============
  19040. 837.89 s [algebraic-graphs] OK: gmap f empty == empty
  19041. 837.89 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19042. 837.89 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19043. 837.89 s [algebraic-graphs] OK: gmap id == id
  19044. 837.89 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19045. 837.89 s [algebraic-graphs]
  19046. 837.89 s [algebraic-graphs] ============ Relation.induce ============
  19047. 837.89 s [algebraic-graphs] OK: induce (const True ) x == x
  19048. 837.89 s [algebraic-graphs] OK: induce (const False) x == empty
  19049. 837.89 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19050. 837.89 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19051. 837.89 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19052. 837.89 s [algebraic-graphs]
  19053. 837.89 s [algebraic-graphs] ============ Relation.compose ============
  19054. 837.89 s [algebraic-graphs] OK: compose empty x == empty
  19055. 837.89 s [algebraic-graphs] OK: compose x empty == empty
  19056. 837.89 s [algebraic-graphs] OK: compose (vertex x) y == empty
  19057. 837.89 s [algebraic-graphs] OK: compose x (vertex y) == empty
  19058. 837.89 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  19059. 837.89 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  19060. 837.89 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  19061. 837.89 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  19062. 837.89 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  19063. 837.89 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  19064. 837.89 s [algebraic-graphs]
  19065. 837.89 s [algebraic-graphs] ============ Relation.closure ============
  19066. 837.89 s [algebraic-graphs] OK: closure empty == empty
  19067. 837.89 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  19068. 837.89 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  19069. 837.89 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  19070. 837.89 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  19071. 837.89 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19072. 837.89 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19073. 837.89 s [algebraic-graphs] OK: closure . closure == closure
  19074. 837.89 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19075. 837.89 s [algebraic-graphs]
  19076. 837.89 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  19077. 837.89 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19078. 837.89 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  19079. 837.89 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  19080. 837.89 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  19081. 837.89 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19082. 837.89 s [algebraic-graphs]
  19083. 837.89 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  19084. 837.89 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19085. 837.89 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19086. 837.89 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  19087. 837.89 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19088. 837.89 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19089. 837.89 s [algebraic-graphs]
  19090. 837.89 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  19091. 837.89 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19092. 837.89 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19093. 837.89 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  19094. 837.89 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  19095. 837.89 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19096. 837.89 s [algebraic-graphs]
  19097. 837.89 s [algebraic-graphs] ============ Relation.induceJust ============
  19098. 837.89 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19099. 837.89 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19100. 837.89 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19101. 837.89 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19102. 837.89 s [algebraic-graphs]
  19103. 837.89 s [algebraic-graphs] ============ ReflexiveRelation ============
  19104. 837.89 s [algebraic-graphs] OK: Axioms of reflexive graphs
  19105. 837.89 s [algebraic-graphs]
  19106. 837.89 s [algebraic-graphs] ============ TransitiveRelation ============
  19107. 837.89 s [algebraic-graphs] OK: Axioms of transitive graphs
  19108. 837.89 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  19109. 837.89 s [algebraic-graphs]
  19110. 837.89 s [algebraic-graphs] ============ PreorderRelation ============
  19111. 837.89 s [algebraic-graphs] OK: Axioms of preorder graphs
  19112. 837.89 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  19113. 837.89 s [algebraic-graphs]
  19114. 837.89 s [algebraic-graphs] ============ Symmetric.Relation ============
  19115. 837.89 s [algebraic-graphs] OK: Axioms of undirected graphs
  19116. 837.89 s [algebraic-graphs]
  19117. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  19118. 837.89 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  19119. 837.89 s [algebraic-graphs]
  19120. 837.89 s [algebraic-graphs] OK: consistent empty == True
  19121. 837.89 s [algebraic-graphs] OK: consistent (vertex x) == True
  19122. 837.89 s [algebraic-graphs] OK: consistent (overlay x y) == True
  19123. 837.89 s [algebraic-graphs] OK: consistent (connect x y) == True
  19124. 837.89 s [algebraic-graphs] OK: consistent (edge x y) == True
  19125. 837.89 s [algebraic-graphs] OK: consistent (edges xs) == True
  19126. 837.89 s [algebraic-graphs] OK: consistent (stars xs) == True
  19127. 837.89 s [algebraic-graphs]
  19128. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  19129. 837.89 s [algebraic-graphs] OK: show (empty ) == "empty"
  19130. 837.89 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  19131. 837.89 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  19132. 837.89 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  19133. 837.89 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  19134. 837.89 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  19135. 837.89 s [algebraic-graphs]
  19136. 837.89 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  19137. 837.89 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  19138. 837.89 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  19139. 837.89 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  19140. 837.89 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  19141. 837.89 s [algebraic-graphs]
  19142. 837.89 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  19143. 837.89 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  19144. 837.89 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  19145. 837.89 s [algebraic-graphs]
  19146. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  19147. 837.89 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  19148. 837.89 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  19149. 837.89 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  19150. 837.89 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  19151. 837.89 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  19152. 837.89 s [algebraic-graphs]
  19153. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  19154. 837.89 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  19155. 837.89 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  19156. 837.89 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  19157. 837.89 s [algebraic-graphs]
  19158. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  19159. 837.89 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19160. 837.89 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19161. 837.89 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19162. 837.89 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19163. 837.89 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19164. 837.89 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  19165. 837.89 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  19166. 837.89 s [algebraic-graphs] OK: x <= x + y
  19167. 837.89 s [algebraic-graphs] OK: x + y <= x * y
  19168. 837.89 s [algebraic-graphs]
  19169. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  19170. 837.89 s [algebraic-graphs] OK: isEmpty empty == True
  19171. 837.89 s [algebraic-graphs] OK: hasVertex x empty == False
  19172. 837.89 s [algebraic-graphs] OK: vertexCount empty == 0
  19173. 837.89 s [algebraic-graphs] OK: edgeCount empty == 0
  19174. 837.89 s [algebraic-graphs]
  19175. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  19176. 837.89 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19177. 837.89 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19178. 837.89 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19179. 837.89 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19180. 837.89 s [algebraic-graphs]
  19181. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  19182. 837.89 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19183. 837.89 s [algebraic-graphs] OK: edge x y == edge y x
  19184. 837.89 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  19185. 837.89 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19186. 837.89 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19187. 837.89 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19188. 837.89 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19189. 837.89 s [algebraic-graphs]
  19190. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  19191. 837.89 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19192. 837.89 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19193. 837.89 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19194. 837.89 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19195. 837.89 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19196. 837.89 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19197. 837.89 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19198. 837.89 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19199. 837.89 s [algebraic-graphs]
  19200. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  19201. 837.89 s [algebraic-graphs] OK: connect x y == connect y x
  19202. 837.89 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  19203. 837.89 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19204. 837.89 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19205. 837.89 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19206. 837.89 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19207. 837.89 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19208. 837.89 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  19209. 837.89 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19210. 837.89 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19211. 837.89 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19212. 837.89 s [algebraic-graphs]
  19213. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  19214. 837.89 s [algebraic-graphs] OK: vertices [] == empty
  19215. 837.89 s [algebraic-graphs] OK: vertices [x] == vertex x
  19216. 837.89 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19217. 837.89 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19218. 837.89 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19219. 837.89 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19220. 837.89 s [algebraic-graphs]
  19221. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  19222. 837.89 s [algebraic-graphs] OK: edges [] == empty
  19223. 837.89 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  19224. 837.89 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  19225. 837.89 s [algebraic-graphs]
  19226. 837.89 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  19227. 837.89 s [algebraic-graphs] OK: overlays [] == empty
  19228. 847.40 s [algebraic-graphs] OK: overlays [x] == x
  19229. 847.43 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19230. 847.43 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19231. 847.43 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19232. 847.43 s [algebraic-graphs]
  19233. 847.43 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  19234. 847.43 s [algebraic-graphs] OK: connects [] == empty
  19235. 847.43 s [algebraic-graphs] OK: connects [x] == x
  19236. 847.43 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19237. 847.43 s [algebraic-graphs] OK: connects == foldr connect empty
  19238. 847.43 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19239. 847.43 s [algebraic-graphs] OK: connects == connects . reverse
  19240. 847.43 s [algebraic-graphs]
  19241. 847.43 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  19242. 847.43 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19243. 847.43 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19244. 847.43 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19245. 847.43 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19246. 847.43 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  19247. 847.43 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19248. 847.43 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  19249. 847.43 s [algebraic-graphs]
  19250. 847.43 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  19251. 847.43 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  19252. 847.43 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  19253. 847.43 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  19254. 847.43 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  19255. 847.43 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  19256. 847.43 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  19257. 847.43 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  19258. 847.43 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  19259. 847.43 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  19260. 847.43 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  19261. 847.43 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  19262. 847.43 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  19263. 847.43 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  19264. 847.43 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  19265. 847.43 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  19266. 847.43 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  19267. 847.43 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  19268. 847.43 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  19269. 847.43 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  19270. 847.43 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  19271. 847.43 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  19272. 847.43 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  19273. 847.43 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  19274. 847.43 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19275. 847.43 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  19276. 847.43 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  19277. 847.43 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  19278. 847.43 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  19279. 847.43 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  19280. 847.43 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19281. 847.43 s [algebraic-graphs]
  19282. 847.43 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  19283. 847.43 s [algebraic-graphs] OK: isEmpty empty == True
  19284. 847.43 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19285. 847.43 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19286. 847.43 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19287. 847.43 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  19288. 847.43 s [algebraic-graphs]
  19289. 847.43 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  19290. 847.43 s [algebraic-graphs] OK: hasVertex x empty == False
  19291. 847.43 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19292. 847.44 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19293. 847.44 s [algebraic-graphs]
  19294. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  19295. 847.44 s [algebraic-graphs] OK: hasEdge x y empty == False
  19296. 847.44 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19297. 847.44 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19298. 847.44 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  19299. 847.44 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19300. 847.44 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  19301. 847.44 s [algebraic-graphs]
  19302. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  19303. 847.44 s [algebraic-graphs] OK: vertexCount empty == 0
  19304. 847.44 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19305. 847.44 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19306. 847.44 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19307. 847.44 s [algebraic-graphs]
  19308. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  19309. 847.44 s [algebraic-graphs] OK: edgeCount empty == 0
  19310. 847.44 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19311. 847.44 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19312. 847.44 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19313. 847.44 s [algebraic-graphs]
  19314. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  19315. 847.44 s [algebraic-graphs] OK: vertexList empty == []
  19316. 847.44 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19317. 847.44 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19318. 847.44 s [algebraic-graphs]
  19319. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  19320. 847.44 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19321. 847.44 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19322. 847.44 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19323. 847.44 s [algebraic-graphs]
  19324. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  19325. 847.44 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  19326. 847.44 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  19327. 847.44 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  19328. 847.44 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  19329. 847.44 s [algebraic-graphs]
  19330. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  19331. 847.44 s [algebraic-graphs] OK: edgeList empty == []
  19332. 847.44 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19333. 847.44 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  19334. 847.44 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  19335. 847.44 s [algebraic-graphs]
  19336. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  19337. 847.44 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19338. 847.44 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19339. 847.44 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  19340. 847.44 s [algebraic-graphs]
  19341. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  19342. 847.44 s [algebraic-graphs] OK: adjacencyList empty == []
  19343. 847.44 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19344. 847.44 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  19345. 847.44 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  19346. 847.44 s [algebraic-graphs]
  19347. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  19348. 847.44 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  19349. 847.44 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  19350. 847.44 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  19351. 847.44 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  19352. 847.44 s [algebraic-graphs]
  19353. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  19354. 847.44 s [algebraic-graphs] OK: path [] == empty
  19355. 847.44 s [algebraic-graphs] OK: path [x] == vertex x
  19356. 847.44 s [algebraic-graphs] OK: path [x,y] == edge x y
  19357. 847.44 s [algebraic-graphs] OK: path == path . reverse
  19358. 847.44 s [algebraic-graphs]
  19359. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  19360. 847.44 s [algebraic-graphs] OK: circuit [] == empty
  19361. 847.44 s [algebraic-graphs] OK: circuit [x] == edge x x
  19362. 847.44 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  19363. 847.44 s [algebraic-graphs] OK: circuit == circuit . reverse
  19364. 847.44 s [algebraic-graphs]
  19365. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  19366. 847.44 s [algebraic-graphs] OK: clique [] == empty
  19367. 847.44 s [algebraic-graphs] OK: clique [x] == vertex x
  19368. 847.44 s [algebraic-graphs] OK: clique [x,y] == edge x y
  19369. 847.44 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  19370. 847.44 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  19371. 847.44 s [algebraic-graphs] OK: clique == clique . reverse
  19372. 847.44 s [algebraic-graphs]
  19373. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  19374. 847.44 s [algebraic-graphs] OK: biclique [] [] == empty
  19375. 847.44 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  19376. 847.44 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  19377. 847.44 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19378. 847.44 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  19379. 847.44 s [algebraic-graphs]
  19380. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  19381. 847.44 s [algebraic-graphs] OK: star x [] == vertex x
  19382. 847.44 s [algebraic-graphs] OK: star x [y] == edge x y
  19383. 847.44 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19384. 847.44 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  19385. 847.44 s [algebraic-graphs]
  19386. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  19387. 847.44 s [algebraic-graphs] OK: stars [] == empty
  19388. 847.44 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  19389. 847.44 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  19390. 847.44 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  19391. 847.44 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  19392. 847.44 s [algebraic-graphs] OK: stars . adjacencyList == id
  19393. 847.44 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  19394. 847.44 s [algebraic-graphs]
  19395. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  19396. 847.44 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19397. 847.44 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  19398. 847.44 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19399. 847.44 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  19400. 847.44 s [algebraic-graphs]
  19401. 847.44 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  19402. 847.44 s [algebraic-graphs] OK: forest [] == empty
  19403. 853.12 s [algebraic-graphs] OK: forest [x] == tree x
  19404. 853.12 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  19405. 853.16 s [algebraic-graphs] OK: forest == overlays . map tree
  19406. 853.16 s [algebraic-graphs]
  19407. 853.16 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  19408. 853.16 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19409. 853.16 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19410. 853.16 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  19411. 853.16 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  19412. 853.16 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19413. 853.16 s [algebraic-graphs]
  19414. 853.16 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  19415. 853.16 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  19416. 853.16 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19417. 853.16 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19418. 853.16 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19419. 853.16 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19420. 853.16 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  19421. 853.16 s [algebraic-graphs]
  19422. 853.16 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  19423. 853.16 s [algebraic-graphs] OK: replaceVertex x x == id
  19424. 853.16 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19425. 853.16 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19426. 853.16 s [algebraic-graphs]
  19427. 853.16 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  19428. 853.16 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19429. 853.16 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19430. 853.16 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19431. 853.16 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19432. 853.16 s [algebraic-graphs]
  19433. 853.16 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  19434. 853.16 s [algebraic-graphs] OK: gmap f empty == empty
  19435. 853.16 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19436. 853.16 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19437. 853.16 s [algebraic-graphs] OK: gmap id == id
  19438. 853.16 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19439. 853.16 s [algebraic-graphs]
  19440. 853.16 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  19441. 853.16 s [algebraic-graphs] OK: induce (const True ) x == x
  19442. 853.16 s [algebraic-graphs] OK: induce (const False) x == empty
  19443. 853.16 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19444. 853.16 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19445. 853.16 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19446. 853.16 s [algebraic-graphs]
  19447. 853.16 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  19448. 853.16 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19449. 853.16 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19450. 853.16 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19451. 853.16 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19452. 853.16 s [algebraic-graphs]
  19453. 853.16 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  19454. 853.16 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  19455. 853.16 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  19456. 853.16 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  19457. 853.16 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  19458. 853.16 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  19459. 853.16 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  19460. 853.16 s [algebraic-graphs]
  19461. 853.16 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  19462. 853.16 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  19463. 853.16 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  19464. 853.16 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  19465. 853.16 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  19466. 853.16 s [algebraic-graphs]
  19467. 853.16 s [algebraic-graphs] ============ Typed ============
  19468. 853.16 s [algebraic-graphs]
  19469. 853.16 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  19470. 853.16 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  19471. 853.16 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  19472. 853.16 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  19473. 853.16 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  19474. 853.16 s [algebraic-graphs]
  19475. 853.16 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  19476. 853.16 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  19477. 853.16 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  19478. 853.16 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  19479. 853.16 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  19480. 853.16 s [algebraic-graphs]
  19481. 853.16 s [algebraic-graphs] ============ Typed.dfsForest ============
  19482. 853.16 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  19483. 853.16 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  19484. 853.16 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  19485. 853.16 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  19486. 853.16 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  19487. 853.16 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  19488. 853.16 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  19489. 853.16 s [algebraic-graphs]
  19490. 853.16 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  19491. 853.16 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  19492. 853.16 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  19493. 853.16 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  19494. 853.16 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  19495. 853.16 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  19496. 853.16 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  19497. 853.16 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  19498. 853.16 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  19499. 853.16 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  19500. 853.16 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  19501. 853.16 s [algebraic-graphs]
  19502. 853.16 s [algebraic-graphs] ============ Typed.dfs ============
  19503. 853.16 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  19504. 853.16 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  19505. 853.16 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  19506. 853.16 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  19507. 853.16 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  19508. 853.16 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  19509. 853.16 s [algebraic-graphs] OK: dfs % x $ [] == []
  19510. 853.16 s [algebraic-graphs]
  19511. 853.16 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  19512. 853.16 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  19513. 853.16 s [algebraic-graphs]
  19514. 853.16 s [algebraic-graphs] ============ Typed.topSort ============
  19515. 853.16 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  19516. 853.16 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  19517. 853.16 s [algebraic-graphs]
  19518. 853.16 s [algebraic-graphs] ============ Graph.Undirected ============
  19519. 853.16 s [algebraic-graphs] OK: Axioms of undirected graphs
  19520. 853.16 s [algebraic-graphs]
  19521. 853.16 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  19522. 853.16 s [algebraic-graphs] OK: show (empty ) == "empty"
  19523. 853.16 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  19524. 853.16 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  19525. 853.16 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  19526. 853.16 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  19527. 853.16 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  19528. 853.16 s [algebraic-graphs]
  19529. 853.16 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  19530. 853.16 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  19531. 853.16 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  19532. 853.16 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  19533. 853.16 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  19534. 853.16 s [algebraic-graphs]
  19535. 853.16 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  19536. 853.16 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  19537. 853.16 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  19538. 853.16 s [algebraic-graphs]
  19539. 853.16 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  19540. 853.16 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  19541. 853.16 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  19542. 853.16 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  19543. 853.16 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  19544. 853.16 s [algebraic-graphs]
  19545. 853.16 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  19546. 853.16 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  19547. 853.16 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  19548. 853.16 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  19549. 853.16 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  19550. 853.16 s [algebraic-graphs]
  19551. 853.16 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  19552. 853.16 s [algebraic-graphs] OK: complement empty == empty
  19553. 853.16 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  19554. 853.16 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  19555. 853.16 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  19556. 853.16 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  19557. 853.16 s [algebraic-graphs] OK: complement . complement == id
  19558. 853.16 s [algebraic-graphs]
  19559. 853.16 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  19560. 853.16 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19561. 853.16 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19562. 853.16 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19563. 853.16 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19564. 853.16 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19565. 853.16 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  19566. 853.16 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  19567. 853.16 s [algebraic-graphs] OK: x <= x + y
  19568. 853.16 s [algebraic-graphs] OK: x + y <= x * y
  19569. 853.16 s [algebraic-graphs]
  19570. 853.16 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  19571. 853.16 s [algebraic-graphs] OK: isEmpty empty == True
  19572. 853.16 s [algebraic-graphs] OK: hasVertex x empty == False
  19573. 853.16 s [algebraic-graphs] OK: vertexCount empty == 0
  19574. 853.16 s [algebraic-graphs] OK: edgeCount empty == 0
  19575. 853.16 s [algebraic-graphs]
  19576. 853.16 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  19577. 853.16 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19578. 853.16 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19579. 853.16 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19580. 853.16 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19581. 853.16 s [algebraic-graphs]
  19582. 853.16 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  19583. 853.16 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19584. 853.16 s [algebraic-graphs] OK: edge x y == edge y x
  19585. 860.23 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  19586. 860.23 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19587. 860.23 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19588. 860.27 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19589. 860.27 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19590. 860.27 s [algebraic-graphs]
  19591. 860.27 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  19592. 860.27 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19593. 860.27 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19594. 860.27 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19595. 860.27 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19596. 860.27 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19597. 860.27 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19598. 860.27 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19599. 860.27 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19600. 860.27 s [algebraic-graphs]
  19601. 860.27 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  19602. 860.27 s [algebraic-graphs] OK: connect x y == connect y x
  19603. 860.27 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  19604. 860.27 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19605. 860.27 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19606. 860.27 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19607. 860.27 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19608. 860.27 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19609. 860.27 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  19610. 860.27 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19611. 860.27 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19612. 860.27 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19613. 860.27 s [algebraic-graphs]
  19614. 860.27 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  19615. 860.27 s [algebraic-graphs] OK: vertices [] == empty
  19616. 860.27 s [algebraic-graphs] OK: vertices [x] == vertex x
  19617. 860.27 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19618. 860.27 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19619. 860.27 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19620. 860.27 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19621. 860.27 s [algebraic-graphs]
  19622. 860.27 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  19623. 860.27 s [algebraic-graphs] OK: edges [] == empty
  19624. 860.27 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  19625. 860.27 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  19626. 860.27 s [algebraic-graphs]
  19627. 860.27 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  19628. 860.27 s [algebraic-graphs] OK: overlays [] == empty
  19629. 860.27 s [algebraic-graphs] OK: overlays [x] == x
  19630. 860.27 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19631. 860.27 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19632. 860.27 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19633. 860.27 s [algebraic-graphs]
  19634. 860.27 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  19635. 860.27 s [algebraic-graphs] OK: connects [] == empty
  19636. 860.27 s [algebraic-graphs] OK: connects [x] == x
  19637. 860.27 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19638. 860.27 s [algebraic-graphs] OK: connects == foldr connect empty
  19639. 860.27 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19640. 860.27 s [algebraic-graphs] OK: connects == connects . reverse
  19641. 860.27 s [algebraic-graphs]
  19642. 860.27 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  19643. 860.27 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19644. 860.27 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19645. 860.27 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19646. 860.27 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19647. 860.27 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  19648. 860.27 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19649. 860.27 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  19650. 860.27 s [algebraic-graphs]
  19651. 860.27 s [algebraic-graphs] ============ Graph.Undirected.path ============
  19652. 860.27 s [algebraic-graphs] OK: path [] == empty
  19653. 860.27 s [algebraic-graphs] OK: path [x] == vertex x
  19654. 860.27 s [algebraic-graphs] OK: path [x,y] == edge x y
  19655. 860.27 s [algebraic-graphs] OK: path == path . reverse
  19656. 860.27 s [algebraic-graphs]
  19657. 860.27 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  19658. 860.27 s [algebraic-graphs] OK: circuit [] == empty
  19659. 860.27 s [algebraic-graphs] OK: circuit [x] == edge x x
  19660. 860.27 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  19661. 860.27 s [algebraic-graphs] OK: circuit == circuit . reverse
  19662. 860.27 s [algebraic-graphs]
  19663. 860.27 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  19664. 860.27 s [algebraic-graphs] OK: clique [] == empty
  19665. 860.27 s [algebraic-graphs] OK: clique [x] == vertex x
  19666. 860.27 s [algebraic-graphs] OK: clique [x,y] == edge x y
  19667. 860.27 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  19668. 860.27 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  19669. 860.27 s [algebraic-graphs] OK: clique == clique . reverse
  19670. 860.27 s [algebraic-graphs]
  19671. 860.27 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  19672. 860.27 s [algebraic-graphs] OK: biclique [] [] == empty
  19673. 860.27 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  19674. 860.27 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  19675. 860.27 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19676. 860.27 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  19677. 860.27 s [algebraic-graphs]
  19678. 860.27 s [algebraic-graphs] ============ Graph.Undirected.star ============
  19679. 860.27 s [algebraic-graphs] OK: star x [] == vertex x
  19680. 860.27 s [algebraic-graphs] OK: star x [y] == edge x y
  19681. 860.27 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19682. 860.27 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  19683. 860.27 s [algebraic-graphs]
  19684. 860.27 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  19685. 860.27 s [algebraic-graphs] OK: stars [] == empty
  19686. 860.27 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  19687. 860.27 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  19688. 860.27 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  19689. 860.27 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  19690. 860.27 s [algebraic-graphs] OK: stars . adjacencyList == id
  19691. 860.27 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  19692. 860.27 s [algebraic-graphs]
  19693. 860.27 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  19694. 860.27 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19695. 860.27 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  19696. 860.27 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19697. 860.27 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  19698. 860.27 s [algebraic-graphs]
  19699. 860.27 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  19700. 860.27 s [algebraic-graphs] OK: forest [] == empty
  19701. 860.27 s [algebraic-graphs] OK: forest [x] == tree x
  19702. 860.27 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  19703. 860.27 s [algebraic-graphs] OK: forest == overlays . map tree
  19704. 860.27 s [algebraic-graphs]
  19705. 860.27 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  19706. 860.27 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19707. 860.27 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19708. 860.27 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  19709. 860.27 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  19710. 860.27 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19711. 860.27 s [algebraic-graphs]
  19712. 860.27 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  19713. 860.27 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  19714. 860.27 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19715. 860.27 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19716. 860.27 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19717. 860.27 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19718. 860.27 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  19719. 860.27 s [algebraic-graphs]
  19720. 860.27 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  19721. 860.27 s [algebraic-graphs] OK: replaceVertex x x == id
  19722. 860.27 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19723. 860.27 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19724. 860.27 s [algebraic-graphs]
  19725. 860.27 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  19726. 860.27 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19727. 860.28 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19728. 860.28 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19729. 860.28 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19730. 860.28 s [algebraic-graphs]
  19731. 860.28 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  19732. 860.28 s [algebraic-graphs] OK: gmap f empty == empty
  19733. 860.28 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19734. 860.28 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19735. 860.28 s [algebraic-graphs] OK: gmap id == id
  19736. 860.28 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19737. 860.28 s [algebraic-graphs]
  19738. 860.28 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  19739. 860.28 s [algebraic-graphs] OK: induce (const True ) x == x
  19740. 860.28 s [algebraic-graphs] OK: induce (const False) x == empty
  19741. 860.28 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19742. 860.28 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19743. 860.28 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19744. 860.28 s [algebraic-graphs]
  19745. 860.28 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  19746. 860.28 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19747. 860.28 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19748. 860.28 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19749. 860.28 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19750. 860.28 s [algebraic-graphs] Test suite main: PASS
  19751. 860.28 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  19752. 860.28 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  19753. 860.28 s [algebraic-graphs] checkPhase completed in 1 minutes 34 seconds
  19754. 860.28 s [algebraic-graphs] Phase: haddockPhase
  19755. 860.40 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  19756. 860.41 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  19757. 860.45 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  19758. 860.72 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  19759. 860.80 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  19760. 860.84 s [algebraic-graphs] Warning: 'nub' is out of scope.
  19761. 860.84 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19762. 860.84 s [algebraic-graphs] Warning: 'sort' is out of scope.
  19763. 860.84 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19764. 860.84 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  19765. 860.84 s [algebraic-graphs] Missing documentation for:
  19766. 860.84 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  19767. 860.93 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  19768. 860.93 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19769. 860.93 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  19770. 861.01 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  19771. 861.09 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  19772. 861.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19773. 861.09 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  19774. 861.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19775. 861.09 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  19776. 861.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19777. 861.09 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  19778. 861.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19779. 861.09 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  19780. 861.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19781. 861.09 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  19782. 861.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19783. 861.09 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  19784. 861.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19785. 861.09 s [algebraic-graphs] Warning: 'box' is out of scope.
  19786. 861.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19787. 861.09 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  19788. 861.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19789. 861.09 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  19790. 861.21 s [algebraic-graphs] Warning: 'nub' is out of scope.
  19791. 861.21 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19792. 861.21 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  19793. 861.28 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  19794. 861.28 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19795. 861.28 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  19796. 861.38 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  19797. 861.53 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  19798. 861.53 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19799. 861.53 s [algebraic-graphs] Warning: 'empty' is out of scope.
  19800. 861.53 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19801. 861.53 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  19802. 861.53 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19803. 861.53 s [algebraic-graphs] Warning: 'edges' is out of scope.
  19804. 861.53 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19805. 861.53 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  19806. 861.53 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19807. 861.53 s [algebraic-graphs] Warning: 'stars' is out of scope.
  19808. 861.53 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19809. 861.53 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  19810. 861.59 s [algebraic-graphs] Warning: 'nub' is out of scope.
  19811. 861.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19812. 861.59 s [algebraic-graphs] Warning: 'sort' is out of scope.
  19813. 861.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19814. 861.59 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  19815. 861.59 s [algebraic-graphs] Missing documentation for:
  19816. 861.59 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  19817. 861.64 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  19818. 861.68 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  19819. 861.71 s [algebraic-graphs]
  19820. 861.71 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [-Wtype-equality-requires-operators]
  19821. 861.71 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19822. 861.71 s [algebraic-graphs] will become an error in a future GHC release.
  19823. 861.71 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19824. 861.71 s [algebraic-graphs] |
  19825. 861.71 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19826. 861.71 s [algebraic-graphs] | ^
  19827. 861.71 s [algebraic-graphs]
  19828. 861.71 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [-Wtype-equality-requires-operators]
  19829. 861.71 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19830. 861.71 s [algebraic-graphs] will become an error in a future GHC release.
  19831. 861.71 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19832. 861.71 s [algebraic-graphs] |
  19833. 861.71 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19834. 861.71 s [algebraic-graphs] | ^
  19835. 861.71 s [algebraic-graphs]
  19836. 861.71 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [-Wtype-equality-requires-operators]
  19837. 861.71 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19838. 861.71 s [algebraic-graphs] will become an error in a future GHC release.
  19839. 861.71 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19840. 861.71 s [algebraic-graphs] |
  19841. 861.71 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19842. 861.71 s [algebraic-graphs] | ^
  19843. 861.71 s [algebraic-graphs]
  19844. 861.71 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [-Wtype-equality-requires-operators]
  19845. 861.71 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19846. 861.71 s [algebraic-graphs] will become an error in a future GHC release.
  19847. 861.71 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19848. 861.71 s [algebraic-graphs] |
  19849. 861.71 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19850. 861.71 s [algebraic-graphs] | ^
  19851. 861.71 s [algebraic-graphs]
  19852. 861.71 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [-Wtype-equality-requires-operators]
  19853. 861.71 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19854. 861.71 s [algebraic-graphs] will become an error in a future GHC release.
  19855. 861.71 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19856. 861.71 s [algebraic-graphs] |
  19857. 861.71 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19858. 861.71 s [algebraic-graphs] | ^
  19859. 861.71 s [algebraic-graphs]
  19860. 861.72 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [-Wtype-equality-requires-operators]
  19861. 861.72 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19862. 861.72 s [algebraic-graphs] will become an error in a future GHC release.
  19863. 861.72 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19864. 861.72 s [algebraic-graphs] |
  19865. 861.72 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19866. 861.72 s [algebraic-graphs] | ^
  19867. 861.72 s [algebraic-graphs]
  19868. 861.72 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [-Wtype-equality-requires-operators]
  19869. 861.72 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19870. 861.72 s [algebraic-graphs] will become an error in a future GHC release.
  19871. 861.72 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19872. 861.72 s [algebraic-graphs] |
  19873. 861.72 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19874. 861.72 s [algebraic-graphs] | ^
  19875. 861.83 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  19876. 861.83 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19877. 861.83 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  19878. 861.89 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  19879. 861.96 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  19880. 861.96 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19881. 861.96 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  19882. 862.04 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  19883. 862.21 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  19884. 862.24 s [algebraic-graphs]
  19885. 862.24 s [algebraic-graphs] src/Algebra/Graph/Labelled.hs:74:10: warning: [-Wredundant-constraints]
  19886. 862.24 s [algebraic-graphs] • Redundant constraint: Eq e
  19887. 862.24 s [algebraic-graphs] • In the instance declaration for ‘Ord (Graph e a)’
  19888. 862.24 s [algebraic-graphs] |
  19889. 862.24 s [algebraic-graphs] 74 | instance (Eq e, Monoid e, Ord a, Ord e) => Ord (Graph e a) where
  19890. 862.24 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  19891. 862.25 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  19892. 862.26 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  19893. 862.28 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  19894. 862.28 s [algebraic-graphs]
  19895. 862.28 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [-Wtype-equality-requires-operators]
  19896. 862.28 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19897. 862.28 s [algebraic-graphs] will become an error in a future GHC release.
  19898. 862.28 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19899. 862.28 s [algebraic-graphs] |
  19900. 862.28 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19901. 862.28 s [algebraic-graphs] | ^
  19902. 862.29 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  19903. 862.29 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19904. 862.29 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  19905. 862.30 s [algebraic-graphs]
  19906. 862.30 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [-Wtype-equality-requires-operators]
  19907. 862.30 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19908. 862.30 s [algebraic-graphs] will become an error in a future GHC release.
  19909. 862.30 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19910. 862.30 s [algebraic-graphs] |
  19911. 862.30 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19912. 862.30 s [algebraic-graphs] | ^
  19913. 862.30 s [algebraic-graphs]
  19914. 862.30 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [-Wtype-equality-requires-operators]
  19915. 862.30 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19916. 862.30 s [algebraic-graphs] will become an error in a future GHC release.
  19917. 862.30 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19918. 862.30 s [algebraic-graphs] |
  19919. 862.30 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19920. 862.30 s [algebraic-graphs] | ^
  19921. 862.34 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  19922. 862.38 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  19923. 862.40 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  19924. 862.40 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19925. 862.40 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  19926. 862.41 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  19927. 862.41 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19928. 862.41 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  19929. 862.42 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  19930. 862.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19931. 862.42 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  19932. 862.43 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  19933. 862.43 s [algebraic-graphs] Missing documentation for:
  19934. 862.43 s [algebraic-graphs] Module header
  19935. 862.43 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  19936. 862.43 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  19937. 862.43 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  19938. 862.43 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  19939. 862.43 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  19940. 862.43 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  19941. 862.43 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  19942. 862.45 s [algebraic-graphs] Warning: 'array' is out of scope.
  19943. 862.45 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  19944. 862.45 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  19945. 862.45 s [algebraic-graphs] Missing documentation for:
  19946. 862.45 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  19947. 862.68 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  19948. 862.68 s [algebraic-graphs]
  19949. 862.68 s [algebraic-graphs] - Algebra.Graph.Labelled.Focus
  19950. 865.54 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/index.html,
  19951. 865.54 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  19952. 865.66 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  19953. 865.66 s [algebraic-graphs] Phase: installPhase
  19954. 865.67 s [algebraic-graphs] Installing library in /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19955. 866.38 s [algebraic-graphs] Phase: fixupPhase
  19956. 866.40 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7
  19957. 866.42 s [algebraic-graphs] shrinking /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSalgebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F-ghc9.4.8.so
  19958. 866.43 s [algebraic-graphs] checking for references to /build/ in /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7...
  19959. 866.48 s [algebraic-graphs] patching script interpreter paths in /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7
  19960. 866.49 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/lib
  19961. 866.76 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/bd0rv8qd20dfba7jwqs33dcw23plc5jq-algebraic-graphs-0.7-doc
  19962. 866.77 s [algebraic-graphs] checking for references to /build/ in /nix/store/bd0rv8qd20dfba7jwqs33dcw23plc5jq-algebraic-graphs-0.7-doc...
  19963. 866.81 s [algebraic-graphs] patching script interpreter paths in /nix/store/bd0rv8qd20dfba7jwqs33dcw23plc5jq-algebraic-graphs-0.7-doc
  19964. 866.96 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7 /nix/store/bd0rv8qd20dfba7jwqs33dcw23plc5jq-algebraic-graphs-0.7-doc
  19965. 867.51 s [post-build-hook] Pushing 2 paths (37 are already present) using zstd to cache sellout ⏳
  19966. 867.51 s [post-build-hook]
  19967. 867.90 s [post-build-hook] Pushing /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7 (24.72 MiB)
  19968. 868.01 s [post-build-hook] Pushing /nix/store/bd0rv8qd20dfba7jwqs33dcw23plc5jq-algebraic-graphs-0.7-doc (11.26 MiB)
  19969. 869.74 s [post-build-hook]
  19970. 869.74 s [post-build-hook] All done.
  19971. 869.76 s [post-build-hook] Uploading to the NixCI cache: /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7 /nix/store/bd0rv8qd20dfba7jwqs33dcw23plc5jq-algebraic-graphs-0.7-doc
  19972. 869.80 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19973. 869.81 s [post-build-hook] copying 2 paths...
  19974. 869.81 s [post-build-hook] copying path '/nix/store/bd0rv8qd20dfba7jwqs33dcw23plc5jq-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  19975. 871.35 s [post-build-hook] copying path '/nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  19976. 876.23 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19977. 876.47 s [post-build-hook] copying 1 paths...
  19978. 876.47 s [post-build-hook] copying path '/nix/store/pkxsn9c82g3jd25gsvx2jpg7w9nl19qf-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  19979. 876.71 s Progress: 6 of 10 built, 152 of 152 downloaded from cache
  19980. 876.77 s Building ghc-9.4.8-with-packages
  19981. 876.84 s [ghc-9.4.8-with-packages] /nix/store/iwqw5xnc7zqlhkh89a1v3r3jmwkfja1c-doctest-0.24.2/nix-support:
  19982. 876.84 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  19983. 876.86 s [ghc-9.4.8-with-packages] /nix/store/aba6vbkwdrz87az76asqhggfn865lfls-ghc-compat-plugin-0.1.0.1/nix-support:
  19984. 876.86 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  19985. 876.86 s [ghc-9.4.8-with-packages] /nix/store/jnriapj24daab47wfpylsbz3sw82mrm5-hedgehog-1.5/nix-support:
  19986. 876.86 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  19987. 876.86 s [ghc-9.4.8-with-packages] /nix/store/jnriapj24daab47wfpylsbz3sw82mrm5-hedgehog-1.5/nix-support:
  19988. 876.86 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  19989. 876.87 s [ghc-9.4.8-with-packages] /nix/store/qwpjg0whfp59bvjbbd3zj7d7av19frrj-Cabal-3.12.1.0/nix-support:
  19990. 876.87 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  19991. 876.90 s [ghc-9.4.8-with-packages] /nix/store/9awxkcf7mf8r2p73q0p3jwkkz5jhxk1j-cabal-doctest-1.0.12/nix-support:
  19992. 876.90 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  19993. 876.92 s [ghc-9.4.8-with-packages] /nix/store/nc67nabvnkd3ax812zzkp7imag2axafb-temporary-1.3/nix-support:
  19994. 876.92 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  19995. 876.92 s [ghc-9.4.8-with-packages] /nix/store/nc67nabvnkd3ax812zzkp7imag2axafb-temporary-1.3/nix-support:
  19996. 876.92 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  19997. 876.92 s [ghc-9.4.8-with-packages] /nix/store/kj3xbib9gbydn80c6pa58jw0diwy299l-ansi-terminal-1.1.3/nix-support:
  19998. 876.92 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  19999. 876.93 s [ghc-9.4.8-with-packages] /nix/store/kj3xbib9gbydn80c6pa58jw0diwy299l-ansi-terminal-1.1.3/nix-support:
  20000. 876.93 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20001. 876.93 s [ghc-9.4.8-with-packages] /nix/store/lnpm1wipjx78xjmaxv1z5j8dd4a1symh-async-2.2.5/nix-support:
  20002. 876.93 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20003. 876.93 s [ghc-9.4.8-with-packages] /nix/store/lnpm1wipjx78xjmaxv1z5j8dd4a1symh-async-2.2.5/nix-support:
  20004. 876.93 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20005. 876.93 s [ghc-9.4.8-with-packages] /nix/store/ma738ihzlsdhviinksypvlawhgvm4l27-barbies-2.1.1.0/nix-support:
  20006. 876.93 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20007. 876.94 s [ghc-9.4.8-with-packages] /nix/store/ma738ihzlsdhviinksypvlawhgvm4l27-barbies-2.1.1.0/nix-support:
  20008. 876.94 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20009. 876.94 s [ghc-9.4.8-with-packages] /nix/store/742z4r79i4qmrvya67kiqhl548nzdf3m-concurrent-output-1.10.21/nix-support:
  20010. 876.94 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20011. 876.95 s [ghc-9.4.8-with-packages] /nix/store/742z4r79i4qmrvya67kiqhl548nzdf3m-concurrent-output-1.10.21/nix-support:
  20012. 876.95 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20013. 876.95 s [ghc-9.4.8-with-packages] /nix/store/i4ldl1p4vwmpp2wbgi8wdhnff23s8qa5-lifted-async-0.10.2.7/nix-support:
  20014. 876.95 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20015. 876.95 s [ghc-9.4.8-with-packages] /nix/store/i4ldl1p4vwmpp2wbgi8wdhnff23s8qa5-lifted-async-0.10.2.7/nix-support:
  20016. 876.95 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20017. 876.95 s [ghc-9.4.8-with-packages] /nix/store/gw4glgrkcallqjhqkdl05n6mgi5i6hrl-mmorph-1.2.1/nix-support:
  20018. 876.95 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20019. 876.96 s [ghc-9.4.8-with-packages] /nix/store/gw4glgrkcallqjhqkdl05n6mgi5i6hrl-mmorph-1.2.1/nix-support:
  20020. 876.96 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20021. 876.96 s [ghc-9.4.8-with-packages] /nix/store/vr4aizxdpc8ac8lgnznvgv4wrj6m1966-monad-control-1.0.3.1/nix-support:
  20022. 876.96 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20023. 876.96 s [ghc-9.4.8-with-packages] /nix/store/vr4aizxdpc8ac8lgnznvgv4wrj6m1966-monad-control-1.0.3.1/nix-support:
  20024. 876.96 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20025. 876.96 s [ghc-9.4.8-with-packages] /nix/store/sv8ac9brw0kq58zasvn25kb01wmvg3hg-pretty-show-1.10/nix-support:
  20026. 876.96 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20027. 876.96 s [ghc-9.4.8-with-packages] /nix/store/sv8ac9brw0kq58zasvn25kb01wmvg3hg-pretty-show-1.10/nix-support:
  20028. 876.96 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20029. 876.96 s [ghc-9.4.8-with-packages] /nix/store/ii90bl7i0ixvvyynac5mca5f5j7f0a9r-primitive-0.9.1.0/nix-support:
  20030. 876.96 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20031. 876.97 s [ghc-9.4.8-with-packages] /nix/store/ii90bl7i0ixvvyynac5mca5f5j7f0a9r-primitive-0.9.1.0/nix-support:
  20032. 876.97 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20033. 876.97 s [ghc-9.4.8-with-packages] /nix/store/zgrpvklwnz2bmffl035si31i2ccw75yq-random-1.2.1.3/nix-support:
  20034. 876.97 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20035. 876.97 s [ghc-9.4.8-with-packages] /nix/store/zgrpvklwnz2bmffl035si31i2ccw75yq-random-1.2.1.3/nix-support:
  20036. 876.97 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20037. 876.97 s [ghc-9.4.8-with-packages] /nix/store/0ibwnsmddvmk8x5iay5xxj7ajf0mdgcb-resourcet-1.3.0/nix-support:
  20038. 876.97 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20039. 876.98 s [ghc-9.4.8-with-packages] /nix/store/0ibwnsmddvmk8x5iay5xxj7ajf0mdgcb-resourcet-1.3.0/nix-support:
  20040. 876.98 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20041. 876.98 s [ghc-9.4.8-with-packages] /nix/store/fikzg289cm63ny4j3f9rsijf0bvf28nw-safe-exceptions-0.1.7.4/nix-support:
  20042. 876.98 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20043. 876.98 s [ghc-9.4.8-with-packages] /nix/store/fikzg289cm63ny4j3f9rsijf0bvf28nw-safe-exceptions-0.1.7.4/nix-support:
  20044. 876.98 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20045. 876.98 s [ghc-9.4.8-with-packages] /nix/store/ivxwj8agwmpzhd6izc4x43a1axi6w5d4-transformers-base-0.4.6/nix-support:
  20046. 876.98 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20047. 876.98 s [ghc-9.4.8-with-packages] /nix/store/ivxwj8agwmpzhd6izc4x43a1axi6w5d4-transformers-base-0.4.6/nix-support:
  20048. 876.98 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20049. 876.99 s [ghc-9.4.8-with-packages] /nix/store/nl85bjrjxv9j580rbljrxh93zzfbd108-wl-pprint-annotated-0.1.0.1/nix-support:
  20050. 876.99 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20051. 876.99 s [ghc-9.4.8-with-packages] /nix/store/nl85bjrjxv9j580rbljrxh93zzfbd108-wl-pprint-annotated-0.1.0.1/nix-support:
  20052. 876.99 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20053. 876.99 s [ghc-9.4.8-with-packages] /nix/store/xmpz5r3lk1rxsgyk6y46s2w58ampfr5g-Cabal-syntax-3.12.1.0/nix-support:
  20054. 876.99 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20055. 877.01 s [ghc-9.4.8-with-packages] /nix/store/xmpz5r3lk1rxsgyk6y46s2w58ampfr5g-Cabal-syntax-3.12.1.0/nix-support:
  20056. 877.01 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20057. 877.02 s [ghc-9.4.8-with-packages] /nix/store/ia9jprsrywhzs37iqjcz1pn2iy58y4lw-ansi-terminal-types-1.1.3/nix-support:
  20058. 877.02 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20059. 877.03 s [ghc-9.4.8-with-packages] /nix/store/ia9jprsrywhzs37iqjcz1pn2iy58y4lw-ansi-terminal-types-1.1.3/nix-support:
  20060. 877.03 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20061. 877.04 s [ghc-9.4.8-with-packages] /nix/store/35lsnsldhvy7y1i21v86kns2ah0hx72c-hashable-1.4.7.0/nix-support:
  20062. 877.04 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20063. 877.04 s [ghc-9.4.8-with-packages] /nix/store/35lsnsldhvy7y1i21v86kns2ah0hx72c-hashable-1.4.7.0/nix-support:
  20064. 877.04 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20065. 877.04 s [ghc-9.4.8-with-packages] /nix/store/zcdz6f0k3aa1j82s8p0prglf1929dqs0-distributive-0.6.2.1/nix-support:
  20066. 877.04 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20067. 877.04 s [ghc-9.4.8-with-packages] /nix/store/zcdz6f0k3aa1j82s8p0prglf1929dqs0-distributive-0.6.2.1/nix-support:
  20068. 877.04 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20069. 877.05 s [ghc-9.4.8-with-packages] /nix/store/d3x3gda2rr1kw1a43zw8nxdk895k4hsi-constraints-0.14.2/nix-support:
  20070. 877.05 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20071. 877.05 s [ghc-9.4.8-with-packages] /nix/store/d3x3gda2rr1kw1a43zw8nxdk895k4hsi-constraints-0.14.2/nix-support:
  20072. 877.05 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20073. 877.06 s [ghc-9.4.8-with-packages] /nix/store/w5z12hdpc93yhrvj7ifvf6rgzh1ljbik-lifted-base-0.2.3.12/nix-support:
  20074. 877.06 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20075. 877.06 s [ghc-9.4.8-with-packages] /nix/store/w5z12hdpc93yhrvj7ifvf6rgzh1ljbik-lifted-base-0.2.3.12/nix-support:
  20076. 877.06 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20077. 877.06 s [ghc-9.4.8-with-packages] /nix/store/j0ff9h4skzj85n7gyq8s7155g6fakm9b-transformers-compat-0.7.2/nix-support:
  20078. 877.06 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20079. 877.07 s [ghc-9.4.8-with-packages] /nix/store/j0ff9h4skzj85n7gyq8s7155g6fakm9b-transformers-compat-0.7.2/nix-support:
  20080. 877.07 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20081. 877.07 s [ghc-9.4.8-with-packages] /nix/store/wjm51pw64gsp5q0hq4yvs22agi7in0c7-splitmix-0.1.3.1/nix-support:
  20082. 877.07 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20083. 877.08 s [ghc-9.4.8-with-packages] /nix/store/wjm51pw64gsp5q0hq4yvs22agi7in0c7-splitmix-0.1.3.1/nix-support:
  20084. 877.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20085. 877.08 s [ghc-9.4.8-with-packages] /nix/store/mdd2swfjg0d2sr8jmq1dq0bz8hr97g8d-unliftio-core-0.2.1.0/nix-support:
  20086. 877.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20087. 877.08 s [ghc-9.4.8-with-packages] /nix/store/mdd2swfjg0d2sr8jmq1dq0bz8hr97g8d-unliftio-core-0.2.1.0/nix-support:
  20088. 877.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20089. 877.08 s [ghc-9.4.8-with-packages] /nix/store/jz7zl0maj20ixq8xrm6xp8vlylbvf4g0-base-orphans-0.9.3/nix-support:
  20090. 877.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20091. 877.09 s [ghc-9.4.8-with-packages] /nix/store/jz7zl0maj20ixq8xrm6xp8vlylbvf4g0-base-orphans-0.9.3/nix-support:
  20092. 877.09 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20093. 877.09 s [ghc-9.4.8-with-packages] /nix/store/qgxv995bh9irf0jg9miqsrx61glq39zq-os-string-2.0.8/nix-support:
  20094. 877.09 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20095. 877.09 s [ghc-9.4.8-with-packages] /nix/store/qgxv995bh9irf0jg9miqsrx61glq39zq-os-string-2.0.8/nix-support:
  20096. 877.09 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20097. 877.10 s [ghc-9.4.8-with-packages] /nix/store/w021h6br7mi8p3npc0b1p0aq79gb02sb-tagged-0.8.9/nix-support:
  20098. 877.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20099. 877.10 s [ghc-9.4.8-with-packages] /nix/store/w021h6br7mi8p3npc0b1p0aq79gb02sb-tagged-0.8.9/nix-support:
  20100. 877.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20101. 877.10 s [ghc-9.4.8-with-packages] /nix/store/9bswyvp3x7ifdb7n4r6xsa7hg70lrd6s-boring-0.2.2/nix-support:
  20102. 877.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20103. 877.10 s [ghc-9.4.8-with-packages] /nix/store/9bswyvp3x7ifdb7n4r6xsa7hg70lrd6s-boring-0.2.2/nix-support:
  20104. 877.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4asr4dcyl5y2ymb38clx5x5fm7cdmp1i-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  20105. 877.74 s [ghc-9.4.8-with-packages] Warning: haddock-interfaces: /nix/store/jnriapj24daab47wfpylsbz3sw82mrm5-hedgehog-1.5/share/doc/x86_64-linux-ghc-9.4.8/hedgehog-1.5/html/hedgehog.haddock doesn't exist or isn't a file
  20106. 877.74 s [ghc-9.4.8-with-packages] Warning: haddock-html: /nix/store/jnriapj24daab47wfpylsbz3sw82mrm5-hedgehog-1.5/share/doc/x86_64-linux-ghc-9.4.8/hedgehog-1.5/html doesn't exist or isn't a directory
  20107. 878.70 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/s9gb9l49gyan7rrbq504iq6jsy4cyb86-ghc-9.4.8-with-packages
  20108. 879.33 s [post-build-hook] Pushing 1 paths (120 are already present) using zstd to cache sellout ⏳
  20109. 879.33 s [post-build-hook]
  20110. 879.83 s [post-build-hook] Pushing /nix/store/s9gb9l49gyan7rrbq504iq6jsy4cyb86-ghc-9.4.8-with-packages (4.85 MiB)
  20111. 881.48 s [post-build-hook]
  20112. 881.48 s [post-build-hook] All done.
  20113. 881.50 s [post-build-hook] Uploading to the NixCI cache: /nix/store/s9gb9l49gyan7rrbq504iq6jsy4cyb86-ghc-9.4.8-with-packages
  20114. 881.58 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  20115. 881.75 s [post-build-hook] copying 1 paths...
  20116. 881.75 s [post-build-hook] copying path '/nix/store/s9gb9l49gyan7rrbq504iq6jsy4cyb86-ghc-9.4.8-with-packages' to 'https://cache.nix-ci.com'...
  20117. 882.80 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  20118. 883.08 s [post-build-hook] copying 1 paths...
  20119. 883.08 s [post-build-hook] copying path '/nix/store/dd9qk6kzaqmn8f762yqlxyzrvpzzisds-ghc-9.4.8-with-packages.drv' to 'https://cache.nix-ci.com'...
  20120. 883.31 s Progress: 7 of 9 built, 152 of 152 downloaded from cache
  20121. 883.40 s Building ghc-shell-for-packages
  20122. 883.52 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/6kln287kdq0aa7i4baxk2a23kz5fh21l-ghc-shell-for-packages-0
  20123. 884.15 s [post-build-hook] Pushing 1 paths (322 are already present) using zstd to cache sellout ⏳
  20124. 884.15 s [post-build-hook]
  20125. 884.56 s [post-build-hook] Pushing /nix/store/6kln287kdq0aa7i4baxk2a23kz5fh21l-ghc-shell-for-packages-0 (256.00 B)
  20126. 885.55 s [post-build-hook]
  20127. 885.55 s [post-build-hook] All done.
  20128. 885.57 s [post-build-hook] Uploading to the NixCI cache: /nix/store/6kln287kdq0aa7i4baxk2a23kz5fh21l-ghc-shell-for-packages-0
  20129. 885.64 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  20130. 885.68 s [post-build-hook] copying 1 paths...
  20131. 885.68 s [post-build-hook] copying path '/nix/store/6kln287kdq0aa7i4baxk2a23kz5fh21l-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
  20132. 886.04 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  20133. 886.37 s [post-build-hook] copying 1 paths...
  20134. 886.37 s [post-build-hook] copying path '/nix/store/brdmmm2i6z0j22jd9sfgrh1pkpx6b5z9-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
  20135. 886.60 s Progress: 8 of 9 built, 152 of 152 downloaded from cache
Tail Raw Logs